Home >
Subjects >
Theory of Computation
GATE CSE Concept Authority Hub
Theory of Computation Solved GATE Questions
Explore DFA/NFA minimization, context-free grammars (CFG), Turing machines, undecidability, and Chomsky hierarchy proofs.
Indexed Doubts
8 Questions
Core Syllabus Focus
GATE & ISRO CS
Practice Questions (8)
interview_new_1004
Here is a detailed breakdown of my interview process at Apple for the Graduate Software Engineer position. There were 4 rounds in total, focusing heav...
Asked by NileshNama
Votes: 28 | Views: 604
gate_pyq_2013
### 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: 26 | Views: 62
gate_pyq_2005
### 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: 23 | Views: 170
gate_pyq_2045
### 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: 22 | Views: 121
gate_pyq_2029
### 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: 17 | Views: 120
gate_pyq_2037
### 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: 7 | Views: 170
gate_pyq_2021
### 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: 5 | Views: 160
query_new_1004
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: 4 | Views: 113
Explore Other GATE CSE Subjects