GATE CSE topic:computing PYQs & Answers — Page 90

Questions 891–900 of 975. Imported answers require independent review unless marked reviewed.

is an undirected graph with

vertices and 25 edges such that each vertex of

has degree at least 3. Then the maximum possible value of

is __________.

You can attempt this question now. Sign in to view the answer key, explanations and discussion.Log in to check answer

Consider the following CPU processes with arrival times (in milliseconds) and length of CPU bursts (in milliseconds) as given below:

Process	Arrival time	Burst time
P1	0	7
P2	3	3
P3	5	5
P4	6	2

If the pre-emptive shortest remaining time first scheduling algorithm is used to schedule the processes, then the average waiting time across all processes is __________ milliseconds.

You can attempt this question now. Sign in to view the answer key, explanations and discussion.Log in to check answer

Consider a quadratic equation

with coefficients in a base

. The solutions of this equation in the same base

are

and

. Then

__________.

You can attempt this question now. Sign in to view the answer key, explanations and discussion.Log in to check answer

Consider a two-level cache hierarchy with L1 and L2 caches. An application incurs 1.4 memory accesses per instruction on average. For this application, the miss rate of L1 cache is 0.1; the L2 cache experiences, on average, 7 misses per 1000 instructions. The miss rate of L2 expressed correct to two decimal places is ____________.

You can attempt this question now. Sign in to view the answer key, explanations and discussion.Log in to check answer

The minimum possible number of states of a deterministic finite automaton that accepts the regular language

is __________.

You can attempt this question now. Sign in to view the answer key, explanations and discussion.Log in to check answer

Let

be any connected undirected edge-weighted graph. The weights of the edges in

are positive and distinct. Consider the following statements:

(I) Minimum Spanning Tree of

is always unique. (II) Shortest path between any two vertices of

is always unique.

Which of the above statements is/are necessarily true?

Your answerChoose one option.

(I) only

(II) only

both (I) and (II)

neither (I) nor (II)

You can attempt this question now. Sign in to view the answer key, explanations and discussion.Log in to check answer

P and Q are considering to apply for a job. The probability that P applies for the job is

, the probability that P applies for the job given that Q applies for the job is

, and the probability that Q applies for the job given that P applies for the job is

. Then the probability that P does not apply for the job given that Q does not apply for the job is

Your answerChoose one option.

You can attempt this question now. Sign in to view the answer key, explanations and discussion.Log in to check answer

A multithreaded program P executes with

number of threads and uses

number of locks for ensuring mutual exclusion while operating on shared memory locations. All locks in the program are non-reentrant, i.e., if a thread holds a lock

, then it cannot re-acquire lock

without releasing it. If a thread is unable to acquire a lock, it blocks until the lock becomes available. The minimum value of

and the minimum value of

together for which execution of P can result in a deadlock are:

Your answerChoose one option.

You can attempt this question now. Sign in to view the answer key, explanations and discussion.Log in to check answer

are Boolean variables, then which one of the following is INCORRECT?

Your answerChoose one option.

You can attempt this question now. Sign in to view the answer key, explanations and discussion.Log in to check answer

The value of

Your answerChoose one option.

is 0

is -1

is 1

does not exist

You can attempt this question now. Sign in to view the answer key, explanations and discussion.Log in to check answer

GATE CSE topic:computing PYQs

Question 23

Question 24

Question 24

Question 25

Question 25

Question 26

Question 26

Question 27

Question 27

Question 28