Chloewalt
On this page, you find all documents, package deals, and flashcards offered by seller chloewalt.
- 37
- 0
- 5
Community
- Followers
- Following
6 Reviews received
43 items
Data Structures 2: B-trees through to dijkstra and topological sorting in 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.
- Package deal
- Summary
- • 24 pages •
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.
Extreme summary of all data structures covered in CSC2001F
A table of all data structures and their type, definition, properties, advantages, disadvantages, applications in the world and time complexity.
- Package deal
- Summary
- • 1 pages •
A table of all data structures and their type, definition, properties, advantages, disadvantages, applications in the world and time complexity.
Data Structures 1 & UNIX terminal use and commands in CSC2001F
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...
- Package deal
- Summary
- • 58 pages •
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...
INF3012S Exam & Test Summary Page (double sided page you can take into the exam)
Data Structures 1 & UNIX terminal use and commands in CSC2001F
IEB Grade 11 Physics Notes
Extreme summary of all data structures covered in CSC2001F
Data Structures 1 & UNIX terminal use and commands in CSC2001F