Quiz: CS Quick Quiz


CS Quick QuizOnline version Test your CS basics by Динара Санабайкызы 1 Which Big-O notation describes the worst-case time of binary search on a sorted array? a O(n) b O(1) c O(n log n) d O(log n) 2 What data structure uses LIFO access? a Stack b Tree c Queue d Graph 3 Which sorting algorithm is stable and has O(n log n) average? a Quick sort (unbest) b Heap sort c Selection sort d Merge sort 4 Which component manages memory allocation in most OSes? a File system b Process scheduler c Memory manager/allocator d Network controller 5 What does Turing completeness mean? a It has multiple cores b It runs in constant time c It uses binary encoding d A system can simulate any Turing machine 6 Which programming paradigm uses objects and classes? a Logic programming b Object-oriented programming c Procedural programming d Functional programming 7 Which of the following is a non-volatile storage medium? a L1 cache b CPU cache c SSD d RAM 8 What is a Internet protocol responsible for email delivery? a FTP b SMTP c IMAP d HTTP 9 Which graph traversal visits nodes level by level? a Dijkstra’s algorithm b Topological sort c Depth-first search d Breadth-first search 10 Which database model uses tables with rows and columns? a Relational database b Document store c Key-value store d Graph database Feedback 1 Binary search halves the search space each step, giving log n time in the worst case. 2 A stack follows Last In, First Out (LIFO) order. 3 Merge sort is stable and has O(n log n) in average/worst cases. 4 The memory manager handles allocation, deallocation, and protection. 5 Turing complete means capable of performing any computation given enough time and memory. 6 OOP organizes code around objects and classes. 7 SSDs retain data without power, unlike volatile RAM. 8 SMTP handles email transfer between mail servers. 9 BFS explores neighbors before moving to next level. 10 Relational DBs store data in structured tables with relations.

1

Which Big-O notation describes the worst-case time of binary search on a sorted array?

a

O(n)

b

O(1)

c

O(n log n)

d

O(log n)

2

What data structure uses LIFO access?

a

Stack

b

Tree

c

Queue

d

Graph

3

Which sorting algorithm is stable and has O(n log n) average?

a

Quick sort (unbest)

b

Heap sort

c

Selection sort

d

Merge sort

4

Which component manages memory allocation in most OSes?

a

File system

b

Process scheduler

c

Memory manager/allocator

d

Network controller

5

What does Turing completeness mean?

a

It has multiple cores

b

It runs in constant time

c

It uses binary encoding

d

A system can simulate any Turing machine

6

Which programming paradigm uses objects and classes?

a

Logic programming

b

Object-oriented programming

c

Procedural programming

d

Functional programming

7

Which of the following is a non-volatile storage medium?

a

L1 cache

b

CPU cache

c

SSD

d

RAM

8

What is a Internet protocol responsible for email delivery?

a

FTP

b

SMTP

c

IMAP

d

HTTP

9

Which graph traversal visits nodes level by level?

a

Dijkstra’s algorithm

b

Topological sort

c

Depth-first search

d

Breadth-first search

10

Which database model uses tables with rows and columns?

a

Relational database

b

Document store

c

Key-value store

d

Graph database

Feedback

1

Binary search halves the search space each step, giving log n time in the worst case.

2

A stack follows Last In, First Out (LIFO) order.

3

Merge sort is stable and has O(n log n) in average/worst cases.

4

The memory manager handles allocation, deallocation, and protection.

5

Turing complete means capable of performing any computation given enough time and memory.

6

OOP organizes code around objects and classes.

7

SSDs retain data without power, unlike volatile RAM.

8

SMTP handles email transfer between mail servers.

9

BFS explores neighbors before moving to next level.

10

Relational DBs store data in structured tables with relations.

You can integrate the game into an LMS compatible with LTI 1.1 or LTI 1.3 such as Canvas, Moodle, or Blackboard. This way, the scores will be automatically saved into the platform’s gradebook.

CS Quick Quiz

Quiz

About this activity

Created by

Download the paper version to play

Top Games

Quiz

Spanish Alphabet Listening

Quiz

Tissues - Practice Quiz

Quiz

Practice Quiz - Punnett Square, Variation, and Mutations

Quiz

Photosynthesis vs Cellular Respiration - Practice Quiz

Quiz

UPS 5 Seeing Habits Quiz

CS Quick QuizOnline version

by Динара Санабайкызы

Which Big-O notation describes the worst-case time of binary search on a sorted array?

What data structure uses LIFO access?

Which sorting algorithm is stable and has O(n log n) average?

Which component manages memory allocation in most OSes?

What does Turing completeness mean?

Which programming paradigm uses objects and classes?

Which of the following is a non-volatile storage medium?

What is a Internet protocol responsible for email delivery?

Which graph traversal visits nodes level by level?

Which database model uses tables with rows and columns?

Feedback

		%
	Anonymous	%
		%
		%