Handbook 1996 : Faculty of Engineering (Volume 4 page 105)
Computer Science subject : Next:433-243 | Prev:433-241 | Search | Help
433-242 "Algorithms and Problem Solving" appears differently in several places - choose the one you want:
1. Computer Science, Faculty of Engineering (v4, p105) : Next:433-243 | Prev:433-241
4. Geomatics, Faculty of Engineering (v4, p118) : Next:433-243 | Prev:433-241
Credit points: 9.5
Coordinator: Dr. H. Sondergaard (Semester one), Dr L Naish
Prerequisite: 433-142 Computing Fundamentals B (Before 1994: 433-102 or 433-221)
Corequisite: Computer Science 433-142 (Before 1994: 433-102 or 433-221) and Mathematics 1A 618-101 or Mathematics 1P 618-171 or Mathematics 1R 618-181 (From 1996: Mathematics 618-121 or 618-142)
Contact: 26 hours of lectures and 12 hours of tutorials
Timetable: Available in both semesters one and two
Objectives:
On successful completion of this subject a student should:
- be familiar with a range of problem solving strategies and their application in the solution of problems by computer
- know a variety of techniques for solving sorting, searching, and priority queue problems and have a basic understanding of graph algorithms
- have experience with using complex algorithms and data structures, specifically in an imperative language
- be able to perform basic complexity analysis of algorithms and understand the concept of problem complexity
Content:
C programming. Lists and trees. Complexity analysis. Sorting and searching algorithms and their complexity. Graph algorithms. A selection of topics from: complexity classes, parallel and probablistic algorithms.
Assessment:
Up to three hours of written examinations 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. Computer Science, Faculty of Engineering (v4, p105) : Next:433-243 | Prev:433-241
4. Geomatics, Faculty of Engineering (v4, p118) : Next:433-243 | Prev:433-241
2. Computer Science, Faculty of Arts (v3, p39) : Next:433-243 | Prev:433-241
Prerequisite: 433-142 Computing Fundamentals B
Corequisite: 618-121 Mathematics 1A or equivalent. (Prior to 1996, Mathematics 618-101).
Contact: 26 lectures and 12 tutorials.
Timetable: Available in both semester s 1 & 2
Objectives:
On successful completion of this subject, students should: be familiar with a range of problem solving strategies and their application in the solution of problems by computer; understand the concepts of algorithm analysis and problem complexity; know a variety of techniques for solving sorting, searching, and priority queue problems; have an appreciation of the areas of parallel and distributed algorithms.
Content:
More work on problem solving strategies, and a more formal introduction to complexity analysis. Sorting and searching algorithms are presented in the light of the presentation of problem-solving strategies and complexity issues. Parallel and distributed algorithms are presented briefly.
Assessment:
Up to three hours of written examinations 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 commencement of the subject.
* Note that ASSESSMENT, CONTACT, CONTENT, COREQUISITES, OBJECTIVES, PREREQUISITES, SEMESTER differs from the maintainer's version above. A log of variations is available.
2. Computer Science, Faculty of Arts (v3, p39) : Next:433-243 | Prev:433-241
3. Computer Science, Faculty of Science (v4, p182) : Next:433-243 | Prev:433-241
Credit points: 9.5
Coordinator: Dr H Sondergaard (Semester 1), Dr L Naish (Semester 2).
Prerequisite: Computer Science 433-142 (Before 1994: 433-102 or 433-221) and Mathematics 618-101 (From 1996: Mathematics 618-121 or 618-142)
Contact: 26 lectures and 12 tutorials
Timetable: Offered in both Semester 1 and Semester 2
Objectives:
On successful completion of this subject, students should:
- be familiar with a range of problem solving strategies and their application in the solution of problems by computer;
- know a variety of techniques for solving sorting, searching, and priority queue problems and have a basic understanding of graph algorithms;
- have experience with using complex algorithms and data structures, specifically in an imperative language;
- be able to perform basic complexity analysis of algorithms;
- understand the concept of problem complexity.
Content:
C programming. Lists and trees. Complexity analysis. Sorting and searching algorithms and their complexity. Graph algorithms. A selection of topics from: complexity classes, parallel and probablistic algorithms.
Assessment:
Up to three hours of written examinations 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 commencement of the subject.
* Note that ASSESSMENT, CONTACT, COORDINATOR, OBJECTIVES, PREREQUISITES, SEMESTER differs from the maintainer's version above. A log of variations is available.
3. Computer Science, Faculty of Science (v4, p182) : Next:433-243 | Prev:433-241
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.