Go Back to 433-242 (Computer Science, Faculty of Engineering, v4, p105)
NOTE: These differences were detected by computer program - they may or may not be substantive.
Different ASSESSMENT
Source=[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.]
Xref = [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.]
Different CONTACT
Source=[26 hours of lectures and 12 hours of tutorials]
Xref = [26 lectures and 12 tutorials.]
Different CONTENT
Source=[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.]
Xref = [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.]
Different COREQUISITES
Source=[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)]
Xref = [618-121 Mathematics 1A or equivalent. (Prior to 1996, Mathematics 618-101).]
Different OBJECTIVES
Source=[On successful completion of this subject a student should:
<ul>
<li>be familiar with a range of problem solving strategies and their application in the solution of problems by computer
<li>know a variety of techniques for solving sorting, searching, and priority queue problems and have a basic understanding of graph algorithms
<li>have experience with using complex algorithms and data structures, specifically in an imperative language
<li>be able to perform basic complexity analysis of algorithms and understand the concept of problem complexity
</ul>]
Xref = [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.]
Different PREREQUISITES
Source=[433-142 Computing Fundamentals B (Before 1994: 433-102 or 433-221)]
Xref = [433-142 Computing Fundamentals B]
Different SEMESTER
Source=[Available in both semesters one and two]
Xref = [Available in both semester s 1 & 2]
Differences in Computer Science, Faculty of Science (v4, p182)
Different ASSESSMENT
Source=[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.]
Xref = [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.]
Different CONTACT
Source=[26 hours of lectures and 12 hours of tutorials]
Xref = [26 lectures and 12 tutorials]
Different COORDINATOR
Source=[Dr. H. Sondergaard<i> (Semester one), </i> Dr L Naish]
Xref = [Dr H Sondergaard (Semester 1), Dr L Naish<i> (Semester 2).</i>]
Different OBJECTIVES
Source=[On successful completion of this subject a student should:
<ul>
<li>be familiar with a range of problem solving strategies and their application in the solution of problems by computer
<li>know a variety of techniques for solving sorting, searching, and priority queue problems and have a basic understanding of graph algorithms
<li>have experience with using complex algorithms and data structures, specifically in an imperative language
<li>be able to perform basic complexity analysis of algorithms and understand the concept of problem complexity
</ul>]
Xref = [On successful completion of this subject, students should:
<ul>
<li>be familiar with a range of problem solving strategies and their application in the solution of problems by computer;
<li>know a variety of techniques for solving sorting, searching, and priority queue problems and have a basic understanding of graph algorithms;
<li>have experience with using complex algorithms and data structures, specifically in an imperative language;
<li>be able to perform basic complexity analysis of algorithms;
<li>understand the concept of problem complexity.
</ul>]
Different PREREQUISITES
Source=[433-142 Computing Fundamentals B (Before 1994: 433-102 or 433-221)]
Xref = [Computer Science 433-142 (Before 1994: 433-102 or 433-221) and Mathematics 618-101 (From 1996: Mathematics 618-121 or 618-142)]
Different SEMESTER
Source=[Available in both semesters one and two]
Xref = [Offered in both Semester 1 and Semester 2]
Mon Oct 9 16:30:34 1995
Generated by: ./S50-v2writeHTML.pl
What this report means.