CSC2001F: Computer Science 2001 (CSC2001F)

University of Cape Town (UCT)

Here are the best resources to pass CSC2001F: Computer Science 2001 (CSC2001F). Find CSC2001F: Computer Science 2001 (CSC2001F) study guides, notes, assignments, and much more.

All 6 results

Sort by

All essential commands to help you ace the CSC2001F unix test
  • All essential commands to help you ace the CSC2001F unix test

  • Summary • 5 pages • 2022
  • Available in package deal
  • There is a compulsory test on UNIX commands in CSC2001F. If you don't get 80% (this was the case in my year), you don't get DP and therefore fail the course. This summary covers all the possible commands you could be asked, and will help you get that DP effortlessly.
    (0)
  • R150,00
  • + learn more
CSC2001F SQL databases: commands, ER notation, normal form theory, dependencies, locking, deadlocks and more.
  • CSC2001F SQL databases: commands, ER notation, normal form theory, dependencies, locking, deadlocks and more.

  • Summary • 53 pages • 2022
  • Available in package deal
  • This summary covers everything you need to know about SQL and its commands. It goes through optimisation and ACID properties, as well as entity relationship notations and schemas. They cover database design, normal form theory, functional dependencies, as well as complex concepts such as locking, serialisability, deadlock handling and JDBC and optimisation. All with explanations, diagrams, examples in a clear and concise manner.
    (0)
  • R185,00
  • + learn more
Data Structures 2: B-trees through to dijkstra and topological sorting in CSC2001F
  • Data Structures 2: B-trees through to dijkstra and topological sorting in CSC2001F

  • Summary • 24 pages • 2022
  • Available in package deal
  • 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.
    (1)
  • R185,00
  • 1x sold
  • + learn more
Extreme summary of all data structures covered in CSC2001F
  • Extreme summary of all data structures covered in CSC2001F

  • Summary • 1 pages • 2022
  • Available in package deal
  • A table of all data structures and their type, definition, properties, advantages, disadvantages, applications in the world and time complexity.
    (1)
  • R120,00
  • + learn more
Data Structures 1 & UNIX terminal use and commands in CSC2001F
  • Data Structures 1 & UNIX terminal use and commands in CSC2001F

  • Summary • 58 pages • 2022
  • Available in package deal
  • 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...
    (2)
  • R185,00
  • 1x sold
  • + learn more