Scribd
Upload
211 views

CC111

This document provides information on the Computing Core course "Discrete Structures" which is part of the BS Information Technology program at Punjab University affiliated colleges. The 3 credit hour course introduces topics like propositional and predicate logic, sets, functions, integers and divisibility, primes, induction, recursion, counting, relations, and graph theory. References for the course include textbooks by Rosen, Epp, Johnson Baugh, Kolman et al., and Grimaldi.

Uploaded by

iqra.id.auk
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
211 views

CC111

This document provides information on the Computing Core course "Discrete Structures" which is part of the BS Information Technology program at Punjab University affiliated colleges. The 3 credit hour course introduces topics like propositional and predicate logic, sets, functions, integers and divisibility, primes, induction, recursion, counting, relations, and graph theory. References for the course include textbooks by Rosen, Epp, Johnson Baugh, Kolman et al., and Grimaldi.

Uploaded by

iqra.id.auk
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

Curricula/Syllabi of BS Information Technology for Punjab University Affiliated Colleges

2. COMPUTING CORE COURSES

Course Title Discrete Structures


Course Code CC-111
Credit Hours 3
Category Computing Core
Prerequisite None
Co-Requisite None
Follow-up None
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, inclusion and
Course exclusion principle, pigeonhole principle, permutations and combinations.
Description Integers and 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, 7th Edition,
Text Book(s)
McGraw 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.

Version 1.0.0 Page 15 of 68

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