NCEAC.FORM.

001 -D
National Computing Educ ation Accreditation Council
NCEAC

COURSE DESCRIPTION FORM

INSTITUTION National University of Computer and Emerging Sciences (NUCES-FAST)

PROGRAM (S) TO BS(CS), BS(SE), BS(AI), and BS(Cyber Security) BE

EVALUATED

A. Course Description

Course Code CS-211

Course Title Discrete Structures
Credit Hours 3+0
Prerequisites by None
Course(s) and Topics
Assessment
Instruments with Midterm examination I: 15%
Weights (homework,
Midterm examination II: 15%
quizzes, midterms,
final, programming Assignments: 20%
assignments, lab work, End-term examination 50%
etc.)
Course Coordinator Dr. Fahad Samad
URL (if any) Google Classroom – https://classroom.google.com/u/0/c/MjY5MTAyNzAzMDIz
Current Catalog Logic, relations, functions, basic set theory, counting, proof techniques, mathematical
Description induction, graph theory, recursion, recurrence relations, number theory and sequence &
series. All the topics will be taught in perspective of their applications in computing.
Textbook (or Kenneth H. Rosen, Discrete Mathematics and Its Applications, McGraw Hill, 8 th Edition,
Laboratory Manual 2019.
for Laboratory
Courses)
Reference Material Sussana S. Epp, Discrete Mathematics with Applications, Brooks Cole, Cengage Learning,
5th Edition, 2020.

Course Goals A discrete mathematics course has more than one purpose. Students should learn a
particular set of mathematical facts and how to apply them; more importantly, such a course
should teach students how to think logically and mathematically. To achieve these goals,
the focus of this course is on basic mathematical concepts in discrete mathematics and on
applications of discrete mathematics in algorithms and data structures. The focus is also on
 NCEAC.FORM.001 -D
National Computing Educ ation Accreditation Council
NCEAC

teaching the problem-solving strategies, techniques, and tools and to show students how
1 NCEAC.FORM.001.D

discrete mathematics can be used in modern computer science. In particular, this course is
meant to introduce logic, proofs, sets, relations, functions, counting, and probability, with an
emphasis on applications in Computer Science. Further, this course aims to develop
understanding and appreciation of the finite nature inherent in most Computer Science
problems and structures through study of combinatorial reasoning, abstract algebra, iterative
procedures, predicate calculus, tree and graph structures.

2 NCEAC.FORM.001.D
 NCEAC.FORM.001 -D
National Computing Educ ation Accreditation Council
NCEAC

A. Course Learning Outcomes (CLOs)

CL Course Learning Domain Taxonomy
PLO Tools
O Outcome (CLO) Level
01 Explain the key concepts of A1, A2,
Discrete Structures such as A5,
C2
Mathematical Logic, Sets, Cognitive 1,2
Permutations, Relations,
(Understanding) M1, F
Graphs and Trees etc.
02 Construct formal logic
proofs and/or informal, but
rigorous, logical reasoning
C3 A6,
to real problems, such as Cognitive
(Applying)
1,2,5
predicting the behavior of M2, F
software or solving
problems such as puzzles.
03 Use discrete structures in
solving other computing
problems such as formal
C3 A3, A4
specification, Cognitive
(Applying)
1,2,5
verification, databases, M2, F
artificial intelligence, and
cryptography.
04 Distinguish various discrete
structures and their
relevance within the context C4 A5,
of computer science, in the
Cognitive
(Analyzing)
1,2, 5
A6, F
areas of data structures and
algorithms, in particular.
Tool: A = Assignment, M = Mid-term, F=Final (End-term)

B. Program Learning Outcomes

For each attribute below, indicate whether this attribute is covered in this course or not.
Leave the cell blank if the enablement is little or non-existent.

1.Computing Apply knowledge of mathematics, natural sciences, 

Knowledge: computing fundamentals, and a computing specialization to
the solution of complex computing problems.

2.Problem Identify, formulate, research literature, and analyse 

Analysis: complex computing problems, reaching
substantiated conclusions using first principles of mathematics, natural
sciences, and computing
sciences.
 NCEAC.FORM.001 -D
National Computing Educ ation Accreditation Council
NCEAC

3 3.Design/Develop Design solutions for complex computing problems and

Solutions: design systems, components, and processes that meet specified
needs with appropriate consideration for public health and safety, cultural,
societal, and
environmental considerations.
NCEAC.FORM.001.D

B. Program Learning Outcomes

