calicuit sem 4

MCA @ Calicut University

Semester 4 1

UNIVERSITY OF CALICUT, THENHIPPALAM

Curriculum for Master of Computer Applications (MCA)

(From 2010 Admissions)

SEMESTER 4

1 MCA10 401 Cryptography and Network Security 3 1 3

2 MCA10 402 Software Architecture and Project Management 3 1 4

3 MCA10 403 Web Programming 3 1 3

4 MCA10 404 Elective -1 3 1 3

5 MCA10 405 Elective-2 3 1 3

6 MCA10 406(P) Mini -Project 6 3

Total credits 19

4 Hours compulsory Library Reference work

Elective I

MCA10 404 A Artificial Intelligence.

MCA10 404 B Image Processing

MCA10 404 C Advanced DBMS

Elective 2

MCA10 405 A Designs and Analysis of Algorithms

MCA10 405 B Simulation and Modeling

MCA10 405 C Embedded Systems

MCA10 401 CRYPTOGRAPHY AND NETWORK SECURITY

Objectives

To introduce the principles and practices of cryptography and network security. To discuss algorithms and schemes to handle the security issues.

To introduce web security.

Module I: (13 hrs)

Divisibility: GCD and LCM, prime numbers, fundamental theorem of arithmetic, Gauss function,


Semester 4 2

Congruence: properties-complete and reduced residue systems-Fermat's theorem- Euler

functions. Congruence in one unknown: Congruence in First degree - Chinese remainder

theorem

Module II: (10 hrs)

Introduction to cryptography: services, mechanisms and attacks- The OSI security

architecture- A model for network security, Classical Encryption Techniques: Symmetric cipher

model-Substitution techniques- transposition techniques-Rotor machine- steganography,

Modern Techniques: Simplified DES- DES- block cipher principles- cryptanalysis- block cipher

design principles.

Module III: (10 hrs)

Algorithms - Triple DES- IDEA- blowfish. Confidentiality: placement of encryption function-

traffic confidentiality- key distribution- random number generation. Public key encryption : RSA

algorithm- key management and exchange- elliptic curve cryptography.

Module IV: (9 hrs)

Message Authentication: requirements- functions and codes- hash functions- security of hash

functions and MACS. Hash Algorithms: MD5 message digest algorithm- secure hash

algorithm. Digital Signatures: authentication protocols - digital signature standard.

Authentication Applications: Kerberos.

Module V: (10 Hrs)

Electronic Mail Security : Pretty Good Privacy – S/MIME , Web Security: SSL and Transport

Layer Security- Secure electronic transaction, Firewalls: Design Principles- Trusted Systems

Text books

1. C.Y Hsiung , Elementary Theory of Numbers, Allied Publishers (World Scientific), New Delhi, 1992 (Module I)

2. W. Stallings, Cryptography and Network Security , Principles and Practices, 2/e, Pearson education Asia, 1999 ( Module II, III, IV, V)


Semester 4 3

References:

1. Niven and H.S .Zuckerman, An introduction to the Theory of Numbers, 3/e, John Wiley and Sons, NewYork , 1992

2. B. Schiner, Applied Cryptography: Protocols, Algorithms, and Source code in C, 2/e, John Wiley and Sons, NewYork, 1996

Sessional work assessment

Assignments 2x10 = 20

Tests 2x15 = 30

Total marks = 50

University examination pattern

Seven questions covering all the five modules .Each carries 20 marks and each question

should have minimum of two parts. There should be a minimum of one question from each

module. There should not be more than 2 questions from any module. The student has to

answer any five full questions for scoring full marks.

MCA10 402 SOFTWARE ARCHITECTURE AND PROJECT MANAGEMENT

Objectives

To impart the basic concepts of software architecture and design patterns.

To develop an understanding about development of complex software

systems in a methodical manner.

Module I (13 hrs)

Software Architecture - Foundations - Software architecture in the context of the overall

software life cycle - Architectural Styles - CASE study of Architectures Designing, Describing,

and Using Software Architecture - IS2000: The Advanced Imaging Solution - Global Analysis -

Conceptual Architecture View - Module Architecture View - Styles of the Module Viewtype -

Execution Architecture View, Code Architecture - View. Component-and-Connector Viewtype -


Semester 4 4

Styles of Component-and-Connector Viewtype - Allocation Viewtype and Styles - Documenting

Software Interfaces, Documenting Behavior - Building the Documentation Package.

Module II (11 hrs)

Archetypes and Archetype Patterns, Model Driven Architecture with Archetype Patterns.

Literate Modeling, Archetype Pattern. , Customer Relationship Management (CRM) Archetype

Pattern, Product Archetype Pattern, Quantity Archetype Pattern, Rule Archetype Pattern.

Design Patterns, Creational Patterns, Patterns for Organization of Work, Access Control

Patterns, Service Variation Patterns, Service Extension Patterns

Module III (13 hrs)

Object Management Patterns Adaptation Patterns, Communication Patterns, Architectural

Patterns, Structural Patterns, Patterns for Distribution, Patterns for Interactive Systems

Adaptable Systems, Frameworks and Patterns, Analysis Patterns, Patterns for Concurrent

and Networked Objects, Patterns for Resource Management, Pattern Languages, Patterns

for Distributed Computing.

Module IV (7 hrs)

Defining EAI, Data-Level EAI, Application Interface-Level EAI., Method- Level EAI., User

Interface-Level EAI, The EAI Process - An Introduction to EAI and Middleware, Transactional

Middleware and EAI, RPCs, Messaging, and EAI, Distributed Objects and EAI, Database-

Oriented Middleware and EAI, Java Middleware and EAI, Implementing and Integrating

Packaged Applications

Module V (8 Hrs)

The General Idea, XML and EAI, Message Brokers—The Preferred EAI Engine, Process

Automation and EAI. Layering, Organizing Domain Logic, Mapping to Relational Databases,

Web Presentation, Domain Logic Patterns, Data Source Architectural Patterns, Object-

Relational Behavioral Patterns, Object-Relational Structural Patterns, Object-Relational

Metadata Mapping Patterns, Web Presentation Patterns, Distribution Patterns, Offline

Concurrency Patterns.


Semester 4 5

Reference Books

1. Ian Gorton Springer, Essential Software Architecture, 1st edition, 2006.

2. Bob Hughes, Mike Cotterell, Software Project Management, 4th edition, Tata McGraw Hill, 2006.

3. Christine Hofmeister, Robert Nord, Deli Soni , Applied Software Architecture, Addison- Wesley Professional; 1st edition, 1999.

4. Erich Gamma, Richard Helm, Ralph Johnson, John Vlissides, Design Patterns: Elements of Reusable Object-Oriented Software, Addison-Wesley Professional; 1st edition.

5. Martin Fowler, Patterns of Enterprise Application Architecture, Addison- Wesley Professional, 2003.



Tests 2x15 = 30

Total marks = 50






MCA10 403 WEB PROGRAMMING

Objectives:

To impart the concepts of web programming techniques. To understand how a web

program can be developed.

Module I (10 hrs)

Internet and WWW, Creating Web Graphics, HTML, Paintshop, Photoshop, FrontPage,

Introduction to XHTML, Cascading Style Sheets.


Semester 4 6

Module II (12 hrs)

Introduction to Scripting, JavaScript: Control Statements, Functions, Arrays, Objects, Dynamic

HTML: Object Model and Collections, Filters and Transitions, Data Binding with Tabular Data

Control

Module III (10 hrs)

Building Interactive Animations, Extensible Markup Language (XML), Web Servers, Database :

SQL, MySQL, DBI

Module IV (10 hrs)

Active server pages, CGI and, PHP. (concept only)

Module V (10 hrs)

Introduction to JSP – use – compared to ASP and Servlets – Architecture – JSP environment –

using tags – declaration tag – expression tag – directive tag – scriptlet tag – action tag – implicit

object – session tracking.

Reference Books

1. H. M. Deitel, P. J. Deitel and T. R. Nieto, Internet and World Wide Web: How To Program, Pearson Education, 2000.

