Data Structures and Algorithms Multiple Choice Questions - Set 26

251.       In general, linked lists allow:
(A) Insertions and removals anywhere.
(B) Insertions and removals only at one end.
(C) Insertions at the back and removals from the front.
(D) None of the above.
Answer: A
252.       Which of the following has search efficiency of Ο(1)?
(A) Tree
(B) Heap
(C) Hash Table
(D) Linked-List
Answer: C
253.       Which of the following operations is performed more efficiently by doubly linked list than by singly linked list?
(A) Deleting a node whose location in given
(B) Searching of an unsorted list for a given item
(C) Inverting a node after the node with given location
(D) Traversing a list to process each node
Answer: A
254.       The extra key inserted at the end of the array is called a, ................
(A) End key.
(B) Stop key.
(C) Sentinel.
(D) Transposition.
Answer: C
255.       The prefix form of A-B/ (C * D ^ E) is:
(A) -/*^ACBDE
(C) -A/B*C^DE
(D) -A/BC*^DE
Answer: C
256.       Maximum number of nodes in a binary tree with height k, root is at height 0, is:
(A) 2k − 1
(B) 2k+1 − 1
(C) 2k-1 + 1
(D) 2k + 1
Answer: B
257.       Consider that n elements are to be sorted. What is the worst case time complexity of Bubble sort?
(A) O(1)
(B) O(log2n)
(C) O(n)
(D) O(n2)
Answer: D
258.       Time complexity of Depth First Traversal of is ..................
(A) Θ(|V|+|E|)
(B) Θ(|V|)
(C) Θ(|E|)
(D) Θ(|V|*|E|)
Answer: A
259.       A characteristic of the data that binary search uses but the linear search ignores is
the ..................
(A) Order of the elements of the list.
(B) Length of the list.
(C) Maximum value in list.
(D) Type of elements of the list.
Answer: A
260.    In Breadth First Search of Graph, which of the following data structure is used?
(A) Stack
(B) Queue
(C) Linked List
(D) None of the above
Answer: B

Pages  25   26   27   28   29   30 

Post a Comment