00 mi piace00 non mi piace

20 visualizzazioni12 pagineJun 07, 2018

© © All Rights Reserved

PDF, TXT o leggi online da Scribd

© All Rights Reserved

20 visualizzazioni

00 mi piace00 non mi piace

© All Rights Reserved

Sei sulla pagina 1di 12

Course Code Course Title Course Planner Lectures Tutorials Practicals Credits

MTH116 MATHEMATICAL FOUNDATION-II 14846::Seema Mishra 3 2 0 5

Course Weightage ATT: 5 CA: 25 MTT: 20 ETT: 50

Exam Category: 13: Mid Term Exam: All MCQ – End Term Exam: MCQ +

Subjective

Course Orientation COMPETITIVE EXAMINATION (Higher Education), KNOWLEDGE ENHANCEMENT, PLACEMENT EXAMINATION

TextBooks ( T )

Sr No Title Author Publisher Name

T-1 DISCRETE MATHEMATICS SEYMOUR LIPSCHUTZ, MCGRAW HILL EDUCATION

(SCHAUM'S OUTLINES) (SIE) MARC LIPSON,

VARSHA H. PATIL

Reference Books ( R )

Sr No Title Author Publisher Name

R-1 DISCRETE MATHEMATICS & ITS KENNETH H ROSEN MCGRAW HILL EDUCATION

APPLICATIONS

Relevant Websites ( RW )

Sr No (Web address) (only if relevant to the course) Salient Features

RW-1 http://world.mathigon.org/Graph_Theory Important application with examples

page=21&part=2

Audio Visual Aids ( AV )

Sr No (AV aids) (only if relevant to the course) Salient Features

AV-1 http://ocw.mit.edu/courses/electrical-engineering-and-computer-science/6-042j- Euler and Hamiltonian Graphs

mathematics-for-computer-science-fall-2010/video-lectures/lecture-10-graph-theory-iii/

An instruction plan is a tentative plan only and a teacher may make some changes in his/her teaching plan. The students are advised to use syllabus for preparation of all examinations. The students are expected to keep themselves

updated on the contemporary issues related to the course. Upto 20% of the questions in any examination/Academic tasks can be asked from such issues even if not explicitly mentioned in the instruction plan.

Weeks before MTE 7

Weeks After MTE 7

Spill Over (Lecture) 7

Week Lecture Broad Topic(Sub Topic) Chapters/Sections of Other Readings, Lecture Description Learning Outcomes Pedagogical Tool Live Examples

Number Number Text/reference Relevant Websites, Demonstration/

books Audio Visual Aids, Case Study /

software and Virtual Images /

Labs animation / ppt

etc. Planned

Week 1 Lecture 1 Functions and Logic T-1 Lecture-1 will be Student will be given PPT for zero

Calculus(Types of Function) Lecture Zero as the information about lecture, Discussion

introduction of course the entire syllabus, its

and Lecture-2 will be applications and

One-one function, Onto various assessment

function and invertible tools through zero

function lecture. student will

learn about different

types

of functions and their

properties

Lecture 2 Functions and Logic T-1 Lecture-1 will be Student will be given PPT for zero

Calculus(Types of Function) Lecture Zero as the information about lecture, Discussion

introduction of course the entire syllabus, its

and Lecture-2 will be applications and

One-one function, Onto various assessment

function and invertible tools through zero

function lecture. student will

learn about different

types

of functions and their

properties

Lecture 3 Functions and Logic T-1 Logic Introduction, Student learn about Discussion Logic gates are

Calculus(Introduction to R-1 Different types of the concept of Logic used to store

logic) propositions. data. These

logic circuits are

known as

computer

memory

Functions and Logic T-1 Logic Introduction, Student learn about Discussion Logic gates are

Calculus(Propositions and R-1 Different types of the concept of Logic used to store

compound propositions) propositions. data. These

logic circuits are

known as

computer

memory

An instruction plan is a tentative plan only and a teacher may make some changes in his/her teaching plan. The students are advised to use syllabus for preparation of all examinations. The students are expected to keep themselves

updated on the contemporary issues related to the course. Upto 20% of the questions in any examination/Academic tasks can be asked from such issues even if not explicitly mentioned in the instruction plan.

Week 2 Lecture 4 Functions and Logic T-1 Discussion on Basic Students will learn a Discussion

Calculus(Basic logical Logical Operations logical connective

operations (Conjunction, (also called a logical

Disjunction, Negation)) operator) which is a

symbol or word used

to connect two or

more sentences

Lecture 5 Functions and Logic T-1 RW-6 Truth Tables of Logical Student will learn the Discussion

Calculus(Propositions and operations truth table of all the

truth tables) logical operations

and Logical

equivalence of

various Statements,

Tautologies and

contradiction.

Functions and Logic T-1 RW-6 Truth Tables of Logical Student will learn the Discussion

Calculus(Tautologies and operations truth table of all the

contradiction) logical operations

and Logical

equivalence of

various Statements,

Tautologies and

contradiction.

Lecture 6 Functions and Logic T-1 RW-6 Logical equivalence of Student will learn Discussion

Calculus(Logical various Statements and when the two

equivalence) Algebra of propositions. statements are

Conditional and logically Equivalent.

Biconditional Also Students learn

Statements. about

laws of the algebra of

propositions.

Functions and Logic T-1 RW-6 Logical equivalence of Student will learn Discussion

Calculus(Conditional and various Statements and when the two

biconditional statements.) Algebra of propositions. statements are

Conditional and logically Equivalent.

Biconditional Also Students learn

Statements. about

laws of the algebra of

propositions.

Week 3 Lecture 7 Logic Gates and Recurrence T-1 Basic Concepts of Logic Students will learn Discussion

Relations(Introduction to R-1 gates about the logic

Logic Gates) circuits

Logic Gates and Recurrence T-1 Basic Concepts of Logic Students will learn Discussion

Relations(Combinations of R-1 gates about the logic

Gates) circuits

An instruction plan is a tentative plan only and a teacher may make some changes in his/her teaching plan. The students are advised to use syllabus for preparation of all examinations. The students are expected to keep themselves

updated on the contemporary issues related to the course. Upto 20% of the questions in any examination/Academic tasks can be asked from such issues even if not explicitly mentioned in the instruction plan.

Week 3 Lecture 8 Logic Gates and Recurrence T-1 Formation of Logic Student will learn Discussion

Relations(Implementation of R-1 Expressions with logic about the Expressions

Logic Expressions with gates with logic gates

Logic Gates and Switching

circuits)

Lecture 9 Logic Gates and Recurrence T-1 RW-7 Recurrence Relations, Students will learn Discussion Fibonacci

Relations(Introduction to R-1 Recursion. recurrence relations numbers which

Recursion) which are useful in are best suited

counting, also they example of

will learn recurrence

recursive definition, relations are

how to find new used to model

terms from existing population

terms.

Logic Gates and Recurrence T-1 RW-7 Recurrence Relations, Students will learn Discussion Fibonacci

Relations(Recurrence R-1 Recursion. recurrence relations numbers which

Relation) which are useful in are best suited

counting, also they example of

will learn recurrence

recursive definition, relations are

how to find new used to model

terms from existing population

terms.

Week 4 Lecture 10 Test 1

Lecture 11 Logic Gates and Recurrence T-1 RW-7 Solving Recurrence Student will learn to Discussion

Relations(Solving Relation and Linear find an explicit

Recurrence Relation) Homogenous Relation function f(n) for a

and solution of this function for solving

recurrence relation relation and about the

methods for solving

linear homogeneous

Recurrence relation.

Logic Gates and Recurrence T-1 RW-7 Solving Recurrence Student will learn to Discussion

Relations(Linear Relation and Linear find an explicit

Homogenous Recurrence Homogenous Relation function f(n) for a

Relation with constant and solution of this function for solving

coefficient and their recurrence relation relation and about the

solution.) methods for solving

linear homogeneous

Recurrence relation.

Lecture 12 Graph Theory(Introduction T-1 RW-2 Introduction to graphs Student learn graphs Discussion

and Basic terminology) R-1 and trees. Basic terms and trees which

with their definitions appear in many areas

and terminology will be of mathematics and

discussed. computer science.

An instruction plan is a tentative plan only and a teacher may make some changes in his/her teaching plan. The students are advised to use syllabus for preparation of all examinations. The students are expected to keep themselves

updated on the contemporary issues related to the course. Upto 20% of the questions in any examination/Academic tasks can be asked from such issues even if not explicitly mentioned in the instruction plan.

Week 4 Lecture 12 Graph Theory(Graphs, T-1 RW-2 Introduction to graphs Student learn graphs Discussion

Multigraphs, Degree of a R-1 and trees. Basic terms and trees which

vertex) with their definitions appear in many areas

and terminology will be of mathematics and

discussed. computer science.

Week 5 Lecture 13 Graph Theory(Handshaking T-1 Hand shaking theorem The student will learn Brainstorming and

theorem, Sub graphs) R-1 and sub -graphs of a to apply hand- Discussion

graph will be discussed. shaking lemma in

various practical

problems.

Lecture 14 Graph Theory T-1 Lecture 14- Student will learn Discussion Generation of

(Homeomorphic and R-1 Homeomorphic Homeomorphic molecular

Isomorphic graphs) Graphs and Lecture 15- Graphs, Isomorphic graphs for

Isomorphic graphs and will learn computer

graphs and Lecture 16- the important synthesis

Important relationship between

relationship between graphs.

graphs.

Lecture 15 Graph Theory T-1 Lecture 14- Student will learn Discussion Generation of

(Homeomorphic and R-1 Homeomorphic Homeomorphic molecular

Isomorphic graphs) Graphs and Lecture 15- Graphs, Isomorphic graphs for

Isomorphic graphs and will learn computer

graphs and Lecture 16- the important synthesis

Important relationship between

relationship between graphs.

graphs.

Week 6 Lecture 16 Test 2

Lecture 17 Graph Theory(Paths, T-1 Lecture 17- Introduction Student will learn the Discussion

Connectivity, Connected R-1 of paths and in Lecture connected graphs and

Components) 18- connectivity in how to find

graph will be discussed. connected component

of a graph.

Lecture 18 Graph Theory(Paths, T-1 Lecture 17- Introduction Student will learn the Discussion

Connectivity, Connected R-1 of paths and in Lecture connected graphs and

Components) 18- connectivity in how to find

graph will be discussed. connected component

of a graph.

Week 7 Lecture 19 Graph Theory(Distance and T-1 Distance,diameter cut- Students will learn to Discussion

Diameter, Cut points and R-1 points and bridges will find the distance

bridges) be discussed for a between two vertices

connected graph. for a connected graph

and will also solve

the practical

problems based on

this concept.

SPILL OVER

Week 7 Lecture 20 Spill Over

An instruction plan is a tentative plan only and a teacher may make some changes in his/her teaching plan. The students are advised to use syllabus for preparation of all examinations. The students are expected to keep themselves

updated on the contemporary issues related to the course. Upto 20% of the questions in any examination/Academic tasks can be asked from such issues even if not explicitly mentioned in the instruction plan.

Week 7 Lecture 21 Spill Over

MID-TERM

Week 8 Lecture 22 Euler Graphs(Eulerian T-1 AV-1 Lecture 22- Basic Student learn how to Discussion

Graphs) R-1 concepts of Euler paths, construct an Euler

circuits, Euler graphs, circuit and how to

Lecture 23- Euler identify euler graphs

Theorem and practice

questions on the

same.

Euler Graphs(Euler theorem) T-1 AV-1 Lecture 22- Basic Student learn how to Discussion

R-1 concepts of Euler paths, construct an Euler

circuits, Euler graphs, circuit and how to

Lecture 23- Euler identify euler graphs

Theorem and practice

questions on the

same.

Lecture 23 Euler Graphs(Eulerian T-1 AV-1 Lecture 22- Basic Student learn how to Discussion

Graphs) R-1 concepts of Euler paths, construct an Euler

circuits, Euler graphs, circuit and how to

Lecture 23- Euler identify euler graphs

Theorem and practice

questions on the

same.

Euler Graphs(Euler theorem) T-1 AV-1 Lecture 22- Basic Student learn how to Discussion

R-1 concepts of Euler paths, construct an Euler

circuits, Euler graphs, circuit and how to

Lecture 23- Euler identify euler graphs

Theorem and practice

questions on the

same.

Lecture 24 Euler Graphs(Hamiltonian T-1 AV-1 Basic concepts of Student will learn Discussion

Graphs) R-1 Hamilton paths and hamiltonian graphs

circuits.

Week 9 Lecture 25 Euler Graphs(Complete, T-1 RW-1 Basic idea of complete, Student will learn Discussion

Regular and Bipartite R-1 regular,bipartite, labeled different types of

Graphs) and weighted graphs graphs and relation

between them

Lecture 26 Euler Graphs(Planar Graphs) T-1 Basic idea of Planar Student will learn a Discussion

R-1 representation of graphs, new representation of

Maps and regions. Euler graphs known as

formula and results planar which divide

related to planar the

graphs will be graphs into regions

discussed.

An instruction plan is a tentative plan only and a teacher may make some changes in his/her teaching plan. The students are advised to use syllabus for preparation of all examinations. The students are expected to keep themselves

updated on the contemporary issues related to the course. Upto 20% of the questions in any examination/Academic tasks can be asked from such issues even if not explicitly mentioned in the instruction plan.

Week 9 Lecture 26 Euler Graphs(Maps, T-1 Basic idea of Planar Student will learn a Discussion

Regions) R-1 representation of graphs, new representation of

Maps and regions. Euler graphs known as

formula and results planar which divide

related to planar the

graphs will be graphs into regions

discussed.

Euler Graphs(Euler T-1 Basic idea of Planar Student will learn a Discussion

Formula) R-1 representation of graphs, new representation of

Maps and regions. Euler graphs known as

formula and results planar which divide

related to planar the

graphs will be graphs into regions

discussed.

Lecture 27 Euler Graphs(Non planar T-1 Non Planar Graphs and Student will learn Discussion

graphs) R-1 Kuratowski Theorem about the non planar

graphs

Euler Graphs(Kuratowski's T-1 Non Planar Graphs and Student will learn Discussion

Theorem (without proof).) R-1 Kuratowski Theorem about the non planar

graphs

Week 10 Lecture 28 Graph Coloring and Shortest T-1 RW-3 Introduction to graph Student will learn to Discussion

Paths(Graph Coloring) R-1 Coloring solve the coloring

problem of maps of

regions

Lecture 29 Graph Coloring and Shortest T-1 RW-3 Chromatic number of Student will learn the Discussion

Paths(Chromatic Number of R-1 various graphs chromatic number of

a Graph) complete, regular and

bipartite graphs

Lecture 30 Graph Coloring and Shortest T-1 Basic concepts of student learn the Discussion

Paths(Labelled and R-1 labeled and weighted graphs with weights

Weighted Graph) graphs that leads to find the

shortest paths

Week 11 Lecture 31 Graph Coloring and Shortest T-1 Basic concept of Student will relate it Discussion

Paths(Shortest Path in R-1 shortest path problems to real life situations

weighted Graphs) in weighted graphs

Lecture 32 Graph Coloring and Shortest T-1 RW-5 Discuss the Dijkstra Student will learn the Discussion

Paths(Dijkstra’s Algorithm R-1 Algorithm to find the concept to solve the

to find shortest path) shortest path of the problems related to

weighted graph shortest path and will

practice

the applications of

the algorithm in

weighted graphs like

assigning flight time

to edges.

Lecture 33 Test 3

An instruction plan is a tentative plan only and a teacher may make some changes in his/her teaching plan. The students are advised to use syllabus for preparation of all examinations. The students are expected to keep themselves

updated on the contemporary issues related to the course. Upto 20% of the questions in any examination/Academic tasks can be asked from such issues even if not explicitly mentioned in the instruction plan.

Week 12 Lecture 34 Trees(Introduction to Tree) T-1 Introduction to tree Student will learn Discussion PDF is a tree

R-1 graphs how graphs can be based format. It

used to model and has a root node

solve many problems followed by a

catalog node

followed by a

pages node

which has

several child

page nodes

Lecture 35 Trees(Rooted Tree, Binary R-1 Types of trees Rooted Student will learn the Discussion

Tree) and binary tree important types of

trees

Lecture 36 Trees(Spanning Tree, T-1 Spanning Trees and student will learn to Discussion

Minimum Spanning Tree) problems related to solve spanning trees

Minimum Spanning problems like road

Trees systems

Week 13 Lecture 37 Trees(Kruskal and Prims T-1 RW-4 Minimum Spanning LECTURE 37- Discussion

Algorithms to find minimum R-1 Trees Problems Student will learn the

spanning tree) algorithm of

Kruskal's method.

LECTURE 38-

Students will solve

the applied form of

questions on

minimum

spanning trees by

using kruskal

Algorithms.

LECTURE 39 -

Students will learn

the algorithm of

Prim's Algorithm.

LECTURE 40 -

Students will solve

the problems related

in finding the shortest

path in real life

problems

An instruction plan is a tentative plan only and a teacher may make some changes in his/her teaching plan. The students are advised to use syllabus for preparation of all examinations. The students are expected to keep themselves

updated on the contemporary issues related to the course. Upto 20% of the questions in any examination/Academic tasks can be asked from such issues even if not explicitly mentioned in the instruction plan.

Week 13 Lecture 38 Trees(Kruskal and Prims T-1 RW-4 Minimum Spanning LECTURE 37- Discussion

Algorithms to find minimum R-1 Trees Problems Student will learn the

spanning tree) algorithm of

Kruskal's method.

LECTURE 38-

Students will solve

the applied form of

questions on

minimum

spanning trees by

using kruskal

Algorithms.

LECTURE 39 -

Students will learn

the algorithm of

Prim's Algorithm.

LECTURE 40 -

Students will solve

the problems related

in finding the shortest

path in real life

problems

Lecture 39 Trees(Kruskal and Prims T-1 RW-4 Minimum Spanning LECTURE 37- Discussion

Algorithms to find minimum R-1 Trees Problems Student will learn the

spanning tree) algorithm of

Kruskal's method.

LECTURE 38-

Students will solve

the applied form of

questions on

minimum

spanning trees by

using kruskal

Algorithms.

LECTURE 39 -

Students will learn

the algorithm of

Prim's Algorithm.

LECTURE 40 -

Students will solve

the problems related

in finding the shortest

path in real life

problems

An instruction plan is a tentative plan only and a teacher may make some changes in his/her teaching plan. The students are advised to use syllabus for preparation of all examinations. The students are expected to keep themselves

updated on the contemporary issues related to the course. Upto 20% of the questions in any examination/Academic tasks can be asked from such issues even if not explicitly mentioned in the instruction plan.

Week 14 Lecture 40 Trees(Kruskal and Prims T-1 RW-4 Minimum Spanning LECTURE 37- Discussion

Algorithms to find minimum R-1 Trees Problems Student will learn the

spanning tree) algorithm of

Kruskal's method.

LECTURE 38-

Students will solve

the applied form of

questions on

minimum

spanning trees by

using kruskal

Algorithms.

LECTURE 39 -

Students will learn

the algorithm of

Prim's Algorithm.

LECTURE 40 -

Students will solve

the problems related

in finding the shortest

path in real life

problems

SPILL OVER

Week 14 Lecture 41 Spill Over

Lecture 42 Spill Over

Week 15 Lecture 43 Spill Over

Lecture 44 Spill Over

Lecture 45 Spill Over

Component Weightage

Test 50

Test 50

Test 50

An instruction plan is a tentative plan only and a teacher may make some changes in his/her teaching plan. The students are advised to use syllabus for preparation of all examinations. The students are expected to keep themselves

updated on the contemporary issues related to the course. Upto 20% of the questions in any examination/Academic tasks can be asked from such issues even if not explicitly mentioned in the instruction plan.

Academic Task Objective Detail of Academic Task Nature of Academic Academic Task Marks Allottment /

Task Mode submission

(group/individuals) Week

Test 1 To check the Test will be of 30 marks and questions will be in multiple of 5 Individual Offline 30 2 / 3

understanding of Marks

students about the Topics::Types of Function, Introduction to logic, Propositions

basics of functions and

and logic Compound propositions, Basic logical operations

operations (Conjunction,Disjunction, Negation), Propositions and truth

tables, Tautologies and contradiction,Logical equivalence,

Conditional and biconditional statements.

Test 2 To check the Test will be of 30 marks and questions will be in multiple of 5 Individual Offline 30 5 / 6

understanding of Marks

students about the Topics::Introduction to Logic Gates,Combinations of Gates,

logic gates and Implementation of Logic Expressions with Logic Gates and

recurrence relation Switching circuits, Introduction to Recursion, Recurrence

Relation, Solving Recurrence Relation, Linear Homogeneous

Recurrence Relation with constant coefficient and their

solution.

Test 3 To check the Test will be of 30 marks and questions will be in multiple of 5 Individual Online 30 11 / 12

understanding of Marks

students about the Topics:: Eulerian Graphs, Hamiltonian Graphs, Euler

graphs and graph theorem,

coloring Complete, Regular and Bipartite Graphs, Planar Graphs,

Maps, Regions, Euler Formula, Non planar graphs,

Kuratowski's Theorem

(without proof).Graph Coloring, Chromatic Number of a

Graph,

Labelled and Weighted Graph, Shortest Path in weighted

Graphs,

Dijkstra Algorithm to find shortest path

Plan for Tutorial: (Please do not use these time slots for syllabus coverage)

Tutorial No. Lecture Topic Type of pedagogical tool(s) planned

(case analysis,problem solving test,role play,business game etc)

Tutorial2 Introduction to logic, Propositions and compound propositions Problem Solving

Tutorial3 Basic logical operations (Conjunction, Disjunction, Negation), Problem Solving

Propositions and truth tables)

