Skip to content

GATE CS question library

Practise GATE CS Computer Science previous year questions free. Browse by subject, syllabus topic, year and question type, with answers and available solutions.

Subject, topic, year and type filter the full library. Match any choice within a filter, and all selected filter categories. Search, source and sort apply to this page.

20 on this page
Official PYQ2014Theory of ComputationUndecidabilityMCQ · 1 mark
Let LL be a language and Lˉ\bar{L} be its complement. Which one of the following is NOT a viable possibility?
Official PYQ2014Compiler DesignParsing (LL, LR)MCQ · 1 mark
A canonical set of items is given below S→L.>RS \to L .> R Q→R.Q \to R. On input symbol << the set has
Official PYQ2014Operating SystemMemory Management and Virtual MemoryNAT · 1 mark
Assume that there are 33 page frames which are initially empty. If the page reference string is 1, 2, 3, 4, 2, 1, 5, 3, 2, 4, 6\text{1, 2, 3, 4, 2, 1, 5, 3, 2, 4, 6} the number of page faults using the optimal replacement policy is__________.
Official PYQ2014Operating SystemCPU SchedulingNAT · 1 mark
Consider the following set of processes that need to be scheduled on a single CPU. All the times are given in milliseconds. …
Official PYQ2014Operating SystemDeadlockMCQ · 1 mark
An operating system uses the Banker's algorithm for deadlock avoidance when managing the allocation of three resource types X,Y,X, Y, and ZZ to three processes P0,P1,P0, P1, and P2.P2. The table given below presents the current system state. Here, the Allocation matrix shows the current number of resources of each type allocated to each process and the Max …
Official PYQ2014DatabasesNormal FormsMCQ · 1 mark
Given the following two statements: S1: Every table with two single-valued attributes is in 1NF, 2NF, 3NF\text{1NF, 2NF, 3NF} and BCNF.\text{BCNF}. S2: AB→C,D→E,E→CAB \to C, D \to E, E \to C is a minimal cover for the set of functional dependencies AB→C,D→E,AB→E,E→CAB \to C, D \to E, AB \to E, E \to C. Which one of the following is CORRECT?
Official PYQ2014DatabasesTransactions and Concurrency ControlMCQ · 1 mark
Consider the following four schedules due to three transactions (indicated by the subscript) using read and write on a data item x, denoted by r(x)r(x) and w(x)w(x) respectively. Which one of them is conflict serializable?
Official PYQ2014Computer NetworksTransport Layer: Flow Control, Congestion Control, UDP, TCP, SocketsNAT · 1 mark
Consider a selective repeat sliding window protocol that uses a frame size of 11 KB\text{KB} to send data on a 1.51.5 Mbps\text{Mbps} link with a one-way latency of 5050 msec\text{msec}. To achieve a link utilization of 60%60\%, the minimum number of bits required to represent the sequence number field is ________.
Official PYQ2014Computer NetworksTransport Layer: Flow Control, Congestion Control, UDP, TCP, SocketsNAT · 1 mark
Let the size of congestion window of a TCP connection be 3232 KB when a timeout occurs. The round trip time of the connection is 100100 msec and the maximum segment size used is 22 KB. The time taken (in msec) by the TCP connection to get back to 3232 KB congestion window is _________.
Official PYQ2014Computer NetworksData Link Layer: Framing, Error Detection, MAC, Ethernet BridgingNAT · 1 mark
Consider a token ring network with a length of 2 km having 10 stations including a monitoring station. The propagation speed of the signal is 2×108m/s2 \times10^8m/s and the token transmission time is ignored. If each station is allowed to hold the token for 2µsec2 µsec, the minimum time for which the monitoring station should wait (in µsecµsec) before assuming …
Official PYQ2014Web Technologies (Historical)MCQ · 1 mark
Identify the correct order in which the following actions take place in an interaction between a web browser and a web server. The web browser requests a webpage using HTTP. The web browser establishes a TCP connection with the web server. The web server sends the requested webpage using HTTP. The web browser resolves the domain name using DNS.
Official PYQ2014Computer NetworksRouting Protocols: Shortest Path, Flooding, Distance Vector, Link StateMCQ · 1 mark
Which of the following are used to generate a message digest by the network security protocols? RSA SHA-11 DES MD5
Official PYQ2014DatabasesTuple Calculus and SQLMCQ · 1 mark
Given the following statements: S1: A foreign key declaration can always be replaced by an equivalent check assertion in SQL. S2: Given the table R(a,b,c)R(a,b,c) where aa and bb together form the primary key, the following is a valid table definition. CREATE TABLE S ( a INTEGER, d INTEGER, e INTEGER, PRIMARY KEY (d), FOREIGN KEY (a) references R) Which …
Official PYQ2014Computer NetworksRouting Protocols: Shortest Path, Flooding, Distance Vector, Link StateMCQ · 1 mark
Consider the following three statements about link state and distance vector routing protocols, for a large network with 500500 network nodes and 40004000 links. [S1]: The computational overhead in link state protocols is higher than in distance vector protocols. [S2]: A distance vector protocol (with split horizon) avoids persistent routing loops, but not …
Official PYQ2014DatabasesNormal FormsMCQ · 1 mark
Consider the relation scheme R=(E,F,G,H,I,J,K,L,M,N)R = (E, F, G, H, I, J, K, L, M, N) and the set of functional dependencies {{E,F}→{G},{F}→{I,J},{E,H}→{K,L},{K}→{M},{L}→{N}}\left\{ \{E, F \} \to \{G\}, \{F\} \to \{I, J\}, \{E, H\} \to \{K, L\}, \\ \{K\} \to \{M\}, \{L\} \to \{N\}\right\} on RR. What is the key for RR?
Official PYQ2014Operating SystemProcesses and ThreadsMCQ · 1 mark
Which one of the following is FALSE?
Official PYQ2014Operating SystemI/O SchedulingNAT · 1 mark
Suppose a disk has 201201 cylinders, numbered from 00 to 200200. At some time the disk arm is at cylinder 100100, and there is a queue of disk access requests for cylinders 30,85,90,100,105,110,13530, 85, 90, 100, 105, 110, 135 and 145145. If Shortest-Seek Time First (SSTF) is being used for scheduling the disk access, the request for cylinder 9090 is serviced after …
Official PYQ2014Software Engineering (Historical)MCQ · 1 mark
Match the following: 1) Waterfall model a) Specifications can be developed incrementally 2) Evolutionary model b) Requirements compromises are inevitable 3) Component-based software engineering c) Explicit recognition of risk 4) Spiral development d) Inflexible partitioning of the project into stages
Official PYQ2014Theory of ComputationRegular Expressions and Finite AutomataMCQ · 1 mark
Consider the finite automaton in the following figure: What is the set of reachable states for the input string 00110011?
Official PYQ2014Theory of ComputationRegular and Context-free LanguagesMCQ · 1 mark
Which one of the following is TRUE?