Y9 - T1.1 - CrashCourse Algorithms

Who is considered one of the fathers of algebra?

• Alan Turing

• Muḥammad ibn Mūsā al-Khwārizmī

• Isaac Newton

• Albert Einstein

What is the main goal of an efficient algorithm?

• To be as complex as possible

• To use as many steps as possible

• To use as much memory as possible

• To compute in fewer steps

What is the name of the sorting algorithm that involves finding the smallest number and swapping it?

• Bubble Sort

• Selection Sort

• Quick Sort

• Merge Sort

What is the computational complexity of the Selection Sort algorithm?

• N squared

• N factorial

• N log N

• N

What is the first step in the Merge Sort algorithm?

• Merging the array

• Finding the smallest number

• Swapping numbers

• Splitting the array

What is the Big O notation for the Merge Sort algorithm?

• N

• N factorial

• N log N

• N squared

What is a graph in computer science?

• A network of nodes connected by lines

• A collection of sorted numbers

• A type of sorting algorithm

• A programming language

What is the name of the algorithm used to find the shortest path in a graph?

• Selection Sort

• Bubble Sort

• Merge Sort

• Dijkstra's algorithm

What is the improved complexity of Dijkstra's algorithm?

• N times log N plus the number of lines

• N squared

• N log N

• N factorial

What is the main purpose of algorithms in computer science?

• To increase complexity

• To use more memory

• To solve problems efficiently

• To make computations slower