Kannur University

KANNUR UNIVERSITY

Faculty of Engineering
Curriculum, Scheme of Examinations and Syllabi for
M-Tech Degree Programme
in

COMPUTER SCIENCE AND INFORMATION

SECURITY

Kannur University
FIRST SEMESTER
Code

CIS 101
CIS 102
CIS 103
CIS 104
CIS 105
CIS 106
CIS 107 (P)
CIS 108 (P)

Subject

Mathematical Foundations for

Computer Science
Advanced topics in Computer
Networks
Algorithms and Complexity
Theory
Foundations of Cryptography

Elective I
Elective II
Software Laboratory - I
Seminar
TOTAL

Hours/Week Sessional University Credit

Marks
Examination
L
T P
Hrs Marks
3
50
3
100
3
3

50

100

50

100

3
3
3
18

2
2
4

50
50
50
50
50
4000

3
3
3
3
--

100
100
100
100
-700

3
3
3
2
2
22

Elective 1
CIS 105(A) - Information Security Management
CIS 105(B) Machine Learning
CIS 105(C) - Object Oriented Software Engineering
CIS 105(D) - Cyber Laws and Intellectual Property Rights
CIS 105(E) - Parallel Computer Architecture

Elective II
CIS 106(A) - Computability Theory
CIS 106(B) - Secured network protocols
CIS 106(C) Principles of Network Security.
CIS 106(D) - Information Retrieval
CIS 106(E) - Cloud Computing

Kannur University

SECOND SEMESTER
Code

Subject

Hours/Week

Topics in Database
Systems
Advanced Operating
CIS 202
Systems
Mobile and Wireless
CIS 203
Security
CIS 204
Elective - III
CIS 205
Elective -IV
CIS 206
Elective -V
Advanced Software
CIS 207(P)
Laboratory
CIS 208 (P) Term Paper
TOTAL
CIS 201

Sessional
Marks

University
Examination
Hrs
Marks

Credit

50

100

50

100

50

100

3
3
3

50
50
50

3
3
3

100
100
100

3
3
3

50

100

2
4

50
400

700

2
22

18

Elective III
CIS 204 (A) Research Methodology
CIS 204 (B) Topics in Compiler Design
CIS 204 (C) - High Performance Computing
CIS 204 (D) - Ethical Hacking
CIS 204 (E) - Computational Intelligence
Elective IV
CIS 205 (A) Dependable Distributed Systems
CIS 205 (B) - Database Security
CIS 205 (C) - Optimization Techniques
CIS 205 (D) - Topics in Graph Theory
CIS 205 (E) - Digital Watermarking and Steganography
Elective V
CIS 206 (A) - Information Security Policies
CIS 206 (B) - Secure Protocols for Electronic Commerce
CIS 206 (C) - Distributed System Security
CIS 206 (D) - Natural Language Processing
CIS 206 (E) - Secure Software Engineering

Kannur University
THIRD SEMESTER
Code

Subject

Hours/
Week
L

CIS 301(P)

Thesis
Preliminary
TOTAL

Marks
Internal

University

Guide Evaluation Project

committee
22 200
200

26

200

Credit
Tota
l

Viva

200

400

400

THESIS PRELIMINARY
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, 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.

Code

Subject

FOURTH SEMESTER
Hours/
Marks
Week
Internal
L

CIS 401(P)

Thesis
TOTAL

Credit
University

Guide Evaluation Project Viva

committee
22 200
200
100
100
22 200
200
100
100

Total

600
600

12
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
be an external evaluation

Kannur University
CIS 101 MATHEMATICAL FOUNDATIONS OF COMPUTER SCIENCE
Module1
Divisibility, gcd, prime numbers, fundamental theorem of arithmetic, Congruences- Definition and
properties, solution of congruences, residue class, Eulers phi function Fermat's theorem, primality
testing, Chinese remainder theorem, Wilsons theorem.
Module II
Groups and subgroups, homomorphism theorems, cosets and normal subgroups, Lagranges
theorem, rings, finite fields, polynomial arithmetic, quadratic residues, reciprocity, Quadratic
residue : Legendre symbol- Jacobi symbol, discrete logarithms, elliptic curve arithmetic.
Module III
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.
Module IV
Graphs, Euler tours, Hamiltonian graphs, Euler's formula, graph colouring, 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.
5. C. L. Liu, Elements of Discrete Mathematics, McGraw Hill, 2/e, Singapore, 1985.

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 preferably be analytic in nature.

Kannur University
CIS 102 ADVANCED TOPICS IN COMPUTER NETWORKS
Module I:
Internetworking, IP Addressing- classful and classless, Subnetting, Advanced versions of MAC
layer protocols Bluetooth 802.11, Adhoc networks (Features). Address resolution problem, ARP,
RARP, Internet control and message Protocols, Internet group management protocols.
Module II:
Network layer level protocols, Transport layer protocols, Sockets, client/server computing, Stram
Control Transmission Protocol, Unicast routing protocols(RIP, OSPF, and BGP), Multicast routing
protocols , host configuration BOOTP and DHCP, domain name systems. TCP Congestion
Control, Random Early Detect, TCP RTT estimation.
Module III:
Traffic management : Utility Function. Traffic Models for Internet. BE, GS Classes of traffic, Diff
Serv and Int Serv, Class Based allocation, Controls at different time scales, RCBR, RSVP and
ATM Signalling, , Resource translation, Worstcase, statistical, measurement based admission
control, Capacity planning, Integrated Services RSVP,Mobile IP , Multi cast routing, CBT, PIM,
Private Networks, virtual Private Networks. Multimedia applications Real time Transport
protocol, session control and call control(SDP, SIP).
Module IV:
Issues of Network management SNMP (v2,v3)-RMON, Next Generation: IPv6 and ICMPv6,
Advanced IPN Routing and Multihoming,IP Multicast, Network performance analysis. Overlay
networks Routing overlays, peer to peer networks, and content distribution networks.Network
Simulator NS2/OPNET/Qualnet.

