Calicuit Sem 5

7/30/2019 Calicuit Sem 5

http://slidepdf.com/reader/full/calicuit-sem-5 1/16

MCA @ Calicut University

UNIVERSITY OF CALICUT, THENHIPPALAM

Curriculum for Master of Computer Applications (MCA)

(From 2010 Admissions)

SEMESTER 5

1 MCA10 501 Object oriented modeling and Design 3 1 3

2 MCA10 502 Computer Graphics and Multimedia Systems 3 1 4

3 MCA10 503 Wireless Communication 3 1 3

4 MCA10 504 Elective-3 3 1 3

5 MCA10 505 Elective-4 3 1 3

6 MCA10 506(P) Seminar 6 3Total credits 19

4 Hours compulsory Library Reference work

Elective 3

MCA10 504 A Electronic Commerce

MCA10 504 B Computer Architecture

MCA10 504 C Soft computing Techniques

Elective 4

MCA10 505 A Data Mining and Data ware housing

MCA10 505 B Pattern Recognition and Classification

MCA10 505 C Distributed Computing

MCA10 501 COMPUTER GRAPHICS AND MULTIMEDIA

Objectives

To teach the fundamentals of computer graphics including algorithms for drawing 2D

and 3D primitives, object transformations and the like.

To understand the overview of multimedia systems and various data

compression techniques.

Module I: (11 hrs)




Introduction to Computer Graphics, Basic raster graphics algorithms for drawing 2D

primitives: scan converting lines, circles, ellipses - filling polygons - clipping lines, circles,

ellipses, polygons - generating representation of transformations

Module II: (11 hrs)

Homogenous coordinates and matrix techniques: Interaction hardware - basic interaction tasks

- user interface software.3D graphics: viewing in 3D - projections - basics of solid modeling -

3D transformations.

Module III: (8 hrs)

Introduction to multimedia : Media and Data Streams - properties of a Multimedia systems -Building Blocks : Audio : Basic sound concepts - Music - Speech - MIDI versus Digital Audio

- Audio file formats - sound for the web

Module IV: (8 hrs)

Images and Graphics: Basic concepts - Computer image processing. Video and Animation:

Basic concepts - Animation techniques - Animation for the web.

Module IV: (14 hrs)

Data compression : Storage space and coding requirements - classification of coding

compression techniques - Basic compression techniques like JPEG, H.261, MPEG and DVI.

Text Books

1. Foley J D, Van Dam A, Feineer S K & Hughes J F, Computer Graphis Principles and

Practices, Addison Wesley

2. Ralf Steinmetz & Klara Nahrstedt Multimedia: Computing Communications and and

Applications, Pearson Education

Reference:

1. Rogers D. F, Procedural Elements for Computer Graphics, McGraw Hill.

2. Newmann W and Sproull R. F, Principles of Intractive Computer Graphics, McGraw Hill.




Semsester 5 3

3. Hearn D and Backer P.M, Computer Graphics, Prentice Hall India.

4. Koegel Buford J.F, Multimedia System, Addison Wesely.

5. Vaughan T, Multimedia : Making it work, McGraw Hill.

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 502 WIRELESS COMMUNICATION

Objectives:

This introductory course is intended to introduce the basics of wireless and mobile

networks in the context of the recent trends in this area and their proliferation

in day to day life. Local Area Network (LAN), Wide area Network (WAN) and Inter

networking are dealt with.

Module I (8 hrs)

Introduction, wireless transmission - frequencies for radio transmission - signals - antennas -

signal propagation - multiplexing - modulation - spread spectrum - cellular systems - medium

access control - specialized MAC - SDMA - FDMA - TDMA - aloha - CSMA - collision avoidance -

polling - CDMA - comparison of S/T/F/CDMA

Module II (10 hrs)




Semsester 5 4

Telecommunication systems - mobile services - system architecture - radio interface - protocols

- localization and calling - handover - security - new data services - satellite systems- GPS-

broadcast systems - digital audio broadcasting - digital video broadcasting, WDM Optical

networks.

Module III (12 hrs)

