Module 11337 (2003)
Syllabus page 2003/2004
06-11337
Introduction to Computer Science A
Level 1/C
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.)
Changes and updates
Recommended books revised
Relevant Links
Outline
The module will introduce the fundamental concepts of Computer Science, such as the von Neumann machine, the representation of data in computer memory, basic programming constructs and basic data models and data structures. The ideas will be presented abstractly, although examples will be given in the language used in the parallel programming workshop modules.
Aims
The aims of this module are to:
- introduce the fundamental concepts of Computer Science
- support and underpin the programming modules
Learning Outcomes
| On successful completion of this module, the student should be able to: | Assessed by: | |
| 1 | understand the basics of the von Neumann architecture and how it influences the design of high-level programming language constructs | Examination |
| 2 | explain how the main imperative programming language constructs are realised on the machine level | Examination |
| 3 | understand the importance of abstract models of computation and data | Examination |
| 4 | make informed choices between alternative ways of implementation | Examination |
| 5 | justify choices on the grounds of time and space complexity | Examination |
Restrictions, Prerequisites and Corequisites
Restrictions:
None
Prerequisites:
None
Co-requisites:
06-11338 (Introduction to Computer Science B) (linked module)
Teaching
Teaching Methods:
2 hrs lecture, 1 hr exercise class per week
Contact Hours:
Assessment
- Supplementary (where allowed): As the sessional assessment
- 3 hr examination (70%), continuous assessment (30%), divided equally between this module and 06-11338 (Introduction to Computer Science B). Resit by examination only.
Recommended Books
| Title | Author(s) | Publisher, Date |
| Computing Science: an Overview | Brookshear | Addison-Wesley, |
| Computer Science, a Modern Introduction | Goldschlager L & Lister A | Prentice Hall, 1988 |
| Computing Concepts with Java Essentials | Horstmann C S | 1998 |
| Detailed module notes will be provided. |
Detailed Syllabus
-
The von Neumann machine (6 lectures)
- Integer representation and integer arithmetic
- Real number computation
- Character representation and coding
- Memory organisation
- Machine language
- Basic imperative programming (5 lectures)
- Arrays and the for-loop
- Streams and the while-loop
- Macros, subroutines, stacks
- Functions, procedures, and methods
- Values and locations
- Operating systems (2 lectures)
- Concurrency and process management
- Virtual memory
- Basic abstract data types (5 lectures)
- Array-based implementation of lists
- Linked list implementation of lists
- Inheritance: stacks
- Inheritance: queues
Last updated: 1 Feb 2004
Source file: /internal/modules/COMSCI/2003/xml/11337.xml
Links | Outline | Aims | Outcomes | Prerequisites | Teaching | Assessment | Books | Detailed Syllabus