- ES Español (Latinoamérica)

- EN English

7.19. Discrete Structures II (Mandatory)
- Semester: 4th Sem. Credits: 3
- Hour of this course: Theory: 2 hours; Laboratory: 2 hours;
- Syllabus:
- htmlonly

Español (Latinoamérica)

English - Prerrequisites:
- CS1D1 Discrete Structures I (3rd Sem)
7.19.1. Justification ↑ Back to top
Continuing from Discrete Structures I, this course explores more complex mathematical structures such as sets, relations, and functions, which are the basis for data modeling in databases and programming languages. Additionally, students will study counting techniques and recurrence relations, providing the analytical tools required to estimate the computational complexity of algorithms.
7.19.2. Generales Goals ↑ Back to top
- Perform complex operations on sets, functions, and relations.
- Model database relations and function properties formally.
- Apply counting techniques to analyze search spaces and probability.
- Solve recurrence relations to analyze the efficiency of recursive algorithms.
7.19.3. Contribution to Outcomes ↑ Back to top
- ABET-1) An ability to identify, formulate, and solve broadly defined technical or scientific problems by applying knowledge of mathematics and science and/or technical topics to areas relevant to the discipline. (Usage)
- ABET-2) An ability to formulate or design a system, process, procedure, or program for the intended purpose. (Familiarity)
7.19.4. Content ↑ Back to top
7.19.4.1. Discrete Mathematics (24 hours) [Skills ABET-1,ABET-2] ↑ Back to top
Bibliography: (Rosen, 2019; Scheinerman, 2012)
Topics
- Sets: operations, cardinality, power sets, Cartesian products
- Relations: properties, equivalence relations, partial orders
- Functions: injective, surjective, bijective, composition, inverse
Learning Outcomes
- Define basic set operations and relations [Assessment]
- Apply set operations to solve problems [Usage]
- Define properties of relations [Assessment]
- Determine if a relation is an equivalence relation [Usage]
- Define types of functions [Assessment]
- Compose functions and find inverses [Usage]
7.19.4.2. Discrete Mathematics (24 hours) [Skills ABET-1,ABET-2] ↑ Back to top
Bibliography: (Rosen, 2019; Grimaldi, 2003)
Topics
- Counting: permutations, combinations, binomial theorem
- Advanced counting: generating functions, inclusion-exclusion
- Recurrence relations: solving simple recurrences
- Advanced recurrence: generating functions, asymptotic behavior
Learning Outcomes
- Explain permutations and combinations [Assessment]
- Apply counting techniques to solve problems [Usage]
- Define recurrence relations [Assessment]
- Solve simple recurrence relations [Usage]
- Develop generating functions for counting problems [Usage]
- Apply generating functions to solve complex recurrence relations [Assessment]
7.19.5. Bibliography ↑ Back to top
Rosen, K. H. (2019). Discrete Mathematics and Its Applications. McGraw-Hill Education, 8th edition.
Scheinerman, E. R. (2012). Mathematics: A Discrete Introduction. Cengage Learning, 3rd edition.
Grimaldi, R. P. (2003). Discrete and Combinatorial Mathematics: An Applied Introduction. Pearson, 5th edition.