Common Fundamental Algorithms Flashcards

(18 cards)

1
Q

What is an array?

A

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

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
2
Q

What is a binary search?

A

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

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
3
Q

What is bubble sort?

A

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

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
4
Q

What is a concrete step?

A

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

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
5
Q

What is a count-controlled loop?

A

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

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
6
Q

What is desk checking?

A

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

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
7
Q

What is an event-controlled loop?

A

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

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
8
Q

What does heterogeneous mean?

A

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

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
9
Q

What does homogenous mean?

A

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

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
10
Q

What is an index?

A

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

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
11
Q

What is insertion sort?

A

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

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
12
Q

What is processing?

A

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

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
13
Q

What is a record?

A

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

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
14
Q

What is searching?

A

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

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
15
Q

What is selection sort?

A

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

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
16
Q

What is a sequential search?

A

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

17
Q

What is sorting?

A

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

18
Q

What is a string?

A

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