2. Harvey Deitel, Paul Deitel, Tem Nieto, Complete Internet & World Wide WebProgramming Training Course, Student Edition, 2/e, Prentice Hall , 2002



Tests 2x15 = 30

Total marks = 50


Seven questions covering all the five modules .Each carries 20 marks and each question should

have minimum of two parts. There should be a minimum of one question from each module.

There should not be more than 2 questions from any module. The student has to answer

any five full questions for scoring full marks.


Semester 4 7

MCA10 406(P) Mini Project

Objectives

To estimate the ability of the student in transforming the theoretical knowledge

studied so far into a working model of a computer / information system.

For enabling the students to gain experience in organisation and implementation of a

small project and thus acquire the necessary confidence to carry out main project in

the final year.

In this practical course, each group consisting of three/four members is expected

to design and develop a moderately complex computer / information system with practical

applications; this should be a working model. The basic concepts of product design may be

taken into consideration while designing the project. A committee consisting of minimum

three faculty members specialized in computer science and engineering will perform

assessment of the mini project. Students have to submit a report on the mini project

and demonstrate the mini project before the evaluation committee.

The division of the total marks is into two namely, 60% of the total marks to be

awarded by the guide / Co-ordinator and the remaining 40% by the evaluation committee.

Internal Continuous Assessment (50 marks)

40% - Design and development

30% - Final result and Demonstration

20% - Report

10% - Regularity in the class


Semester 4 8

ELECTIVE SUBJECTS

MCA10 404 A ARTIFICIAL INTELLIGENCE

Objectives

To give basic concepts in AI application.

To understand how software is developed using AI concept.

Module I(16 Hrs)

Introduction: Definition and basic concepts, Aims ,Approaches, Problems in AI, AI applications

perception and action, Representing and implementing action functions ,Production systems,

Network problem solving Methods: Forward versus Backward reasoning, Search in state spaces,

State space graphs Uniformed search, Breadth First Search, Depth First Search, Heuristic search

using evaluation functions, General graphs searching Algorithm, Algorithm A*, Admissibility of

A*,The consistency condition, Iterative deepening A*,Algorithm AO*,Heuristic functions and

search deficiency. Alternative search formulations and applications, Assignment problems,

Constraint satisfaction, Heuristic repair, Two age games, the mini max search, Alpha Beta

procedure, Game of chance.

Module II(6 Hrs)

Knowledge representation, The propositional Calculus, Using constrains on feature values,

language ,Rules of inference, Definition of Proof, semantics, Soundness and completeness, The

Problem, Meta-theorems, Associative and Distributive laws, Resolution in propositional

calculus, Soundness of Resolution, Converting arbitrary WFFS to conjunction of clauses,

Resolutions refutations, clauses.

Module III(8 Hrs)

The Predicate calculus, Motivation, The language and its syntax, Semantics, Quantifications,

Semantics of quantifiers, Resolution in predicate Calculus, Unification, Converting arbitrary

WFFs to clause form - using resolution to prove theorems, Answer extraction. Knowledge

representation by networks - Taxonomy knowledge - Semantic networks, Frames, Scripts.


Semester 4 9

Module IV(12 Hrs)

Neural Networks: Introduction, Motivation, Notation, The Back propagation method,

Generalization and accuracy, reasoning with uncertain information, Review of Probability

theory, Probabilistic inference, Bayes networks, Genetic programming, Program

representation in GP, The GP process. Communication and integration, Interacting agents, A

model logic of knowledge, Communication among agents, Speech acts, Understanding

language strings, Efficient communication, Natural language processing Knowledge based

Systems, Reasoning with Horn clauses, Rule based Expert systems.

Module V(10 Hrs)

Programming in LISP: Basic LISP primitives, Definitions, Predicates, Conditionals, And

Binding, Recursion and Iteration ,Association lists, Properties and Data abstraction, Lambda

expressions, Macros, I/O in LISP, Examples involving arrays and search.

Text Book

1. Nilsson N J, Artificial Intelligence – A new Synthesis Harcourt Asia Pvt. Ltd

Reference Books

