Discrete Structure (CSC165) — Notes, Syllabus & Past Questions

Mathematical foundations for computer science, including sets, graphs, and logic.

Core Course6 Chapters
Chapter 1Past Questions

Basic Discrete Structures

Sets: Sets and Subsets, Power Set, Cartesian Product, Set Operations, Venn Diagram, Inclusion-Exclusion Principle, Computer Representation of Sets, Functions: Basic Concept.

View Questions
Chapter 2Past Questions

Integers and Matrices

Integers: Integers and Division, Primes and Greatest Common Divisor, Extended Euclidean Algorithm, Integers and Algorithms, Applications of Number Theory (Linear Congruencies.

View Questions
Chapter 3Past Questions

Logic and Proof Methods

Logic: Propositional Logic, Propositional Equivalences, Predicates and Quantifiers, Negation of Quantified Statements, Proof of quantified statements, Nested Quantifiers, Rules of Inferences.

View Questions
Chapter 4Past Questions

Induction and Recursion

Induction: mathematical Induction, Strong Induction and Well Ordering, Induction in General, Recursive Definitions and Structural Induction, Recursive Algorithms.

View Questions
Chapter 5Past Questions

Counting and Discrete Probability

Counting: Basics of Counting, Pigeonhole Principle, Permutations and Combinations, Two Element Subsets, Counting Subsets of a Set, Binomial Coefficients, Generalized Permutations and Combinations.

View Questions
Chapter 6Past Questions

Relations and Graphs

Relations: Relations and their Properties, N-ary Relations with Applications, Representing Relations, Closure of Relations, Equivalence Relations, Partial Ordering, Graphs: Graphs Basics, Graph Types.

View Questions

Related Study Resources for Discrete Structure (CSC165)

Subject HubDiscrete Structure (CSC165)Official CurriculumDiscrete Structure SyllabusTU Board PapersDiscrete Structure Past QuestionsSemester Directory2nd Sem Subjects