Time Left - 09:00 mins

ISRO Quiz-7

Attempt now to get your rank among 149 students!

Question 1

Given two positive functions f(n) and g(n). If

, for some constant c

0 and c is non- negative but nto infinite then which of the following is correct.

Question 2

Consider the following, five binary strings of length 8.
01010010, 11011011, 10011010, 11111011, 01110010
A hash table of size M = 8 (0 to 7) is using open addressing for hashing the binary strings. Assume finding an empty slot directly without collision or after collision is also a probe. Calculate the total number of probes that occur while hashing five strings using linear probing. Assume hash function, h(x) = x mod 8.

Question 3

The Average case and worst case complexities for Merge sort algorithm are

Question 4

Selection sort algorithm design technique is an example of

Question 5

The logic operations of' two combinational circuits given in Figure-l and Figure-ll are

$Description: E:\Gate\isro-cs\ISRO_CS_2008_files\image016.png$

Question 6

The characteristic equation of an SR flip-flop is given by

Question 7

The TCP sliding window

Question 8

Bit stuffing refers to

149 attempts
0 upvotes
2 comments

Tags :

GATE & PSU CS General

Jun 4GATE & PSU CS