COL202: Difference between revisions
| [checked revision] | [checked revision] |
Prashantt492 (talk | contribs) Creating course page via bot |
Bot: wrap bare course codes in wikilinks |
||
| Line 5: | Line 5: | ||
| credit_structure = 3-1-0 | | credit_structure = 3-1-0 | ||
| pre_requisites = | | pre_requisites = | ||
| overlaps = MTL180 | | overlaps = [[MTL180]] | ||
}} | }} | ||
== COL202 : Discrete Mathematical Structures == | == COL202 : Discrete Mathematical Structures == | ||
Propositional logic, Predicate Calculus and Quantifiers; Proof Methods; Sets, functions, relations, Cardinality, Infinity and Diagonalization; Induction and Recursion; Modular Arithmetic, Euclid'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's inequality, mutual information, lower bounds; Probability - sample space, conditional probability, expectation, linearity of expectation, variance, Markov, Chebychev, probabilistic methods; Graph Theory - Eulerian, Hamiltonian & planar graphs, edge and vertex coloring. | Propositional logic, Predicate Calculus and Quantifiers; Proof Methods; Sets, functions, relations, Cardinality, Infinity and Diagonalization; Induction and Recursion; Modular Arithmetic, Euclid'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's inequality, mutual information, lower bounds; Probability - sample space, conditional probability, expectation, linearity of expectation, variance, Markov, Chebychev, probabilistic methods; Graph Theory - Eulerian, Hamiltonian & planar graphs, edge and vertex coloring. | ||
Latest revision as of 16:25, 14 April 2026
| COL202 | |
|---|---|
| Discrete Mathematical Structures | |
| Credits | 4 |
| Structure | 3-1-0 |
| Pre-requisites | |
| Overlaps | MTL180 |
COL202 : Discrete Mathematical Structures
Propositional logic, Predicate Calculus and Quantifiers; Proof Methods; Sets, functions, relations, Cardinality, Infinity and Diagonalization; Induction and Recursion; Modular Arithmetic, Euclid'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's inequality, mutual information, lower bounds; Probability - sample space, conditional probability, expectation, linearity of expectation, variance, Markov, Chebychev, probabilistic methods; Graph Theory - Eulerian, Hamiltonian & planar graphs, edge and vertex coloring.