GATE CSE Concept Authority Hub

Computer Organization and Architecture Solved GATE Questions

Understand pipeline hazard bubbles, cache hit mapping, instruction set ISA formats, and memory interleaving math.

Indexed Doubts 8 Questions
Core Syllabus Focus GATE & ISRO CS

Practice Questions (8)

gate_pyq_2006

[Q6] Asymptotic complexity of recursive Merge Sort recurrence relation (Verification Case #6)

### Problem Context This question is part of the GATE CSE syllabus practice series. Compute the closed-form time complexity of the classic Merge S...

Asked by NileshNama Votes: 34 | Views: 273
gate_pyq_2038

[Q38] Finding the single shortest path in graphs with negative edges (Verification Case #38)

### Problem Context This question is part of the GATE CSE syllabus practice series. Why does Dijkstra's algorithm fail on negative edge weights? P...

Asked by NileshNama Votes: 34 | Views: 105
gate_pyq_2046

[Q46] Asymptotic complexity of recursive Merge Sort recurrence relation (Verification Case #46)

### Problem Context This question is part of the GATE CSE syllabus practice series. Compute the closed-form time complexity of the classic Merge S...

Asked by NileshNama Votes: 31 | Views: 51
interview_new_1005

Meta CSE Software Engineer Interview Experience - 2026 Grad

Here is a detailed breakdown of my interview process at Meta for the Graduate Software Engineer position. There were 4 rounds in total, focusing heavi...

Asked by NQuestioner Votes: 30 | Views: 347
gate_pyq_2014

[Q14] Optimal matrix chain multiplication sequence using Dynamic Programming (Verification Case #14)

### Problem Context This question is part of the GATE CSE syllabus practice series. Given matrices $A_1, A_2, A_3$ of dimensions $10 \times 20$, $...

Asked by NileshNama Votes: 24 | Views: 76
gate_pyq_2030

[Q30] Difference between 0/1 Knapsack and Fractional Knapsack (Verification Case #30)

### Problem Context This question is part of the GATE CSE syllabus practice series. Formulate the optimal substructure for 0/1 Knapsack and explai...

Asked by NileshNama Votes: 23 | Views: 214
gate_pyq_2022

[Q22] Detecting a cycle in a directed graph using Depth First Search (DFS) (Verification Case #22)

### Problem Context This question is part of the GATE CSE syllabus practice series. What is the algorithm and space complexity for cycle detection...

Asked by NileshNama Votes: 9 | Views: 100
query_new_1005

Conceptual Query: How does 2-Phase Locking (2PL) guarantee serializability?

Hi peers, I was reviewing the previous year questions on this topic and got confused by the explanation in the textbooks. Can anyone write down the...

Asked by NQuestioner Votes: 7 | Views: 73

Explore Other GATE CSE Subjects

Theory of ComputationOperating SystemsComputer NetworksDatabase Management SystemsEngineering MathematicsDigital LogicData StructuresAlgorithmsCompiler Design