List of top Computer Science and IT Engineering Questions on Context Free Languages and Pushdown Automata asked in AP PGECET

What is the primary purpose of the XML Document Type Definition (DTD)?
A developer is creating a data file to store structured information about books. The file must be self-descriptive, allow custom tags, and ensure that all tags are properly nested and closed. Which of the following XML snippets is well formed?
A user opens a web browser and requests a webpage. The request is sent to a remote machine, which processes the request and sends back the webpage content. In this scenario, which of the following correctly identifies the client and server roles?
A developer is designing a network application. She needs reliable delivery of messages with error checking, sequencing, and acknowledgment, but another part of her application needs fast transmission of data without delay, and occasional data loss is acceptable. Identify the protocols should she use for the above two cases?
A network uses a routing protocol where each router periodically shares its entire routing table with its immediate neighbours. Over time, the network experiences issues like slow convergence and routing loops (count-to-infinity problem). Determine the routing algorithm, which is most likely being used in this network.
A user is using an encryption system where a pair of keys is generated. One key is shared publicly, while the other key is kept secret by the owner and is used to decrypt messages or create digital signatures. Which key is being described?
Which application layer protocol is used to retrieve emails from a remote server to a local client?
A "Digital Signature" provides which of the following security services?
Which software process model is most appropriate for projects with poorly defined requirements that are expected to evolve significantly over time?
In project management, the "Critical Path" in a PERT/CPM chart represents:
What is the main purpose of a Translation Lookaside Buffer (TLB)?
A handle in a bottom-up parser is a substring that matches the right-hand side of a production and whose reduction represents:
Which of the following statements is TRUE regarding LL(1) grammars?
In Syntax Directed Translation (SDT), an attribute is called "inherited" if its value at a node in the parse tree is defined in terms of attributes at:
Consider the language $L = \{a^n b^n \mid n \geq 0\}$. Choose the computational model that can recognize this language.
A pushdown automaton differs from a finite automaton due to the presence of a _______ that helps in handling nested structures.
If a language $L$ and its complement $L'$ are both Recursively Enumerable (RE), then $L$ is:
According to the Rice's Theorem, any non-trivial property of the language recognized by a Turing Machine is:
Which type of grammar is mainly used in programming languages?
Name the computational model that can simulate both PDA and DFA?
A grammar is given:
$E \rightarrow E + T \mid T$
$T \rightarrow T * F \mid F$
$F \rightarrow (E) \mid id$
For the input: $id + id * id$, what is the correct interpretation?