Time Left - 10:00 mins

Mission ISRO CS 2017 Exam : Algorithms Quiz-1

Attempt now to get your rank among 666 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

The Fibonacci sequence is the sequence of integers

Question 3

Which of the following Algorithms design techniques is used in merge sort?

Question 4

What is the compression ratio on typical mp3 audio file?

Question 5

Consider the following recurrence
T(n) = 2T(√n)+1
T(1) = 1
Which one of the following is true?

Question 6

Consider the following program fragment
if(a>b)
if(b>c)
s1;
else s2;
s2 will be executed if

Question 7

Which of the following sorting algorithms have the minimum running time complexity in the best and average case respectively?

Question 8

Let T(n) be defined by T (1)= 10 and T(n +1) = 2n +T(n) for all integers n $Description: E:\Gate\isro-cs\ISRO-CS-2011_files\image016.png$ 1. Which of the following represents the order of growth of T(n) as a function of n?

Question 9

The number of spanning trees for a complete graph with seven vertices is

Question 10

Djikstra's algorithm is used

666 attempts
2 upvotes
12 comments

Tags :

GATE & PSU CS Algorithms

Apr 7GATE & PSU CS