Mobile network layer - mobile IP - packet delivery - registration - tunneling and encapsulation -

optimizations - reverse tunneling - dynamic host configuration protocol-Mobile Transport Layer-

TCP-Indirect TCP-Snooping TCP-Mobile TCP-retransmission-recovery-transaction oriented TACP

Module IV (12 hrs)

Wireless LAN-Infra red Vs radio transmission -infra structure and adhoc networks-IEEE 802.11

b/a/g-bluetooth-IEEE 802.16,adhoc networks - routing - algorithms - metrics .

Module V (10 hrs)

WAP-Design and principles of operations,WAP architecture Overview-WAP model-WAP

architecture components-WAE overview-WWW model-WAE model-WTA architecture overview-

Wireless session protocol specifications-Wireless transaction protocol specification- Wireless

transport layer security specification-Wireless datagram protocol-wireless control message

protocol specification.

TEXT BOOKS

1. Schiller J.Mobile Communications, 2/e, Pearson Education, 2003.

2. Gray.S.Rogers,John Edwards An Introduction to Wireless Technology ,Pearson Education

References

1. C.Siva Ram Murthy, Ad Hoc Wireless Networks: Architectures and Protocols,

Pearson Education, 2004.2. Singhal et.al S., The Wireless Application Protocol , Addison Wesley

3. C. Siva Ram Murthy, WDM Optical Networks: Concepts, Design, and Algorithms ,

Pearson Education.


http://et.al/

http://et.al/

http://et.al/

http://et.al/




Semsester 5 5


Tests 2x15 = 30

Total marks = 50






MCA10 503 OBJECT ORIENTED MODELING AND DESIGN

Objectives:

To give concepts of OOPs UML and Architecture diagrams

Module 1 (6 hrs)

Overview of object-oriented systems, objects, attributes, encapsulation, class hierarchy,

polymorphism, inheritance, messages, history of object orientation.

Module 2 (12 hrs)

Introduction to UML, basic expression of classes, attributes, and operations, Class diagrams:

generalization and association constructs, composition and aggregation. Use case diagrams,

Object interaction diagrams: collaboration diagrams, sequence diagrams, asynchronous

messages and concurrent execution. State diagrams: basic state diagrams, nested states,

concurrent states and synchronisation, transient states. Activity diagrams

Module 3 ( 6 hrs)

Architecture diagrams : packages, deployment diagrams for hardware artifacts and

software constructs . Interface diagrams: window-layout and window-navigation diagrams.

Module 4 (14 hrs)




Semsester 5 6

Encapsulation structure, connascence, domains of object classes, encumbrance, class

cohesion, state-spaces and behavior of classes and subclasses, class invariants, pre-conditions

and post- conditions, class versus type, principle of type conformance, principle of closed

behavior.

Module 5 (14 hrs)

Abuses of inheritance, danger of polymorphism, mix-in classes, rings of operations, class

cohesion and support of states and behavior, components and objects, design of a

component, light weight and heavy weight components, advantages and disadvantages of

using components.

Reference books

1. Page-Jones .M, Fundamentals of object-oriented design in UML, Addison Wesely

2. Booch. G, Rumbaugh J, and Jacobson. I, The Unified Modelling Language User Guide,

Addison Wesely.

3. Bahrami.A, Object Oriented System Development, McGrawHill.

4. Booch. G, Rumbaugh J, and Jacobson. I, The Unified Modelling Language Reference

Manual, Addison Wesely.

5. Larman.C, Applying UML & Patterns: An Introduction to Object Oriented Analysis &

Design, Addison Wesley

6. Pooley R & Stevens P, Using UML: Software Engineering with Objects & Components,

Addison Wesley.Sessional work assessment


Tests 2x15 = 30

Total marks = 50






MCA2010 506(P) Seminar




Semsester 5 7

Each student shall prepare and present a paper on any topic in the field of computer Science.


Presentation 30

Seminar report 20

Total marks 50

ELECTIVE SUBJECTS

MCA10 504 A ELECTRONIC COMMERCE

Module I (14 hrs)

Web commerce concepts, electronic commerce environment, electronic

