Time Left - 10:00 mins
ISRO 2018: Algorithms Booster Quiz- 1
Attempt now to get your rank among 991 students!
Question 1
The time complexity of computing the transitive closure of a binary relation on a set of elements is known to be
Question 2
Which of the following algorithm solves the all-pair shortest path problem?
Question 3
What is the time complexity for the following C module? Assume that n>0n>0.
int module(int n) { if (n == 1) return 1; else return (n + module(n-1)); }
Question 4
What is the compression ratio on typical mp3 audio file?
Question 5
Which of the following is true about the z-buffer Algorithms?
Question 6
A hash table with 10 buckets with one slot per bucket is depicted in fig. The symbols, S1 and S7 are initially entered using a hashing function with linear probing. The maximum number of comparisons needed in searching an item that is not present is
Question 7
Which one of the following in-place sorting algorithms needs the minimum number of swaps?
Question 8
Consider the following sorting Algorithms.
I. Quicksort
II. Heapsort
III. Mergesort
Which of them perform in least time in the worst case?
I. Quicksort
II. Heapsort
III. Mergesort
Which of them perform in least time in the worst case?
- 991 attempts
- 1 upvote
- 13 comments
Tags :
GATE & PSU CSAlgorithmsApr 6GATE & PSU CS