LPU GUIDE



100 TOP DATA STRUCTURES and ALGORITHMS Multiple Choice Questions and AnswersPosted on November 16, 2015 by engineer36 Comments Data Structures and Algorithms Multiple Choice Questions and Answers :-1. Which if the following is/are the levels of implementation of data structureA) Abstract levelB) Application levelC) Implementation levelD) All of the above2. A binary search tree whose left subtree and right subtree differ in hight by at most 1 unit is called ……A) AVL treeB) Red-black treeC) Lemma treeD) None of the above3. ……………….. level is where the model becomes compatible executable codeA) Abstract levelB) Application levelC) Implementation levelD) All of the aboveDATA STRUCTURES and ALGORITHMS Multiple Choice Questions and Answers 4. Stack is also called asA) Last in first outB) First in last outC) Last in last outD) First in first out5. Which of the following is true about the characteristics of abstract data types?i) It exports a type.ii) It exports a set of operationsA) True, FalseB) False, TrueC) True, TrueD) False, False6. …………… is not the component of data structure.A) OperationsB) Storage StructuresC) AlgorithmsD) None of above7. Which of the following is not the part of ADT description?A) DataB) OperationsC) Both of the aboveD) None of the above8. Inserting an item into the stack when stack is not full is called …………. Operation and deletion of item form the stack, when stack is not empty is called ………..operation.A) push, popB) pop, pushC) insert, deleteD) delete, insert9. ……………. Is a pile in which items are added at one end and removed from the other.A) StackB) QueueC) ListD) None of the above10. ………… is very useful in situation when data have to stored and then retrieved in reverse order.A) StackB) QueueC) ListD) Link list11. Which data structure allows deleting data elements from and inserting at rear?A) StacksB) QueuesC) DequeuesD) Binary search tree12. Which of the following data structure can’t store the non-homogeneous data elements?A) ArraysB) RecordsC) PointersD) Stacks13. 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.A) Queue linked listB) Stacks linked listC) Both of themD) Neither of them14. Which of the following is non-liner data structure?A) StacksB) ListC) StringsD) Trees15. Herder node is used as sentinel in …..A) GraphsB) StacksC) Binary treeD) Queues16. Which data structure is used in breadth first search of a graph to hold nodes?A) StackB) queueC) TreeD) Array17. Identify the data structure which allows deletions at both ends of the list but insertion at only one end.A) Input restricted dequeueB) Output restricted qequeueC) Priority queuesD) Stack18. Which of the following data structure is non linear type?A) StringsB) ListsC) StacksD) Graph19. Which of the following data structure is linear type?A) GraphB) TreesC) Binary treeD) Stack20. To represent hierarchical relationship between elements, Which data structure is suitable?A) DequeueB) PriorityC) TreeD) Graph21. A directed graph is ………………. if there is a path from each vertex to every other vertex in the digraph.A) Weakly connectedB) Strongly ConnectedC) Tightly ConnectedD) Linearly Connected22. In the …………….. traversal we process all of a vertex’s descendants before we move to an adjacent vertex.A) Depth FirstB) Breadth FirstC) With FirstD) Depth Limited23. State True of False.i) Network is a graph that has weights or costs associated with it.ii) An undirected graph which contains no cycles is called a forest.iii) A graph is said to be complete if there is no edge between every pair of vertices.A) True, False, TrueB) True, True, FalseC) True, True, TrueD) False, True, True24. Match the following.a) Completeness i) How long does it take to find a solutionb) Time Complexity ii) How much memory need to perform the search.c) Space Complexity iii) Is the strategy guaranteed to find the solution when there in one.A) a-iii, b-ii, c-iB) a-i, b-ii, c-iiiC) a-iii, b-i, c-iiD) a-i, b-iii, c-ii25. The number of comparisons done by sequential search is ………………A) (N/2)+1B) (N+1)/2C) (N-1)/2D) (N+2)/226. In ……………, search start at the beginning of the list and check every element in the list.A) Linear searchB) Binary searchC) Hash SearchD) Binary Tree search27. State True or False.i) Binary search is used for searching in a sorted array.ii) The time complexity of binary search is O(logn).A) True, FalseB) False, TrueC) False, FalseD) True, True28. Which of the following is not the internal sort?A) Insertion SortB) Bubble SortC) Merge SortD) Heap Sort29. State True or False.i) An undirected graph which contains no cycles is called forest.ii) A graph is said to be complete if there is an edge between every pair of vertices.A) True, TrueB) False, TrueC) False, FalseD) True, False30. A graph is said to be ……………… if the vertices can be split into two sets V1 and V2 such there are no edges between two vertices of V1 or two vertices of V2.A) PartiteB) BipartiteC) RootedD) Bisects31. In a queue, the initial values of front pointer f rare pointer r should be …….. and ……….. respectively.A) 0 and 1B) 0 and -1C) -1 and 0D) 1 and 032. In a circular queue the value of r will be ..A) r=r+1B) r=(r+1)% [QUEUE_SIZE – 1]C) r=(r+1)% QUEUE_SIZED) r=(r-1)% QUEUE_SIZE33. Which of the following statement is true?i) Using singly linked lists and circular list, it is not possible to traverse the list backwards.ii) To find the predecessor, it is required to traverse the list from the first node in case of singly linked list.A) i-onlyB) ii-onlyC) Both i and iiD) None of both34. The advantage of …………….. is that they solve the problem if sequential storage representation. But disadvantage in that is they are sequential lists.A) ListsB) Linked ListsC) TreesD) Queues35. What will be the value of top, if there is a size of stack STACK_SIZE is 5A) 5B) 6C) 4D) None36. ………… is not the operation that can be performed on queue.A) InsertionB) DeletionC) RetrievalD) Traversal37. There is an extra element at the head of the list called a ……….A) AntinelB) SentinelC) List headerD) List head38. A graph is a collection of nodes, called ………. And line segments called arcs or ……….. that connect pair of nodes.A) vertices, edgesB) edges, verticesC) vertices, pathsD) graph node, edges39. A ……….. is a graph that has weights of costs associated with its edges.A) NetworkB) Weighted graphC) Both A and BD) None A and B40. In general, the binary search method needs no more than ……………. comparisons.A) [log2n]-1B) [logn]+1C) [log2n]D) [log2n]+141. Which of the following is not the type of queue?A) Ordinary queueB) Single ended queueC) Circular queueD) Priority queue42. The property of binary tree isA) The first subset is called left subtreeB) The second subtree is called right subtreeC) The root cannot contain NULLD) The right subtree can be empty43. State true or false.i) The degree of root node is always zero.ii) Nodes that are not root and not leaf are called as internal nodes.A) True, TrueB) True, FalseC) False, TrueD) False, False44. Any node is the path from the root to the node is calledA) Successor nodeB) Ancestor nodeC) Internal nodeD) None of the above45. State true of false.i) A node is a parent if it has successor nodes.ii) A node is child node if out degree is one.A) True, TrueB) True, FalseC) False, TrueD) False, False46. ………………. is not an operation performed on linear lista) Insertion b) Deletion c) Retrieval d) TraversalA) only a,b and cB) only a and bC) All of the aboveD) None of the above47. Which is/are the application(s) of stackA) Function callsB) Large number ArithmeticC) Evaluation of arithmetic expressionsD) All of the above48. A …………… is an acyclic digraph, which has only one node with indegree 0, and other nodes have in-degree 1.A) Directed treeB) Undirected treeC) Dis-joint treeD) Direction oriented tree49. …………………. Is a directed tree in which outdegree of each node is less than or equal to two.A) Unary treeB) Binary treeC) Trinary treeD) Both B and C50. State true or false.i) An empty tree is also a binary tree.ii) In strictly binary tree, the out-degree of every node is either o or 2.A) True, FalseB) False, TrueC) True, TrueD) False, False51. Which of the following data structures are indexed structures?A. Linear arraysB. Linked listsC. QueueD. Stack52. Which of the following data structure store the homogeneous data elements?A. ArraysB. RecordsC. PointersD. Lists53. When new data are to be inserted into a data structure, but there is not available space; this situation is usually called ….A. UnderflowB. overflowC. housefulD. saturated54. A data structure where elements can be added or removed at either end but not in the middle is called …A. linked listsB. stacksC. queuesD. dequeue55. Operations on a data structure may be …..A. creationB. destructionC. selectionD. all of the above56. The way in which the data item or items are logically related defines …..A. storage structureB. data structureC. data relationshipD. data operation57. Which of the following are the operations applicable an primitive data structures?A. createB. destroyC. updateD. all of the above58. The use of pointers to refer elements of a data structure in which elements are logically adjacent is ….A. pointersB. linked allocationC. stackD. queue59. Arrays are best data structuresA. for relatively permanent collections of dataB. for the size of the structure and the data in the structure are constantly changingC. for both of above situationD. for non of above situation60. Which of the following statement is false?A. Arrays are dense lists and static data structure.B. Data elements in linked list need not be stored in adjacent space in memoryC. Pointers store the next data element of a list.D. Linked lists are collection of the nodes that contain information part and next pointer.Data Structures and Algorithms Multiple Choice Questions and Answers :-61. Which of the following data structure is non-linear type?A) StringsB) ListsC) StacksD) Tree62. Which of the following data structure is linear type?A) ArrayB) TreeC) GraphsD) Hierarchy63. The logical or mathematical model of a particular organization of data is called a ………A) Data structureB) Data arrangementC) Data configurationD) Data formation64. The simplest type of data structure is ………………A) Multidimensional arrayB) Linear arrayC) Two dimensional arrayD) Three dimensional array65. Linear arrays are also called ……………….A) Straight line arrayB) One-dimensional arrayC) Vertical arrayD) Horizontal array66. Arrays are best data structures …………A) For relatively permanent collections of data.B) For the size of the structure and the data in the structure are constantly changingC) For both of above situationD) For none of the above67. Which of the following data structures are indexed structures?A) Linear arraysB) Linked listsC) GraphsD) Trees68. Each node in a linked list has two pairs of ………….. and ……………….A) Link field and information fieldB) Link field and avail fieldC) Avail field and information fieldD) Address field and link field69. A …………………… does not keep track of address of every element in the list.A) StackB) StringC) Linear arrayD) Queue70. When does top value of the stack changes?A) Before deletionB) While checking underflowC) At the time of deletionD) After deletion71. Which of the following data structure is non-linear type?A) StringsB) ListsC) StacksD) Tree72. Which of the following data structure is linear type?A) ArrayB) TreeC) GraphsD) Hierarchy73. The logical or mathematical model of a particular organization of data is called a ………A) Data structureB) Data arrangementC) Data configurationD) Data formation74. The simplest type of data structure is ………………A) Multidimensional arrayB) Linear arrayC) Two dimensional arrayD) Three dimensional array75. Linear arrays are also called ……………….A) Straight line arrayB) One-dimensional arrayC) Vertical arrayD) Horizontal array76. Arrays are best data structures …………A) For relatively permanent collections of data.B) For the size of the structure and the data in the structure are constantly changingC) For both of above situationD) For none of the above77. Which of the following data structures are indexed structures?A) Linear arraysB) Linked listsC) GraphsD) Trees78. Each node in a linked list has two pairs of ………….. and ……………….A) Link field and information fieldB) Link field and avail fieldC) Avail field and information fieldD) Address field and link field79. A …………………… does not keep track of address of every element in the list.A) StackB) StringC) Linear arrayD) Queue80. When does top value of the stack changes?A) Before deletionB) While checking underflowC) At the time of deletionD) After deletion91. Arrays are best data structuresA) for relatively permanent collections of dataB) for the size of the structure and the data in the structure are constantly changingC) for both of above situationD) for none of above situation92. Which of the following data structure is not linear data structure?A) ArraysB) Linked listsC) Both of the aboveD) None of the above93. The disadvantage in using a circular linked list is …………………….A) It is possible to get into infinite loop.B) Last node points to first node.C) Time consumingD) Requires more memory space94. A linear list in which each node has pointers to point to the predecessor and successors nodes is called as ..A) Singly Linked ListB) Circular Linked ListC) Doubly Linked ListD) Linear Linked List95. A ……………….. is a linear list in which insertions and deletions are made to from either end of the structure.A) circular queueB) random of queueC) priorityD) dequeue96. In a priority queue, insertion and deletion takes place at ………………A) front, rear endB) only at rear endC) only at front endD) any position97. The time complexity of quick sort is …………..A) O(n)B) O(n2)C) O(n log n)D) O(log n)98. Which of the following is an application of stack?A) finding factorialB) tower of HanoiC) infix to postfix conversionD) all of the above99. The data structure which is one ended is ………………A) queueB) stackC) treeD) graph100. A list which displays the relationship of adjacency between elements is said to beA) linearB) non linearC) linked listD) trees? ................
................

In order to avoid copyright disputes, this page is only a partial summary.

Google Online Preview   Download