Question # 1

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

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.

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

A binary tree with N internal nodes has ____ links ,links to internal node and ____links to external

Choose an answer

N+1, 2N, N-1

N+1, N-1, 2N

2N, N-1, N+1

N-1, 2N, N+1

A complete binary tree of height 3 has between _____ node

Choose an answer

8-14

8-15

8-16

8-17

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

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.

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]

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

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

Choose an answer

insert

add

update

preculateDown

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 now 1 but y is still 0

x is still 0,but y is now 2

x is now1 1 and y is now 2

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

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