Discrete

Syllabus

  • Text Book: Discrete Mathematical Structures, Kolman, Busby and Ross, 4th edition.

  • Course Content:

1.1 Sets and Subsets , Suggestion Exercises : 1-32

1.2 Operations on sets, Suggestion Exercises : 1-38

1.3 Sequences, Suggestion Exercises : 1-20

1.4 Division in the integers, Suggestion Exercises : 1-30

1.6 Mathematical structures, Suggestion Exercises : 1-9

2.1 Propositions and logical operations, Suggestion Exercises : 1-29

2.2 Conditional statements, Suggestion Exercises : 1-28

2.3 Methods of proof, Suggestion Exercises : 1-23

2.4 Mathematical induction, Suggestion Exercises : 1-20

3.1 Permutations, Suggestion Exercises : 1-18

3.2 Combinations, Suggestion Exercises : 1-20

3.5 Recurrence relations, Suggestion Exercises : 1-22

4.1 Product sets and partitions, Suggestion Exercises : 1-30

4.2 Relations and digraphs, Suggestion Exercises : 1-32

4.3 Paths in relations and digraphs, Suggestion Exercises : 1-13

4.4 Properties of relations, Suggestion Exercises : 1-25

4.5 Equivalence relations, Suggestion Exercises: 1-20

4.6 Computer representation of relations, Suggestion Exercises : 1-5

4.7 Operations on relations, Suggestion Exercises : 1-20

4.8 Transitive closure and Warshall’s algorithm, Suggestion Exercises : 1-10

5.1 Functions, Suggestion Exercises : 1-30

5.2 Functions for computer science, Suggestion Exercises : 1-15

5.3 Growth of functions, Suggestion : Exercises 1-14

5.4 Permutation functions, Suggestion Exercises : 1-10

8.1 Graphs, Suggestion Exercises : 1-22

8.2 Euler paths and circuits, Suggestion Exercises : 1-15

8.3 Hamiltonian paths and circuits, Suggestion Exercises : 1-20

8.4 Transport networks, Suggestion Exercises : 1-10

10.1 Languages, Suggestion Exercises : 1-15

10.2 Representations of special grammars and languages, Suggestion Exercises : 1-10

10.3 Finite-state machines, Suggestion Exercises : 1-15

Past Exams