<?xml version="1.0"?>
<feed xmlns="http://www.w3.org/2005/Atom" xml:lang="en">
	<id>https://wiki.devclub.in/index.php?action=history&amp;feed=atom&amp;title=MTL752</id>
	<title>MTL752 - Revision history</title>
	<link rel="self" type="application/atom+xml" href="https://wiki.devclub.in/index.php?action=history&amp;feed=atom&amp;title=MTL752"/>
	<link rel="alternate" type="text/html" href="https://wiki.devclub.in/index.php?title=MTL752&amp;action=history"/>
	<updated>2026-04-09T07:34:50Z</updated>
	<subtitle>Revision history for this page on the wiki</subtitle>
	<generator>MediaWiki 1.45.1</generator>
	<entry>
		<id>https://wiki.devclub.in/index.php?title=MTL752&amp;diff=1648&amp;oldid=prev</id>
		<title>Prashantt492: Creating course page via bot</title>
		<link rel="alternate" type="text/html" href="https://wiki.devclub.in/index.php?title=MTL752&amp;diff=1648&amp;oldid=prev"/>
		<updated>2026-03-04T10:14:49Z</updated>

		<summary type="html">&lt;p&gt;Creating course page via bot&lt;/p&gt;
&lt;p&gt;&lt;b&gt;New page&lt;/b&gt;&lt;/p&gt;&lt;div&gt;{{Infobox Course&lt;br /&gt;
| code = MTL752&lt;br /&gt;
| name = Data Structures for Applied Mathematics&lt;br /&gt;
| credits = 4&lt;br /&gt;
| credit_structure = 3-0-2&lt;br /&gt;
| pre_requisites = MTL 505 Computer Programming&lt;br /&gt;
| overlaps = COL 106 (60%), COL 351 (20%), COL 702&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
== MTL752 : Data Structures for Applied Mathematics ==&lt;br /&gt;
(30%) Course Contents: Review of some concepts  of C-programming languages such as Array, structures, pointers, linked list; Growth rate of Functions: Big Oh, small oh, Big Omega, small omega and theta notations;  Data structures: stacks, queues, Binary Search trees, Balanced Binary Trees: AVL trees;  Binary Heaps; Data structures for representing graphs: Adjacency matrix and Adjacency lists;  Sorting: merge, quick, radix, selection, bucket sort, and heap sort; Graph Algorithms: Breadth first search, Depth first search;  Dijkstra&amp;#039;s shortest path algorithm, Prim&amp;#039;s and Kruskal&amp;#039;s MST algorithms; Introduction to Algorithm Design Techniques: Greedy, Divide and Conquer, and Dynamic Programming Technique.&lt;/div&gt;</summary>
		<author><name>Prashantt492</name></author>
	</entry>
</feed>