Scribd
Upload
614 views1 page

Discrete Mathematics-Outline

This document provides a course outline for a Discrete Structures course at the Islamia University of Bahawalpur. The course aims to introduce discrete mathematics and its relevance to computer science. Topics covered include logic, sets, functions, algorithms, mathematical induction, counting techniques, graphs, and trees. Students will be evaluated based on assignments, quizzes, attendance, a midterm exam, and a final exam covering the entire course material. The textbook is Discrete Mathematics and Its Applications by Kenneth H. Rosen.

Uploaded by

qkhanzada33
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOC, PDF, TXT or read online on Scribd
614 views1 page

Discrete Mathematics-Outline

This document provides a course outline for a Discrete Structures course at the Islamia University of Bahawalpur. The course aims to introduce discrete mathematics and its relevance to computer science. Topics covered include logic, sets, functions, algorithms, mathematical induction, counting techniques, graphs, and trees. Students will be evaluated based on assignments, quizzes, attendance, a midterm exam, and a final exam covering the entire course material. The textbook is Discrete Mathematics and Its Applications by Kenneth H. Rosen.

Uploaded by

qkhanzada33
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOC, PDF, TXT or read online on Scribd
You are on page 1/ 1

The Islamia University of Bahawalpur

Course Outline
Discrete Structure
PROGRAM: BSIT COURSE CODE: INFT-1103
Schedule BSIT 1st – 1E, 2E, 4M

Instructor Mujtaba Husnain Contact [email protected]


Office Office 2.40, Faculty of Computing,
IUB
Course It is aimed at general introduction to the subject of discrete mathematics and its relevance to
Description computer science. We start with elements of logic with emphasis on propositional logic and
predicate calculus. Next we discuss sets and functions and develop the concepts of floor and
ceiling functions and their use in computer science. The important topic of growth of
functions and the methods of estimating the order of growth with the big-O, big-Omega, and
big-Theta are discussed. After introducing algorithms, we pass on to principle of
mathematical induction which is an important tool for proving general results. Counting
techniques, graphs and trees are also discussed at some length.
Expected  Participants have begun to appreciate the role of reasoning in mathematics and computer
Outcomes programming.
 They have become familiar with the tools used in counting.
 They have started understanding the difference between a general proof and verification in
particular cases.
Textbook  Discrete Mathematics and Its Applications, Sixth edition, 2008 by Kenneth H. Rosen;
The McGraw-Hill Companies.
Midterm 1 midterm exam, after 4lectures Final exam Will cover the whole course and will
exam be of 2 hour duration
Attendance Students missing more than 20% of the lectures will receive an “F” grade in the course.
Policy
Evaluation  Assignments: 05%
criterion  Quiz : 10%
 Attendance: 05%
 Midterm: 30%
 Final: 50%

Tentative Schedule
Lectures, Reading Assignments, Homework Assignments

Assignment and
Week Course Description Chapter Section
Quiz Section
Introduction, Propositions, logical connectives
1 conjunction, disjunction, negation, conditional statement, truth 1 1-2
tables Examples and exercises on propositional calculus
Tautologies and contradictions logical equivalence, Assignment # 1
2 1 3-4
Propositional functions. Arguments, Question on arguments
Quantification Sets, set operations, Venn diagrams.
3 2 1-2 Quiz # 1
Set identities.
Functions, surjective and bijective functions
Ceiling and floor functions, graphs of functions
Assignment # 2
4 Examples and exercises on functions 2 3
Sequences Summations
Examples and exercises on sequences and summations
5 Midterm
Algorithms , pseudo-codes
6 3 2
Linear and sequential search algorithms, Sorting algorithm Quiz # 2
Big Theta estimates
7 Mathematical Reasoning, methods of proof. Mathematical 4 1-2
induction
Recursive algorithms
8 Sum and product rules of counting 4 4 Assignment # 3
The pigeonhole principle and its applications
9 Permutations and combinations 5 1-2 Quiz # 3
10 Final term

You might also like