CS and IT GATE 2015 Set-2 Questions with Answer

Ques 27 DBMS

Consider the following transaction involving two bank accounts x and y.

read(x); x := x – 50; write(x); read(y); y := y + 50; write(y)

The constraint that the sum of the accounts x and y should remain constant is that of

Atomicity

Consistency

Isolation

Durability

Ques 28 Design Algorithm Analysis

Consider two decision problems Q₁, Q₂ such that Q₁reduces in polynomial time to 3-SAT and 3-SAT reduces in polynomial time to Q₂. Then which one of the following is consistent with the above statement?

Q₁ is in NP, Q₂ is NP hard

Q₂ is in NP, Q₁ is NP hard

Both Q₁ and Q₂ are in NP

Both Q₁ and Q₂ are in NP hard

Ques 29 Digital Logic

The number of min-terms after minimizing the following Boolean expression is _______.
[D' + AB' + A'C + AC'D + A'C'D]'

Ques 30 Digital Logic Design

The minimum number of JK flip-flops required to construct a synchronous counter with the count sequence (0, 0, 1, 1, 2, 2, 3, 3, 0, 0,...) is ________

a is the correct answer.

Ques 31 Digital Logic Design

A half adder is implemented with XOR and AND gates. A full adder is implemented with two half adders and one OR gate. The propagation delay of an XOR gate is twice that of an AND/OR gate. The propagation delay of an AND/OR gate is 1.2 microseconds. A 4-bit ripple-carry binary adder is implemented by using full adders. The total propagation time of this 4-bit binary adder in microseconds is ______.

Ques 32 Discrete Mathematics

Let R be the relation on the set of positive integers such that aRb if and only if a and b are distinct and have a common divisor other than 1. Which one of the following statements about R is True?

R is symmetric and reflexive but not transitive

R is reflexive but not symmetric and not transitive

R is transitive but not reflexive and not symmetric

R is symmetric but not reflexive and not transitive

Ques 33 Discrete Mathematics

Consider the following two statements.

S1: If a candidate is known to be corrupt, then he will not be elected.
S2: If a candidate is kind, he will be elected.

Which one of the following statements follows from S1 and S2 as per sound inference rules of logic?

If a person is known to be corrupt, he is kind

If a person is not known to be corrupt, he is not kind

If a person is kind, he is not known to be corrupt

If a person is not kind, he is not known to be corrupt

Ques 34 Discrete Mathematics

A graph is self-complementary if it is isomorphic to its complement. For all self-complementary graphs on n vertices, n is

A multiple of 4

Even

Odd

Congruent to 0 mod 4, or, 1 mod 4.

Ques 35 Discrete Mathematics

In a connected graph, a bridge is an edge whose removal disconnects a graph. Which one of the following statements is true?

A tree has no bridges.

A bridge cannot be part of a simple cycle.

Every edge of a clique with size ≥ 3 is a bridge. (A clique is any complete subgraph of a graph.)

A graph with bridges cannot have a cycle.

Ques 36 English

Choose the statement where the underlined word is used correctly.

The industrialist had a personnel jet.

I write my experience in my personnel diary.

All personnel are being given the day off.

Being religious is a personnel aspect.

Ques 37 Mathematics

The number of divisors of 2100 is _________.

a is the correct answer.

Ques 38 Mathematics

Consider a function f(x) = 1 – |x| on –1 ≤ x ≤ 1. The value of x at which the function attains a maximum and the maximum value of the function are:

0, –1

–1, 0

0, 1

–1, 2

Ques 39 Mathematics

The cardinality of the power set of {0, 1, 2,..., 10} is _______.

1 2 3 4 5

Total Unique Visitors

Loading......

CS/IT Gate Yearwise

CS and IT GATE 2015 Set-2 Questions with Answer