10 views

Uploaded by arjit7890

instruction plan

instruction plan

© All Rights Reserved

- 4. Thinking Strategically About Thinking Strategically
- r5311301 Operations Research
- Data Structure Notes
- Data Structure
- 26345
- Algorithms
- Games, Puzzles, and Computation
- MS CS Curriculum
- TA1
- Unit 1final(1)
- The all power
- chap2.pdf
- Analysis[1]
- MIT6_006F11_ps1
- DAA Assignment Rashmi (1)
- All
- 25 OperationalSolution.pdf
- C intrroduction
- 2_marksunitI
- Lect 01

You are on page 1of 8

Course Code

Course Title

Course Planner

Lectures

CSE408

Course Category

3.0

TextBooks

Sr No

Title

Author

Edition

Year

Publisher Name

T-1

Analysis of Algorithm

Anany Levitin

2nd

2003

Pearson Education

Edition

Year

Publisher Name

Reference Books

Sr No

Title

Author

R-1

Introduction to Algorithms

and C. Stein

2007

R-2

Computer Algorithms

and J.D.Ullman

2nd

2007

Pearson Education

R-3

to Design and Analysis

Gelder

2nd

2006

Pearson Education

R-4

Fundamentals of Computer

Algorithms

Horowitz, S. Sahni

2nd

2005

Galgotia Publishers

Other Reading

Sr No

OR-1

OR-2

OR-3

OR-4

http://www.csc.villanova.edu/~map/8301/lec03.pdf ,

Relevant Websites

Sr No

Salient Features

RW-1

http://courses.ncsu.edu/ma103/common/media/05/MA103Lct25.mp4

RW-2

http://optlab-server.sce.carleton.ca/POAnimations2007/DijkstrasAlgo.html

RW-3

http://www.cse.yorku.ca/~aaw/Zambito/TSP_L/Web/TSPStart.html

RW-4

http://www.wiwi.uni-jena.de/entscheidung/binpp/

RW-5

http://www.cs.sunysb.edu/~algorith/files/dfs-bfs.shtml

Connected Components

RW-6

http://mathworld.wolfram.com/VoronoiDiagram.html

Voronoi Diagram

0.0

0.0

3.0

RW-7

http://math.mit.edu/~stevenj/18.335/optimization-handout.pdf

Optimization Problems

Weeks before MTE

Spill Over

Week

Number

Lecture

Number

Week 1

Lecture 1

Foundations of Algorithm

(Algorithms)

T-1:Chapter 1

(1.1;1.2)

OR-3

Introduction of

algorithms

need of algorithm

demonstrations

Foundations of Algorithm

(Fundamentals of Algorithmic

Problem Solving:)

T-1:Chapter 1

(1.1;1.2)

OR-3

Basics of algorithms

Would be knowing

about fundamentals of

algorithms

Foundations of Algorithm(Basic

Algorithm Design Techniques)

T-1:Chapter 1

(1.1;1.2)

OR-3

different design

Would be knowing

techniques of algorithms. how to use design

techniques

lecture cum

demonstration

Foundations of Algorithm

(Analyzing Algorithm)

T-1:Chapter 1

(1.1;1.2)

OR-3

Different types of

analysis

Would be knowing

how to analyze the

algorithm

Lecture cum

demonstrations

structure is important to demonstrations

design an

Algorithm

Lecture 2

Lecture 3

Chapters/Sections

of Text/reference

books

Relevant

Websites, Audio

Visual Aids,

software and

Virtual Labs

Learning Outcomes

Pedagogical Tool

Demonstration/ Case

Study / Images /

animation / ppt etc.

Planned

Lecture cum

demonstrations

Foundations of Algorithm

(Fundamental Data Structure:)

T-1:Chapter 1(1.4)

Description of Data

structure

Foundations of Algorithm(Linear

Data Structure)

T-1:Chapter 1(1.4)

Description of arrays

Students learn how

Lecture cum

linked list stack and ques linear data

demonstration

structure is important to

design an

Algorithm

Foundations of Algorithm(Graphs

and Trees)

T-1:Chapter 1(1.4)

Description of Non

linear Data

structure

linear data

demonstrations

structure is important to

design an

Algorithm

Foundations of Algorithm

(Fundamentals of the Analysis of

Algorithm Efficiency:)

T-1:Chapter 2(2.1)

concepts

of complexities of

algorithms

efficiency of algorithm demonstrations

