9 views

Uploaded by Singh Ak

mathematics and computing branch

- Discrete Str CS Handout
- MTH202 Short Questions Answers
- Finding the Edge Ranking Number through Vertex Partitions
- 10.1.1.6
- Minimum Spanning Tree
- GRAPH-HOC 040401
- 11. Maths - IJMCAR - Construction - Srinivasa Rao
- VCE Further Maths 1 & 2 Notes
- IJAIEM-2013-09-29-075.pdf
- Introduction, Graphs book
- 120 Guide to Greedy Algorithms
- Algebraic properties of Chromatic polynomial of a graph.pdf
- The Floyd-Warshall Algorithm
- DSA_MK_Lect4.pdf
- Minimum Spanning Trees
- On single-valued co-neutrosophic graphs
- blendedkit-blueprint-week 1
- Edges 800
- Edges 1000
- tut161

You are on page 1of 5

com

MC-401

L

UNIT I

Introduction: Concept of algorithmic efficiency, run time analysis of algorithms,

Asymptotic Notations. Growth of Functions, Master's Theorem,

UNIT II

Searching and Sorting:

Structure of divide-and-conquer algorithms; examples: binary

search, quick sort, Stassen Multiplication; merge sort, heap sort and Analysis of divide and

conquer run time recurrence relations.

UNIT III

Greedy Method: Overview of the greedy paradigm examples of exact optimization solution:

minimum cost spanning tree, approximate solutions: Knapsack problem, Kruskals algorithm

and Prims algorithm for finding Minimum cost Spanning Trees, Dijkstras and Bellman Fort

Algorithm for finding Single source shortest paths.

UNIT IV

Dynamic programming: Principle of dynamic programming. Applications: Floyd-Wars hall

algorithm for all pair shortest paths. Matrix multiplication, Traveling salesman Problem,

longest Common sequence,

Back tracking: Overview, 8-queen problem, and Knapsack problem. Traveling Salesman

problem

UNIT V

Branch and bound: LC searching Bounding, FIFO branch and bound, LC branch and bound

application: 0/1 Knapsack problem,

UNIT VI

Computational Complexity: Complexity measures, Polynomial Vs non-polynomial time

complexity; NP-hard and NP-complete classes, examples: Circuit Satisfiablity, Vertex cover,

Subset Sum problem, Randomized Algorithms, String Matching, NP-Hard and NPCompleteness, Approximation Algorithms, Sorting Network, Matrix Operations, Polynomials

and FFT, Number Theoretic Algorithms.

Text Books:

1. T .H . Cormen, C . E . Leiserson, R .L . Rivest, Introduction to Algorithms, PHI.

2. E. Horowitz, S. Sahni, and S. Rajsekaran, Fundamentals of Computer Algorithms,

Galgotia Publication

3. Sara Basse, A. V. Gelder, Computer Algorithms, Addison Wesley

www.mcdtu.wordpress.com 1

www.mcdtu.wordpress.com

Reference Books:

1. Aho, Ullman Principles of Algorithms

www.mcdtu.wordpress.com 2

www.mcdtu.wordpress.com

Elective-I

MC-402

Open Elective-I

MC-403

www.mcdtu.wordpress.com 3

www.mcdtu.wordpress.com

MC-404

Unit I

Graphs, Subgraphs, Some basic properties of graphs and subgraphs, Isomorphism, Various

types of graphs and their subgraphs, trails, walks, paths, circuits and cycles, connected graphs,

disconnected graphs and components, various operations on graphs, Eulerian graphs,

Hamiltonian paths and cycles, Adjacency and incidence matrices of a graph, shortest path,

algorithms to find shortest path.

Unit II

Necessary conditions for Hamiltonian graphs, sufficient conditions for Hamiltonian graphs,

traveling salesman problem, characterization of Eulerian graphs, construction of Eulerian tour,

The Chinese postman problem.

Unit III

Characterization of trees, rooted and binary trees, spanning trees and their properties, spanning

trees in weighted graphs, minimum spanning tree, algorithms for minimum spanning tree.

Unit IV

Cut vertices, cut sets and their properties, the max-flow min-cut theorem, max-flow algorithm,

connectivity and edge connectivity, Mengers theorem (without proof), max-flow algorithm.

Unit V

Coloring, proper coloring, chromatic number, chromatic partitioning, a maximal independent

set, matching, maximum matching in bipartite graphs and in general graphs.

Reference:

1. G. Chatrand, and O.R. Ollermann, Applied and Algorithmic Graph theory, McGraw Hill, 1993.

2. Narsingh Deo, Graph theory with applications to engineering and computer

3. Geir Agnarsson and R. Gveenlaw, Graph theory: Modeling, applications and

Algorithms, Pearson edu.,Inc. 2009

4. L.R. Foulds, Graph theory applications, Narosa Pub. House, 1992.

5. Corman, Leiserson and Rivest, Introduction to Algorithms, PHI, 1998.

www.mcdtu.wordpress.com 4

www.mcdtu.wordpress.com

Applied Graph

Theory-Lab

MC-405

C

3

Kruskals algorithms for MST , Shortest Paths: Disjkstras algorithm; FloydWarshall algorithm; Bellman-Ford Algorithms , Bipartite Matching , Matching for

General Graphs , Max-flow.

Analysis-Lab

MC-406

www.mcdtu.wordpress.com 5

