Question # 1

If there are N elements in an array then the number of maximum steps needed to find an elements using Binary Search is __________

Choose an answer

N

N²

Nlog2N

log₂N

By using __________we avoid the recursive method of traversing a Tree, which makes use of stacks and consumes a lot of memory and time.

Choose an answer

Binary tree only

Threaded binary tree

Heap data structure

Huffman encoding

By using _____ we avoid recursive method of traversing a tree,which makes use of stacks and consumes a lot of memory and time.

Choose an answer

Binary tree only

Threaded binary tree

Heap data structure

Huffman encoding

In sequential access data structure ,accessing any element in the data structure takes different amount of time.Tell which one of the following is sequential access data structure.

Choose an answer

Arrays

Lists

Both of these

None of these

Merge sort and quicksort both fail into the same category of sorting algorithms,What is this category ?

Choose an answer

O(nlogn) sorts

Interchange sort

Average time is quadratic

None of the given options.

If a max heap is implemented using a partially filled array called data, and the array contains n elements (n > 0), where is the entry with the greatest value?

Choose an answer

Data[0]

data[1]

data[n-1]

data[n]

Which one is a self-referential data type?

Choose an answer

Stack

Queue

Link list

All of these

Suppose you implement a Min heap (with the smallest element on top) in an array. Consider the different arrays below; determine the one that cannot possibly be a heap:

Choose an answer

16, 18, 20, 22, 24, 28, 30

16, 20, 18, 24, 22, 30, 28

16, 24, 18, 28, 30, 20, 22

16, 24, 20, 30, 28, 18, 22

A kind of expression where the operator is present between two operands called ________ expressions .

Choose an answer

Postfix

Infix

Prefix

None of the above

Which of the following statement is true about find(x) operation :

Choose an answer

A find(x) on element x is performed by returning exactly the same node that is found.

A find(x) on element x is performed by returning the root of the tree containing x.

A find(x) on element x is performed by returning TRUE.

A find(x) on element x is performed by returning the whole tree itself containing x

Which of the following statement is NOT correct?

Choose an answer

In linked list the elements are necessarily to be contiguous

In the linked list the elements may locate at far positions in the memory

in the linked list each elements also has he address of the elements next to it

In an array the elements are contiguous

More Classes

Other Links

CS-301 Final Term Exams Preparation Virtual University MCQs With Answers

Choose an answer

Choose an answer

Choose an answer

Choose an answer

Choose an answer

Choose an answer

Choose an answer

Choose an answer

Choose an answer

Choose an answer

Choose an answer