0% found this document useful (0 votes)
43 views3 pages

Weekly

The document is a course log template for the Discrete Structures course at Mohi-ud-Din Islamic University in AJ&K, Pakistan. It lists the topics covered in the course over several 1.5 hour class periods, including logic, sets, functions, integers and algorithms, mathematical induction, relations, sequences and summations, graphs, trees, counting principles, and the pigeonhole principle. Evaluation instruments used include a midterm exam. The course is taught by instructor Sabeen Masood.

Uploaded by

jaffar bikat
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
0% found this document useful (0 votes)
43 views3 pages

Weekly

The document is a course log template for the Discrete Structures course at Mohi-ud-Din Islamic University in AJ&K, Pakistan. It lists the topics covered in the course over several 1.5 hour class periods, including logic, sets, functions, integers and algorithms, mathematical induction, relations, sequences and summations, graphs, trees, counting principles, and the pigeonhole principle. Evaluation instruments used include a midterm exam. The course is taught by instructor Sabeen Masood.

Uploaded by

jaffar bikat
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

National Computing Education Accreditation Council

NCEAC

NCEAC.DOC.2015

Course Log Template

INSTITUTION Mohi-ud-Din Islamic University, Nerain Sharif, AJ &K

PROGRAM (S) TO BE
Date Duration Topics Covered Evaluation Signature
Instruments
used

1.5 Hr Logic
Introduction to logic, Propositions, Propositional
Logic, Conditional Statements.
1.5 Hr Converse, Contrapositive and Inverse, Logic and
Bit Operations.
1.5 Hr Propositional Equivalences
Truth tables, Constructing new Logical
Equivalences.
1.5 Hr Predicates
Predicate Logic.
1.5 Hr Quantifiers
Predicate Calculus, Universal Quantifier,
Existential Quantifier, Binding Variables,
Negations, Translating from English into Logical
Expressions.
1.5 Hr Nested Quantifiers, Order of Quantifiers,
Translating Statements involving Nested
Quantifiers.
1.5 Hr Rules of inference
Valid arguments, Proof by Contradiction
1.5 Hr Proof by Contradiction….
Sets and Operations on Sets
Venn Diagram, Power Set, Cartesian Product,
Using Set Notation with Quantifier.
1.5 Hr Union, Intersection, Set identities, Computer
Representation of Sets.
EVALUATED
Course Name Discrete Structures
Catalog Number

Instructor Name
Sabeen Masood

1.5 Hr Functions
Page 1 of 3 NCEAC.DOC.001-E
National Computing Education Accreditation Council
NCEAC

NCEAC.DOC.2015

One to One Functions, Onto Functions,


Bijection, Inverse Functions.
1.5 Hr Compositions of Functions, The Graph of
Functions.
1.5 Hr Mid Term Examination

1.5 Hr Integers and Algorithms


Representations of Integers, Algorithms for
Integer Operations.
1.5 Hr Modular Exponentiation,The Euclidean
Algorithm
1.5 Hr
Mathematical Induction
Introduction, Examples of Proofs by
Mathematical Induction
1.5 Hr Examples of Proofs by Mathematical
Induction…..
1.5 Hr Recursive Definitions
Introduction, Recursively Defined Function
1.5 Hr Relations
Function as relations,Relations on Set.
1.5 Hr Properties of Relation, Combining Relations.
1.5 Hr Sequences and Summations
Arithmetic Progression, Special Integer
Sequences, Geometric Progression.
1.5 Hr Graphs
Graph Terminologies and special types of
graphs.
1.5 Hr Bipartite graph, New Graph from Old
1.5 Hr Graph Coloring
Introduction,Application of Graph Coloring
1.5 Hr Euler and Hamilton Paths
Euler Path and Circuits
1.5 Hr Euler and Hamilton Paths
Hamilton Path and Circuits
1.5 Hr Trees
Trees Introduction,Rooted Tree(m-ary
tree),Ordered Rooted Tree.
1.5 Hr Trees as Model,Properties of Tree….
1.5 Hr Presentations

1.5 Hr Presentations

1.5 Hr Basics of Counting and Pigeonhole Principle


Basic Counting principles,
1.5 Hr The Inclusive-Exclusive Principle,Tree
diagrams.
1.5 Hr
Pigeonhole Principle

Page 2 of 3 NCEAC.DOC.001-E
National Computing Education Accreditation Council
NCEAC

NCEAC.DOC.2015

Instructor Signature

Date

Page 3 of 3 NCEAC.DOC.001-E

You might also like