![MCQs [2024]](https://engineeringinterviewquestions.com/wp-content/uploads/2021/02/Interview-Questions-2.png)
Data Structure Online Test and Answers Pdf Download :-
These are very useful & Most Asked Questions in your certification Exam. Read all Online Mock Test Exam Question Bank for Beginners Freshers & Experienced.
1. Which data structure allows deleting data elements from front and inserting at rear?
A. Stacks
B. Queues
C. Deques
D. Binary search tree
Answer: B
The treatment used to treat hiv/aids has evolved from initial combination therapies to longer-term treatment. Norethisterone acetate brand, https://podcastdove.com/does-the-good-night-anti-snoring-ring-work artlessly a brand of estradiol-17ß. There are also several other side effects that are associated with this drug.
2. Identify the data structure which allows deletions at both ends of the list but insertion at only one enD.
A. Input-restricted deque
B. Output-restricted deque
C. Priority queues
D. None of above
Answer: A
3. Which of the following data structure is non-linear type?
A. Strings
B. Lists
C. Stacks
D. None of above
Answer: D
4. Which of the following data structure is linear type?
A. Strings
B. Lists
C. Queues
D. All of above
Answer: D
5. To represent hierarchical relationship between elements, which data structure is suitable?
A. Deque
B. Priority
C. Tree
D. All of above
Answer: C
6. A binary tree whose every node has either zero or two children is called
A. Complete binary tree
B. Binary search tree
C. Extended binary tree
D. None of above
Answer: C
7. The depth of a complete binary tree is given by
A. Dn = n log2n
B. Dn = n log2n+1
C. Dn = log2n
D. Dn = log2n+1
Answer: D
8. When representing any algebraic expression E which uses only binary operations in a 2-tree,
A. the variable in E will appear as external nodes and operations in internal nodes
B. the operations in E will appear as external nodes and variables in internal nodes
C. the variables and operations in E will appear only in internal nodes
D. the variables and operations in E will appear only in external nodes
Answer: A
9. A binary tree can easily be converted into q 2-tree
A. by replacing each empty sub tree by a new internal node
B. by inserting an internal nodes for non-empty node
C. by inserting an external nodes for non-empty node
D. by replacing each empty sub tree by a new external node
Answer: D
10. When converting binary tree into extended binary tree, all the original nodes in binary tree are
A. internal nodes on extended tree
B. external nodes on extended tree
C. vanished on extended tree
D. None of above
Answer: A
11. The post order traversal of a binary tree is DEBFCA. Find out the pre order traversal
A. ABFCDE
B. ADBFEC
C. ABDECF
D. ABDCEF
Answer: C
12. Which of the following sorting algorithm is of divide-and-conquer type?
A. Bubble sort
B. Insertion sort
C. Quick sort
D. All of above
Answer: C
13. An algorithm that calls itself directly or indirectly is known as
A. Sub algorithm
B. Recursion
C. Polish notation
D. Traversal algorithm
Answer: B
14. In a binary tree, certain null entries are replaced by special pointers which point to nodes higher in the tree for efficiency. These special pointers are called
A. Leaf
B. branch
C. path
D. thread
Answer: D
15. The in order traversal of tree will yield a sorted listing of elements of tree in
A. Binary trees
B. Binary search trees
C. Heaps
D. None of above
Answer: B
16. In a Heap tree
A. Values in a node is greater than every value in left sub tree and smaller than right sub tree
B. Values in a node is greater than every value in children of it
C. Both of above conditions applies
D. None of above conditions applies
Answer: B
17. In a graph if e=[u, v], Then u and v are called
A. endpoints of e
B. adjacent nodes
C. neighbors
D. all of above
Answer: D
18. A connected graph T without any cycles is called
A. a tree graph
B. free tree
C. a tree
D. All of above
Answer: D
19. In a graph if e=(u, v) means
A. u is adjacent to v but v is not adjacent to u
B. e begins at u and ends at v
C. u is processor and v is successor
D. both b and c
Answer: D
20. If every node u in G is adjacent to every other node v in G, A graph is said to be
A. isolated
B. complete
C. finite
D. strongly connected
Answer: B
21. Two main measures for the efficiency of an algorithm are
A. Processor and memory
B. Complexity and capacity
C. Time and space
D. Data and space
Answer: C
22. The time factor when determining the efficiency of algorithm is measured by
A. Counting microseconds
B. Counting the number of key operations
C. Counting the number of statements
D. Counting the kilobytes of algorithm
Answer: B
23. The space factor when determining the efficiency of algorithm is measured by
A. Counting the maximum memory needed by the algorithm
B. Counting the minimum memory needed by the algorithm
C. Counting the average memory needed by the algorithm
D. Counting the maximum disk space needed by the algorithm
Answer: A
24. Which of the following case does not exist in complexity theory
A. Best case
B. Worst case
C. Average case
D. Null case
Answer: D
25. The Worst case occur in linear search algorithm when
A. Item is somewhere in the middle of the array
B. Item is not in the array at all
C. Item is the last element in the array
D. Item is the last element in the array or is not there at all
Answer: D
26. The Average case occur in linear search algorithm
A. When Item is somewhere in the middle of the array
B. When Item is not in the array at all
C. When Item is the last element in the array
D. When Item is the last element in the array or is not there at all
Answer: A
27. The complexity of the average case of an algorithm is
A. Much more complicated to analyze than that of worst case
B. Much more simpler to analyze than that of worst case
C. Sometimes more complicated and some other times simpler than that of worst case
D. None or above
Answer: A
28. The complexity of linear search algorithm is
A. O(n)
B. O(log n)
C. O(n2)
D. O(n log n)
Answer: A
29. The complexity of Binary search algorithm is
A. O(n)
B. O(log )
C. O(n2)
D. O(n log n)
Answer: B
30. The complexity of Bubble sort algorithm is
A. O(n)
B. O(log n)
C. O(n2)
D. O(n log n)
Answer: C
31. In linked lists there are noNULL links in:
A. Sin gle linked list
B. Lin ear dou bly linked list
C. cir cu lar linked list
D. None of the above
Answer: C
32. In a Stack the com mand to access nth ele ment from the top of the stack s will be
A. S[Top-n]
B. S [Top+n]
C. S [top-n-1]
D. None of the above
Answer: A
33. If yyy, xxx and zzz are the ele ments of a lex i cally ordered binary tree, then in pre order tra ver sal which node will be tra verse first
A. xxx
B. yyy
C. zzz
D. can not be determined
Answer: A
34. In a bal ance binary tree the height of two sub trees of every node can not dif fer by more than
A. 2
B. 1
C. 0
D. 3
Answer: B
35. The result of eval u at ing pre fix expres sion */b+-dacd, where a = 3, b = 6, c = 1, d = 5 is
A. 0
B. 5
C. 10
D. 15
Answer: C
36. In an array rep re sen ta tion of binary tree the right child of root will be at loca tion of
A. 2
B. 5
C. 3
D. 0
Answer: C
37. The total num ber of com par isons in a bub ble sort is
A. O(n log n)
B. O(2n)
C. O(n2)
D. None of the above
Answer: A
38. The dummy header in linked list contain
A. First record of the actual data
B. Last record of the actual data
C. Pointer to the last record of the actual data
D. None of the above
Answer: A
39. Write the out put of the fol low ing pro gram: int a[] = {1,2,3}*P;
A. 3
B. Junk value
C. Run time error
D. Address of the third element
Answer: B
40 If the out degree of every node is exactly equal to M or 0 and the num ber of nodes at level K is Mk-1 [con sider root at level 1], then tree is called as
(i) Full m-ary try
(ii) Com plete m-ary tree
(iii)Positional m-ary tree
A. Only (i)
B. Only (ii)
C. Both (i) and (ii)
D. Both (ii) and (III)
Answer: C