Question # 1

Which of the following statement is NOT true about threaded binary tree?

Choose an answer

Right thread of the right-most node points to the dummy node

Left thread of the left-most node points to the dummy node.

The left pointer of dummy node points to the root node of the tree

Left thread of the right-most node points to the dummy node.

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

Which one of the following is TRUE about recursion ?

Choose an answer

Recursion extensively use stack memory

Threaded Binary Trees use the concept of recursion.

Recursive function calls consume a lot of memory.

Iteration is more efficient than iteration.

I have implemented the queue with a circular array. If data is a circular array of CAPACITY elements, and last is an index into that array, what is the formula for the index after last?

Choose an answer

(last % 1) + CAPACITY

last % (1 + CAPACITY)

(last + 1) % CAPACITY

last + (1 % CAPACITY)

Union is a ___________ time operation

Choose an answer

Constant

Polynomial

Exponential

None of the above

Double link list is always has one NULL pointer

Choose an answer

True

False

Not Sure

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

Choose an answer

Sorted

Unsorted

Heterogeneous

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

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.

A complete binary tree of height 3 has between ________ nodes.

Choose an answer

8 to 14

8 to 15

8 to 16

8 to 17

Which formula is the best approximation for the depth of a heap with n nodes?

Choose an answer

log (base 2) of n

The number of digits in n (base 10), e.g., 145 has three digits

The square root of n

n

Which of the following is not an example of equivalence relation:

Choose an answer

Electrical Connectivity

Set of people

<= relation

Set of pixels

Every AVL is

Choose an answer

Binary tree

Complete tree

None of these

Binary Search tree

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

Choose an answer

31

32

33

66

Suppose currentNode refers to a node in a linked list(using the Node class with member variables called data and next node),What statement changes currentNode so that it refers to the next node?

Choose an answer

currentNode ++;

currentNode = nextNode;

currentNode += nextNode;

currentNode = currentNode->nextNode;

A complete binary tree of height ___ has node between 16 to 31.

Choose an answer

2

3

4

5

What is the formula of approixation for the depth of a heap with n nodes?

Choose an answer

log (base 2) of n

The number of digits in n (base 10 )e,g 145 has three digit

The square root of n

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

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

Consider a min heap, represented by the following array: 10,30,20,70,40,50,80,60 After inserting a node with value 31.Which of the following is the updated min heap?

Choose an answer

10,30,20,31,40,50,80,60,70

10,30,20,70,40,50,80,60,31

10,31,20,30,40,50,80,60,31

31,10,30,20,70,40,50,80,60

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