List of top Computer Science and IT Engineering Questions asked in AP PGECET

What is the main purpose of a Translation Lookaside Buffer (TLB)?

Which of the following is a solution to the "Critical Section Problem" that satisfies mutual exclusion, progress, and bounded waiting?

Which of the following transitions is NOT possible in a standard process state transition diagram?

Three processes arrive at time 0 with burst times 5, 3, and 1 unit respectively. The scheduler always selects the process with the smallest burst time next. The order of execution will be?

Which memory technique creates the illusion of larger memory?

What is the "Thrashing" phenomenon in virtual memory systems?

Consider the following C function:
int fun(int n){
if (n == 0) return 0;
else return n + fun(n - 1);
}
What does the function fun(4) return?

In an I/O system, 'Direct Memory Access (DMA)' is used to:

'Belady’s Anomaly' refers to the phenomenon where the page fault rate increases as the number of allocated page frames increases. This is observed in which page replacement algorithm?

A system has 4 redundant units of a resource. There are 3 processes, each requiring 2 units of the resource. Which of the following is TRUE?

Which phase of a compiler checks variable declaration?

A handle in a bottom-up parser is a substring that matches the right-hand side of a production and whose reduction represents:

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

Which of the following intermediate code representations is typically used to represent expressions where each instruction has at most three operands?

In a compiler, which phase is responsible for identifying the token types from the source program's stream of characters?

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:

Which of the following statements is TRUE regarding LL(1) grammars?

Which class of problem solving is considered the easiest one?

Which type of graph does not contain any cycles?

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

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

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?

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: