Question # 1

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 still 0, but y is now 2.

x is now 1, and y is now 2.

Merge sort makes two recursive calls,which statement is true after these recursive calls,finish but before the merge step?

Choose an answer

Elements in the first half of the array are less than or equal to elements in the second half of the array

None of the given options

The array elements form a heap.

Elements in the second half of the array are less than or equal to elements in the first half of the array

Consider a min heap, represented by the following array: 10,30,20,70,40,50,80,60 After inserting a node with value 31.Which of the following is the updated min heap?

Choose an answer

10,30,20,31,40,50,80,60,70

10,30,20,70,40,50,80,60,31

10,31,20,30,40,50,80,60,31

31,10,30,20,70,40,50,80,60

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.

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

Choose an answer

Binary Tree

Binary Search Tree

Parse Tree

AVL Tree

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 there are 23 external nodes in a binary tree then what will be the no. of internal nodes in this binary tree?

Choose an answer

23

24

21

22 (n-1)

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

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

Choose an answer

insert

add

update

preculateDown

We can build a heap in ________ time.

Choose an answer

Linear

Exponential

Polynomial

None of the above

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

By using __________we avoid the recursive method of traversing a Tree, which makes use of stacks and consumes a lot of memory and time.

Choose an answer

Binary tree only

Threaded binary tree

Heap data structure

Huffman encoding

_________ is a data structure that can grow easily dynamically at run time without having to copy existing elements.

Choose an answer

Array ()

List

Both of these

None of these

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

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

Choose an answer

Choose an answer

Choose an answer