Question # 1

Which of the following statement is NOT true about find operation :

Choose an answer

It is not a requirement that a find operation returns any specific name, just that finds on two elements return the same answer if and only if they are in the same set.

One idea might be to use a tree to represent each set, since each element in a tree has the same root, thus the root can be used to name the set.

Initially each set contains one element.

initially each set contains one element and it does not make sense to make a tree of one node only.

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

In a selection sort of n element ,how many times the swap function is called the execution of the algorithm?

Choose an answer

n-1

0

n log n

1

it will be efficient to place stack elements at the start of the list because insertion and removal take _______time.

Choose an answer

Variable

Constant

Inconsistent

None of the above

The maximum number of external nodes for a binary tree of Height H is ____

Choose an answer

2^h

2^h+1

2^h+2

2^h+3

Here is an array of ten integers: 5 3 8 9 1 7 0 2 6 4 The array after the FIRST iteration of the large loop in a selection sort (sorting from smallest to largest).

Choose an answer

0 3 8 9 1 7 5 2 6 4

2 6 4 0 3 8 9 1 7 5

2 6 4 9 1 7 0 3 8 5

0 3 8 2 6 4 9 1 7 5

Compiler uses which one of the following to evaluate a mathematical equation

Choose an answer

Binary Tree

Binary Search Tree

Parse Tree

AVL Tree

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

Choose an answer

Sorted

Unsorted

Heterogeneous

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

Choose an answer

16, 18, 20, 22, 24, 28, 30

16, 20, 18, 24, 22, 30, 28

16, 24, 18, 28, 30, 20, 22

16, 24, 20, 30, 28, 18, 22

A binary tree with N internal nodes has _____ links, _______ links to internal nodes and ________ links to external nodes

Choose an answer

N+1, 2N, N-1

N+1, N-1, 2N

2N, N-1, N+1

N-1, 2N, N+1

A compound data structure is the data structure which can have multiple data items of same type or of different types,which of the following can be considered compound data structure ?

Choose an answer

Arrays

LinkLists

Binary Search Trees

All of the given options

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