Prashantt492: Creating course page via bot

2026-03-04T10:14:58Z

Creating course page via bot

New page

{{Infobox Course
| code = MTL773
| name = Wavelets and Applications
| credits = 3
| credit_structure = 3-0-0
| pre_requisites = MTL411/MTL602
| overlaps = MTL768, COL751
}}

== MTL773 : Wavelets and Applications ==
Basic Fourier Analysis: Fourier Series, convergence of Fourier series, Riesz Fischer theorem, Fourier transform of square integrable functions, Plancheral formula, Poisson Summation formula, Shannon sampling theorem, Heisenberg Uncertainty principle. Continuous Wavelet transform, Plancherel formula, Inversion formulas. Frames, Riesz Systems, discrete wavelet transform, Numerical algorithms. Orthogonal bases of wavelets, multi resolution analysis, smoothness of wavelets, compactly supported wavelets, cardinal spline wavelets. Tensor products of wavelets, Decomposition and reconstruction algorithms for wavelets, wavelet packets, recent development and applications. MTL776 Graph Algorithms 3 credits (3-0-0) Pre-requisites: COL106 Introduction to Graphs: Definition and basic concepts, Efficient representations of Graphs; Graph Searching: DFS and BFS; Application of Graph Searching: finding connected components, bi-connected components, testing for bipartiteness, finding cycle in graphs; Trees: Different MST algorithms, enumeration of all spanning trees of a graph; Paths and Distance in Graphs: Single source shortest path problem, All pairs shortest path problem, center and median of a graph, activity digraph and critical path; Hamiltonian Graphs: sufficient conditions for Hamiltonian graphs, traveling Salesman problem; Eulerian Graphs: characterization of Eulerian graphs, construction of Eulerian tour, The Chinese Postman problem; Planar Graphs: properties of planar graphs, planarity testing algorithm; Graph Coloring: vertex coloring, chromatic polynomials, edge coloring, planar graph coloring; Matching: maximum matching in bipartite graphs, maximum matching in general graphs; Networks: The Max-flow min-cut theorem, max-flow algorithm; NP-Complete Graph problems; Approximation algorithms for some NP-Hard graph problems; Algorithms for some NP-Hard graph problems on special graph classes.

MTL773 - Revision history

Prashantt492: Creating course page via bot