COURSE OUTLINE FOR DISCRETE STRUCTURES

Program Course Specific

Learning Performance Instruction Instructional Assessment Time
Learning Learning Learning
Content Standard al Delivery Resources Tasks Allotment
Outcomes Outcome Outcomes
An ability to Be oriented on Analyze the BU Quality Satisfactorily Lecture VGMO Question and 1 Hour
understand the VMGO of vision, goals Policy understand Discussion Copies Answer
best practices BU and BUPC and objectives VGMO the vision, Course
and standards in relation to of the university Course mission, Syllabus
and their the course in relation with description, goals and
applications. the course. To course objectives of
present the content, the university
An ability to description and course policy,
understand information requirements
professional, about the and grading
ethical, legal, course. system
security and
social issues
and
responsibilities
in the utilization
of information
technology
An ability to Apply formal Distinguish if a Syntax and Satisfactorily Lecture Handouts Quiz 5 Hours
analyze methods of given statement Semantics for Distinguish, Discussion LCD Projector Take Home Exam
complex symbolic is a proposition Propositional Write and Class Marker Recitation
problems, and prepositional or not; Write Logic (PL) Identify the Intervention Chalk
identify and and predicate English Propositional Syntax and PowerPoint
define the logic statements is Logic Semantics for Presentatio Suggested
computing symbolic form; The Syntax of PL n Reading:
requirements and Identify PL Brainstormi https://www.tut
appropriate to whether a Semantics of ng orialspoint.com
its solution statement is PL /discrete_math
 satisfiable, ematics/
contradictory, or
valid.
An ability to Apply formal Identify whether Proving in Satisfactorily Lecture Handouts Quiz 5 Hours
design, methods of a given Propositional Identify the Discussion LCD Projector Take Home Exam
implement, and symbolic inference is Logic Rule of Class Marker Recitation
evaluate prepositional valid or not Logical Inference, Intervention Chalk
computer- and predicate using the Implication Show two PowerPoint
based systems, logic inference rules; Logical Sentence are Presentatio Suggested
processes, Show whether Equivalence Equivalent n Readings:
components, or two sentences Methods of and Prove Brainstormi https://www.sit
programs to are equivalent Proof in PL the Validity of ng e.uottawa.ca/~l
meet desired using a Sentence ucia/courses/2
needs and equivalence 101-
requirements laws; and Prove 10/lecturenote
under various the validity of s/04Inference
constraints sentences RulesProofMet
using any of the hods.pdf
proof
techniques
An ability to Apply formal Translate Syntax and Satisfactorily Lecture Handouts Quiz 4 Hours
understand methods of English Semantics for can Discussion LCD Projector Take Home Exam
best practices symbolic statements to First Order Translate, Class Marker Recitation
and standards prepositional sentences in Predicate Evaluate and Intervention Chalk
and their and predicate FOPL; Evaluate Logic (FOPL) Prove the PowerPoint
applications logic the truth value  The Syntax FOPL Presentatio Suggested
of sentences in for FOPL n Readings:
FOPL; and  The Brainstormi http://fmv.jku.a
Prove the Semantics ng t/logik/ws14/F
validity of for FOPL OPL-
arguments in  Semantic syntax.pdf
FOPL using Rules
resolution.  Resolution in
 FOPL
