CSC2001F: Computer Science 2001

University of Cape Town (UCT)

Hier vind je de beste samenvattingen om te slagen voor CSC2001F: Computer Science 2001. Er zijn o.a. samenvattingen, aantekeningen en oefenvragen beschikbaar.

Alle 7 resultaten

Sorteer op:

Voordeelbundel

GOAT Notes: CSC2001F
-

-

5

3

juni 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
$7.93 Meer Info

All essential commands to help you ace the CSC2001F unix test

Samenvatting

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

-

-

5

januari 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
$9.51 Meer Info

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

Samenvatting

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

-

-

53

januari 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
$11.73 Meer Info

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

Samenvatting

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

(1)

5.0

1

24

januari 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
$11.73 Meer Info

Extreme summary of all data structures covered in CSC2001F

Samenvatting

Extreme summary of all data structures covered in CSC2001F
5.0

(1)

5.0

-

1

januari 2022

2021/2022
A table of all data structures and their type, definition, properties, advantages, disadvantages, applications in the world and time complexity.
chloewalt
$7.61 Meer Info

Data Structures 1 & UNIX terminal use and commands in CSC2001F

Samenvatting

Data Structures 1 & UNIX terminal use and commands in CSC2001F
5.0

(2)

5.0

1

58

januari 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
$11.73 Meer Info

CSC2001F: Computer Science 2001

University of Cape Town (UCT)

GOAT Notes: CSC2001F

All essential commands to help you ace the CSC2001F unix test

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

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

Extreme summary of all data structures covered in CSC2001F

Data Structures 1 & UNIX terminal use and commands in CSC2001F