Question # 1

The arguments passed to a function should match in number, type and order with the parameters in the function definition.

Choose an answer

True

False

both

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

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.

By using _____ we avoid 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

Which of the following is not true regarding the maze generation ?

Choose an answer

Randomly remove walls until the entrance and exit cells are in same set

Removing a wall is the same as doing union of operation

Removing a randomly chosen wall if the cell is separatedare already in the same set

Do not remove a randomly chosen wall if the cells it separates are already in the same set.

Consider te following array 23 15 5 12 40 10 7 After the first pass of a particular algorithm, the array looks like 15 5 12 23 10 7 40 Name the algorithm used

Choose an answer

Heap sort

Selection sort

Insertion sort

Bubble sort

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.

Consider the following postfix expression S and the initial values of the variable,

S = A B - C + D E F - + ^ Assume that A=3, B=2, C=1, D=1, E=2, F=3 What would be the final output of the stack?

Choose an answer

1

2

0

-1

If a complete binary tree has n number of nodes then its height will be

Choose an answer

Log₂(n+1)-1

2ⁿ

2ⁿ-1

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]

Which of the following is a property of binary tree?

Choose an answer

A binary tree of N external nodes has N internal node.

A binary tree of N internal nodes has N+ 1 external node

A binary tree of N external nodes has N+ 1 internal node

A binary tree of N internal nodes has N- 1 external node.

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