CSC2001F: Computer Science 2001 (CSC2001F)

This is a comprehensive and detailed note on data structures for CSC 2001F. Quality stuff!! U'll need it!!

This is a comprehensive and detailed note on binary trees for Csc 2001F. Quality stuff!! U'll need it!!

This is a comprehensive and detailed summary on HTML tag sheet for CSC 2001F. Quality stuff!! U'll need it!!

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...

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.

Are you a second-year Computer Science student at the University of Cape Town looking for a comprehensive study aid to excel in your practicals, tests, and exams? Look no further! These meticulously crafted digital lecture notes cover data structures.

Are you a second-year Computer Science student at the University of Cape Town looking for a comprehensive study aid to excel in your practicals, tests, and exams? Look no further! These meticulously crafted digital lecture notes cover databases.

Are you a second-year Computer Science student at the University of Cape Town looking for a comprehensive study aid to excel in your practicals, tests, and exams? Look no further! These meticulously crafted digital lecture notes cover Unix fundamentals.