1
GATE CSE 2016 Set 1
Numerical
+2
-0
A function $$f:\,\,{N^ + } \to {N^ + },$$ defined on the set of positive integers $${N^ + },$$ satisfies the following properties: $$$\eqalign{ & f\left( n \right) = f\left( {n/2} \right)\,\,\,\,if\,\,\,\,n\,\,\,\,is\,\,\,\,even \cr & f\left( n \right) = f\left( {n + 5} \right)\,\,\,\,if\,\,\,\,n\,\,\,\,is\,\,\,\,odd \cr} $$$

Let $$R = \left\{ i \right.|\exists j:f\left( j \right) = \left. i \right\}$$ be the set of distinct values that $$f$$ takes. The maximum possible size of $$R$$ is _____________________.

Your input ____
2
GATE CSE 2016 Set 1
Numerical
+2
-0
Consider the recurrence relation $${a_1} = 8,\,{a_n} = 6{n^2} + 2n + {a_{n - 1}}.$$ Let $${a_{99}} = K \times {10^4}.$$ The value of $$K$$ is ____________.
Your input ____
3
GATE CSE 2016 Set 1
MCQ (Single Correct Answer)
+1
-0.3
Consider an arbitrary set of $$CPU$$-bound processes with unequal $$CPU$$ burst lengths submitted at the same time to a computer system. Which one of the following process scheduling algorithms would minimize the average waiting time in the ready queue?
A
Shortest remaining time first
B
Round-robin with time quantum less than the shortest $$CPU$$ burst
C
Uniform random
D
Highest priority first with priority proportional to $$CPU$$ burst length
4
GATE CSE 2016 Set 1
Numerical
+2
-0
Consider a disk queue with requests for $${\rm I}/O$$ to blocks on cylinders $$47, 38, 121, 191,$$ $$87, 11, 92, 10.$$ The $$C$$-$$LOOK$$ scheduling algorithm is used. The head is initially at cylinder number $$63,$$ moving towards larger cylinder numbers on its servicing pass. The cylinders are numbered from $$0$$ to $$199.$$ The total head movement (in number of cylinders) incurred while servicing these requests is _________________ .
Your input ____
EXAM MAP
Medical
NEET
Graduate Aptitude Test in Engineering
GATE CSEGATE ECEGATE EEGATE MEGATE CEGATE PIGATE IN
Civil Services
UPSC Civil Service
CBSE
Class 12