Difference between revisions of "2022 Paper 1 Revision Quiz"

From TRCCompSci - AQA Computer Science
Jump to: navigation, search
(→‎Arrays)
Line 99: Line 99:
  
 
=Arrays=
 
=Arrays=
 +
<quiz display=simple>
 +
{In Recursion, the part of the code which runs itself is called?
 +
|type="()"}
 +
+ General Case.
 +
||Correct
 +
- Base Case.
 +
||Incorrect
 +
- Repeating Case.
 +
||Incorrect
 +
- Recursive Case.
 +
||Incorrect
 +
</quiz>
 +
 +
=Abstract Data Types & Dynamic vs Static=
 +
<quiz display=simple>
 +
{In Recursion, the part of the code which runs itself is called?
 +
|type="()"}
 +
+ General Case.
 +
||Correct
 +
- Base Case.
 +
||Incorrect
 +
- Repeating Case.
 +
||Incorrect
 +
- Recursive Case.
 +
||Incorrect
 +
</quiz>
 +
=Queues=
 +
<quiz display=simple>
 +
{In Recursion, the part of the code which runs itself is called?
 +
|type="()"}
 +
+ General Case.
 +
||Correct
 +
- Base Case.
 +
||Incorrect
 +
- Repeating Case.
 +
||Incorrect
 +
- Recursive Case.
 +
||Incorrect
 +
</quiz>
 +
 +
=Stacks=
 +
<quiz display=simple>
 +
{In Recursion, the part of the code which runs itself is called?
 +
|type="()"}
 +
+ General Case.
 +
||Correct
 +
- Base Case.
 +
||Incorrect
 +
- Repeating Case.
 +
||Incorrect
 +
- Recursive Case.
 +
||Incorrect
 +
</quiz>
 +
 +
=Graphs=
 +
<quiz display=simple>
 +
{In Recursion, the part of the code which runs itself is called?
 +
|type="()"}
 +
+ General Case.
 +
||Correct
 +
- Base Case.
 +
||Incorrect
 +
- Repeating Case.
 +
||Incorrect
 +
- Recursive Case.
 +
||Incorrect
 +
</quiz>
 +
 +
=Trees=
 +
<quiz display=simple>
 +
{In Recursion, the part of the code which runs itself is called?
 +
|type="()"}
 +
+ General Case.
 +
||Correct
 +
- Base Case.
 +
||Incorrect
 +
- Repeating Case.
 +
||Incorrect
 +
- Recursive Case.
 +
||Incorrect
 +
</quiz>
 +
 +
=Graph Traversal=
 +
<quiz display=simple>
 +
{In Recursion, the part of the code which runs itself is called?
 +
|type="()"}
 +
+ General Case.
 +
||Correct
 +
- Base Case.
 +
||Incorrect
 +
- Repeating Case.
 +
||Incorrect
 +
- Recursive Case.
 +
||Incorrect
 +
</quiz>
 +
 +
=Searching Algorithms=
 +
<quiz display=simple>
 +
{In Recursion, the part of the code which runs itself is called?
 +
|type="()"}
 +
+ General Case.
 +
||Correct
 +
- Base Case.
 +
||Incorrect
 +
- Repeating Case.
 +
||Incorrect
 +
- Recursive Case.
 +
||Incorrect
 +
</quiz>
 +
 +
=Sorting Algorithms=
 +
<quiz display=simple>
 +
{In Recursion, the part of the code which runs itself is called?
 +
|type="()"}
 +
+ General Case.
 +
||Correct
 +
- Base Case.
 +
||Incorrect
 +
- Repeating Case.
 +
||Incorrect
 +
- Recursive Case.
 +
||Incorrect
 +
</quiz>
 +
 +
=Optimisation Algorithms=
 +
<quiz display=simple>
 +
{In Recursion, the part of the code which runs itself is called?
 +
|type="()"}
 +
+ General Case.
 +
||Correct
 +
- Base Case.
 +
||Incorrect
 +
- Repeating Case.
 +
||Incorrect
 +
- Recursive Case.
 +
||Incorrect
 +
</quiz>
 +
 +
=Order of Complexity=
 +
<quiz display=simple>
 +
{In Recursion, the part of the code which runs itself is called?
 +
|type="()"}
 +
+ General Case.
 +
||Correct
 +
- Base Case.
 +
||Incorrect
 +
- Repeating Case.
 +
||Incorrect
 +
- Recursive Case.
 +
||Incorrect
 +
</quiz>
 +
 +
=Halting Problem=
 
<quiz display=simple>
 
<quiz display=simple>
 
