Advanced level 2026 Centre mock computer science 1

Advanced level 2026 Centre mock computer science 1

Advanced level 2026 Centre mock computer science 1

I have extracted the text and data from your most recent image, which covers Multi-processor systems, Recursion, CPU Scheduling, and Database Relations.


COMPUTER SCIENCE EXAMINATION SECTION

1. Multi-processor machines do NOT:

  • A. Execute the same instruction stream on distinct data streams.

  • B. Execute multiple instruction streams on the same data stream.

  • C. Execute multiple instruction streams on multiple data streams.

  • D. Interleave multiple instruction streams on multiple data streams.

2. Consider the C function:

C

int result (int n) {
    if (n == 1)
        return 2;
    else
        return 2 * result (n - 1);
}

What value does result(5) return?

  • A. 64

  • B. 4

  • C. 16

  • D. 32

3. Four processes P1, P2, P3, and P4 are scheduled to use a single processor. The following table shows arrival time and duration of each of the four processes:

Process Arrival time (ms) Duration (ms)
P1 0 7
P2 2 4
P3 4 1
P4 5 4

If the system uses a preemptive SJF (Shortest Job First) scheduling algorithm, what is the average waiting time for the four processes in milliseconds (ms)?

  • A. 2

  • B. 3

  • C. 4

  • D. 5

4. When the Central Processing Unit of a computer executes a machine instruction, it uses all of the following except:

  • A. Memory, Bus, Processor, Arithmetic and Logic Unit.

  • B. Memory, Bus, Processor, Arithmetic and Logic Unit.

  • C. Register, Control Unit, Bus, Arithmetic and Logic Unit.

  • D. Register, Control Unit, System Unit, Arithmetic and Logic Unit.

5. Which of the following is a computer threat that affects availability to authorized users?

  • A. Steal or disable someone’s computer.

  • B. Steal a copy of someone’s software.

  • C. Modify the data in someone’s files.

  • D. Modify messages being sent to someone.

6. Montchio finds it best to submit work at Computing Centre and call back later to collect the results, even though most of the tasks involve collecting data from sites all over the world. Such processing must be for:

  • A. An online embedded system.

  • B. A real-time processing system.

  • C. Transaction processing system.

  • D. Batch processing system.

7. Certain software facilitate the use of a physical machine and other software on it. Also the software is not specific to tasks users may want to solve, though users cannot reasonably work without them. They are:

  • A. Application programs.

  • B. Systems programs.

  • C. Library programs.

  • D. Utility programs.

8. Consider the algorithm below:

  • $A \leftarrow 3$

  • $B \leftarrow 7$

  • $C \leftarrow 10$

  • $A \leftarrow A + B$

  • $B \leftarrow A – B$

  • $C \leftarrow A + B$

  • OUTPUT “A”:A, “B”:B, “C”:C

What will be the output of the algorithm after the execution?

  • A. A: 10, B: 10, C: 27

  • B. A: 27, B: 17, C: 10

  • C. A: 10, B: 27, C: 17

  • D. A: 10, B: 3, C: 13

9. In all operating systems, a user typically gives a ______ to access any file for which he/she has all access rights.

  • A. Working Directory.

  • B. File Descriptor.

  • C. Path name.

  • D. Root Directory.

10. The base address of an array A in memory is given as M[512]. If memory is byte addressable and each array element occupies 128 bits, what is the memory address of element A[4]?

  • A. M[528]

  • B. M[640]

  • C. M[576]

  • D. M[516]

11. Relations student (ID, name, course code, mark) and course (course code, course name, and syllabus) hold details of students and courses. How can we best combine them, yet avoid redundancy in data stored?

  • A. Make ID a foreign key in course.

  • B. Copy course details into relation student.

  • C. Make course code a foreign key in student.

  • D. Copy student details into relation-course.


Would you like me to show the Gantt chart for the SJF scheduling in question 3, or the step-by-step memory address calculation for the array in question 10?

PDF is loading please wait...


Leave a comment

Your email address will not be published. Required fields are marked *

JOIN OUR WHATSAPP GROUP! / REJOIGNEZ NOTRE GROUPE WHATSAPP!
sponsors Ads