Course Outline

CS-1114 Discrete Structures

Effective Date: October 2024
SCU 3 Credit(s)
Co-requisite (s)
Pre-requisite(s) None
Weekly tuition pattern 2 sessions (90 min)

Teaching Team

Syllabus Designed By: Zara Masood

● 1- Course Description
This course provides an introduction to the mathematical elements that are the backbones of
computer science. The purpose of this course is to introduce logic, proof techniques, sets,
functions, relations, induction & recursion, algorithms, counting principles, graphs and trees with
an emphasis on applications in computer science.

o 2- Objectives
The objectives of this course are to:
● Introduce students to the mathematical aspects excessively needed by computer scientists.
Page 1 of 7

- Discrete Structures
● Develop skills for mathematical reasoning and creative problem solving.
● Develop skills for the analysis and verification of algorithms.
● Present various examples of discrete mathematics and their applications to computer
science.

o 3- Student Learning Outcomes

On the successful completion of this course students should be able to:
● Think logically and mathematically.
● Evaluate elementary mathematical arguments and identify fallacious reasoning.
● Prove mathematical statements using different proof methods.
● Construct inductive hypothesis and carry out simple induction proofs.
● Demonstrate a working knowledge of set notation and elementary set theory, recognize
the connection between set operations and logic, and explain the difference between countable
and uncountable sets.
● Define and use functions and relations.
● Measure the computational complexity of algorithms.
● Prove elementary arithmetic and algebraic properties of the integers, and modular
arithmetic.
● Apply basic counting principles including the pigeonhole principle and rules for counting
permutations and combinations.
● Understand basic concepts and properties associated with simple graphs and tress.

● 4- Course Structure

1. Presentation by lecturer
2. Problem Solving
3. Assignments
4. Quizzes

5- Course Duration
This course will be held twice a week of 3 hours (each 90 min session) class duration.

6- Course style
● The course will be delivered in a classroom environment.
●
● 7- Additional Course Requirement
In addition to the objectives of this course, students are expected to gain skills which would be
needed in the professional work environment. These skills include but not limited to: active class
participation, Presentation, Decision Making and Teamwork.
.
8- Text and Other Resources

Page 2 of 7

- Discrete Structures
8.1 Text
Kenneth Rosen, Discrete Mathematics and Its Applications, 7th edition, 2009, Mcgraw Hill Book
Co.

8.2 Other Resources

Kolman, Busby & Ross, Discrete Mathematical Structures, 5th edition, 2004, Prentice-Hall
Publishers

9- Course Outline
The lecturers are supposed to complete the following topics/sub-topics before the mid/final term
examination as prescribed in the course outline below:

Week Lecture Topics/Sub-Topics

Logic and Proofs
Propositional Logic
1
1 Propositions
Conditional Statements
Converse, Contrapositive, and Inverse
2 Biconditionals
Applications of Propositional Logic
Propositional Equivalences
1 Logical Equivalences Involving Conjunction and Disjunction
2
Logical Equivalences Involving Conditional and Biconditional Statements
2 Converse, Contrapositive, and Inverse Constructing New Logical Equivalences
Rules of Inference for Propositional Logic
1 Valid Arguments
3 Rules of Inference
Using rules to build Arguments
2 Resolution
Fallacies
Sets, Functions, Sequences and Sums
Sets
Venn Diagrams
1 Subsets
The Size of a Set
4 Power Sets
Cartesian Products
Set Operations
Set Identities
2 Generalized Unions and Intersections
Computer Representation of Sets
Functions

Page 3 of 7

- Discrete Structures
 One-to-One and Onto Functions
Inverse Functions and Compositions of Functions
1 The Graphs of Functions
Partial Functions
5 Sequences and Summations
2 Sequences
Recurrence Relations
Sequences and Summations
1 Special Integer Sequences
Summations
6 Cardinality of Sets
2 Countable Sets
Uncountable Set
Logic and Proofs
Predicates and Quantifiers
1 Predicates
Quantifiers
7 Quantifiers with Restricted Domains
Precedence of Quantifiers
Binding Variables
Logical Equivalences Involving Quantifiers
2 Negating Quantified Expressions
Translating from English into Logical Expressions
Nested Quantifiers
Understanding Statements Involving Nested Quantifiers
1 The Order of Quantifiers Translating from Nested Quantifiers into English
8 Translating English Sentences into Logical Expressions
Rules of Inference for Propositional Logic
2 Rules of Inference for Quantified Statements
Combining Rules of Inference for Propositions and Quantified Statements

MID-TERM EXAMINATION

Introduction to Proofs
Understanding How Theorems Are Stated
1 Methods of Proving Theorems
9 Direct Proofs
Proof by Contraposition
2 Proofs by Contradiction
Algorithms
Algorithms
1 Properties of Algorithms
Searching Algorithms
Sorting Algorithms
10
Complexity of Algorithms
Time Complexity
2 Number Theory
Divisibility and Modular Arithmetic

