Contents 1 Introduction to the course 1.1 What this course is about 1 1.2 Problems....·..·· 6 2 Data representations 7 2.1 Bits,.nibbles,bytes and words·.··.· 7 2.2 4-bit Binary,Hexadecimal and Decimal Digits........ 9 2.3 Binary arithmetic........... 9 2.4 Converting from binary to decimal 10 2.4.1 Whole numbers....... 10 2.4.2 Real numbers.......:·· 11 2.5 Binary integer arithmetic on computers... 11 2.5.1 Two's-complement integer arithmetic ... 12 2.6 32-bit Binary,Hexadecimal,Unsigned and Signed Integers 13 2.7 Problems...·..······· 15 3 Algorithms and Pseudocodes 23 3.1 What is an algorithm?.... 23 3.2 Flowchart representation..... 24 3.3 Pseudocode representation···· 24 3.4 Decisions,conditionals,branch instructions 25 3.5 Looping or jump instructions······· 25Contents 1 Introduction to the course 1 1.1 What this course is about . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1 1.2 Problems . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 6 2 Data representations 7 2.1 Bits, nibbles, bytes and word s . . . . . . . . . . . . . . . . . . . . . . . . . . 7 2.2 4-bit Binary, Hexad ecimal and Decimal Digits . . . . . . . . . . . . . . . . . 9 2.3 Binary arithmetic . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 9 2.4 Converting from binary to d ecimal . . . . . . . . . . . . . . . . . . . . . . . 10 2.4.1 Whole numbers . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 10 2.4.2 Real numbers . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 11 2.5 Binary integer arithmetic on computers . . . . . . . . . . . . . . . . . . . . . 11 2.5.1 Two’s-complement integer arithmetic . . . . . . . . . . . . . . . . . . 12 2.6 32-bit Binary, Hexad ecimal, Unsigned and Signed Integers . . . . . . . . . . 13 2.7 Problems . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 15 3 Algorithms and Pseudocodes 23 3.1 What is an algorithm? . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 23 3.2 Flowchart representation . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 24 3.3 Pseud ocod e representation . . . . . . . . . . . . . . . . . . . . . . . . . . . . 24 3.4 Decisions, cond itionals, branch instructions . . . . . . . . . . . . . . . . . . 25 3.5 Looping or jump instructions . . . . . . . . . . . . . . . . . . . . . . . . . . 25 iii