REFERENCES
1.
2.
3.
4.

Forouzan, TCP/IP Protocol Suite, Tata McGraw Hill.

Walrand & Varaiya,High Performance Communication Networks, 2/e, Elsevier, 2003.
James D. McCabe, Network Analysis, Architecture & Design, 2/e, Elsevier India, 2004.
Youlu Zheng / Shakil Akhtar, Networks for Computer Scientists and Engineers, Oxford
University Press

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 preferably be analytic in nature.

Kannur University
CIS 103 ALGORITHMS AND COMPLEXITY THEORY

Module I
Analysis: RAM model Notations and its logarithmic cost, Recurrence analysis - Master's
theorem and its proof - Amortized analysis
Advanced Data Structures: B-Trees, Red black trees, Binomial Heaps, Fibonacci Heaps, Disjoint
Sets, union-find and splay trees, tries.
Module II
Formal introduction to algorithmic paradigms: divide and conquer, recursion, dynamic
programming, greedy, branch and bound
Graph Algorithms and complexity: All-Pairs Shortest Paths, Maximum Flow and Bipartite
Matching.
Module III
Randomized Algorithms: Finger Printing, Pattern Matching, Graph Problems, Algebraic Methods,
Probabilistic Primality Testing, De-Randomization
Module IV
Complexity classes - NP-Hard and NP-complete Problems - Cook's theorem NP completeness
reductions. Approximation algorithms Polynomial Time and Fully Polynomial time
Approximation 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 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.

Kannur University
CIS 104 FOUNDATIONS OF CRYPTOGRAPHY
Module I
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. Key
exchange:Diffie-Hellman and MQV algorithms. Digital signatures: RSA, DAS and NR signature
schemes, blind and undeniable signatures.
Module IV
Entity authentication: Passwords,challenge-response algorithms, zero-knowledge protocols.
Network issues: Certification, public-key infrastructure (PKI), securedsocket layer (SSL),
Kerberos. Advanced topics: Elliptic and hyper-elliptic curve cryptography, cryptographically
secure random number generator.
TEXT BOOKS
1. Athul Kahate , Cryptography and Network Security, TMH
2. William Stallings, Cryptography and Network Security Principles and Practice, 5th 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 Public
World, 2nd 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 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 preferably be analytic in nature.

Kannur University

CIS 105(A) INFORMATION SECURITY MANAGEMENT

Module I
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 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.

Kannur University
CIS 105(B): MACHINE LEARNING
Module I
The concept learning task. General-to-specific ordering of hypotheses. Version spaces and
candidate elimination algorithm. Inductive bias. Decision tree learning.
Module II
Experimental evaluation of learning Algorithms instance-based learning: k-nearest neighbor
algorithm, radial basisFunctions. Case-based learning. Computational learning theory: probably
Approximately correct (pac) learning. Sample complexity. Computational Complexity of training.
Vapnik-chervonenkis dimension.
Module III
Artificial neural networks : Representation, perceptrons, multilayer networks and
backpropagation,Recurrent networks. Probabilistic machine learning maximum likelihood
estimation,Map, bayes classifiers naive bayes. Bayes optimal classifers. Minimum
descriptionLength principle.
Module IV
Bayesian networks, inference in bayesian networks, bayes netstructure learning unlabelled data:
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 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

Kannur University
CIS 105(C) OBJECT ORIENTED SOFTWARE ENGINEERING
Module I
Process models: life cycle models ,sequential activity centered models iterative activity centered
models entity centered models unified process, iterative and incremental workflow ,agile
processes .modeling with unified modeling language (uml). Requirement model, Analysis model,
design model, implementation model and test model.
Module II
Analysis: requirements elicitation activities, managing requirements .analysis concepts, Analysis
activities from use cases to objects .managing analysis. Object model (domain model) Analysis
dynamic models non-functional requirements, analysis patterns.
Module III
Design: system design decomposing the system design activities design goals managing System
design , design patterns ,object design reusing pattern solutions reuse activities Managing reuse
documenting reuse assigning responsibilities. Specifying interfaces concepts And activities
managing object design object constraint language
Module IV
Implementation, deployment and maintenance: mapping design (models) to code, mapping
Concepts, mapping activities, managing implementation. Testing concepts and activities,
managing Testing, configuration management and project management.

REFERENCES:
1.
2.
3.
4.
5.
6.
7.

Bernd bruegge, alan h dutoit, object-oriented software engineering,2/e, pearson, 2004.

Craig larman, applying uml and patterns, pearson education, 3rd edition, 2005.
Stephen schach, software engineering , mcgraw-hill, 7Th edition, 2007.
Ivar jacobson, grady booch, james rumbaugh, the unified software development
Process, pearson education, 1999.
Alistair cockburn, agile software development, pearson education, 2/e, 2007.
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 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 preferably be analytic in nature

10

