University home »
Faculty of Science »
Department of Computer Science »
Courses » COMPSCI 105 S2 C » Lectures »
Computer Science
Lectures: COMPSCI 105 Semester 2, City Campus
Lecture Times and Locations
Top
Please check Student Services Online for the latest lecture times and the lecture venue (sometimes this changes!)
Times:
  Mondays 5pm - 6pm,
  Wednesdays 2pm - 3pm,
  Thursdays 4pm - 5pm
Room: Large Chem
Section 2 (second six weeks) - Burkhard
- Lectures 34-35: Hash Tables
- NOTE: We are currently a little bit behind, so I might shorten this part. I will make an announcement regarding this in the last week of lectures.
- Reading: Section 13.2 of the prescibed textbook
- Handouts:
Handout "Hash Tables" (1 slide/page (0.7 MB), 4 slides/page (0.5 MB)) - Demo programs: ExamplesPart2_Lectures15to17.zip
- Exercises (optional): 07Ex.pdf
- Exercises solutions: 07ExAnswer.pdf
- Lectures 31-33: Tables and Priority Queues
- Reading: Chapter 12 of the prescibed textbook
- Handouts:
Handout "Tables and Priority Queues" (1 slide/page (1.8 MB), 4 slides/page (1.0 MB)) - Demo programs: ExamplesPart2_Lectures12to14.zip
- Exercises (optional): 06Ex.pdf
- Exercises solutions: 06ExAnswer.pdf
- Lectures 28-30: Binary Search Trees
- Reading: Section 11.3 of the prescibed textbook
- Handouts:
Handout "Binary Search Trees" (1 slide/page (1.0 MB), 4 slides/page (0.7 MB)) - Demo programs: ExamplesPart2_Lectures9to11.zip
- Exercises (optional): 05Ex.pdf
- Exercises solutions: 05ExAnswer.pdf
- OPTIONAL AND FOR MATHEMATICS FANS ONLY :-) - The original paper introducing splay trees with mathematical proof that splay trees have an amortised cost of O(log n).
- Lectures 26-27: Trees and Binary Trees
- Reading: chapter 11 "Trees" (except of section 11.3) of the prescibed textbook
- Handouts:
Handout "Trees and Binary Trees" (1 slide/page (1.3 MB), 4 slides/page (1.1 MB)) - Demo programs: ExamplesPart2_Lectures7to8.zip
- Exercises (optional): 04Ex.pdf
- Exercises solutions: 04ExAnswer.pdf
- Lectures 24-25: Queues
- Reading: chapter 8 "Queues" of the prescibed textbook
- Handouts: "Queues" (1 slide/page (1.2 MB), 4 slides/page (0.7 MB))
- Demo programs: ExamplesPart2_Lectures5to6.zip
- Exercises (optional): 03Ex.pdf
- Exercises solutions: 03ExAnswer.pdf
- Lectures 22-23: Stacks
- Reading: chapter 7 "Stacks" of the prescibed textbook
- Handouts: "Stacks" (1 slide/page (1.1 MB), 4 slides/page (0.8 MB))
- Demo programs: ExamplesPart2_Lectures3to4.zip
- Exercises (optional): 02Ex.pdf
- Exercises solutions: 02ExAnswer.pdf
- Lectures 20-21: Linked Lists
- Reading: chapter 5 "Linked Lists" of the prescibed textbook
- Handouts: "Linked Lists" (1 slide/page (1.3 MB), 4 slides/page (0.8 MB))
- Demo programs: ExamplesPart2_Lectures1to2.zip
- Exercises (optional): None
- Lectures 19: Introduction Burkhard
- Reading: None
- Handouts: Introduction Burkhard (1 slide/page (29.9 MB), 4 slides/page (6.9 MB)) [Very large files: Save first, then view/print]
- Demo programs: None
- Exercises (optional): None
Section 1 (first six weeks) - Adriana
Top
Week 6
Top
Top
Top
-
Lecture 16 - Introduction to Inheritance
Lecture 17 - Abstract Data Types
Lecture 18 - List ADT, Comparable, Iterator
Week 3
Top
-
Lecture 7 and part of 8 - Files, Readers, Scanner class
Lecture 8 - BufferedWriters, PrintWriters
Lecture 9 - Standard input, Standard output, static methods, Command line arguments
Week 2
Top
-
Lecture 4 - Flow of control, Exceptions, try ... catch(...) statements
Lecture 5 - Exceptions cont., finally clause
Lecture 6 - Exceptions cont., throws, Defining Exception object
Week 1
Top
-
Lecture 1 - Introduction, nested loops
Lecture 2 - 2D arrays
Lecture 3 - 2D arrays continued, ArrayLists
-
Related Programmes




