CSE1301 Timetable -- Semester 1, 2005

Updated: 17 Feb 2005 BM (NON-FINAL VERSION)
 Week
number		  Week
starting		 Tuesday
11am (S6) or 2pm (S4) 		 Wednesday   (C1)
12noon or 2pm		  Thursday  (C1)
12noon or 2pm
 Tutorial
 Practical
 1  28 Feb  Course Intro L1. Systems L2. Algorithms 1
 
No Prac
 Get your Computer Account working
 2  7 Mar L3. Algorithms 2 L4. C Primitives 1 L5. C Primitives 2
 
P1. Getting Started
 3  14 Mar L6. C Primitives 3 L7. Input/Output L8. Booleans
T1. Algorithms
P2. Coding Simple Algorithms
 4  21 Mar L9. Selection L10. Iteration 1 L11. Iteration 2
T2. Arith. & Bool. Exprns
[P2 Cont'd, optional]
 -  28 Mar   Mid-Semester Break
 5  4 Apr L12. Algorithm Design L13. Functions 1 L14. Functions 2
T3. Selection & Iteration
P4.  Selection & Iteration
 6  11 Apr L15. Pointers 1 L16. Pointers 2 L17. MID-SEMESTER
TEST
T4. Functions
P5.  Functions
 7  18 Apr  TEST Review L18. Arrays  L19.   Flowcharts and Debugging
T5.  Pointers
 P6.  General, Pointers
 8  25 Apr L20. Case Study: Functions
& Pointers & Arrays		 L21. Strings L22. File I/O
T6. Flowcharts & Arrays
 P7.  Arrays
 9  2 May L23. Structures 1 L24. Structures 2 L25. Software Engineering
T7. Strings & File I/O
P8. Strings & File I/O
 10  9 May L26. Case Study: Project L27. Recursion 1 L28. Recursion 2
T8. S.E. & Structures
P9. S.E. & Structures
 11  16 May L29. Numerical 1 L30. Numerical 2 L31. List 1 (Search)
T9. Recursion
P10. Recursion
 12  23 May L32. List 2 (Sort) L33. List 3 L34. History
T10. Numerical & Search
P11.(*) Numerical & Search
 13  30 May L35. Revision 1 L36. Revision 2 L37. T.B.A.
T11. Sorting
P12.(**)  Sorting
(*)P11 Students are to hand in project specifications at the start of Prac 11.
(**)P12 The project will be marked during Prac 12, but students should not work on the project during the prac.

Dr Tim Ferguson
Dr Bernd Meyer

[ Home ] Disclaimer