Time Left - 10:00 mins
ISRO 2018: Algorithms Booster Quiz- 4
Attempt now to get your rank among 1027 students!
Question 1
The Fibonacci sequence is the sequence of integers
Question 2
Which of the following sorting algorithms have the minimum running time complexity in the best and average case respectively?
Question 3
The number of spanning trees for a complete graph with seven vertices is
Question 4
The physical location of a record determined by a formula that transforms a file key into a record location is
Question 5
Number of comparisons required for an unsuccessful search of an element in a sequential search organized, fixed length, symbol table of length L is
Question 6
Which one of the following in place sorting Algorithmss needs the minimum number of swaps?
Question 7
The time taken by binary search algorithm to search a key in a sorted array of n elements is
Question 8
Let T(n) be defined by T (1)= 10 and T(n +1) = 2n +T(n) for all integers n 1. Which of the following represents the order of growth of T(n) as a function of n?
- 1027 attempts
- 5 upvotes
- 22 comments
Tags :
GATE & PSU CSAlgorithmsApr 5GATE & PSU CS