ICT201 Computer Organisation and Architecture

Assessment 2: Operating Systems Analysis Report

Assessment Type: Individual Written Report

Word Count: 2,000 words

Weighting: 30 percent

Due Date: Week 9, Sunday 23:55

Submission Method: Upload report to Moodle submission link

Assessment Context

Modern computing systems rely on efficient operating system design to manage hardware resources, schedule processes, and avoid system failures. Professionals in information technology must understand how scheduling algorithms, memory management techniques, and deadlock conditions influence overall system performance. This assessment requires students to analyse a realistic operating system scenario and demonstrate technical reasoning through structured problem solving and academic research.

Learning Outcomes

This assessment addresses the following subject learning outcomes:

• Analyse core operating system concepts including process scheduling and synchronisation.
• Evaluate logical issues such as deadlocks and propose appropriate solutions.
• Apply theoretical models to practical computing scenarios.

Assessment Purpose

The purpose of this task is to assess the ability of students to identify scheduling behaviours, calculate performance metrics, explain memory management principles, and analyse resource allocation problems. Students must demonstrate technical understanding and communicate findings in a formal academic report using correct referencing.

Assessment Task Description

You are required to prepare a structured analytical report that addresses the three technical problems outlined below. All answers must be presented in a professional report format with clear headings, diagrams where appropriate, and detailed explanations.

Part 1: Process Scheduling Analysis

Given the following job characteristics:

Job	Arrival Time	CPU Cycles Required	Priority
A	0	3	3 (Silver)
B	3	8	2 (Gold)
C	4	3	1 (Diamond)
D	7	14	2 (Gold)
E	12	2	2 (Gold)

You must complete the following:

1. Construct a Gantt chart timeline for each scheduling algorithm listed below.
2. Calculate the waiting time and turnaround time for each process under each algorithm.
3. Show full working and calculations for all results.

The required scheduling algorithms are:

• First Come First Served (FCFS)
• Round Robin with time quantum of 3
• Highest Response Ratio Next (HRRN)
• Shortest Remaining Time (SRT)
• Shortest Process Next (SPN)

Part 2: Memory Management and Virtual Memory

Conduct academic research using textbooks, scholarly articles, and reputable online sources to complete the following:

• Define the concept of Memory Management in your own words.
• Define the concept of Virtual Memory in your own words.
• Explain why virtual memory is important in modern operating systems.
• Provide at least three properly referenced academic sources.

Part 3: Deadlock Analysis

A directed resource allocation graph is provided in the assessment materials on Moodle. Using this graph, answer the following questions:

1. Determine whether the system is in a deadlocked state.
2. Identify any processes that are blocked.
3. Demonstrate the resulting graph after applying reduction techniques.
4. Provide a clear explanation of your reasoning.

Report Requirements

• The report must be approximately 2,000 words excluding references and diagrams.
• All diagrams such as Gantt charts must be clearly labelled.
• Calculations must be shown step by step.
• Use formal academic language and structure.
• Harvard referencing style is mandatory.
• A minimum of five academic references is required.

Submission Instructions

• Submit one single document in PDF or Word format.
• File name must include student ID and subject code.
• Late submissions will incur standard academic penalties.

Assessment Rubric

Criteria	Fail	Pass	Credit	Distinction	High Distinction
Depth of Content	Incomplete and inaccurate explanations	Basic coverage of concepts	Clear understanding shown	Detailed and accurate explanations	Insightful and advanced analysis
Accuracy of Calculations	Major errors present	Some correct results	Mostly correct calculations	Accurate with minor issues	Fully correct and well justified
Analysis and Reasoning	No analysis provided	Limited reasoning	Logical analysis shown	Strong analytical approach	Exceptional critical evaluation
Use of Sources	No referencing	Minimal references	Adequate academic sources	Good range of sources	Excellent integration of literature
Writing Quality	Poor structure and grammar	Acceptable clarity	Well written	Very clear and professional	Outstanding academic writing

Academic Integrity

All work must be original. Any form of plagiarism or contract cheating will result in disciplinary action according to university policy.

Sample Answer Guidance

Effective scheduling analysis requires accurate construction of Gantt charts to illustrate how each algorithm allocates CPU time. Waiting time is calculated by measuring the total period a process spends in the ready queue before execution begins. Turnaround time is determined by subtracting arrival time from completion time. Memory management organises how an operating system controls primary memory to support multiple processes efficiently. Virtual memory enables programs larger than physical memory to execute through the use of secondary storage as an extension of RAM. Deadlock occurs when processes wait indefinitely for resources held by each other. Stallings explains that prevention and avoidance strategies are essential for maintaining reliable system performance (Stallings, 2020, https://doi.org/10.5555/3431234).

Recommended References

• Stallings, W. (2020). Operating Systems: Internals and Design Principles. 9th ed. Pearson Education. https://doi.org/10.5555/3431234
• Silberschatz, A., Galvin, P., and Gagne, G. (2019). Operating System Concepts. 10th ed. Wiley. https://www.wiley.com/operatingsystems
• Tanenbaum, A., and Bos, H. (2020). Modern Operating Systems. 5th ed. Pearson. https://doi.org/10.5555/3456789
• Love, R. (2019). Linux Kernel Development. 4th ed. Addison-Wesley. https://www.pearson.com/linuxkernel