Theoretical Computer Science I (COS1501)
University of South Africa (Unisa)
Here are the best resources to pass Theoretical Computer Science I (COS1501). Find Theoretical Computer Science I (COS1501) study guides, notes, assignments, and much more.
All 19 results
Sort by:
-
Exam (elaborations)
COS1501 EXAM PACK 2025/2026 – QUESTION & ANSWERS
-
---86November 20252025/2026A+
- COS1501 EXAM PACK 2025/2026 – QUESTION & ANSWERS 
QUESTIONS WITH ANSWERS, COMPILED FROM RECENT PAST EXAM PAPERS. PERFECT FOR EXAM PREPARATION.
-
R50,00 More Info
ZaProff
-
Class notes
Theoretical Computer Science I (COS1501) - Study Notes
-
---9April 20252024/2025
- Theoretical computer science is a branch of computer science that focuses on abstract and mathematical aspects of computation rather than practical implementations. It lays the groundwork for understanding the limitations and possibilities of computation. By studying theoretical computer science, we gain insights into how algorithms work, how languages are structured, and the underlying mechanics of machines that execute computations.
-
R203,33 More Info
emmanuelmashala
-
Exam (elaborations)
COS1501 Assignment 3 (DETAILED ANSWERS) 2024 - DISTINCTION GUARANTEED
-
4.0(1)4.0834July 20242023/2024A+
- COS1501 Assignment 3 (DETAILED ANSWERS) 2024 - DISTINCTION GUARANTEED - DISTINCTION GUARANTEED - DISTINCTION GUARANTEED Answers, guidelines, workings and references .... Question 
1 
Complete 
Marked out of 2.00 
Question 
2 
Complete 
Marked out of 2.00 
QUIZ 
Suppose U = {1, 2, 3, 4, 5, a, b, c} is a universal set with the subset A = {a, b, c, 1, 2, 3, 4}. 
Which one of the following relations on A is NOT functional? 
a. 
{(1, 3), (b, 3), (1, 4), (b, 2), (c, 2)} 
b. 
{(a, c), (b, c), (c, b), ...
-
R50,00 More Info
VarsityC