DS Multiple Choice Questions Answers pdf, Data Structure Interview Questions and Answers for freshers and experienced pdf
1. Which data structure allows deleting data elements from front and inserting at rear?
2. Identify the data structure which allows deletions at both ends of the list but insertion at only one end.
3. Which of the following data structure is non-linear type?
4. Which of the following data structure is linear type?
5. To represent hierarchical relationship between elements, which data structure is suitable?
6. A binary tree whose every node has either zero or two children is called
7. The depth of a complete binary tree is given by
8. When representing any algebraic expression E which uses only binary operations in a 2-tree,
9. A binary tree can easily be converted into q 2-tree
10. When converting binary tree into extended binary tree, all the original nodes in binary tree are
11. The post order traversal of a binary tree is DEBFCA. Find out the pre order traversal
12. Which of the following sorting algorithm is of divide-and-conquer type?
13. An algorithm that calls itself directly or indirectly is known as
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
15. The in order traversal of tree will yield a sorted listing of elements of tree in
16. In a Heap tree
17. In a graph if e=[u, v], Then u and v are called
18. A connected graph T without any cycles is called
19. In a graph if e=(u, v) means
20. If every node u in G is adjacent to every other node v in G, A graph is said to be
More DS Interview Questions and Answers: Click Here
More DS Multiple Choice Questions & Answers: Click Here
21. Two main measures for the efficiency of an algorithm are
22. The time factor when determining the efficiency of algorithm is measured by
23. The space factor when determining the efficiency of algorithm is measured by
24. Which of the following case does not exist in complexity theory
25. The Worst case occur in linear search algorithm when
26. The Average case occur in linear search algorithm
27. The complexity of the average case of an algorithm is
28. The complexity of linear search algorithm is
29. The complexity of Binary search algorithm is
30. The complexity of Bubble sort algorithm is
31. In linked lists there are noNULL links in:
32. In a Stack the com mand to access nth ele ment from the top of the stack s will be
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
34. In a bal ance binary tree the height of two sub trees of every node can not dif fer by more than
35. The result of eval u at ing pre fix expres sion */b+-dacd, where a = 3, b = 6, c = 1, d = 5 is
36. In an array rep re sen ta tion of binary tree the right child of root will be at location of
37. The total number of com parisons in a bubble sort is
38. The dummy header in linked list contain
39. Write the out put of the fol low ing pro gram: int a[] = {1,2,3}*P;
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
More DS Interview Questions and Answers: Click Here
More DS Multiple Choice Questions & Answers: Click Here
1. Which data structure allows deleting data elements from front and inserting at rear?
2. Identify the data structure which allows deletions at both ends of the list but insertion at only one end.
3. Which of the following data structure is non-linear type?
4. Which of the following data structure is linear type?
5. To represent hierarchical relationship between elements, which data structure is suitable?
6. A binary tree whose every node has either zero or two children is called
7. The depth of a complete binary tree is given by
8. When representing any algebraic expression E which uses only binary operations in a 2-tree,
9. A binary tree can easily be converted into q 2-tree
10. When converting binary tree into extended binary tree, all the original nodes in binary tree are
11. The post order traversal of a binary tree is DEBFCA. Find out the pre order traversal
12. Which of the following sorting algorithm is of divide-and-conquer type?
13. An algorithm that calls itself directly or indirectly is known as
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
15. The in order traversal of tree will yield a sorted listing of elements of tree in
16. In a Heap tree
17. In a graph if e=[u, v], Then u and v are called
18. A connected graph T without any cycles is called
19. In a graph if e=(u, v) means
20. If every node u in G is adjacent to every other node v in G, A graph is said to be
More DS Interview Questions and Answers: Click Here
More DS Multiple Choice Questions & Answers: Click Here
21. Two main measures for the efficiency of an algorithm are
22. The time factor when determining the efficiency of algorithm is measured by
23. The space factor when determining the efficiency of algorithm is measured by
24. Which of the following case does not exist in complexity theory
25. The Worst case occur in linear search algorithm when
26. The Average case occur in linear search algorithm
27. The complexity of the average case of an algorithm is
28. The complexity of linear search algorithm is
29. The complexity of Binary search algorithm is
30. The complexity of Bubble sort algorithm is
31. In linked lists there are noNULL links in:
32. In a Stack the com mand to access nth ele ment from the top of the stack s will be
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
34. In a bal ance binary tree the height of two sub trees of every node can not dif fer by more than
35. The result of eval u at ing pre fix expres sion */b+-dacd, where a = 3, b = 6, c = 1, d = 5 is
36. In an array rep re sen ta tion of binary tree the right child of root will be at location of
37. The total number of com parisons in a bubble sort is
38. The dummy header in linked list contain
39. Write the out put of the fol low ing pro gram: int a[] = {1,2,3}*P;
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
More DS Interview Questions and Answers: Click Here
More DS Multiple Choice Questions & Answers: Click Here
No comments:
Post a Comment