1. C.Sc. 110 Computer Science 113: Computer Systems

2. First Year Structure The 1st year consists of four courses: 111: Software Design 112: Programming in Java 113: Computer Systems 114: Applications and Implications of IT

3. Aims of the Systems Course To introduce the features and components of computer systems. To provide you with an understanding of the relationship between applications software, systems software and hardware. To provide a basis for more detailed courses next year and a useful set of skills for non- majors.

4. Course Structure Course runs for two terms and is split into: Computer Architecture Operating Systems Each part is subdivided into topics.

5. Course Structure.. Architecture Topic 1 : Introduction - 1 lecture course structure book details assessment information basic computer concepts basic architecture and system software

6. Course Structure.. Architecture Topic 2 : Building a computer - 2 lectures information representation computer logic components of a computer Topic 3 : Controlling the computer - 3 lectures microinstructions machine languages assembly languages

7. Course Structure.. Architecture Topic 4 : I/O Devices and Networks- 3 lectures I/O devices Interrupts and device control techniques Support for computer networks Topic 5 : Performance - 1 lecture Computer Performance

8. Book Details Computer Science: A Modern Introduction (Second Edition) Les Goldschlager and Andrew Lister Prentice Hall£22.95

9. Lecture Material The slides are available on the Department Intranet. http://info.comp.lancs.ac.uk/ http://www.comp.lancs.ac.uk/computing/sta ff/kc/keiths_teaching.html You can take copies of these slides from any machine but note that the files are big.

10. Also... All of the notes for CSc 113 are available on CD-ROM. The discs are in the library in short loan.

11. Lecture Material The slides are available on the Department Intranet. You can take copies of these slides from any machine but note that the files are big. Summary sheets will be provided at the end of each term. There are no printed notes - you should take your own.

12. Assessment and Coursework Exam at the end of the first year. Written exercises (roughly one per term). Tutorial discussion material.

13. Term 1 : Computer Architecture

14. Topic 1 : Introduction Basic Concepts Reference : G & L pp 1 -12

15. Concepts and Terminology Key concepts in computing Memory Processor Program or Algorithm I/O device

16. Jack and Jill Jack and Jill are found lying dead on the floor. Around them are fragments of broken glass and a small pool of water. What killed them ?

17. A Program To Sort Numbers while list isn’t sorted into ascending order do... start with the first element (box) repeat the next set of instructions if contents of this box > that of next box then swap contents of these boxes consider the next element (box) until end of list is reached end while

18. A Program To Sort Numbers while list isn’t sorted into ascending order do... start with the first element (box) repeat the next set of instructions if contents of this box > that of next box then swap contents of these boxes consider the next element (box) until end of list is reached end while

19. A Program To Sort Numbers while list isn’t sorted into ascending order do... start with the first element (box) repeat the next set of instructions if contents of this box > that of next box then swap contents of these boxes consider the next element (box) until end of list is reached end while

20. A Program To Sort Numbers while list isn’t sorted into ascending order do... start with the first element (box) repeat the next set of instructions if contents of this box > that of next box then swap contents of these boxes consider the next element (box) until end of list is reached end while

21. A Program To Sort Numbers while list isn’t sorted into ascending order do... start with the first element (box) repeat the next set of instructions if contents of this box > that of next box then swap contents of these boxes consider the next element (box) until end of list is reached end while

22. A Program To Sort Numbers while list isn’t sorted into ascending order do... start with the first element (box) repeat the next set of instructions if contents of this box > that of next box then swap contents of these boxes consider the next element (box) until end of list is reached end while

23. A Program To Sort Numbers while list isn’t sorted into ascending order do... start with the first element (box) repeat the next set of instructions if contents of this box > that of next box then swap contents of these boxes consider the next element (box) until end of list is reached end while

24. A Program To Sort Numbers while list isn’t sorted into ascending order do... start with the first element (box) repeat the next set of instructions if contents of this box > that of next box then swap contents of these boxes consider the next element (box) until end of list is reached end while

25. A Program To Sort Numbers while list isn’t sorted into ascending order do... start with the first element (box) repeat the next set of instructions if contents of this box > that of next box then swap contents of these boxes consider the next element (box) until end of list is reached end while

