Computer Science Challenge

Computer Science Challenge

11th Grade

20 Qs

quiz-placeholder

Similar activities

CIW

CIW

9th - 12th Grade

15 Qs

CS J277 Unit 6 Algorithms

CS J277 Unit 6 Algorithms

11th Grade

24 Qs

Computer Science Vocabulary

Computer Science Vocabulary

9th - 12th Grade

20 Qs

Unit 3 Problem Solving Quiz- Part 2

Unit 3 Problem Solving Quiz- Part 2

9th - 12th Grade

20 Qs

CSP Vocab Practice 1

CSP Vocab Practice 1

10th - 12th Grade

16 Qs

Quiz5

Quiz5

9th - 12th Grade

15 Qs

Unit 1 Vocabulary

Unit 1 Vocabulary

9th - 12th Grade

21 Qs

iGCSE Computer Science: Problem Solving

iGCSE Computer Science: Problem Solving

9th - 12th Grade

20 Qs

Computer Science Challenge

Computer Science Challenge

Assessment

Quiz

Computers

11th Grade

Hard

Created by

reet bal

FREE Resource

20 questions

Show all answers

1.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

What is a sorting algorithm that works by repeatedly stepping through the list, comparing each pair of adjacent items and swapping them if they are in the wrong order?

Merge Sort

Insertion Sort

Bubble Sort

Quick Sort

2.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

Which programming language is known for its simplicity and readability, often used for web development?

Python

C++

Ruby

JavaScript

3.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

What data structure organizes data in a hierarchical manner using nodes?

Tree

Graph

Stack

Queue

4.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

What type of network connects computers within a limited area such as a school or office building?

CAN

LAN

MAN

WAN

5.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

Which component of an operating system manages the communication between hardware and software?

RAM

Kernel

CPU

BIOS

6.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

What is the practice of protecting systems, networks, and programs from digital attacks called?

digital defense

data protection

online security

cybersecurity

7.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

Which algorithm is used to find the shortest path in a graph from a source node to all other nodes?

A* algorithm

Prim's algorithm

Dijkstra's algorithm

Bellman-Ford algorithm

Create a free account and access millions of resources

Create resources
Host any resource
Get auto-graded reports
or continue with
Microsoft
Apple
Others
By signing up, you agree to our Terms of Service & Privacy Policy
Already have an account?