Time Left - 09:00 mins
ISRO Quiz-13
Attempt now to get your rank among 205 students!
Question 1
In a bubble Sort, worst-case runtime complexity will be:
Question 2
Which among the following problem doesn’t follow the greedy algorithm approach?
Question 3
Select ___________ dept_name
from instructor;
Here which of the following displays the unique values of the column?
Question 4
A connected planar graph divides the plane into a number of regions. If the graph has eight vertices and these are linked by 13 edge, then the number of regions is:
Question 5
A process spends 30% of its execution time waiting for completion of I/O operation. If there are 5 processes in memory at once, then the probability of CPU time utilized is _______ %. (Assume all I/O operations are overlapped).
Question 6
Consider the following process table with Arrival time and Burst time (All time in ms).
Average waiting time of these processes by using SRTF scheduling is ________ (ms). (Upto 1 decimal place)
Question 7
Given F(A, B, C, D) = Σm(0, 2, 3, 5, 7, 8, 10, 12, 13, 14, 15).
The number of prime implicants is ________.
The number of prime implicants is ________.
Question 8
The performance of a pipelined processor suffers if?
- 205 attempts
- 2 upvotes
- 2 comments
Tags :
GATE & PSU CSGeneralOct 6GATE & PSU CS