MCQ Subject: Computer Science

What is the average and best-case time complexity of a binary search algorithm on a sorted array?

Which sorting algorithm has an optimal space complexity of O(log n) in its recursive implementation?

What is the primary purpose of normalization in a Database Management System?

In Compiler Design, what is the primary output of the Lexical Analyzer phase?

Read the statements below and select the most appropriate conclusion. Statement 1: Any algorithm with a time complexity better than O(n²) is considered efficient for large datasets. Statement 2: Merge Sort has a time complexity of O(n log n). Which conclusion can be logically deduced?

Which normal form ensures every determinant in a relation is a candidate key?

In digital logic, which type of sequential circuit uses a clock signal to synchronize state changes across all flip-flops?

Which parsing technique can inherently handle left-recursive grammars without requiring grammar transformation?

What happens when a pointer to an integer is incremented in C?

What is the worst-case time complexity of Heap Sort algorithm?