Introduction (8:33) - PPT

Part 1: Introduction to Computers

1.0. The information age and digital computers - PPT - Word
The information age (14:28) / Digital information (7:39) / Digital Sound (7:03) / Digital Images (7:58) / Digital Text (4:25) / Numerical values (5:40) / Programmable computers (2:11)
1.1. Digital computers: Hardware organization - PPT - Word
Digital computers: The data path (10:52) / Digital computers: the control unit (11.29) / The electronic lock (22:41) / The P counter (5.15) / Memory organisation and central memories (11:05) / Magnetic memories (15:48) / Optical memories (6:33) / Von Neumann computers (5:16)
1.2. Operating Systems - PPT - Word
Elementary systems (9:32) / The Command Interpreter (12:20) / The File Manager (5:28) / Single task operating systems (9:41) / Interrupts and multitasking (10:08) / Multitasking issues (6:13) / Process scheduler (7:32) / Job scheduler (4:33) / Memory management (6:03) / Spooling (2:25)
1.3. Computer Networks - PPT - Word
Centralized data processing (11:01) / Client-server systems (14:26) / Communication technology (7:03) / The Internet (7:43) / Private Internet access (9:56) / Internet applications (14:54)
1.4. Programming languages and programming - PPT - Word
Assembly language programming (8:50) / Low vs.high level languages (8:49) / Compilers and interpreters (10:41) / Applets interpretation (3:05) / Linkers (10:16) / Imperative and non-imperative languages (9:55)
1.5. History of computing devices - PPT - Word
Early devices (12.21) / Alan Turing (11:45) / Atanasoff, Eckert, Mauchly and Von Neumann (18:00) / First and second generation systems (14:27) / Third generation hardware (8:43) / Third generation software (11:16) / Fourth generation systems (9:22)

Part 2: Programming in the small

2.1. Program design - PPT - Word
Program specifications (8:41) / Top down and bottom up design (6:35) / Tire repair design example (5:42) / Object oriented design (7:23) / Decision tables (3:34) / Control-flow charts (11:20) / Structured programming (11:41) / Data flow diagrams (2:18) / State diagrams (6.56) / Universal Modeling Language (6.56)
2.2. Definition of programming languages - PPT - Word
Syntax and semantics (4:06) / Backus Naur Formalism (9:54) / Syntax diagrams (10:00)
2.3. Modula 2, an introduction - PPT - Word
First program, first look and execution. (10:19) / Data declarations: constants (17:14) / Data declarations: variables (4:39) / Actions (6:57)
2.4. Simple types - PPT - Word
Ordinal types, enumerated (6:51) / Ordinal types: boolean (3:03) / Ordinal types: characters (6:02) / Ordinal types: integer numbers (12:42) / Ordinal types: subranges and specific functions (9:42) / Real type (9:23) / Arithmetic expressions (5:58)
2.5. Control statements - PPT - Word
Selection statements (6:39) / WHILE and REPEAT statements (5:20) / LOOP and EXIT statements (7:29) / FOR loop (6:35) / GCD example (12:24)
2.6. Structured types - PPT - Word
Arrays (6:41) / The sieve of Erathostenes (11.07) / Records (9:45) / Variant records (7:12)
2.7. Procedures - PPT - Word
Subroutines and procedures (11:10) / Scope rules (10:16) / GCD with global variables (6:32) / Memory allocation and dynamic links (19:22) / Static links (14:05) / Procedure parameters (9:20) / Passing parameters by value (7:15) / Passing parameters by reference (5:24) / GCD with parameters (7:41) / Open arrays (9:26) / Functions (9:56) / Side effects (4:06) / Recursion (9:55) / Recursive procedure execution (9:26) / Some recursive algorithms (6:10) / Towers of Hanoi (15:51)
2.8. Array searching algorithms - PPT - Word
Array search algorithms (11:54) / Binary array search algorithm (11:37) / Brute force string search (6:42) / KMP string search (16:22)
2.9. Array sorting algorithms - PPT - Word
Key preparation (6:29) / Selection sort (15:50) / Insertion sort (12:11) / Bubble sort (8:04) / Quicksort - principle (8:26) / Quicksort - code (11:42) / Quicksort demo (4.56) / Quicksort optimisation demo (4:26)
2.10. Recursive algorithms - PPT - Word
The risks of recursive calculations (11:40) / When to use recursive algorithms? (5:01) / Recursive backtracking (6:57) / Eight queens (14:24) / Frequency generator (9:00) / Traveling salesman (6:52) / Fractal art (4:18)
2.11. Program validation - PPT - Word
Why, what and how (5:24) / Program errors (8:55) / Validation strategies (6:31) / Static validation techniques (14:17) / Dynamic validation techniques (9:16) / Testing demo (12:19)

Part 3: Programming in the large

3.1. Modules, abstract data types and objects - PPT
Local modules (14:46) / Abstract data types and objects (8:21) / A stack as an abstract data type example (8:11) / Quicksort with explicit stack (8:30) / External modules and libraries (11:11) / A File library (11:30) / The merge-sort algorithm (14:36) / The natural merge-sort algorithm (5:14) / Programming natural merge sort (17:28) / Polyphase sort (9:51)
3.2. Recursive data structures and linear lists - PPT
Pointers and dynamic variables (16:03) / Linear list example (17:23) / Linear list insertion (11:02) / Linear list deletion (4:00) / Linear list search (2:21)
3.3. Binary trees - PPT
Definitions (2.57) / Building ordinary binary trees (12:05) / Deleting nodes from a binary tree (16:30) / Deleting nodes demo (4:54) / Balanced trees (6:00) / AVL trees (11:48) / AVL algorithm: global part (13:50) / AVL algorithm: Rearanging part (8:54) / AVL trees demo (4:45) / Traversing binary trees (7:16) / Expression trees (15:57) / Expression tree example (8:57)
3.4. Storing trees on disk - PPT
Storing binary trees (11:43) / Btrees (14:24)
3.5. Hashing - PPT
Address translation (9:55) / Collision handling (8:37) / Hashing performance (9:17)
3.6. Numerical applications - PPT
The type procedure (11:00) / The Newton algorithm (11:36)