Algorithms Flashcards
What is Computational Thinking?
The steps taken to find a solution to a complex problem
It involves Decomposition, Abstraction, and Algorithmic Thinking.
Define Decomposition in the context of problem-solving.
Breaking down a complex problem into smaller problems and solving each one individually
This approach simplifies complex issues for easier management.
What does Abstraction involve?
Picking out the important bits of information from the problem and ignoring irrelevant details
This helps focus on what truly matters in solving the problem.
What is Algorithmic Thinking?
A logical way of getting from a problem to a solution
Following an algorithm allows for reuse of the steps in future problems.
What is Pseudocode?
A representation of the steps of an algorithm without the need to follow syntax of a programming language
It is easily understood by coders.
Fill in the blank: _______ is about the steps taken to find a solution to a complex problem.
Computational Thinking
True or False: Decomposition involves solving all parts of a problem simultaneously.
False
Decomposition focuses on solving smaller parts one at a time.
What is a flowchart?
A flowchart is a way to show algorithms using different shaped boxes for different commands.
What is a search algorithm?
A search algorithm is followed by computers to find items in a list, such as searching on a shopping website or for appointments at a doctor’s surgery.
What is a Binary Search?
A Binary Search looks for items in an ordered list, which can contain letters, numbers, or alphanumeric characters.
What is a Linear Search?
A Linear Search can be used on an unordered list, checking each item in turn until it finds the item or reaches the end of the list.
What is a sorting algorithm?
A sorting algorithm is followed by computers to sort items in a list, such as sorting names in Excel or sorting prices on a shopping website.
What is the Bubble Sort algorithm?
The Bubble Sort algorithm compares pairs of items. It is very simple but can take a long time to sort large lists.
What is the Merge Sort algorithm?
A Merge Sort splits the list apart then merges it back together. This is much more efficient than the bubble sort for large lists but is slower for smaller lists.
What is the Insertion Sort algorithm?
An Insertion Sort orders the items as it goes. The Insertion Sort is a simple algorithm and works very well with small lists. It is not very efficient for larger lists.
