Benawa Institute of Higher Education
Faculty of Computer Science
COURSE POLICY
DISCRETE MATHEMATICS
Third Semester
COURSE CODE: CS.CS.0312
AUGUST 13, 2024
هـ ش۱۴۰۳/ ۴ /۲۳
Items Description
Subject Title: Discrete Mathematics رﯾﺎﴈ ﻣﺠﺰا
Total Theoretical Practical
Credits and no. of hours
د کرېدتونو او درﳼ سﺎعتونو شم 4 4 0
Offering year and semester Semester Fall/Spring Year سمﺴ ر ﭘﴪﻟﯽ/ﻣﻨﯽ کﺎل
د تدرﻳﺲ کﺎل او سمﺴﱰ 3rd Fall 2024 درﯾﻢ ﻣﻨﯽ ۱۴۰۳
( ﺗﺤﻠیﻞrelations) او د اړﯾﮑﻮ، ﻮﻟ ﻮ، د ﺳی ﻧﻈﺮﯾﯥ:( او د اړﯾﮑو ﻣﻄﺎﻟﻌﻪSet Theory) د سی نﻈرﯾﯥ
.او اﺳتع ل زده ﮐﻮل
. او ﻣﻮﺛﺮﯾﺖ ﭘﻪ اړ ﻩ زده ﮐ ﻩ، ﺗﺤﻠیﻞ، د اﻟ ﻮرﯾتﻤﻮﻧﻮ ډﯾﺰاﯾﻦ:د اﻟ ورﯾتمونو ډﯾﺰاﯾﻦ او تﺤﻠیﻞ
او ﭘﻪ ﺷﺒﮑﻮ او ﻣعﻠﻮﻣﺎﺗﻮ، د ﺮاﻓﻮﻧﻮ ﻣﺨتﻠﻒ ډوﻟﻮﻧﻪ، د ﺮاﻓﻮﻧﻮ ﻧﻈﺮﯾﻪ:د راﻓونو نﻈرﯾﻪ او استﻌﺎﻣﻞ
.ﺗﺤﻠیﻞ ﮐﯥ د ﻫﻐﻮ ی اﺳتع ل زده ﮐﻮل
ﭼﯥ ﭘﻪ، د ﺮاﻓﻮﻧﻮ او ﺷﺒﮑﻮ د ﺟﻮړ وﻟﻮ او ﺗﺤﻠیﻞ اﺻﻮل زده ﮐﻮل:(Graph Theory) د راف نﻈرﯾﯥ ﭘوهﻪ
. ﻣعﻠﻮﻣﺎﺗﯽ ﮑﻨﺎﻟﻮژۍ او د ﻣعﻠﻮﻣﺎﺗﻮ ﺗﺤﻠیﻞ ﮐﯥ ﮐﺎرول ﮐی ي،ﺷﺒﮑﯥ ﺟﻮړ وﻟﻮ
Goals:
، د ﻋﺪدوﻧﻮ ﺗیﻮري او د ﻫﻐﯥ اﺻﻮﻟﻮ ﭘﻪ اړ ه ﭘﻮﻫﻪ ﺗﺮاﻟﺴﻪ ﮐﻮل:(Number Theory) ﱪ تیوري ﻣﻄﺎﻟﻌﻪ د
Security ) اﻣﻨیﺖ او د ﻣعﻠﻮﻣﺎ،(Cryptography) ﮐﺮﭘ ﻮ ﺮاﰲ،(Coding) ﭼﯥ ﭘﻪ ﮐﻮډ ﮐﻮﻟﻮ
.( ﭘﻪ ﺑﺮﺧﻮ ﮐﯥ ﮐﺎرول ﮐی يInformation
د زده ﮐﻮوﻧﮑﻮ ﴎه ﻣﺮﺳتﻪ ﮐﻮل ﭼﯥ د ﺗﺮﮐیﺒﻲ:(Analysis Combinatorial) د ترکیﺒﻲ تﺤﻠیﻞ اﺻول
. ﭼﯥ ﭘﻪ اﻟ ﻮر ﯾتﻤﻮﻧﻮ او ډﯾ ﺎﺑیﺴﻮﻧﻮ ﮐﯥ ﻣﻬﻢ دي،ﺗﺤﻠیﻞ او ﺷ ر اﺻﻮﻟﻮ ﭘﻮﻫﻪ ﺗﺮاﻟﺴﻪ ﮐ ي
د ﺮاﻓﻮﻧﻮ او وﻧﻮ ﭘﻪ ﺟﻮړوﻟﻮ او ﺗﺤﻠیﻞ ﮐﯥ ﻣﻬﺎرت:(Trees and Graphs) د راﻓونو او ونو ﻣﻄﺎﻟﻌﻪ
. ﭼﯥ ﭘﻪ ﮐﻤﭙیﻮ ﺮ ﺳﺎﯾﻨﺲ او ﺷﺒﮑﻮ ﮐﯥ ﻣﻬﻢ رول ﻟﺮي،ﺗﺮﻻﺳﻪ ﮐﻮل
Introduction to Discrete Mathematics: Overview and importance in computer science and
mathematics, Basic mathematical concepts: definitions, proofs, sets.
Propositional Logic: Logical statements and connectives, Truth tables, logical equivalences,
and implications, Tautologies, contradictions, and logical arguments.
Predicate Logic: Predicates and quantifiers, Logical equivalences involving quantifiers, Nested
quantifiers and formal reasoning.
Set Theory: Basic set operations and Venn diagrams, Power sets, Cartesian products, Set identities
and proofs involving sets.
Relations: Definitions and properties of relations, Equivalence relations and partitions, Partial
orders.
Topics: Functions: Types of functions: injective, surjective, bijective, Composition of functions and inverse
ﻣﻔردات functions, Pigeonhole principle and its applications.
Algorithms and Algorithm Analysis: Introduction to algorithms and pseudocode, Big-O notation
and complexity analysis, Recursive algorithms and their analysis.
Counting Principles: Basic counting rules: sum and product rules, Permutations and combinations,
Binomial theorem and Pascal’s triangle.
Recurrence Relations: Introduction to recurrence relations, Solving linear recurrence relations,
Applications of recurrence relations,
Graph Theory: Definitions and types of graphs: directed, undirected, weighted, Graph properties:
connectivity, planarity, graph isomorphisms, Graph traversal algorithms: BFS and DFS, Special
types of graphs: trees, bipartite graphs, Eulerian and Hamiltonian paths, Applications of graph
theory in computer science, such as network design and optimization.
1|Page
Demonstrate a clear understanding of discrete mathematical concepts such as logic, set
theory, and functions.
Apply definitions, proofs, and problem-solving techniques in discrete mathematics.
Perform operations on sets, including union, intersection, and difference.
Evaluate and characterize various types of relations (e.g., equivalence, partial orders).
Analyze and apply functions, including injective, surjective, and bijective functions, and
their compositions.
Develop and analyze algorithms using pseudocode.
Apply Big-O notation to evaluate the efficiency of algorithms and solve recursive
problems.
Key Learning Outcomes Utilize counting principles, including permutations, combinations, and the binomial
نتﺎﻳﺞ theorem.
Formulate and solve linear recurrence relations.
Apply recurrence relations to model and solve real-world problems.
Apply graph traversal algorithms (e.g., BFS, DFS) and understand graph properties such
as connectivity and planarity.
Explore special graphs (e.g., trees, bipartite graphs) and their applications.
Understand and apply concepts from automata theory, including finite automata,
context-free grammars, and pushdown automata.
Integrate and apply discrete mathematics concepts to solve complex problems in
computer science and related fields.
Academic Staff Responsible
Raza Ahmad
د تدرﻳﺲ ﻣﺴﺌول استﺎد
WEEKLY PLAN اونﻴﺰه ﭘﻼن
سﺎعتونو شم
ﭘﻪ اون کﯽ
عمﻠﯽ
نﻈری
ﻣﺤتوا هﻔتﻪ
0 4 4 Introduction to Discrete Mathematics: Overview and importance in
computer science and mathematics, Basic mathematical concepts:
ﻟوﻣ ی اون
definitions, sets
4 4 Propositional Logic: Logical statements and connectives, Truth
0
tables, logical equivalences, and implications, Tautologies, دوهمﻪ اون
contradictions, and logical arguments
0 4 4 Predicate Logic: Predicates and quantifiers, Logical equivalences
درﯾمﻪ اون
involving quantifiers, Nested quantifiers and formal reasoning
0 4 4 Set Theory: Basic set operations and Venn diagrams, Power sets,
ﻠورﻣﻪ اون
Cartesian products, Set identities and proofs involving sets
4 4 Relations: Definitions and properties of relations, Equivalence
0 ﭘﻨ مﻪ اون
relations and partitions, Partial orders and Hasse diagrams
2|Page
4 4 Functions: Types of functions: injective, surjective, bijective,
0
Composition of functions and inverse functions, Pigeonhole شپ ﻣﻪ اون
principle and its applications
4 4 Algorithms and Algorithm Analysis: Introduction to algorithms and
0
pseudocode, Big-O notation and complexity analysis, Recursive اووﻣﻪ اون
algorithms and their analysis
0 4 4 Counting Principles: Basic counting rules: sum and product rules,
ا ﻪ اون
Permutations and combinations
4 4 Counting Principles (Advance): - Binomial theorem and Pascal’s
0
triangle, Inclusion-exclusion principle, Applications of counting in نهمﻪ اون
probability and combinatory
4 4 Graph Theory: Definitions and types of graphs: directed,
0
undirected, weighted, Graph properties: connectivity, planarity, ﻟﺴمﻪ اون
graph isomorphism
4 4 Graph Theory (Advanced): Graph traversal algorithms: BFS and DFS,
0
Special types of graphs: trees, bipartite graphs, Eulerian and
ﯾووﻟﺴمﻪ اون
Hamiltonian paths, Applications of graph theory in computer
science
4 4 Modeling Computation: Introduction to automata theory: finite
0 دووﻟﺴمﻪ
automata and regular language, Context-free grammars, pushdown
automata, and parsing اون
4 4 Modeling Computation (Advanced): Turing machines: definition,
0
operation, and the concept of computation, Undecidability and the
دﯾﺎرﻟﺴمﻪ اون
limits of computational models, Applications in compiler design,
formal verification, and complexity theory
0 4 4 Recurrence Relations: Introduction to recurrence relations, Solving وارﻟﺴمﻪ
linear recurrence relations, Applications of recurrence relations اون
0 4 4 Review and Presentations: Review of key topics covered in the
ﭘﻨ ﻠﺴمﻪ اون
course
0 4 4 Course Conclusion and Reflection: Final reflections and course شپﺎړسمﻪ
wrap-up, Feedback and future directions اون
Pre-requisite Courses
نﻪ ﻟری
ﻣﺨﮑیﻨﻲ اړﯾﻦ ﻣﻀﺎﻣیﻦ
ﭘﻪ ﻮﻟ ﻲ ﮐﯥ ﻣفصﻞ ﻟیﮑچﺮوﻧﻪ ورﮐﻮي ﭼﯥ ﻧﻈﺮي ﭘﻮﻫﻪ، اﺳتﺎدان د ﻣﻮضﻮﻋﺎﺗﻮ ﭘﺮ ﺑﻨﺴ:Lectures
Teaching and د ﻣﺨﺎﻣﺦ ﺗﺪرﯾﺲ ﭘﻪ وﺳیﻠﻪ ﻣﺤصﻠﻴﻨﻮ ﺗﻪ د ددی ﻣﻀﻤﻮن اﺳﺎﺳﺎت او ﻣفﺎﻫیﻢ.او ﻣفﺎﻫیﻢ ﺗﻮضیﺢ ﮐﻮي
Learning methods
.وړاﻧﺪې ﮐی ي
د تدرﻳﺲ ﻣﻴتود
(Group Work):ﺮوﭘﻲ ﮐﺎر
3|Page
.ﺮﮐﺰ ﮐﻮي د زده ﮐ ې ﭘﺮ ﻣﻬﺎل د ﻣﺤصﻠﻴﻨﻮ ﭘﺎﯾﻠﻮ ﺑﺎﻧﺪې: (Outcome-Based Education):اوﺑﯽ ای
.ﻫﺪف د ﻣﺤصﻠﻴﻨﻮ د ﻣﺸﺨصﻮ ﻣﻬﺎرﺗﻮﻧﻮ او ﭘﻮﻫﯥ ﻻﺳتﻪ راوړل دي
Computer Knowledge Computer knowledge is not much important and internet is most vital means and source for better
د کمپﻴوتر زده ک ې تﻪ اړتﻴﺎ understanding and searching.
1. Rosen, K. H. (2012. Discrete Mathematics and Its Applications.
McGrawHill.
2. Billy, S. (Year of Publication. Discrete Mathematical Modeling. Epp, اﺻﻠﯽ ﻣﻨﺎﺑﻊ
Course Materials and S. S. (Year of Publication. Discrete Mathematics with Applications.
1. Harju, T. (2011. Lecture Notes on Graph Theory. Department of
References Mathematics, University of Turku, Finland.
د ﻣﻀمون درﳼ ﻣواد او 2. Hegde, S. M. (2012. Labeled Graphs and Digraphs: Theory and
Application. Department of Mathematical and Computational کوﻣﮑﯽ
اخ ﻠﻴﮑونﻪ Sciences, National Institute of Technology Karnataka, Surathkal, ﻣﻨﺎﺑﻊ
Srinivasnagar, India.
3. Koltun, V. (2008. Discrete Structures Lecture Notes. Computer
Science Department, Stanford University, USA.
ﻓیﺼدي د ﻓﻌﺎﻟیﺖ ډول ش ره
5% ﭘﲇ ﮐﻮل د ﮐﺮﯾ ﯾ د ﻻيﺤﯽ ﭘﺮ اﺳﺎس ﭘﻪ ﻮﻟ ﻲ ﮐﯥ د حﺎﴐي ﭘﺎﻟیﺴ 1
Evaluation Method(s) 10% ﺮوﭘﯽ ﮐﺎروﻧﻪ او ﻋﻤﻠﯽ ﮐﺎروﻧﻪ, د زده ﮐﻮﻧﮑﻮ د ﮐﻮرﻧﯽ دﻧﺪی 2
د ارزونﯥ ﻣﻴتود 5% د ﻣﺤصﻠﻴﻨﻮ اوﻧﻴﺰه ارزوﻧﻪ او ﺻﻨفﯽ ﻓعﺎﻟﻴتﻮﻧﻪ 3
20% ازﻣﻮﯾﻨﻪ د ﺳﻤﺴﱰ ﻣﻨ ﻨ 4
60% ازﻣﻮﯾﻨﻪ وروﺳت 5
Time Policy:
The classes start from 6:00 – 9:00 Am, and for evening shift 04:00 -
07:00 Pm.
They should try to come to the class within 10 minutes of starting
time otherwise will be counted absent.
Other:
Course Policies: Teacher and students should attend lecture classes without
distractions.
Remember: Phone should be silent and it is not allowed during
entire session in the class, in case it is very important the student can
take permission to attend the call outside the class.
4|Page
Student should do at least one assignment in one week or depending on
the lecture or the topics, and they must hand over the assignments within
Assignments & the given time to class representative, late assignments are not accepted.
The assignments and class/Lab activity have 10% marks.
Class-work Policy: Project’s Presentation: At the end of semester, students are encouraged to
come up and present their projects.
The pattern of the test and strength of the questions will be made looking to
the exam so in general the exam will have four types of questions such as:
o Multiple choices questions
Exam Pattern:
o Short Questions or Differentiations
o Long explanatory questions
ﻪ ( ) د ﺷﻮرا ﭘﻪ ﭘﻮرﺗﻪ ذﮐﺮ ﺳﻮې ﮐﻮرس ﭘﺎﻟﻴﴘ د ﮐﻤﭙیﻮ ﺮ ﺳﺎﯾﻨﺲ ډيﭙﺎر ﻤﻨ
. ﻫـ ش( ﻧﻴ ﻪ غﻮﻧ ﻩ ﮐﯥ ﺛﺒﺖ او د ﺗﺎﺋﻴﺪ ﺷﻮل۱۴۰۳ / / ) ﭘﺮو ﻮﮐﻮل ﭘﻪ
Approval
د ﭘﻮرﺗﻪ ذﮐﺮ ﺳﻮې ﮐﻮرس ﭘﺎﻟﻴﴘ د ﮐﻤﭙیﻮ ﺮ ﺳﺎﯾﻨﺲ ﭘﻮﻫﻨ ﯽ د ﻧصﺎب او ﮐﺮيﮑﻮ
تﺎﺋﻴدی
ﻫـ ش( ﻧﻴ ﻪ غﻮﻧ ﻩ ﮐﯥ ﺛﺒﺖ او۱۴۰۳ / / ) ﻪ ﭘﺮو ﻮﮐﻮل ﭘﻪ ( ) ﮐﻤﻴ ﯽ ﭘﻪ
.د ﺗﺎﺋﻴﺪ ﺷﻮل
ﻻسﻠﻴﮑونﻪ
د ﮐﻤﭙیﻮ ﺮ ﺳﺎﯾﻨﺲ ﺎﻧ ﯽ د آﻣﺮ ﻻﺳﻠﻴک د اﺳتﺎد ﻻﺳﻠﻴک
د کمپﻴو ر سﺎﻳﻨﺲ
ﭘوهﻨ ﯽ د رﻳﺎسﺖ ﻣهر
5|Page
