<?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=MTL782</id>
	<title>MTL782 - Revision history</title>
	<link rel="self" type="application/atom+xml" href="https://wiki.devclub.in/index.php?action=history&amp;feed=atom&amp;title=MTL782"/>
	<link rel="alternate" type="text/html" href="https://wiki.devclub.in/index.php?title=MTL782&amp;action=history"/>
	<updated>2026-04-09T06:03:26Z</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=MTL782&amp;diff=1662&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=MTL782&amp;diff=1662&amp;oldid=prev"/>
		<updated>2026-03-04T10:15: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 = MTL782&lt;br /&gt;
| name = Data Mining&lt;br /&gt;
| credits = 4&lt;br /&gt;
| credit_structure = 3-0-2&lt;br /&gt;
| pre_requisites = MTL342&lt;br /&gt;
| overlaps = COL352&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
== MTL782 : Data Mining ==&lt;br /&gt;
Introduction to Data Mining, Data Cleaning and transformation,Data synchronization with operational databases, Association rule mining, Sequence analysis, mining complex data, Classification, knowledge Extraction and prediction, LIFT charts and ROC curves, Bagging and Boosting, Clustering techniques and application, Parallel and distributed data mining systems, data cubes and other visualizations. MTL783 Theory of Computation 3 credits (3-0-0) Introduction to the Theory of Computation: Proof Techniques, Basic concepts of language, Grammar and Automata; Chomsky Hierarchy, Regular Languages, Finite automata, Equivalence, DFA and NFA, Minimization, Myhill-Nerode Theorem; Context Free Grammar, Pushdown Automata their equivalenece and Application, Properties of Context-Free Languages; Turing Machine, Recursive and Recursively Enumerable Languages; Undecidability, Rice&amp;#039;s Theorem, Post&amp;#039;s Correspondence Problem, Complexity Theory, Intractable Problems.&lt;/div&gt;</summary>
		<author><name>Prashantt492</name></author>
	</entry>
</feed>