7/21/2019 CIS Syllabus M Tech Final http://slidepdf.com/reader/full/cis-syllabus-m-tech-final 1/40 Kannur University KANNUR UNIVERSITY Faculty of Engineering Curriculum, Scheme of Examinations and Syllabi for M-Tech Degree Programmein COMPUTER SCIENCE AND INFORMATION SECURITY
mtech kannur university sllabus computer science and information security
Welcome message from author
This document is posted to help you gain knowledge. Please leave a comment to let me know what you think about it! Share it to your friends and learn new things together.
This shall comprise of two seminars and submission of an interim thesis report. This report shall be
evaluated by the evaluation committee. The fourth semester Thesis- Final shall be an extension of
this work in the same area. The first seminar would highlight the topic, objectives, methodologyand expected results. The first seminar shall be conducted in the first half of this semester. The
second seminar is presentation of the interim thesis report of the work completed and scope of the
work which is to be accomplished in the fourth semester.
FOURTH SEMESTER
Code Subject Hours/
Week
Marks Credit
Internal University Total
L T P Guide Evaluation
committee
Project Viva
CIS 401(P) Thesis 22 200 200 100 100 600 12
TOTAL 22 200 200 100 100 600 12
Towards the middle of the semester there shall be a pre submission seminar to assess the quality
and quantum of the work by the evaluation committee. This shall consist of a brief presentation of
Third semester interim thesis report and the work done during the fourth semester. The comments
of the examiners should be incorporated in the work and at least one technical paper is to be
prepared for possible publication in journals / conferences. The final evaluation of the thesis shall
3. James D. McCabe, “Network Analysis, Architecture & Design, 2/e, Elsevier India”, 2004.
4. Youlu Zheng / Shakil Akhtar, “Networks for Computer Scientists and Engineers”, OxfordUniversity Press
Question Pattern:
There should be 7 questions out of which 5 should be answered. Each question would carry 20marks each. Each question shall carry a maximum of four sub sections which can have uneven
distribution of marks. The questions would touch upon all the sections of the syllabus as far as possible and would preferably be analytic in nature.
reductions. Approximation algorithms – Polynomial Time and Fully Polynomial timeApproximation Schemes.
REFERENCES
1. T. H. Cormen, C. E. Leiserson, R. L. Rivest, Introduction to Algorithms, Prentice Hall.
2. Aho, Hopcraft, Ullman, Design and Analysis of Computer Algorithms, Addison Wesley.
3. R. Motwani and P. Raghavan, Randomized Algorithms, Cambrdige University Press.4. C. H. Papadimitriou, Computational Complexity, Addison Wesley.
5. S. Basse, Computer Algorithms: Introduction to Design and Analysis, Addison Wesley.
Question Pattern:
There should be 7 questions out of which 5 should be answered. Each question would carry 20
marks each. Each question shall carry a maximum of four sub sections which can have unevendistribution of marks. The questions would touch upon all the sections of the syllabus as far as possible and would preferably be analytic in nature.
Introduction: Basic objectives of cryptography, secret-key and public-key cryptography, one-way
and trapdoor one-way functions, cryptanalysis, attack models, classical cryptography. Block
ciphers: Modes of operation, DES and its variants, RCS, IDEA, SAFER, FEAL, BlowFish, AES,linear and differential cryptanalysis. Stream ciphers: Stream ciphers based on linear feedback shift
registers, SEAL, unconditional security.
Module II
Message digest: Properties of hash functions, MD2, MD5 and SHA-1, keyed hash functions,
attacks on hash functions. Message authentication- KDCs, , Needham-Schroeder, CAs,
Certificate revocation, Session key establishment
Module III
Public-keyencryption: RSA, Rabin and EIGamal schemes, side channel attacks. Keyexchange:Diffie-Hellman and MQV algorithms. Digital signatures: RSA, DAS and NR signature
Kerberos. Advanced topics: Elliptic and hyper-elliptic curve cryptography, cryptographically
secure random number generator.
TEXT BOOKS
1.
Athul Kahate , Cryptography and Network Security, TMH2. William Stallings, Cryptography and Network Security Principles and Practice, 5
th edition
3. Bernard Menezes, “Network Security and Cryptography”, Cengage Learning, New Delhi,
2010.
4. Bruce Schneier, “Applied Cryptography”, John Wiley & Sons, New York, 2004.
5. Kaufman, R. Perlman, and M. Speciner, Network Security: Private Communication in a PublicWorld, 2
nd ed., Prentice Hal.
6. Wenbo Mao, “Modern Cryptography – Theory and Practice”, Pearson Education, New Delhi,
2006.
Question Pattern:
There should be 7 questions out of which 5 should be answered. Each question would carry 20marks each. Each question shall carry a maximum of four sub sections which can have unevendistribution of marks. The questions would touch upon all the sections of the syllabus as far as
possible and would preferably be analytic in nature.
Information Systems in Global Context – Building blocks and review of current status. Threats to
information systems. Information Security Management (ISM) in organizations. Information
Asset Management and Risk analysis.
Module II
Overview of Physical Security for Information Systems · Perimeter Security for Physical
Protection · Biometrics-based Security Access control models and Role based approaches for
organizational hierarchy. Managing Network Security Intrusion Detection for Securing the
Networks · Firewalls for Network Protection · Virtual Private Networks for Security and IDS ·
Module III
Application Security. Business Applications – choice of security architecture for third party
software and turnkey software projects. Choosing the building blocks of information systems of
the firm with security considerations – OS and databases, email and web servers.
Module IV
Business Continuity and Disaster Recovery Planning · Auditing for Security · Privacy Best
Practices in Organizations · Asset Management · Ethical Issues and Intellectual Property Concerns
for InfoSec Professionals
TEXT BOOK
1. Nina Godbole, Information Systems Security: Security Management, Metrics, Frameworks
and Best Practices, John Wiley and Sons Ltd., 2009.
REFERENCES
1. Tipton and Krause, Information Security Management Handbook, Fourth Edition,
Auerbach, 2000.
2. 3.Furnell, Katsikas, Lopez, Patel, Securing Information and Communication Systems:
Principles, Technologies and Applications, Artech House Inc., 2008.
3. Whitman and Mattord. Management of Information Security, Cengage Learning, 2007.
Question Pattern:
There should be 7 questions out of which 5 should be answered. Each question would carry 20
marks each. Each question shall carry a maximum of four sub sections which can have unevendistribution of marks. The questions would touch upon all the sections of the syllabus as far as
possible and would preferably be analytic in nature.
EM, preventing overfitting, cotraining gaussian Mixture models, k-means and hierarchical
clustering, clustering and unsupervised Learning, hidden markov models, reinforcement learning
support vector machines Ensemble learning: boosting, bagging.
REFERENCES:
1. Tom M. Mitchell, Machine Learning, MGH International, 1997.
2. Ethem Alpaydin, Introduction to Machine Learning, Eastern Economy Edition, Prentice Hall of
India, 2005
Question Pattern:
There should be 7 questions out of which 5 should be answered. Each question would carry 20
marks each. Each question shall carry a maximum of four sub sections which can have unevendistribution of marks. The questions would touch upon all the sections of the syllabus as far as
possible and would preferably be analytic in nature
7. Grady booch, james rumbaugh , ivar jacobson, “unified modeling language user guide”,
addison Wesley
Question Pattern:
There should be 7 questions out of which 5 should be answered. Each question would carry 20marks each. Each question shall carry a maximum of four sub sections which can have uneven
distribution of marks. The questions would touch upon all the sections of the syllabus as far as possible and would preferably be analytic in nature
There should be 7 questions out of which 5 should be answered. Each question would carry 20 markseach. Each question shall carry a maximum of four sub sections which can have uneven distribution
of marks. The questions would touch upon all the sections of the syllabus as far as possible and
Review of Induction and Diagonalization - Finite Automata – Myhill-Nerode Theorem, Pumping
Lemma. Turing Machines – Turing Acceptable, Decidable and Enumerable languages.
Module II
Closure Properties of RE and R sets - Undecidability – Reductions – RE Completeness – Non-RE
languages - Rice Theorems.
Module III
.Decidable languages, decidable problems concerning regular languages, decidable concerningcontext free languages, halting problem – diagonalization method. Undecidable problems from
language theory, mapping reducibility- formal definition
Module IV
Time and Space complexity classes – Relations between deterministic and Non-Deterministic timeand Space complexity classes – Hierarchy Theorems, - Savitch's Theorem - Immerman
Security Attacks (Interruption, Interception, Modification and Fabrication), Security Services
(Confidentiality, Authentication, Integrity, Non-repudiation, access Control and Availability) and
Mechanisms, A model for Internetwork security, Internet Standards and RFCs, Buffer overflow &format string vulnerabilities, TCP session hijacking, ARP attacks, route table modification, UDP
hijacking, and man-in-the-middle attacks.
Module II
Conventional Encryption Principles, Conventional encryption algorithms, cipher block modes of
operation, location of encryption devices, key distribution Approaches of Message Authentication,
Secure Hash Functions and HMAC. Public key cryptography principles, digital signatures, digital
Certificates, Certificate Authority and key management Kerberos, X.509 Directory Authentication
Service
Module III
Email privacy: Pretty Good Privacy (PGP) and S/MIME. IP Security Overview, IP Security
Introduction to Information Retrieval: The nature of unstructured and semi-structured text.
Inverted index and Boolean queries. Text Indexing, Storage and Compression: Text encoding:
tokenization, stemming, stop words, phrases, index optimization. Index compression: lexiconcompression and postings, lists compression. Gap encoding, gamma codes, Zipf's Law. Index
Introduction – Meaning of research – Objectives of research – Motivation in research –Types ofresearch – Research approaches – Significance of research – Research methods vs Methodology –
Criteria of good research.
Module II
Defining Research Problem – What is a research problem – Selecting the problem – Necessity ofdefining the problem – Literature review – Importance of literature review in defining a problem –
Critical literature review – Identifying gap areas from literature review
Module III
Research design – Meaning of research design – Need– Features of good design – Important
concepts relating to research design – Different types – Developing a research planMethod of data collection – Collection of data- observation method – Interview method–Questionnaire method – Processing and analysis of data – Processing options – Types of analysis –
Interpretation of results
Module IV
Report writing – Types of report – Research Report, Research proposal, Technical paper –
Significance – Different steps in the preparation – Layout, structure and Language of typicalreports – Simple exercises – Oral presentation – Planning – Preparation –Practice – Making
presentation – Answering questions - Use of visual aids – Quality & Proper usage – Importance of
effective communication – Illustration
REFERENCES1. Coley S M and Scheinberg C A, 1990, "Proposal Writing", Newbury Sage Publications.
2. Leedy P D, "Practical Research : Planning and Design", 4th Edition, N W MacMillan
Publishing Co.3. Day R A, "How to Write and Publish a Scientific Paper", Cambridge UniversityPress,1989.
4. CR Kothari, “Research Methodologies – Methods and Techniques”, Second Edition, New Age
International5. John W Best and James V Kahn, “ Research in Education”, Fifth Edition, PHI, New Delhi
Question Pattern:
There should be 7 questions out of which 5 should be answered. Each question would carry 20 marks
each. Each question shall carry a maximum of four sub sections which can have uneven distribution of
marks. The questions would touch upon all the sections of the syllabus as far as possible and would
Artificial Intelligence: History and Applications, Production Systems, Structures and Strategies for
state space search- Data driven and goal driven search, Depth First and Breadth First Search, DFS
with Iterative Deepening, Heuristic Search- Best First Search, A* Algorithm, AO* Algorithm,
Constraint Satisfaction, Using heuristics in games- Minimax Search, Alpha Beta Procedure.
Module II:
Knowledge representation - Propositional calculus, Predicate Calculus, Theorem proving by
Resolution, Answer Extraction, AI Representational Schemes- Semantic Nets, Conceptual
Dependency, Scripts, Frames, Introduction to Agent based problem solving.
Module III:
Machine Learning- Symbol based and Connectionist, Social and Emergent models of learning, TheGenetic Algorithm- Genetic Programming, Overview of Expert System Technology- Rule based
Expert Systems, Introduction to Natural Language Processing.
Module IV :
Languages and Programming Techniques for AI- Introduction to PROLOG and LISP, Search
strategies and Logic Programming in LISP, Production System examples in PROLOG.
REFERENCES
1. George.F.Luger, Artificial Intelligence- Structures and Strategies for Complex Problem Solving,
4/e, 2002, Pearson Education.2. E. Rich, K.Khight, Artificial Intelligence, 2/e, Tata McGraw Hill
3. Winston. P. H, LISP, Addison Wesley
4. Ivan Bratko, Prolog Programming for Artificial Intelligence, 3/e, Addison Wesley, 2000
Question Pattern:
There should be 7 questions out of which 5 should be answered. Each question would carry 20 marks
each. Each question shall carry a maximum of four sub sections which can have uneven distribution of
marks. The questions would touch upon all the sections of the syllabus as far as possible and would
Distributed systems - Concurrency - fault tolerance and failure recovery – Naming. MultilevelSecurity – Security policy model – The Bell Lapadula security policy model – Examples of
Multilevel secure system – Broader implementation of multilevel security system. Multilateral
security – Introduction – Comparison of Chinese wall and the BMA model – Inference Control –
The residual problem.
Module IV
Wholesale payment system – Automatic teller Machine –Credit cards –smartcard based banking.
Nuclear Command and control – Introduction – The kennedy memorandum – unconditionally
secure authentication codes – shared control security – tamper resistance and PAL – Treaty
Modeling Optimization Problems, Defining the Problem, Formulating a Mathematical Model,
Classical optimization techniques: Single variable optimization - Multivariable optimization,
Formulation of Linear Programming Problems, Standard Form of Linear Programming Models,
Assumptions in Linear Programming, Examples of Linear Programming Models
Module II
Shortest path problem, linear programming formulation to Shortest path problem, Dijkstra's
algorithm, Network problem, Critical path method, PERT, linear programming formulation to
CPM and PERT, Travelling sales man problem .
Module III
Integer linear programming – Branch and bound algorithm, Integer linear programming – Cutting plane algorithm, Computational consideration in Integer linear programming, Applications to real
life problems.
Module IV
Nonlinear programming basics, Elimination methods to solve Nonlinear programming,
Comparison of Elimination methods. Interpolation methods, Implementation in multivariate
Nonlinear programming problems, Unconstrained optimization techniques for Nonlinear
programming, Direct and indirect search methods to solve Nonlinear programming problem,
Nonlinear programming – Constrained optimization technique, Direct and indirect method for
Constrained optimization.
REFERENCES
1. Optimization: Theory and applications By S. S. Rao2. Operations Research - An Introduction By Hamdy A. Taha
Question Pattern:
There should be 7 questions out of which 5 should be answered. Each question would carry 20 marks
each. Each question shall carry a maximum of four sub sections which can have uneven distribution of
marks. The questions would touch upon all the sections of the syllabus as far as possible and would
PERCEPTUAL MODELS: Evaluating perceptual impact – General form of a perceptual model –Examples of perceptual models – Robust watermarking approaches - Redundant Embedding,
Spread Spectrum Coding, Embedding in Perceptually significant coefficients
CIS 206(B) SECURE PROTOCOLS FOR ELECTRONIC COMMERCE
Module I
Overview of electronic payment, Forward secure digital signatures,
Module II
On-Line Ecash, Auctions, Micropayments, Off-Line Ecash, Brands' ecash schemes, Brands' ecashschemes, SET and blinding of CC numbers, Electronic voting schemes,
Module III
Probabilistic Micropayments, NetBill and NetCheque, Security arguments for blind signatures,Group blind signatures, Identification protocols,
Module IV
Fair exchange and contract signing.
REFERENCES:
1. Donal O'Mahony and Michael A. Peirce, Hitesh Tewari, Electronic Payment Systems for E-
NLP Based Information Retrieval – Information Extraction. Categorization – Extraction Based
Categorization– Clustering .Finding and Organizing Answers from Text Search. Word classes and
part-of-speech tagging: English word classes - Tagsets for English Part-of-speech tagging - Rule-
based part-of-speech tagging - Stochastic part-of-speech tagging
Module IV: Applications
Machine Translation – General methods for machine translation – Interlingua and Corpus based
approaches-Statistical machine translation-EM algorithm-Rule based reordering and
morphological processing of SMT-Example Based Machine Translation. Rule Based MachineTranslation – Discourse Processing – Dialog and Conversational Agents
REFERENCES:
1. Ron Cole, J.Mariani, et al., “Survey of the State of the Art in Human Language Technology”,Cambridge University Press, 1997.
2. Daniel Jurafsky & James H.Martin, “Speech and Language Processing”, Pearson Education
(Singapore) Pte. Ltd., 2002.
3. James Allen, “Natural Language Understanding”, Pearson Education, 2003.
4. Gerald J. Kowalski and Mark.T. Maybury, “Information Storage and Retrieval Systems”,
Kluwer academic Publishers, 2000.
Question Pattern:
There should be 7 questions out of which 5 should be answered. Each question would carry 20 marks
each. Each question shall carry a maximum of four sub sections which can have uneven distribution of
marks. The questions would touch upon all the sections of the syllabus as far as possible and would
Problem, Process, and Product - Problems of software practitioners – approach through softwarereliability engineering- experience with SRE – SRE process – defining the product – Testing
acquired software – reliability concepts- software and hardware reliability. Implementing
semantics - security analysis - important security opportunities. Model based security engineering
with UML - UML sec profile- Design principles for secure systems – Applying security patterns
REFERENCES
1. John Musa D, “Software Reliability Engineering”, 2nd Edition, Tata McGraw-Hill, 2005
(Units I, II and III)
2. Jan Jürjens, “Secure Systems Development with UML”, Springer; 2004 (Unit IV )
Question Pattern:
There should be 7 questions out of which 5 should be answered. Each question would carry 20
marks each. Each question shall carry a maximum of four sub sections which can have unevendistribution of marks. The questions would touch upon all the sections of the syllabus as far as
possible and would preferably be analytic in nature.
This shall comprise of two seminars and submission of an interim thesis report. This report shall be
evaluated by the evaluation committee. The fourth semester Thesis-Final shall be an extension ofthis work in the same area. The first seminar would highlight the topic, objectives, methodology
and expected results. The first seminar shall be conducted in the first half of this semester. The
second seminar is presentation of the interim thesis report of the work completed and scope of the
work which is to be accomplished in the fourth semester.
Weightages for the 8 credits allotted for the Thesis-Preliminary
Evaluation of the Thesis-Preliminary work: by the guide - 50% (200 Marks)
Evaluation of the Thesis–Preliminary work: by the Evaluation Committee-50% (200 Marks)