Monash University >
CSSE >
CSE1303 >
Part A >
Lectures > Lecture A17 notes
CSE1303 Computer Science
Semester 3 (summer), 2003
Part A
Lecture A17 notes: Revision of CSE1303 Part A
In this lecture
Subject Overview
- What we have covered
- Basic C, strings, pointers
- ADTs (stacks, queues, lists, linked lists, trees, hash tables)
- Algorithms (selection sort, insertion sort, quick sort, merge sort, linear search, binary search)
- Recursion
- Complexity
Exam Overview
- Types of questions found on Part A of the CSE1303 exam.
Exam Hints
- Resources for how to deal with exams and exam stress.
- Hints for sitting an exam.
- What to revise.
Revision
- Revises all topics after lecture A06 (not inclusive)
[ Top |
Home ]
Last Updated: Tuesday 02 December 2003 22:29:28