gate 2018
GATE 2019
gate 2016
gate 2016 set 1
GATE 2017 SET 1
GATE 2017 SET2
GATE 2015 SET 1
GATE 2015 SET 2
GATE 2015 SET3
GATE 2014 SET 1
GATE 2014 SET 2
GATE 2013
gate 2009
GATE 2012
gate 2010
GATE 2019
GATE 2014 SET 3
gate 2011
GATE 2008 CS
GATE 2008 IT
GATE 2007 CS
GATE 2007 IT
GATE 2006 CS
GATE 2006 IT
GATE 2005 CS
GATE 2005 IT
GATE 2004 CS

Data Structures
Algorithms
operating systems
computer organization
Computer Networks
DBMS
Graph Theory

A

358

B

438

C

568

D

664

Algorithms
GATE 2014 SET 2
Greedy-Algorithm

A

4

B

6

C

8

D

10

GATE 2014 SET 2

A

A queue cannot be implemented using this stack

B

A queue can be implemented where ENQUEUE takes a single instruction and DEQUEUE takes a sequence of two instructions.

C

A queue can be implemented where ENQUEUE takes a sequence of three instructions and DEQUEUE takes a single instruction.

D

A queue can be implemented where both ENQUEUE and DEQUEUE take a single instruction each. |

GATE 2014 SET 2

A

A smaller block size implies better spatial locality

B

A smaller block size implies a smaller cache tag and hence lower cache tag overhead

C

A smaller block size implies a larger cache tag and hence lower cache hit time

D

A smaller block size incurs a lower cache miss penalty

computer organization
GATE 2014 SET 2

A

Width of tag comparator

B

Width of set index decoder

C

Width of way selection multiplexor

D

Width of processor to main memory data bus

computer organization
GATE 2014 SET 2

Submit

GATE 2014 SET 2

S1: There is a subset of S that is larger than every other subset. S2: There is a subset of S that is smaller than every other subset.Which one of the following is CORRECT?

A

Both S1 and S2 are true

B

S1 is true and S2 is false

C

S2 is true and S1 is false

D

Neither S1 nor S2 is true

GATE 2014 SET 2

Submit

GATE 2014 SET 2

Submit

Algorithms
GATE 2014 SET 2
Minimum-Spanning-Tree

select * from R where a in (select S.a from S)

A

select R.* from R, S where R.a=S.a (D)

B

select distinct R.* from R,S where R.a=S.a

C

select R.* from R,(select distinct a from S) as S1 where R.a=S1.a

D

select R.* from R,S where R.a=S.a and is unique R

GATE 2014 SET 2

A

Commutative but not associative

B

Both commutative and associative

C

Associative but not commutative

D

Neither commutative nor associative

GATE 2013

required to sort n numbers using selection sort?

A

O(log n)

B

O(n)

C

O(n log n)

D

O(n^2)

Algorithms
GATE 2013
Sorting

inserting an object into a binary search tree of n nodes?

A

O(1)

B

O(log n)

C

O(n)

D

O(n log n)

Algorithms
GATE 2013
Sorting

graph of n vertices?

A

B

C

D

Algorithms
GATE 2013
Sorting

P: Number of odd degree vertices is even.

Q: Sum of degrees of all vertices is even.

A

P only

B

Q only

C

Both P and Q

D

Neither P nor Q

Algorithms
GATE 2013
Graph Theory

“None of my friends are perfect.”

A

∃x (F (x)∧ ¬P(x))

B

∃ x (¬ F (x)∧ P(x))

C

∃x (¬F (x)∧¬P(x))

D

¬∃ x (F (x)∧ P(x))

GATE 2013

A

B

C

D

gate 2009
Graph Theory

A

Θ(1)

B

C

D

Algorithms
GATE 2013
Sorting

int unknown(int n){

int i, j, k=0;

for (i=n/2; i<=n; i++)

for (j=2; j<=n; j=j*2)

k = k + n/2;

return (k);

}

The return value of the function is

A

B

C

D

GATE 2013

A

B

C

D

Algorithms
gate 2009
Sorting

© 2020 - All rights are reserved- AAIC Technologies pvt ltd