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

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

A complete binary tree of height ____ has nodes between 16-31.

Choose an answer

2

3

4

5

Which of the following heap method increase the value of key at position „p‟ by the amount „delta‟?

Choose an answer

increaseKey(p,delta)

decreaseKey(p,delta)

preculateDown(p,delta)

remove(p,delta)

Suppose you implement a heap (with the largest element on top) in an array. Consider the different arrays below, determine the one that cannot possibly be a heap:

Choose an answer

7 6 5 4 3 2 1

7 3 6 2 1 4 5

7 6 4 3 5 2 1

7 3 6 4 2 5 1

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

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]

Use of binary tree in compression of data is known as _______

Choose an answer

Traversal

Heap

Union

Huffman encoding

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

Choose an answer

levelorder

Preorder

Inorder

Postorder

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

Choose an answer

31

32

33

66

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

Choose an answer

Sorted

Unsorted

Heterogeneous

Random

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