Back to the 2025 paper
Similar questions
FORMAL LANGUAGE & AUTOMATA THEORYWhich of the following is a PDA? (i) Finite automaton with a stack (ii) Turing machine with a stack (iii) Finite automaton with a queue (iv) Turing machine with a queue20242mDesign and Analysis of Algorithms In DFS traversal of a graph, which data structure is used to keep track of visited nodes? (i) Queue (ii) Stack (iii) Priority Queue (iv) Heap20242mFormal Language & Automata TheoryThe lexical analysis for a modern language such as Java needs the power of which one of the following machine models in a necessary and sufficient sense? (i) Finite state automata (ii) Deterministic pushdown automata (iii) Non-deterministic pushdown automata (iv) Turing machine20202mDesign and Analysis of Algorithms A FIFO Branch-and-Bound strategy is typically implemented using which data structure? (i) Stack (ii) Queue (iii) Priority Queue (iv) Array20252m
PreviousWhich phase of compiler converts source code into tokens? (i) Code generation (ii) Lexical analysis (iii) Optimization (iv) ParsingNextWhich automaton accepts regular languages? (i) PDA (ii) DFA (iii) Turing machine (iv) LBA
AI LearningWeb Platform
Coursify — Personal AI Course Generator
Struggling with a difficult subject or concept? Turn any engineering topic into a structured course with interactive lessons, quizzes, and research-backed explanations.