Question # 1

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

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

Choose an answer

This dummy node never has a value

This dummy node has always some dummy values

This dummy node has either no value or some dummy value

This dummy node has always some integer value

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

I have implemented the queue with a linked list, keeping track of a front pointer and a rear pointer. Which of these pointers will change during an insertion into an EMPTY queue?

Choose an answer

Neither changes

only front pointer charges

Only rear pointer changes.

Both change. Since it is an empty queue the front and rear are initialize to -1, so on insertion both the pointers will change and point to 0.

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

_________ is a data structure that can grow easily dynamically at run time without having to copy existing elements.

Choose an answer

Array ()

List

Both of these

None of these

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

Consider a min heap, represented by the following array: 3,4,6,7,5 After calling the function deleteMin().Which of the following is the updated min heap?

Choose an answer

4,6,7,5

6,7,5,4

4,5,6,7

4,6,5,7

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

Which of the following is not true regarding the maze generation ?

Choose an answer

Randomly remove walls until the entrance and exit cells are in same set

Removing a wall is the same as doing union of operation

Removing a randomly chosen wall if the cell is separatedare already in the same set

Do not remove a randomly chosen wall if the cells it separates are already in the same set.

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

In complete binary tree the bottom level is filled from________

Choose an answer

Left to right

Right to left

Not filled at all

None of the given option

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.

Which one of the following is TRUE about iteration?

Choose an answer

Iteration extensively uses stack memory

Threaded Binary Trees use the concept of iteration.

Iterative function calls consumes a lot of memory.

Recursion is more efficient than iteration.

Which of the following method is helpful in creating the heap at once?

Choose an answer

insert

add

update

preculateDown

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

A complete binary tree of height 3 has between _____ node

Choose an answer

8-14

8-15

8-16

8-17

Which one is a self-referential data type?

Choose an answer

Stack

Queue

Link list

All of these

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

Choose an answer

31

32

33

66

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

Which of the following is a property of binary tree?

Choose an answer

A binary tree of N external nodes has N internal node.

A binary tree of N internal nodes has N+ 1 external node

A binary tree of N external nodes has N+ 1 internal node

A binary tree of N internal nodes has N- 1 external node.

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

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.

Which one of the following is valid postfix expression?

Choose an answer

ab+c*d-

abc*+d-

abc+*d-

abc*)+d-

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

Choose an answer

Choose an answer

Choose an answer