[nilesh]

Discuss about msc cyber security calicut university here. Welcome to Courses.ind.in and this page is for msc cyber security calicut university discussion. If you are looking for information on msc cyber security calicut university then ask your question is as much details as possible in the “Reply” box provided below. The more detailed your question will be, the more easy will it be for our experts to answers your query. And if you have any updated or latest information on msc cyber security calicut university, then please share you knowledge with our experts in the “Reply” box below. Your reply will be published here and your knowledge can help many people. Thanks for stopping by at Courses.ind.in. Please visit again.

Can you tell me if Calicut University offer M Sc. or M. Tech. Degree Program in Cyber Security as I want to apply for admission in it? Provide me the syllabus of the Course?

[vikash]

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