Scribd
Upload
15 views

Discrete Structures

Uploaded by

Gaming star
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
15 views

Discrete Structures

Uploaded by

Gaming star
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

Course Content Repository–

Discrete Structures
This document will help you to find details about course, its title, credit hours and content.

VERSION 1.0
Course Content Repository – Discrete Structures

1. Course title
Discrete Structures

2. Credit hours

Lecture Lab

3 CH 0 CH

3. Pre-requisite
 No pre-requisite of this course

4. Course objectives

 Understand the key concepts of Discrete Structures such as Sets, Permutations, Relations,
Graphs, and Trees etc.
 Apply formal logic proofs and/or informal, but rigorous, logical reasoning to real
problems, such as predicting the behavior of software or solving problems such as
puzzles.
 Apply discrete structures into other computing problems such as formal specification,
verification, databases, artificial intelligence, and cryptography.
 Differentiate various discrete structures and their relevance within the context of
computer science, in the areas of data structures and algorithms, in particular.

5. Course content

 Mathematical reasoning, propositional and predicate logic, rules of inference, 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.

6. Reference material

 Discrete Mathematics and Its Applications, 7th edition by Kenneth H. Rosen

Computer Science Department 1


Course Content Repository – Discrete Structures

 Discrete Mathematics with Applications, 4th Edition by Susanna S. Epp


 Discrete Mathematics, 7th edition by Richard Johnson Baugh
 Discrete Mathematical Structures, 4th edition by Kolman, Busby & Ross
 Discrete and Combinatorial Mathematics: An Applied Introduction by Ralph P. Grimaldi
 Logic and Discrete Mathematics: A Computer Science Perspective by Winifred Grassman

Computer Science Department 2

You might also like