Rahul – January Assessment
This is a closed book assessment that includes questions from all of the topics that have been covered this academic year. Do not click start until asked to do so.
Only one attempt is allowed for this assessment and your answers will be automatically submitted after 45 minutes.
Where longer answers are required, these will be marked with feedback by your next lesson.
Assessment Summary
0 of 9 Questions completed
Questions:
Information
You have already completed the assessment before. Hence you can not start it again.
Assessment is loading…
You must sign in or sign up to start the assessment.
You must first complete the following:
Results
Results
0 of 9 Questions answered correctly
Your time:
Time has elapsed
You have reached 0 of 0 point(s), (0)
Earned Point(s): 0 of 0, (0)
0 Essay(s) Pending (Possible Point(s): 0)
Categories
- Not categorized 0%
- A Level Computer Science 0%
- KS5 Sorting Algorithms 0%
- 1
- 2
- 3
- 4
- 5
- 6
- 7
- 8
- 9
- Current
- Review
- Answered
- Correct
- Incorrect
-
Question 1 of 9
1. Question
2 point(s)A processor contains a number of special registers. Match the three buses used to convey information between the special registers with the descriptions.
-
This response will be reviewed and graded after submission.
Grading can be reviewed and adjusted.Grading can be reviewed and adjusted. -
-
Question 2 of 9
2. Question
6 point(s)Students in a university each use a stand-alone computer.
The Computer Science lecturer needs to work on some files at home and also to mark student work that has been sent to them. State three different storage devices that the lecturer could use and describe what each device would be used for. (*short essay)
-
This response will be reviewed and graded after submission.
Grading can be reviewed and adjusted.Grading can be reviewed and adjusted. -
-
Question 3 of 9
3. Question
1 point(s)Consider the following algorithm in Fig.2, expressed in pseudocode, as function S:
State the name of the algorithm implemented in Fig.2.
CorrectIncorrect -
Question 4 of 9
4. Question
2 point(s)Consider the following algorithm in Fig.2, expressed in pseudocode, as function S:
Describe the purpose of this algorithm in Fig 2.
-
This response will be reviewed and graded after submission.
Grading can be reviewed and adjusted.Grading can be reviewed and adjusted. -
-
Question 5 of 9
5. Question
6 point(s)Enter in what the array below will look like after the first pass of a bubble sort algorithm:
[12,3,9,7,5,56]
-
[ , , , , , ]
CorrectIncorrect -
-
Question 6 of 9
6. Question
10 point(s)Put the pseudocode for bubble sort into the correct order:
-
WHILE Sorted == False DO
-
END WHILE
-
IF myArr[n] > myArr[n+1] THEN
-
Sorted = True
-
myArr[n1] = temp
-
Sorted = False
-
FOR n = 0 TO LENGTH.MyArr -2 DO
-
END IF
-
temp = myArr[n]
-
Sorted = False #2nd
-
NEXT n
-
myArr[n] = myArr[n+1]
View Answers:
CorrectIncorrect -
-
Question 7 of 9
7. Question
1 point(s)Why is Merge Sort considered more efficient than Bubble sort?
CorrectIncorrect -
Question 8 of 9
8. Question
1 point(s)What is considered the worst case for a sorting algorithm?
CorrectIncorrect -
Question 9 of 9
9. Question
6 point(s)Bubble Sort has the following algorithmic complexities:
Best case for time = O(n)
Average case for time = O(n2)
Worst case for memory = O(1)
Describe what each of these complexities mean in the context of Bubble Sort.
-
This response will be reviewed and graded after submission.
Grading can be reviewed and adjusted.Grading can be reviewed and adjusted. -