Tutorial4 Tautologies and contradiction, Logical equivalence, Conditional and Problem Solving

biconditional statements

Tutorial5 Introduction to Logic Gates, Combinations of Gates Problem Solving

An instruction plan is a tentative plan only and a teacher may make some changes in his/her teaching plan. The students are advised to use syllabus for preparation of all examinations. The students are expected to keep themselves

updated on the contemporary issues related to the course. Upto 20% of the questions in any examination/Academic tasks can be asked from such issues even if not explicitly mentioned in the instruction plan.

Tutorial6 Implementation of Logic Expressions with Logic Gates and Problem Solving

Switching circuits

Tutorial7 Implementation of Logic Expressions with Logic Gates and Problem Solving

Switching circuits

Tutorial8 Introduction to Recursion, Recurrence Relation, Solving Problem Solving

Recurrence Relation,

Tutorial9 Linear Homogenous Recurrence Relation with constant coefficient Problem Solving

and their solution

Tutorial10 Introduction and Basic terminology, Graphs, Multigraphs, Degree of Problem Solving

a vertex

Tutorial11 Handshaking theorem, Sub graphs Problem Solving

Tutorial12 Homeomorphic and Isomorphic graphs Problem Solving

Tutorial13 Paths, Connectivity, Connected Components Problem Solving

