[이산수학] 목차 훑어보기

* 학습에 사용된 교재는 "Discrete mathematics and its applications 7th edition(Kenneth Rosen)" 입니다.

구글에 검색하시면 충분히 교재와 솔루션을 찾을 수 있습니다

하지만 꿀팁으로 제가 찾은 링크 공유해드릴게요😃

 

교재: https://faculty.ksu.edu.sa/sites/default/files/rosen_discrete_mathematics_and_its_applications_7th_edition.pdf

 

솔루션 // 솔루션을 공유해주신 분들께 감사의 말씀 드립니다..

- (Odd) : 

https://usermanual.wiki/Document/Solutions20Manual20odd20for20Discrete20Mathematics20and20Its20Applications207th20Edition.2110235314/view

Solutions Manual (odd) For Discrete Mathematics And Its Applications (7th Edition)

- (Even) : https://usermanual.wiki/Document/Solutions20Manual20even20for20Discrete20Mathematics20and20Its20Applications207th20Edition.1581525595/view

Solutions Manual (even) For Discrete Mathematics And Its Applications (7th Edition)

 

또, student site입니다. extra exercise와 self assessment가 가능하니 참고하면 좋을 것 같습니다

https://highered.mheducation.com/sites/0073383090/sitemap.html

https://highered.mheducation.com/sites/0073383090/sitemap.html

 

 

우선 목차를 알아보겠습니다.

 

1. The Foundations: Logic and Proofs
   1. Propositional Logic(1.1-1.2)
   2. Propositional Equivalances(1.3)
   3. Predicates and Quantifiers(1.4)
   4. Nested Quantifiers(1.5)
   5. Rules of Inference(1.6)
   6. Prooofs(1.7-1.8) 
2. Basic Structures: Sets, Functions, Sequences, Sums, and Matrices
   1. Sets and operations (.1-.2)
   2. Functions(.3)
   3. Sequences(.4)
   4. Cardinality of sets(.5)
   5. Matrices(.6)
3. Algorithms
   1. Algorithms: Searching and Sorting 
   2. The Growth of Functions 
   3. Complexity of Sets
4. Number Theory and Cryptography
   1. Divisibility and Modular Arithmetic
   2. Integer Representations and Algorithms
   3. Primes and Greatest Common Divisors
   4. Solving Congruences
   5. Applications of Congruences
   6. Cryptography
5. Induction and Recursion
   1. Mathematical induction
   2. Strong Induction and well-ordering
   3. Recursive definitions ans structural induction
   4. Recursive algorithms (.4)
6. Counting
7. Discrete Probability
8. Advanced Counting Techniques
9. Relations
10. Graphs
11. Trees
12. Boolean Algebra
13. Modeling Computation