1. Stuvert Russel, Peter Norvig, Artificial Intelligence – A Modern Approach, Prentice hall India

2. Luger G F, Stubblefield W A, Artificial Intelligence, Addison Wesley

3. Elain Rich, Kevin night, Artificial Intelligence, Tata McGraw Hill

4. Tanimotto S L, The Elements of Artificial Intelligence, Computer Science Press

5. Winston P H, LISP, Addison Wesley



Tests 2x15 = 30

Total marks = 50


Semester 4 10






MCA10 404 B IMAGE PROCESSING

Objectives

To teach basic concepts of digital image processing

Module I: 10hrs

Introduction – digital image representation – fundamental steps in image processing –

elements of digital image processing systems – digital image fundamentals – elements of visual

perception – a simple image model – sampling and quantization – basic relationship between

pixels – image geometry I

Module II: 10hrs

Image transforms – introduction to Fourier transform – discrete Fourier transform –

some properties of 2-fourier transform (DFT) – the FFT – other separable image

transforms – Hotelling transform

Module III: 12hrs

Image enhancement – point processing – spatial filtering – frequency domain – color image

processing – image restoration – degradation model – diagonalization of circulant and block

circulant matrices – inverse filtering – least mean square filter

Module IV: 10hrs

Image compression – image compression models – elements of information theory – error-

free compression – lossy compression – image compression standards


Semester 4 11

Module V: 10hrs

Image reconstruction from projections – basics of projection – parallel beam and fan beam

projection – method of generatin projections – Fourier slice theorem – filtered back

projectin algorithms – testing back projection algorithms

Text Book

1. Rafel C, Gonazalez and Wood R.E, Digital Image Processing , Addison Wesley

Reference Books

1. Rosenfeld A, Kak A C., Digital Picture Processing, Academic Press

2. Jain AK, Fundamentals of Digital Image Processing, Prentice Hall

3. Schalkoff R J, Digital Image Processing and Computer Vision, John Wiley

4. Patt W K, Digital Image Processing, John Wiley



Tests 2x15 = 30

Total marks = 50



have minimum of two parts. There should be a minimum of one question from each



MCA10 404 C ADVANCED DATABASE MANAGEMENT SYSTEMS

Objectives:

To study the concept of object oriented databases, distributed databases and

deductive databases.

To impart basic concepts of data warehousing, data accessing from


Semester 4 12

databases and information systems.

Module I: 11hrs

Overview of relational database concept – object oriented database – overview of object

oriented concepts – object definition language – object query language – object database

conceptual design – overview of CORBA standard for distributed objects

Module I: 13hrs

Distributed database concepts – data fragmentation replication and allocation type of

distributed database system – query process – concurrency control for distributed database –

overview of client-server architecture and its relationship to distributed database

Module III: 8hrs

Deductive database – introduction to deduction database prolog / datalog notation –

interpretation of rules – basic inference mechanism for logic programs – datalog programs and

their evaluation – deduction database systems

Module IV: 8hrs

Data ware housing and data mining – database on WWW – multimedia database – mobile

database – geographic information system – digital libraries

Module V: 12hrs

Oracle and Microsoft access – basic structure of the oracle system – database structure and its

manipulation in oracle – storage organization programming oracle applications – oracle tools –

an overview of Microsoft Access features and functionality – distributed database in oracle.

Text Book

1. Elmasri and Navathe, Fundamentals of Database Systems, Addison Wesley

Reference Books

1. Ramakrishnan R. & Gehrke J Database Management Systems, 3rd Edition., McGraw Hill.

2. Connolly and Begg, Database systems, 3rd Edition, Pearson Education, 2003


Semester 4 13

3. O'neil P. & O'neil E Database Principles, Programming and Performance, 2nd Edition.,

Harcourt Asia (Morgan Kaufman).

4. Silberschatz, Korth H. F. & Sudarshan S, Database System Concepts, Tata McGraw Hill



Tests 2x15 = 30

Total marks = 50






MCA10 405 A DESIGN AND ANALYSIS OF ALGORITHM

Objectives

To provide a sound basis of algorithm design and analysis techniques.

To introduce the various computing models and their capabilities with respect to

computing

Module I (13 hrs)

Analysis: RAM model - cost estimation based on key operations - big Oh - big omega - little

Oh - little omega and theta notations - recurrence analysis - master's theorem - solution to

recurrence relations with full history, probabilistic analysis - linearity of expectations - worst

and average case analysis of quick-sort - merge-sort - heap-sort - binary search - hashing

algorithms - lower bound proofs for the above problems - amortized analysis - aggregate -

accounting and potential methods - analysis of Knuth-Morris-Pratt algorithm - amortized

weight balanced trees


Semester 4 14

Module II (13 hrs)

Design: divide and conquer - Strassen's algorithm, o(n) median finding algorithm - dynamic

programming - matrix chain multiplication - optimal polygon triangulation - optimal binary

search trees - Floyd-Warshall algorithm - CYK algorithm - greedy - Huffman coding -

Knapsack, Kruskal's and Prim's algorithms for mst - backtracking - branch and bound -

travelling salesman problem - matroids and theoretical foundations of greedy algorithms

Module III (13 hrs)

Complexity: complexity classes - P, NP, Co-NP, NP-Hard and NP-complete problems - cook's

theorem (proof not expected) - NP-completeness reductions for clique - vertex cover - subset

sum - hamiltonian cycle - TSP - integer programming - approximation algorithms - vertex

cover - TSP - set covering and subset sum

Module IV (7 hrs)

Introduction to parallel systems : PRAM models – EREW, ERCW, CREW, and CRCW – relation

between various models – handling read write conflicts – work efficiency – Brent’ s theorem

Module IV (6 hrs)

Parallel merging – sorting and connected components, list rank, Euler tour technique – parallel

prefix computation – deterministic summetry breaking

Text Books:

1. Cormen T.H., Leiserson C.E, Rivest R.L. and Stein C, Introduction to Algorithms, Prentice Hall India, New Delhi, 2004, Modules I, II and III.

2. Motwani R. & Raghavan P., Randomized Algorithms, Cambridge University Press, Module IV

References:

1. Anany Levitin, Introduction to the Design & Analysis of Algorithms, Pearson Education. 2003

1. Basse S., Computer Algorithms: Introduction to Design And Analysis, Addison Wesley.

2. Manber U., Introduction to Algorithms: A Creative Approach, Addison Wesley

3. Aho A. V., Hopcroft J. E. & Ullman J. D., The Design And Analysis of Computer Algorithms,


Semester 4 15

Addison Wesley



Tests 2x15 = 30

Total marks = 50






MCA10 405 B SIMULATIONS AND MODELING Module I: (6 Hrs)

Module 1(6 hrs.)

Introduction: system and models- computer simulation and its applications – continuous

system simulation- modeling continues systems- simulation of continuous system- discrete

system simulation- methodology- event scheduling and process interaction approaches.

Module II: (6 hrs)

Random number generation- testing of randomness-generation of stochastic variates-

random samples from continuous distributions- uniform distribution- exponential

distribution m- Erlang distribution- gamma distribution-normal distribution- beta

distribution- random samples from discrete distribution- Bernoulli- discrete uniform-

binomial- geometric and Poisson.

Module III: (10 hrs)

Evaluation of simulation experiments- verification and validation of simulation experiment-

statistical reliability in evaluating simulation experiments- confidence intervals for terminating

simulation runs- simulation languages- programming considerations- general features of GPSS-


Semester 4 16

SIM SCRIPT and SIMULA.

Module IV: (15 hrs)

Simulation of queuing systems- parameters of queue- formulation of queuing problems-

generation of arrival patterns- generation of service patterns- simulation of single server

queues- simulation of multi server queues- simulation of random queues.

Module V: (15 hrs)

Simulation of stochastic network- simulation of PERT network- definition of network diagram-

forward pass computation- simulation of forward pass- backward pass computation-simulation

of backward pass- determination of float and slack times determination of critical path-

simulation of complete network- merits of simulation of stochastic networks.

Text book

1. Deon N, System Simulation And Digital Computer, Prentice Hall of India.

Reference:

1. Gordan G, System Simulation , Prentice Hall of India.

2. Law A M and Ketton W D, Simulation Modeling and Analysis, McGraw Hill.



Tests 2x15 = 30

Total marks = 50







Semester 4 17

MCA10 405 C EMBEDDED SYSTEMS

Objectives

To teach students about architecture, hardware and software elements,

programming models and practices and tools for embedded system design and

implementation.

To focus on the hardware and real time operating systems used for the embedded

systems design.

Module I (14 hrs)

Embedded systems: Overview, Design challenges-Optimising design metrics, Common design

metrics- Processor technology-General purpose processors, Single purpose processors and

Application specific processors. IC technology: Full-custom/VLSI, Semi-custom ASIC,

Compilation/Synthesis, libraries/IP, Test/Verification, Custom Single-purpose processors:

Hardware-Combinational Logic, Transistors and logic gates, Basic combinational and Sequential

logic design, Custom single purpose processor design and optimisation. General- purpose

processors: Software: Basic architecture, Datapath, Control unit, Memory, Instruction

execution, Pipelining, Superscalar and VLIW architectures, Instruction set, Program and data

memory space, Registers, I/O, Interrupts, Operating Systems, Development environment,

Design flow and tools, Testing and debugging. Application-specific instruction-set processors,

Microcontrollers, Digital signal processors. Standard single-purpose processors: Peripherals-

some examples such as Timers, counters, Analog-digital converters, etc.

Module II (7 hrs)

Memory: Write-ability and storage permanence. Common memory types, Composing

memories, memory hierarchy and cache - Cache mapping techniques: replacement, write

techniques, Cache impact on system performance, Advanced RAM, the basic DRAM, types of

DRAMS, DRAM integration problem, Memory management unit (MMU)

Module III (7 hrs)

Interfacing: Basic protocol concepts, Microprocessor interfacing: I/O addressing, interrupts,


Semester 4 18

DMA, Arbitration methods, Multi-level bus architectures, Advanced communication

principles, Parallel, Serial and Wireless communication, Error detection and correction, Bus

standards and protocols. An example: Digital camera - User's perspective, Designer's

perspective, Specification, Informal functional specification, Non-functional specification,

Executable specification Design, Implementation alternatives

Module IV(13 hrs)

State machine and concurrent process models: Models vs. languages, text vs. graphics, A basic

state machine model: finite-state machines, FSM with datapath model FSMD,

Hierarchical/Concurrent state machine model (HCFSM) and the State charts language,

Program-state machine model (PSM),The role of an appropriate model and language

Concurrent process model: Concurrent processes, create, terminate suspend, resume and join,

Interprocss Communication and synchronization methods and their implementation Case

studies : Windows CE, QNX

Module V (11 hrs)

Design technology: Automation-The parallel evolution of compilation and synthesis, Synthesis

levels, Logic synthesis, Two-level and, Multi-level logic minimization, FSM synthesis, Technology

mapping, Integration logic synthesis and physical design, Register-transfer synthesis,

Behavioural synthesis, System synthesis and hardware/software codesign, Intellectual

property cores, New challenges posed by cores to processor providers and users.

Text Books

1. Frank Vahid and Tony Givargis, Embedded System Design: A Unified

Hardware/Software Introduction, Wiley, 2002.

Reference Books

1. Jack Ganssle, The Art of Designing Embedded Systems, 2nd ed., Elsevier, 2008.

2. Raj Kamal, Embedded systems - architecture, programming and design, Tata McGraw Hill, 2007.

3. Steve Heath, Embedded Systems Design, 2nd ed., Elsevier, 2006.


Semester 4 19

4. Tammy Noergaard, Embedded Systems Architecture: A Comprehensive Guide for Engineers and Programmers, Elsevier, 2008.

5. A.N.Sloss, D. Symes, and C. Wright, ARM System Developer’s Guide: Designing and Optimizing System Software, Morgan Kaufmann Publishers/Elsevier, 2008.



Tests 2x15 = 30

Total marks = 50



have minimum of two parts. There should be a minimum of one question from each



calicuit sem 4

Documents