Lesson 1

Question 1

An ____ is a data structure used to store multiple elements.

Answer 1

array

Question 2

Arrays are_______, meaning that each element in the array has an index, a number that says where in the array the element is located.

Answer 2

indexed

Question 3

_________ is an algorithm that sorts an array from the lowest value to the highest value

Answer 3

Bubble Sort

Question 4

The ________ algorithm finds the lowest value in an array and moves it to the front of the array.

Answer 4

Selection Sort

Question 5

The __________algorithm uses one part of the array to hold the sorted values, and the other part of the array to hold values that are not sorted yet.

Answer 5

Insertion Sort

Question 6

The ________ algorithm takes an array of values, chooses one of the values as the ‘pivot’ element, and moves the other values so that lower values are on the left of the pivot element, and higher values are on the right of it

Answer 6

Quicksort

Question 7

________ is when a function calls itself.

Answer 7

Recursion

Question 8

The _______ algorithm sorts an array by counting the number of times each value occurs.

Answer 8

Counting Sort

Question 9

The _____ algorithm sorts an array by individual digits, starting with the least significant digit (the rightmost one).

Answer 9

Radix Sort

Question 10

The _________ algorithm is a divide-and-conquer algorithm that sorts an array by first breaking it down into smaller arrays and then building the array back together the correct way so that it is sorted.

Answer 10

Merge Sort

Question 11

The _________ algorithm searches through an array and returns the index of the value it searches for.

Answer 11

Linear Search

Question 12

The ________ algorithm searches through an array and returns the index of the value it searches for.

Answer 12

Binary Search

Question 13

A list where the nodes are linked together

Answer 13

Linked List

Question 14

Each _____ contains data and a pointer

Answer 14

node

Question 15

_________ is the storage your program uses when it is running. This is where your variables, arrays and linked lists are stored.

Answer 15

Computer memory

Question 16

Function allocates memory for a new node, fills in the data part of the node with an integer given as an argument to the function, and returns the pointer (memory address) to the new node.

Answer 16

createNode()

Question 17

Function is just for going through the linked list and printing each node’s value.

Answer 17

printList()

Question 18

Inside the ______ function, four nodes are created, linked together, printed, and then the memory is freed

Answer 18

main()

Question 19

There are three basic forms of linked lists

Answer 19

Singly linked lists
Doubly linked lists
Circular linked lists

Question 20

A ________ is the simplest kind of linked lists. It takes up less space in memory because each node has only one address to the next node.

Answer 20

singly linked list

Question 21

A _______ has nodes with addresses to both the previous and the next node, and therefore takes up more memory

Answer 21

doubly linked list

Question 22

A _______ is like a singly or doubly linked list with the first node, the “head”, and the last node, the “tail”, connected.

Answer 22

circular linked list