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

P. Always finds a negative weighted cycle, if one

Q. Finds whether any negative weighted cycle is reachable from the source.

A

B

C

D

Algorithms
gate 2009
Shortest-Path

one of the following is the postorder traversal sequence of the same tree?

A

10, 20, 15, 23, 25, 35, 42, 39, 30

B

15, 10, 25, 23, 20, 42, 35, 39, 30

C

15, 20, 10, 23, 25, 42, 35, 39, 30

D

15, 10, 23, 25, 20, 35, 42, 39, 30

Algorithms
GATE 2013

MultiDequeue(Q){ m = k while (Q is not empty and m > 0) { Dequeue(Q) m = m - 1 } }What is the worst case time complexity of a sequence of n MultiDequeue() operations on an initially empty queue?

A

Θ(n)

B

Θ(n + k)

C

Θ(nk)

D

Algorithms
GATE 2013
Time-Complexity

A

Θ (n log n)

B

Θ (n2^{n})

C

Θ (n)

D

Θ (log n)

Data Structures
GATE 2012
Binary-Trees

A

T(n) = 2T(n - 2) + 2

B

T(n) = 2T(n - 1) + n

C

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

D

T(n) = 2T(n - 1) + 1

Data Structures
Recursion
GATE 2012

A

A(n) = Ω (W(n))

B

A(n) = Θ (W(n))

C

A(n) = O (W(n))

D

A(n) = o (W(n))

Algorithms
GATE 2012
Time-Complexity

A

T' = T with total weight t' = t^{2}

B

T' = T with total weight t'2

C

T' ≠ T but total weight t' = t^{2}

D

None of the above

Algorithms
GATE 2012
Minimum-Spanning-Tree

A

full: (REAR+1)mod n == FRONT

empty: REAR == FRONT

empty: REAR == FRONT

B

full: (REAR+1)mod n == FRONT

empty: (FRONT+1) mod n == REAR

empty: (FRONT+1) mod n == REAR

C

full: REAR == FRONT

empty: (REAR+1) mod n == FRONT

empty: (REAR+1) mod n == FRONT

D

full: (FRONT+1)mod n == REAR

empty: REAR == FRONT

empty: REAR == FRONT

Data Structures
GATE 2012
Queues

A

O (n log n)

B

O (n^{2} log n)

C

O (n^{2} + log n)

D

O (n^{2})

Algorithms
GATE 2012
Merge-Sort

A

SDT

B

SBDT

C

SACDT

D

SACET

Algorithms
Shortest-Path
GATE 2012

A

∏_{B} (r_{1}) - ∏_{C} (r_{2}) = ∅

B

∏_{C} (r_{2}) - ∏_{B} (r_{1}) = ∅

C

∏_{B} (r_{1}) = ∏_{C} (r_{2})

D

∏_{B} (r_{1}) - ∏_{C} (r_{2}) ≠ ∅

DBMS
GATE 2012

shown in the pseudocode below is invoked as height(root) to compute the height of a binary

tree rooted at the tree pointer root

.

The appropriate expressions for the two boxes B1 and B2 are

A

B1: (1+height(n→right))

B2: (1+max(h1,h2))

B2: (1+max(h1,h2))

B

B1: (height(n→right))

B2: (1+max(h1,h2))

B2: (1+max(h1,h2))

C

B1: height(n→right)

B2: max(h1,h2)

B2: max(h1,h2)

D

B1: (1+ height(n→right))

B2: max(h1,h2)

B2: max(h1,h2)

Data Structures
GATE 2012
Binary-Trees

SELECT A.id FROM A WHERE A.age > ALL (SELECT B.age FROM B WHERE B. name = "arun")

A

4

B

3

C

0

D

1

GATE 2012

A

B

C

D

Algorithms
gate 2009
Time-Complexity

A

B

C

D

Data Structures
gate 2009
Hashing

A

B

C

D

Data Structures
gate 2009
AVL-Trees

A

B

C

D

Algorithms
gate 2009
Minimum-Spanning-Tree

A

B

C

D

Algorithms
gate 2009
Sorting

l(i,j) = 0, if either i=0 or j=0 = expr1, if i,j > 0 and X[i-1] = Y[j-1] = expr2, if i,j > 0 and X[i-1] != Y[j-1]

A

B

C

D

Algorithms
gate 2009
Dynamic-Programming

A

B

C

D

Algorithms
gate 2009
Dynamic-Programming

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