GATE CS Applied Course

GATE Previous Year Wise Questions

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

GATE Previous Subject Wise Questions

Data Structures Algorithms operating systems computer organization Computer Networks DBMS Graph Theory
Question 101
Submit
Algorithms GATE 2015 SET 1 Minimum-Spanning-Tree
Question 102
An unordered list contains n distinct elements. The number of comparisons to find an element in
this list that is neither maximum nor minimum is
A
Θ(nlog n)
B
Θ(n)
C
Θ(log n)
D
Θ(1)
Algorithms GATE 2015 SET 2
Question 103
Assume that for a certain processor, a read request takes 50 nanoseconds on a cache miss and 5
nanoseconds on a cache hit. Suppose while running a program, it was observed that 80% of the
processor's read requests result in a cache hit. The average read access time in nanoseconds is
__________.
Submit
computer organization GATE 2015 SET 2
Question 104
Consider a complete binary tree where the left and the right subtrees of the root are max-heaps. The
lower bound for the number of operations to convert the tree to a heap is
A
Ω(log n)
B
Ω(n)
C
Ω(n log n)
D
Data Structures GATE 2015 SET 2 Heap-Tree
Question 105
A binary tree T has 20 leaves. The number of nodes in T having two children is _______.
Submit
Data Structures GATE 2015 SET 2 Binary-Trees
Question 106
A system has 6 identical resources and N processes competing for them. Each process can request
atmost 2 resources. Which one of the following values of N could lead to a deadlock?
A
1
B
2
C
3
D
6
operating systems GATE 2015 SET 2
Question 107
Submit
Computer Networks GATE 2015 SET 2
Question 108
A
i-a, ii-c, iii-e, iv-d
B
i-a, ii-d, iii-b, iv-e
C
i-b, ii-c, iii-d, iv-e
D
i-b, ii-c, iii-e, iv-d
Computer Networks GATE 2015 SET 2
Question 109
Host A sends a UDP datagram containing 8880 bytes of user data to host B over an Ethernet LAN.
Ethernet frames may carry data up to 1500 bytes (i.e. MTU=1500 bytes). Size of UDP header is 8
bytes and size of IP header is 20 bytes. There is no option field in IP header. How many total
number of IP fragments will be transmitted and what will be the contents of offset field in the last
fragment?
A
6 and 925
B
6 and 7400
C
7 and 1110
D
7 and 8880
Computer Networks GATE 2015 SET 2
Question 110
A
R contains a, b, e, f, g but not c, d.
B
R contains all of a, b, c, d, e, f, g.
C
R contains e, f, g but not a, b.
D
R contains e but not f, g.
DBMS GATE 2015 SET 2
Question 111
Consider six memory partitions of sizes 200 KB, 400 KB, 600 KB, 500 KB, 300 KB and 250 KB,
where KB refers to kilobyte. These partitions need to be allotted to four processes of sizes 357 KB,
210 KB, 468 KB and 491 KB in that order. If the best fit algorithm is used, which partitions are
NOT allotted to any process?
A
200 KB and 300 KB
B
200 KB and 250 KB
C
250 KB and 300 KB
D
300 KB and 400 KB
operating systems GATE 2015 SET 2
Question 112
Submit
operating systems GATE 2015 SET 2
Question 113
A computer system implements 8 kilobyte pages and a 32-bit physical address space. Each page
table entry contains a valid bit, a dirty bit, three permission bits, and the translation. If the
maximum size of the page table of a process is 24 megabytes, the length of the virtual address
supported by the system is _______________ bits.
Submit
operating systems GATE 2015 SET 2
Question 114

Match the above algorithms on the left to the corresponding design paradigm they follow.
A
1-i, 2-iii, 3-i, 4-v.
B
1-iii, 2-iii, 3-i, 4-v.
C
1-iii, 2-ii, 3-i, 4-iv.
D
1-iii, 2-ii, 3-i, 4-v.
Algorithms GATE 2015 SET 2
Question 115
Submit
Data Structures GATE 2015 SET 2
Question 116
A
(a, left_end, k) and (a+left_end+1, n-left_end-1, k-left_end-1)
B
(a, left_end, k) and (a, n-left_end-1, k-left_end-1)
C
(a+left_end+1, n-left_end-1, k-left_end-1) and (a, left_end, k)
D
(a, n-left_end-1, k-left_end-1) and (a, left_end, k)
Algorithms GATE 2015 SET 2
Question 117
A
B
C
D
Data Structures GATE 2015 SET 2 Hashing
Question 118
Submit
computer organization GATE 2015 SET 2
Question 119
The maximum number of processes that can be in Ready state for a computer system with n CPUs
is
A
n
B
C
D
Independent of n
operating systems GATE 2015 SET3
Question 120
Consider the following statements.

I. TCP connections are full duplex
II. TCP has no option for selective acknowledgement
III. TCP connections are message streams
A
Only I is correct
B
Only I and III are correct
C
Only II and III are correct
D
All of I, II and III are correct
Computer Networks GATE 2015 SET3
TESTIMONIAL'S
Team
Contact Us
Terms & Conditions
Privacy Policy
Youtube
Facebook
Linkedin
Powered by
Buy Gate CS
Free Videos
Practice Tests
Forum
FAQ'S
Team
Contact Us
Terms & Conditions
Privacy Policy
Youtube
Facebook
Linkedin
Powered by
© 2024 - All rights are reserved- AAIC Technologies pvt ltd