marketplace technologies. Web based tools for e-commerce, web server hardware and

software, web server tools. E-commerce software, hosting services and packages.

Modes of e-commerce, EDI, commerce with WWW/ Internet.

Module II (12 hrs)

Security issues, threats to e-commerce, Approaches to safe e-commerce, secure

transactions and protocols, intruder approaches, security strategies and tools, encryption,

security teams, protecting e-commerce assets, protecting client machines, servers and

channels, transaction integrity.

Module III (12 hrs)

Electronic Payment Systems, types of e-payment, Internet monetary payment and security

requirements, payment and purchase order process, electronic cash, electronic wallets, smart

cards, credit and charge cards, risks, design of e-payment systems.

Module IV (7 hrs)

Strategies for marketing, creating web presence, identifying and reaching customers, web

branding, sales on the web. Strategies for purchasing and support activities, EDI, supply chain




Semsester 5 8

management, softwares for purchasing.

Module V (7 hrs)

Strategies for web auctions, virtual communities and web portals. International, legal, ethical

and tax issues. Planning and managing e-commerce projects.

Text Books:

1. R.Kalakota and A.B Whinston, "Frontiers of Electronic Commerce", Addison-Wesley,

New Delhi, 1996.

2. G.P. Schneider and J.T. Perry, Electronic Commerce, Course Technology, Cambridge,

2000.

References

1. D. Minoli and E. Minoli, "Web Commerce Technology Handbook" , Tata McGrawHill,New Delhi, 1998 .

2. W. Stallings, "Cryptography and Network Security Principles and practice" , 2/e,

Pearson Education Asia, 1999

3. G.W.Treese and L.C.Stewart, "Designing Systems for Internet Commerce",

Addison Wesley, New Delhi, 1998.



Tests 2x15 = 30

Total marks = 50


Seven questions covering all the five modules .Each carries 20 marks. 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 504 B COMPUTER ARCHITECTURE

Objectives

To teach ideas on parallel computing based computer architectures with a

quantitative approach.




Semsester 5 9

To impart concepts in new design paradigms to achieve parallelism, memory hierarchy

design and inter-connection networks.

Module I: (7 hrs)

Fundamentals: Task of a computer designer, trends in technology, usage and cost,

performance measurement, quantitative principles of computer design. Instruction set

architectures: classification, addressing and operations, encoding an instruction set, role of

compilers.

Module II: (8 hrs)

Case study : the DLX architecture. Pipelining: Pipeline for DLX, pipeline hazards, data and

control hazards, implementation difficulties, pipelining with multicycle operations.

Module III: (12 hrs)

Instruction level parallelism: concepts and challenges, dynamic scheduling, dynamic hardware

prediction, multiple issue of instructions, compiler and hardware support for ILP. Vector

processing: vector architecture, vector length and stride, compiler vectorization, enhancing

vector performance.

Module IV: (13 hrs)

Memory hierarchy design: reducing cache misses and miss penalty, reducing hit time, main

memory, virtual memory and its protection, Case study : protection in the Intel Pentium,

crosscutting issues. I/O systems: performance measures, reliability and availability, designing

an I/O system, Case study: Unix file system performance.

Module V: (12 hrs)

Interconnection networks: simple networks, connecting more than two computers,

practical issues. Multiprocessors: introduction, application domains, centralised-shared

memory and distributed-shared memory architectures, synchronisation, models of

memory consistency.

Text Book




Semsester 5 10

J. L. Hennesy and D. A. Pattersen, Computer Architecture: A Quantitative approach, 2/e,

Harcourt Asia Pte Ltd (Morgan Kaufman), Singapore, 1996.

References

1. D. A. Pattersen and J. L. Hennesy, Computer Organisation and Design: The Hardware/

Software Interface, 2/e, Harcourt Asia Pte Ltd (Morgan Kaufman), Singapore, 1998.

2. K. Hwang, Advanced Computer Architecture: Parallelism, Scalability and Programmability ,

McGraw Hill, Singapore, 1993.



Tests 2x15 = 30

Total marks = 50





MCA10 504 C SOFT COMPUTING TECHNIQ UES

