Time Left - 12:00 mins
UGC NET CS 2018 : MiniMock Quiz-2 (Algo)
Attempt now to get your rank among 813 students!
Question 1
Consider the following pseudo-code:
Endif
The cyclomatic complexity of the pseudo-code is
Endif
The cyclomatic complexity of the pseudo-code is
Question 2
Given the symbols A, B, C, D, E, F, G and H with the probabilities 
and 
respectively. The average Huffman code size in bits per symbol is:
and respectively. The average Huffman code size in bits per symbol is: Question 3
The travelling salesman problem can be solved in:
Question 4
An all-pairs shortest-paths problem is efficiently solved using:
Question 5
Let, 
and 
be asymptotically non-negative functions. Which of the following is correct?
and be asymptotically non-negative functions. Which of the following is correct? Question 6
What is the routing algorithm used by RIP and IGRP?
Question 7
A hash function f defined as f(key) = key mod 7, with linear probing used to resolve collisions. Insert the keys 37, 38, 72, 48, 98 and 11 into the table indexed from 0 to 6. What will be the location of 11
Question 8
Consider a hash table of size 
and the hash function 
for 
Compute the location to which the key 
is placed in 2 hash table.
and the hash function for Compute the location to which the key is placed in 2 hash table. Question 9
Which of the following algorithms sort in integers, having the range 0 to 
in ascending order in 
time?
in ascending order in time? Question 10
The worst case running time of Insertion sort, Merge sort and Quick sort, respectively, are:
- 813 attempts
- 4 upvotes
- 11 comments
Tags :
GATE & PSU CSAlgorithmsMay 4GATE & PSU CS
