Scribd
Upload
10 views

CSC102_DS_CDF_V4.0

The document outlines the course description for CSC102: Discrete Structures at COMSATS University Islamabad, detailing its objectives, content, and assessment methods. The course aims to introduce formal logic, discrete data structures, and mathematical reasoning, covering topics such as propositional logic, sets, functions, and graph theory. It includes various assessment tools like quizzes and assignments to evaluate students' understanding of the material.

Uploaded by

aatikanasir87
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
10 views

CSC102_DS_CDF_V4.0

The document outlines the course description for CSC102: Discrete Structures at COMSATS University Islamabad, detailing its objectives, content, and assessment methods. The course aims to introduce formal logic, discrete data structures, and mathematical reasoning, covering topics such as propositional logic, sets, functions, and graph theory. It includes various assessment tools like quizzes and assignments to evaluate students' understanding of the material.

Uploaded by

aatikanasir87
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 3

COMSATS University Islamabad

Department of Computer Science


Course Description Form (CDF)
Course Information
Course Code: CSC102 Course Title: Discrete Structures
Credit Hours: 3 (3, 0) Lecture Hours/Week: 3
Lab Hours/Week: 0 Pre-Requisites: None
Course Objectives
• To introduce a formal system (propositional and predicate logic) on which mathematical reasoning is
based;
• To teach important discrete data structures such as sets, relations, functions, graph and trees;
• To exercise common mathematical arguments and proof strategies;
• To develop the ability to see a problem from a mathematical perspective.
Course Content
This course introduces mathematical structures necessary for the development of program logic. It
covers the following topics: Propositional & Predicate Logic; Arguments and Proof; Sets, Relations,
Functions; Recursion; Combinatorics; Graphs & Tree Structures.
Unit wise Major Topics
No of teaching
Unit Topic
hours
Propositional Logic: Overview, Simple & Compound
1. Statements, Truth Tables, Translation of English Sentences 6
into Logical Expressions & vice versa, Laws of Logic and,
Logical Equivalence.
Predicate Logic: Quantifiers, The Logic of Quantified
Statements: Negations of Quantified Statements; Negations of
Universal & Existential Conditional Statements; The Relation
2. 4.5
among ∀, ∃, ∧, and ∨; Vacuous Truth of Universal Statements;
Variants of Universal Conditional Statements; Statements with
Multiple Quantifiers.
Arguments and Proof: Arguments & Rule of Inference,
3. Arguments with Quantified Statements, Direct and Indirect 6
Proofs, and Mathematical Induction.
Sets & Relations: Concept, Operations with Sets, Computer
operations with set, Problem solving with Venn Diagram,
Proving Arguments with Sets; Relations: Representation of
4. relations using Boolean Matrices & Digraphs, Properties of 6
Relations, Operations on Relations, Connectivity Relations,
Transitive Closure, Equivalence Relations, Partial & Total
Orderings; Elementary Number Theory

1
Functions and Matrices: Concept of Function, Special
Function, Properties of Functions, Pigeonhole Principle,
5. 6
Composition of Functions, Sequence & the Summation
Notations, and Matrices.
Recursion: Recursively defined Functions and Series, Solving
6. 4.5
Recurrence Relation, Generating Functions.
Combinatorics: Fundamental Counting Principles,
Permutations, Derangements, Combinations, Permutations &
7. 3
Combinations with Repetitions, and Procedures for generating
Permutations & Combinations.
Graphs and Tress: Concepts, Computer Representation of
Graphs, Types of Graphs, Isomorphic Graphs, Paths, Cycles, &
Circuits, Eulerian & Hamiltonian Graphs, Planner Graphs,
8. Graph Coloring. Digraphs & Weighted Digraphs, Directed 9
Acyclic Graph, and Applications of Graph; Rooted Trees,
Terminologies and Characterizations of Trees, Isomorphisms
of Trees.

Total Contact Hours 45


Mapping of CLOs and GAs
Blooms
Unit Taxonomy
Sr.# Course Learning Outcomes GA
# Learning
Level
Apply symbolic propositional and predicate logic to
CLO-1 1,2 determine the most effective solutions of a given Applying 2,3
problem.
Apply formal logic proofs and reasoning to construct a
CLO-2 3 Applying 2,3
sound argument.
Solve a computing problem using a specific set, function,
CLO-3 4,5 Applying 2,3
or relation model.
Use recurrence relation and counting formalisms to solve
CLO-4 6,7 Applying 2,3
real-world problems.
Solve real-world problems in computer science using
CLO-5 8 Applying 2,3
appropriate forms of graphs and trees.
CLO Assessment Mechanism
Assessment
CLO-1 CLO-2 CLO-3 CLO-4 CLO-5
Tools

Quizzes Quiz 1 Quiz 2 Quiz 3 Quiz 4 -

Assignment Assignment
Assignments Assignment 1 Assignment 2 Assignment 3
3 4
Mid Term Mid Term Mid Term
Midterm Exam - -
Exam Exam Exam

2
Final Term
Final Term Exam
Exam
Text and Reference Books

Textbook:
1. Discrete Mathematics and Its Applications, Rosen, K. H., McGraw Hill, 2019.
Reference Books:
1. Discrete Mathematics with Applications, Susanna S.E., Cengage Learning, 2019.
2. Discrete Mathematics, Richard Johnsonbaugh, Pearson, 2018.

You might also like