A continuation for both Computer Science 1025A/B and Computer Science 1026A/B. Data organization and manipulation; abstract data types and their implementations in a modern programming language; lists, stacks, queues, trees; recursion; file handling and storage.

(in each case with a mark of at least 65%).

An overview of core data structures and algorithms in computing, with a focus on applications to informatics and analytics in a variety of disciplines. Includes lists, stacks, queues, trees, graphs, and their associated algorithms; sorting, searching, and hashing techniques. Suitable for non-Computer Science students.

with a mark of at least 60% and registration in Medical Sciences First Entry, or

A continuation for Engineering Science 1036A/B. Data organization and manipulation; abstract data types and their implementations in the C programming language; lists, stacks, queues, trees; pointers; recursion; file handling and storage. Intended for students in the Faculty of Engineering.

Designing, implementing and testing computer programs using Java and MATLAB to fulfill given specifications for small problems using sound engineering principles and processes. Awareness of the engineering aspects of the process of constructing a computer program.

COMPSCI 1037A/B

COMPUTER SCIENCE FUNDAMENTALS II

Difficulty

Useful

Attendance

Written Reviews (0)

Prerequisites

Antirequisites

Extra Info

Locations