Study data structures including arrays, linked lists, stacks, queues, trees, graphs, and objective questions for technical exams.
What is Data Structure? A data structure is a specialized format for organizing, processing, retrieving and storing data. There are several basic and advanced types of data structures, all designed to arrange data to suit a specific purpose. Data structures make it easy for users to access and work with the data they need in […]
91. …….. form of access is used to add and remove nodes from a queue. A. LIFO, Last In First Out B. FIFO, First In First Out C. Both a and b D. None of these Answer Option : B 92. ……. form of access is used to add remove nodes from a stack. A.
81. The easiest sorting is…….. A. quick sort B. shell sort C. heap sort D. selection sort Answer Option : D 82. Which of the following sorting algorithm is of divide and conquer type? A. Bubble sort B. Insertion sort C. Quick sort D. Merge sort Answer Option : C 83. Merging k sorted tables
71. Which of the following is an external sorting? A. Insertion Sort B. Bubble Sort C. Merge Sort D. Tree Sort Answer Option : C 72. Very slow way of sorting is………. A. Insertion sort B. Heap sort C. Bubble sort D. Quick sort Answer Option : A 73. Which of the following is an
61. The list which has its own pointer is called…….. A. pointer list B. self pointer C. free pool D. own pointer Answer Option : C 62. Which of the following is two way lists A. Grounded header list B. Circular header list C. Linked list with header and trailer nodes D. None of the
51. To insert a new node in linked list free node will be available in…….. A. Available list B. Avail list C. Free node list D. Memory space list Answer Option : B 52. A singly linked list is also called as…….. A. linked list B. one way chain C. two way chain D. right
41. Each node in a linked list must contain at least ….. A. Three fields B. Two fields C. Four fields D. Five fields Answer Option : B 42. 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
31. A ……….. is a graph that has weights of costs associated with its edges. A. Network B. Weighted graph C. Both A and B D. None A and B Answer Option : C 32. In general, the binary search method needs no more than ……………. comparisons. A. [log2n]-1 B. [logn]+1 C. [log2n] D. [log2n]+1
21. The number of comparisons done by sequential search is ……………… A. (N/2)+1 B. (N+1)/2 C. (N-1)/2 D. (N+2)/2 Answer Option : B 22. In ……………, search start at the beginning of the list and check every element in the list. A. Linear search B. Binary search C. Hash Search D. Binary Tree search Answer
11. Which of the following is not the type of queue? A. Ordinary queue B. Single ended queue C. Circular queue D. Priority queue Answer Option : B 12. The property of binary tree is A. The first subset is called left subtree B. The second subtree is called right subtree C. The root cannot
1. Which if the following is/are the levels of implementation of data structure A. Abstract level B. Application level C. Implementation level D. All of the above Answer Option : D 2. A binary search tree whose left subtree and right subtree differ in height by at most 1 unit is called A. AVL tree
