Back to marketplace

Algorithms

No description yet. This curated deck is ready for daily study.

Total cards: 19•Content version: v4•Public deck•Updated: 8/1/2026

Card preview (19)

#1
Front (Question)

What is an algorithm?

Back (Answer)

An algorithm is a sequence of steps that can be followed to complete a task.

#2
Front (Question)

What is decomposition?

Back (Answer)

Breaking a complex problem into sub problems until each task is manageable, then solving each one individually

#3
Front (Question)

What is abstraction?

Back (Answer)

Removing unnecessary detail from a problem so you are left with important bits, simplifying the task

#4
Front (Question)

What is algorithmic thinking?

Back (Answer)

A logical way of getting from the problem to the solution. Acknowledging if certain bits of code can be reused

#5
Front (Question)

What must you always do in pseudocode?

Back (Answer)

Declare variables

#6
Front (Question)

What is efficiency in programming?

Back (Answer)

How much time is needed to a run a particular algorithm and how much space is needed

#7
Front (Question)

Which one is more efficient a bubble sort or a merge sort?

Back (Answer)

A merge sort Splits and then merges instead of swapping each pair

#8
Front (Question)

Which is more efficient binary search or a linear search?

Back (Answer)

Binary search Only when list is ordered Keeps on cutting of half rather than checking each number

#9
Front (Question)

How would you address questions about abstraction?

Back (Answer)

1-definition 2-important detail 3-unnecessary detail

#10
Front (Question)

How do you address questions about decomposition?

Back (Answer)

1- definition 2- two questions you can think of to sub section

#11
Front (Question)

What is considered ‘time’ in programming?

Back (Answer)

How may number of times memory was accessed The number of CPU cycles taken to execute the command

#12
Front (Question)

is a computer program an algorithm ?

Back (Answer)

#13
Front (Question)

Why use the correct data types?

Back (Answer)

As each data type is allocated a different amount of memory , using the correct data types makes the code more memory efficient , robust and predictable

#14
Front (Question)

What is program flow ?

Back (Answer)

The order in which statements are executed in a program • can be controlled used selection and iteration

#15
Front (Question)

Write a pseudocode that creates a 6 digit username. With the first 3 letters being from town first three letters Then the second 2 digits being their current age The last digit is the last letter of their surname

Back (Answer)

Card back image
#16
Front (Question)

Why use meaningful identifiers ?

Back (Answer)

#17
Front (Question)

What are arrays ?

Back (Answer)

A data structure where data values of the same type are stored and defined under one variable name.

#18
Front (Question)

Why are subroutines good ?

Back (Answer)

🔵can be tested individually making it easier to debug . 🔵can be recalled many times within the program , rather than repeating sections of code (more efficient) 🔵can be stored as separate modules and reused in other programs

#19
Front (Question)

What is a local variable

Back (Answer)

A variable that can only be used within the structure that they have been declared . ✅cannot and are not affected by anything outside a subroutine (same variable name can be used elsewhere ) ✅✅