Lectures on discrete mathematics for computer science /
Khoussainov, Bakhadyr
Lectures on discrete mathematics for computer science / Bakhadyr Khoussainov and Nodira Khoussainova - Singapore : World Scientific Pub., 2012 - xvi, 346 p. : ill. ; 24 cm. - Algebra and discrete mathematics, v. 3 1793-5873 ; . - Algebra and discrete mathematics ; v. 3 .
1. Definitions, theorems, and proofs -- 2. Proof methods -- 3. Integers and divisibility -- 4. Euclidean algorithm and congruence relations -- 5. Secret message passing -- 6. Basics of directed graphs -- 7. The path problem and undirected graphs -- 8. Circuit problems in graphs -- 9. Rooted trees -- 10. Sets and operations on sets -- 11. Relations on sets -- 12. Equivalence relations and partial orders -- 13. Databases and relational structures -- 14. Relational calculus -- 15. Program correctness through loop invariants -- 16. Induction and recursion -- 17. Spanning trees -- 18. Shortest paths in directed weighted graphs -- 19. Games played on finite graphs -- 20. Functions -- 21. Types of functions -- 22. Syntax of propositional logic -- 23. Semantics of propositional logic -- 24. Normal forms and the SAT problem -- 25. Deterministic finite automata -- 26. Designing finite automata -- 27. Nondeterministic finite automata -- 28. The subset construction -- 29. Regular expressions and finite automata -- 30. Algorithms for finite automata -- 31. Counting principles -- 32. Permutations and combinations -- 33. Basics of probability
9789814340502
Computer science--Mathematics--Textbooks
Lectures on discrete mathematics for computer science / Bakhadyr Khoussainov and Nodira Khoussainova - Singapore : World Scientific Pub., 2012 - xvi, 346 p. : ill. ; 24 cm. - Algebra and discrete mathematics, v. 3 1793-5873 ; . - Algebra and discrete mathematics ; v. 3 .
1. Definitions, theorems, and proofs -- 2. Proof methods -- 3. Integers and divisibility -- 4. Euclidean algorithm and congruence relations -- 5. Secret message passing -- 6. Basics of directed graphs -- 7. The path problem and undirected graphs -- 8. Circuit problems in graphs -- 9. Rooted trees -- 10. Sets and operations on sets -- 11. Relations on sets -- 12. Equivalence relations and partial orders -- 13. Databases and relational structures -- 14. Relational calculus -- 15. Program correctness through loop invariants -- 16. Induction and recursion -- 17. Spanning trees -- 18. Shortest paths in directed weighted graphs -- 19. Games played on finite graphs -- 20. Functions -- 21. Types of functions -- 22. Syntax of propositional logic -- 23. Semantics of propositional logic -- 24. Normal forms and the SAT problem -- 25. Deterministic finite automata -- 26. Designing finite automata -- 27. Nondeterministic finite automata -- 28. The subset construction -- 29. Regular expressions and finite automata -- 30. Algorithms for finite automata -- 31. Counting principles -- 32. Permutations and combinations -- 33. Basics of probability
9789814340502
Computer science--Mathematics--Textbooks