Time Left - 09:00 mins

ISRO Quiz-12

Attempt now to get your rank among 210 students!

Question 1

The worst case running time of Insertion sort, Merge sort and Quick sort, respectively, are:

Question 2

In a 0/1 Knapsack Problem, what is the amount of time taken to create the memory table and determine the optimal solution respectively, for K number of objects and T as the capacity of Knapsack?

Question 3

‘AS’ clause is used in SQL for

Question 4

Number of spanning trees for K₄ is:

Question 5

Consider two matrices M₁ and M₂ with M₁*M₂ = 0 and M₁is non-singular. Then which of the following is true?

Question 6

Which of the following statements is/are TRUE?

S1: FCFS scheduling algorithm suffers from convoy effect.

S2: SJF scheduling algorithm is optimal.

Question 7

If A ⊕ B = C, then

Question 8

A non pipeline system takes 50 ns to process a task. The same task can be processed in a six-segment pipeline with a clock cycle of 10 ns. Determine the speedup ratio of the pipeline for 100 tasks. What is the maximum speedup that can be achieved?

210 attempts
3 upvotes
1 comment

Tags :

GATE & PSU CS General

Jun 16GATE & PSU CS