Scribd
Upload
135 views1 page

1728544664ge 167

Uploaded by

786harisafzal786
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
135 views1 page

1728544664ge 167

Uploaded by

786harisafzal786
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/ 1

Annex-A: Curriculum, Course Syllabi, and Model Study Plan for BS Computer Science, 7.8.

2024

Course Title Discrete Structures


Course Code GE-167
Credit Hours 3 (3,0)
Category General Education
Prerequisite None
Co-Requisite None
Follow-up None
At the end of the course, the students will be able to: BT PLO
CLO1: Understand the key concepts of Discrete Structures such
C2 (Understand) 1,3
as Sets, Permutations, Relations, Graphs and Trees etc.
CLO2: Apply formal logic proofs and/or informal, but rigorous,
Course logical reasoning to real problems, such as predicting the C3 (Apply) 1,3
Learning behavior of software or solving problems such as puzzles.
Outcomes CLO3: Apply discrete structures into other computing problems
(CLOs) such as formal specification, verification, databases, artificial C3 (Apply) 1,2,3,4
intelligence, and cryptography.
CLO4: Differentiate various discrete structures and their
C4
relevance within the context of computer science, in the areas 1,2,3,4
(Differentiate)
of data structures and algorithms, in particular
Mathematical Reasoning: Propositional and predicate logic. Propositional Logic: Logical operators,
translations between symbolic expressions and formal English expression, logical equivalences.
Predicate Logic: Quantifiers, Nested quantification, equivalences, translations between symbolic forms
and formal English. Rules of Inference: Proof methods and strategies, Direct proof, Proof by
contraposition, proof by induction, proof by implication, Existence proof, Uniqueness proofs, trivial
proofs, vacuous proofs. Sets: Notations, set operations, Venn diagrams, countable and uncountable sets,
relations, equivalence relations and partitions, partial orderings, recurrence relations, functions,
mappings. Functions: Injective, surjective, bijective, special types of functions, function composition,
inverse functions, recursive functions, compositions, number theory, sequences, series, counting,
Course inclusion and exclusion principle, pigeonhole principle, permutations and combinations. Integers and
Description Divisibility: Division theorem, modular arithmetic, LCM, GCD, Euclidean and Extended Euclidean
method, finding solutions to congruence. Primes: Fundamental theorem of arithmetic, characterizations
of primes, Mersenne primes. Induction: Weak induction, strong induction. Recursion and
Recurrences: Formulation of recurrences, closed formulas, Counting: product rule, sum rule, principle
of inclusion-exclusion, combinations and permutations, binomial coefficients, Pascal's identity and
Pascal’s triangle, binomial theorem, pigeonhole principle. Relations: Reflexive, symmetric, transitive,
antisymmetric, equivalence relations and equivalence classes, partial orders. Graph Theory:
Terminologies, elements of graph theory, planar graphs, graph coloring, Euler graph, Hamiltonian path,
rooted trees, traversals, handshaking lemma and corollary, special families of graphs, isomorphism,
planarity, Eulerian and Hamiltonian graphs, trees.
1. Kenneth H. Rosen, Discrete Mathematics and Its Applications, 7 th Edition, McGraw
Text Book(s)
Higher-Ed, 2011, ISBN: 0073383090.
1. Susanna S. Epp, Discrete Mathematics with Applications, 4th Edition.
2. Richard Johnson Baugh, Discrete Mathematics, 7th Edition.
3. Kolman, Busby & Ross, Discrete Mathematical Structures, 4th Edition.
Reference
Material 4. Ralph P. Grimaldi, Discrete and Combinatorial Mathematics: An Applied Introduction,
5th Edition.
5. Winifred Grassman, Logic and Discrete Mathematics: A Computer Science Perspective,
1st Edition.

Page 62 of 76

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy