Polytechnic Computer Science 1

Question 1

What is the time complexity of binary search?

Accepted Answer

O(log n)

Answer

Binary search halves the search space at each step, resulting in O(log n) time complexity.

Question 2

Which data structure uses LIFO (Last In, First Out) order?

Accepted Answer

Stack

Answer

A stack follows LIFO order, where the last element added is the first one to be removed.

Question 3

What does HTML stand for?

Accepted Answer

HyperText Markup Language

Answer

HTML stands for HyperText Markup Language, the standard language for structuring web pages.

Question 4

Which sorting algorithm has the best average-case time complexity?

Accepted Answer

Merge Sort (O(n log n))

Answer

Merge Sort consistently achieves O(n log n) time complexity in all cases by using a divide-and-conquer approach.

Question 5

What is a primary key in a relational database?

Accepted Answer

A unique identifier for each row in a table

Answer

A primary key uniquely identifies each record in a database table and cannot be null.

Polytechnic Practice Test