80 top Data Structures multiple choice questions and answers for freshers and experienced pdf free download
1. The memory address of the first element of an array is called
2. The memory address of fifth element of an array can be calculated by the formula
3. Which of the following data structures are indexed structures?
4. Which of the following is not the required condition for binary search algorithm?
5. Which of the following is not a limitation of binary search algorithm?
6. Two dimensional arrays are also called________ .
7. A variable P is called pointer if
8. Which of the following data structure can't store the non-homogeneous data elements?
9. Which of the following data structure store the homogeneous data elements?
10. Each data item in a record may be a group item composed of sub-items; those items which are in decomposable are called
11. The difference between linear array and a record is
12. Which of the following statement is false?
13. Binary search algorithm can not be applied to
14. When new data are to be inserted into a data structure, but there is no available space; this situation is usually called
15. The situation when in a linked list START=NULL is
16. Which of the following is two way list?
17. Which of the following name does not relate to stacks?
18. The term "push" and "pop" is related to the
19. A data structure where elements can be added or removed at either end but not in the middle
20. When in order traversing a tree resulted E A C K F H D B G; the preorder traversal would return
21. Which data structure allows deleting data elements from front and inserting at rear?
22. Identify the data structure which allows deletions at both ends of the list but insertion at only one end.
23. Which of the following data structure is non-linear type?
24. Which of the following data structure is linear type?
25. To represent hierarchical relationship between elements, which data structure is suitable?
26. A binary tree whose every node has either zero or two children is called
27. The depth of a complete binary tree is given by
28. When representing any algebraic expression E which uses only binary operations in a 2-tree,
29. A binary tree can easily be converted into q 2-tree
30. When converting binary tree into extended binary tree, all the original nodes in binary tree are
31. The post order traversal of a binary tree is DEBFCA. Find out the pre order traversal
32. Which of the following sorting algorithm is of divide-and-conquer type?
33. An algorithm that calls itself directly or indirectly is known as
34. 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
35. The in order traversal of tree will yield a sorted listing of elements of tree in
36. In a Heap tree
37. In a graph if e=[u, v], Then u and v are called
38. A connected graph T without any cycles is called
39. In a graph if e=(u, v) means
40. If every node u in G is adjacent to every other node v in G, A graph is said to be
41. Two main measures for the efficiency of an algorithm are
42. The time factor when determining the efficiency of algorithm is measured by
43. The space factor when determining the efficiency of algorithm is measured by
44. Which of the following case does not exist in complexity theory
45. The Worst case occur in linear search algorithm when
46. The Average case occur in linear search algorithm
47. The complexity of the average case of an algorithm is
48. The complexity of linear search algorithm is
49. The complexity of Binary search algorithm is
50. The complexity of Bubble sort algorithm is
51. The complexity of merge sort algorithm is
52. The indirect change of the values of a variable in one module by another module is called
53. Which of the following data structure is not linear data structure?
54. On which principle does stack work?
55. The operation of processing each element in the list is known as
56. Finding the location of the element with a given value is:
57. Arrays are best data structures
58. Linked lists are best suited
59. Each array declaration need not give, implicitly or explicitly, the information about
60. The elements of an array are stored successively in memory cells because
61. Value of the first linked list index is _______
62. A linked list index is ____ that represents the position of a node in a linked list.
63. Why is the constructor of the QueueLinkedList class empty?
64. _______ form of access is used to add and remove nodes from a queue
65. ______ form of access is used to add and remove nodes from a stack
66. New nodes are added to the _____ of the queue.
67. A _______ is a data structure that organizes data similar to a line in the supermarket, where the first one in line is the first one out.
68. In an array queue, data is stored in an _____ element.
69. The pop() member function determines if the stack is empty by calling the _____ member function
70. What happens when you push a new node onto a stack?
71. _____________ Memory is Volatile.
72. An _________ data type is a keyword of a programming language that specifies the amount ofmemory needed to store data and the kind of data that will be stored in that memory location
73. Which of the following abstract data types are NOT used by Integer Abstract Data type group?
74. The hash String() member function is called by other member functions of the Hashtable class whenever a function needs to convert a ________________
75. An application iterates the hashtable by calling the ______ and ______ member functions
76. The java.util package contains two classes that are designed to work with hashtables. They are _______ and _________.
77. Data members of the Hashtable class stored in the private access specifier
78. _____ is the common programming technique used for hashing in all hashing functions
79. If the depth of a tree is 3 levels, then what is the Size of the Tree?
80. DeleteNode() function requires the _____ of the data element of the node that is being removed
1. The memory address of the first element of an array is called
2. The memory address of fifth element of an array can be calculated by the formula
3. Which of the following data structures are indexed structures?
4. Which of the following is not the required condition for binary search algorithm?
5. Which of the following is not a limitation of binary search algorithm?
6. Two dimensional arrays are also called________ .
7. A variable P is called pointer if
8. Which of the following data structure can't store the non-homogeneous data elements?
9. Which of the following data structure store the homogeneous data elements?
10. Each data item in a record may be a group item composed of sub-items; those items which are in decomposable are called
11. The difference between linear array and a record is
12. Which of the following statement is false?
13. Binary search algorithm can not be applied to
14. When new data are to be inserted into a data structure, but there is no available space; this situation is usually called
15. The situation when in a linked list START=NULL is
16. Which of the following is two way list?
17. Which of the following name does not relate to stacks?
18. The term "push" and "pop" is related to the
19. A data structure where elements can be added or removed at either end but not in the middle
20. When in order traversing a tree resulted E A C K F H D B G; the preorder traversal would return
21. Which data structure allows deleting data elements from front and inserting at rear?
22. Identify the data structure which allows deletions at both ends of the list but insertion at only one end.
23. Which of the following data structure is non-linear type?
24. Which of the following data structure is linear type?
25. To represent hierarchical relationship between elements, which data structure is suitable?
26. A binary tree whose every node has either zero or two children is called
27. The depth of a complete binary tree is given by
28. When representing any algebraic expression E which uses only binary operations in a 2-tree,
29. A binary tree can easily be converted into q 2-tree
30. When converting binary tree into extended binary tree, all the original nodes in binary tree are
31. The post order traversal of a binary tree is DEBFCA. Find out the pre order traversal
32. Which of the following sorting algorithm is of divide-and-conquer type?
33. An algorithm that calls itself directly or indirectly is known as
34. 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
35. The in order traversal of tree will yield a sorted listing of elements of tree in
36. In a Heap tree
37. In a graph if e=[u, v], Then u and v are called
38. A connected graph T without any cycles is called
39. In a graph if e=(u, v) means
40. If every node u in G is adjacent to every other node v in G, A graph is said to be
41. Two main measures for the efficiency of an algorithm are
42. The time factor when determining the efficiency of algorithm is measured by
43. The space factor when determining the efficiency of algorithm is measured by
44. Which of the following case does not exist in complexity theory
45. The Worst case occur in linear search algorithm when
46. The Average case occur in linear search algorithm
47. The complexity of the average case of an algorithm is
48. The complexity of linear search algorithm is
49. The complexity of Binary search algorithm is
50. The complexity of Bubble sort algorithm is
51. The complexity of merge sort algorithm is
52. The indirect change of the values of a variable in one module by another module is called
53. Which of the following data structure is not linear data structure?
54. On which principle does stack work?
55. The operation of processing each element in the list is known as
56. Finding the location of the element with a given value is:
57. Arrays are best data structures
58. Linked lists are best suited
59. Each array declaration need not give, implicitly or explicitly, the information about
60. The elements of an array are stored successively in memory cells because
61. Value of the first linked list index is _______
62. A linked list index is ____ that represents the position of a node in a linked list.
63. Why is the constructor of the QueueLinkedList class empty?
64. _______ form of access is used to add and remove nodes from a queue
65. ______ form of access is used to add and remove nodes from a stack
66. New nodes are added to the _____ of the queue.
67. A _______ is a data structure that organizes data similar to a line in the supermarket, where the first one in line is the first one out.
68. In an array queue, data is stored in an _____ element.
69. The pop() member function determines if the stack is empty by calling the _____ member function
70. What happens when you push a new node onto a stack?
71. _____________ Memory is Volatile.
72. An _________ data type is a keyword of a programming language that specifies the amount ofmemory needed to store data and the kind of data that will be stored in that memory location
73. Which of the following abstract data types are NOT used by Integer Abstract Data type group?
74. The hash String() member function is called by other member functions of the Hashtable class whenever a function needs to convert a ________________
75. An application iterates the hashtable by calling the ______ and ______ member functions
76. The java.util package contains two classes that are designed to work with hashtables. They are _______ and _________.
77. Data members of the Hashtable class stored in the private access specifier
78. _____ is the common programming technique used for hashing in all hashing functions
79. If the depth of a tree is 3 levels, then what is the Size of the Tree?
80. DeleteNode() function requires the _____ of the data element of the node that is being removed
