CS/IT Gate Yearwise 


CS and IT Gate 2014 Set-3 Questions with Answer

Ques 53 GATE 2014 SET-3

Let S be a sample space and two mutually exclusive events A and B be such that A ∪ B = S. If P(⋅) denotes the probability of the event, the maximum value of P(A)P(B) is _________.


(0.25 to 0.25) is the correct answer.

Ques 54 GATE 2014 SET-3

Which one of the following statements is TRUE about every n x n matrix with only real eigenvalues?

A

If the trace of the matrix is positive and the determinant of the matrix is negative, at least one of its eigenvalues is negative.

B

If the trace of the matrix is positive, all its eigenvalues are positive.

C

If the determinant of the matrix is positive, all its eigenvalues are positive.

D

If the product of the trace and determinant of the matrix is positive, all its eigenvalues are positive.


(a) is the correct answer.

Ques 55 GATE 2014 SET-3

If V₁ and V₂ are 4-dimensional subspaces of a 6-dimensional vector space V, then the smallest possible dimension of V₁ ∩ V₂ is _________.


(2) is the correct answer.

Ques 56 GATE 2014 SET-3

A system uses 3 page frames for storing process pages in main memory. It uses the Least Recently Used (LRU) page replacement policy. Assume that all the page frames are initially empty. What is the total number of page faults that will occur while processing the page reference string given below?
4, 7, 6, 1, 7, 6, 1, 2, 7, 2

A

4

B

6

C

7

D

8


(b) is the correct answer.

Ques 57 GATE 2014 SET-3

A system contains three programs and each requires three tape units for its operation. The minimum number of tape units which the system must have such that deadlocks never arise is _________.


(7) is the correct answer.

Ques 58 GATE 2014 SET-3

An operating system uses shortest remaining time first scheduling algorithm for pre-emptive scheduling of processes. Consider the following set of processes with their arrival times and CPU burst times (in milliseconds):

The average waiting time (in milliseconds) of the processes is _________.


(5.5) is the correct answer.

Ques 59 GATE 2014 SET-3

Consider a paging hardware with a TLB. Assume that the entire page table and all the pages are in the physical memory. It takes 10 milliseconds to search the TLB and 80 milliseconds to access the physical memory. If the TLB hit ratio is 0.6, the effective memory access time (in milliseconds) is _________.


(122) is the correct answer.

Ques 60 GATE 2014 SET-3

Consider the following two statements:
I. If all classes of a C++ program are declared to be friends of one another, then the program is as insecure as a C program.
II. In Java, an instance of a class can access a private variable of another instance of the same class.
Which of the following statements is CORRECT?

A

Both statements I and II are TRUE.

B

Statement I is TRUE and statement II is FALSE.

C

Statement I is FALSE and statement II is TRUE.

D

Both statements I and II are FALSE.


(b) is the correct answer.

Ques 61 GATE 2014 SET-3

In the context of modular software design, which one of the following combinations is desirable?

A

High cohesion and high coupling

B

High cohesion and low coupling

C

Low cohesion and high coupling

D

Low cohesion and low coupling


(b) is the correct answer.

Ques 62 GATE 2014 SET-3

A software requirements specification (SRS) document should avoid discussing which one of the following?

A

User interface issues

B

Non-functional requirements

C

Design solutions

D

Interfaces with third party software


(c) is the correct answer.

Ques 63 GATE 2014 SET-3

The length of the shortest string NOT in the language (over Σ = {a, b}) of the following regular expression is _________.
(a + b)*bb(a + b)*


(3) is the correct answer.

Ques 64 GATE 2014 SET-3

Let Σ be a finite non-empty alphabet and let 2Σ* be the power set of Σ*. Which one of the following statements is TRUE?

A

2Σ* is countable and Σ* is uncountable

B

2Σ* is uncountable and Σ* is countable

C

Both 2Σ* and Σ* are countable

D

Both 2Σ* and Σ* are uncountable


(d) is the correct answer.

Ques 65 GATE 2014 SET-3

Which one of the following problems is undecidable?

A

Deciding if a given context-free grammar is ambiguous.

B

Deciding if a given string is generated by a given context-free grammar.

C

Deciding if the language generated by a given context-free grammar is empty.

D

Deciding if the language generated by a given context-free grammar is finite.


(a) is the correct answer.

Unique Visitor Count

Total Unique Visitors

Loading......

Question Options

Contributed by: