Time Left - 10:00 mins

ISRO 2018: Algorithms Booster Quiz- 2

Attempt now to get your rank among 783 students!

Question 1

Six files F1,F2,F3,F4,F5 and F6 have 100, 200, 50, 80, 120, 150 records respectively. In what order should they be stored so as to optimize act. Assume each file is accessed with the same frequency

Question 2

In which of the following shading models of polygons, the interpolation of intensity values is done along the scan line?

Question 3

A machine needs a minimum of 100 sec to sort 1000 names by quick sort. The minimum time needed to sort 100 names will be approximately

Question 4

If n has the value 3, then the statement a[++n] = n++;

Question 5

Djikstra's algorithm is used

Question 6

A Hash Function f is defined as f(key)=key mod 7. With linear probing, is used to insert the keys 37,38,72,48,98,11,56,into a table indexed from 0> In which location the key 11 will be stored.

Question 7

If one uses straight two – way merge sort algorithm to sort the following elements in ascending order : 20, 47,15,8, 9, 4, 40, 30, 12, 17, then the order of these elements after second pass of the algorithms is

Question 8

Algorithm design technique used in quick sort algorithm is

783 attempts
3 upvotes
6 comments

Tags :

GATE & PSU CS Algorithms

Apr 7GATE & PSU CS