- Discrete Str CS HandoutUploaded byAakshan
- MTH202 Short Questions AnswersUploaded bycs619finalproject.com
- Finding the Edge Ranking Number through Vertex PartitionsUploaded bydavidsmc
- 10.1.1.6Uploaded byMohammedghallapsaid Said
- Minimum Spanning TreeUploaded by_Nishant_
- 11. Maths - IJMCAR - Construction - Srinivasa RaoUploaded byTJPRC Publications
- VCE Further Maths 1 & 2 NotesUploaded bykwmaster
- 120 Guide to Greedy AlgorithmsUploaded byGaurav Tripathi
- GRAPH-HOC 040401Uploaded byMegan Bell
- IJAIEM-2013-09-29-075.pdfUploaded byAnonymous vQrJlEN
- Algebraic properties of Chromatic polynomial of a graph.pdfUploaded byThilak
- The Floyd-Warshall AlgorithmUploaded bySyed Muhammad Junaid Hassan
- Introduction, Graphs bookUploaded byJames Powell
- DSA_MK_Lect4.pdfUploaded byAnkit Priyarup
- Minimum Spanning TreesUploaded byumama syed
- On single-valued co-neutrosophic graphsUploaded byAnonymous 0U9j6BLllB
- blendedkit-blueprint-week 1Uploaded byapi-354498922
- Edges 800Uploaded byjamada29
- Edges 1000Uploaded byjamada29
- tut161Uploaded byAyush
- Principles of Math 12 - Transformations Lesson 2Uploaded byTim_C
- A Theorem on the Prime Graph of 2x2 - Matrix Ring of Z2Uploaded byEditor IJRITCC
- A Note on the Double Domination Number in TreesUploaded byVinoth Venkatesh
- IJMC-1-2008-bookUploaded byAnonymous 0U9j6BLllB
- Chap1_2011 [Compatibility Mode]Uploaded byPingthong Ling
- Solution for Example 2.5Uploaded byNasrul Torres
- Protecting Location Privacy in Sensor Networks Against a Global EavesdropperUploaded byieeexploreprojects
- pds2labrecprint.docxUploaded byperumal

- 64 Interview QuestionsUploaded byshivakumar N
- simulation-notes.pdfUploaded bySingh Ak
- Computer GraphicsUploaded byAnkur Singh
- MOCK TEST - 12 (ENGLISH).pdfUploaded bySingh Ak
- ASM2Uploaded bySingh Ak
- cryptography and network security william stallingsUploaded bySingh Ak
- Quick Quant Guide (Pocket Mein Rocket)Uploaded byMbatutes
- Simulation Notes pdfUploaded bySingh Ak
- stock priceUploaded bySingh Ak
- AMCAT Sample PapersUploaded byankit
- Power Words for ResumeUploaded byspencer1999
- Mid Seventh 2014 DTUUploaded bySingh Ak
- mathematics and computing- SC FileUploaded bySingh Ak
- End Fifth Semester 2013Uploaded bySingh Ak
- 2 Entity Relationship ModelUploaded bySushil Kumar
- Mid Sixth Semester 2014Uploaded bySingh Ak
- Syllabus Fourth SemesterUploaded bySingh Ak
- VHDL_merged.pdfUploaded byDenise Nelson

- The Grammar According to West Douglas B West Illinois UUploaded byGilbertcherng
- NotesRGCNUploaded byNina Brown
- BacktrackingUploaded bywesam
- Tutorial Sheet 3Uploaded byANMOL
- ccn labviewUploaded byputtipallavi24
- 06 GamePlayingUploaded bymonster Gupta
- Graph Theory & Combinatorics June 2012Uploaded byPrasad C M
- Exercises SortingUploaded byAnonymous 5Qtn0QVDuO
- Exponent Lifting SolUploaded byYuxdar Contell
- Automata Computability and Complexity Theory and Applications 1st Edition Rich Solution ManualUploaded byBasaprabhu Halakarnimath
- Performance Comparison of Sorting Algorithms On The Basis Of Complexity-542.pdfUploaded byanvinder
- Sorting TechniquesUploaded byJohnFernandes
- mathematicsvisionproject hmwk reviewUploaded byapi-292698981
- 2012 Putnam SolutionsUploaded byvishweshsinghbhadaur
- Answer SssssUploaded byLucaSteiner
- Network Routing Problem in MultigraphUploaded byIRJCS-INTERNATIONAL RESEARCH JOURNAL OF COMPUTER SCIENCE
- ISM Finite Ch3-3Uploaded byAli Ezzat
- Newman 2003 StructureUploaded bypastafarianboy
- Data Structures and Algorithms MCQ -3Uploaded byKuldeep Singh
- The Art of Computer Programming - Vol 4 - Pre-fascicle 5bUploaded byoberon
- 3Uploaded byXavier TxA
- 4-Dynamic Programming.pptUploaded byKartik Verma
- Lecture06 1up ColourUploaded byMochamad Satria Dharma Utama
- Floating Point ArithmeticUploaded byomru234
- Computer Arithmetic QuestionsUploaded bylukkio
- CS502- Midterm Solved Subjective With References by MoaazUploaded bymc170202158 Gulnaz Akhtar
- Solution ManualUploaded byAnonymous gZxj89
- Quadratic Equation and ExpressionUploaded byAnuj
- DORSEY-FUploaded byimnomus
- lm-chapter5Uploaded byyash_vardhan_4