For each attribute below, indicate whether this attribute is covered in this course
or not. Leave the cell blank if the enablement is little or non-existent.

4.Investigation & Conduct investigation of complex computing problems

Experimentation: using research-based knowledge and research-based
methods.

5. Modern Tool Create, select, and apply appropriate techniques, 

Usage: resources and modern computing tools, including prediction and
modelling for complex computing problems.

6.Society Apply reasoning informed by contextual knowledge

Responsibility: to assess societal, health, safety, legal, and cultural
issues relevant to context of complex computing problems.

7.Environment Understand and evaluate sustainability and impact of

and Sustainability: professional computing work in the solution of
complex computing problems.

8. Ethics: Understand and commit to professional ethics, responsibilities,

and norms of professional computing practice.

9.Individual and Function effectively as an individual, and as a Team

Work: member or leader in diverse teams and in multi disciplinary
settings.

10. Communicate effectively on complex computing

Communication: activities with the computing community and with society
at large.
11.Project Demonstrate knowledge and understanding of Management and
management principles and economic decision
Finance: making and apply these to one's own work as a member or a team.

4 NCEAC.FORM.001.D
 NCEAC.FORM.001 -D
National Computing Educ ation Accreditation Council
NCEAC

12.Life-long Recognize the need for, and have the preparation

Learning: and ability to engage in independent and life-long learning in
the broadest context of technological changes.
 NCEAC.FORM.001 -D
National Computing Educ ation Accreditation Council
NCEAC

C. Relation between CLOs and PLOs

(CLO: Course Learning Outcome, PLOs: Program Learning Outcomes)
PLOs

1 2 3 4 5 6 7 8 9 10 11 12

1  

CLOs
2   
3   
4   

1. Topics to be covered:

No. of Contact
List of Topics
Weeks Hours CLO
Chapter 1: The Foundations: Logic
and Proofs
Introduction Propositional Logic,
Applications of Propositional Logic,
Topics Covered in Propositional Equivalences,
the Course, with Predicates and Quantifiers, Nested
Number of Lectures Quantifiers, Rules of Inference
on Each Topic
(assume 15-week Chapter 2: Sets, Functions,
instruction and Sequences and Sums 5 15 1,2
onehour lectures) Sets, Set Operations, Functions,
Sequences and Series

Chapter 9: Relations
Relations and their Properties,
Applications of Relations,
Representing Relations, Equivalence
Relations, and Partial Orderings
========== MID 1 ==========
Chapter 4: Number Theory and
Cryptography
Divisibility and Modular Arithmetic,
Integer Representation and
Algorithms, Primes and Greatest
Common Divisors, Congruences and
Applications and Cryptography 5 15 1, 2

Chapter 5: Induction and

Recursion
Mathematical Induction and
Recursive Algorithms

6 NCEAC.FORM.001.D
 NCEAC.FORM.001 -D
National Computing Educ ation Accreditation Council
NCEAC

Chapter 6 and 8: Counting &

Counting Techniques
Basics, Pigeonhole Principle,
Permutations and Combinations,
Binomial Coefficients and Recurrence
Relations
========== MID 2 ==========
Chapter 10 Graphs
Graphs and Graph Models,
Terminologies, Types of Graphs,
Representing Graphs and
Isomorphism, Connectivity, Euler and
Hamiltonian Paths, Planar Graphs,
and Graph Coloring

Chapter 11 Trees
Introduction, Applications, Tree
Traversal, Spanning Trees and 4.5 14 1, 2, 5
Minimum Spanning Trees

Chapter 1
Introduction to Proofs and Proof
Methods

Chapter 3 Algorithms
Algorithms, The Growth of Functions,
and Complexity of Algorithms
Review 0.5 1 1, 2, 5

========== END-TERM (FINAL) EXAM ==========

Total 15 45

Laboratory No Labs and Projects in this course.

Projects/Experiments
Done in the Course
Programming Some optional programming assignments will be given.
Assignments Done in
the Course
Class Time Spent on Theory Problem Analysis Solution Design Social and Ethical Issues
(in contact hours) 10 15 20 0
Oral and Written Students need to participate in class discussion and class assignments.
Communications
Instructor Name __Dr. Fahad Samad__

7 NCEAC.FORM.001.D
 NCEAC.FORM.001 -D
National Computing Educ ation Accreditation Council
NCEAC

Instructor Signature ____________________________

Date: February 7, 2021

8 NCEAC.FORM.001.D