Kannur University
CIS 105(D) CYBER LAWS AND INTELLECTUAL PROPERTY RIGHTS
Module I
Intellectual property rights, computer software and copyrights, copyright in databases and
electronic publishing, law of confidence, patent law, trademarks, product designs, international
implications.
Module I1
Computer contracts, liability for defective hardware and software, software contracts, web and
hardware contracts, electronic contracts and torts, liabilities.
Module II1
Computer crime, computer fraud, hacking, unauthorized modification of information, piracy,
computer pornography and harassment.
Module 1V
Data protection act 1998, data subjects rights, privacy in electronic communications, Cyber laws
in India, IT Act 2000 and the 2009 amendments, Copyright amendment Bill, 2010
REFERENCES
1. D. Bainbridge, Introduction to Computer Law, 5/e, Pearson Education, 2004.
2. Aparna Viswanathan, Cyber Laws - Indian and International Perspectives on Key topics
including Data Security, E-commerce, Cloud Computing and Cyber Crimes, 1/e, LexisNexis
Butterworths Wadhwa, 2012
3. Rakesh Kumar, Ajay Bhupen Jaiswal, Cyber Laws, Aph Publishing Corporation, 2011

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 preferably be analytic in nature

11

Kannur University
CIS 105(E) PARALLEL COMPUTER ARCHITECTURE
Module I
Solving problems in parallel, utilizing temporal and data parallelism, inter-task dependency.
Instruction level parallel processing, pipelining, superscalar and VLIW processors, multithreaded
processors and future architectures.
Module II
Structure of parallel computers, classification, vector, array, shared memory and message passing
parallel computers, Cluster of Workstations. Parallel algorithms, models of computation, analysis
of parallel algorithms, sorting, searching, matrix operations, practical models .
Module III
Parallel programming, message passing, shared memory, data parallel programming. Compiler
transformations, dependence analysis, transformations, fine grained parallelism, optimizing
compilers.
Module IV
Operating systems, resource management, process management and synchronization, IPC, memory
and I/O management. Performance evaluation, overhead, speedup, scalability, measurement tools.
REFERENCES
1. Parallel Computers Architecure and Programming, V. Rajaraman, C. Siva Ram Murthy,
Prentice Hall India, 2000
2. Parallel Computing Theory and Practice, M. J. Quinn, Tata McGraw Hill, 2002
3. Introduction to Parallel Computing 2/e, George Karypis, Vipin Kumar, Anshul Gupta, Ananth
Grama, Pearson Education, 2003

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
preferably be analytic in nature

12

Kannur University
CIS 106(A) COMPUTABILITY THEORY
Module I
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 concerning
context 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 time
and Space complexity classes Hierarchy Theorems, - Savitch's Theorem - Immerman
Szelepscenyi Theorem
NP Completeness Cook's Theorem Reductions PSPACE completeness, NLCompleteness.
REFERENCES
1. SIPSER, M. Introduction to the Theory of Computation, PWS Publishing Company, 1997
2. PAPADIMITRIOU, C. H. Computational Complexity, Addison Wesley, 1994
3. HOPCROFT, J. E. and ULLMAN, J. D. Introduction to Automata Theory, Languages and
Computation, Addison Wesley, 1979
4. Jon Barwise and John Etchemendy, Turing's World 3.0, Center for the study of Language and
Information, 1995.
5.
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
preferably be analytic in nature

13

Kannur University
CIS 106(B) SECURED NETWORK PROTOCOLS
Module I
OSI:ISO Layer Protocols:-Application Layer Protocols-TCP/IP, HTTP, SHTTP, LDAP, MIME,POP&
POP3-RMON-SNTP-SNMP.
Presentation
Layer
Protocols-Light
Weight
PresentationProtocol Session layer protocols RPC protocols-transport layer protocolsITOT,RDP,RUDP,TALI,TCP/UDP, compressed TCP.
Module II
Network layer Protocols routing protocols-border gateway protocol-exterior gateway protocolinternet protocol IPv4- IPv6-Internet Message Control Protocol- IRDP- Transport Layer SecurityTSL-SSL-DTLS.
Module III
Data Link layer Protocol ARP InARP IPCP IPv6CP RARP SLIP .WideArea
andNetwork Protocols- ATM protocols Broadband Protocols Point to Point Protocols
OtherWAN Protocols- security issues.
Module IV
Local Area Network and LAN Protocols ETHERNET Protocols VLAN protocols
WirelessLAN Protocols Metropolitan Area Network Protocol Storage Area Network and
SANProtocols -FDMA, WIFI and WIMAX Protocols- security issues. Mobile IP Mobile
SupportProtocol for IPv4 and IPv6 Resource Reservation Protocol. Multi-casting Protocol
VGMP IGMP MSDP.
REFERENCES
1. Jawin, Networks Protocols Handbook, Jawin Technologies Inc., 2005.
2. Bruce Potter and Bob Fleck, 802.11 Security, OReilly Publications, 2002.
3. Lawrence Harte, Introduction to WCDMA, Althos Publishing, 2004.
4. Ralph Oppliger SSL and TSL: Theory and Practice, Arttech House, 2009.
5. Lawrence Harte, Introduction to CDMA- Network services Technologies and Operations,
Althos Publishing, 2004.
6. Lawrence Harte, Introduction to WIMAX, Althos Publishing, 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 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

14

Kannur University
CIS 106(C) - PRINCIPLES OF NETWORK SECURITY
Module I
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
Architecture, Authentication Header, Encapsulating Security Payload, Combining Security
Associations and Key Management.
Module IV
Web Security Requirements, Secure Socket Layer (SSL) and Transport Layer Security (TLS),
Secure Electronic Transaction (SET). Basic concepts of SNMP, SNMPv1 Community facility and
SNMPv3. Intruders, Viruses and related threats. Firewall Design principles, Trusted Systems.
Intrusion Detection Systems.

Reference
1. Network Security Essentials (Applications and Standards) by William Stallings, Pearson
2. Hack Proofing your network by Ryan Russell, Dan Kaminsky, Rain Forest Puppy, Joe Grand,
David Ahmad, Hal Flynn Ido Dubrawsky, Steve W.Manzuik and Ryan Permeh, Wiley
3. Network Security and Cryptography: Bernard Menezes, CENGAGE Learning.
4. Network Security - Private Communication in a Public World by Charlie Kaufman, Radia
Perlman and Mike Speciner, Pearson/PHI.
5. Cryptography and network Security, Third edition, Stallings, PHI/Pearson
6. Principles of Information Security, Whitman, Cengage Learning.
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
preferably be analytic in nature

15

Kannur University
CIS 106(D) INFORMATION RETRIEVAL
Module I
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: lexicon
compression and postings, lists compression. Gap encoding, gamma codes, Zipf's Law. Index
construction. Postings size estimation, merge sort, dynamic indexing, positional indexes, n-gram
indexes, real-world issues.
Module II
Retrieval Models: Boolean, vector space, TFIDF, Okapi, probabilistic, language modeling, latent
semantic indexing. Vector space scoring. The cosine measure. Efficiency considerations.
Document length normalization. Relevance feedback and query expansion. Rocchio. Performance
Evaluation: Evaluating search engines. User happiness, precision, recall, F-measure. Creating test
collections: kappa measure, interjudge agreement.
Module III
Text Categorization and Filtering: Introduction to text classification. Naive Bayes models. Spam
filtering. Vector space classification using hyperplanes; centroids; k Nearest Neighbors. Support
vector machine classifiers. Kernel functions. Boosting. Text Clustering: Clustering versus
classification. Partitioning methods. k-means clustering. Mixture of Gaussians model. Hierarchical
agglomerative clustering. Clustering terms using documents.
Module IV
Web Information Retrieval: Hypertext, web crawling, search engines, ranking, link analysis,
PageRank, HITS, XML and Semantic web.

REFERENCES
1. Manning, Raghavan and Schutze, Introduction to Information Retrieval, Cambridge Univ Press.
2. Baeza-Yates and Ribeiro-Neto, Modern Information Retrieval, Addison-Wesley.
3. Soumen Charabarti, Mining the Web, Morgan-Kaufmann.
4. Survey by Ed Greengrass available in the Internet.
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
preferably be analytic in nature

16

Kannur University
CIS 106(E) CLOUD COMPUTING
Module I
Virtualized Data Center Architecture: Cloud infrastructures; public, private, hybrid. Service
provider interfaces; SaaS, PaaS, IaaS.VDC environments; concept, planning and design, business
continuity and disaster recovery principles. Managing VDC and cloud environments and
infrastructures.
Module II
Information Storage Security &Design :Storage strategy and governance; security and regulations.
Designing secure solutions; the considerations and implementations involved. Securing storage in
virtualized and cloud environments. Monitoring and management; security auditing and SIEM
Module III
Storage Network Design: Architecture of storage, analysis and planning. Storage network design
considerations; NAS and FC SANs, hybrid storage networking technologies (iSCSI, FCIP, FCoE),
design for storage virtualization in cloud computing, host system design considerations.
Module IV
Cloud Optimized Storage: Global storage management locations, scalability, operational
efficiency. Global storage distribution; terabytes to peta bytes and greater. Policy based
information management; metadata attitudes; file systems or object storage.
Information Availability Design: Designing backup/recovery solutions to guarantee data
availability in a virtualized environment. Design a replication solution, local remote and advanced

REFERENCES:
1.
2.
3.
4.
5.
6.

Greg Schulz 2011, Cloud and Virtual Data Storage Networking, Auerbach Publications [ISBN:
978-1439851739]
Marty Poniatowski, Foundations of Green IT [ISBN: 978-0137043750]
EMC, Information Storage and Management [ISBN: 978-0470294215]
Volker Herminghaus, Albrecht Scriba,, Storage Management in Data Centers [ISBN: 9783540850229]
Klaus Schmidt, High Availability and Disaster Recovery [ISBN: 978-3540244608]
Dan C. Marinescu, Cloud Computing : Theory and Practice, Morgan Kaufmann, 2013

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
preferably be analytic in nature

17

Kannur University
CIS 107(P): SOFTWARE LABORATORY I
1. TCP Client Server Program Using Sockets In Java.
2. Simulation Of Congestion/QoS Protocols.
3. Simulation of routing protocols.
4. Implementation Of advanced data structures .
5. Implementation Of graph algorithms.
6. Implementation Of symmetric cryptographic algorithms.
7. Implementation of asymmetric cryptographic algorithms.

CIS 108 (P) SEMINAR

(2 hours per week)
The student shall prepare a Paper and present a Seminar on any current topic related to the branch
of specialization under the guidance of a staff member. The student will undertake a detailed study
based on current published papers, journals, books on the chosen subject and submit seminar
report at the end of the semester. The student shall submit typed copy of the paper to the
Department. Grades will be awarded on the basis of contents of the paper and the presentation. A
common format in (.pdf format) shall be given for reports of Seminar and Project. All reports of
Seminar and Project submitted by students shall be in this given format.
Sessional work assessment
Presentation : 25
Report : 25
Total marks : 50

18

Kannur University
CIS 201 TOPICS IN DATA BASE SYSTEMS
Module I
Overview of Relational DBMS, Distributed DBMS Architecture, Distributed Database Design,
Semantic Data Control.
Module II
Overview of Query Processing, Query Decomposition and Data Localization, Optimization of
Distributed Queries.
ModuleIII
Introduction to Transaction Management, Distributed Concurrency Control, Distributed DBMS
Reliability.
Module IV
Parallel Database Systems, Distributed Object Database Management, Database Interoperability,
Current Issues.

REFERENCES
1. M. Tamer Ozsu, Patrick Valduriez, S. Sridhar, Principles of Distributed Database Systems 2/e,
Pearson Education, 2006
2. Raghu Ramakrishnan, Johannes Gehrke, Database Management Systems 3/e, McGraw Hill,
2002
3. Ceri S. and Pelagatti G, Distributed Databases Principles and Systems 1/e, McGraw Hill, 2008
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
preferably be analytic in nature

19

Kannur University
CIS 202 - ADVANCED OPERATING SYSTEMS
(Common with MCS 202)
Module I
Uniprocessing operating system: Review of Operating system concepts. Process Concept
Threads process Scheduling process synchronization Interprocess Communication semaphores Messages Monitors critical Regions conditional critical regions DeadLocks.
Real and virtual Memory management Schemes.
Module II
Multiprocessor Operating System: Multiprocessor UNIX design goals - Master slave and
multithreaded UNIX - Multicomputer UNIX extensions. Distributed Operating System:
Introduction - Design Issues. Communication in distributed systems Layered protocols ATM client server model - remote Procedure call Group communication.
Module III
Synchronization distributed systems: Clock Synchronization Mutual Exclusion Election
algorithms Atomic transactions - Deadlocks in distributed systems. Processes and processors in
distributed systems: Threads system models - Processor allocation - Scheduling in distributed
Systems.
Module IV
Distributed file system Design and implementation Trends in distributed file systems. Case
study AMOEBA, MACH, Recent trends and developments

REFERENCES
1. A.S.Tanenbaum, Modern Operating Systems, PHI Edition, 1992
2. A.S.Tanenbaum, Distributed Operating systems, PHI.
3. M. Singhal and N.G.Sivarathri, Advanced Concepts in Operating Systems, M.C.Grawhill
Inc. 1994.System Concepts, Wiley, 2000.
4. J.L.Peterson and A. Silberchatz, Operating System Concepts
5. M.Maekawa, A.E.Oldehoeft And R.R. Oldehoeft, Operating systems.
6. M.Milenkovic, Operating Systems : Concepts and Design , McGrawhill Inc Newyork, 1992
7. K.Khawng, Advanced Computer Archiecture : Parallelism , Scalability, Programmmability,
M.C.Grawhill Inc, 1993
8. C.Crowley, Operating Systems A design Oriented Approach, Irwin 1997

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 preferably be analytic in nature

20

Kannur University
CIS 203 MOBILE AND WIRELESS NETWORK SECURITY
Module I
Wireless Cellular Technologies- wireless transmision systems, Wireless data networking
technologies- spread spectrum technologies OFDM- IEEE 802.11 for Wireless LANs,
operational modes, bluetooth and High performance LANs, wireless application protocol.
Research directions in security and privacy for mobile and wireless networks.
Module II
Wireless Applications , cryptographic technologies and public key infrastructure, WEP, wireless
application protocol security, bluetooth security architecture, security monitoring and testing,.
Module II
Applying trust in mobile networks attack analysis for MANETs, existing trust models, recent
trust models. Characteristics of Ubiquitous computing interactions- challenges of unplanned
interactions.
Module II
An anonymous MAC protocol for wireless Ad-hoc networks design and security analysis,
comprehensive hardware/software schemes for security in Ad-hoc detecting misbehaviour,
identifying and isolating malicious nodes secure, QoS aware routing.
REFERENCES
1. Russel Dean Vines, Wireless Security Essentials: Defending Mobile from Data Piracy, John
Wiley & Sons, 1st Edition, 2002.
2. Mobile and wireless network security and privacy , Makki, S.K.; Reiher, P.; Makki, K.;
Pissinou, N.; Makki, S, Springer verlag
3. Cyrus, Peikari and Seth Fogie, Maximum Wireless Security, SAMS Publishing 2002.
4. Yi-Bing Lin and Imrich Chlamtac, Wireless and Mobile Networks Architectures, John Wiley
& Sons, 2001.
5. Raj Pandya, Mobile and Personal Communication systems and services, Prentice Hall of
India, 2001.
6. Tara M. Swaminathan and Charles R. Eldon, Wireless Security and Privacy- Best Practices
and Design Techniques, Addison Wesley, 2002.
7. Bruce Potter and Bob Fleck, 802.11 Security, OReilly Publications, 2002.
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 preferably be analytic in nature

21

Kannur University
CIS 204(A) RESERCH METHODOLOGY
(Common with MCS204(A),MTE204(A))

Module I
Introduction Meaning of research Objectives of research Motivation in research Types of
research 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 of
defining 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 plan
Method 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 typical
reports Simple exercises Oral presentation Planning Preparation Practice Making
presentation Answering questions - Use of visual aids Quality & Proper usage Importance of
effective communication Illustration

REFERENCES
1. 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
International
5. 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
preferably be analytic in nature

22

Kannur University
CIS 204(B) TOPICS IN COMPILER DESIGN

Module I
Introduction and Review: Language processors; The structure of a Compiler; The evolution
of programming languages; Introduction to Advanced Topics Informal Compiler Algorithm
Notation; Applications of Compiler technology.
ModuleII
Control Flow Analysis Data Flow Analysis Dependency analysis Alias analysis
Module III
Introduction Review of Early Optimizations Redundancy Elimination Loop
Optimizations .
Module IV
Register Allocation Local and Global Instruction Scheduling Advanced Topics in Code
Scheduling Low Level Optimizations .
TEXT BOOKS:
1. Steven Muchnick. Advanced Compiler Design Implementation, Morgan Kauffmann
Publishers, 1997
REFERENCES:
1. Alfred V Aho, Monica S. Lam, Ravi Sethi, Jeffrey D Ullman: Compilers - Principles,
Techniques and Tools, 2nd Edition, Pearson, 2007.
2. Charles N. Fischer, Richard J. leBlanc, Jr.: Crafting a Compiler with C, Pearson, 1991.
3. Andrew W Apple: Modern Compiler Implementation in C, Cambridge University Press, 1997.
4. Kenneth C Louden: Compiler Construction Principles & Practice, Cengage Learning, 1997.
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
preferably be analytic in nature

23

Kannur University
CIS 204(C) HIGH PERFORMANCE COMPUTING
Module I
Introduction to Parallel Computing- Motivation, Scope, Parallel Programming Platforms- Implicit
Parallelism, Limitations of Memory System Performance, Physical Organization of Parallel
Platforms, Communication Costs in Parallel Machines, Routing Mechanisms for Interconnection
Networks, Impact of Process-Processor Mapping and Mapping Techniques
Module II
Principles of Parallel Algorithm Design- Basics, Decomposition Techniques, Characteristics of
Tasks and Interactions, Mapping Techniques for Load Balancing, Methods for Containing
Interaction Overheads, Parallel Algorithm Models, Basic Communication Operations- One-to-All
Broadcast and All-to-One Reduction, All-to-All Broadcast and Reduction, All-Reduce and PrefixSum Operations, Scatter and Gather, All-to-All Personalized Communication, Circular Shift,
Improving the Speed of Some Communication Operations.
Module III
Analytical Modeling of Parallel Programs- Sources of Overhead in Parallel Programs,
Performance Metrics for Parallel Systems, The Effect of Granularity on Performance, Scalability
of Parallel Systems, Minimum Execution Time and Minimum Cost-Optimal Execution Time,
Asymptotic Analysis of Parallel Programs.
Module IV
Programming Using the Message-Passing Paradigm- Principles, Send and Receive Operations, the
Message Passing Interface, Topologies and Embedding, Overlapping Communication with
Computation, Collective Communication and Computation Operations, Groups and
Communicators, Programming Shared Address Space Platforms- Thread Basics, The POSIX
Thread API, Synchronization Primitives in Pthreads, Controlling Thread and Synchronization
Attributes, Thread Cancellation, Composite Synchronization Constructs, OpenMP, Matrix
Algorithms, Sorting Algorithms.
REFERENCES
1. Ananth Grama , Anshul Gupta , George Karypis , Vipin Kumar, Introduction to Parallel
Computing, Second Edition, Addison Wesley.
2. Michael J Quinn, Parallel Computing Theory and Practice, 2nd Edition, TMH, 2002.

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
preferably be analytic in nature

24

Kannur University
CIS 204(D) ETHICAL HACKING
Module I
Casing the Establishment - What is footprinting- Internet Footprinting. -Scanning-Enumeration basic banner grabbing, Enumerating Common Network services. Case study- Network
SecurityMonitoring
Module II
Securing permission - Securing file and folder permission.Using the encrypting file
system.Securing registry permissions.Securing service- Managing service permission. Default
servicesin windows 2000 and windows XP. Unix - The Quest for Root. Remote Access vs Local
access.Remote access.Local access.After hacking root.
Module III
Dial-up ,PBX, Voicemail, and VPN hacking - Preparing to dial up. War-Dialing.BrudeForceScripting PBX hacking. Voice mail hacking . VPN hacking. Network Devices
Discovery,Autonomous System Lookup.Public Newsgroups.Service Detection.Network
Vulnerability.Detecting Layer 2 Media.
Module IV
Wireless Hacking - Wireless Footprinting. Wireless Scanning and Enumeration.Gaining
Access.Tools that exploiting WEP Weakness.Denial of Services Attacks. FirewallsFirewallslandscape- Firewall Identification-Scanning Through firewalls- packet FilteringApplicationProxy Vulnerabilities .Denial of Service Attacks - Motivation of Dos Attackers.Types
of DoSattacks.Generic Dos Attacks.Unix and Windows DoS
REFERENCES:
1. Stuart McClure, Joel Scambray and Goerge Kurtz, Hacking Exposed Network Security
Secrets & Solutions, Tata Mcgrawhill Publishers, 2010.
2. Bensmith, and Brian Komer, Microsoft Windows Security Resource Kit, Prentice Hall of
India, 2010.

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
preferably be analytic in nature

25

Kannur University
CIS 204(E) COMPUTATIONAL INTELLIGENCE
Module I:
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, The
Genetic 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
preferably be analytic in nature

26

Kannur University
CIS 205(A) DEPENDABLE DISTRIBUTED SYSTEMS
Module I
Dependability concepts - Faults and Failures Redundancy Reliability Availability Safety
Security Timeliness - Fault-classification - Fault-detection and location - Fault containment Byzantine failures - Fault injection - Fault-tolerant techniques - Performability metrics.
Module II
Fault-tolerance in real-time systems - Space-time tradeoff - Fault-tolerant techniques (N-version
programming - Recovery block - Imprecise computation; (m,k)- deadline model) Adaptive faulttolerance - Fault detection and location in real-time systems. Security Engineering Protocols Hardware protection - Cryptography Introduction The Random Oracle model Symmetric
Crypto- primitives modes of operations Hash functions Asymmetric crypto primitives.
Module III
Distributed systems - Concurrency - fault tolerance and failure recovery Naming. Multilevel
Security 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
verification. Security printing and seals Introduction History Security printing packaging
and seals systemic vulnerability evaluation methodology.
REFERENCES
1. Ross J Anderson and Ross Anderson, Security Engineering: A guide to building
dependable distributed systems, Wiley, 2001.
2. David Powell, A generic fault-Tolerant architecture for Real-Time Dependable Systems,
Springer, 2001.
3. Hassan B Diab and Albert Y. Zomaya, Dependable computing systems: Paradigm,
Performance issues and Applications, Wiley series on Parallel and Distributed Computing,
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
preferably be analytic in nature

