Handbook 1996 : Faculty of Engineering (Volume 4 page 84)
First Year Engineering subject : Next:433-153 | Prev:433-141 | Search | Help


433-142 "Computing Fundamentals B" appears differently in several places - choose the one you want:

  1. 433-142 First Year Engineering, Faculty of Engineering.
  2. 433-142 Computer Science, Faculty of Science.
  3. 433-142 Computer Science, Faculty of Arts.
  4. 433-142 Geomatics, Faculty of Engineering.

1. First Year Engineering, Faculty of Engineering (v4, p84) : Next:433-153 | Prev:433-141
4. Geomatics, Faculty of Engineering (v4, p118) : Next:433-153 | Prev:433-141

433-142 Computing Fundamentals B

Credit points: 14.2

Coordinator: Dr. A. Davison

Prerequisite: Computing Fundamentals A, 433-141

Contact: 39 hours of lectures (3 per week); 12 one-hour tutorials; 12 two-hour laboratory classes;

Timetable: offered in both Semester 1 and Semester 2

Objectives:

On successful completion of the subject students should:

Content:

Advanced programming techniques: dynamic data structures; abstract data types. Computer Organisation: components; data storage; data manipulation. Execution of algorithms: program translation; operating systems. Programming Paradigms: functional; imperative; logic. Software Engineering: software life cycle; program testing and debugging. Theory of Computation: computability; complexity; correctness.

Assessment:

Written examinations not exceeding four hours at the end of the subject. Project work, which is expected to take about 30 hours, must be completed satisfactorily to pass the subject. Weighting of assessment components will be made known at the start of the subject.

1. First Year Engineering, Faculty of Engineering (v4, p84) : Next:433-153 | Prev:433-141
4. Geomatics, Faculty of Engineering (v4, p118) : Next:433-153 | Prev:433-141


2. Computer Science, Faculty of Science (v4, p181) : Next:433-241 | Prev:433-141

433-142 Computing Fundamentals B

Credit points: 12.5

Coordinator: Dr A Davison.

Prerequisite: Computer Science 433-141

Contact: 39 lectures (3 per week); 12 one-hour tutorials; 12 two-hour laboratory classes.

Timetable: Offered in both Semester 1 and Semester 2

Objectives:

On successful completion of the subject, students should:

Content:

Advanced programming techniques: dynamic data structures; abstract data types. Computer Organisation: components; data storage; data manipulation. Execution of algorithms: program translation; operating systems. Programming Paradigms: functional; imperative; logic. Software Engineering: software life cycle; program testing and debugging. Theory of Computation: computability; complexity; correctness.

Assessment:

Written examinations not exceeding four hours at the end of the subject. Project work, which is expected to take about 30 hours, must be completed satisfactorily to pass the subject. Weighting of assessment components will be made known at the start of the subject.

* Note that CONTACT, COORDINATOR, OBJECTIVES, POINTS, PREREQUISITES, SEMESTER differs from the maintainer's version above. A log of variations is available.

2. Computer Science, Faculty of Science (v4, p181) : Next:433-241 | Prev:433-141


3. Computer Science, Faculty of Arts (v3, p39) : Next:433-241 | Prev:433-141

433-142 Computing Fundamentals B

Coordinator: Dr A Davison.

Prerequisite: 433-141 Computing Fundamentals A

Contact: 39 lectures, 12 tutorials, 24 hours of laboratory classes.

Timetable: Available in both semesters one & two

Objectives:

Upon completion of the subject, students should: have proficiency in programming in a high level imperative language; be familiar with abstract data models and be aware of their relevance to problem solving; have an understanding of design issues relevant to programming in a functional language and in an imperative language (C); have knowledge of the structure of computer systems and the role of systems software; have a background of relevant knowledge and skills on which to base further study of Computer Science.

Content:

Advanced programming techniques: dynamic data structures; abstract data types. Computer organisation: components; data storage; data manipulation. Execution of algorithms: program translation; operating systems. Programming paradigms: functional; imperative; logic. Software engineering: software life cycle; program testing and debugging. Theory of computation: computability; complexity; correctness.

Assessment:

Written examinations not exceeding 4 hours. Project work, which is expected to take about 36 hours, must be completed satisfactorily to pass the unit. Weighting of assessment components will be made known at the commencement of the unit.

* Note that ASSESSMENT, CONTACT, CONTENT, COORDINATOR, OBJECTIVES, PREREQUISITES, SEMESTER differs from the maintainer's version above. A log of variations is available.

3. Computer Science, Faculty of Arts (v3, p39) : Next:433-241 | Prev:433-141


Up to navigation aids

Status:          Official 1996
Date created:    Oct  9 1995
Last modified:   Oct  9 1995
Authorised by:   Academic Registrar
Email enquiries: Course_Information@registrar.unimelb.edu.au
Maintained by: Dept. of Computer Science, Faculty of Engineering.

Copyright © University of Melbourne 1995,1996.