University home »
Faculty of Science »
Department of Computer Science »
Courses » COMPSCI 107 » Lectures »
Computer Science
Lectures
Lectures notes and other handouts.
Note: Lecture recordings are only available through Cecil. Navigate to the COMPSCI 107 course in Cecil and look in the knowledge map area to find the lecture recordings.
Lecture 23 -- Sorting 2: Shell sort, merge sort
Lecture 22 -- Sorting 1: bubble, selection and insertion sorts
Lecture 21 -- The Map ADT, an implementation using two parallel Python lists
Lecture 20 -- Hash tables, hash functions, collision resolution techniques
Lecture 19 -- Some recursive applications, searching sequentially, binary search
Lecture 18 -- Using the Python turtle to draw fractals, solving the maze
Lecture 17 -- Thinking recursively
Lecture 16 -- The OrderedList ADT
Lecture 15 -- The UnorderedList ADT
Lecture 14 -- JSON, consolidation
Using JSON to store data structures, deques, stack algorithms, order analysis
Lecture 13 -- ADTs and Queues
The Queue ADT, circular queues, deques and algorithms that use queues
Lecture 12 -- ADTs and Stacks
Abstract Data Types, modularity, stacks and algorithms that use stacks
Lecture 10 & Lecture 11 -- Algorithm Analysis
Lecture 09 -- Classes
Lecture 08 -- Program testing, documenting and debugging
docstring, doctest
Lecture 07 -- Exceptions
Lecture 06 -- Reading and writing text files
Lecture 05 -- Dictionaries and Tuples
the dict and tuple data types
Lecture 04 -- Memory models
storing complex data structures in memory, references, mutable and immutable types
Lecture 03 -- Sequences
functions, modules, sequences
Lecture 02 -- Basic Python Language Elements
Variables, types, expressions, selection, iteration, functions, modules
Lecture 01 -- Introduction
- Lecture 30 -- More Regular Expressions
- Lecture 29 -- Regular Expressions
- Lecture 28 -- Binary Search Trees and Regular Expressions
- Lecture 27 -- Binary Search Trees
- Lecture 26 -- Applications of Binary Trees
- Lecture 25 -- Priority Queues and Binary Heaps
- Lecture 24 -- Trees
An introduction to Trees - Overheads (pdf)
- Overheads (pptx)
- Binary Tree Reference implementation
- Binary Tree Lists implementation
- Binary Tree Lists implementation
Using JSON to store data structures, deques, stack algorithms, order analysis
The Queue ADT, circular queues, deques and algorithms that use queues
Abstract Data Types, modularity, stacks and algorithms that use stacks
docstring, doctest
the dict and tuple data types
storing complex data structures in memory, references, mutable and immutable types
functions, modules, sequences
Variables, types, expressions, selection, iteration, functions, modules
-
Related Programmes
