logo-home
logo

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

Sort by:

GOAT Notes: CSC2001F

  • Package deal

    GOAT Notes: CSC2001F

  • -
    -
    5
    3
    June 2024
  • Are you a second-year Computer Science student looking for a comprehensive study aid to excel in your practicals, tests, and exams? Look no further! Our meticulously crafted digital lecture notes cover every section of your course, from Unix fundamentals to data structures and databases.
  • benfro764
    R125,00 More Info
Data Structures 1 & UNIX terminal use and commands in CSC2001F

  • Summary

    Data Structures 1 & UNIX terminal use and commands in CSC2001F

  • 5.0
    (2)
    5.0
    1
    58
    January 2022
    2021/2022
  • 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...
  • chloewalt
    R185,00 More Info
Data Structures 2: B-trees through to dijkstra and topological sorting in CSC2001F

  • Summary

    Data Structures 2: B-trees through to dijkstra and topological sorting in CSC2001F

  • 5.0
    (1)
    5.0
    1
    24
    January 2022
    2021/2022
  • 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.
  • chloewalt
    R185,00 More Info
CSC2001F SQL databases: commands, ER notation, normal form theory, dependencies, locking, deadlocks and more.

  • Summary

    CSC2001F SQL databases: commands, ER notation, normal form theory, dependencies, locking, deadlocks and more.

  • -
    -
    -
    53
    January 2022
    2021/2022
  • 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.
  • chloewalt
    R185,00 More Info
All essential commands to help you ace the CSC2001F unix test

  • Summary

    All essential commands to help you ace the CSC2001F unix test

  • -
    -
    -
    5
    January 2022
    2021/2022
  • 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.
  • chloewalt
    R150,00 More Info
Extreme summary of all data structures covered in CSC2001F

  • Summary

    Extreme summary of all data structures covered in CSC2001F

  • 5.0
    (1)
    5.0
    -
    1
    January 2022
    2021/2022
  • A table of all data structures and their type, definition, properties, advantages, disadvantages, applications in the world and time complexity.
  • chloewalt
    R120,00 More Info
As you read this, a fellow student has made another R85
How did he do that? By selling his study notes on Stuvia. Try it yourself!
Learn more Get started