{In Recursion, the part of the code which runs itself is called?
 
{In Recursion, the part of the code which runs itself is called?

Revision as of 10:52, 2 June 2022

Recursion

1. In Recursion, the part of the code which runs itself is called?

General Case.
→Correct
Base Case.
→Incorrect
Repeating Case.
→Incorrect
Recursive Case.
→Incorrect

2. In Recursion, the condition which stops the recursive calls is called?

General Case.
→Correct
Base Case.
→Incorrect
Repeating Case.
→Incorrect
Recursive Case.
→Incorrect

3. Look at this sample code: 

1: public int Fact(int num)
2: {
3:   if (num == 0)
4:       return 1;
5:   else
6:       return num * Fact(num-1);
7: }

Which of these lines are the General Case?

3
→Incorrect
4
→Incorrect
5
→Incorrect
6
→Correct

4. Look at this sample code: 

1: public int Fact(int num)
2: {
3:   if (num == 0)
4:       return 1;
5:   else
6:       return num * Fact(num-1);
7: }

Which of these lines are the Base Case?

3
→Almost, this is the condition which causes the base case
4
→Correct
5
→Incorrect
6
→Incorrect

5. Look at this sample code: 

 1: public int Fact(int num)
 2: {
 3:   if (num == 0)
 4:       return 1;
 5:   else
 6:       return num * Fact(num-1);
 7: }

The function Fact is run with the parameter of 5. 

Fact(5);
What is the return value for the First call:
What is the return value for the Second call:
What is the return value for the Third call:
What is the return value for the Fourth call:
What is the return value for the Fifth call:
What is the return value for the Sixth call:
What will be the final value returned for the call Fact(5):

Your score is 0 / 0


Arrays

1. In Recursion, the part of the code which runs itself is called?

General Case.
→Correct
Base Case.
→Incorrect
Repeating Case.
→Incorrect
Recursive Case.
→Incorrect

Your score is 0 / 0


Abstract Data Types & Dynamic vs Static

1. In Recursion, the part of the code which runs itself is called?

General Case.
→Correct
Base Case.
→Incorrect
Repeating Case.
→Incorrect
Recursive Case.
→Incorrect

Your score is 0 / 0

Queues

1. In Recursion, the part of the code which runs itself is called?

General Case.
→Correct
Base Case.
→Incorrect
Repeating Case.
→Incorrect
Recursive Case.
→Incorrect

Your score is 0 / 0


Stacks

1. In Recursion, the part of the code which runs itself is called?

General Case.
→Correct
Base Case.
→Incorrect
Repeating Case.
→Incorrect
Recursive Case.
→Incorrect

Your score is 0 / 0


Graphs

1. In Recursion, the part of the code which runs itself is called?

General Case.
→Correct
Base Case.
→Incorrect
Repeating Case.
→Incorrect
Recursive Case.
→Incorrect

Your score is 0 / 0


Trees

1. In Recursion, the part of the code which runs itself is called?

General Case.
→Correct
Base Case.
→Incorrect
Repeating Case.
→Incorrect
Recursive Case.
→Incorrect

Your score is 0 / 0


Graph Traversal

1. In Recursion, the part of the code which runs itself is called?

General Case.
→Correct
Base Case.
→Incorrect
Repeating Case.
→Incorrect
Recursive Case.
→Incorrect

Your score is 0 / 0


Searching Algorithms

1. In Recursion, the part of the code which runs itself is called?

General Case.
→Correct
Base Case.
→Incorrect
Repeating Case.
→Incorrect
Recursive Case.
→Incorrect

Your score is 0 / 0


Sorting Algorithms

1. In Recursion, the part of the code which runs itself is called?

General Case.
→Correct
Base Case.
→Incorrect
Repeating Case.
→Incorrect
Recursive Case.
→Incorrect

Your score is 0 / 0


Optimisation Algorithms

1. In Recursion, the part of the code which runs itself is called?

General Case.
→Correct
Base Case.
→Incorrect
Repeating Case.
→Incorrect
Recursive Case.
→Incorrect

Your score is 0 / 0


Order of Complexity

1. In Recursion, the part of the code which runs itself is called?

General Case.
→Correct
Base Case.
→Incorrect
Repeating Case.
→Incorrect
Recursive Case.
→Incorrect

Your score is 0 / 0


Halting Problem

1. In Recursion, the part of the code which runs itself is called?

General Case.
→Correct
Base Case.
→Incorrect
Repeating Case.
→Incorrect
Recursive Case.
→Incorrect

Your score is 0 / 0
Retrieved from ‘http://www.trccompsci.online/mediawiki/index.php?title=2022_Paper_1_Revision_Quiz&oldid=8479’