GATE (Graduate Aptitude Test in Engineering) Computer Science: Questions 1316 - 1319 of 2080

Access detailed explanations (illustrated with images and videos) to 2080 questions. Access all new questions- tracking exam pattern and syllabus. View the complete topic-wise distribution of questions. Unlimited Access, Unlimited Time, on Unlimited Devices!

View Sample Explanation or View Features.

Rs. 550.00 -OR-

How to register? Already Subscribed?

Question 1316

Appeared in Year: 2017 (UGC-NET)

Question

MCQ▾

Consider the method mcq () :

int mcq (boolean a, boolean b, boolean c, boolean d)

  1. {
  2.     intans=1;
  3.     if(a){ans=2;}
  4.     elseif(b){ans=3;}
  5.     elseif(c)
  6.     {
  7.         if(d){ans=4;
  8.         }
  9.         returnans;
  10.     }

If

M1 = Number of tests to exhaustively test mcq () ;

M2 = Minimum number of tests to achieve full statement coverage for mcq () ; and

M3 = Minimum number of tests to achieve full branch coverage for mcq () ;

then (M1, M2, M3) = ________. (November paper III)

Choices

Choice (4)Response

a.

b.

c.

d.

Question 1317

Question

MCQ▾

What is the maximum number of keys in a B-tree of order 5 of depth 3 (root at depth 0) ? (Model paper III)

Choices

Choice (4)Response

a.

1560

b.

999

c.

111

d.

Question does not provide sufficient data or is vague

Question 1318

Question

MCQ▾

A computer program has a total number of instructions count as Million. The Computer on which it is executing has an average CPI (cycles per instruction) of cycles/instruction. The CPU has a clock rate of . The CPU time in this case is? (Model paper II)

Choices

Choice (4)Response

a.

b.

c.

d.

Question 1319

Appeared in Year: 2017 (UGC-NET)

Question

MCQ▾

Finite state machine can recognize language generated by ________. (November paper III)

Choices

Choice (4)Response

a.

Any unambiguous grammar

b.

Only context sensitive grammar

c.

Only regular grammar

d.

Only context free grammar

Developed by: