Cos1501 memo Study guides, Class notes & Summaries

STUDY UNIT 1 NUMBER SYSTEMS INTEGERS 1. Z 2. Z = {…, -3, -2, -1, 0, 1, 2, 3, …} 3. See #2 4. No 5. For every integer m there exists an integer n such that m+n=0. eg.1. x+3 = 0, x = -3 eg.2. x2 = 9, x = 3 or x = -3 6. For any integer x, the absolute value of x is defined to be: |x| = x or |x| = -x. Eg.1. |2|<|-5| Eg.2. w 2 = |w| (same with squareroots) 7. A number where the only factors are one and itself 8. n! = n(n-1)(n-2)…(4)(3)(2)(1) Eg. 6! = 720 9. For all integers...

COS1501 Assignment 3 100% With Memo Discussion Looking for answers and explanations for assignment 3 for your COS1501 course? Look no further than this documentation!

Assignment 2 Full Memo Discussion (COS1501)

UNISA Theoretical Computer Science COS1501 May June 2019 Memorandum. Detailed solutions to MCQ exam. The memo has 60 pages because it show why certain alternatives are invalid. You do not have to do this during exam because it is time consuming. You will end up having your own quick methods. This was done so that you may understand the concepts that are used in the module. It clarifies why a given statement satisfies certain properties. Where possible, alternative methods are used to solve the s...

COS1501 2020 ASSIGNMENT 2 SEMESTER 2 FULL MEMO

COS1501 2020 ASSIGNMENT 3 SEMESTER 2 FULL MEMO WITH WORKING OUT

COS1501 2020 ASSIGNMENT 3 SEMESTER 1 FULL MEMO

COS1501 2020 ASSIGNMENT 1 SEMESTER 2 FULL MEMO

In-depth discussion of the answers for Assignment 3 for COS1501. This will assist with exam preparation as notes are comprehensible.