Week 1

Week 2

Lecture 3

sets

to measure the input

demonstrations

size

Different notations to

measure running time

How to

Lecture cum

measure size,Measuring demonstrations

Running

Time

Growth)

for any algorithm

order of growth for

given algorithm

T-1:Chapter 2(2.1)

Different time

complexities

would be knowing

Lecture cum

difference between

demonstrations

worst best and average

case

Foundations of Algorithm

(Asymptotic Notations and Basic

Efficiency Classes:)

T-1:Chapter 2(2.2)

complexities

to represent time

demonstrations

complexities for any

algorithm

Big-theta notation)

T-1:Chapter 2(2.2)

Different notations to

represent the

complexities

to use O,Big omega,Big demonstrations

theta

Foundations of Algorithm(Useful

Property Involving the Asymptotic

Notations)

T-1:Chapter 2(2.2)

Description of Property

Involving the

Asymptotic Notations

Would be knowing

Property Involving the

Asymptotic Notations

Lecture cum

demonstrations

Foundations of Algorithm(Using

Limits for Comparing Orders of

Growth)

T-1:Chapter 2(2.2)

Significance of limits to

compare orders of

growth

Would be knowing

the property in limits

Lecture cum

demonstrations

Computational Geometry(Naiva

String-Matching Algorithm)

R-1:Chapter 32

text

search pattern from

given text

Lecture cum

demonstrations

Computational Geometry(RabinKarp Algorithm)

R-1:Chapter 32

text

search pattern from

given text

Lecture cum

demonstrations

Lecture 6

Computational Geometry(KnuthMorris-Pratt Algorithm)

R-1:Chapter 32

text

search pattern from

given text

Lecture cum

demonstrations

Lecture 7

Computational Geometry

(Sequential Search and BruteForce String Matching)

text with brute force

technique

from given text

Problem Solving

Computational Geometry(ClosestPair and Convex-Hull Problem)

convex hull

to find two closest pairs Solving

and convex hull

Computational Geometry

(Exhaustive Search)

T-1:Chapter 3(3.4)

given text.

How to do exhaustive

search

Lecture 4

Lecture 5

Week 3

Lecture 8

Foundations of Algorithm

(Measuring of Input Size)

T-1:Chapter 2(2.1)

Foundations of Algorithm(Units

for Measuring Running Time)

T-1:Chapter 2(2.1)

OR-3

RW-6

Lecture cum

demonstration

Numerical Problem

Solving

Week 3

Lecture 8

Computational Geometry(Voronoi

Diagrams)

T-1:Chapter 3(3.4)

Lecture 9

Week 4

Week 5

Week 6

Description of Voronoi

Diagrams

Voronoi Diagrams is

useful

Slides

Test1

Lecture 10

Statistics(Merge Sort and Quick

Sort)

Lecture 11

Statistics(Binary Search)

Statistics(Multiplication of Large

Integers)

Lecture 12

RW-6

Different sorting

techniques

method to sort the given Solving

list by using different

methods

T-1:Chapter 4

(4.3;4.5)

To search an element in

logn time

can search an element Solving

in logn time with partial

divide and conquer.

T-1:Chapter 4

(4.3;4.5)

and Conquer and Order can multiply large

Statistics techniques

integers

Numerical Problem

Solving

Numerical problem

solving

Statistics(Strassen's Matrix

Multiplication)

T-1:Chapter 4(4.5)

R-1:Chapter 4

complexity from n^3 to

n^2.7

to reduce the time

complexity with

strassen's matrix

multiplication

Statistics(Substitution Method for

Solving Recurrences)

T-1:Chapter 4(4.5)

R-1:Chapter 4

complexities for

recurrence algorithm

Numerical problem

significance of

solving

substitution method and

how to find the time

complexity

Statistics(Recursion-Tree Method

for Solving Recurrences)

T-1:Chapter 4(4.5)

R-1:Chapter 4

complexities for

recurrence algorithms

Numerical problem

significance of

solving

recurrence tree method

and how to find time

complexity.

Lecture 13

Statistics(Master Method for

Solving Recurrence)

R-1:Chapter 4

complexities for divide

and conquer recurrence

algorithms

of Master Method

Lecture 14

Statistics(Closest-Pair and

Convex-Hull Problems by Divide

and Conquer)

Description of Closest

Pair and Convex Hull

Problems by Divide and

Conquer

find Closest

demonstrations