An ability to Perform Differentiate set Sets Satisfactorily Lecture Handouts Quiz 5 Hours
apply operations membership  Basic Sets can Discussion LCD Projector Take Home Exam
knowledge of associated from set Concepts Differentiate Class Marker Recitation
computing, with sets, containment;  Set set, perform Intervention Chalk
science, and functions and Perform the Operations set PowerPoint Suggested
mathematics relations various set  Set Algebra operations Presentatio Readings:
appropriate to operations; and and algebra n Schaum’s
the discipline Perform algebra sets Brainstormi Outline Series:
sets. ng Discrete
Mathematics
(3rd ed.) pp. 1-
12
An ability to Perform Identify the Relations Satisfactorily Lecture Handouts Quiz 3 Hours
apply operations properties of a  Relations can Identify Discussion LCD Projector Take Home Exam
knowledge of associated given relation; and their properties of Class Marker Recitation
computing, with sets, Indicate if a Properties a relation, Intervention Chalk
science, and functions and given relation is  Ordering Indicate PowerPoint
mathematics relations a partial Relations partial and/or Presentatio Suggested
appropriate to ordering and/ or  Operations total ordering, n Readings:
the discipline a total ordering; on Relations perform Brainstormi Schaum’s
Perform the  The Well- operations ng Outline Series:
operations on Ordering and can Discrete
relations; and Principle: prove using Mathematics
Prove Mathematica mathematical (3rd ed.)
statements l Induction . pp. 23-33
using
mathematical
induction.
An ability to Perform Distinguish if a Functions Satisfactorily Lecture Handouts Quiz 3 Hours
apply operations given relation is  Functions can Discussion LCD Projector Take Home Exam
knowledge of associated a function or and their Distinguish a Class Marker Recitation
computing, with sets, not; Properties relation is a Intervention Chalk
science, and functions and Identify if a  Special function or not, PowerPoint
mathematics relations function is one- Types of can Identify if a Presentatio
appropriate to to-one, onto, Functions Function is n Suggested
the discipline and/or a one-to-  The ane-to-one, Brainstormi Readings:
one Pigeonhole onto and/or a ng http://www.cs.
correspondence Principle one-to-one utexas.edu/~isi
; and correspondenc l/cs311h/lectur
Prove using the e and can e-functions-
pigeonhole Prove using 6up.pdf
principles pigeonhole
Principles
Midterm Lecture 2 Hours
Examination
An ability to Apply counting Solve problems Combinatorial Satisfactorily Lecture Handouts Quiz 4 Hours
analyze techniques in using the basic Principles can Solve the Discussion LCD Projector Take Home Exam
complex calculation of counting  Basic basic Class Marker Recitation
problems, and discrete principles and Counting counting Intervention Chalk
identify and probabilities the principles of Principles principles and PowerPoint
define the inclusion-  The the inclusion- Presentatio Suggested
computing exclusion Inclusion- exclusion n Readings:
requirements Exclusion principles Brainstormi https://mathigo
appropriate to Principles ng n.org/world/Co
its solution mbinatorics
An ability to Compute Solve problems Arrangements Satisfactorily Lecture Handouts Quiz 5 Hours
analyze permutations on and Selections can solve Discussion LCD Projector Take Home Exam
complex and permutations,  Arrangement problems on Class Marker Recitation
problems, and combinations sequences,  Selections permutations, Intervention Chalk
identify and of sets combinations sequence, PowerPoint
define the and multi-sets combinations Presentatio Suggested
computing and multi- n Readings:
requirements sets Brainstormi https://betterex
appropriate to ng plained.com/ar
its solution ticles/easy-
 permutations-
and-
combinations/
An ability to Use trees and Explain the Graph Satisfactorily Lecture Handouts Quiz 4 Hours
analyze graph theory in basic concepts Concepts can Explain Discussion LCD Projector Take Home Exam
complex dealing with on graphs; and  Basic Terms the basic Class Marker Recitation
problems, and discrete Draw the  Path concept of Intervention Chalk
identify and mathematics special types of  Cycle graphs and PowerPoint
define the problems graphs can draw Presentatio Suggested
 Special Type
computing special types n Readings:
of Graphs
requirements of graphs Brainstormi https://people.c
appropriate to ng s.pitt.edu/~milo
its solution s/courses/cs44
1/lectures/Clas
s25.pdf
An ability to Use trees and Model a given Some Graph Satisfactorily Lecture Handouts Quiz 3 Hours
analyze graph theory in problem in Problems and can Model a Discussion LCD Projector Take Home Exam
complex dealing with terms of the Applications given Class Marker Recitation
problems, and discrete appropriate  Graph problem in Intervention Chalk
identify and mathematics graph structure; Matching terms of the PowerPoint
define the problems and  Graph appropriate Presentatio
computing Solve some Coloring graph n Suggested
requirements graph problems  Shortest structure and Brainstormi Readings:
appropriate to on a particular Path can solve ng https://people.
its solution graph.  Minimum some graph cs.pitt.edu/~mil
Spanning problems. os/courses/cs4
Tree 41/lectures/Cla
 Travelling ss25.pdf
Salesman
Problem
An ability to Exhibit Generates Formal Satisfactorily Lecture Handouts Quiz 4 Hours
analyze awareness of languages using Languages can Model a Discussion LCD Projector Take Home Exam
complex Formal the operations  Formal given Class Marker Recitation
problems, and Languages union, Languages problem in Intervention Chalk
identify and concatenation,  Regular terms of the PowerPoint
define the and *-closure; Expressions appropriate Presentatio Suggested
computing and and Regular graph n Readings:
requirements Derive the Languages structure and Brainstormi Schaum’s
appropriate to corresponding can solve ng Outline Series:
its solution regular some graph Discrete
expression for a problems. Mathematics
given regular (3rd ed.)
language.
An ability to Demonstrate Define formally Finite Satisfactorily Lecture Handouts Quiz 4 Hours
analyze knowledge of a given finite Automata can define Discussion LCD Projector Take Home Exam
complex the basic automation; and  Finite formally a Class Marker Recitation
problems, and concepts of Identify the Automata given finite Intervention Chalk
identify and Automata regular  Deterministic automation PowerPoint
define the language finite and can Presentatio Suggested
computing accepted by a automata identify the n Readings:
requirements given finite regular Brainstormi https://www.tut
appropriate to automation. language ng orialspoint.com
its solution accepted by /discrete_math
a given finite ematics/
automation.
Final Lecture 2 Hours
Examination

Total No. of 54 Hours

Hours