index
| submit
| rank
| book
Computer Science by Example
Volume 1: Programming and Algorithms
- Your first program — hello, cscx
- Basic input and output — repeat1, hi1, age1, swap1
- Basic functions and operators — triple1, inc1, add1, mult1, box1
- Basic conditions — oddeven1, order1, good1, signum1, triangle1
- Basic recursion — factorial1, power1, fibonacci1
- Basic loops — hello2, total, countdown1, seq1
- Chapter remarks
- Exercises
- Data types
- Variables
- Input and output — repeat, hi, age, swap, owes
- Functions
- Operators — triple, inc, add, mult, pi, box
- Conditions — oddeven, order, good, bmi, triangle, calc
- Repetition — factorial, power, fibonacci
- Sequences — index-string, repeat-list, index-ints, replace
- Chapter remarks
- Exercises
5. Mathematical Foundations
- Positional numeral systems — digit-sum, digit-count, digit-reverse, digit-palindrome, bin2dec, dec2bin, hex2dec, dec2hex, base2base
- Logic and boolean algebra — bool-not, bool-and-or, discount, timetable, intersect, bool-calc
- Sets — set-member, set-ui, set-calc, set-size
6. Algorithms
- Euclid’s Algorithm for GCD and LCM — gcd, lcm
- Rounded division of positive integers — roundiv
- Sieve of Erathostenes for finding primes — primes
- Other algorithms — cash, max-subarray, sorting
- (More to be added.)
7. Computer Foundations
- Hardware: computer architecture — file-write, file-read, run-count
- Software: operating systems, programs and applications — hello-cmd, erro, errxit
- Units of measure — bytes2bits, bits2bytes, kilobytes, bconv, file-size, hconv
- File types
8. Advanced Programming
9. Computational Complexity
10. Application Programming
11. History of Computer Science
12. What next?
Volume 2: Sorting, Searching and Data Structures
index
| submit
| rank
| book
Copyright © 2020-2023 Rudy Matela
All rights reserved