<?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=COL202</id>
	<title>COL202 - Revision history</title>
	<link rel="self" type="application/atom+xml" href="https://wiki.devclub.in/index.php?action=history&amp;feed=atom&amp;title=COL202"/>
	<link rel="alternate" type="text/html" href="https://wiki.devclub.in/index.php?title=COL202&amp;action=history"/>
	<updated>2026-04-09T07:49:54Z</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=COL202&amp;diff=549&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=COL202&amp;diff=549&amp;oldid=prev"/>
		<updated>2026-03-04T09:59:38Z</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 = COL202&lt;br /&gt;
| name = Discrete Mathematical Structures&lt;br /&gt;
| credits = 4&lt;br /&gt;
| credit_structure = 3-1-0&lt;br /&gt;
| pre_requisites = &lt;br /&gt;
| overlaps = MTL180&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
== COL202 : Discrete Mathematical Structures ==&lt;br /&gt;
Propositional logic, Predicate Calculus and Quantifiers; Proof Methods; Sets, functions, relations, Cardinality, Infinity and Diagonalization; Induction and Recursion; Modular Arithmetic, Euclid&amp;#039;s Algorithm, primes, Public Key Cryptography; Polynomials, finite fields and Secret Sharing; Coding Theory: Error correcting codes, Hamming codes, Hamming bound; Basic Counting - Pigeon hole principle; Advanced Counting - recurrence relations, generating functions, inclusion-exclusion; basic information theory, entropy, Kraft&amp;#039;s inequality, mutual information, lower bounds; Probability - sample space, conditional probability, expectation, linearity of expectation, variance, Markov, Chebychev, probabilistic methods; Graph Theory - Eulerian, Hamiltonian &amp;amp; planar graphs, edge and vertex coloring.&lt;/div&gt;</summary>
		<author><name>Prashantt492</name></author>
	</entry>
</feed>