Q 1.

Convert it into postfix for A-(B+C)*(D/E)

ABC+DE/-* ABC-DE/*- ABC-DE*/- ABC+DE/*-

Q 2.

The efficiency of merge sort is

O(log n) O(n) O(n log n) None of the above

Q 3.

Sorting algorithms are not stable for

Selection Sort Bubble Sort Merge Sort Insertion Sort

Q 4.

In C programming language which one is not possible with an array

Array of strings Definition Declaration Dynamic Allocation

Q 5.

Matrices of order m*n and n*p. What is the complexity of multiplying these two matrices

mnp mn mnp np

Q 6.

If an array contains the extra key at the end then it is known as_________.

End key Stop key Sentinel Transposition

Q 7.

The complexity of linear search algorithm is_________.

O(n) O(log n) O(n2) O(n log n)

Q 8.

The given Hash function used in h(k) = floor( m(kA mod 1))

multiplication method division method addition method subtraction method

Q 9.

The vertices of complete graph have ________ degree.

zero equal unequal none

Q 10.

The probe sequence depends on the value of

c2 m k c1

Q 11.

Which of the following is used to construct a suffix tree.

Balanced tree Suffix array and LCP array Hash tree Hash tree

Q 12.

In order to determine the index of any input record in hash tables which is used

hash linked list hash function hash tree hash chaining

Q 13.

A universal hashing scheme is used as a

heuristic approach randomization approach Both A and B None of the above

Q 14.

___________ algorithm is having highest space complexity.

Bubble sort Insertion sort Quick sort Merge sort

Q 15.

Which of the following is an application of Linked List?

Hash Tables Commercial computing Priority Scheduling Discrete Mathematics

Q 16.

The self-organizing list improves

binary search insertion deletion average access time

Q 17.

Free lists are used in

static memory allocation static memory allocation contagious allocations speeding up linked list operations

Q 18.

A linked list is implemented in

Referential Structures Nodes Structure None of these

Q 19.

The search complexity of a Linked list is

Ο(1) Ο(n) Ο(log n) Ο(log log n)

Q 20.

If vertices x & y have a path between them then which of the following method is used

Breadth-First Search Depth First Search None A & B Both A & B