<?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=ELV780</id>
	<title>ELV780 - Revision history</title>
	<link rel="self" type="application/atom+xml" href="https://wiki.devclub.in/index.php?action=history&amp;feed=atom&amp;title=ELV780"/>
	<link rel="alternate" type="text/html" href="https://wiki.devclub.in/index.php?title=ELV780&amp;action=history"/>
	<updated>2026-04-09T06:00:56Z</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=ELV780&amp;diff=883&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=ELV780&amp;diff=883&amp;oldid=prev"/>
		<updated>2026-03-04T10:04:12Z</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 = ELV780&lt;br /&gt;
| name = Special Module in Computers&lt;br /&gt;
| credits = 3&lt;br /&gt;
| credit_structure = 3-0-0&lt;br /&gt;
| pre_requisites = &lt;br /&gt;
| overlaps = &lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
== ELV780 : Special Module in Computers ==&lt;br /&gt;
Introduction, data structures for combinatorial optimization: heaps, union-find, Fibonacci heaps, dynamic trees, dynamic graph structure; Asymptotic analysis; Divide &amp;amp; conquer and graph algorithms: Graph search: Breadth first, depth first, topological sorting, Fast Fourier Transform, Matrix Multiplication, Shortest path algorithms; Additional Data Structures: Suffix trees &amp;amp; string matching, Splay trees &amp;amp; amortized analysis; Advanced algorithmic design techniques: Dynamic programming (edit distance, chains of matrix multiplication, etc.), Network flow and its use for solving problems; Linear and integer programming, NP-completeness, Randomized algorithms (hashing &amp;amp; global minimum cut), Approximation Algorithms; Object oriented Software design, Design of Dependable Software.&lt;/div&gt;</summary>
		<author><name>Prashantt492</name></author>
	</entry>
</feed>