Question # 1

If both pointers of the node in a binary tree are NULL then it will be a/an _______ .

Choose an answer

Inner node

Leaf node

Root node

None of the given options

Every AVL is

Choose an answer

Binary tree

Complete tree

None of these

Binary Search tree

Which one is a self-referential data type?

Choose an answer

Stack

Queue

Link list

All of these

A complete binary tree of height 3 has between _____ node

Choose an answer

8-14

8-15

8-16

8-17

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.

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.

Double link list is always has one NULL pointer

Choose an answer

True

False

Not Sure

Consider te following array 23 15 5 12 40 10 7 After the first pass of a particular algorithm, the array looks like 15 5 12 23 10 7 40 Name the algorithm used

Choose an answer

Heap sort

Selection sort

Insertion sort

Bubble sort (

Which of the following algorithm is most widely used due to its good average time

Choose an answer

Bubble sort

insertion sort

quick sort

merge sort

While joining nodes in the building of Huffman encoding tree if there are more nodes with same frequency, we choose the nodes _______.

Choose an answer

Randomly

That occur first in the text message

That are lexically smaller among others

That are lexically greater among others

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

Union is a ___________ time operation

Choose an answer

Constant

Polynomial

Exponential

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 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

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

Consider te following array 23 15 5 12 40 10 7 After the first pass of a particular algorithm, the array looks like 15 12 23 10 7 40 Name the algorithm used

Choose an answer

Heap sort

Selection sort

insertion sort

Bubble sort

The definition of Transitivity property is

Choose an answer

For all element x member of S, x R x

For all elements x and y, x R y if and only if y R x

For all elements x, y and z, if x R y and y R z then x R z

For all elements w, x, y and z, if x R y and w R z then x R z

Consider the following infix expression: x – y * a + b / c Which of the following is a correct equivalent expression(s) for the above?

Choose an answer

x y -a * b +c /

x *y a - b c / +

x y a * - b c / +

x y a * - b/ + c

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

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

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