π
GATE CS - Previous Year Questions
Actual GATE CS exam questions from previous years (2020-2025)
142 questionsΓ’β¬Β’15 pagesΓ’β¬Β’~213 min
Use this quiz track to strengthen recall, speed, and exam-style decision making. Attempt one page first, review explanations, and then re-attempt incorrect questions without notes.
A good scoring strategy is to mark uncertain questions, finish known ones quickly, and return with elimination logic. This improves accuracy while keeping momentum under time constraints.
Progress: 0 / 1420%
Page 7 of 15 β’ Questions 61-70 of 142
Q61medium
[GATE CS 2025 Set-2 Q42] Let β± be the set of all functions from {1,β¦,π} to {0,1}. Define the binary relation βΌ on β± as follows: βπ,π β β±, π βΌ π if and only if βπ₯ β {1,β¦,π}, π(π₯) β€ π(π₯), where 0 β€ 1. Which of the following statement(s) is/are TRUE?
Q62medium
[GATE CS 2025 Set-2 Q43] Given the following Karnaugh Map for a Boolean function πΉ(π€,π₯,π¦,π§): Which one or more of the following Boolean expression(s) represent(s) πΉ?
Q63medium
[GATE CS 2025 Set-2 Q44] Consider a system of linear equations ππ = π where π β β3Γ3 and Q β β3Γ1. Suppose π has an LU decomposition, π = πΏπ, where 1 0 0 π’ π’ π’ 11 12 13 πΏ = [π 1 0] and π = [ 0 π’ π’ ]. 21 22 23 π π 1 0 0 π’ 31 32 33 Which of the following statement(s) is/are TRUE?
Q64medium
[GATE CS 2025 Set-2 Q45] Consider a stack data structure into which we can PUSH and POP records. Assume that each record pushed in the stack has a positive integer key and that all keys are distinct. We wish to augment the stack data structure with an π(1) time MIN operation that returns a pointer to the record with smallest key present in the stack 1) without deleting the corresponding record, and 2) without increasing the complexities of the standard stack operations. Which one or more of the following approach(es) can achieve it?
Q65medium
[GATE CS 2025 Set-2 Q46] Consider the following relational schema along with all the functional dependencies that hold on them. R1(A, B, C, D, E): { π· β πΈ, πΈπ΄ β π΅, πΈπ΅ β πΆ} R2(A, B, C, D): { π΄ β π·, π΄ β π΅, πΆ β π΄} Which of the following statement(s) is/are TRUE?
Q66medium
[GATE CS 2025 Set-2 Q47] Consider a demand paging system with three frames, and the following page reference string: 1 2 3 4 5 4 1 6 4 5 1 3 2. The contents of the frames are as follows initially and after each reference (from left to right): initially after - 1* 2* 3* 4* 5* 4 1 6* 4 5 1* 3* 2* - 1 1 1 1 1 1 1 6 6 6 6 6 2 - - 2 2 4 4 4 4 4 4 4 1 1 1 - - - 3 3 5 5 5 5 5 5 5 3 3 The *-marked references cause page replacements. Which one or more of the following could be the page replacement policy/policies in use?
Q67medium
[GATE CS 2025 Set-2 Q48] π = {π ,π ,π ,π } consists of all active processes in an operating system. 1 2 3 4 π = {π ,π ,π ,π } consists of single instances of distinct types of resources in the 1 2 3 4 system. The resource allocation graph has the following assignment and claim edges. Assignment edges: π β π , π β π , π β π , π β π (the assignment edge 1 1 2 2 3 3 4 4 π β π means resource π is assigned to process π , and so on for others) 1 1 1 1 Claim edges: π β π , π β π , π β π , π β π , π β π (the claim edge 1 2 2 3 3 1 2 4 4 2 π β π means process π is waiting for resource π , and so on for others) 1 2 1 2 Which of the following statement(s) is/are CORRECT?
Q68medium
[GATE CS 2025 Set-2 Q49] Three floating point numbers π,π, and π are stored in three registers R , R , and X Y R , respectively in IEEE 754 single precision format as given below in Z hexadecimal: R = 0xC1100000, R = 0x40C00000, and R = 0x41400000 X Y Z Which of the following option(s) is/are CORRECT?
Q69medium
[GATE CS 2025 Set-2 Q50] Which of the following Boolean algebraic equation(s) is/are CORRECT?
Q70medium
[GATE CS 2025 Set-2 Q51] Consider two grammars πΊ and πΊ with the production rules given below: 1 2 πΊ : π β ππ πΈ π‘βππ π | ππ πΈ π‘βππ π πππ π π | π 1 πΈ β π πΊ :π β ππ πΈ π‘βππ π | π 2 π β ππ πΈ π‘βππ π πππ π π | π πΈ β π where ππ,π‘βππ,πππ π,π,π,π are the terminals. Which of the following option(s) is/are CORRECT?
......