Computer Science And Information Technology - CS 2012 GATE Paper (Practice Test) - GATE MCQ

Given the sequence of terms, AD CG FK JP, the next term is _________ .

Q. 1 – Q. 5 carry one mark each.

The cost function for a product in a firm is given by 5q², where q is the amount of production. The
firm can sell the product at a market price of  50 per unit. The number of units to be produced by
the firm such that the profit is maximized is

Which one of the following options is the closest in meaning to the word given below?
Mitigate

Choose the grammatically INCORRECT sentence:

Q. 6 - Q. 10 carry two marks each.

W anted Temporary, Part-time persons for the post of Field Interviewer to conduct personal
interviews to collect and collate economic data. Requirements: High School-pass, must be
available for Day, Evening and Saturday work. Transportation paid, expenses reimbursed.

Which one of the following is the best inference from the above advertisement?

An automobile plant contracted to buy shock absorbers from two suppliers X and Y. X supplies 60% and Y supplies 40% of the shock absorbers. All shock absorbers are subjected to a quality test. The ones that pass the quality test are considered reliable. Of X’s shock absorbers, 96% are reliable. Of Y’s shock absorbers, 72% are reliable.

The probability that a randomly chosen shock absorber, which is found to be reliable, is made by Y is 

Which of the following assertions are CORRECT?
P: Adding 7 to each entry in a list adds 7 to the mean of the list
Q: Adding 7 to each entry in a list adds 7 to the standard deviation of the list
R: Doubling each entry in a list doubles the mean of the list
S: Doubling each entry in a list leaves the standard deviation of the list unchanged

Q. 11 – Q. 35 carry one mark each.

Q.

Consider the following logical inferences.
I1: If it rains then the cricket match will not be played.
    The cricket match was played.
     Inference: There was no rain.
I2: If it rains then the cricket match will not be played.
     It did not rain.
     Inference: The cricket match was played.

Which of the following is TRUE?

Which of the following is TRUE?

What will be the output of the following C program segment?

char inChar = ‘A’ ;
switch ( inChar ) {
case ‘A’ : printf (“Choice A n”) ;
case ‘B’ :
case ‘C’ : printf (“Choice B”) ;
case ‘D’ :
case ‘E’ :
default : printf ( “ No Choice” ) ; }

A ssuming P ≠ NP, which of the following is TRUE?

T he worst case running time to search for an element in a balanced binary search tree with n2n
elements is

The truth table

The decimal value 0.5 in IEEE single precision floating point representation has

A process executes the code
fork();
fork();
fork();
The total number of child processes created is

Consider the function f(x) = sin(x) in the interval x [π/4, 7π/4]. The number and location(s) of the
local minima of this function are

The protocol data unit (PDU) for the application layer in the Internet stack is

Let A be the 2 × 2 matrix with elements a₁₁ = a₁₂ = a₂₁ = +1 and a₂₂ = −1. Then the eigenvalues of
the matrix A¹⁹ are

What is the complement of the language accepted by the NFA shown below?
Assume  = {a} and ε is the empty string.

What is the correct translation of the following statement into mathematical logic?
“Some real numbers are rational”

Given the basic ER and relational models, which of the following is INCORRECT?

Which of the following statements are TRUE about an SQL query?
P : An SQL query can contain a HAVING clause even if it does not have a GROUP BY clause
Q : An SQL query can contain a HAVING clause only if it has a GROUP BY clause
R : All attributes used in the GROUP BY clause must appear in the SELECT clause
S : Not all attributes used in the GROUP BY clause need to appear in the SELECT clause

The recurrence relation capturing the optimal execution time of the Towers of Hanoi problem with
n discs is

Let G be a simple undirected planar graph on 10 vertices with 15 edges. If G is a connected graph,
then the number of bounded faces in any embedding of G on the plane is equal to

Let W(n) and A(n) denote respectively, the worst case and average case running time of an
algorithm executed on an input of size n. Which of the following is ALWAYS TRUE?

The amount of ROM needed to implement a 4 bit multiplier is

Register renaming is done in pipelined processors