GATE CS Previous Year Solved Question paper

Here I am looking for the last year question paper of GATE Computer Science (CS) Exam, can you please provide me the same???

[Arun Vats]

As you are looking for the last year question paper of GATE Computer Science (CS) Exam, so here I am sharing the same with you

An index is clustered, if
(A) it is on a set of fields that form a candidate key
(B) it is on a set of fields that include the primary key
(C) the data records of the file are organized in the same order as the data entries of the index
(D) the data records of the file are organized not in the same order as the data entries of the index

Which of the following statements is/are FALSE’
1 For every non-deterministic Turing machine, there exists an equivalent deterministic Turing machine
2 Turing recognizable languages are closed under union and cornplementation
3 Turing decidable languages are closed under intersection and coinpiementation
4 Turing recognizable languages are closed under union and intersection
(A) I and 4 only (B) 1 and 3 only (C) 2 only (D) 3 only

Suppose the instruction set architecture of the processor has only two registers The only allowed compiler optimization is code motion, which moves statements from one place to another whik preserving correctness What is the minimum number of spills to memory in the compiled code’
(B)l (C) 2 (D) 3

What is the minimum number of registers needed m the instruction set architecture of the processor to compile this code segment without any spill to memory’ Do not apply any optimization other than optimizing register allocation
(A)3 (B)4 (C)5 (D)6






Rest of the Questions are attached in below file which is free of cost