Pair and Convex Hull

from given set of points

Lecture 15

Statistics(Decrease and Conquer:

Insertion Sort)

elements

to sort the given

demonstrations

elements in linear time.

Lecture 16

Statistics(Depth-First Search and

Breadth-First Search)

T-1:Chapter 5(5.2)

Description of Depth

Student learn different

First Search and Breadth searching technique

First Search

Numerical Problem

Solving

Numerical Problem

Solving

Week 6

Lecture 17

Statistics(Connected Components)

T-1:Chapter 5(5.3)

Description of

Connected

Components,Topological

Sort

Would be knowing

Lecture cum

Connected

demonstrations

Components,Would be

learning the

method to sort the given

list by using different

methods

Statistics(Topological Sort)

T-1:Chapter 5(5.3)

Topological order

Would be knowing

Lecture cum

learning the

demonstrations

method to sort the given

list by using different

methods

Lecture 18

Week 7

Lecture 19

Lecture 20

Lecture 21

Test2

Divide and Conquer and Order

Statistics(Transform and Conquer:

Presorting)

T-1:Chapter 6

(6.16.3)

Application of sorting

sorting

demonstrations

Statistics(Balanced Search Trees)

T-1:Chapter 6

(6.16.3)

Search Trees

technique

demonstrations

Statistics(Minimum and

Maximum)

T-1:7.1 and 31

R-1:Chapter 9

maximum value from

get min and max value

given list

from the given list.

Numerical Problem

Solving

Statistics(Counting Sort, Radix

Sort, Bucket Sort)

T-1:7.1 and 31

R-1:Chapter 9

Different sorting

techniques

Would be learn

different

methods to sort the

given

list by using different

methods

Numerical Problem

Solving

Statistics(Selection Sort and

Bubble Sort)

T-1:7.1 and 31

R-1:Chapter 9

Different sorting

techniques

Would be learn

different

methods to sort the

given

list by using different

methods

Numerical Problem

Solving

Statistics(Heaps and Heapsort)

use of heap to sort the

elements

Lecture cum

demonstration

Statistics(Hashing)

order of one time

to search an element in demonstration

order of one time

MID-TERM

Week 8

Lecture 22

Greedy Techniques(Dynamic

Programming: Computing a

Binomial Coefficient)

T-1:Chapter 8(8.1

and 8.2)

To compute binomial

coefficient using

dynamic programming

Numerical Problem

dynamic programming Solving

to find binomial

coefficients.

Week 8

Week 9

Lecture 22

