Question # 1

If there are N internal nodes in a binary tree then what will be the number of the no,of external node in the binary tree?

Choose an answer

N-1

N

N+1

N+2

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

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

In an array we can store data elements of different types

Choose an answer

True

False

Not sure

If you know the size of the data structure in advance, i.e., at compile time, which one of the following is a good data structure to use.

Choose an answer

Array

List

Both

None of the above

Suppose currentNode refers to a node in a linked list(using the Node class with member variables called data and next node),What statement changes currentNode so that it refers to the next node?

Choose an answer

currentNode ++;

currentNode = nextNode;

currentNode += nextNode;

currentNode = currentNode->nextNode;

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

What requirement is placed on an array, so that binary search may be used to locate an entry?

Choose an answer

The array elements must form a heap.

The array must have at least 2 entries

The array must be sorted.

The array‟s size must be a power of two.

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

A binary tree of N nodes has _____

Choose an answer

Log₁₀N Levels

Log₂ N levels

N/2 Levels

N X2 Levels

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