MSBTE 2022
(DSU) DATA STRUCTURE USING ‘C’ (22317) (C3I)
1) What is another name for the circular queue among the following options?
C. Ring buffer
2) If the elements ‘1’, ‘2’, ‘3’ and ‘4’ are inserted in a queue, what would be the order for the removal?
A. 1234
3) A list of elements in which enqueue operation takes place from one end, and dequeue operation takes
place from one end is__
C. Queue
4) Which of the following principles does Queue use?
B. FIFO principle
5) Which one of the following is not the type of the Queue?
D. Single ended Queue
6) Which one of the following is the overflow condition if the linear queue is implemented using an array
with a size MAX_SIZE?
C. rear=MAX_SIZE -1
7) Which one of the following is the overflow condition if a circular queue is implemented using an array
having size MAX?
C. front=(rear+1) mod max
8) The time complexity of enqueue operation in Queue is __
A. O(1)
9) Which of the following determines the need for the Circular Queue?
A. Avoid wastage of memory
10) Which one of the following is the correct way to increment the rear end in a circular queue?
B. (rear+1) % max
11) Which operation does the above code perform?
D. Both b and c
12) Which of the following data structures allows you to insert the elements from both the ends while
deleting from only one end?
B. Output-restricted queue/deque
13) Application of Stack
D. Both (b) & (c)
14) Application of Queue
D. Both (a) & (b)
15) Example of Linear data structure
D. Both (a) & (b)
16) Example of Non-linear data structure
D. Both (b) & (c)
17) A data structure in which all data elements are stored in a sequence is known as linear data structure.
A. True
18) A data structure in which all data elements are not stored in a sequence is known as a non-linear data
structure.
A. True
19) In Linear data structure All elements are stored in non-contiguous memory locations inside memory.
B. False
20) In Non-linear data structure All elements may stored in contiguous memory locations inside memory
B. False
21) Indegree of node is the number of edges coming towards a specified node i.e. number of edges that
have that specified node as the head is known as indegree of a node.
A. True
22) Outdegree of node is number of edged going out from a specified node i.e. number of edges that have
that specified node as the tail is known as outdegree of a node
A. True
23) Binary search is efficient for the Smaller array.
B. False
24) Linear search is efficient for the larger array.
B. False
25) Algorithm is a stepwise set of instructions written to perform a specific task
A. True
26) A node without any child node is called as leaf node
A. True
27) Stack is a data structure in which insertion and deletion operations are performed at the different ends.
B. False
28) Queue is a data structure in which insertion and deletion operations are performed at the same ends.
B. False
29) In stack an element inserted last is deleted first so it is called Last In First Out list.
A. True
30) In Queue an element inserted first is deleted first so it is called First In First Out list.
A. True
1) How can we describe an array in the best possible way?
C. Container that stores the elements of similar types
2) Which of the following is the correct way of declaring an array?
A. int javatpoint[10];
3) How can we initialize an array in C language?
C. int arr[2] = {10, 20}
4) Which of the following is the advantage of the array data structure?
B. Easier to access the elements in an array
5) Which of the following highly uses the concept of an array?
C. Spatial locality
6) Which of the following is the disadvantage of the array?
C. Wastage of memory if the elements inserted in an array are lesser than the allocated size
8) Which one of the following is the size of int arr[9] assuming that int is 4 bytes?-=-
B. 36
9) Which one of the following is the process of inserting an element in the stack?
C. Push
10) When the user tries to delete the element from the empty stack then the condition is said to be a_
A. Underflow
11) If the size of the stack is 10 and we try to add the 11th element in the stack then the condition is known
as___
C. Overflow
12) Which one of the following is not the application of the stack data structure
D. Asynchronous data transfer
13) Which one of the following nodes is considered the top of the stack if the stack is implemented using
the linked list?
A. First node
14) What would be the maximum value of the top that does not cause the overflow of the stack?
D. 10
15) State operations that can be performed on data structure
(All)
A. (a) Inserting:
B. (b) Deleting
C. (c) Searching
D. (d) Sorting
16) Different types of trees?
(All)
A. AVL tree
B. Binary Tree
C. Binary Search Tree
17) Different types of graphs are?
B. Directed graphs
C. Undirected graphs
18) Enlist queue operation condition
A. Queue Empty
B. Queue Full
19) Applications of queue.
(all)
A. Used for CPU scheduling in multiprogramming and time sharing systems.
B. It is used as buffers on MP3 players
C. Handling of interrupts in real-time systems
D. Simulation
20) When a stack is full and push operation is performed to insert a new element, stack is said to be in
overflow state
A. True
21) When there is no element in a stack (stack empty) and pop operation is called then stack is said to
underflow state
A. True
22) Number of edges coming towards node is out-degree of node
B. False
23) Number of edges going out from the node is the In-degree of the node.
B. False
24) A directed graph is defined as the set of ordered pair of vertices and edges where each connected edge
has not assigned a direction
B. False
25) An undirected graph G is a graph in which each edge e is assigned a direction.
B. False
26) Front end is used to insert an element from queue
B. False
27) Rear end is used to delete an element in queue
B. False
28) Tree is a special form of graph i.e. minimally connected graph and having only one path between any
two vertices.
True
29) In graph there can be more than one path i.e. graph can have unidirectional or bidirectional paths
(edges) between nodes
A. True
30) Tree is a special case of graph having no loops, no circuits and no self-loops
A. True
✓$UMIT USHIR
