Need help about a course? |
|
Home / Syllabus / Andhra Pradesh / Andhra University / Under Graduate Courses /
BTech Information Technology Syllabus
IT 4.1.5 - Combinatorics & Graph Theory (Elective I) Syllabus | Ask a question Print this page |
AU School of Distance Education
Courses, Admissions & Eligibility
Faculties, Departments & Colleges
Notifications, Circulars & Announcements
Alumni, Batchmates & Personalities who studied at the University
Andhra University Original Degree Forms
Sponsored category and Special category seats in ME / MTech / MPharmacy
Fourth year - First Semester
Instruction: 3 Periods & 1 Tut /week
Univ. Exam : 3 Hours
Sessional Marks: 30
Univ-Exam-Marks:70
PART I: Combinatorics
1. FOUNDATION: Basics- Sets- Relations- Proof methods- Problem-solving strategies-Mathematical Induction.
2. COMINATORICS: Basics of counting-Combinations and Permutations- Enumeration of Combinations & Permutations without repetitions and without repetitions- with constrained repetitions-Binomial Coefficients-Binomial and Multinomial theorems- Principle of Inclusion-Exclusion
3. RECURRENCE RELATIONS: Generating Functions of Sequences- Calculating Coefficients of Generating Functions- Recurrence Relations- Solving Recurrence Relations using Substitution and Generating Functions-Method of Characteristic Roots-Solutions of homogeneous and inhomogeneous recurrence relations.
PART II Graph Theory
4. FUNDAMENTAL CONCEPTS: what is a Graph-Paths-Cycles-Trails-Vertex Degrees and Counting-Directed Graphs-Trees and Distance-Spanning Trees-Enumeration-Optimization and Trees.
5. MATCHINGS AND CONNECTIVITY : Matchings and Covers-Algorithms and applications of matching-Matchings in General graphs-Cuts and Connectivity-k-connected graphs-Network flow problems.
6. COLORING AND PLANAR GRAPHS: Vertex coloring and upper bounds-Structure of kchromatic Graphs-Enumerative Aspects-Embeddings and Euler’s formula-Characterization of Planar graphs-Parameters of Planarity-Edges and Cycles-Line Graphs and edge-coloring-Hamiltonian Cycles-Planarity-coloring and cycles.
Text Books:
1. J.L. Mott, Abraham Kandel & Theodore P. Baker, " Discrete mathematics for Computer Scientists & Mathematics", Prentice-Hall of India Ltd. New Delhi. (Chapters 1,2,3)
2. Douglas B. West, "Introduction to Graph Theory", Pearson Education Asia, New Delhi. (Chapters 1,2,3,4,5,6,7)
Reference Books:
1. Michel Townsend, "Discrete Mathematics: Applied Combinatorics and graph theory", The Benjamin/Cummings Publishing Company", California.
2. Kenneth H Rosen. "Discrete Mathematics and Its Applications, Tata McGrahHill Publishing Company, New Delhi.
3. Robin J. Wilson, "Introduction to Graph Theory" Pearson Education Asia, New Delhi.
Engineering Colleges in India
Get the most comprehensive list of Engineering Colleges in India
Engineering Admission Notifications
Recent Notifications for admissions to various Engineering Colleges in India
Business Schools - Engineering Colleges - Medical & Nursing Admissions - BEd in Distance mode - Journalism & Media Studies - IGNOU
Enter a detailed keyword. Ex: Syllabus of Andhra University Ist year BSc Computer Science course