<?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=COL729</id>
	<title>COL729 - Revision history</title>
	<link rel="self" type="application/atom+xml" href="https://wiki.devclub.in/index.php?action=history&amp;feed=atom&amp;title=COL729"/>
	<link rel="alternate" type="text/html" href="https://wiki.devclub.in/index.php?title=COL729&amp;action=history"/>
	<updated>2026-04-09T06:02:12Z</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=COL729&amp;diff=577&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=COL729&amp;diff=577&amp;oldid=prev"/>
		<updated>2026-03-04T10:00:00Z</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 = COL729&lt;br /&gt;
| name = Compiler Optimization&lt;br /&gt;
| credits = 4.5&lt;br /&gt;
| credit_structure = 3-0-3&lt;br /&gt;
| pre_requisites = COL 216, COL 226 OR Equivalent&lt;br /&gt;
| overlaps = &lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
== COL729 : Compiler Optimization ==&lt;br /&gt;
Program representation – symbol table, abstract syntax tree; Control flow analysis; Data flow analysis; Static single assignment; Def-use and Use-def chains; Early optimizations – constant folding, algebraic simplifications, value numbering, copy propagation, constant propagation; Redundancy Elimination – dead code elimination, loop invariant code motion, common sub-expression elimination; Register Allocation; Scheduling – branch delay slot scheduling, list scheduling, trace scheduling, software pipelining; Optimizing for memory hierarchy – code placement, scalar replacement of arrays, register pipelining; Loop transformations – loop fission, loop fusion, loop permutation, loop unrolling, loop tiling; Function inlining and tail recursion; Dependence analysis; Just-in-time compilation; Garbage collection. Laboratory component would involve getting familiar with internal representations of compilers; profiling and performance evaluation; and the design and implementation of novel compiler optimizations.&lt;/div&gt;</summary>
		<author><name>Prashantt492</name></author>
	</entry>
</feed>