26. A Program To Sort Numbers while list isn’t sorted into ascending order do... start with the first element (box) repeat the next set of instructions if contents of this box > that of next box then swap contents of these boxes consider the next element (box) until end of list is reached end while

27. A Program To Sort Numbers while list isn’t sorted into ascending order do... start with the first element (box) repeat the next set of instructions if contents of this box > that of next box then swap contents of these boxes consider the next element (box) until end of list is reached end while

28. A Program To Sort Numbers while list isn’t sorted into ascending order do... start with the first element (box) repeat the next set of instructions if contents of this box > that of next box then swap contents of these boxes consider the next element (box) until end of list is reached end while

29. A Program To Sort Numbers while list isn’t sorted into ascending order do... start with the first element (box) repeat the next set of instructions if contents of this box > that of next box then swap contents of these boxes consider the next element (box) until end of list is reached end while

30. A Program To Sort Numbers while list isn’t sorted into ascending order do... start with the first element (box) repeat the next set of instructions if contents of this box > that of next box then swap contents of these boxes consider the next element (box) until end of list is reached end while

31. A Program To Sort Numbers while list isn’t sorted into ascending order do... start with the first element (box) repeat the next set of instructions if contents of this box > that of next box then swap contents of these boxes consider the next element (box) until end of list is reached end while

32. A Program To Sort Numbers while list isn’t sorted into ascending order do... start with the first element (box) repeat the next set of instructions if contents of this box > that of next box then swap contents of these boxes consider the next element (box) until end of list is reached end while

33. A Program To Sort Numbers while list isn’t sorted into ascending order do... start with the first element (box) repeat the next set of instructions if contents of this box > that of next box then swap contents of these boxes consider the next element (box) until end of list is reached end while

34. A Program To Sort Numbers while list isn’t sorted into ascending order do... start with the first element (box) repeat the next set of instructions if contents of this box > that of next box then swap contents of these boxes consider the next element (box) until end of list is reached end while

35. A Program To Sort Numbers while list isn’t sorted into ascending order do... start with the first element (box) repeat the next set of instructions if contents of this box > that of next box then swap contents of these boxes consider the next element (box) until end of list is reached end while

36. A Program To Sort Numbers while list isn’t sorted into ascending order do... start with the first element (box) repeat the next set of instructions if contents of this box > that of next box then swap contents of these boxes consider the next element (box) until end of list is reached end while

37. A Program To Sort Numbers while list isn’t sorted into ascending order do... start with the first element (box) repeat the next set of instructions if contents of this box > that of next box then swap contents of these boxes consider the next element (box) until end of list is reached end while

38. A Program To Sort Numbers while list isn’t sorted into ascending order do... start with the first element (box) repeat the next set of instructions if contents of this box > that of next box then swap contents of these boxes consider the next element (box) until end of list is reached end while

39. A Program To Sort Numbers while list isn’t sorted into ascending order do... start with the first element (box) repeat the next set of instructions if contents of this box > that of next box then swap contents of these boxes consider the next element (box) until end of list is reached end while

40. A Program To Sort Numbers while list isn’t sorted into ascending order do... start with the first element (box) repeat the next set of instructions if contents of this box > that of next box then swap contents of these boxes consider the next element (box) until end of list is reached end while

41. A Program To Sort Numbers Finished

42. Concepts and Terminology Key concepts in computing Memory Processor Program or Algorithm I/O device

43. Basic Computer Architecture The components of a computer are connected together via one or more buses. MemoryCPUI/O Devices

44. The Software-Hardware Hierarchy Applications Software (e.g. packages) System Software (e.g. operating systems) Computer Hardware (e.g. CPU, memory, I/O devices)

45. System Software Examples of system software operating systems editors compilers and interpreters Examples of application software statistics packages drawing tools word processors

46. Summary Covered the course structure. Demonstrated the basic computer concepts of memory, programs, processors and i/o devices.

47. Coming Next Week Topic 2 : How to Build a Stored Program Computer Reference : G & L pp 143-147