Need help on Discrete Math for CS question: Creating one-pageage Conceptual hier

Question

Need help on Discrete Math for CS question:

Creating one-pageage Conceptual hierarchy of the topics with key characteristics for each topics, and their implementation.

List all topic on my class.

Ch1: The Crow and you.

Ch2: Algorithms

Ch3: Base and Number Representation

Ch4: Computer Representation and Arithmetic

Ch5: Prepositional Logic

Ch6: Set and Relationships between sets

Ch7: Functions

Ch8: Recursion

Ch9: Aristotle, Boole Thinking and Boolean Algebra, Circuits

Ch10: Combinatorics

Ch11: Graphs

Ch12: Elementary Number Theory

Ch13: Big O and Algorithm Complexity

Ch14: Category Theory

Ch15: Stats

Ch16: Sequences for Computer Science

Explanation / Answer

1.Algorithms (Ch2)
1.1 Big O and Algorithm Complexity(CH13)
1.2 Types of Problems
1.3 Algorithm types
1.4 Implemenataion of algorithm: C++,JAVA

2.Base and Number Representation(CH3)
2.1 Elementary Number Theory (ch12)
2.2 BINARY Representation
2.3 HEXECIMAL Representation
2.4 DECIMAL Representation
2.5 OCTAL Representation
2.6 CONVERSIONS
2.7 Computer Representation and Arithmetic(CH4)

3. Basic Structure
3.1 Set and Relationships between sets(ch6)
3.2 Functions(ch7)
3.2.1 Recursion(ch8)

4.Prepositional Logic(ch5)
4.1 Applications of Propositional Logic
4.2 Propositional Equivalences
4.3 Predicates and Quantifiers
4.4 Nested Quantifiers
4.5 Rules of Inference

5.Graphs(ch11)
5.1 types of graph
5.2 graph reperentation
5.3 euler graph
5.4 Hamilation graph
5.5 planar graph

6.Boolean Algebra(ch9)
6.1 Aristotle
6.2 Boole Thinking and Boolean Algebra
6.3 Circuits
6.4 boolean function

7.Combinatorics(ch10)
7.1 permutations
7.2 combinations

8.Statics
8.1Category Theory(ch14)
8.2Stats(ch15)
8.3Sequences for Computer Science(ch16)

Related Questions

Navigate

• Browse (All)
• Browse N
• Subjects

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.