# Data Structures and Algorithms Multiple Choice Questions - Set 6

51.       A graph with n vertices will definitely have a parallel edge or self loop if the total number of edges are
(A) more than n
(B) more than n+1
(C) more than (n+1)/2
(D) more than n(n-1)/2
52.       In the worst case, the number of comparisons needed to search a singly linked list of length n for a given element is ............
(A) log2 n
(B) n/2
(C) log2 n-1
(D) n
53.       Index of arrays in C programming language starts from.............
(A) 0
(B) 1
(C) either 0 or 1
(D) undefined
54.       Out of the following, the slowest sorting procedure is
(A) Quick Sort
(B) Heap Sort
(C) Shell Sort
(D) Bubble Sort
55.       The minimum number of edges required to create a cyclic graph of n vertices is .............
(A) n
(B) n - 1
(C) n + 1
(D) 2n

56.       In .............., it is possible to traverse a tree without using stacks either implicitly or explicitly.
(B) AVL Tree
(C) B+ tree
(D) Heap
57.       The order of a B-Tree with 2, 3, 4 or 5 children in every internal node is
(A) 2
(B) 3
(C) 4
(D) 5
58.       Prefix notation is also known as ...............
(A) Reverse Polish Notation
(B) Reverse Notation
(C) Polish Reverse Notation
(D) Polish Notation
59.       The number of nodes that have no successors in a complete binary tree of depth 4 is
(A) 0
(B) 8
(C) 16
(D) 4