Lectures

Lecture Timetable | Lectures | Learning Modules

Lecture Timetable

In this table, green entries have been released to students, black entries are in draft form or not yet available, while red entries indicate activities that have been completed.

The heading Notes refers to page numbers in the prescribed text by William Stallings (6th Ed.)

Week	Date	Lecture	Objs	Content	Notes	PDFs
1	14 Jul	01	1	Introduction to this Unit, Computer Systems Overview	7-13	1-18
1	16 Jul	02	1	Computer Systems Overview	14-25	19-35
1	17 Jul	03	1	Computer Systems Overview	25-49	36-58
2	21 Jul	04	9	Computer Systems Overview , Operating Systems Overview	44-49, 50-55	59-66, 1-12
2	23 Jul	05	9	Operating Systems Overview	55-104	13-38
2	24 Jul	06	9	Operating Systems Overview	55-104	39-58
3	28 Jul	07	4	Process Description and Control	105-119	1-22
3	30 Jul	08	4	Process Description and Control	119-132	23-56
3	31 Jul	09	4	Process Description and Control	133-152	23-56
4	04 Aug	10	2,3,4	Threads, SMP, Microkernels	160-172	1-23
4	06 Aug	11	2,3,4	Threads, SMP, Microkernels	173-184	24-41
4	07 Aug	12	2,3,4	Threads, SMP, Microkernels , Concurrency: ME&S	185-204, 205-212	42-55, 1-10
5	11 Aug	13	3,4	Concurrency: Mutual Exclusion and Synchronization	212-220	11-24
5	13 Aug	14	3,4	Concurrency: Mutual Exclusion and Synchronization	220-228	25-37
5	14 Aug	15	3,4	Concurrency: Mutual Exclusion and Synchronization	229-242	38-55
6	18 Aug	16	3,4,5,7	Concurrency: ME&S , Chapter 5 animations, Concurrency: D&S	242-261, 262-267	56-64, 1-8
6	20 Aug	17	5,7	Concurrency: Deadlock and Starvation	267-274	8-22
6	21 Aug	18	5,7	Concurrency: Deadlock and Starvation	275-308	23-51
7	25 Aug	19	2,7,10	Memory Management	309-329	1-35
7	27 Aug	20	2,7,10,2,6,10	Memory Management , Virtual Memory	330-344, 345-403	36-39, 1-25
7	28 Aug	21	2,6,10	Virtual Memory	345-369	26-48
8	01 Sep	22		(Lecture Cancelled)
8	03 Sep	23		(Lecture Cancelled)
8	04 Sep	24	2,6,10,2,4,5,6	Virtual Memory , Uniprocessor Scheduling	370-403, 404-419	49-65, 1-25
9	08 Sep	25		(Lecture Cancelled)
9	09 Sep	26	2,4,5,6	Uniprocessor Scheduling	420-451	26-48
9	11 Sep	27	2,7	I/O Management and Disk Scheduling	495-550	1-31
10	15 Sep	28	2,7	I/O Management and Disk Scheduling	495-550	32-52
10	17 Sep	29	2,7	I/O Management and Disk Scheduling , File Management	495-550, 551-554	52-60, 1-14
10	18 Sep	30	2,7	File Management	555-563	15-38
11	22 Sep	31	2,7	File Management	563-600	39-70
11	24 Sep	32	2,7	File Management	563-600	39-70
11	25 Sep	33	8,9	Security	635-666	1-23
	29 Sep	-		Mid-semester (!) break: No Lectures this week
	01 Oct	-		Mid-semester (!) break: No Lectures this week
	02 Oct	-		Mid-semester (!) break: No Lectures this week
12	06 Oct	34	8,9,10	Security , Security Techniques	635-666, 667-675	24-35, 1-9
12	08 Oct	35	8,9	Security Techniques	667-706	10-31
12	09 Oct	36	2,3,4,9	Networking	online	1-30
13	13 Oct	37	2,3,4,9	Networking	online	1-30
13	15 Oct	38		revision
13	16 Oct	39		revision

Lectures

The lectures define the formal content of the unit, and will be used as the initial point of reference for unit knowledge outcomes. This knowledge will be built upon by the tutorials and laboratories in order to address the higher level objectives relating to skills and and application.

The lectures will be held at 12noon in R2 on Mondays, 3pm in S9 on Wednesdays and 1pm in E2 on Thursdays.

The lecture slides have been replaced for 2008, and are now based upon the new text book by William Stallings, published by and available from Pearson Australia. You are allowed to access and take a copy of the slides for the purpose of self-study, but you must not redistribute them.

The Content field identifies the relevant section of the text book, and is a link to the pdf slides for the lecture. The PowerPoint slide versions are also available, using the link under PowerPoints. Please bear in mind that the pdf files are those used in lectures, and consequently will tend to be more up-to-date than the powerpoint slides. Interspersed into the timetable are the tutorial and laboratory topics, with links to the relevant web pages. Each lab session is preceeded by a tutorial which discusses the important issues in the lab session. Feedback on the previous lab session will also be made available in the tutorials.

At the time of writing, not all materials to be used in the lectures have been identified. This page will be updated regularly to reflect past practice, current happenings, and future intentions. Lines in red represent completed activities.

Learning Modules

Number	Title	Slides	Lectures
0	Introduction to this Unit	0	01
1	Computer Systems Overview	51	01,02,03
2	Operating Systems Overview	58	04,05,06
3	Process Description and Control	56	07,08,09
4	Threads, SMP, Microkernels	55	10,11,12
5	Concurrency: Mutual Exclusion and Synchronization	58	13,14,15
6	Concurrency: Deadlock and Starvation	51	16,17
7	Memory Management	39	18,19
8	Virtual Memory	65	20,21,24
9	Uniprocessor Scheduling	48	26
10	Multiprocessor and RT Scheduling	53
11	I/O Management and Disk Scheduling	60	27,28,29
12	File Management	70	30,31,32
13	Embedded Systems	41
14	Security	35	33,34
15	Security Techniques	31	35
16	Client Server	61
17	Networking	30	36,37
18	Distributed Process Management	60
	Total Slides/Average per Lecture	707	19.64

Document History

20080925:102050	2.0.1	ajh	minor text changes
20080409:174628	2.0.0	ajh	created from FIT2022-2007

This page maintained by John Hurst.
Copyright Monash University Copyright Policy

2366 accesses since
21 Apr 2008

Generated at 20100830:1742 from an XML file modified on 20100830:0823
Maintainer use only; not generally accessible: Local Server Work Server CSSE Server

2732 accesses since 21 Apr 2008, HTML cache rendered at 20120215:1622