All Flashcards
What are the steps of binary search?
- Sort the data. 2. Find the middle element. 3. Compare target to middle. 4. Eliminate half the data. 5. Repeat until found or exhausted.
What is Data Abstraction?
Simplifying data for easier program management.
What is Procedural Abstraction?
Using a procedure without knowing its implementation details.
What is Modularity?
Dividing a program into independent modules or procedures.
What is Selection?
Choosing which code to execute based on a condition.
What is an API?
A set of rules that programs can follow to communicate.
What is a Simulation?
A simplified representation of a real-world system or process.
What is Algorithmic Efficiency?
A measure of how well an algorithm uses resources.
What is a Heuristic?
An approach that may not be optimal but is practical.
What is a Decidable Problem?
A problem for which an algorithm can always produce a solution.
What is an Undecidable Problem?
A problem for which no algorithm can always produce a solution.
What is the value of x?
x ← 5
x ← x + 2
7
What is the value of myList[2]?
myList ← [10, 20, 30, 40]
20
What is the result of 17 MOD 5?
2
What is the result of "hello" + "world"?
"helloworld"
What is the result of (5 > 3) AND (2 < 1)?
false
What is printed?
x ← 10
IF x > 5
DISPLAY("Greater")
ELSE
DISPLAY("Less")
"Greater"
What is printed?
x ← 10
y ← 5
IF x > 5
IF y > 2
DISPLAY("Both")
ELSE
DISPLAY("Only x")
ELSE
DISPLAY("Neither")
"Both"
How many times does this loop execute?
REPEAT 5 TIMES
DISPLAY("Hello")
5
What is the final value of x?
x ← 0
REPEAT UNTIL x > 3
x ← x + 1
4
If myList is [10, 20, 30, 40], what is the result of INSERT(myList, 2, 25)?
[10, 25, 20, 30, 40]