Module I (12 Hrs)

Introduction to soft computing-Artificial intelligence systems – Neural networks, f uzzy logic, genetic algorithms. Artificial neural networks: Biological neural

networks, model of an artificial neuron, Activation functions, architectures,

characteristics-learning methods, brief history of ANN research-Early ANN

architectures(basics only)-McCulloch&Pitts model, Perceptron, ADALINE,

MADALINE

Module II (14 Hrs)




Semsester 5 11

Backpropagation networks: architecture, multilayer perceptron, back

propagation learning-input layer, hidden layer, output layer computations,

calculation of error, trainingof ANN, BP algorithm, momentum and

learningrate, Selection of various parameters inBP networks. Variations in

standard BP algorithms- Adaptive learning rate BP, resilient BP, Levenberg-

Marquardt, and con jugate gradient BP algorithms (basic principle only)-

Applications of ANN

Module III (13 Hrs)

Fuzzy Logic –Crisp & fuzzy sets – fuzzy relations – fuzzy conditional

statements – fuzzy rules – fuzzy algorithm. Fuzzy logic controller –

fuzzification interf ace – knowledge base – decision making logic –

defuzzif ication interface – design of fuzzy logic controller –case studies.

Module IV (8 Hrs)

Geneticalgorithms – basic concepts, encoding, f itness function, reproduction-

Roulette wheel, Boltzmann, tournament, rank, and steady state selections,

Elitism. Inheritance operators, Crossover - dif f erent types, Mutation, Bit-wise

operators, Generational cycle, Convergence of GA, Applications of GA – case

studies.

Module V (4 Hrs)

Introduction to genetic programming- basic concepts. Program

representation in GP, The GP process

Text Book

1. R. Rajasekaran and G. A. Vi jayalakshmi Pai, Neural Networks, FuzzyLogic, and Genetic Algorithms: Synthesis and Applications, Prentice Hall

of India, New Delhi, 2003

2. L. Fausett, Fundamentals of Neural Networks, Prentice Hall, Upper

Saddle River, N.J, 1994.

Ref erence Books




Semsester 5 12

1. D. E. Goldberg, Genetic Algorithms in Search, Optimisation, and

Machine Learning, Addison-Wesley, Reading, MA, 1989

2. M. T. Hagan, H. B. Demuth, and M. H. Beale, Neural Network Design, PWS

Publishing, Boston, MA, 1996



Tests 2x15 = 30

Total marks = 50






MCA10 505 A Data Mining and Warehousing

Objectives

To give only a broad, yet in-depth overview of the field of data mining and

warehousing, a multi-disciplinary field of study.

Module I (10 hrs)

Introduction: what is Data Mining, which data, what kinds of patterns can be mined-Data

Warehouse and OLAP technology for Data Mining,Data Warehouse Architecture. Data

preprocessing: data cleaning, data integration and transformation, data reduction,

discretization and concept - hierarchy generation.

Module II (10 hrs)

Data Mining Primitives, Languages and System Architectures. - Concept Descriptions:

Characteristic and Discriminant rules. Data Generalization. - Mining Association Rules

in Large Databases - Transactional databases.Module III (10 hrs)




Semsester 5 13

Concept Descriptions: Characteristic and Discriminant rules, Data Generalization, Example of

decision tables and Rough Sets. Classification and prediction, Decision Tree Induction (ID3,

C4.5), Bayesian Classification. Cluster Analysis. A Categorization of major Clustering methods

Module IV (9 hrs)

Introduction to Data warehousing: Need for warehousing, Data warehouse Architecture and

design, Hardware and operational design, Tuning and testing. Trends , Developments and

Applications.

Text Books

1. J. Han and M. Kamber, Data mining: Concepts and Techniques, Elsevier Science, 2007.

Reference Books

1. K.P.Soman, Shyam Diwakar, and V. Ajay, Insight into Data Mining: Theory and Practice,

Prentice Hall of India, 2006.

2. S. Sumathi, S. N. Sivanandam, Introduction to data mining and its applications,(Illustrated Edn),

Springer Publishers, 2006

