|
CS210 - Algorithms and Data Structures I
Department of Computer Science
National University of Ireland, Maynooth
|
This is the CS210 homepage
CS210 course outline 2000-2001
Lecturer: Tom Naughton
Students: 2nd yr BSc, HDipIT, 1st yr MCompSci
Tutors: Stephanie Dunne
Lab sheets and lab exams
Tutorials
Self-help exercises (introductory programming)
View all sample solutions
Student grades (internal access only)
Sample final exam papers
Sample A [.ps] Solutions A [.txt]
Sample B [.ps] Solutions B [.txt]
Lectures
Time: Thursdays 16-18
Location: Arts Block, Theatre 1
Laboratory Sessions
Mondays 16-18 Lab1, Tuesdays 09-11 Lab 2, Tuesdays 11-13 Lab1, Tuesdays 14-16 Lab1
Laboratory demonstrators for the course.
Consultation Hours
Times: Thursdays 11-12 (Office 2.104), Thursdays 18-19 (Theatre 1)
CS210 Course Outline
- Algorithms
Storing, searching, sorting
Analysis of algorithms (complexity analysis)
- Data structures
Logical
Stacks, queues, sets, ordered lists, search trees, heaps, hash tables
Physical
Arrays, tables, linked-lists, trees
Laboratory demonstrators for CS210 2000-2001
Stephanie Dunne (Mon 16-18, Tues 14-16)
Sheila Harris (Mon 16-18, Tues 09-11, Tues 11-13, Tues 14-16)
Peter Mooney (Tues 09-11, Tues 11-13)
Alison Shortt (Tues 09-11, Tues 11-13)
Bold indicates head demonstrator
