Question # 1

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

If there are N internal nodes in a binary tree then what will be the number of the no,of external node in the binary tree?

Choose an answer

N-1

N

N+1

N+2

While building Huffman encoding tree the new node that is the result of joining two nodes has the frequency.

Choose an answer

Equal to the small frequency

Equal to the greater

Equal to the sum of the two frequencies

Equal to the difference of the two frequencies

Select the FALSE statement binary tree.

Choose an answer

Every binary tree has at least one node.

Every non-empty tree has exactly one root node.

Every node has at most two children.

Every non-root node has exactly one parent.

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]

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

Which of the following is a non linear data structure?

Choose an answer

Linked List

Stack

Tree

Queue

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

A compound data structure is the data structure which can have multiple data items of same type or of different types,which of the following can be considered compound data structure ?

Choose an answer

Arrays

LinkLists

Binary Search Trees

All of the given options

Here is an array of ten integers: 5 3 8 9 1 7 0 2 6 4 The array after the FIRST iteration of the large loop in a selection sort (sorting from smallest to largest).

Choose an answer

0 3 8 9 1 7 5 2 6 4

2 6 4 0 3 8 9 1 7 5

2 6 4 9 1 7 0 3 8 5

0 3 8 2 6 4 9 1 7 5

What requirement is placed on an array, so that binary search may be used to locate an entry?

Choose an answer

The array elements must form a heap.

The array must have at least 2 entries

The array must be sorted.

The array‟s size must be a power of two.

Which traversal gives a decreasing order of elements in a heap where the max element is stored at the top?

Choose an answer

post-order

level -order

in order

none of the above

The difference between the binary tree and a binary search tree is that:

Choose an answer

a binary search tree has two children per node whereas a binary tree can have none, one, or two children per node

in binary search tree nodes are inserted based on the values they contain

in binary tree nodes are inserted based on the values they contain

none of these

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

If you know the size of the data structure in advance, i.e., at compile time, which one of the following is a good data structure to use.

Choose an answer

Array

List

Both

None of the above

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.

Merge sort makes two recursive calls,which statement is true after these recursive calls,finish but before the merge step?

Choose an answer

Elements in the first half of the array are less than or equal to elements in the second half of the array

None of the given options

The array elements form a heap.

Elements in the second half of the array are less than or equal to elements in the first half of the array

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

A binary relation R over S is called an equivalence relation if it has following property(s)

Choose an answer

Reflexivity

Symmetry

Transitivity

All of the given options

A binary tree with 33 internal nodes has _______ links to internal nodes.

Choose an answer

31

32

33

66

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

Choose an answer

N

N²

Nlog₂n

log₂N

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

Choose an answer