Common Fundamental Algorithms

Question 1

array

Answer 1

As a data structure where data elements are contiguous and given an index number for accessing elements.

Question 2

binary search

Answer 2

The process of comparing the middle value in a sorted array or list to the target value, eliminating the half of the list that can’t contain the target value, selecting the middle value of the remaining elements and repeating the process until the target value is found or the search space is empty.

Question 3

bubble sort

Answer 3

A sorting algorithm where adjacent elements are compared in pairs and swapped if out of order. The process is reiterated until all elements are sorted.

Question 4

concrete step

Answer 4

A step in an algorithm that gives specific instructions on what to do.

Question 5

count-controlled loop

Answer 5

any loop whose stop condition is met through a predictable count.

Question 6

desk checking

Answer 6

Manually going through an algorithm step-by-step on paper, acting like the computer to verify logic and expected results before running code.

Question 7

event-controlled loop

Answer 7

A loop whose stop condition is determined by when an event becomes true or false, and the number of iterations is not determined by a count.

Question 8

heterogeneous

Answer 8

When data are not of the same type.

Question 9

homogenous

Answer 9

When data are of the same type.

Question 10

index

Answer 10

A numeric position identifier for elements in a list or array. Can start at 0 or 1.

Question 11

insertion sort

Answer 11

When you sort the first two elements, add the next element and insert it into its correct place among the already-sorted elements. You keep adding elements and inserting them into the correct position until the entire array is sorted.

Question 12

processing

Answer 12

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

Question 13

record

Answer 13

a composite variable that’s treated as a single unit of data and made up of multiple fields consisting of any data type.

Question 14

searching

Answer 14

the process of finding a specific item or value within a collection of data

Question 15

selection sort

Answer 15

Select the first element, assume it to be sorted, ccompare to all subsequent elements and swap with smallest element found if it’s smaller than the first element. Then select sequentially through the remaining elements, repeating the same process until the list is sorted

Question 16

sequential search (linear search)

Answer 16

a search algorithm that compares elements sequentially to the target value until the value is found or the list ends.

Question 17

sorting

Answer 17

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

Question 18

string

Answer 18

A sequence of any characters that are treated as a single piece of data.