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 word consists of two bytes). The size of the address bus of the processor is at least ___________ bits.

Submit

computer organization
gate 2016 set 1

performed efficiently. Which one of the following statements is CORRECT (n refers to the

number of items in the queue)?

A

Both operations can be performed in O(1) time

B

At most one operation can be performed in O(1) time but the worst case time for

the other operation will be Ω(n)

the other operation will be Ω(n)

C

The worst case time complexity for both operations will be Ω(n)

D

Worst case time complexity for both operations will be Ω(logn)

Data Structures
gate 2016 set 1

Submit

Data Structures
gate 2016 set 1

A

B

C

D

Algorithms
gate 2016 set 1
Sorting

edge weight is increased by the same value, then which of the following statements is/are

TRUE?

P: Minimum spanning tree of G does not change

Q: Shortest path between any pair of vertices does not change

A

P only

B

Q only

C

Neither P nor Q

D

Both P and Q

Data Structures
gate 2016 set 1
Graphs

transfer a file of 29,154 kilobytes from disk to main memory. The memory is byte addressable.

The minimum number of times the DMA controller needs to get the control of the system bus

from the processor to transfer the file from the disk to main memory is _____________

Submit

computer organization
gate 2016 set 1

stage (with delay 800 picoseconds) is replaced with a functionally equivalent design involving

two stages with respective delays 600 and 350 picoseconds. The throughput increase of the

pipeline is percent ______________

Submit

computer organization
gate 2016 set 1

the i-th node. Assume that the heap is implemented in an array and i refers to the i-th index

of the array. If the heap tree has depth d (number of edges on the path from the root to the

farthest leaf), then what is the time complexity to re-fix the heap efficiently after the removal

of the element?

A

B

C

D

Data Structures
gate 2016 set 1

Submit

Data Structures
gate 2016 set 1
Graphs

Submit

Algorithms
gate 2016 set 1
Minimum-Spanning-Tree

Submit

Data Structures
gate 2016 set 1

a link whose MTU (maximum transmission unit) is 100 bytes. Assume that the size of the IP

header is 20 bytes.

The number of fragments that the IP datagram will be divided into for transmission is______________

Submit

Computer Networks
gate 2016 set 1

bucket has a capacity of 1 megabyte and the maximum output rate is 20 megabytes per second.

Tokens arrive at a rate to sustain output at a rate of 10 megabytes per second. The token bucket

is currently full and the machine needs to send 12 megabytes of data. The minimum time

required to transmit the data is ______________ seconds.

Submit

Computer Networks
gate 2016 set 1

are of size 1000 bytes and the transmission rate at the sender is 80 Kbps (1Kbps = 1000

bits/second). Size of an acknowledgement is 100 bytes and the transmission rate at the receiver

is 8 Kbps. The one-way propagation delay is 100 milliseconds.

Assuming no frame is lost, the sender throughput is _______________ bytes/second.

Submit

Computer Networks
gate 2016 set 1

word has an opcode, two register operands and an immediate operand. The number of bits

available for the immediate operand field is ______________

Submit

computer organization
gate 2016

a vertex t at a distance four from the root. If t is the n-th vertex in this BFS traversal, then the

maximum possible value of n is _____________

Submit

Data Structures
gate 2016

A

B

C

D

Algorithms
gate 2016
Sorting

A

Greedy paradigm.

B

Divide-and-Conquer paradigm.

C

Dynamic Programming paradigm.

D

neither Greedy nor Divide-and-Conquer nor Dynamic Programming paradigm.

Algorithms
gate 2016

A

B

C

D

Data Structures
gate 2016
Linked-List

requires

A

Anarkali’s public key.

B

Salim’s public key.

C

Salim’s private key.

D

Anarkali’s private key.

Computer Networks
gate 2016

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