Data Structure Lab Exam Practical Viva Questions and Answers - 1

Question: 1

What is the worst case time for quick sort to sort an array of n elements?

(A) 0(n)

(B) 0(nlog₂n)

(C) 0(log₂n)

(D) 0(log₂n)

Question: 2

The best way to find an item in an unsorted implemented using an array list is with

(A) Binary search

(B) Linear search

(C) Direct search

(D) Random search

Question: 3

Which of the following data structure is used to represent a relationship between pairs, where relationship is not hierarchical?

(A) Priority queue

(B) Heap

(C) Tree

(D) Graph

Question: 4

A data item that cannot be divided into sub items is known as

(A) Elementary data item

(B) Group data item

(C) Primary key

(D) Primary data item

Question: 5

The best way to find an item in a sorted list implemented using an array is with ___

(A) Direct search

(B) Random search

(C) Binary search

(D) Linear search