Use the Tab and Up, Down arrow keys to select menu items.
This course teaches fundamental topics in Computer Science, including discrete structures, and aspects of probability theory, formal automata and languages, computability and a basic appreciation of compiler design.
This course deals with fundamental concepts and techniques in Computer Science. The first part includes probabilistic methods of Computer Science. The second part deals with automata theory. The third part consists of graph theory and compilers. More break-downs are given below.Part 1. From set theory and combinatorics to probabilities, random events and random variables, pseudo-random numbers, statistical analysis of experimental data. Part 2. Finite automata, regular expressions, context-free grammars, pushdown automata, Turing machines and computability. Part 3. Directed and undirected graphs, planar graphs, shortest paths, graph and matrix, compiler, lexical and syntax analysis, code generation.
(1) COSC121; (2) COSC122; (3) 15 points from Mathematics, Statistics, Engineering Mathematics or MSCI110. MATH101 is not acceptable. MATH120/STAT101 are strongly recommended.
COSC202, COSC222
For further information see Computer Science and Software Engineering Head of Department
Domestic fee $665.00
International fee $3,075.00
* All fees are inclusive of NZ GST or any equivalent overseas tax, and do not include any programme level discount or additional course-related expenses.
For further information see Computer Science and Software Engineering .