Question # 1

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.

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

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

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

Choose an answer

insert

add

update

preculateDown

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

Consider the following postfix expression S and the initial values of the variable,

S = A B - C + D E F - + ^ Assume that A=3, B=2, C=1, D=1, E=2, F=3 What would be the final output of the stack?

Choose an answer

1

2

0

-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

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.

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

Choose an answer

1

2

3

4

More Classes

Other Links

CS-301 Final Term Exams Preparation Virtual University 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