CSC2001F: Computer Science 2001 (CSC2001F)

These notes cover all the following concepts, with diagrams, explanations and examples: Disk structure and data, indexing, B-trees, B+ trees, priority queues, binary heaps, heapify, graphs: Adjacency matrix, breadth first search, dijkstra, negative weight graphs and directed acyclic graphs, bellman ford, topological sort.

A table of all data structures and their type, definition, properties, advantages, disadvantages, applications in the world and time complexity.

This document comprises of everything you need to know about linux terminal; how to use it, set it up and the commands you need to know to make use of the terminal. There is also an important test on the commands - in our year, if you don't get 80%, you don't get DP. The notes then move onto data structures 1 of 2 in the course, covering what a data structure is, going into analysis of algorithms, time complexities and Big O. This is further divided into binary trees, binary search trees, A...