List of top Computer Science and IT Engineering Questions

Which memory technique creates the illusion of larger memory?

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

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:

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:

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

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

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

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?

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?

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?

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

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.