Tutorial14 Distance and Diameter, Cut points and bridges Problem Solving

After Mid-Term

Tutorial15 Eulerian Graphs, Hamiltonian Graphs Problem Solving

Tutorial16 Euler theorem, Complete, Regular and Bipartite Graphs, Problem Solving

Tutorial17 Planar Graphs, Maps, Regions, Euler Formula, Non planar graphs, Problem Solving

Kuratowski's Theorem (without proof).

Tutorial18 Graph Coloring, Chromatic Number of a Graph Problem Solving

Tutorial19 Labelled and Weighted Graph Problem Solving

Tutorial20 Shortest Path in weighted Graphs Problem Solving

Tutorial21 Dijkstra’s Algorithm to find shortest path Problem Solving

Tutorial22 Dijkstra’s Algorithm to find shortest path Problem Solving

Tutorial23 Introduction to Tree Problem Solving

Tutorial24 Rooted Tree, Binary Tree Problem Solving

Tutorial25 Spanning Tree, Minimum Spanning Tree Problem Solving

Tutorial26 Kruskal and Prims Algorithms to find minimum spanning tree Problem Solving

Tutorial27 Kruskal and Prims Algorithms to find minimum spanning tree Problem Solving

Tutorial28 Kruskal and Prims Algorithms to find minimum spanning tree Problem Solving

An instruction plan is a tentative plan only and a teacher may make some changes in his/her teaching plan. The students are advised to use syllabus for preparation of all examinations. The students are expected to keep themselves

updated on the contemporary issues related to the course. Upto 20% of the questions in any examination/Academic tasks can be asked from such issues even if not explicitly mentioned in the instruction plan.

## Molto più che documenti.

Scopri tutto ciò che Scribd ha da offrire, inclusi libri e audiolibri dei maggiori editori.

Annulla in qualsiasi momento.