Lectures on discrete mathematics for computer science / Bakhadyr Khoussainov, Nodira Khoussainova.
By: Khoussainov, Bakhadyr.
Contributor(s): Khoussainova, Nodira.
Series: Algebra and discrete mathematics, v. 3.New Jersey : World Scientific, c2012Description: xvi, 346 p. : ill. ; 24 cm.ISBN: 9789814340502.Subject(s): Computer science -- Mathematics -- TextbooksGenre/Form: Print books.| Current location | Call number | Status | Date due | Barcode | Item holds |
|---|---|---|---|---|---|
| On Shelf | QA76.9.M35 K46 2012 (Browse shelf) | Available | AU0000000006354 |
Browsing Alfaisal University Shelves , Shelving location: On Shelf Close shelf browser
|
|
|
|
|
|
|
||
| QA76.9.L63 H88 2004 Logic in computer science modelling and reasoning about systems / | QA76.9.L63 M34 2019 How to speak machine : laws of design for a digital age / | QA76.9.M35 H867 2012 Essentials of discrete mathematics / | QA76.9.M35 K46 2012 Lectures on discrete mathematics for computer science / | QA76.9.M35 L485 2019 Essential discrete mathematics for computer science / | QA76.9 .M45 K65 2018 Pro .net memory management / | QA76.9 .N38 2024 Quick start guide to large language models : strategies and best practices for using ChatGPT and other LLMs / |
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.