CS and IT GATE 2014 Set-3 Questions with Answer

Ques 53 Engineering Mathematics

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 Engineering Mathematics

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

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

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

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

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

Ques 55 Engineering Mathematics

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 Operating Systems

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

Ques 57 Operating Systems

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 Operating Systems

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 Operating Systems

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 Programming Languages

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?

Both statements I and II are TRUE.

Statement I is TRUE and statement II is FALSE.

Statement I is FALSE and statement II is TRUE.

Both statements I and II are FALSE.

Ques 61 Software Engineering

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

High cohesion and high coupling

High cohesion and low coupling

Low cohesion and high coupling

Low cohesion and low coupling

Ques 62 Software Engineering

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

User interface issues

Non-functional requirements

Design solutions

Interfaces with third party software

Ques 63 Theory of Computation

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 Theory of Computation

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

2Σ* is countable and Σ* is uncountable

2Σ* is uncountable and Σ* is countable

Both 2Σ* and Σ* are countable

Both 2Σ* and Σ* are uncountable

Ques 65 Theory of Computation

Which one of the following problems is undecidable?

Deciding if a given context-free grammar is ambiguous.

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

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

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

1 2 3 4 5

Total Unique Visitors

Loading......

CS/IT Gate Yearwise

CS and IT GATE 2014 Set-3 Questions with Answer