Greedy Techniques(Warshall's and

Floyd's Algorithm)

T-1:Chapter 8(8.1

and 8.2)

Numerical Problem

between all pairs of the find all pairs shortest

Solving

vertices

path using dynamic

programming approach

Lecture 23

Greedy Techniques(Optimal

Binary Search Trees)

T-1:Chapter 8(8.3

and 8.4)

to find optimal binary

search tree

Greedy Techniques(Knapsack

Problem and Memory Functions)

T-1:Chapter 8(8.3

and 8.4)

fill knapsack with items demonstrations

Lecture 24

Greedy Techniques(Matrix-Chain

Multiplication)

R-1:Chapter 15

MCM to multiply two

matrices

Lecture 25

Greedy Techniques(Longest

Common Subsequence)

R-1:Chapter 15

sub sequence from two to get CSS from two

Solving

lists

lists.

Lecture 26

Greedy Techniques(Greedy

Technique and Graph Algorithm:

Minimum Spanning Trees)

T-1:Chapter 9(9.1

9.2 )

R-1:Chapter 23

Greedy Techniques(Prim's

Algorithm)

T-1:Chapter 9(9.1

9.2 )

R-1:Chapter 23

Greedy Techniques(Kruskal's

Algorithm)

Lecture 27

Week 10

Lecture cum

demonstrations

Numerical Problem

Solving

Different type of

techniques to find out

Minimum Spanning

Trees

find out Minimum

Spanning Trees

Lecture cum

demonstrations

RW-1

Different type of

techniques to find out

Minimum Spanning

Trees

find out Minimum

Spanning Trees

Lecture cum

demonstrations

T-1:Chapter 9(9.1

9.2 )

R-1:Chapter 23

RW-1

Different type of

techniques to find out

Minimum Spanning

Trees

find out Minimum

Spanning Trees

Lecture cum

demonstrations

Greedy Techniques(Dijkstra's

Algorithm)

T-1:Chapter 9(9.3

9.4)

RW-2

shortest path

find out shortest path

Numerical Problem

Solving

Greedy Techniques(Huffman

Code)

T-1:Chapter 9(9.3

9.4)

encryption

find coding according

to huffman

Numerical Problem

Solving

Lecture cum

demonstrations

Lecture 28

Greedy Techniques(Single-Source

Shortest Paths)

R-1:Chapter 24

Source Shortest Paths

Problems may be

covered in one lecture

contingency of one

lecture

Source Shortest Paths

problems

Lecture 29

Greedy Techniques(All-Pairs

Shortest Paths)

R-1:Chapter 25

Pairs Shortest Paths

Problem

Shortest Paths problems demonstrations

Lecture 30

Greedy Techniques(Iterative

Improvement: The MaximumFlow Problem)

T-1:Chapter 10(10.2)

Description of The

Students learn Iterative Numerical Problem

Maximum Flow Problem Improvement

Solving

Week 11

Week 12

Week 13

Lecture 31

T-1:Chapter 11(11.1)

Greedy Techniques(Limitations of

Algorithm Power: Lower-Bound

Theory)

Description of Lower

Bound Theory

Learn Limitations of

Algorithm Power

Lecture 32

Algorithms(Backtracking: nQueens Problem)

T-1:Chapter 12(12.1)

Description of

Backtracking problems

Would be knowing

Numerical Problem

Backtracking technique Solving

Lecture 33

Algorithms(Hamiltonian Circuit

Problem)

T-1:Chapter 12(12.1)

To find Hamiltonian

circuit

find

Hamiltonian Circuit

Algorithms(Subset-Sum Problem)

T-1:Chapter 12(12.1)

given set

Students learn

Numerical Problem

how to find subset from Solving

given subset eloquent

with sum

Lecture 34

Numerical Problem

Solving

Test3

Lecture 35

Algorithms(Branch-and-Bound:

Assignment Problem)

T-1:Chapter 12(12.2)

workers

Lecture 36

Algorithms(Knapsack Problem)

T-1:Chapter 12(12.2)

items in knapsack to get profit after placing

max profit

items.

Lecture cum

demonstrations

Lecture 37

Algorithms(Traveling Salesman

Problem)

T-1:Chapter 12(12.2)

R-1:Chapter 35

ones

Numerical Problem

Solving

Algorithms(Vertex-Cover Problem

R-1:Chapter 35

and Set-Covering Problem)

Week 14

Slides

Lecture 38

Algorithms(Bin Packing Problems)

Lecture 39

Complexity Classes(Number

Theory Problems: Modular

Arithmetic)

R-1:Chapter 31

Lecture 40

Complexity Classes(Chinese

Remainder Theorem)

R-1:Chapter 31

Lecture 41

Complexity Classes(Greatest

Common Divisor)

R-1:Chapter 31

Complexity Classes(Optimization

Problems)

R-1:Chapter 31

jobs to workers in

demonstrations

optimal time

find optimal value to

traverse all the cities

given graph

cover all the edges with Solving

given vertices

RW-4

with bins

how to pack different

sizes with Bins

Numerical Problem

Solving

Description of Modular

Arithmetic

Number Theory

Problems

Chinese Remainder

Students learn how to

Theorem may be covered get modules values

from Chinese

in one lecture

Remainder Theorem

contingency of one

lecture

Lecture cum

demonstrations

RW-7

Greatest Common

Divisor

GCD

Lecture cum

demonstrations

RW-7

get optimization

problem

Lecture cum

demonstrations

Week 14

Lecture 42

Complexity Classes(Basic

R-1:Chapter 34

Concepts of Complexity ClassesP, NP, NP-hard, NP-complete

Problems)

OR-1

Basic Concepts of

Complexity Classes

of algorithms

demonstrations

SPILL OVER

Week 15

Lecture 43

Spill Over

Lecture 44

Spill Over

Lecture 45

Spill Over

Component

Frequency

Test

Out Of

2

3

Total :-

10

20

10

20

AT No.

Objective

(group/individuals/field

work

Evaluation Mode

Allottment /

submission Week

Test1

To test the

Test 1 - will be covering syllabus from lecture 1 to lecture 8

understanding level

of the students for

topics covered as

mentioned in the

detail.

Individual

Step by step

evaluation of

attempted questions.

2/3

Test2

To test the

Test 2 - will be covering syllabus from lecture 10 to lecture 17

understanding level

of the students for

topics covered as

mentioned in the

detail.

Individual

Step by step

evaluation of

attempted questions.

5/6

Test3

To test the

Test 3 - will be covering syllabus from lecture 22 to lecture 33

understanding level

of the students for

topics covered as

mentioned in the

detail.

Individual

Step by step

evaluation of

attempted questions.

11 / 12

- 4. Thinking Strategically About Thinking StrategicallyUploaded byamiraslam2k
- r5311301 Operations ResearchUploaded bySneha
- Data Structure NotesUploaded byRamneet Parmar
- Data StructureUploaded byPrerak Dedhia
- 26345Uploaded byAdamo Ghirardelli
- AlgorithmsUploaded byPetreanu Roxana
- Games, Puzzles, and ComputationUploaded byJames Matthew Miraflor
- MS CS CurriculumUploaded bypeter524
- TA1Uploaded byRohit Gputa
- Unit 1final(1)Uploaded byrammar147
- The all powerUploaded byVansham Aggarwal
- chap2.pdfUploaded byPranalistia Tiara Putri
- Analysis[1]Uploaded byMohammad Gulam Ahamad
- MIT6_006F11_ps1Uploaded byYe Qian
- DAA Assignment Rashmi (1)Uploaded bykumariamrita
- AllUploaded byUNETI
- 25 OperationalSolution.pdfUploaded byIJAERS JOURNAL
- C intrroductionUploaded byanusanrd
- 2_marksunitIUploaded byMaalavica Ramakrishnan
- Lect 01Uploaded byPooja Kuni
- Lab_Sheet_7 (1)Uploaded byShantanu Mishra
- ArticleUploaded byimbenzene
- Global and Local AlignmentsUploaded bySai Sridhar
- Complexity in LinguisticsUploaded byOnin
- C ++Uploaded byDrum Code
- icml09_dasgupta_langford_actl.pdfUploaded byAjeet_1991
- Computing Iceberg Queries EfficientlyUploaded byanon-775312
- Ice Berg QueryUploaded byPreetpal Singh
- Unit03_ComplexityAnalysis1Uploaded byrutvij111
- Bubble sort Algorithm.docxUploaded byMohdTauseef

- Silverlume PLUS Ds v09Uploaded byTran Manh Vu
- 3DDamUploaded bypani68
- Isnis-Singapore-Mental-Wellbeing-Scale.pdfUploaded bysana35
- Sampling TechniqueUploaded bymiguelxerxes
- VSI InstallationUploaded bypecmett
- Effectiveness of Oral HealthUploaded byCarlos Castañeda
- acetobacterUploaded byJhonatan Cáceres
- Attitudes of Teachers Towards Inclusive Education InUploaded byabuhaym
- A Life Worth LivingUploaded byXenohart
- All About DeadlocksUploaded bysiddu_ktm
- LogWorks3 ManualUploaded byOptweber
- Oracle JDE Grower Management Data SheetUploaded byNguyen Tran Tuan
- Technical DocumentsUploaded bySulagna Dhar
- Signifier - Cahiers Pour l’Analyse (an Electronic Edition)Uploaded byValentín Huarte
- operating systemUploaded byapi-274744268
- Ethics and Social ResponsibilityUploaded byMaria Gabriela Popa
- 26 Focus 4 Lesson Plan Unit 2Uploaded byMarija Trninkova
- The log buildUploaded byMichael Leo
- Catalog ReerUploaded byerkinguler
- Structure Contour MapsUploaded byAbdul Moeed Kalson
- Ge Mid Idm 6000 1.Lm6000 PerformanceUploaded byChristopher Hampton
- Anatomical TerminologyUploaded byRura Danga
- _Lesson 4_123Uploaded byMuhammad Umar
- 2017 Moser ForestcityMalaysiaandChineseexpansionismUploaded byRosita Septiyani
- Apollo Operations Handbook Block II Spacecraft Volume 1Uploaded byBob Andrepont
- Katz Three SkillsUploaded byJane Bowne
- SAES-Q-005Uploaded bytaimienphi
- Reporty Psycho.Uploaded byReedon Quinan
- Spooked! - How Not to Prevent Violent ExtremismUploaded byImpello_Tyrannis
- D3689-90-Standard Test Method for Individual Piles Under Static Axial Tensile LoadUploaded byYazmin Lugo J