MCQ Subject: Computer Science

What is the time complexity of an algorithm that iterates through a list of n elements, and for each element, it performs a constant amount of work?

Which parsing technique is characterized by constructing the parse tree from the root to the leaves, typically used in top-down parsing?

Which intermediate code form is primarily used for its efficiency in optimization and code generation?

Which database design technique is primarily used to reduce data redundancy and improve data integrity by minimizing data dependency?

What is the primary concern when two pointers alias the same integer variable in C?

In a directed graph, which of the following is a necessary condition for a Depth-First Search (DFS) to detect a cycle?

Which database normalization form minimally ensures elimination of partial dependencies?

During TCP connection establishment, which packet sequence is exchanged between client and server?

Which of the following is a key difference between a semaphore and a monitor in Operating Systems?

In a graph with ‘n’ vertices, which representation requires O(n^2) space to store all possible edges?