List of top Questions asked in AP PGECET

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:

In the context of code optimization, "Loop Invariant Code Motion" refers to:

A lexical analyser processes the input string int x = a + 10; How many tokens are generated?

Consider the code:
$X = a * 2$
$Y = a * 2$
After optimization, what is the most efficient transformation?

Which class of problem solving is considered the easiest one?

Which type of graph does not contain any cycles?

A program requires more memory than the available physical memory. The system allows execution by loading only required parts of the program into memory while keeping the rest on disk. This mechanism is known as?

According to the Rice's Theorem, any non-trivial property of the language recognized by a Turing Machine is:

A pushdown automaton differs from a finite automaton due to the presence of a _______ that helps in handling nested structures.

Consider the language $L = \{a^n b^n \mid n \geq 0\}$. Choose the computational model that can recognize this language.

If a language $L$ and its complement $L'$ are both Recursively Enumerable (RE), then $L$ is:

Which type of grammar is mainly used in programming languages?

Name the computational model that can simulate both PDA and DFA?

In a deterministic finite automaton, the behaviour of transitions is strictly defined for every input symbol at each state. Identify the statement that correctly describes this property.

Which of the following is true about a good hash function?

What type of automaton is mainly used for simple pattern matching?

Which time complexity grows the slowest as input size increases?

Name the notation that represents the average-case complexity of an algorithm.

The problem solving technique which divides a problem into smaller sub problems and then combines their results _________

Which algorithm is commonly used to find a minimum spanning tree?

In a singly linked list, what is the time complexity to delete a node given a pointer to that specific node?

What is the time complexity of the optimal solution for the 0/1 Knapsack problem with n items and capacity W using Dynamic Programming?

Which circuit produces output only based on current inputs without memory?

A statement that is always false regardless of truth values is called______

Which sorting algorithm has the best-case time complexity of $O(n)$ when the input array is already sorted?