CS/IT Gate Yearwise 


CS and IT Gate 2014 Set-1 Questions with Answer

Ques 53 GATE 2014 SET-1

Consider the following set of processes that need to be scheduled on a single CPU. All the times are given in milliseconds.

Using the shortest remaining time first scheduling algorithm, the average process turnaround time (in milliseconds) is _______.


(7.2 to 7.2) is the correct answer.

Ques 54 GATE 2014 SET-1

Assume that there are 3 page frames which are initially empty. If the page reference string is 1, 2, 3, 4, 2, 1, 5, 3, 2, 4, 6, the number of page faults using the optimal replacement policy is _______.


(7) is the correct answer.

Ques 55 GATE 2014 SET-1

Consider the following C function in which size is the number of elements in the array E:

The value returned by the function MyX is the

A

maximum possible sum of elements in any sub-array of array E.

B

maximum element in any sub-array of array E.

C

sum of the maximum elements in all possible sub-arrays of array E.

D

sum of all the elements in the array E.


(a) is the correct answer.

Ques 56 GATE 2014 SET-1

In a survey, 300 respondents were asked whether they own a vehicle or not. If yes, they were further asked to mention whether they own a car or scooter or both. Their responses are tabulated below. What percent of respondents do not own a scooter?


(48) is the correct answer.

Ques 57 GATE 2014 SET-1

Let L be a language and L' be its complement. Which one of the following is NOT a viable possibility?

A

Neither L nor L' is recursively enumerable (r.e.).

B

One of L and L' is r.e. but not recursive; the other is not r.e.

C

Both L and L' are r.e. but not recursive.

D

Both L and L' are recursive.


(c) is the correct answer.

Ques 58 GATE 2014 SET-1

Which of the regular expressions given below represent the following DFA?

I) 0*1(1 + 00*1)*
II) 0*1*1 + 11*0*1
III) (0 + 1)*1

A

I and II only

B

I and III only

C

II and III only

D

I, II, and III


(b) is the correct answer.

Ques 59 GATE 2014 SET-1

Suppose a polynomial time algorithm is discovered that correctly computes the largest clique in a given graph. In this scenario, which one of the following represents the correct Venn diagram of the complexity classes P, NP and NP Complete (NPC)?

A

B

C

D


(d) is the correct answer.

Unique Visitor Count

Total Unique Visitors

Loading......

Question Options

Contributed by: