GATE CS 2008 — Question 27
Aishwarya studies either computer science or mathematics every day. If she studies computer science on a day, then the probability that she studies mathematics the next day is…
Year-wise GATE papers
GATE 2008
4 questions and papers
GATE CS 2008 — Question 33
Which of the following are true of the auto-increment addressing mode?I. It is useful in creating self-relocating code.II. If it is included in an Instruction Set Architecture, then…
GATE CS 2008 — Question 55
A computer on a 10 Mbps network is regulated by a token bucket. The token bucket is filled at a rate of 2 Mbps. It is initially filled…
GATE CS 2008 – Question 31
The most efficient algorithm for finding the number of connected components in an undirected graph on \(n\) vertices and \(m\) edges has time complexity
Answers and explanations unlock on sign-in
Every question here is free to read. A free account adds the verified key, the worked solution and your progress.