Module 19323.1 (2008)
Syllabus page 2008/2009
06-19323
Fundamentals of Computer Science 1
Level 4/M C
Jim Yandle
Links | Outline | Aims | Outcomes | Prerequisites | Teaching | Assessment | Books | Detailed Syllabus
The Module Description is a strict subset of this Syllabus Page. (The University module description has not yet been checked against the School's.)
Relevant Links
Outline
The module will explore some of the fundamentals of computer science, both hardware and software. Topics will include: introduction to hardware, operating systems, networking; programming languages; data types and algorithms.
Aims
The aims of this module are to:
- introduce the main hardware components of a computer and their function
- explain the role of an operating system and system software
- give an overview of fundamental data structures and algorithms
Learning Outcomes
| On successful completion of this module, the student should be able to: | Assessed by: | |
| 1 | demonstrate knowledge of the fundamentals of computer hardware and software architectures | Examination |
| 2 | understand and be able to select from a range of data structure and associated algorithms | Examination |
| 3 | appreciate differences between basic complexity classes of algorithms | Examination |
Restrictions, Prerequisites and Corequisites
Restrictions:
None
Prerequisites:
None
Co-requisites:
None
Teaching
Teaching Methods:
4 hrs of lectures/tutorials per week
Contact Hours:
Assessment
- Sessional: 3 hr examination (100%).
- Supplementary (where allowed): As the sessional assessment
Recommended Books
| Title | Author(s) | Publisher, Date |
| Computer Science - a modern Introduction | L Goldschlager, A Lister | Prentice Hall, 1988 |
| Data Structures and Algorithms in Java, 2nd Edition | M Goodrich | Wiley, 2000 |
Detailed Syllabus
-
Introduction to Computer Science
- A brief history of the development of the Stored-Program Digital Computer. The von Neumann computer.
- Computer Hardware Organisation (Central Processing Unit, Primary and Secondary Memory, Input/Output devices).
- Instruction sets (CISC, RISC); Instruction execution cycles; Memory addressing modes; Interrupts.
- System Software (Compilers, Interpreters, Assemblers, Loaders)
- Operating Systems basic functions (Device Management, Process Management, Memory Management)
- Scheduling and Synchronization.
- Networks (Topology, Security).
- Computability, complexity and correctness.
- Data Structures and Algorithms
- What is a Data Type?
- Specification and representation of Abstract Data Types
- Lists
- Index lists
- Stacks and Queues
- Sets as abstract data types
- Trees as abstract data types
- Graphs as abstract data types
Last updated: 13 May 2005
Source file: /internal/modules/COMSCI/2008/xml/19323.xml
Links | Outline | Aims | Outcomes | Prerequisites | Teaching | Assessment | Books | Detailed Syllabus