Page 4 of 7

- Discrete Structures
 Division
The Division Algorithm
Integer Representations and Algorithms
Representations of Integers
Algorithms for Integer Operations
Primes and Greatest Common Divisors
Primes
1 Greatest Common Divisors and Least Common Multiples
The Euclidean Algorithm
11 Induction and Recursion
Mathematical Induction
2 Mathematical Induction
Examples of Proofs by Mathematical Induction
Guidelines for Proofs by Mathematical Induction
Recursive Algorithms
1 Recursive Algorithms
Program Correctness
12 Program Verification
2 Rules of Inference
Conditional Statements
Loop Invariants
Counting
1 The Basics of Counting
Basic Counting Principles
The Pigeonhole Principle
13 The Generalized Pigeonhole Principle
Some Elegant Applications of the Pigeonhole Principle
2
Permutations and Combinations
Permutations
Combinations
Relations
Relations and Their Properties
1 Functions as Relations
Relations on a Set
14 Properties of Relations
Representing Relations
Representing Relations Using Matrices
2 Representing Relations Using Digraphs
Equivalence Relations
Equivalence Relations
Graphs
Graph Models and Graph Terminology and Special Types of Graphs
Graph Models
15 1 Basic Terminology
Some Special Simple Graphs
Representing Graphs
Representing Graphs
Adjacency Matrices
Page 5 of 7

- Discrete Structures
 Trees
Introduction to Trees, Applications of Trees and Tree Traversal
2 Properties of Trees
Binary Search Trees
Traversal Algorithms

FINAL TERM EXAMINATION

10- Assessment Criteria

No. Assessment Percentage

1. Mid Exam 30%
2. Final Exam 50%
3. Assignments & Quizzes 20%
Total 100%

11- Attendance Requirements

You are expected to attend all lectures, seminars, tutorials, and lab sessions or any other classroom
activity. Where you fail to attend classes, you cannot expect the lecturer to brief you on what you
have missed. You are responsible for your attendance, not the academic staff. Attendance at
tutorials and lab sessions will be strictly monitored, and failure to attend will be taken into account.

o 12- Submission and Collection of Assignment

All assignments should be handed in at the beginning of the class sessions when they are due. All
assignments may be handed back during scheduled classes.

13- General Information

Students are required to be familiar with the university code Conduct, and to abide by its terms
and conditions.

13.1 Copying of Copyright Material By Student

A condition of acceptance as a student is the obligation to abide by the University’s policy on the
copying of copyright material. This obligation covers photocopying of any material using the
University’s photocopying machines, and the recording off air, and making subsequent copies, of
radio or television broadcasts, and photocopying textbooks. Students who flagrantly disregard
University policy and copyright requirements will be liable to disciplinary action under the Code
of Conduct.

13.2 Academic Misconduct

Please refer to the Code of Conduct for definitions and penalties for Academic Misconduct,
plagiarism, collusion, and other specific acts of academic dishonesty. Academic honesty is crucial
to a student's credibility and self-esteem, and ultimately reflects the values and morals of the
Page 6 of 7

- Discrete Structures
University as a whole. A student may work together with one or a group of students discussing
assignment content, identifying relevant references, and debating issues relevant to the subject.
Academic investigation is not limited to the views and opinions of one individual, but is built by
forming opinion based on past and present work in the field. It is legitimate and appropriate to
synthesize the work of others, provided that such work is clearly and accurately referenced.
Plagiarism occurs when the work (including such things as text, figures, ideas, or conceptual
structure, whether verbatim or not) created by another person or persons is used and presented as
one’s own creation, unless the source of each quotation or piece of borrowed material is
acknowledged with an appropriate citation. Encouraging or assisting another person to commit
plagiarism is a form of improper collusion and may attract the same penalties. To prevent
Academic Misconduct occurring, students are expected to familiarize themselves with the
University policy, the Subject Outline statements, and specific assignment guidelines.

13.3 Guidelines to Avoid Plagiarism

Students are encouraged to cooperate, but collusion is a form of cheating. Students may use any
sources (acknowledged of course) other than the assignments of fellow students. Unless your
Subject Leader informs you otherwise, the following guideline should be used: Students may work
together in obtaining references, discussing the content of the references and discussing the
assignment, but when they write, they must write alone.

13.4 Referencing For Written Work

Referencing is necessary to acknowledge others' ideas, avoid plagiarism, and allow readers to
access those others’ ideas. Referencing should:
1. Acknowledge others' ideas
2. Allow readers to find the source
3. Be consistent in format and
4. Acknowledge the source of the referencing format

To attain these qualities, the school recommends use of either the Harvard or American
Psychological Association style of referencing, both of which use the author/date.

Page 7 of 7

- Discrete Structures