Module Details
The information contained in this module specification was correct at the time of publication but may be subject to change, either during the session because of unforeseen circumstances, or following review of the module at the end of the session. Queries about the module should be directed to the member of staff with responsibility for the module.
Title OPERATING SYSTEM CONCEPTS
Code COMP104
Coordinator Prof PE Dunne
Computer Science
P.E.Dunne@liverpool.ac.uk
Year CATS Level Semester CATS Value
Session 2016-17 Level 4 FHEQ Second Semester 15

Aims
  1. To introduce students to the structure and functionality of modern operating systems.

  2. To explain how the principal components of computer-based systems perform their functions and how they interact with each other.

Learning Outcomes

be able to state the overall structure and functionality of a modern operating system and the interactions between computer hardware and user-processes.

be able to identify the operations of the major components of an operating system, including the device manager, file manager, memory manager, and process manager.

be able to identify the functions of system programs, including parsers, compilers, and virtual machines.

be able to construct programs which demonstrate in a simple form the operation of examples of systems program, including simple compilers and programs that involve the managment of concurrent processes.


Syllabus
1 
  1. Process management: Communicating sequential processes, process management and scheduling. Resource allocation, mutual exclusion, semaphores, deadlock. (6 lectures)
  2. Concurrent programming in Java. (4 lectures)
  3. Memory management: storage organisation methods, paging, segmentation, memory allocation, housekeeping. (4 lectures)
  4. Device Management: Polling / Interrupts. (1 lecture)
  5. File management: Input/output, files, and filestore organisation: buffering, caching, store allocation and garbage collection. (3 lectures)
  6. Operating systems case studies: Windows and Linux. (3 lectures)
  7. Compilers: a practical overview of compiler construction; lexical analysis, parsing, code generation, linking,interpretation examined in the context of Java and available software tools. (6 lectures)
  8. Runtime store organisation: dynamic store allocation, treatment of recursion. Organisation o f the Java virtual machine. (3 lectures)

Teaching and Learning Strategies

Lecture -

Laboratory Work -


Teaching Schedule
  Lectures Seminars Tutorials Lab Practicals Fieldwork Placement Other TOTAL
Study Hours 30

     10

     40
Timetable (if known)              
Private Study 110
TOTAL HOURS 150

Assessment
EXAM Duration Timing
(Semester)		 % of
final
mark		 Resit/resubmission
opportunity		 Penalty for late
submission		 Notes
Unseen Written Exam  120  2  80  Yes  Standard UoL penalty applies  Final Exam Notes (applying to all assessments) Resit exam will replace failed CA components, the Learning Outcomes will be covered in the resit exam. 
CONTINUOUS Duration Timing
(Semester)		 % of
final
mark		 Resit/resubmission
opportunity		 Penalty for late
submission		 Notes
Coursework  30 hours expected fo  2  10  Yes  Standard UoL penalty applies  Assignment 1 
Coursework  30 hours expected fo  2  10  Yes  Standard UoL penalty applies  Assignment 2 

Recommended Texts
Reading lists are managed at readinglists.liverpool.ac.uk. Click here to access the reading lists for this module.
Explanation of Reading List: