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 PYQ2001Operating SystemI/O SchedulingMCQ · 1 mark
Consider a disk with the 100100 tracks numbered from 00 to 9999 rotating at 30003000 rpm. The number of sectors per track is 100100 and the time to move the head between two successive tracks is 0.20.2 millisecond.
Official PYQ2001Operating SystemI/O SchedulingNAT · 1 mark
Consider a disk with the following specifications: 20 surfaces, 1000 tracks/surface, 16 sectors/track, data density 1 KB/sector, rotation speed 3000 rpm. The operating system initiates the transfer between the disk and the memory sector-wise. Once the head has been placed on the right track, the disk reads a sector in a single scan. It reads bits from the …
Official PYQ2001DatabasesTuple Calculus and SQLMCQ · 1 mark
Consider a relation geq which represents "greater than or equal to", that is, (x,y)∈(x,y) \in geq only if y≥xy \geq x. create table geq ( ib integer not null, ub integer not null, primary key ib, foreign key (ub) references geq on delete cascade ); Which of the following is possible if tuple (x,y) is deleted?
Official PYQ2001DatabasesTuple Calculus and SQLMCQ · 1 mark
Which of the following relational calculus expression is not safe?
Official PYQ2001DatabasesNormal FormsMCQ · 1 mark
R(A,B,C,D)R(A,B,C,D) is a relation. Which of the following does not have a lossless join, dependency preserving BCNFBCNF decomposition?
Official PYQ2001Operating SystemConcurrency and SynchronizationMCQ · 1 mark
Consider Peterson's algorithm for mutual exclusion between two concurrent processes i and j. The program executed by process is shown below. repeat flag[i] = true; turn = j; while (P) do no-op; Enter critical section, perform actions, then exit critical section Flag[i] = false; Perform other non-critical section actions. Until false; For the program to …
Official PYQ2001Operating SystemMemory Management and Virtual MemoryMCQ · 1 mark
Consider a machine with 6464 MB physical memory and a 3232-bit virtual address space. If the page size s 44 KB, what is the approximate size of the page table?
Official PYQ2001Operating SystemProcesses and ThreadsMCQ · 1 mark
Which of the following does not interrupt a running process?
Official PYQ2001Programming and Data StructuresProgramming in CMCQ · 1 mark
Consider the following program Program P2 var n : int; procedure W(var x : int) begin x = x + 1; print x; end procedure D begin var n : int; n = 3; W(n); end begin \\begin P2 n=10; D; end If the language has dynamic scooping and parameters are passed by reference, what will be printed by the program?
Official PYQ2001Programming and Data StructuresProgramming in CMCQ · 1 mark
Consider the following three C functions: [P1][P1] int *g(void) { int x = 10; return (&x); } [P2][P2] int *g(void) { int *px; *px = 10; return px; } [P3][P3] int *g(void) { int *px; px = (int*) malloc (sizeof(int)); *px = 10; return px; } Which of the above three functions are likely to cause problems with pointers?
Official PYQ2001Programming and Data StructuresProgramming in CMCQ · 1 mark
What is printed by the print statements in the program P1P1 assuming call by reference parameter passing? Program P1() { x = 10; y = 3; func1(y,x,x); print x; print y; } func1(x,y,z) { y = y + 4; z = x + y + z }
Official PYQ2001Programming and Data StructuresArrays, Stacks and QueuesMCQ · 1 mark
What is the minimum number of stacks of size nn required to implement a queue of size nn?
Official PYQ2001Engineering MathematicsGraphs: Connectivity, Matching, ColouringMCQ · 1 mark
How many undirected graphs (not necessarily connected) can be constructed out of a given set V={v1,v2,…vn}V=\{v_1, v_2, \dots v_n\} of nn vertices?
Official PYQ2001AlgorithmsGraph Traversals (BFS, DFS)MCQ · 1 mark
Consider an undirected, unweighted graph GG. Let a breadth-first traversal of GG be done starting from a node rr. Let d(r,u)d(r,u) and d(r,v)d(r,v) be the lengths of the shortest paths from rr to uu and vv respectively in GG. If uu is visited before vv during the breadth-first traversal, which of the following statements is correct?
Official PYQ2001Computer Organization and ArchitectureALU, Data-path and Control UnitMCQ · 1 mark
Consider the following data path of a simple non-pipelined CPU. The registers A,BA, B, A1,A2,MDR,A_{1},A_{2}, \textsf{MDR}, the bus\textsf{bus} and the ALU\textsf{ALU} are 88-bitbit wide. SP\textsf{SP} and MAR\textsf{MAR} are 1616-bitbit registers. The MUX\textsf{MUX} is of size 8×(2:1)8 \times (2:1) and the DEMUX\textsf{DEMUX} is of size …
Official PYQ2001Digital LogicSequential CircuitsMCQ · 1 mark
Consider the circuit given below with initial state Q0=1,Q1=Q2=0Q_0=1, Q_1=Q_2=0. The state of the circuit is given by the value 4Q2+2Q1+Q04Q_2+2Q_1+Q_0 Which one of the following is correct state sequence of the circuit?
Official PYQ2001Digital LogicCombinational CircuitsMCQ · 1 mark
Consider the circuit shown below. The output of a 2:12:1 MUX is given by the function (ac′+bc)(ac' + bc). Which of the following is true?
Official PYQ2001Digital LogicNumber Representations (Fixed and Floating Point)MCQ · 1 mark
The 2′s2's complement representation of (-539)10 in hexadecimal is
Official PYQ2001Computer Organization and ArchitectureMachine Instructions and Addressing ModesMCQ · 1 mark
Which is the most appropriate match for the items in the first column with the items in the second column: …
Official PYQ2001Digital LogicCombinational CircuitsMCQ · 1 mark
Consider the following circuit with initial state Q0=Q1=0Q_0 = Q_1 = 0. The D Flip-flops are positive edged triggered and have set up times 20 nanosecond and hold times 0.0. Consider the following timing diagrams of X and C. The clock period of C≥40C \geq 40 nanosecond. Which one is the correct plot of Y?