Monash University > CSSE > CSE1303 > Part A > Lectures > Lecture A17 notes

CSE1303 Computer Science
Semester 2 2003
Part A
Lecture A17 notes: Revision of CSE1303 Part A

In this lecture

• 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

• Types of questions found on Part A of the CSE1303 exam.

• Resources for how to deal with exams and exam stress.
• Hints for sitting an exam.
• What to revise.

• Revises all topics after lecture A06 (not inclusive)

[ Top | Home ]
Last Updated: Thursday 26 June 2003 11:06:34