Polytechnic Computer Science

Question 1

What is the time complexity of binary search?

Accepted Answer

O(log n)

Answer

O(n)

Answer

O(n²)

Answer

O(1)

Question 2

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

Accepted Answer

Stack

Answer

Queue

Answer

Linked List

Answer

Tree

Question 3

What does HTML stand for?

Accepted Answer

HyperText Markup Language

Answer

High-Level Text Machine Language

Answer

Hyper Transfer Markup Language

Answer

HyperText Management Language

Question 4

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

Accepted Answer

Merge Sort (O(n log n))

Answer

Bubble Sort (O(n²))

Answer

Insertion Sort (O(n²))

Answer

Selection Sort (O(n²))

Question 5

What is a primary key in a relational database?

Accepted Answer

A unique identifier for each row in a table

Answer

The first column of a table

Answer

A foreign reference to another table

Answer

An index for faster queries

Question 6

What is the base of the binary number system?

Accepted Answer

2

Answer

8

Answer

10

Answer

16