27

Kannur University
CIS 205(B) DATABASE SECURITY
Module I
Security Architecture, Operating System Security Fundamentals
Module II
Administration of Users, Profiles, Password Policies, Privileges, and Roles
Module III
Database Application Security Models, Database Auditing Models
Module IV
Application Data Auditing, Auditing Database Activities
REFERENCES
1. Afyouni Hassan A. , Database Security and Auditing: Protecting Data Integrity and
Accessibility, Course Technology, 2005
2. RonBen Natan, Implementing Database Security and Auditing, Elsevier, 2006.
3. Michael Gertz, Sushil Jajodia, Handbook of Database Security: Applications and
Trends,Springer, 2008.

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
preferably be analytic in nature

28

Kannur University
CIS 205(C) OPTIMIZATION TECHNIQUES
Module I
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. Rao
2. 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
preferably be analytic in nature

29

Kannur University
CIS 205(D) TOPICS IN GRAPH THEORY
Module I
Fundamental concepts (basic definitions, operations, properties, proof styles); Trees (properties,
distances and centroids, spanning trees, enumeration);
Module II
Matchings (bipartite graphs, general graphs, weighted matching); Connectivity (vertex and edge
connectivity, cuts, blocks, k-connected graphs, network flows);
Module III
Traversibility (Eulerian tours, Hamiltonian cycles); Coloring (vertex and edge coloring, chromatic
number, chordal graphs); Planarity (duality, Euler's formula, characterization, 4-color theorem);
Module IV
Advanced topics (perfect graphs, matroids, Ramsay theory, extremal graphs, random graphs);
Applications.
REFERENCES
1. Douglas B. West, Introduction to Graph Theory, Prentice Hall of India.
2. Narsingh Deo, Graph Theory with Applications to Engineering and Computer Science.
Prentice-Hall.
3. Frank Harary, Graph Theory, Narosa.
4. R. Ahuja, T. Magnanti, and J. Orlin, Network Flows: Theory, Algorithms, and Applications,
Prentice-Hall.
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
preferably be analytic in nature

30

Kannur University
CIS 205(E) DIGITAL WATERMARKING AND STEGANOGRAPHY
Module I
INTRODUCTION: Information Hiding, Steganography and Watermarking History of
watermarking Importance of digital watermarking Applications Properties Evaluating
watermarking systems. WATERMARKING MODELS : Notation Communications
Communication based models Geometric models .
Module II
MESSAGE CODING Mapping messages into message vectors Error correction coding
Detecting multi-symbol watermarks. WATERMARKING WITH SIDE INFORMATION &
ANALYZING ERRORS: Informed Embedding Informed Coding Structured dirty-paper codes
- Message errors False positive errors False negative errors ROC curves Effect of
whitening on error rates.
Module III
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
Module IV
WATERMARK SECURITY & AUTHENTICATION: Security requirements Watermark
security and cryptography Attacks Exact authentication Selective authentication
Localization Restoration; STEGANOGRAPHY: Steganography communication Notation and
terminology Information-theoretic foundations of steganography Practical steganographic
methods Minimizing the embedding impact Steganalysis

REFERENCES:
1. Ingemar J. Cox, Matthew L. Miller, Jeffrey A. Bloom, Jessica Fridrich, Ton Kalker, Digital
Watermarking and Steganography, Margan Kaufmann Publishers, New York, 2008.
2. Ingemar J. Cox, Matthew L. Miller, Jeffrey A. Bloom, Digital Watermarking, Margan
Kaufmann Publishers, New York, 2003.
3. Michael Arnold, Martin Schmucker, Stephen D. Wolthusen, Techniques and Applications of
Digital Watermarking and Contest Protection, Artech House, London, 2003.
4. Juergen Seits, Digital Watermarking for Digital Media, IDEA Group Publisher, New York, 2
5. Peter Wayner, Disappearing Cryptography Information Hiding: Steganography &
Watermarking, Morgan Kaufmann Publishers, New York, 2002.
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
preferably be analytic in nature

31

Kannur University

CIS 206(A) INFORMATION SECURITY POLICIES

Module I
About information security policies. Determining your policy needs. Information security
resposibility awareness and support.
Module II
Physical security, Authentication and network security, Internet security policies.
Module III
E-mail security policies. Viruses, worms, and Trojan Horses. Encryption, Software Development
policies.
Module IV
Acceptable Use Policies Sample policies. Compliance and Enforcement, The Policy review
process
REFERENCES
1. Scott Barman, Writing Information Security Policies, Sams Publishing, 2002.
2. Thomas.R.Peltier, Information Policies, Procedures and Standards, CRC Press, 2004.

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
preferably be analytic in nature

32

Kannur University
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' ecash
schemes, 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 ECommerce, Artech House, 2001.
2. Mostafa Hashem Sherif, Protocols for Secure Electronic Commerce, 2nd Edition, CRC Press,
2003.

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
preferably be analytic in nature

33

Kannur University
CIS 206(C) DISTRIBUTED SYSTEMS SECURITY
Module I
Background Distributed Systems, Distributed Systems Security. Security
Security Techniques.
Host-level Threats and Vulnerabilities: Transient code and Resident Code
Vulnerabilities - Malware: Eavesdropping Job Faults, injection attacks.

Issues, Common

Module II
Network-Level Threats and Vulnerabilities - Grid Computing Threats and Vulnerabilities
Storage Threats and Vulnerabilities . Application-Layer Vulnerabilities.
Module III
SOA and Role of Standards - Service-Level Security Requirements - Service-Level Threats and
Vulnerabilities - Service-Level Attacks - Services Threat Profile.
Sandboxing Virtualization - Resource Management - Proof-Carrying Code -Memory Firewall
Anti malware.
Module IV
Network-Level Solutions - Grid-Level Solutions - Storage-Level Solutions. Application-Level
Security Solutions. Service-Level Solutions. - Case Study: Grid
REFERENCES
1. Abhijit Belapurakar, Anirban Chakrabarti and et al., Distributed Systems Security: Issues.
Processes and solutions, Wiley, Ltd., Publication, 2009.
2. Rachid Guerraoui and Franck Petit, Stabilization, Safety, and Security of Distributed
Systems, Springer, 2010.

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
preferably be analytic in nature

34

Kannur University
CIS 206(D) NATURAL LANGUAGE PROCESSING
Module I: Introduction
Natural Language ProcessingLinguistic Background-Knowledge in speech and language
processing-Ambiguity-Regular expression-Finite State automata. Morphology and Finite State
Transducers: Finite-State Morphological parsing, Combining FST lexicon and rules Two level
morphology- Survey of English morphology
Module 2: Syntax
Grammar for Natural Language Processing-Context Free Grammars for English. ConstituencySentence-level constructions .The noun phrase -The verb phase and sub categorization - uxiliaries Spoken language syntax - Parsing with Context-Free Grammars: Parsing as search - A Basic TopDown parser - Problems with the basic Top-Down parser - The early algorithm The CYK
algorithm. Ambiguity Resolution, Semantic Interpretation
Module III: Information Retrieval&POS
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 - Rulebased 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 Machine
Translation 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

35

Kannur University
preferably be analytic in nature

CIS 206(E) SECURE SOFTWARE ENGINEERING

Module I
Problem, Process, and Product - Problems of software practitioners approach through software
reliability engineering- experience with SRE SRE process defining the product Testing
acquired software reliability concepts- software and hardware reliability. Implementing
Operational Profiles - Developing, identifying, crating, reviewing the operation concurrence rate
occurrence probabilities- applying operation profiles
Module II
Engineering Just Right Reliability - Defining failure for the product - Choosing a common
measure for all associated systems. - Setting system failure intensity objectives Determining user
needs for reliability and availability., overall reliability and availability objectives, common failure
intensity objective., developed software failure intensity objectives. Engineering software
reliability strategies. Preparing for Test - Preparing test cases. - Planning number of new test cases
for current release. -Allocating new test cases. - Distributing new test cases among new operations
- Detailing test cases. - Preparing test procedures
Module III
Executing Test - Planning and allocating test time for the current release. - Invoking testidentifying
identifying failures - Analyzing test output for deviations. Determining which deviations are
failures. Establishing when failures occurred. Guiding Test - Tracking reliability growth Estimating failure intensity. - Using failure intensity patterns to guide test Certifying reliability.
Deploying SRE - Core material - Persuading your boss, your coworkers, and stakeholders. Executing the deployment - Using a consultant.
Module IV
Using UML for Security - UM L diagrams for security requirement -security business process
physical security - security critical interaction - security state. Analyzing Model - Notation - formal
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 Jrjens, 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 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.

36

Kannur University

CIS 207(P): ADVANCED SOFTWARE LABORATORY

1.

Distributed deadlock detection and avoidance algorithms.

2.

Implementation of multithreads.

3.

Imlementation of database fragmentation.

4.

Concurrency control techniques

5.

Implementaion of various security algorithms.

CIS 208 (P): TERM PAPER

Prerequisite: The habit of reading technical magazines, conference proceedings and journals
Objective: To develop the skill of technical presentation and documentation and motivation for
doing research work.

The student is expected to present a report on the literature survey conducted as a prior
requirement for their phase 1 and phase 2 projects. Only the first 4 weeks of third semester is
allotted for the term paper. The phase 1 project will commence soon after the presentation of the
term paper .The Students should execute the project work using the facilities of the institute.
However, external projects can be taken up, if that work solves a technical problem of the external
firm. Prior sanction should be obtained from the head of department before taking up external
project work. Project evaluation committee should study the feasibility of each project work before
giving consent. A paper should be prepared based on the project results and is to publish in
refereed Conferences/Journals. Grades will be awarded on the basis of contents of the paper and
the presentation.

Sessional work assessment

Presentation (Evaluation committee): 25
Report (Guide): 25
Total marks: 50

37

Kannur University

CIS 301 (P): THESIS PRELIMINARY

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, 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 ThesisPreliminary work: by the Evaluation Committee-50% (200 Marks)

38

Kannur University
CIS 401(P): THESIS
Towards the end 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. At least one
technical paper is to be prepared for possible publication in journals / conferences. The final
evaluation of the thesis shall be an external evaluation. The 12 credits allotted for the Thesis-Final
may be proportionally distributed between external and internal evaluation as follows.

Weightages for the 12 credits allotted for the Thesis

Internal Evaluation of the Thesis work: by the guide - (200 Marks)
Internal Evaluation of the Thesis work: by the Evaluation Committee - (200 Marks)

Final Evaluation of the Thesis work by the Internal and External Examiners:- (200 Marks)
(Evaluation of Thesis + Viva Voce) - (100+100 Marks)

39