Question # 1

There is/are ________ case/s for rotation in an AVL tree,

Choose an answer

1

2

3

4

Which one of the following is NOT the property of equivalence relation

Choose an answer

Reflexive

Symmetric

Transitive

Associative

Suppose we have a hash table whose hash function is "n% 12",if the number 35 is already in the hash table which of the following numbers would cause a collision ?

Choose an answer

144

145

143

148

Which one of the following is valid postfix expression?

Choose an answer

ab+c*d-

abc*+d-

abc+*d-

abc*)+d-

Suppose we are sorting an array of eight integers using quick sort, and we have just finished the first partitioning with the array looking like this: 2 5 1 7 9 12 11 10 Which statement is correct?

Choose an answer

The pivot could be either the 7 or the 9

The pivot could be the 7, but it is not the 9.

The pivot is not the 7, but it could be the 9.

Neither the 7 nor the 9 is the pivot.

it will be efficient to place stack elements at the start of the list because insertion and removal take _______time.

Choose an answer

Variable

Constant

Inconsistent

None of the above

If the bottom level of a binary tree is NOT completely filled, depicts that the tree is NOT a

Choose an answer

Expression tree

threaded binary tree

complete binary tree

perfectly complete binary tree

_____ only removes items in reserve order as they were entered

Choose an answer

Stack

Queue

Both of these

None of these

In case of deleting a node from AVL tree,rotation could be prolong to the root node.

Choose an answer

yes

no

not sure

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

Choose an answer

7 6 5 4 3 2 1

7 3 6 2 1 4 5

7 6 4 3 5 2 1

7 3 6 4 2 5 1

Which of the following is a non linear data structure?

Choose an answer

Linked List

Stack

Tree

Queue

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

Searching of an element in an AVL tree take minimum ____ time (where n is number of nodes in AVL tree)

Choose an answer

Log₂(n+1)

Log₂(n+1) -1

1.44 Log₂n

1.66 Log₂n

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.

The data of the problem is of 2 GB and the hard disk is of 1 GB capacity,to solve this problem we should

Choose an answer

use better data structure

Increase the hard disk space

Use the better algorithm

Use as much data as we can store on the hard disk

Suppose A is an array containing numbers in increasing order, but some numbers occur more than once when using a binary search for a value, the binary search always finds ____________

Choose an answer

the first occurrence of a value.

the second occurrence of a value

may find first or second occurrence of a value.

None of the given options

Which of the following statements is correct property of binary trees?

Choose an answer

A binary tree with N internal nodes has N+1 internal links

A binary tree with N external nodes has 2N internal nodes

A binary tree with N internal nodes has N+1 external nodes.

None of above statement is a property of the binary tree

Which of the following statement is true about dummy node of threaded binary tree

Choose an answer

The left pointer of dummy node points to the itself while the right pointer points to the root of tree.

The left pointer of dummy node points to the root node of the tree while the right pointer points itself i.e. to dummy node

The left pointer of dummy node points to the root node of the tree while the right pointer is always NULL

The right pointer of dummy node points to the itself while the left pointer is always NULL

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

Binary Search is an algorithm of searching ,used with the ____ data .

Choose an answer

Sorted

Unsorted

Heterogeneous

More Classes

Other Links

PHY-101 Quiz OnlineTest 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

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