Home Library Explore SAT

Home Library Explore SAT

4.2 Following Algorithms (+ recursion and call stacks) Flashcards | StudBud

Explore/4.2 Following Algorithms (+ recursion and call stacks)

What does 'FOR a ← 1 TO 3' do?

What is the base case in recursion?

4.2 Following Algorithms (+ recursion and call stacks)

9 terms·StudBud Administration·34 plays

Imported from external platform

Flashcards9 cardsFPractice quizPHost liveL

Questions 9

Answers

1
What is the base case in recursion?
The recursive call
The final result
The stopping condition
The starting point
2
What does 'FOR a ← 1 TO 3' do?
Repeats 3 times
Only runs once
Ends immediately
Loops forever
3
Complete the sentence: 'a ← 1' is...
Loop start
Function call
Constant assignment
Variable assignment
4
What does 'POSITION' return?
Character code
Substring
Character index
String length
5
What is the purpose of a stack in programming?
To store data in a LIFO structure
To manage file operations
To perform mathematical calculations
To sort elements in ascending order
6
What is the AQA Pseudocode for createing a random integer
RANDOM_INTEGER(1,10)
RANDOM INTEGER(1-10)
RANDOM_INT(1,10)
RANDOM.RANDINT(1,10)
7
Which keyword defines a subroutine?
PROCEDURE
FUNCTION
METHOD
SUBROUTINE
8
What does 'MOD' do?
Finds remainder
Multiplies numbers
Adds numbers
Divides numbers
9
What is a stack frame?
A memory allocation
A data structure
A file organization
A record of function calls