Cardiff School of Technologies

Assessment
Brief

Module Code Module Title

CMP4011 Architectures and Operating Systems

Academic Year Semester

2023-2024 T2

Module Leader email

iahmed@cardiffmet.ac.uk

Content
Assessment Details ..................................................... 2
Submission Details ...................................................... 4
Assessment Criteria .................................................... 5
Assessment Details
Assessment title Abr. Weighting

Portfolio PORT1 80%

Pass marks are 40% for undergraduate work and 50% for postgraduate work unless stated otherwise.

Task/assessment brief: Solve all questions.

Worksheet-1 (30 Marks)

1. [6 Marks] Convert the following decimal numbers into binary and hexadecimal numbers. The
answers should also include all the necessary steps. 222, 721, 1345, 1620, 1339

2. [6 Marks] Critically differentiate between monolithic and layered architectures. Draw the block
diagram of each and discuss advantages and disadvantages of each.

3. [ 6 Marks] Generate the truth table for the expression ¬(A ∨ B) ∧ (¬C ∨ D)

4. [ 6 Marks] What are the differences between kernel and shell in an operating system. Write the
main functions of each.

5. [6 Marks] Write a C++ program that randomly stores 100 numbers in an array and then print the
address and value of each item in the array. The program should use the concepts of
Functions, References and Pointers.

Worksheet-2 (30 Marks)

6. [10 Marks] Consider the below table for FCFS, SJF, Priority and Round Robin (RR) techniques.
The time quantum for RR is 4.

Process CPU Time Priority

ID
P1 4 2
P2 2 1
P3 16 4
P4 8 2
P5 10 3

a. Draw the Gannt Chart for the techniques. [ 4]

b. Calculate the turn around and waiting time for each process. [4]
c. Which of the techniques results in minimum waiting time. [2]

2
 7. [10 Marks] Consider the following set of three interacting processes that can access three
shared semaphores: semaphore U = 3; semaphore V = −1, semaphore W = −1. Answer the
below questions

[Process A] [Process B] [Process C]

while ( true ){ while ( true ){ while (true ) {
wait (U) ; wait (V) ; wait (W) ;
print (”C”); print (”B”); print (”D”);
signal (V); signal (W);
}
} }

a. What is the maximum number of C’s are printed when all processes runs? Provide an
explanation of your answer. [3]
b. What is the maximum number of B’s that might be printed when this set of processes
runs? Provide an explanation of your answer [3]
c. What is the maximum number of D’s that might be printed when this set of processes
runs? Provide an explanation of your answer [4]

8. [2+8= 10 Marks] What is synchronisation? Discuss how synchronisation is managed in

windows Operating System.

Worksheet-3 (30 Marks)

9. [3+3+1= 10 Marks] Consider the following page reference string:

1, 2, 3, 4, 2, 1, 5, 6, 2, 1, 2, 3, 7, 6, 3, 2, 1, 2, 3, 6. Run the (a) LRU (b) FIFO (c) and Optimal
page replacement algorithms. Calculate the page fault and rank them from best to worst.

10. [3+3+4= 10 Marks] Given fixed memory partitions (as shown in below table), how would you
place five processes say P1, P2, P3, P4 and P5 of sizes 100K, 10K, 35K, 15K and 23K
respectively, by using first-fit, best-fit and worst-fit algorithms?

Memory Block Size

Block1 50 K
Block2 200K
Block3 70K
Block4 115K
Block5 15K

11. [10 Marks] Discuss the architectural differences between Linux and Windows Operating
System.

Word count (or equivalent): 3200

This a reflection of the effort required for the assessment. Word counts will normally include any text,
tables, calculations, figures, subtitles and citations. Reference lists and contents of appendices are
excluded from the word count. Contents of appendices are not usually considered when determining
your final assessment grade.

3
Submission Details
Submission Estimated This will normally be 20
Deadline: 07-05-2024 Feedback working days after initial
Return Date submission.

Submission By 4.00pm on the

Time: deadline day.

Moodle/Turnitin: Any assessments submitted after the deadline will not be marked and will be
recorded as a non-attempt unless you have had an extension request
agreed or have approved mitigating circumstances. See the School Moodle
pages for more information on extensions and mitigating circumstances.

Feedback Feedback for the assessment will be provided electronically via Moodle. Feedback
will be provided with comments on your strengths and the areas which you can
improve. View the guidance on how to access your feedback.

All marks are provisional and are subject to quality assurance processes and
confirmation at the programme Examination Board.

4
Assessment Criteria

Learning outcomes assessed

Learning Outcomes Assessment Criteria

[LO1] Demonstrate an understanding of the WorkSheet-1 [ LO1, LO2]
history, key terminology, and current
industry trends in computer architecture.

[LO2] Demonstrate knowledge of computer

architectures and their abstractions, from
hardware to the operating system interfac.

[LO3] Demonstrate knowledge of common

operating systems, understanding the WorkSheet-2 [ LO3, LO4, LO5]
concepts and mechanisms for the
management, ownership, and protection of
computer resources.

[LO4] Demonstrate an understanding of the

various types of storage and the Input/output
subsystem. WorkSheet-3 [LO3, LO4, LO5]

[LO5] Analyse the design and

implementation of modern architectures and
operating systems, along with the factors
that affect performance.

Further Information on assessment, referencing and grading can be found in the

Module Handbook (on Moodle)

5
Marking/Assessment Criteria

A (70+) An excellent and correct completion of all questions.

B A good effort in completing the questions.
(60-69)
C Average effort is made to answer the questions.
(50-59)
D Poor attempt is made to provide answers to the questions.
(40-49)
Fail <40 Fail to achieve minimum criteria described in D grade
8