Multiple Choice Questions for Algorithm and Data Structures

  • 1 Kruskal’s algorithm is used for finding ________ of a graph.
    1. Vector list
    2. Cyclic complexity
    3. Minimum Spanning Tree
    4. Weighted sum

  • 2 In Hashing two keys may hash to the same slot. We call this situation
    1. Parity
    2. Bit loss
    3. Collision
    4. Double Hashing

  • 3 log base 10 of 100 ( or log(100) ) is
    1. 2
    2. 1
    3. 10
    4. 0

  • 4 When we have only an asymptotic upper bound, we use
    1. Theta notation
    2. Omega notation
    3. O notation
    4. Random numbers

  • 5 In AVL tree, for each node x, the heights of the left and right subtrees of x differ by at most .......
    1. 0
    2. 1
    3. -1
    4. 2

  • 6 How many comparisons are required to sort an array of size 5 using counting sort?
    1. 5
    2. 2
    3. 4
    4. 0

  • 7 Which of the following sorting algorithms can sort without comparing the elements of an array?
    1. Quicksort
    2. Merge Sort
    3. Counting Sort
    4. Selection Sort

  • 8 The maximum number of elements that must be examined to complete a binary search in an array of 200 elements are .......
    1. 200
    2. 8
    3. 13
    4. 41

  • 9 Worst case running time of bubble sort is .....
    1. O(log n)
    2. O(n*n)
    3. O(2n)
    4. O(n)

  • 10 The complexity of linear search algorithm is
    1. O(n)
    2. O(log n)
    3. O(n2)
    4. O(n log n)

  • 11 Which of the following case does not exist in complexity theory
    1. Best case
    2. Worst case
    3. Average case
    4. Null case

  • 12 Two main measures for the efficiency of an algorithm are a.
    1. Time and space
    2. Complexity and capacity
    3. Processor and memory
    4. Data and space

  • 13 When new data are to be inserted into a data structure, but there is no available space; this situation is usually called
    1. underflow
    2. overflow
    3. housefull
    4. saturated

  • 14 Which of the following is two way list?
    1. grounded header list
    2. circular header list
    3. linked list with header and trailer nodes
    4. none of above

  • 15 The term "push" and "pop" is related to the
    1. array
    2. lists
    3. stacks
    4. all of above

  • 16 A data structure where elements can be added or removed at either end but not in the middle
    1. Queues
    2. Deque
    3. Stacks
    4. Linked lists

  • 17 Binary search algorithm can not be applied to
    1. sorted linked list
    2. sorted binary trees
    3. sorted linear array
    4. pointer array

  • 18 The memory address of the first element of an array is called
    1. floor address
    2. foundation address
    3. first address
    4. base address

  • 19 Which data structure allows deleting data elements from front and inserting at rear?
    1. Stacks
    2. Queues
    3. Deques
    4. Binary search tree

  • 20 The in order traversal of tree will yield a sorted listing of elements of tree in
    1. Binary trees
    2. Binary search trees
    3. Heaps
    4. None of above

  • 21 An algorithm that calls itself directly or indirectly is known as
    1. Sub algorithm
    2. Recursion
    3. Polish notation
    4. Traversal algorithm

  • 22 Which of the following sorting algorithm is of divide-and-conquer type?
    1. Bubble sort
    2. Insertion sort
    3. Quick sort
    4. All of above

  • 23 The post order traversal of a binary tree is DEBFCA. Find out the pre order traversal
    1. ABFCDE
    2. ADBFEC
    3. ABDECF
    4. ABDCEF

  • 24 To represent hierarchical relationship between elements, which data structure is suitable?
    1. Deque
    2. Priority
    3. Tree
    4. All of above

  • 25 A binary tree whose every node has either zero or two children is called
    1. Complete binary tree
    2. Binary search tree
    3. Extended binary tree
    4. None of above

  • 26 The depth of a complete binary tree is given by
    1. Dn = n log2n
    2. Dn = n log2n+1
    3. Dn = log2n
    4. Dn = log2n+1

  • 27 A connected graph T without any cycles is called
    1. a tree graph
    2. free tree
    3. A tree
    4. All of above

  • 28 In a graph if e=(u, v) means
    1. u is adjacent to v but v is not adjacent to u
    2. e begins at u and ends at v
    3. u is processor and v is successor
    4. both b and c

  • 29 If every node u in G is adjacent to every other node v in G, A graph is said to be
    1. isolated
    2. complete
    3. finite
    4. connected

  • 30 A Complete Binary tree has ________________ number of leaf nodes at level 5.
    1. 16
    2. 32
    3. 10
    4. 8

  • 31 In a Circular-Linked List "LastNode.next" is always________________.
    1. Previous Node
    2. New Node
    3. First Node
    4. Null

  • 32 10. In a Doubly-Linked List "LastNode.next" is always ________________.
    1. First Node
    2. Current Node
    3. New Node
    4. Null

  • 33 In a graph G if an edge e = [u,v], then u and v are called ________________.
    1. Endpoints of edge e
    2. Adjacent Vertices
    3. Neighbor Vertices
    4. All of the Above

  • 34 The primitive data structure are used to store ________ value(s)
    1. Multiple
    2. Group of
    3. Single
    4. None of the Above

  • 35 Two main measures for the efficiency of an algorithm are :
    1. Complexity and Capacity
    2. Time and Space
    3. Data and Space
    4. Capacity and Time

  • 36 ADT is called as Abstract because ________
    1. It is completely independent data type
    2. Implementation Details are hidden
    3. It is a collection of different data types
    4. All of the above

  • 37 Variable which can be accessed by all modules of the program is called as __________.
    1. Static Variable
    2. Global Variable
    3. Local Variable
    4. Protected Variable

  • 38 Mathematical Model that can have set of operations that can be performed on that model is called as _________.
    1. Primitive Data Type
    2. Composite Data Type
    3. Abstract Data Type
    4. All of the above

  • 39 Term Data Structure refers to _________ and interrelationship between them.
    1. Object Oriented Programming
    2. Organization of data element
    3. Programming Language Statement
    4. None of these

Contact Us

support@subexpert.com
Write to Us View Help
Subject Expert Logo

Subject Expert

Learn and Evaluate

Follow Us
© 2020 - Subject Expert