ROUND 1 QUIZ FOR 2nd 3rd years (SET 1)

Given an input arr = {2,5,7,99,899}; key = 899; What is the level of recursion?

• 5

• 2

• 3

• 4

Choose the true statement

I - Binary Search is faster than Linear Search.

II - Binary search is applied on all the input lists on which linear search can be applied.

• Only I

• Only II

• Both I and II

• Neither I and II

Which of the following is the recurrance relation for binary search?

• T(n)=T(n/2)+1

• T(n)=T(n/2)+2

• T(n)=2T(n/2)+1

• All of the above

Entries in a stack are “ordered”. What is the meaning of this statement?

• A collection of stacks is sortable

• Stack entries may be compared with the ‘<‘ operation

• The entries are stored in a linked list

• There is a Sequential entry that is one by one

Which of the following is/are not applications of bit arrays?

• Used by the Linux kernel

• For the allocation of memory pages

• Bloom filter

• Implementation of Vectors and Matrices

Which of the following is true?

• B + tree allows only the rapid random access

• B + tree allows only the rapid sequential access

• B + tree allows rapid random access as well as rapid sequential access

• B + tree allows rapid random access and slower sequential access

What is the maximum possible number of edges in a directed graph with no self loops having 8 vertices?

• 28

• 64

• 256

• 56

What is the time complexity for converting decimal to binary numbers?

• O(1)

• O(n)

• O(logn)

• O(nlogn)

Size of an And Inverter Graph is the number of ___ gates and the number of logic levels is number of ___ gates on the _____ path from a primary input to a primary output.

• AND, AND, average

• AND, OR, longest

• OR, OR, shortest

• AND, AND, longest

What is the time complexity of insert function in a hash table using a doubly linked list?

• O(1)

• O(n)

• O(log n)

• O(n log n)