Unit 3 Lesson 1

Question 1

Bubble sort

Answer 1

A simple sorting algorithm that repeatedly steps through a list, compares adjacent elements, and swaps them if they are in the wrong order.

Question 2

Concrete step

Answer 2

A detailed action that specifies exactly how to perform a task.

Question 3

Count-controlled loop

Answer 3

A loop that repeats a specific number of times, controlled by a counter variable (e.g., ‘for’ loop).

Question 4

Desk checking

Answer 4

A manual method of reviewing the logic of a program or algorithm using a pencil and paper instead of a computer.

Question 5

Event-controlled loop

Answer 5

A loop that continues to execute until a specific condition or event occurs, such as user input or a sensor reading.

Question 6

Heterogeneous

Answer 6

A term describing a collection of items that are of different types.

Question 7

Homogenous

Answer 7

A term describing a collection of items that are all of the same type.

Question 8

Index

Answer 8

A numerical representation of an element’s position within an array or list.

Question 9

Insertion sort

Answer 9

A sorting algorithm that builds the final sorted array one item at a time by inserting each new item into its correct position.

Question 10

Processing

Answer 10

The act of performing operations on data according to a set of instructions to achieve a desired result.

Question 11

Record

Answer 11

A composite variable that can store multiple fields of different data types, usually related to a single entity.

Question 12

Searching

Answer 12

The process of finding a specific item or value within a collection of data.

Question 13

Selection sort

Answer 13

A simple sorting algorithm that repeatedly finds the minimum element from the unsorted part of a list and moves it to the beginning.

Question 14

Sequential search (linear search)

Answer 14

A search algorithm that checks each element in a list one by one until the desired element is found or the list ends.

Question 15

Sorting

Answer 15

The process of arranging data in a particular order, such as ascending or descending.

Question 16

Array

Answer 16

A collection of items stored at contiguous memory locatin; each item can be accessed using an index

Question 17

Binary Search

Answer 17

A search algorithim that finds the position of a target value within a sorted array by repeatedly dividing the search interval in half

Question 18

String

Answer 18

A sequence of characters treated as a single data item; commonly used to represent text