Scribd
Upload
21 views

Discrete Structure

The document outlines a discrete structures course, including its credit hours, prerequisites, course learning outcomes focused on key discrete structures concepts, and a course outline covering topics like logic, sets, graphs, and algorithms.

Uploaded by

Repacker mapcgx
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
21 views

Discrete Structure

The document outlines a discrete structures course, including its credit hours, prerequisites, course learning outcomes focused on key discrete structures concepts, and a course outline covering topics like logic, sets, graphs, and algorithms.

Uploaded by

Repacker mapcgx
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 1

Course Name: Discrete Structure

Credit Hours: 3 (3-0)


Contact Hours: 3-0
Pre-requisites: None
Course Introduction:
Introduces the foundations of discrete mathematics as they apply to Computer Science, focusing on
providing a solid theoretical foundation for further work. Further, this course aims to develop
understanding and appreciation of the finite nature inherent in most Computer Science problems and
structures through study of combinatorial reasoning, abstract algebra, iterative procedures, predicate
calculus, tree and graph structures. In this course more emphasis shall be given to statistical and
probabilistic formulation with respect to computing aspects.

CLO No. Course Learning Outcomes Bloom Taxonomy


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

Course Outline:
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. Algorithms, Searching and Sorting Algorithms, elements of
graph theory, planar graphs, graph coloring, Graph Algorithms, euler graph, Hamiltonian
path, rooted trees, traversals.

Reference Materials: (or use any other standard and latest books)
1. Discrete Mathematics and Its Applications, 7th edition by Kenneth H. Rosen
2. Discrete Mathematics with Applications, 4th Edition by Susanna S. Epp
3. Discrete Mathematics, 7th edition by Richard Johnson Baugh
4. Discrete Mathematical Structures, 4th edition by Kolman, Busby & Ross
5. Discrete and Combinatorial Mathematics: An Applied Introduction by Ralph P. Grimaldi
6. Logic and Discrete Mathematics: A Computer Science Perspective by Winifred
Grassman

74

You might also like