CS and IT Gate 2015 Set-2 Questions with Answer

Ques 27 Gate 2015 Set-2

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

Ques 28 Gate 2015 Set-2

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?

Ques 29 GATE 2015 SET-2

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

Ques 30 Gate 2015 Set-2

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 ________

Ques 31 GATE 2015 SET-2

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 Gate 2015 Set-2

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?

Ques 33 Gate 2015 Set-2

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?

Ques 34 GATE 2015 SET-2

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

Ques 35 GATE 2015 SET-2

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

Ques 36 GATE 2015 SET-2

Choose the statement where the underlined word is used correctly.

Ques 37 Gate 2015 Set-2

The number of divisors of 2100 is _________.

Ques 38 Gate 2015 Set-2

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:

Ques 39 GATE 2015 SET-2

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