National Computing Education Accreditation Council
NCEAC
NCEAC.FORM.001-D
COURSE OUTLINE
INSTITUTION
University of Management & Technology, Lahore
PROGRAM (S) TO
BE
BS Information Technology
EVALUATED
Course Description:
Course Code
CC1041
Course Title
Discrete Structures
Credit Hours
3
Prerequisites by
Course(s) and
Topics
None
Assessment
Instruments
with Weights
(homework,
quizzes,
midterms, final,
programming
assignments, lab
work, etc.)
Quizzes: 15%
Assignments: 15%
Class participation/Behavior/Attitude/Attendance: 5%
Midterm Exam: 25%
Final Exam: 40%
Course
Moderator
Dr. Ghulam Mustafa
URL (if any)
https://lms.umt.edu.pk/course/view.php?id=11212
Current Catalog
Description
Textbook (or
Laboratory
Manual for
Laboratory
Courses)
Keneth H. Rosen. Discrete Mathematics and its Applications. Latest ed.
Reference
Material
1. Discrete Mathematics with Applications, 4th Edition by Susanna S. Epp
2. Discrete Mathematics, 7th edition by Richard Johnson Baugh
3. Discrete Mathematical Structures, 4th edition by Kolman, Busby & Ross
4. Discrete and Combinatorial Mathematics: An Applied Introduction by Ralph P.
Grimaldi
5. Logic and Discrete Mathematics: A Computer Science Perspective by Winifred
Grassman
Course Goals
Mathematical reasoning, propositional and predicate logic, rules of inference,
1
NCEAC.FORM.001.D
National Computing Education Accreditation Council
NCEAC
NCEAC.FORM.001-D
proof by induction, proof by contraposition, proof by contradiction, proof by
implication, set theory, relations, equivalence relations and partitions, partial
orderings, recurrence relations, functions, mappings, function composition,
inverse functions, recursive functions, Number Theory, sequences, series,
counting, inclusion and exclusion principle, pigeonhole principle, permutations
and combinations, elements of graph theory, planar graphs, graph coloring,
Euler graph, Hamiltonian path, rooted trees, traversals.
Course Learning Outcomes (CLOs):
At the end of the course the students will be able to:
CLO
Domain
BT Level*
CLO1: Understand the key concepts of Discrete Structures such as Sets,
C
2
Permutations, Relations, Graphs, and Trees etc.
CLO2: Apply formal logic proofs and/or informal, but rigorous, logical reasoning to
real problems, such as predicting the behavior of software or solving problems
C
3
such as puzzles.
CLO3: Apply discrete structures into other computing problems such as formal
C
3
specification, verification, databases, artificial intelligence, and cryptography.
CLO4: Differentiate various discrete structures and their relevance within the
context of computer science, in the areas of data structures and algorithms, in
C
4
particular.
* BT= Bloom’s Taxonomy
C=Cognitive domain, P=Psychomotor domain, A= Affective domain
Mapping of CLOs to Program Learning Outcomes (PLOs):
CLOs / PLOs
PLO1: Academic Education
PLO2: Knowledge for Solving Computing Problems
PLO3: Problem Analysis
PLO4: Design/ Development of Solutions
PLO5: Modern Tool Usage
PLO6: Individual and Team Work
PLO7: Communication
PLO8: Computing Professionalism and Society
PLO9: Ethics
PLO10: Life-long Learning
2
CLO
1
CLO
2
CLO
3
CLO
4




NCEAC.FORM.001.D
National Computing Education Accreditation Council
NCEAC
NCEAC.FORM.001-D
Tentative Lecture Plan:
Topics Covered
in the Course
Week
Topics
Assessment
s
CLOs
Introduction
1
CLO1
Overview, motivation, importance.
Logic
2-3
Propositional logic, logical equivalence,
predicates & quantifiers, logical reasoning,
proof techniques
Sets
Quiz 1
4
CLO2
CLO3
CLO1
Basics, set operations.
Functions
5-6
One-to-one, onto, inverse, composition of
functions, graphs of functions.
7
Sequences and Summations
8
Midterm Exam
9-10
Induction and Recursion
Assignment
-1, Quiz 2
CLO1
CLO3
Assignment
-2
CLO1
CLO3
CLO1
CLO2
Quiz 3
CLO3
CLO4
Counting
11-12
13
Basic rules, pigeonhole principle, permutations
and combinations, binomial coefficients.
Relations
Properties of relations, combining relations,
representation of relations.
Graphs
Assignment
-2
Quiz 4
Directed, undirected graphs.
Trees
Quiz 5
Introduction to trees.
3
CLO3
CLO4
CLO1
CLO4
14
15
CLO3
CLO1
CLO4
NCEAC.FORM.001.D
National Computing Education Accreditation Council
NCEAC
NCEAC.FORM.001-D
Final term Exam
Final
Laboratory
Projects/Experi
ments Done in
the Course
Assignments and Practice Homework
Programming
Assignments
Done in the
Course
Class Activities
CLO4
3 hours per week
Class Time
Spent on (in
credit hours)
Oral and Written
Communication
s












Final Exam
Midterm
Exam

Assignment 3

Assignment 2
Quiz 5

Assignment 1
Quiz 4

Quiz 3
1
2
3
4
Quiz 2
CLOs▼
Mapping of CLOs to Direct Assessments
Quiz 1
*-Tentative




Instructor Name: Nauman Ahmad
Instructor Signature ____________________________
4
NCEAC.FORM.001.D