3. P.M.Tan, N.Stenbach and V.Kumar, Introduction to Data Mining, Pearson Education, London,

2007

4. K.Mehmed, Data Mining: Concepts,Models, Methods, and Algorithms, John Wiley and Sons,

2003.

5. Paulraj Ponniah, Data Warehousing Fundamentals: A Comprehensive Guide for IT

Professional , Wiley Student Edition, 2007

6. S. Anaht ary and D. Murray, Data Warehousing in the Real World,:A Practical Guide for Building

Decision Support Systems, Pearson Education, 2000.

7. M.H. Dunham, Data mining: Introductory and Advanced Topics, Pearson Education, 2004.









Semsester 5 14

MCA10 505 B PATTERN RECOGNITION

Objectives

To understand di f fer ent pattern recognition methods which can be adopted in

web access and i mage pr ocessi ng.

Module I: ( 12 hrs)

Introduction- Introduction to statistical, syntactic and descriptive approaches, features

and feature extraction, learning. Bayes Decision theory- introduction, continuous case, 2-

category classification, minimum error rate classification, classifiers, discriminant

functions, and decision surfaces. Error probabilities and integrals, normal density,

discriminant functions for normal density.

Module II: (8 hrs)

Parameter estimation and supervised learning- Maximum likelihood estimation, the Bayes

classifier, learning the mean of a normal density, general bayesian learning.

Module III: ( 8hrs)

Nonparametric technic- density estimation, parzen windows, k-nearest Neighbour

estimation, estimation of posterior probabilities, nearest-neighbour rule, k-nearest

neighbour rule.

Module IV: (10 hrs)

Linear discriminant functions- linear discriminant functions and decision surfaces

generalized linear discriminant functions, 2-category linearly separable case, non-

separable behavior, linear programming procedures. Clustering- Data description and

clustering, similarity measures, criterion functions for clustering.

Module V: (14 hrs)

Syntactic approach to PR- Introduction to pattern grammars and languages, higher




Semsester 5 15

dimensional grammars- tree, graph, web, plex, and shape grammars. Stochastic grammars,

attribute grammars. Parsing techniques, grammatical inference.

Text Books

1.Duda and Hart P.E, Pattern classification and scene analysis, John Wiley and Sons, NY,

1973.

2. Gonzalez R.C. and Thomson M.G., Syntactic Pattern Recognition – an Introduction,

Addison wesley, 1997

Reference

Fu K.S., Syntactic Pattern recognition and applications, Prentice Hall, Eaglewood cliffs, N.J.,

1982.



Tests 2x15 = 30

Total marks = 50





MCA10 505 C DISTRIBUTED COMPUTING

Objectives

To give concepts of distributed systems, algorithms and distribution models.

Module I (10 hs)

Distributed systems versus Parallel systems, Models of distributed systems , Happened Before

and Potential Causality Model, Models based on States.




Semsester 5 16

Module II (10 hs)

Logical clocks, Vector clocks, Verifying clock algorithms, Direct dependency clocks, Mutual

exclusion, Lamport’s algorithm, Ricart Agrawala algorithm.

Module III (10 hrs)

Mutual exclusion algorithms using tokens and Quorums, Drinking philosophers problem, Din-

ing philosophers problem under heavy and light load conditions. Leader election algorithms.

Chang-Roberts algorithm.

Module IV (12 hrs)

Global state detection, Global snapshot algorithm, Termination detection- Dijikstra and Schol-

ten’s algorithm, Causal message ordering algorithms, Self stabilization , Mutual exclusion with

K-state machines.

References:

1. Vijay K. Garg., Elements of Distributed Computing, Wiley & Sons, 2002

2. Chow R. & Johnson T., Distributed Operating Systems and Algorithms, Addison

Wesley, 2002

3. Tanenbaum S., Distributed Operating Systems, Pearson Education.,2005

4. Coulouris G., Dollimore J. & Kindberg T., Distributed Systems Concepts And Design, 2/e,

Addison Wesley 2004



Tests 2x15 = 30

Total marks = 50






Documents

Calicuit Sem 5