#1
| |||
| |||
msc cyber security calicut university |
#3
| |||
| |||
Re: msc cyber security calicut university
Calicut University offer M. Tech. Degree Program in Cyber Security and not the M Sc. Program. The syllabus of the Program is as follows: SEMESTER I MCY 10 101: MATHEMATICAL FOUNDATIONS OF COMPUTER SCIENCE Module I: (13Hrs) Divisibility, gcd, prime numbers, fundamental theorem of arithmetic,Congruences, Fermat's theorem, Euler function, Primality testing, solution of congruences, Chinese remainder theorem, Wilson’s theorem. Module II: (13Hrs) Groups and subgroups, homomorphism theorems, cosets and normal subgroups, Lagrange’s theorem, rings, finite fields, polynomial arithmetic, quadratic residues, reciprocity, discrete logarithms, elliptic curve arithmetic. Module III: (14Hrs) Fundamental principles of counting, pigeonhole principle, countable and uncountable sets, principle of inclusion and exclusion, derangements, equivalence relations and partitions, partial order, lattices and Boolean algebra, generating functions, recurrence relations, solution of recurrences. Module IV: (13Hrs) Graphs, Euler tours, planar graphs, Hamiltonian graphs, Euler's formula, applications of Kuratowski's theorem, graph coloring, chromatic polynomials, trees, weighted trees, shortest path algorithms, spanning trees, the max-flow min-cut theorem. References 1. Niven, H.S. Zuckerman and Montgomery, An Introduction to the Theory of Numbers, 3/e, John Wiley and Sons, New York, 1992. 2. R. P. Grimaldi, Discrete and Combinatorial Mathematics: An Applied Introduction,3/e, Addison-Wesley, New Delhi, 1994. 3. B. Kolman and R.C. Busby, Discrete Mathematical Structures for Computer Science, PHI, New Delhi, 1994. 4. J. Clark and D. A. Holton, A First Look at Graph Theory, Allied Publishers (World Scientific), New Delhi, 1991. M Tech. Cyber Security Syllabus Calicut University |
|