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

666

B

3000

C

6000

D

12000

General Aptitude
GATE 2019

A

24 bits and 0 bits

B

28 bits and 4 bits

C

24 bits and 4 bits

D

28 bits and 0 bits

computer organization
GATE 2019
Cache and main memory

A

C800 to CFFF

B

CA00 to CAFF

C

C800 to C8FF

D

DA00 to DFFF

computer organization
GATE 2019

A

IMAP , POP3

B

SMTP, POP3

C

SMTP, MIME

D

IMAP, SMTP

Computer Networks
GATE 2019

A

80

B

10

C

40

D

60

operating systems
GATE 2019

A

29

B

19

C

39

D

09

GATE 2019

A

M, N and P all belong to the same subnet

B

Only N and P belong to the same subnet

C

M, N, and P belong to three different subnets

D

Only M and N belong to the same subnet

Computer Networks
GATE 2019

A

X sends an ARP request packet with broadcast IP address in its local subnet

B

X sends an ARP request packet to the local gateway’s MAC address which then finds the MAC address of Y and sends to X

C

X sends an ARP request packet with broadcast MAC address in its local subnet

D

X sends an ARP request packet to the local gateway’s IP address which then finds the MAC address of Y and sends to X

Computer Networks
GATE 2019

A

16 x 2^{10}

B

8 x 2^{20}

C

4 x 2^{20}

D

256 x 2^{10}

operating systems
GATE 2019

A

Ο(n log n)

B

Ο(n^{2})

C

Ο(n)

D

Ω(n^{2}log n)

Algorithms
GATE 2019

**I.**G has a unique minimum spanning tree if no two edges of G have the same weight.**II.**G has a unique minimum spanning tree if, for every cut G, there is a unique minimum weight edge crossing the cut.

A

Neither I nor II

B

I only

C

II only

D

Both I and II

Algorithms
GATE 2019

A

X_{p} + X_{q} < Min {Y_{k} ? 1 ≤ k ≤ n, k ≠ p, k ≠ q}

B

Min (X_{p}, X_{q}) ≥ Min {Y_{k} ? 1 ≤ k≤ n, k ≠ p, k ≠ q}

C

Min (X_{p}, X_{q}) ≤ Max {Y_{k} ? 1 ≤ k ≤ n, k ≠ p, k ≠ q}

D

X_{p} + X_{q} < Max {Y_{k} ? 1 ≤ k ≤ n, k ≠ p, k ≠ q}

operating systems
GATE 2019

**I.**The smallest element in a max-heap is always at a leaf node.**II.**The second largest element in a max-heap is always a child of the root node.**III.**A max-heap can be constructed from a binary search tree in Θ(n) time.**IV.**A binary search tree can be constructed from a max-heap in Θ(n) time.

A

II, III and IV

B

I, II and III

C

I, III and IV

D

I, II and IV

Algorithms
GATE 2019

A

2

B

3

C

1

D

4

operating systems
GATE 2019

A

4.0

B

2.0

C

9.0

D

7.0

operating systems
GATE 2019

A

160

B

145

C

172

D

124

computer organization
GATE 2019

A

5.71 to 5.73

B

4.85 to 4.86

C

2.71 to 2.73

D

4.24 to 4.26

Data Structures
GATE 2019

A

3

B

4

C

5

D

6

Computer Networks
GATE 2019

A

107

B

97

C

45

D

92

Computer Networks
GATE 2019

A

0

B

9

C

7

D

5

GATE 2019

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