Question # 1

If a complete binary tree has height h then its no. of nodes will be,

Choose an answer

Log (h)

2^h+1 - 1

Log (h) - 1

2^h - 1

We are given N items to build a heap ,this can be done with ______ successive inserts.

Choose an answer

N-1

N

N+1

N+2

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.

Here is a small function definition:

void f(int i, int &k)

{ i

= 1; k = 2;

}

Suppose that a main program has two integer variables x and y, which are given the value 0. Then the main program calls f(x,y); What are the values of x and y after the function f finishes?

Choose an answer

Both x and y are still 0.

x is still 0, but y is now 2.

x is now 1, and y is now 2.

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

Huffman encoding uses _________ tree to develop codes of varying lengths for the letters used in the original message

Choose an answer

Linked List

Stack

Queue

Binary tree

Compiler uses which one of the following to evaluate a mathematical equation

Choose an answer

Binary Tree

Binary Search Tree

Parse Tree

AVL Tree

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

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

Which of the following statement is NOT true about find operation :

Choose an answer

It is not a requirement that a find operation returns any specific name, just that finds on two elements return the same answer if and only if they are in the same set.

One idea might be to use a tree to represent each set, since each element in a tree has the same root, thus the root can be used to name the set.

Initially each set contains one element.

initially each set contains one element and it does not make sense to make a tree of one node only.

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

Which of the following statement is correct?

Choose an answer

A Threaded Binary Tree is a binary tree in which every node that does not have a left child has a THREAD (in actual sense, a link) to its INORDER successor.

A Threaded Binary Tree is a binary tree in which every node that does not have a right child has a THREAD (in actual sense, a link) to its PREOREDR successor.

A Threaded Binary Tree is a binary tree in which every node that does not have a right child has a THREAD (in actual sense, a link) to its INORDER successor.

A Threaded Binary Tree is a binary tree in which every node that does not have a right child has a THREAD (in actual sense, a link) to its POSTORDER successor.

In an array list the current element is

Choose an answer

the first element

the middle element

the last element

The element where the current pointer points to

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 of the following is NOT the property of equivalence relation

Choose an answer

Reflexive

Symmetric

Transitive

Associative

A binary tree with N internal nodes has ____ links ,links to internal node and ____links to external

Choose an answer

N+1, 2N, N-1

N+1, N-1, 2N

2N, N-1, N+1

N-1, 2N, N+1

Consider a min heap, represented by the following array: 11,22,33,44,55 After inserting a node with value 66.Which of the following is the updated min heap?

Choose an answer

11,22,33,44,55,66

11,22,33,44,66,55

11,22,33,66,44,55

11,22,66,33,44,55

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

Choose an answer

1

2

3

4

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

If there are 23 external nodes in a binary tree then what will be the no. of internal nodes in this binary tree?

Choose an answer

23

24

21

22 (n-1)

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