CS and IT GATE 2015 Set-1 Questions with Answer

Ques 27 DBMS

A file is organized so that the ordering of data records is the same as or close to the ordering of data entries in some index. Then that index is called

Dense

Sparse

Clustered

Unclustered

Ques 28 DBMS

Select operation in SQL is equivalent to

the selection operation in relational algebra

the selection operation in relational algebra, except that select in SQL retains duplicates

the projection operation in relational algebra

the projection operation in relational algebra, except that select in SQL retains duplicates

Ques 29 Design Algorithm Analysis

Which one of the following is the recurrence equation for the worst case time complexity of the Quicksort algorithm for sorting n ( ≥ 2) numbers? In the recurrence equations given in the options below, c is a constant.

T(n)=2T(n/2)+cn

T(n)=T(n–1)+T(0)+cn

T(n)=2T(n–2)+cn

T(n)=T(n/2)+cn

Ques 30 Design Algorithm Analysis

Match the following

(P) Prim’s algorithm for minimum spanning tree	(i) Backtracking
(Q) Floyd-Warshall algorithm for all pairs shortest paths	(ii) Greedy method
(R) Mergesort	(iii) Dynamic programming
(S) Hamiltonian circuit	(iv) Divide and conquer

P-iii, Q-ii, R-iv, S-i

P-i, Q-ii, R-iv, S-iii

P-ii, Q-iii, R-iv, S-i

P-ii, Q-i, R-iii, S-iv

Ques 31 Digital Logic

The binary operator ≠ is defined by the following truth table.

Which one of the following is true about the binary operator ≠?

Both commutative and associative

Commutative but not associative

Not commutative but associative

Neither commutative nor associative

Ques 32 Digital Logic

Consider the operations
f(X, Y, Z) = X'YZ + XY' + Y'Z' and g(X, Y, Z) = X'YZ + X'YZ' + XY.
Which one of the following is correct?

Both {f} and {g} are functionally complete.

Only {f} is functionally complete.

Only {g} is functionally complete.

Neither {f} nor {g} is functionally complete.

Ques 33 Digital Logic

A positive edge-triggered D flip-flop is connected to a positive edge-triggered JK flip-flop as follows. The Q output of the D flip-flop is connected to both the J and K inputs of the JK flip-flop, while the Q output of the JK flip-flop is connected to the input of the D flip-flop. Initially, the output of the D flip-flop is set to logic one and the output of the JK flip-flop is cleared. Which one of the following is the bit sequence (including the initial state) generated at the Q output of the JK flip-flop when the flip-flops are connected to a free-running common clock? Assume that J = K = 1 is the toggle mode and J = K = 0 is the state-holding mode of the JK flip-flop. Both the flip-flops have non-zero propagation delays.

0110110...

0100100...

011101110...

011001100...

Ques 34 Digital Logic Design

Consider a 4 bit Johnson counter with an initial value of 0000. The counting sequence of this counter is

0,1,3,7,15,14,12,8,0

0,2,4,6,8,10,12,14,0

0,8,12,14,15,7,3,1,0

0,1,3,5,7,9,11,13,15,0

Ques 35 Digital Logic Design

Which one of the following is NOT equivalent to p ↔ q?

(┐p ˅ q) ˄ (p ˅ ┐q)

(┐p ˅ q) ˄ (q → p)

(┐p ˄ q) ˅ (p ˄ ┐q)

(┐p ˄ ┐q) ˅ (p ˄ q)

Ques 36 Discrete Mathematics

For a set A, the power set of A is denoted by 2^A. If A = {5,{6},{7}}, which of the following options are TRUE?
I. ∅ ∈ 2^A
II. ∅ ⊆ 2^A
III. {5,{6}} ∈ 2^A
IV. {5,{6}} ⊆ 2^A

I and III only

II and III only

I, II and III only

I, II and IV only

Ques 37 Discrete Mathematics

Let a_n represent the number of bit strings of length n containing two consecutive 1s. What is the recurrence relation for a_n?

a_n-2 + a_n-1 + 2^n-2

a_n-2 + 2a_n-1 + 2^n-2

2a_n-2 + a_n-1 + 2^n-2

2a_n-2 + 2a_n-1 + 2^n-2

Ques 38 English

Didn't you buy _______ when you went shopping?

any paper

much paper

no paper

a few paper

Ques 39 English

Which of the following options is the closest in meaning to the sentence below?
She enjoyed herself immensely at the party.

She had a terrible time at the party.

She had a horrible time at the party.

She had a terrific time at the party.

She had a terrifying time at the party.

1 2 3 4 5

Total Unique Visitors

Loading......

CS/IT Gate Yearwise

CS and IT GATE 2015 Set-1 Questions with Answer