2022 Paper 1 Revision Quiz

From TRCCompSci - AQA Computer Science
Revision as of 16:35, 3 June 2022 by Admin (talk | contribs) (Arrays)
Jump to: navigation, search

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

Syntax error

1. When considering arrays, which of the following are correct

You must declare a size when creating the array
Correct
You don't need to specify a size when creating an array
Incorrect
The memory for the entire structure is allocated when it is created
Correct
Only the initial memory is allocated when creating, the rest is allocated when we add items
Incorrect

2. When using arrays the square brackets [] :

Are used to access the whole array
Incorrect
Contain the data value to look up in the array
Incorrect
Are used to access a specific element in the array
Correct
Contain the data value store in the array
Incorrect

3. An array can be of any data type or class.

True
Correct
False
Incorrect

4. A 2D array can still only be of one data type or class.

True
Correct
False
Incorrect
Abstract Data Structure
Incorrect
Dynamic Data Structure
Incorrect
Static Data Structure
Correct
Strong Data Structure
Incorrect

Your score is 0 / 0


Abstract Data Types & Dynamic vs Static

Your score is 0 / 0


Queues

1. A queue is ?

Last In First Out .
Incorrect
First in First Out.
Correct

2. Complete the following;

A new item must be added to the of the queue.
You must remove the item at the of the queue.

3. In a Linear queue, the front of the queue will move further back as items are taken from the front of the queue.

True
Correct
False
Incorrect

4. In a Linear queue, when an item is removed from the front of the queue the remaining items are moved forward.

True
Incorrect
False
Correct

5. A circular queue works by using pointers. The front pointer will point to:

The back of the queue
Incorrect
The location for the next item onto the queue
Incorrect
The first item in the queue
Correct
The second item in the queue
Incorrect

6. A circular queue works by using pointers. The rear pointer will point to:

The back of the queue
Correct
The location for the next item onto the queue
Incorrect
The first item in the queue
Incorrect
The second item in the queue
Incorrect

7. To make a circular queue you must reset either pointer back to 1 when:

Number of Items = Max Queue Size
Incorrect
Number of Items = 0
Incorrect
When the Pointer Value = Max Queue Size
Correct

8. in a circular queue you must test for empty by:

Number of Items = Max Queue Size
Incorrect
Number of Items = 0
Correct
When the Pointer Value = Max Queue Size
Incorrect

9. in a circular queue you must test for full by:

Number of Items = Max Queue Size
Correct
Number of Items = 0
Incorrect
When the Pointer Value = Max Queue Size
Incorrect

Your score is 0 / 0


Stacks

1. A stack is ?

Last In First Out .
Correct
First in First Out.
Incorrect

2. The stack pointer will point to?

The location to store the next item
Incorrect
Top of the stack.
Correct
Bottom of the stack.
Incorrect

3. To add an item to the stack you?

Pop.
Incorrect
Push.
Correct
Peek.
Incorrect

4. To remove an item from the stack you?

Pop.
Correct
Push.
Incorrect
Peek.
Incorrect

5. To look at the top of the stack without removing it you?

Pop.
Incorrect
Push.
Incorrect
Peek.
Correct

Your score is 0 / 0


Graphs

1. Look at this graph:

Graph-4.jpg

select the appropriate options below:

The degree of vertex A is 3
Incorrect
The degree of vertex D is 1
Incorrect
The degree of vertex B is 3
Correct
The degree of vertex E is 1
Correct

2. Look at this graph:

Graph-4.jpg

select the appropriate options below:

Directed
Incorrect
Undirected
Correct
Weighted
Incorrect
Unweighted
Correct

3. Look at this graph:

Graph1.png

select the appropriate options below:

Directed
Incorrect
Undirected
Correct
Weighted
Correct
Unweighted
Incorrect

4. Look at this graph:

Graph2.png

select the appropriate options below:

Directed
Correct
Undirected
Incorrect
Weighted
Incorrect
Unweighted
Correct

5. Look at this graph:

Graph3.png

Complete the adjacency matrix, use Y & N only:

0123
0X
1 X
2X
3 X

6. Look at this graph:

Graph2.png

Complete the adjacency matrix, use Y & N only:

ABCD
AX
B X
CX
D X

7. Look at this graph:

Graph3.png

Complete the adjacency list (separate with commas & no spaces):

Connected
0
1
2
3

8. Look at this graph:

Graph2.png

Complete the adjacency list (separate with comma no spaces, use None if nothing is connected):

Connected
A
B
C
D

9. Complete the following

You should use an adjacency list when there are edges.
You should use an adjacency matrix if there are edges.

10. Processing adjacency matrix is much simpler because you can have direct access to check if an edge exists

True
Correct
False
Incorrect

Your score is 0 / 0


Trees

1. Which of the following must a graph have to also be a tree?

Not Connected
Incorrect
Connected.
Correct
Weighted
Incorrect
Unweighted.
Incorrect
Directed.
Incorrect
Undirected.
Incorrect
With Cycles
Incorrect
Without Cycles
Correct

Your score is 0 / 0


Graph Traversal

1. Depth First Traversal uses a:

Queue
Incorrect
Stack
Correct
List
Incorrect
Dictionary
Incorrect

2. Breadth First Traversal uses a:

Queue
Correct
Stack
Inorrect
List
Incorrect
Dictionary
Incorrect

3. Complete the following:

For Depth First & Breadth First traversals it is important to know when a node has been .
When you evaluate a node the of the current node will be add to the Stack or Queue.
It is important to also record when you have explored the current node.

Your score is 0 / 0


Searching Algorithms

Your score is 0 / 0


Sorting Algorithms

1. Which sorting algorithm uses 'Divide & Conquer' strategy?

Bubble Sort.
Incorrect
Merge Sort.
Correct
Neither.
Incorrect

2. Which sorting algorithm will complete a number of passes?

Bubble Sort.
Correct
Merge Sort.
Incorrect
Neither.
Incorrect

3. Which sorting algorithm will break a list into multiple lists containing a single value?

Bubble Sort.
Incorrect
Merge Sort.
Correct
Neither.
Incorrect

4. Which sorting algorithm will be recursive?

Bubble Sort.
Incorrect
Merge Sort.
Correct
Neither.
Incorrect

5. Which sorting algorithm will sort the list with N-12 comparisons?

Bubble Sort.
Correct
Merge Sort.
Incorrect
Neither.
Incorrect

Your score is 0 / 0


Optimisation Algorithms

Your score is 0 / 0


Order of Complexity

1. Complete the following:

1) Constant  :
2)  : O(log N)
3) Linear  :
4) Linearithmic  :
5)  : O (N2)
6)  : O(kN)
7) Factorial  :

2. Complete the Order of Complexity for the following examples:

1) Finding the first item in a list  :
2)  : Logarithmic or O(log N)
3)  : Linear or O(N)
4) Merge Sort  :
5)  : Polynomial or O (N2)
6)  : Exponential or O(kN)
7) : Factorial or O(N!)

Your score is 0 / 0


Halting Problem

1. Complete the Halting Problem:

‘Is it possible to a program that can tell given any and its and without the program, whether it will ?’

Your score is 0 / 0