Introduction to Computer Science

Lectures

Lecture notes

Presentations:

Tutorials

Plan

  1. Boolean algebra (definitions, basic rules, theorems and proofs, Boolean formulas simplification)
  2. Boolean algebra (cont.)
  3. Numeral systems - conversions
  4. Arithmetical operation in different numeral systems. Signed numbers
  5. Test I
  6. Floating and fixed point numbers
  7. Flowcharts. Instruction if
  8. Loop: for, while i do-while
  9. Loop - cont.
  10. Loop - summary; nested loop
  11. Recursion, iteration
  12. Basic digital circuit - hotdog machine
  13. Karnaugh's maps
  14. Test II
  15. Sorting, searching

Additional materials