https://wiki.devclub.in/index.php?action=history&feed=atom&title=MTL773 2026-05-27T01:18:16Z Revision history for this page on the wiki MediaWiki 1.45.1 https://wiki.devclub.in/index.php?title=MTL773&diff=3535&oldid=prev 2026-04-14T16:43:12Z

<p>Bot: wrap bare course codes in wikilinks</p> <table style="background-color: #fff; color: #202122;" data-mw="interface"> <col class="diff-marker" /> <col class="diff-content" /> <col class="diff-marker" /> <col class="diff-content" /> <tr class="diff-title" lang="en"> <td colspan="2" style="background-color: #fff; color: #202122; text-align: center;">← Older revision</td> <td colspan="2" style="background-color: #fff; color: #202122; text-align: center;">Revision as of 16:43, 14 April 2026</td> </tr><tr><td colspan="2" class="diff-lineno" id="mw-diff-left-l4">Line 4:</td> <td colspan="2" class="diff-lineno">Line 4:</td></tr> <tr><td class="diff-marker"></td><td style="background-color: #f8f9fa; color: #202122; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #eaecf0; vertical-align: top; white-space: pre-wrap;"><div>| credits = 3</div></td><td class="diff-marker"></td><td style="background-color: #f8f9fa; color: #202122; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #eaecf0; vertical-align: top; white-space: pre-wrap;"><div>| credits = 3</div></td></tr> <tr><td class="diff-marker"></td><td style="background-color: #f8f9fa; color: #202122; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #eaecf0; vertical-align: top; white-space: pre-wrap;"><div>| credit_structure = 3-0-0</div></td><td class="diff-marker"></td><td style="background-color: #f8f9fa; color: #202122; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #eaecf0; vertical-align: top; white-space: pre-wrap;"><div>| credit_structure = 3-0-0</div></td></tr> <tr><td class="diff-marker" data-marker="−"></td><td style="color: #202122; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #ffe49c; vertical-align: top; white-space: pre-wrap;"><div>| pre_requisites = MTL411/MTL602</div></td><td class="diff-marker" data-marker="+"></td><td style="color: #202122; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #a3d3ff; vertical-align: top; white-space: pre-wrap;"><div>| pre_requisites = <ins style="font-weight: bold; text-decoration: none;">[[</ins>MTL411<ins style="font-weight: bold; text-decoration: none;">]]</ins>/<ins style="font-weight: bold; text-decoration: none;">[[</ins>MTL602<ins style="font-weight: bold; text-decoration: none;">]]</ins></div></td></tr> <tr><td class="diff-marker" data-marker="−"></td><td style="color: #202122; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #ffe49c; vertical-align: top; white-space: pre-wrap;"><div>| overlaps = MTL768, COL751</div></td><td class="diff-marker" data-marker="+"></td><td style="color: #202122; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #a3d3ff; vertical-align: top; white-space: pre-wrap;"><div>| overlaps = <ins style="font-weight: bold; text-decoration: none;">[[</ins>MTL768<ins style="font-weight: bold; text-decoration: none;">]]</ins>, <ins style="font-weight: bold; text-decoration: none;">[[</ins>COL751<ins style="font-weight: bold; text-decoration: none;">]]</ins></div></td></tr> <tr><td class="diff-marker"></td><td style="background-color: #f8f9fa; color: #202122; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #eaecf0; vertical-align: top; white-space: pre-wrap;"><div>}}</div></td><td class="diff-marker"></td><td style="background-color: #f8f9fa; color: #202122; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #eaecf0; vertical-align: top; white-space: pre-wrap;"><div>}}</div></td></tr> <tr><td class="diff-marker"></td><td style="background-color: #f8f9fa; color: #202122; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #eaecf0; vertical-align: top; white-space: pre-wrap;"><br></td><td class="diff-marker"></td><td style="background-color: #f8f9fa; color: #202122; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #eaecf0; vertical-align: top; white-space: pre-wrap;"><br></td></tr> <tr><td class="diff-marker"></td><td style="background-color: #f8f9fa; color: #202122; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #eaecf0; vertical-align: top; white-space: pre-wrap;"><div>== MTL773 : Wavelets and Applications ==</div></td><td class="diff-marker"></td><td style="background-color: #f8f9fa; color: #202122; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #eaecf0; vertical-align: top; white-space: pre-wrap;"><div>== MTL773 : Wavelets and Applications ==</div></td></tr> <tr><td class="diff-marker" data-marker="−"></td><td style="color: #202122; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #ffe49c; vertical-align: top; white-space: pre-wrap;"><div>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.</div></td><td class="diff-marker" data-marker="+"></td><td style="color: #202122; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #a3d3ff; vertical-align: top; white-space: pre-wrap;"><div>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. <ins style="font-weight: bold; text-decoration: none;">[[</ins>MTL776<ins style="font-weight: bold; text-decoration: none;">]] </ins>Graph Algorithms 3 credits (3-0-0) Pre-requisites: <ins style="font-weight: bold; text-decoration: none;">[[</ins>COL106<ins style="font-weight: bold; text-decoration: none;">]] </ins>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.</div></td></tr> </table>

DevanshKandpal https://wiki.devclub.in/index.php?title=MTL773&diff=1659&oldid=prev 2026-03-04T10:14:58Z

<p>Creating course page via bot</p> <p><b>New page</b></p><div>{{Infobox Course<br /> | code = MTL773<br /> | name = Wavelets and Applications<br /> | credits = 3<br /> | credit_structure = 3-0-0<br /> | pre_requisites = MTL411/MTL602<br /> | overlaps = MTL768, COL751<br /> }}<br /> <br /> == MTL773 : Wavelets and Applications ==<br /> 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.</div>

Prashantt492