GATE CSE Concept Authority Hub

Algorithms Solved GATE Questions

Analyze greedy selections, dynamic programming, recurrence relations, graph search, and worst-case sorting comparisons.

Indexed Doubts 8 Questions
Core Syllabus Focus GATE & ISRO CS

Practice Questions (8)

interview_new_1008

Uber CSE Software Engineer Interview Experience - 2026 Grad

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

Asked by NileshNama Votes: 29 | Views: 439
gate_pyq_2049

[Q49] Optimal matrix chain multiplication sequence using Dynamic Programming (Verification Case #49)

### 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 NQuestioner Votes: 24 | Views: 150
gate_pyq_2041

[Q41] Asymptotic complexity of recursive Merge Sort recurrence relation (Verification Case #41)

### 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 NQuestioner Votes: 21 | Views: 132
gate_pyq_2009

[Q9] Optimal matrix chain multiplication sequence using Dynamic Programming (Verification Case #9)

### 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 NQuestioner Votes: 16 | Views: 283
gate_pyq_2017

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

### 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 NQuestioner Votes: 14 | Views: 171
gate_pyq_2033

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

### 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 NQuestioner Votes: 14 | Views: 132
query_new_1008

Conceptual Query: How are Page Tables stored in memory and indexed using Multi-level paging?

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 NileshNama Votes: 11 | Views: 70
gate_pyq_2025

[Q25] Difference between 0/1 Knapsack and Fractional Knapsack (Verification Case #25)

### 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 NQuestioner Votes: 7 | Views: 263

Explore Other GATE CSE Subjects

Theory of ComputationOperating SystemsComputer NetworksDatabase Management SystemsEngineering MathematicsComputer Organization and ArchitectureDigital LogicData StructuresCompiler Design