MCA Syllabus 2014 [with effect from 2014 – 2015 session]

25/03/2014

Department of Computer Science

The University of Burdwan

Golapbag (North),

Burdwan – 713 104

CONTENTS:

Outline of the syllabus: 01

Overall structure of the syllabus 02

MCA – 101: Digital Logic and Computer Organization 05 MCA – 102: Programming Techniques 07 MCA – 103: Accounting & Financial Management 08 MCA – 104: Computer Graphics and Principles of Multimedia 10 MCA – 105: Mathematics – I 13 MCA – 106: Digital Logic Lab. & Accounting Packages Lab. 16 MCA – 107: Programming Practices and Graphics & MM Lab. 16

MCA – 201: Microprocessors & Microcontrollers 17 MCA – 202: Data Structures 18 MCA – 203: Theory of Computing 19 MCA – 204: Management Information Systems 20 MCA – 205: Object Oriented Programming 23 MCA – 206: Data Structure Lab. & Information Systems Lab. 25 MCA – 207: OOP & Microprocessor Lab. 25

MCA – 301: Software Engineering 26 MCA – 302: Operating Systems 29 MCA – 303: Database Management Systems 32 MCA – 304: Mathematics – II 36 MCA – 305: Design & Analysis of Algorithms 37 MCA – 306: Algorithms & Operating Systems Lab. 39 MCA – 307: DBMS & Software Engineering Lab. 39

MCA – 401: Computer Networks and Data Communications 40 MCA – 402: Operations Research 42 MCA – 403: Java Technologies 43 MCA – 404: Compiler Design 44 MCA – 405: .Net Technologies 45 MCA – 406: Java Technology Lab. & .NET Lab. 46 MCA – 407: Compiler Design Lab., OR & Network Lab. 46

MCA – 501: Internet & Web Technologies 47 MCA – 502: Artificial Intelligence 48 MCA – 503: Elective – I 49 MCA – 504: Elective – II 49 MCA – 505: Term Paper & Seminar 50 MCA – 506: Web Technology Lab. & AI Lab. 50 MCA – 507: System Lab. 50

MCA – 601: Project Work 51 MCA – 602: Grand Viva 51 MCA – 603: Social Service 51

Detailed syllabus of elective papers 52

1

THE UNIVERSITY OF BURDWAN

DEPARTMENT OF COMPUTER SCIENCE

SYLLABUS FOR M. C. A. (MASTER OF COMPUTER APPLICATION ) COURSE

(EFFECTIVE FROM ACADEMIC SESSION: 2014 – 2015)

1) Duration : Three Years (Six Semesters)

2) Total Marks : 4000 (700 + 700 + 700 + 700 + 700 + 500)

3) Total Credit Points : 150 (26 + 26 + 26 + 26 + 24 + 22)

4) Number of Papers : Total Thirty Eight, out of which, Twenty Four are Theoretical, Ten Practical, One Term Paper and Seminar, One Major Project Work, One Grand Viva, and One Social Outreach Programme.

5) Distribution of Marks : All Theoretical and Practical papers are of full marks

100, out of which, 80 marks for University Exam. & 20 marks for Sessional. Sessional marks of theoretical papers will come from two mid – term examinations of 10 marks each. For Term Paper & Seminar, 100 marks will be of University Exam. For Project Work paper, full marks is 300, out of which, 100 marks for Project Report and 200 marks for Seminar. Grand Viva will be of 100 marks and will be of University Examination. Social Outreach will be of University Exam., and, will be of 100 marks.

6) Duration of Univ. Exam. : Three Hours for Theoretical Papers and Four Hours

for Practical Papers.

7) Instruction Period : In L-T-P pattern, ‘L’ lectures, ‘T’ tutorials, and, ‘2xP’ practical hours per week are needed for each paper. Unless otherwise specified, credit point of a paper will be: L + T + P. At least 50 hours are needed for each theory and practical paper. Two hours per week will be given for remedial purpose (except 6th Semester).

8) Semester Duration : 16 Weeks.

THIS SYLLABUS IS IN COMPLIANCE WITH : � Suggestions and recommendations made by our Honorable Vice Chancellor, Professor

Smritikumar Sarkar and our alumni working in different industries and institutions. � Curriculum for M. C. A. Degree suggested by All India Council for Technical Education

(AICTE ) (with All India Board of Computer Science, Engg. / Tech. and Applications). � Syllabus for Paper – II & Paper – III of UGC NET Examination in Computer Science and

Applications (Subject Code: 87). � Computer Science Curricula – 2013 (December 20, 2013) recommended by The Joint Task

Force on Computing Curricula (ACM and IEEE Computer Society).

2

FIRST SEMESTER: Theory: (L-T-P) Credit MCA – 101: Digital Logic and Computer Organization (4-0-0) 4 MCA – 102: Programming Techniques (3-1-0) 4 MCA – 103: Accounting & Financial Management (4-0-0) 4 MCA – 104: Computer Graphics and Principles of Multimedia (3-1-0) 4 MCA – 105: Mathematics – I (4-0-0) 4 Practical: MCA – 106: Digital Logic Lab. & Accounting Packages Lab. (0-0-6) 3 MCA – 107: Programming Practices and Graphics & Multimedia Lab. (0-0-6) 3 # MCA – 102 can be offered to other departments in CBCS system. # MCA – 103 may be offered by Department of Commerce in CBCS system. # MCA – 105 may be offered by Department of Mathematics in CBCS system.

SECOND SEMESTER: Theory: (L-T-P) Credit MCA – 201: Microprocessors & Microcontrollers (4-0-0) 4 MCA – 202: Data Structures (3-1-0) 4 MCA – 203: Theory of Computing (3-1-0) 4 MCA – 204: Management Information Systems (4-0-0) 4 MCA – 205: Object Oriented Programming (3-1-0) 4 Practical: MCA – 206: Data Structure Lab. & Information Systems Lab. (0-0-6) 3 MCA – 207: OOP & Microprocessor Lab. (0-0-6) 3

# MCA – 205 can be offered to other departments in CBCS system.

THIRD SEMESTER:

Theory: (L-T-P) Credit MCA – 301: Software Engineering (4-0-0) 4 MCA – 302: Operating Systems (3-1-0) 4 MCA – 303: Database Management Systems (3-1-0) 4 MCA – 304: Mathematics – II (4-0-0) 4 MCA – 305: Design & Analysis of Algorithms (3-1-0) 4 Practical: MCA – 306: Algorithms & Operating Systems Lab. (0-0-6) 3 MCA – 307: DBMS & Software Engineering Lab. (0-0-6) 3 # MCA – 303 can be offered to Department of Business Administration and Department of Commerce in CBCS system. # MCA – 304 may be offered by Department of Statistics in CBCS system.

3

FOURTH SEMESTER: Theory: (L-T-P) Credit MCA – 401: Computer Networks and Data Communications (4-0-0) 4 MCA – 402: Operations Research (4-0-0) 4 MCA – 403: Java Technologies (3-1-0) 4 MCA – 404: Compiler Design (4-0-0) 4 MCA – 405: .Net Technologies (3-1-0) 4 Practical: MCA – 406: Java Technology Lab. & .NET Lab. (0-0-6) 3 MCA – 407: Compiler Design Lab., OR & Network Lab. (0-0-6) 3 # MCA – 402 may be offered by Department of Mathematics in CBCS system. # MCA – 403 can be offered to Department of Mathematics, and, Department of Statistics in CBCS system.

FIFTH SEMESTER: Theory: (L-T-P) Credit MCA – 501: Internet & Web Technologies (3-1-0) 4 MCA – 502: Artificial Intelligence (4-0-0) 4 MCA – 503: Elective – I (4-0-0) 4 MCA – 504: Elective – II (4-0-0) 4 Practical: MCA – 505: Term Paper & Seminar (0-0-4) 2 MCA – 506: Web Technology Lab. & AI Lab. (0-0-6) 3 MCA – 507: System Lab. (Elective – I and Elective – II) (0-0-6) 3

SIXTH SEMESTER: (L-T-P) Credit MCA – 601: Project Work (24-0-0) 12 (Report: 100, Seminar: 200) MCA – 602: Grand Viva (0-0-0) 6 MCA – 603: Social Outreach Programme (0-0-0) 2

4

L IST OF ELECTIVES :

Elective – I & Elective - II should be chosen from the given lists: Elective – I:

E – 01: Advanced Network Programming

E – 02: Network Security & Cryptography

E – 03: Mobile Computing

E – 04: Advanced Unix Programming

E – 05: Advanced Windows Programming

E – 06: Pattern Recognition

E – 07: Computational Geometry

Elective – II:

E – 08: Advanced Operating Systems

E – 09: Computational Intelligence

E – 10: Natural Language Processing

E – 11: Data Warehousing & Data Mining

E – 12: Advanced DBMS

E – 13: Embedded Systems & VLSI Design

E – 14: Image Processing

E – 15: Object Oriented Analysis & Design

L IST OF PAPERS OFFERED FOR STUDENTS OF OTHER PG DEPARTMENTS :

CSO – 01: Programming in C (L-T-P: 4-0-2)

CSO – 02 / MMATA0406: Java Technologies (L-T-P: 2-1-1)

CSO – 03: Computing for Management (L-T-P: 3-1-2)

CSO – 04: Computing for Commerce and Business (L-T-P: 3-1-2)

5

FIRST SEMESTER:

____________________________________________________________________________

Theory: (L-T-P) Credit MCA – 101: Digital Logic and Computer Organization (4-0-0) 4 MCA – 102: Programming Techniques (3-1-0) 4 MCA – 103: Accounting & Financial Management (4-0-0) 4 MCA – 104: Computer Graphics and Principles of Multimedia (3-1-0) 4 MCA – 105: Mathematics – I (4-0-0) 4 Practical: MCA – 106: Digital Logic Lab. & Accounting Packages Lab. (0-0-3) 3 MCA – 107: Programming Practices and Graphics & Multimedia Lab. (0-0-3) 3 ____________________________________________________________________________ MCA – 101: DIGITAL LOGIC AND COMPUTER ORGANIZATION :

DIGITAL LOGIC : [70%]

A) Number Systems and Codes: Algorithms for conversion between different number

systems and between different codes, Representation of Real Numbers as Fixed Point

and Floating Point signed binary numbers, IEEE standards of representation. Error

Correcting and Error Detecting codes. [7%]

B) Computer Arithmetic : Addition & subtraction of signed & unsigned numbers,

multiplication & division algorithms, floating point & BCD arithmetic. [7%]

C) Boolean Algebra: Postulates, fundamental theorems and fundamental operations,

Boolean functions and their representation using Venn diagrams, Truth tables and

Karnaugh maps, duality and complementation, Canonical form, Sum of Product and

Product of Sum forms, minimization of Boolean functions through fundamental

theorems, Karnaugh maps and Quine-McCluskey's tabular method. [14%]

D) Combinational Circuits: Encoder / Decoder, Code Converter, Comparator,

Multiplexer / Demultiplexer, Parity Generator / Checker, Adder / Subtractor etc.

Design of combinational circuits using Universal gates, Multiplexers, ROMs and

PLAs. [21%]

E) Sequential Circuits: Different types of Flip Flops and their characteristic and

Excitation tables. State reduction and assignment, design with state equation, Storage

Registers, Register transfer logic, Shift Registers, Counters, design of Binary, Decade

and Modulo-N counters, Counters using Shift Register with feedback. [ 21%]

6

COMPUTER ORGANIZATION : [30%]

A) Basics of Computer Organization: Stored Programme Organization, Common Bus

System, Timing and Control, Instruction Cycles, Memory reference instructions and

I/O reference instructions, Interrupt, Interrupt Cycle, Design of basic Computer,

Control Unit. [10%]

B) Memory Organization: Introduction to Memory Organizations, memory hierarchy,

classification of memory, associative memory, cache memory, main memory, auxiliary

memory, memory interleaving, virtual memory, memory management hardware,

instruction cache. [5%]

C) I/O Organization: Introduction to I/O organization, addressing of I/O devices,

modes of I/O transfer, I/O using interrupts, DMA, Different bus organizations,

I/O controllers. [5%]

D) CPU Organization: General register based & stack based organization, instruction

formats, addressing modes, instruction execution cycles, micro-programming concepts:

horizontal, vertical and diagonal microinstruction formats, microprogramming with

multiple formats, speed mismatch between CPU & memory and methods of alleviating

it, internal bus organization, ALU organization, ALU design, Control units: hardwared

control, Wilkes control, micro programmed control [5%]

E) Introduction to Computer Architecture: Von-Neumann architecture, stored

programme architecture, RISC and CISC, introduction to pipelining architecture, case

study of architectures of mainframe / minicomputers, characteristics of multiprocessors

and multi - core systems. [5%]

REFERENCE BOOKS:

1) Digital Logic and Computer Design: M. M. Mano, PHI

2) Digital Logic Design Principles: Bradley Carlson, Norman Balabanian, Wiley India

3) Structured Computer Organization: A. S. Tanenbaum, PHI

4) Computer System Architecture: M. M. Mano, PHI

5) Digital Logic Design: Holdsworth, Elsevier India

6) Digital Logic Design: Guy Even, Moti Medina, Cambridge University Press

7) Digital Design Principles and Practices: John F. Wakerly, Pearson Education

8) Fundamentals of Digital Logic with VHDL Design: Stephen Brown, Zvonko Vranesic,

Tata McGraw Hill

9) Digital Principles and Applications: Donald P. Leach, Albert Paul Malvino,

Goutam Saha, Tata McGraw Hill

7

10) Digital Design With An Introduction to the Verilog HDL: Morris Mano, Michael D.

Ciletti, Pearson

11) Computer System Architecture: M. M. Mano, P.H.I

12) Computer Organization and Architecture Designing for Performance: William

Stallings, Pearson

13) Computer Architecture and Organization: Hayes, McGraw Hill International Edn.

14) Computer Organization, 4th edition.: V. C. Hammacher et al, T.M.H

15) Microcomputer System (8086): Liu & Gibson, P.H.I

16) Computer Systems Organization and Architecture: John D. Carpinelli, Pearson

17) Computer Organization: Carl Hamacher, Zvonko Vranesic, Safwat Zaky, Tata

McGraw Hill

MCA – 102: PROGRAMMING TECHNIQUES:

A) Fundamentals of Programming: Introduction to computers and operating

environment, program development cycle, algorithm, representation of algorithms

(Pseudo code, Flowchart), different styles of programming, desired characteristics of a

good program. [5%]

B) Introduction to C: Primitive data types, constants and variables, declaration and

definition, modifications of declarations, operators (assignment, shorthand

assignments, relational, logical, bitwise, special), type casting, precedence rule. [5%]

C) Control Structures: Sequence, branching, iteration, statements and blocks, if, if – else

ladder, switch – case, while, do – while, for, break, continue, goto. [10%]

D) Arrays, Strings and Pointers: Declaration of array, initialization, access mechanism,

dimensions of arrays, row-major and column-major representations, strings and

manipulations of strings, pointers, multiple redirection, pointer declaration and

initialization, accessing elements using pointers, pointer arithmetic, pointer to arrays

and array of pointers, void pointer, pointer to functions. [25%]

E) Functions & Program Structure: Function, prototype, signature, definition,

recursion, scope and lifetime of data, available prototypes of main function, passing

arguments, variable number of arguments, command line arguments. [15%]

F) User Defined Data Types: Type definition, Structure, Union, Enumerations, Bitfields,

Self referential structures and their applications. [15%]

G) Console I/O & File I/O and Standard Libraries: Introduction to standard I/O,

formatted and unformatted I/O, serial and block I/O, sequential and random file

8

handling, standard libraries, like, stdio.h, string.h, math.h, stdlib.h, assert.h, ctype.h,

stdarg.h, stddef.h [15%]

H) Pre-processing directives: Macro, definition, call, substitution, multiline and

parameterized macros with their usage, other directives like: include, conditional

compilation directives, pragma, language defined macros and constants. [10%]

REFERENCE BOOKS:

1. The C Programming Language: Bryan W. Karnighan, Dennis M. Ritchie, PHI

2. Programming with C: B. S. Gottfried, McGraw Hill

3. Programming in ANSI C: E. Balagurusamy, Tata McGraw Hill

4. The Sprit of C: Henry Mullish, Herbert L. Cooper, Jaico

5. The Complete Reference C (with C99): Herbert Schildt, Tata McGraw Hill

MCA – 103: ACCOUNTING & FINANCIAL MANAGEMENT :

A) Accounting: Meaning, objectives, functions, advantages and limitations; accounting as

a language, accounting cycle, accounting information, users of accounting; different

accounting concepts, conventions; accounting principles: GAAP, International

Accounting Standard (IAS – I), Indian Accounting Standard (IAS – I). [7%]

B) Double Entry System: Double entry system, it’s advantages and limitations;

transactions and events, differences; accounts, it’s classification, application of Golden

rules, transactions relating to goods, cash and accrual basis of accounting; mixed or

hybrid basis; conversion. [10%]

C) Journal, Ledger and Trial Balance: Journal, it’s classifications and specimen,

features, advantages, special journal and compound journal; Ledger, meaning, features,

advantages, process of ledger posting, balancing of accounts; Trial Balance, meaning,

advantages and limitations, utilities, method of preparation of trial balance, errors

which are disclosed and which are not disclosed by the trial balance. [8%]

D) Cash Book: Meaning of cash book, different types of cash book, preparation of single

column and double column cash book, contra entry, treatment relating to cheque

transactions. [5%]

E) Bank Reconciliation Statement: Meaning, need, reasons for differences in two

balances (cash book balance and pass book balance), procedure for preparation of bank

reconciliation statement. [4%]

F) Measurement of Accounting Income: Concept of revenue, gain, loss, expenses, cost,

revenue expenditure and capital expenditure, their differences. [3%]

9

G) Assets and Liabilities: Definition, classifications, features, recognition; concept of

balance sheet, methods, preparation of balance sheet. [4%]

H) Final Accounts: Introduction of manufacturing account, preparation of trading, profit

& loss account, and balance sheet of sole proprietorship business, partnership firms,

limited company with normal closing entry. [8%]

I) Introduction to Computerised Accounting System: Coding logic and codes

required, master files, transaction files; introduction to documents used for data

collection, processing of different files and outputs obtained. [4%]

J) Financial Management: Meaning, scope and role, functions, functional area of

financial management, financial management process, organization of financial

function. [3%]

K) Ratio Analysis: Meaning, advantage and limitations, importance, types of ratios and

their usefulness, computation of different ratios and their interpretations. [7%]

L) Fund Flow Statement: Meaning, advantages and limitations, differences between

fund flow and cash flow, working capital cycle, preparation and interpretation of fund

flow statement. [7%]

M) Costing: Definition, nature and importance, advantages and limitations, objectives,

installation of good costing system, classifications of costs, basic principles;

preparation of cost sheet. [8%]

N) Budget and Budgetary Control: Meaning of budget and budgetary control, nature

and scope; objectives, importance and limitations; method of finalisation of master

budget and functional budgets; steps in budgeting, zero base budget, responsibility

accounting. [8%]

O) Standard Costing: Meaning of standard cost and standard costing, advantages and

limitations of standard costing, differences between standard costing and budgetary

control, analysis of variances (material, labour). [8%]

P) Marginal Costing: Nature, scope and importance; break – even analysis, it’s uses and

limitations, construction of break – even chart, practical applications of marginal

costing. [6%]

REFERENCE BOOKS:

1) Financial Accounting: A. Mukherjee & M. Hanif, Tata McGraw Hill

2) Accountancy (Volume – 1): S. Kr. Paul, New Central Book Agency

3) Financial Accounting: Jawaharlal and Seema Srivastava, S. Chand Pub.

4) Basic Accounting: Rajani Safat & Preeti Hiro, PHI

5) Advanced Accountancy: S. P. Jain & K. L. Narang, Kalyani Publishers, New Delhi

6) Financial Management: Sashi K. Gupta & P. K. Sharma, Kalyani Publishers

10

7) Financial Management – A Self Study Text Book: Dr. P. C. Tulsian, S. Chand Pub.

8) Financial Management – Principles and Practice: Dr. S. N. Maheswari, Sultan Chand

and Sons, New Delhi

9) Cost Accounting: J. Madegowda, Himalaya Pub., New Delhi

10) Methods and Techniques of Costing: M. F. Thukaram Rao, New Age International

11) Cost Accounting: M. Y. Khan, Tata McGraw Hill Education Pvt. Ltd.

12) Modern Cost and Management Accounting: M. Hanif, Tata McGraw Hill, New Delhi

13) Modern Cost and Management Accounting: Debasis Banerjee, Book Syndicate (P) Ltd.

MCA – 104: COMPUTER GRAPHICS AND PRINCIPLES OF MULTIMEDIA :

A) Introduction: Multisensory perception of human (sight, hearing, touch, smell, taste);

meaning of multimedia; contemporary elements of multimedia: text, rich text,

hypertext, pictures (images / graphics), video (motion pictures, motion video),

animation, sound, braille; advantages of using multimedia in computer; recent

advances in exploration of multisensory perception; application of computer graphics

& multimedia: science, engineering, medical, business, journalism, industry,

government, management, communication, art, entertainment, AI, games, advertising,

education and training. [5%]

B) Interactive Graphics System: Raster vs. vector graphics, video display unit / monitor

(CRT, LCD, TFT, LED, Plasma – gas, electroluminescent (EL), vacuum fluorescent);

types, construction and specification of display devices; non – linear nature of CRT

monitor (to gray scale) and corresponding gamma correction; architecture of a raster

graphics system, video adapter card, display standards (MD / CG / HG / EG adapters,

VGA / XGA, HD, + / F / Q / S / U / W / X / H modifiers), frame buffer, Video RAM,

graphics controller and processor, MCA / PCI / AGP / PCIE interfaces, VGA / DVI / S

– Video / HDMI interfaces, DAC, Video BIOS; 3D viewing devices, stereoscopic and

virtual reality systems, random scan display and system; hard copy devices (printer,

plotter, film camera); types, construction and specification of different printers and

plotters; logical interactive functions (locator, valuator, button / choice, pick, string,

stroke), physical interactive input devices (keyboard, mouse, trackball, space ball,

joystick, data glove, touch panel, control dial, function switches, light pen, voice

input), data generation / digitizer devices (scanner, digital camera, 3D digitizer, motion

capture); input modes (request, sample, event); graphics functions; graphics standards;

different contemporary graphics software, typical elements of GUI of a multimedia

computer (desktop & application panels & windows, widget, applet, taskbar, task pane,

11

launch bar, title bar, menu, tool bar, ribbon, toolbar fly – out, dockable toolboxes, MDI

/ SDI / tabbed / explorer style environment, icon, cursor, dialog box, hot & shortcut

keys, highlight, rubber band, marching ant, gravity field, dragging, interactive GUI

controls); Human Computer Interaction (HCI). [15%]

C) Colours in Graphics: Spectrum of visible light, spectral colours, colour of light source

vs. visible object, human sensation to light / colour; hue / colour / dominant frequency /

dominant wavelength, brightness / luminance / gray scale, purity / saturation,

chromacity / chrominance (hue + saturation); intuitive description (pure colour, shade,

tint, tone); concept of primary colours, non – availability of finite set of primary

colours, colour matching experiments, standard primaries, CIE XYZ colour space and

chromacity diagram, problem with 500 nm range colours; need for colour model and

gamut; RGB model and colour cube (tri – stimulus theory of vision, chromacity

coordinates of R, G, and B in NTSC standard / CIE model / colour monitors), concept

of splitted vs. composite signal: NTSC YIQ, PAL YUV, SECAM models; subtractive

colour model in hardcopy devices: CMYK model and colour cube; device independent

/ other models: Ostwald, Munsell, HSV, HLS, CIE Lab, CIE Luv, Pantone; comparison

and conversion between different colour models; indexed colour: colour look – up

table; tone of graphics: continuous tone, bi – tone, half – tone. [15%]

D) 2D Raster Graphics Generation: Concept of point, line (straight / curved) and area,

shape drawing vs. area filling, Cartesian vs. polar coordinate system, non – parametric

(implicit / explicit) vs. parametric representation, modelling objects using Euclidean

geometry / fractal geometry / graftals / others, sequential vs. parallel algorithms,

properties of conic sections (straight line, circle, ellipse, parabola, hyperbola), spirals,

graphs of polynomial, trigonometric, exponential, non – linear regression, probability

distribution functions, splines (interpolation and approximation), Bézier curves;

difference between real object (dimensionless point based) and raster graphics (2D

pixel based), basic object drawing (scan conversion) algorithms (DDA / Bresenham’s

midpoint line drawing, midpoint circle / ellipse drawing); maintenance of object

geometry in raster graphics; area within a polygon / curved boundary; methods of

polygon filling: scan – line (parity scan, ordered edge fill, edge fill, edge flag), seed fill

(boundary, flood, soft, tint fill); dealing with inside / outside region of a complex

polygon (odd – even rule, exterior rule, non – zero winding rule); simple antialiasing

techniques for achieving realistic appearance; drawing attributes. [20%]

E) Graphics Transformations: Concept of transformation, transformations before and

after scan conversion (object space and image space) or both; types of transformations:

geometric transformation (translation, rotation, scaling, reflection, shear), viewing

transformation (windowing, clipping against rectangle / arbitrary convex polygon,

12

scissoring, zooming, panning), coordinate transformation (affine), projection

transformation (parallel / perspective projections, projection / isometric view),

modelling transformation, composite transformation , image transformations (cropping,

half – toning / dithering, masking, filtering, morphing, effects); 2D & 3D homogeneous

coordinates; transformation matrix for 2D & 3D simple & composite geometric,

projection, coordinate & dithering transformations; clipping algorithms: line clipping

(Cohen – Sutherland, Cyrus – Beck, Liang – Barsky, Nicholl – Lee – Nichole),

polygon clipping (Sutherland – Hodgeman, Weiler – Atherton), circle and ellipse

clipping. [15%]

F) 3D Graphics Specialties: Modelling and representation of natural 3D surface, solid,

particles, clouds; hidden surface (line) elimination / visible surface (line) detection

techniques in object space / image space: sorting and coherence; floating horizon,

haloed line, Z – buffer, A – buffer, scan – line, depth sorting, BSP, area subdivision,

octree, wireframe methods; concept of illumination; concept of 3D surface rendering:

transparency, shading, shadows, texture, ray tracing, radiocity. [15%]

G) Principles of Multimedia: Audio basics (acoustics, characteristics of sound, note and

pitch, µ - phone, amplifier, loudspeaker, twitter, woofer, audio mixer, digital audio,

synthesizer, file formats and codecs, voice recognition); video basics (analog and

digital video, video editing, video file formats, video standards); animation basics

(keyframe, tweening, cel animation, path / sprite animation, transformation animations:

shape / size / morphing / color cycling, onion skinning, motion cycling, flip book

animation, rotoscoping); multimedia content / document / application development;

multimedia database; multimedia through network; virtual reality. [15%]

REFERENCE BOOKS:

1) Computer Graphics (C version): Donald Hearn, M. Pauline Baker, Pearson

2) Procedural Elements for Computer Graphics: David F. Rogers, Tata McGraw Hill

3) Computer Graphics Principles & Practice, 2nd Edition in C: J. D. Foley, A. van Dam,

S. K. Feiner, J. F. Hughes, Pearson

4) Principles of Interactive Computer Graphics, 2nd Edition: William M. Newman, Robert

F. Sproull, Tata McGraw Hill

5) Fundamentals of Multimedia: Ze – Nian Li and Mark S. Drew, Prentice Hall

6) Principles of Multimedia, 2nd Edition, 2012: Ranjan Parekh, Tata McGraw Hill

13

MCA – 105: MATHEMATICS – I:

A) Mathematical Logic: Introduction to propositional calculus, declarative sentence /

statement / proposition, semantical paradoxes, law of excluded middle and law of

contradiction, propositional variables and constants; compound statements, connectives

(negation, disjunction, conjunction, conditional / implication, bi – conditional /

equivalence) and derived connectives (NAND, NOR, XOR, inhibition); truth tables;

premise / antecedent / hypothesis, consequent / conclusion, implication vs. “causal”

relationship; inverse, converse and contrapositive of an implication; tautology,

contradiction / absurdity, contingency; adequate set of connectives (three / two / one);

algebra of propositions; rules of inference (addition, conjunction, simplification, modus

ponens / rule of detachment, modus tollens / rule of contraposition, hypothetical

syllogism, disjunctive syllogism, constructive dilemma, destructive dilemma), fallacies

(affirming the consequent, denying the antecedent, non sequitur); well formed formula;

normal / canonical forms (CNF, DNF); introduction to predicate calculus; predicate,

free & bound variables, existential & universal quantifiers, multiple quantifiers,

negation; rules of inference (universal / existential generalization / instantiation,

universal modus ponens & modus tollens), clausal form, skolem function. [12%]

B) Set Theory:

Classical Set Theory: Introduction; definition; representation (roaster / tabular, rule /

set builder methods); special sets (∅, ℕ, ℕn, ℕ(m, n), ℤ, ℤ-, ℤ+, ℚ, ℝ, ℂ); finite, infinite,

countable, uncountable, countably infinite / denumerable sets; singleton set, void /

empty / null set; subset, proper subset, superset, universal set, equal set, equipotent /

equivalent set; family of sets, indexed family of sets, power set, partition of a set;

cardinality of a set, aleph – naught (ℵ); operations (algebra) on sets: complementation,

union, intersection, difference / relative complement, symmetric difference, Cartesian

product; disjoint / non – intersecting sets, addition / inclusion – exclusion principle;

laws of algebra of sets: idempotence, identity, domination, commutativity,

associativity, distributivity, absorption, involution, complement laws, law of

contradiction and excluded middle, De Morgan’s laws; Venn diagram; properties of

Cartesian product; computer representation of sets. [10%]

Fuzzy Set Theory: From crisp sets to fuzzy sets: a grand paradigm shift;

representations; α – cut, strong α – cut, support, core / kernel, boundary, height, cross –

over point, equilibrium point, scalar cardinality / sigma count of a fuzzy set; fuzzy set

inclusion, degree of subsethood; operations on fuzzy sets: standard complementation,

union / t – conorms (standard, algebraic sum, bounded sum), intersection / t – norms

14

(standard, algebraic product, bounded difference), difference / relative complement,

symmetric difference, Cartesian product; laws of fuzzy set algebra. [6%]

Other Set Theories: Introduction to multiset, semiset, rough set, soft set. [2%]

C) Relations and Functions: Definition of relation; arity of relation; binary relation from

a set to another set, binary relation on a set; domain and range of a relation; number of

distinct relations from a set to another; operations on relations (set operations,

projection, join, inverse, composition) and their properties; representation of relations

(digraph and adjacency matrix); properties of relations (reflexive, non – reflexive,

irreflexive, symmetric, antisymmetric, asymmetric, transitive, non – transitive,

intransitive); types of relations (identity, equivalence, quasi – equivalence,

compatibility / tolerance, partial ordering, quasi – ordering, strict ordering), closure of

relations; quotient set, equivalence classes and their examples; Poset, Hasse diagram,

total ordering / chain, greatest, least, maximal, minimal elements, supremum / lub,

infimum / glb; well ordering; poset isomorphism; join, meet, lattice, properties of

lattice, homomorphism, isomorphism, automorphism; sub -, modular -, complete -,

bounded -, distributive - lattice; definition of function; domain, co – domain, range,

image, pre – image; different algebraic and transcendental functions; one to one /

injective, many to one, into, onto / surjective, bijective functions; composition and

associativity of composition; identity function; inverse of a function, invertibility of a

function. [10%]

D) Mathematical Structures: Binary operations, closure property, composition table,

identity element (left / right), inverse element (additive / multiplicative); commutative,

associative, distributive laws; algebraic structures with single binary operation

(groupoid, semigroup, monoid, group, Abelian group, additive / multiplicative group);

algebraic structures with two binary operations (ring, commutative ring, ring with

identity, ring with zero divisor, integral domain, field); order of a group, order of an

element of a group, properties of group (left / right cancellation, equalities of left / right

identities & left / right inverse, inverse of inverse, inverse of product of two elements);

subgroup (proper / nontrivial, improper / trivial), necessary & sufficient conditions for

being a subgroup, properties of subgroup (w.r.t. identity & inverse, intersection of two

subgroups); Cosets (left / right), index of a subgroup in a group, properties of cosets

(left / right), normal subgroup, Lagrange’s theorem; cyclic group, generator &

properties of cyclic groups, infinite cyclic group; permutation groups (identity,

inverse, cyclic, odd / even), degree & number of composition / product of

permutations; alternating, dihedral, factor / quotient group; homomorphism of groups,

subgroups & rings (monomorphism, epimorphism, isomorphism, automorphism,

endomorphism and kernel); properties & characteristics of rings, nilpotent element,

15

divisor ring / skew field, subring (trivial / nontrivial), ideal of ring (proper, improper,

principal, maximal, prime); quotient / factor & polynomial ring. [15%]

E) Number Theory and Combinatorics: Introduction, divisibility theory, GCD, LCM,

Euclidean algorithm, prime factorization, primality testing; congruence, arithmetic of

congruence and residue classes, simultaneous linear congruence, solution, Chinese

remainder theorem, Fermat’s little theorem, application of congruence; binomial

theorem, Pascal’s triangle, combinatorial identities; generating functions, recurrence

relation, solving recurrence relation using generating functions. [10%]

F) Graph Theory: Concepts of graphs; terminologies; types; sub – graphs; isomorphism;

path, cycle, connectivity; operations; trees, properties of trees; graph / tree traversals;

spanning trees; Eulerian, Hamiltonian, planar graph; distance in graph; graph

colouring; matching, factorization; directed graph, representation of graph. [25%]

G) Vector Spaces: Vector spaces, subspaces, linear combinations and subspaces spanned

by a set of vectors, linear dependence and independence, spanning set, basis,

dimension; linear / inverse linear transformations, range space / rank of linear

transformation; inner product, orthogonal vector . [10%]

REFERENCE BOOKS:

1) Higher Algebra (Classical), Revised 7th Edition (2003): S. K. Mapa, Sarat Book House

2) Foundations of Discrete Mathematics, 2nd Edition, 2014: K. D. Joshi, New Age

International

3) A Text Book of Discrete Mathematics: Swapan Kumar Sarkar, S. Chand

4) Discrete Mathematics: S. K. Chakraborty & B. K. Sarkar, Oxford University Press

5) Discrete Mathematical Structures: B. Kolman, R. C. Busby & S. Ross, PHI

6) Discrete Mathematics for Computer Scientists & Mathematicians: Joe L. Mott,

Abraham Kandel & Theodore P. Baker, PHI

7) Graph Theory With Applications To Engineering And Computer Science, New Edition,

2009: Narsingh Deo, PHI

8) Graph Theory: Frank Harary, Narosa Publishing House

9) Fundamentals of Abstract Algebra (International Series in Pure and Applied

Mathematics): D. S. Malik, John M. Mordeson , M. K. Sen, McGraw Hill

10) Elements of Discrete Mathematics, 3rd Edition, 2008: Liu, Tata McGraw Hill

11) Discrete Mathematics and Its Applications with Combinatorics and Graph Theory, 7th

Edition, 2011: Kenneth H. Rosen, Tata McGraw Hill

16

MCA – 106: Digital Logic Lab. & Accounting Packages Lab.:

A) Digital Logic Lab.: Design and implementation of different combinational and

sequential circuits.

B) Accounting Lab.: Realization of accounting and financial application using TALLY. MCA – 107: Programming Practices Lab. and Graphics & Multimedia Lab. :

A) Programming Lab.: Program development using the C programming language.

Program(s) should be well structured, modular, readable, robust, simple and as general

as possible program accompanied by good documentation.

B) Graphics and Multimedia Lab.: Drawing, modifying, transforming, changing

attributes, managing, rendering 2D & 3D graphics using AutoCAD; implementation of

different computer graphics algorithms using C / C++ / Java / VB; multimedia content

development using Adobe Premier, Adobe Flash, Adobe PhotoShop, CorelDraw,

SoundForge.

17

SECOND SEMESTER: Theory: (L-T-P) Credit MCA – 201: Microprocessors & Microcontrollers (4-0-0) 4 MCA – 202: Data Structures (3-1-0) 4 MCA – 203: Theory of Computing (3-1-0) 4 MCA – 204: Management Information Systems (4-0-0) 4 MCA – 205: Object Oriented Programming (3-1-0) 4 Practical: MCA – 206: Data Structure Lab. & Information Systems Lab. (0-0-3) 3 MCA – 207: OOP & Microprocessor Lab. (0-0-3) 3

MCA – 201: MICROPROCESSORS & M ICROCONTROLLERS :

A) Intel 8085 Microprocessor: Organization, internal architecture and programming of

Intel – 8085 microprocessor, 8085: assembly language programming. [30%]

B) Intel 8086 Microprocessor: 8086 internal architecture, pin configuration, instruction

set and their usage, simple programmes, jumps, flags, and conditional jumps,

branching and looping, strings, procedures and macros, assembler directives,

interrupts. [30%]

C) Intel 80286 & 80386 Microprocessors: Internal architecture, pin configuration,

instruction set and their usage. [20%]

D) Introduction to Microcontrollers: Architecture, pin configurations, internal block

schematic, PORT0, PORT1, PORT2, PORT3, idle & power down mode, power control

register, program protection modes, flash programming & verification. I/O interfaces

with microcontroller, real time control issues, embedded systems, programming

examples. [15%]

E) Advanced Microprocessor Concepts: Pentium, ARM, mobile processors, multi –

core processors. [5%]

REFERENCE BOOKS:

1) Microprocessor Architecture, Programming and Applications: Ramesh Gaonkar,

Penram Intl. Publishing (India) Pvt. Ltd.

2) Microcomputer Systems The 8086/8088 Family: Architecture, Programming and

Design: Yu – cheng Liu, Glenn A. Gibson, PHI

18

3) The 8051 Microcontroller and Embedded Systems Using Assembly and C: Muhammad

Ali Mazidi, Rolin McKinlay, Janice Gillispie Mazidi, Pearson

4) Advanced Microprocessors: Daniel Tabak, Tata McGraw Hill

5) Microcontrollers Architecture, Implementation & Programming: Kenneth Hintz,

Daniel Tabak, Tata McGraw Hill

6) Microprocessors and Interfacing: Douglas V. Hall, SSSP Rao, McGraw Hill Education

MCA – 202: DATA STRUCTURES:

A) Introduction to Data Structures: Data and information, definition of data structures,

types, Abstract Data Types (ADT), implementation of data structures. [5%]

B) Linear Data Structures: Arrays, Strings, Stacks, Queues, Dequeues, Priority Queues

and their applications, introduction to singly, doubly and circular linked lists,

operations on linked lists, application of linked lists. [15%]

C) Trees: Introduction to tree, forest, binary tree, applications, binary search tree,

insertion and deletion of nodes in a tree, tree traversals, operations on BST, threaded

binary trees, querying a BST, application of BST, introduction to balanced trees, height

balanced and weight balanced trees, different methods of balancing, advantage of tree

balancing, complexities of different operations. [20%]

D) Graph: Introduction to graph, different representations, graph traversals, like, BFS,

DFS, applications of BFS and DFS, transitivity and Warshall’s algorithm, spanning

trees, minimum spanning trees, Prim’s and Kruskal’s algorithms, single source shortest

paths, all pair shortest paths, operations on graphs, querying a graph, applications of

graphs in computer science. [25%]

E) Sorting and Searching: Concept of space and time complexity, different sorting

techniques (like, bubble, insertion, selection, merge, quick, bucket, shell, topological,

shaker), their performance analysis, and efficiency comparisons, lower and upper

bound of sorting algorithms, different searching algorithms and their applicability &

performance analysis. [20%]

F) Advanced Data Structures: Sets, B-Tree, B+ Tree, Skip Lists, amortized analysis,

augmenting data structures, Heap, operations on heap, Hashing, performance of

hashing, rehashing and other hashing techniques. [15%]

REFERENCE BOOKS:

1. Introduction to Algorithms, 3rd Edition: Cormen, Liserson, Rivest, Stein, MIT Press.

2. Fundamentals of Data Structure: Horowitz, Sahani, Galgotia Publication.

3. Data Structures using C & C++, 2nd Edition: Langsam, Augenstein, Tabenbaum, PHI

19

4. Data Structures & Algorithm, 1st Edition: Aho, Hopcroft, Ullman, Pearson

5. Algorithms in C++: Fundamentals, Data Structures, Sorting, Searching (Part 1 – 4),

3rd Edition: Robert Sedgewick, Pearson

MCA – 203: THEORY OF COMPUTING :

A) Introduction: Concepts of alphabet, language, grammar, automata; different proof

techniques, introduction to contemporary automata theories. [5%]

B) Regular Language: FA, DFA, NFA, language accepted by FAs, equivalence of DFA

& NFA, state minimization of FAs, Meally machine & Moore machine and

conversions from one to another, regular expressions, application of REs, laws of

algebra of REs, regular grammar, equivalence of FA, RE and RG, conversion between

one representation of regular language to another, Arden’s theorem, closure properties

of regular languages, decision properties of regular languages, equivalence of regular

languages, pumping lemma for regularity, application of regular languages. [30%]

C) Context – Free Languages: Introduction and formal definition of Context Free

Language, Context Free Grammar and Push – Down Automata; determinism and non –

determinism; different ways of designing PDAs as language acceptor, equivalence of

them; equivalence of CFG and PDAs; properties of CFGs – null production, unit

production, useless production, ambiguity, inherent ambiguity; introduction to parsing,

parse trees, derivations, recursive inferences; normal forms of CFGs, conversion of

CFGs to different normal forms; closure properties of CFLs, decision properties of

CFLs, pumping lemma for CFLs, undecidable problems of CFLs; DPDA. [25%]

D) LBA and Turing Machines: Introduction to Turing machine, language accepted by

Turing machine, Turing machine as an accepter or a transducer, different variants of

Turing machines, universal Turing machine, Turing machine and halting, LBA, context

sensitive grammar, context sensitive language, classification and hierarchies of

languages. [20%]

E) Computability and Complexity: Church – Turing thesis, undecidability problems,

recursive & recursively enumerable languages and their properties, Rice’s theorem,

Post’s correspondence problem, primitive recursive function, problem reducibility,

concepts of P, NP, NP – Complete, NP – Hard problems, PSPACE. [20%]

REFERENCE BOOKS:

1. Introduction to Automata Theory, Languages and Computation, 1st Edition: J. E.

Hopcroft, J. D. Ullman, Narosa

20

2. Introduction to Automata Theory, Languages and Computation, 2nd Edition: J. E.

Hopcroft, R. Motwani, J. D. Ullman, Pearson

3. An Introduction to Formal Languages and Automata: Peter Linz, Narosa

4. Theory of Computer Science (Automata, Languages and Computation): K. L. P. Mishra

& N. Chandrasekaran, PHI

5. Elements of the Theory of Computation: H. R. Lewis and C. H. Papadimitriou

MCA – 204: MANAGEMENT INFORMATION SYSTEMS:

PART – A: [50%]

A) Management: Concept, nature and scope of management, management process,

functions, principles and levels, evolution of management thought, management and

environment. [6%]

B) Planning: Meaning, nature, process and types of planning, steps in planning, decision

making; strategic management process. [3%]

C) Organizing: Meaning, nature, features and principles of organization,

departmentalization, span of management, authority and responsibility, delegation and

decentralization, forms of organization structure, line and staff authority, theories of

organization. [5%]

D) Directing: Nature and scope of directing, motivation and morale, team building, crisis

management. [3%]

E) Staffing: Meaning, nature and scope of staffing, selection process, training and

development. [3%]

F) Communicating & Motivation: Nature, scope and process of communication, role

and significance of communication, channels of communication, formal and informal

communication; communication media; Meaning, nature and importance of

motivation, theories of motivation. [6%]

G) Leadership: Meaning, nature and importance of leadership, function of leadership,

leadership style, theories of leadership. [4%]

H) Coordinating: Nature, importance and feature of coordinating, need and significance

of coordination, techniques of coordination, advantages and problems of coordination,

coordination vs. cooperation. [3%]

I) Controlling: Meaning, nature, need and significance of controlling, relation between

planning and controlling, steps in controlling, types of controlling; essentials of an

effective control system. [4%]

21

J) Organizational Behaviour: Concept, definition of organization behaviour, what is it,

features and major areas of organization behaviour, models of organization behaviour,

social structure and organizational culture. [8%]

K) Group Dynamics: Meaning, importance of group dynamics, elements of work group

behaviour, consequence of work group behaviour, group behaviour, group

cohesiveness, factors determining group cohesiveness. [5%]

PART – B: [50%]

A) Introduction: Key elements of an organization: people, structure, operating

procedures, policies, culture; major business functions: sales & marketing,

manufacturing & production, finance, accounting, human resource; peoples in an

organization: managers, knowledge workers, data workers, production / service

workers; role of managers in organization: classical model of management (planning,

organizing, coordinating, deciding, controlling), contemporary behavioural model

(Kotler’s Model and Mintzberg’s model); Mintzberg’s 10 major roles: interpersonal

roles (figurehead, leader, liaison), informational roles (nerve centre / monitor,

disseminator, spokesperson), decisional roles (entrepreneur, disturbance handler,

resource allocator, negotiator). [5%]

B) Decision Making: Introduction to management decisions; decision making is an art /

science?; decision making vs. problem solving; Hoenig’s six problem solving skills

and personalities (innovator, discoverer, communicator, playmaker, creator,

performer); different aspects of typical business decisions; four phases of decision

making (Simon’s taxonomy): (a) intelligence (problem or opportunity identification,

problem classification: programmed / non – programmed, structured / semi – structured

/ unstructured, problem decomposition, problem ownership), (b) design (normative /

descriptive models, developing alternatives, scenarios, errors in decision making), (c)

choice (analytical techniques, algorithms, heuristics, blind search), (d) implementation

(resistance to change, degree of support of top management, user training); Anthony’s

taxonomy: strategic planning, management control, operational control, knowledge –

level decision making; business analysis techniques: PESTLE, Heptalysis, MOST,

SWOT, CATWOE, de Bono’s six thinking hats, five why’s, MoSCoW, VPEC – T,

SCRS, constraints, impact, protocol, STEEPLE, TOWS, value chain, value

proposition; quantitative techniques for decision making: sensitivity analysis, what – if

analysis, goal seeking, discriminant analysis, cluster analysis, factor analysis,

regression analysis, correlation analysis, time – series analysis, cluster analysis, latent

class analysis, multi – criteria decision analysis (MCDA), CBC analysis, gap analysis,

22

cost – benefit analysis, force – field analysis, break – even analysis, constraints

analysis, risk analysis; organizational models of decision making; need and existence

of different quantitative forecasting methods: extrapolation / time – series, causal,

judgemental and others. [12%]

C) Practical Example of Decision Making: Decision making under conditions of

certainty / uncertainty / risk; initial steps: 1) listing of all viable alternatives, 2) listing

states of nature / future events, 3) constructing conditional profit / pay – off table; four

criteria for decision making under uncertainty: 1) optimistic / maximax criteria, 2)

pessimistic / maximin criteria, 3) minimax regret criteria, 4) criteria of realism; three

criteria for decision making under risk: 1) expected value / criterion of Bayes, 2)

criterion of rationality / principle of insufficient reason, 3) criterion of maximum

likelihood; different related concepts: probability, marginal / expected marginal profit /

loss, expected profit with perfect information, expected value of perfect information,

obsolescence / opportunity loss, reliability, salvage value; discrete vs. continuously

distributed random values, utility as a decision criteria, utility theory and utility

functions; normal probability distribution and cost – volume – profit analysis;

replacement analysis; decision trees; concept of operations research. [10%]

D) Information Systems: Introduction to system: input, process, output, feedback,

control, environment, subsystem, system boundary, interface, dynamic / cybernetic /

open / closed / adaptive systems, system entropy (guard by decreasing entropy /

increasing orderliness); introduction to information; attributes of high – quality

information product (time, content and form dimensions); introduction to information

system: basic activities, resources and environment; positive and negative impacts of

IS; shift in IS thinking; application areas of IS; classification of IS: six major types

(ESS, DSS, MIS, KWS, office automation system, TPS), other types (PCS, ECS, EIS,

ES, KBIS, KMS, SIS, BIS, IIS); inter – relationships among ISs. [8%]

E) TPS, MIS and DSS: Introduction to TPS; TPS cycle: data entry (traditional / source

data automation, input editing), transaction processing (batch / online, OLAP, OLTP),

database processing, documents and report generation (action / information /

turnaround documents, control listing / edit reports), inquiry processing; introduction to

MIS, five era of MIS development, role of MIS, MIS organization; planning;

documentation; design and development of MIS: direct cut, pilot study, phased

approach; study of MIS development phases; MIS and end users; role of top level

management in design & implementation of MIS; Introduction to DSS / computerized

DSS; risks of DSS; difference between DSS and traditional EDP; components of DSS;

analytical modelling activities using DSS. [12%]

23

F) Computer Applications in Different Functional Management Areas: Gorry and

Scott Morton’s decision support framework for different functional areas of an

organization; pictorial representation of application of ISs at different level of

management and in different functional areas. [3%]

REFERENCE BOOKS:

1) Management Theory and Practice: C. B. Gupta, Sultan Chand & Sons, New Delhi

2) Principles and Practice of Management: L. M. Prasad, Sultan Chand & Sons

3) A Text Book of Business Management: Ritwik Halder, Himalaya Publishing House

4) Organizational Behaviour – Human Behaviour at Work: John W. Newstrom & Keith

Davis, Tata McGraw Hill Publishing Co. Ltd., New Delhi

5) Organizational Behaviour: K. Aswathappa, Himalaya Publishing House, New Delhi

6) Human Resource Management: K. K. Ahuja & Balvinder Shukla, Kalyani Publishers

7) Management Information Systems: James A. O’Brien, George M. Marakas, Ramesh

Behl, Tata McGraw Hill

8) Management Information Systems – Text and Cases: Waman S. Jawadekar, Tata

McGraw Hill

9) Management Information Systems: Girdhar Joshi, Oxford University Press

10) Management Information Systems – Conceptual Foundations, Structure and

Development: Gordon B. Davis, Margrethe H. Olson, Tata McGraw Hill

11) Management Information Systems: Effy Oz, Cengage Learning

12) Management Information Systems – Managing the Digital Firm: Jane P. Laudon,

Kenneth C. Laudon, Pearson

13) Management Information Systems: Stephen Haag, Maeve Cummings, Amy Phillips,

Tata McGraw Hill

14) Quantitative Techniques in Management: N. D. Vohra, Tata McGraw Hill

15) Quantitative Techniques for Decision Making: M. P. Gupta, R. B. Khanna, PHI

MCA – 205: OBJECT ORIENTED PROGRAMMING :

A) Introduction : Introduction to Object – Oriented Programming (OOP), paradigm shift

from procedural programming, advantages of OOP, features of OOP, overview of OOP

using C++ and/or Java. [5%]

B) Class and Object: Concept of classes and objects, declaration & definition of class

and structure, class members and objects, access specifiers, mutable and persistent data

members, mutator, accesor member functions, file – wide, application – wide, class –

24

wide global members, constant members, friend function & class, inline functions and

macros, lambda function, arrays of objects, passing objects to and returning objects

from functions, namespace, scope and lifetime, default argument, object assignment,

introduction to pointers and references, constant pointer and pointer to constant, pointer

to class members, concept of wrapper classes, concept of type – safe enumerations,

concept of object state persistence, concept of packages. [20%]

C) Constructors and Destructors: Concept of constructor and destructor, default

constructor, constructor overloading, parameterized constructor, constructor with

default arguments, typecasting using single argument constructor, data member as

initializer function, dynamic initialization of objects, copy constructor, dynamic

constructor, explicit constructor, destructors, constraints on constructors and

destructors, object state initialization concepts. [15%]

D) Operator Overloading: Concepts of overloading operators, possible ways of

overloading operators, overloading different operators, multiple overloading and

associated ambiguity, overloading casting operators, constraints & restrictions of

operator overloading. [12%]

E) Inheritance: Concept of inheritance, prototype based and class based inheritance, base

class and derived class, defining a derived class, accessing base class member, mode of

inheritance, types of inheritances, virtual base class, derived class constructor, class

hierarchies. [15%]

F) Dynamic Polymorphism: Overview of polymorphism, introduction to dynamic

polymorphism, overriding member functions and destructors, virtual functions, abstract

class, interfaces, pure virtual function, vtable, dynamic method dispatch. [8%]

G) Exception Handling: Concept of exception handling, types of failures, checked and

unchecked exception, throw, throws, try and catch, finally, ellipses, rethrowing,

terminate handler, dealing with uncaught exception, unexpected exceptions [7%]

H) I/O and Files: Streams, stream class’ hierarchy, I/O manipulators, type of streams,

formatted and unformatted I/O, object I/O, file streams, overloading << and >>

operators, defining custom manipulator. [10%]

I) Templates and Generics: Concept of generic programming, implementations of

generic functions and classes, their uses. [8%]

REFERENCE BOOKS:

1. C++ and Object-Oriented Programming Paradigm: D. Jana, PHI

2. The Java Programming Language: James Gosling

3. Objecting Oriented Programming through C++: E. Balaguruswamy, Tata McGraw Hill

4. Object Oriented Programming in Turbo C++: Robert Lafore, Galgotia

25

5. C++ How to Program: Deitel & Deitel, PHI

6. The Complete Reference C++: H. Schildt, Tata McGraw Hill

7. The Complete Reference Java: Herbert Schildt, Tata McGraw Hill

8. C++99, C++03, C++11, C++14 (upcoming at the time of preparing this syllabus)

specifications from ISO

9. Java Language Specification from Oracle Inc.

MCA – 206: DATA STRUCTURE LAB. & GRAPHICS AND MULTIMEDIA LAB.

A) Data Structure Lab.: Implementation and application of different linear data

structures: array, stack, queue, linked list; sorting (bubble, selection, insertion, merge,

quick); searching (sequential, binary); implementation and application of different non

– linear data structures: graph, tree; implementation of hashing.

B) Information Systems Lab.: Implementation of different decision making problems;

study of different information systems.

MCA – 207: OOP & M ICROPROCESSOR LAB.

A) OOP Lab.: Implementation and application of different OOP concepts using C++ and

/ or Java; development of programmes (using OOP concept) to solve different real life

problems. Programs must be readable and accompanied by good documentation.

B) Microprocessor Lab.: Development of different programs using (8085 and / or 8086)

assembly language.

26

THIRD SEMESTER:

Theory: (L-T-P) Credit MCA – 301: Software Engineering (4-0-0) 4 MCA – 302: Operating Systems (3-1-0) 4 MCA – 303: Database Management Systems (3-1-0) 4 MCA – 304: Mathematics – II (4-0-0) 4 MCA – 305: Design & Analysis of Algorithms (3-1-0) 4 Practical: MCA – 306: Algorithms & Operating Systems Lab. (0-0-3) 3 MCA – 307: DBMS & Software Engineering Lab. (0-0-3) 3

MCA – 301: SOFTWARE ENGINEERING :

A) Introduction: Definition of software product (vs. program), difference between

software product and other products; problem of exploratory style of software

development; changing nature / different categories of software product; unified theory

for software evolution; software myths among customers / managers / practitioners;

quality factors of a software product: operations (correctness, reliability, efficiency,

integrity, usability), transition (portability, reusability, interoperability), revision

(maintainability, flexibility, testability); organization’s commitment: quality of

product; organization’s goal: consistency in performance, developing product with low

cost and small cycle time, scale up performance or principles / methods / procedures

followed for development of large / complex systems; what are essential to achieve all

of these: processes, methods and tools; difference between software product, software

project and software process; definition of software engineering; applicability / scope

of software engineering principles is not only just development of a software product

but far beyond that. [10%]

B) Software Process and Principles: Processes in a software development organization:

non – software engineering / software engineering processes; examples of non –

software engineering processes; software process: deals with technical and

management issues of software development; product of software processes: software

product / non – software products; sub – processes of software process: product

engineering process (development process, project management process, software

configuration management process), process management process; required

characteristics of a software process (predictability, testability, maintainability, early

defect removal and defect prevention, improvement); generic view of software process

27

(communication, planning, modelling, construction, deployment); SEI CMMI

guidelines: process meta model (continuous, staged), process area, generic / specific

goal (GG / SG), generic / specific practice (GP / SP), capability maturity levels; ISO

9000 certification: meaning, condition; process assessment; software process models:

descriptive, prescriptive, agile process models; prescriptive models: waterfall model,

incremental process models (incremental, RAD models), evolutionary models

(prototyping, spiral, concurrent development model), specialized models (component

based, formal methods models), unified process; agile process models: XP, ASD,

DSDM, scrum, crystal, FDD, AM; software engineering principles: core,

communication, planning (also, questions to be raised), modelling (analysis, design),

coding (preparation, coding, validation), testing, deployment; list of generic tasks to be

performed at each phase. [15%]

C) Software Project Management: Responsibilities of a software project manager;

project planning (Barry Boehm’s W5HH principle, SPMP document); decision for

make / buy: decision tree, outsourcing; metrics for project size estimation: LOC,

function point metric; project estimation techniques: introduction to Rayleigh curve,

empirical estimation (expert judgement, Delphi cost), heuristic (COCOMO: basic,

intermediate, complete, COCOMO II, Watson, Felix), analytical (Halstead’s software

science); staffing: Constantine’s four paradigms, quality of a good software engineer

and team leader; staffing level estimation: Norden’s, Putnam’s, Jensen’s models;

scheduling: WBS, activity network, CPM, Gantt chart, PERT chart; project monitoring

and control: earned value analysis, milestones, time sheets, reviews, cost – schedule –

milestone graph, unit development folder; organization and team structure; risk

management: identification, assessment of impact, containment, reactive vs. proactive

strategies, components and drivers, refinement, RMMM plan; software configuration

management: need, required activities, SCCS, RCS; other plans. [10%]

D) Requirement Analysis and Specification: Seven tasks of requirement engineering:

inception, elicitation, elaboration, negotiation, specification, validation, management;

requirements gathering and analysis; SRS: characteristics of a good SRS document;

analysis and documentation of: functional / non – functional requirements,

performance, design constraints, external interface requirements; techniques for

representing complex logic; organization of SRS document; system specification:

formal (model vs. property oriented, operational semantics, merits and limitations of

formal methods), axiomatic, algebraic (properties, auxiliary functions, structured

specification, pros and cons of algebraic specification), executable (4GL); specification

languages: structured English, RE, decision tables, FSA; traceability (features, source,

dependency, subsystem, interface). [10%]

28

E) System Analysis and Design: Required abstraction and modularity of the system,

partitioning / projection / hierarchies, top – down vs. bottom – up approach, modelling

for better understanding of the system; different modelling: flow oriented modelling

(data flow, control flow model, structured analysis, notations for DFDs, limitations of

DFD), object oriented modelling (scenario based, class based, component based,

behavioural modelling, UML diagrams), data modelling (Warnier-Orr, ER modelling);

initial / high – level design vs. detailed design; analysis vs. design; cohesion

(classification), coupling (classification), functional independence; structured design /

function oriented design: flow chart vs. structure chart, factoring input and output,

transform analysis, transaction analysis, detailed design; object oriented design:

patterns (concepts and types of patterns, common patterns: (expert, creator, façade,

MVS, observer, MVC, publish – subscribe, proxy / intermediary)); use – case

modelling, domain modelling, Booch’s object identification method; interaction

modelling; user interface design: types, consideration, metaphor, layout, interface

inspection; design review; design documents and standards; metrics for structured

design (network, stability, information flow metrics); metrics for OOAD: CK, MOOD,

Lorenz – Kidd’s, other; metrics for detailed design (cyclomatic complexity, data

bindings, cohesion metric). [20%]

F) Coding: Choice of programming languages, mixed language programming, coding

standards and guidelines; proving correctness; symbolic execution; code review: code

walkthrough, code inspection, clean room testing; software documentation: internal /

external documentation, Gunning’s fog index. [5%]

G) Testing: Introduction to testing; concepts and terminologies: error, fault, failure, test

oracle, test cases, test criteria; levels / stages of testing: unit, integration, system

testing, acceptance testing; unit testing: driver and stub modules, black box testing

(equivalence class partitioning, boundary value analysis, cause – effect graphing,

orthogonal array testing, test suite), white box testing (statement coverage, branch

coverage, condition coverage, path coverage, McCabe’s cyclomatic complexity metric,

data flow based testing, mutation testing), debugging (approaches and guidelines),

program analysis tools (static vs. dynamic analysis tools); integration testing: phased

vs. incremental testing; testing object oriented programs: traditional techniques are

unsatisfactory for testing OOP, grey box testing, integration testing of OOP,

incremental testing for subclasses, state based testing); system testing: performance

testing, error seeding; acceptance testing: α – testing, β – testing; test documentation;

regression testing. [15%]

H) Software Quality and Reliability: Meaning of software quality and reliability; quality

and reliability metrics: McCall’s quality factors, ISO 9126 quality factors, quantitative

29

view of quality; reliability growth modelling; product vs. process metrics; software

quality management system; validation and verification; inspection and reviews;

Musa’s model for reliability estimation, MTBF. [5%]

I) CASE: Relevance and benefits of CASE; high – end and low – end CASE tools;

automated support: prototyping, structured analysis and design, data dictionaries,

DFDs and ERDs, code generation, test case generation; other support: documentation,

project management, external interface, reverse engineering, tutorial and help;

architecture of a CASE environment. [5%]

J) Software Maintenance, Reuse and Reengineering: Characteristics of software

maintenance; characteristics of software evolution; problems associated with software

maintenance; maintenance process model; reuse and approach to reuse: domain

analysis, component classification, searching, repository maintenance, reuse without

modification; reengineering, reverse engineering, forward engineering, code / data

restructuring. [5%]

REFERENCE BOOKS:

1) Software Engineering – A Practitioner’s Approach: Roger S. Pressman, McGraw Hill

2) An Integrated Approach to Software Engineering: Pankaj Jalote, Narosa

3) Fundamentals of Software Engineering: Rajib Mall, PHI

4) Software Engineering: David Gustafson, Schaum’s Outlines, Tata McGraw Hill

5) Object Oriented Analysis and Design with Applications: Grady Booch, Pearson

6) Systems Analysis and Design: Igor Hawryszkiewycz, PHI

7) The Unified Modelling Language User Guide: Grady Booch, James Rumbaugh, Ivar

Jacobson, Pearson Education

8) Object – Oriented Metrics in Practice: Radu Marinescu, Michele Lanza, Springer

9) Object – Oriented Analysis & Design: Mike O’Docherty, Wiley India

10) Object – Oriented Analysis & Design: Andrew Haigh, Tata McGraw – Hill Education

11) Object – Oriented Software Engineering: Using UML, Patterns, and Java: Bernd

Bruegge, Allen H. Dutoit, Pearson

12) Practical Object – Oriented Design with UML: Mark Priestley, Tata McGraw - Hill

MCA – 302: OPERATING SYSTEMS:

A) Introduction: Introduction to Operating System (extended machine, virtual machine,

resource manager, interface between user, application program & hardware), history of

OS, evolution and classification of OS (monitor, serial processing, batch processing,

uniprogramming, multiprogramming, multiprocessing, time sharing, parallel,

30

distributed, real time, network, single user, multi user), OS functions (process, memory,

I/O, storage & network management, system protection & security, convenience,

performance & efficiency, scaling & evolution, accounting), OS architecture (layered,

monolithic kernel, microkernel, parallel, symmetric multiprocessing, client – server,

distributed, object oriented design, multithreading), study of Windows Vista and Linux

architecture; BIOS, POST, booting, bootstrap loader. [10%]

B) Process Management: Introduction to process; three different context of concurrency /

multitasking in uni – processor system: multiple processes for convenience, modular

design of OS (set of cooperating sequential processes) and modular design of

application / non – OS system (set of concurrent processes or threads); language

support (ULT) / OS support (KLT or cooperation through IPC) for modular design of

application; controlling processes: modes of execution (kernel / user), process creation,

resource allocation, process switching (interrupt / trap / system function call); process

description: general structure of OS control tables, primary process table, process

images, process control blocks (process identification, processor state information,

process control information); state / state – transition of process / thread; relative

treatment of states of ULT and process; types of process scheduling: long term, mid

term, short term / dispatching / CPU scheduling; CPU scheduling details: criteria,

mechanism vs. policy, accommodating priority (user / OS defined, inherent),

preemptive vs. non – preemptive, dispatch overhead / latency; alternatives (FCFS, RR,

VRR, SPN / SJF, SRT, HRRN, multilevel queue / feedback, fair – share, guaranteed);

exponential averaging for predicting service time; performance comparison (analytic /

deterministic, queuing analysis, simulation modelling); degree of awareness of other

programs existence (cooperation vs. competition); problems: mutual exclusion,

synchronization, atomic operation, critical section, race condition, deadlock, livelock,

starvation; requirements for mutual exclusion; hardware support: disabled interrupt,

special atomic m/c instruction; semaphore (general / counting, binary, strong / weak),

mutex (simple / re-entrant); programming error (invalid sequence of wait & signal or

their repetition / omission): critical region and monitor; condition variable, event flag,

IPC, busy waiting / spinlocks, bounded waiting; examples: producer / consumer

(infinite buffer, bounded buffer), reader / writer, sleeping barbar, dinining

philosophers’ problems; Dekker’s, Peterson’s, Bakery algorithms; reusable /

consumable resources; necessary and sufficient conditions of deadlock; no cooperation:

OS intervenes; RAG; deadlock prevention and associated problems; deadlock detection

and recovery; deadlock avoidance (banker’s algorithm, process initiation / resource

allocation denial, safe state / path / sequence, safe / unsafe / deadlock state – space);

31

combined approach; IPC: direct / message and indirect / mailbox / port, synchronous /

asynchronous / rendezvous, exceptions. [25%]

C) Memory Management: Requirements of memory management (relocation, protection,

sharing, logical and physical organization); OS alone can not manage memory:

required MMU hardware; logical, relative, physical address; hardware support for

relocation; memory management techniques: overlaying, fixed (equal or unequal sized)

/ dynamic partitioning, buddy system, simple paging / segmentation, virtual memory

(paging, segmentation, both); contiguous vs. non – contiguous allocation; placement

algorithms: unequal sized fixed partitioning (queue per partition, single queue),

dynamic partitioning (first, next, best, worst, quick fit); problems of internal, external

(checkerboard) fragmentations, 50 – percent rule, compaction; principle of locality of

reference and virtual memory concept; page, frame, swap in, swap out, virtual / real

address / address space; resident set, thrashing; page / segment / frame table and their

structure (need of present / valid, modified and other control bits); address translation

in single / multilevel paging system; hierarchical / inverted page table; use of TLB;

direct vs. associative look up for page table entries; hit / miss / page fault; TLB vs.

cache; rate of page fault w. r. t. page size and resident set size; Belady’s anomaly;

address translation in segmentation or both segmentation & paging system, STBR,

STLR; fetch policies (prepaging, demand paging, pure demand paging); frame locking,

replacement policies (OPT, LRU, FIFO, second chance, CLOCK, LFU, MFU); page

buffering, replacement policy & cache size; resident set management (local / global

allocation, fixed / variable allocation); cleaning policies (precleaning, demand

cleaning); buffer overflow / overrun attack. [25%]

D) I/O System & Secondary Storage Management: Concept of I/O, I/O hardware: bus

(PCI, SCSI, expansion, LPC, others), bus structure, daisy chain, socket, slot, port, plug,

controllers, host adapter, device driver; I/O port or memory mapped I/O; polling /

handshaking; interrupt driven I/O (maskable / non – maskable interrupts, interrupt

vector / service routine), trap, DMA (DVMA, DMA controller, cycle stealing, DMA

configuration alternatives), blocking / non – blocking (asynchronous) I/O; I/O

scheduling; buffering (single / double / circular), caching, buffer cache, spooling, pipe,

I/O error handling; dedicated / shared / virtual devices, human or machine readable /

communication devices, traffic controller; Disk structure, formatting (track, sector,

cylinder, block, cluster), CAV vs. CLV, disc vs. disk, disk scheduling algorithms

(FCFS / FIFO, LIFO, SSTF, SCAN / elevator, C – SCAN / one – way elevator, LOOK

/ SEEK, C – LOOK / C – SEEK, N – step – scan / FSCAN), deadline / anticipatory

scheduler, disk performance (seek time, latency / delay, transfer time, throughput vs.

response time), disk management, reliability, swap space management; Concept of

32

file, attributes, operations, types, access methods, link (soft / hard), directory structure,

access control / protection, organization, allocation (contiguous / linked / indexed),

defragmentation / compaction, file sharing; FAT, NTFS, CDFS, VFS, JFS, Ext (2 / 3);

free space management (bit vector / linked), record – blocking. [15%]

E) Security & Protection: Concept of computer security; threat, attack, assets and RFC

2828; intruder, virus, worm, bot / zombie / drone, malware, rootkit, trapdoor, logic

bomb, Trojan horse, spam, key logger, spyware, adware, mobile code, hacking,

sniffing; OS techniques: authentication (password, token, biometric), access control,

intrusion detection (audit records), malware defence (antivirus). [10%]

F) UNIX Operating System: Overview of UNIX operating system structure, file system,

file management, sharing and access control, general purpose utilities, simple filters,

process communication and scheduling, shell programming, systems calls, installation

and system administration. [15%]

REFERENCE BOOKS:

1) Operating Systems Internals and Design Principles: William Stallings, Pearson

2) Operating System Concepts: Silberschatz & Galvin, WSE Wiley

3) Modern Operating Systems: Andrew S. Tanenbaum, PHI

4) Operating Systems Concepts and Design: Milan Milenkovi’c, Tata McGraw Hill

5) System Programming & Operating Systems: D. M. Dhamdhere, Tata McGraw Hill

6) UNIX Concepts and Applications: Sumitabha Das, Tata McGraw Hill

7) Unix & Borland C Manuals

MCA – 303: DATABASE MANAGEMENT SYSTEMS:

A) Introduction: Information as an asset; three dimensions of information: time

(timeliness, currency, frequency, time period), content (accuracy, relevance,

completeness, conciseness, scope), form (clarity, detail, order, presentation, media);

data vs. information; transient (ephemeral) vs. persistent data; subject vs. predicate;

storage vs. retrieval; problems of traditional paper based methods (compactness, speed,

less drudgery, currency); problems of traditional file handling system (redundancy,

inconsistency, difficulty in data access, data isolation, integrity problem, atomicity

problem, concurrent access anomalies, security problem); advantages of database

approach (shared data, reduced redundancy, avoiding inconsistency, support of

transaction, maintaining integrity, security, balanced conflicting requirements,

enforcing standards, data independence, efficiency, centralized data administration,

33

concurrency, backup and crash recovery, reducing application development time,

language interface, better storage / data catalog management, flexibility, economies

and scale); history of DBMS development; centralized, client – server, distributed,

parallel, multi – dimensional, spatial, multimedia, mobile, web databases; operational

data vs. data warehouse; data mart; data mining; OLTP, OLAP, ERP / MRP, GIS

(remote sensing, GPS and database); SDLC vs. DDLC; components / architecture of a

typical DBMS. [15%]

B) Semantic Data Modelling using ERD: Abstraction of properties and behaviour of

data; ANSI / SPARC three layer abstraction / architecture (view / external / logical

schema, conceptual schema, physical / internal schema); data independence (logical ,

physical); need for high – level conceptual data model as an abstraction; available

types: network, hierarchical, relational, object oriented, extended – relational, object

relational, temporal, deductive models; semantic data model as an alternative data

model / an intermediary between external and conceptual data model; ER model as

semantic data model: first proposer (P. P. Chen?), criticism by Dr. E. F. Codd on

semantic model and ER model; popularity of ER model; introduction to ER model and

ERD; non – availability of standard; elements: entity (type, set, instance), relationship

(type, set), attribute; domain, types of attributes: simple, composite, single valued,

multi – valued, missing, derived, key (super key, key, candidate key, primary /

secondary key, prime attribute), descriptive; degree / arity of relationships: unary,

binary, binary recursive, role name / descriptor / indicator, ternary, n – ary; constraints

on relationship / mapping constraints / referential integrity: key constraint / mapping

cardinality / cardinality ratio / connectivity (one – to – one, one – to – many, many – to

– many, maximum – minimum cardinality), participation constraint (total, partial /

optional), existential dependency (strong / dominant / parent entity, weak / child entity,

identifying attribute / entity or owner / relationship, discriminator / partial key),

inclusivity vs. exclusivity, need for composite entity to convert N:N relationships into

1:N relationships; EER model: sub / super class and attribute inheritance,

generalization / synthesized and specialization / distinguished entities, condition /

predicate defined and user defined subclasses, disjoint and overlapping constraint, total

and partial / optional constraint, completeness constraint, single inheritance / hierarchy

and multiple inheritance / lattice, aggregation; choice of notations / symbols: Chen,

crow’s foot, Rein85, IDEF 1X, UML; ambiguity / confusion / design alternatives:

attribute vs. entity, entity vs. relationship, binary vs. ternary relationship, aggregation

vs. ternary relationship, connection trap: fan trap, chasm trap; design principles

(faithfulness, avoiding redundancy, simplicity counts, picking the right kind of

element); reduction / conversion from ERD to table / base relation. [10%]

34

C) Relational Model: Introduction; Codd’s 12 rules; terminologies: relation, table, table

vs. base relation / r – table, arity and cardinality of a relation, view relation, relvar,

domain, type, extended data type, tuple / record / row, field / attribute / column,

intension vs. extension, schema definition, mathematical definition of relation, relative

order of attributes of a tuple / tuples in a relation, primary / foreign key, null value,

integrity constraints: domain constraint, column integrity constraint, constraint on null

values, entity integrity constraint (primary key constraint), referential integrity

constraint (foreign key constraint), user defined integrity constraint, table constraint /

assertion, deferred / immediate constraint, no action / cascade constraint, semantic

integrity constraint (functional dependency constraint, state constraint, transition

constraint), active database and triggers, constraint vs. triggers; relational model and

four valued logic; relational algebra: projection (π), selection (σ), rename (ρ), set

operations (union, intersection, difference / minus / except, Cartesian / cross product,

division), join (natural, equi – , θ, semi – θ, inner, outer, left outer, right outer, T –

join), extend, framing / grouping and aggregate functions (max, min, avg, count, sum,

statistical functions); adequate / complete set of operators; relational calculus: tuple /

domain relational calculus; expressive power of relational algebra / calculus;

procedural vs. non – procedural approach. [15%]

D) Relational Database Design and Physical Design: Introduction: redundancy,

anomalies (insert, update, delete), decomposition, additive loss (spurious tuples),

dependency preservation, normalization; 1NF; functional dependency: definition,

notations, Armstrong’s axioms (soundness and completeness), DUP, closure of FDs,

attribute closure, equivalence of set of FDs, minimal set of FDs; 2NF, 3NF, BCNF;

testing binary decomposition for lossless join property; algorithms for relational

schema design; MVD and 4NF; join dependency and 5NF (PJNF); DKNF; database

workloads, need for database tuning, index selection clustering and indexing, tuning

queries and views, de – normalization, horizontal decomposition, reducing lock

duration. [15%]

E) SQL and Other Languages: Basic structure of SQL, creating table / view, altering /

destroying tables / view, insert, update, integrity constraints (not null, unique, primary /

foreign key, check constraints), assertion, trigger, SQL query using relational algebra /

calculus, ordering, conditions (=, <>, <, <=, >, >=, ALL, ANY, SOME, IN, IS, IS

NOT, BETWEEN, LIKE, EXIST, AND, OR, NOT), nested sub queries (co – related /

parallel), cursors, embedded SQL and other structured language features; introduction

to other languages: QBE, QUEL, Datalog. [10%]

F) Transaction Management and Concurrency Control: Introduction to transaction,

ACID properties, concurrent execution of transactions; multiple update /uncommitted

35

dependency / incorrect analysis problems; serializability (conflict / view); anomalies

due to interleaved execution; schedules involving aborted transaction; 2 PL / optimistic

/ timestamp – based / multi – version / validation – based concurrency control;

phantom problem; performance of locking; multiple granularity; lock conversions;

dead locks; crash recovery techniques; check – pointing, write – ahead log, deferred /

immediate update, shadow paging, SQL support. [15%]

G) Storage Structure and Indexing: Basic concepts of file organization, sequential /

direct / random access; record types: fixed / variable length records, variable length

fields, repetitive / optional field; clustered indexes, primary / secondary indexes, hash –

based vs. tree – based indexes; file access methods (ISAM); buffer and disk space

management; B – tree, B+ – tree, hashing techniques (internal, external, dynamic); SQL

support. [10%]

H) Advanced Database Concepts: Concept of query evaluation and optimization, system

catalog, query decomposition; canonical form, CNF; algorithms for relational

operators; query optimization plans; rule – based / cost – based / heuristic query

optimization; pipelined evaluation, evaluation of relational operators; SQL queries to

algebra; estimation of cost of a plan; enumeration of alternative plans; access paths;

database security concepts; object oriented database modelling; introductory concepts

of data mining. [10%]

REFERENCE BOOKS:

1) The Relational Model for Database Management, Version 2: E. F. Codd, Addison

Wesley

2) Database Management Systems: Raghu Ramakrishnan, Johannes Gehrke, McGraw

Hill

3) Database System Concepts: A. Siberschatz, H. F. Korth, S. Sudarshan, Tata McGraw

Hill

4) An Introduction to Database Systems: C. J. Date, Pearson Education

5) Fundamentals of Database Systems: Elmasri, Navathe, Somayajulu, Gupta, Pearson

6) A First Course in Database Systems: Jeffrey D. Ullman, Jennifer Widom, Pearson

7) Database Management Systems: Alexis Leon, Mathews Leon, Vikas Pub. House

8) Database Concepts and Systems: Ivan Bayross, SPD

9) Oracle Database 11g PL/SQL Programming: Michael McLaughlin, Oracle Press

10) SQL, PL/SQL The Programming Language of Oracle: Ivan Bayross, BPB Publications

11) Database System: Thomas Connolly, Carolyn Begg, Pearson Education

12) Oracle PL/SQL: Steven Feuerastein, SPD Calcutta

13) Database Management and Oracle Programming: S. S. Khandare, S. Chand & Co.

36

MCA – 304: MATHEMATICS – II: NUMERICAL COMPUTING :

A) Iterative Methods: Zeros of transcendental equations and zeros of polynomials using

Bisection, Newton – Raphson and others; convergence of solution. [8%]

B) Solution of Simultaneous Linear Equations: Gauss elimination method and pivoting,

ill – conditioned equations and refinement of solutions, Gauss – Siedal iterative

method. [8%]

C) Interpolation and Approximation: Difference table, polynomial interpolation,

Newton, Lagrange and others, piecewise polynomial and spline interpolation;

approximation of functions by Taylor series and Chebyshev polynomials. [8%]

D) Numerical Differentiation and Integration: classical formula for equality spaced

abscissa, Simpson’s 1/3 Rule, trapezoidal rule with interval halving techniques,

Romberg integration, Gauss quadrature, Monte – Carlo method for multidimensional

integrals. [8%]

E) Solution of Differential Equations: Ordinary first order differential equations,

difference equation, single and multistep methods, Runge – Kutta method, predictor

corrector methods, automatic error monitoring, stability of solutions. [8%]

STATISTICAL COMPUTING :

F) Introduction: Graphical representation of statistical data, frequency distribution,

measures of central tendency and dispersion, moments and measure of skewness &

kurtosis, random variable & it’s expectation and variance; univariate theoretical

distributions, probability models: binomial, Poisson and normal. [8%]

G) Bivariate Frequency Distributions: Bivariate frequency distributions; scatter

diagram, product moment, correlation coefficient and it’s properties (statements only);

regression lines, correlation index and correlation ratio, limitations of the correlation

coefficient, rank correlation, Spearman’s and Kendall’s rank correlation. [8%]

H) Multivariate Frequency Distributions: Multiple linear regressions; multiple

correlations, partial correlation (without derivation), multiple correlation coefficient in

terms of total and partial correlation coefficients. [8%]

I) Random Sampling and Sampling Distributions: Random sampling (with

replacement and without replacement), expectations and standard error of sampling

mean (without derivation); expectation and standard error of sampling proportions,

random sampling from a probability distribution. [8%]

J) Basic Principles of Statistical Inference: Estimation and testing of hypothesis, point

of estimation of parameters; maximum likelihood estimation, interval estimation of

37

parameters, test of significance based on t, F, and χ2 distribution; Neyman and

Pearson’s theory of testing of hypothesis, likelihood ratio test. [8%]

MATRIX ALGEBRA :

K) Introduction: Introduction to matrix algebra; notation and definition; types of

matrices; matrix arithmetic and properties; transpose of a matrix; Boolean matrix;

determinants; determinant of a matrix. [10%]

L) Application: Elementary transformations; solution of linear equations by matrix; rank

of a matrix; Eigen values and Eigen vectors. [10%]

REFERENCE BOOKS:

1) Numerical Recipes in C – The Art of Scientific Computing: William H. Pras et al.

Cambridge Univ. Press

2) C Language and Numerical Methods: C. Xavier, New Age International

3) Numerical Methods, Software and Analysis: John R. Rice, McGrew Hill International

4) Computer Assisted Statistics: F. Scalzo

5) Fundamentals of Statistics (Volume 1): Goon, Gupta and Dasgupta, World Press

6) Statistical Programs in FORTRAN: Schwartz and Basso, Reston Publishing Co.

7) Higher Engineering Mathematics: B. S. Grewal, Khanna Pub.

8) Groundwork of Mathematical Probability and Statistics: A. Gupta, Academic Pub.

MCA – 305: DESIGN & ANALYSIS OF ALGORITHMS :

A) Basic Concepts: Solving problem using computer, general problem solving approach –

STAIR, reduction to known problem, meaning of algorithm, steps in development of

algorithm, evolution of algorithms, design by analysis, design by synthesis, algorithm

design patterns and frameworks (divide – and – conquer, branch and bound,

backtracking, greedy algorithm, dynamic programming, approximation algorithms,

randomized algorithms, distribute and parallel algorithms, external memory algorithms,

on – line algorithms, natural algorithms like, genetic algorithm, simulated annealing,

artificial neural network, tabu search); formal specification, languages , EBNF, VDM,

Z; algebraic formal specification (pattern matching, unification). [15%]

B) Analysis of Algorithms: Correctness of an algorithm; concept of space and time

complexity; asymptotic analysis, amortization, randomization and experimental

analysis; best, worst and average case, order of growth, asymptotic notations, upper

and lower bounds; analysing rate of growth of a function with that of known functions,

38

comparing algorithms w. r. t. order of growth; applying algorithm analysis concepts for

complexity analysis of different sorting techniques. [10%]

C) Divide and Conquer: Introduction to top – down approach, divide – and – conquer

approach, identifying problems where divide – and – conquer suits / is unsuitable,

analysis of divide and conquer algorithms, recurrences, the master method for solving

recurrences. [10%]

D) Dynamic Programming : Principle of optimality, bottom – up approach to problem

solving, comparison with top – down approach, application of dynamic programming

to solve problems using optimal sequence of decisions, comparison with brute – force

method for finding optimal solution, possibility of multiple sequences in dynamic

programming, overlapping sub – problems and optimal substructures, avoiding further

exploration of sub – optimal decisions using memoizations, examples of problems;

correctness of dynamic programming; analysis of dynamic programming. [15%]

E) Greedy Algorithms: Another approach to find optimal solution by generating only

one decision sequence (locally best choice when all available choices are exhausted),

optimal substructure and greedy choice; greedy algorithms vs. dynamic programming;

examples of problems; analysis of greedy algorithm; matroids; correctness of the

greedy algorithm on matroids. [15%]

F) Backtracking and Branch – and – Bound: Nature of problems where backtracking or

branch – and – bound fits; examples of problems; analysis of them; relation of these

algorithms with optimization. [10%]

G) Approximate Algorithms: P, NP, NP – complete, NP – hard problems, is P = NP?,

trade off between efficiency and accuracy, concept of near optimal solutions, nature of

problems where approximate algorithm is suitable, analysis of approximate algorithms,

inapproximability, ε – approximation; probabilistically good algorithms. [15%]

H) Parallel / Concurrent Algorithms: Identifying problems that can be solved using

parallel algorithms, inherently serial problems; computational models for parallel

algorithms, shared memory, message passing / fixed connection, PRAM (parallel

random access machines), Mesh / Hypercube / Butterfly interconnections; importance

of communication, load balancing (in addition to space and time complexity) in

performance analysis of parallel algorithms, asymptotic linear / super – linear speedup,

work – optimal parallel algorithm; analysis of parallel algorithms; examples of

problems; distributed algorithms. [10%]

REFERENCE BOOKS:

1) Introduction to Algorithms – A Creative Approach: Udi Manber, Addison – Wesley

Professional

39

2) Introduction to Algorithms: Thomas H. Cormen, Charles E. Leiserson, Ronald L.

Rivest, Clifford Stein, MIT

3) Alorithms: Richard Johnsonbaugh, Marcus Schaefer, Pearson

4) Fundamentals of Computer Algorithms: Ellis Horowitz, Sartaj Sahni, Sanguthevar

Rajasekaran, University Press

5) Design and Analysis of Algorithms: Parag Himanshu Dave, Himanshu Bhalchandra

Dave, Pearson

6) Algorithm Design: Jon Kleinberg, Éva Tardos, Pearson Education

7) Randomized Algorithms: Rajeev Motwani, Prabhakar Raghavan, Cambridge University

Press

8) Analysis of Algorithms: Computational Methods & Mathematical Tools: Micha Hofri,

Oxford University Press, USA

9) Parallel Computers Architecture and Programming: V. Rajaraman, C. Shiv Ram

Murthy, PHI

10) Parallel Programming in C with MPI and OpenMP: Michael J. Quinn, Tata McGraw

Hill

MCA – 306: ALGORITHMS LAB. & OPERATING SYSTEMS LAB.:

A) Algorithm Lab.: Implementations of following algorithms: sorting (quick sort, heap

sort, merge sort), dynamic programming (matrix chain multiplication, LCS), greedy

algorithm (activity – selection – method, Huffman code, matroid), backtracking, graph

algorithms (DFS, BFS, Prim’s, Kruskal’s, Warshall’s, Floyd’s, Dijkstra’s)

B) Operating System Lab.: Unix commands, shell programming (bash shell), system

call; demonstration of process / thread synchronization by writing codes (C / C++ /

Java), simulation of CPU scheduling, page replacement, disk scheduling algorithms.

MCA – 307: DBMS & SOFTWARE ENGINEERING LAB.:

A) DBMS Lab.: Detailed study of Oracle DBMS, interacting with SQL and PL/SQL.

B) Software Engineering Lab: Simulating and testing different SE principles.

40

FOURTH SEMESTER:

Theory: (L-T-P) Credit MCA – 401: Computer Networks and Data Communications (4-0-0) 4 MCA – 402: Operations Research (4-0-0) 4 MCA – 403: Java Technologies (3-1-0) 4 MCA – 404: Compiler Design (4-0-0) 4 MCA – 405: .Net Technologies (3-1-0) 4 Practical: MCA – 406: Java Technology Lab. & .NET Lab. (0-0-3) 3 MCA – 407: Compiler Design Lab., OR & Network Lab. (0-0-3) 3

MCA – 401: COMPUTER NETWORKS AND DATA COMMUNICATIONS :

A) Introduction: Data communication between internal parts of a computer; introduction

to communication system and computer networks, structure of the communication

network (DTE, DCE, DSE, AP, OS, H/W, logical / physical / local connections),

different tasks of a typical communication system; types of networks (LAN, MAN,

WAN, PAN, others); network topologies and design goals of each topology; modes of

communication (synchronous vs. asynchronous); types of data (analog, digital); point –

to – point vs. multidrop circuits; simplex, half / full duplex communication; internet:

network of networks; connection oriented vs. connection – less networks; existence of

data communication systems where main recipient is not computer: telephone network,

mobile network, cable TV network, satellite, bluetooth. [5%]

B) Layered Architecture of Computer Network: Need for layered architecture; need for

standard architecture; concept of open system; OSI architecture based on protocol and

interface; peer – to – peer and hierarchical communication; 7 – layer architecture and

responsibilities of each layer; OSI terminologies: SDU, PCI, ICI, IDU, PDU, SAP;

service interface; data transfer modes; supplementary functions: multiplexing / splitting

of connections, segmentation / reassembly, blocking / unblocking, concatenation of

data units; other layered architecture: SNA, DNA, others; who will create and who will

use protocol?; who will create and who will use interface?; need for standard; list of

standard making organizations. [15%]

C) Physical Layer: Transmission of data using signal; data: analog / digital, signal:

analog / digital; properties of analog and digital signals; types and properties of guided

/ unguided transmission media; media that can carry digital signal and media that can

41

carry analog signal; any type of data can be transmitted using any type of signal;

properties of sender and receiver devices that can read / produce signal and that can

produce / convert data from / to signal; transmission impairement; limitation of data

rate; measurement of performance of media / signal / transmission; digital transmission

techniques: conversion of analog / digital data into digital signal, transmission modes;

analog transmission techniques: conversion of analog / digital data into analog signal;

bandwidth utilization of both digital and analog signals: physical multiplexing and

spread spectrum; trade off between installing a dedicated computer network and using

already established / available networks; techniques of using telephone network for

computer networking; techniques of using cable TV network for computer networking;

use of mobile network (GSM / CDMA) for computer network; use of satellite networks

for computer network; types of media, devices and interfaces used for solely computer

networks; EIA standards; in the era of wireless communication computer and mobile

devices are treated equally. [15%]

D) Data Link Layer: Error control: types of errors (content, flow integrity), need and

types of coding for error detection and correction, error detection methods, forward

error correction methods (block parity, hamming code, interleaved code, convolutional

code), reverse error correction (stop and wait, go – back – N, selective retransmission);

flow control methods (usually tied up with error control): stop and wait, sliding

window; three ways to resolve multiple access of single link (channel) by several

stations: random access protocols, controlled access protocols, channelization

protocols; media access is so important that data link layer may be divided into two sub

– layers (one is dedicated for media access: MAC, all other tasks: LLC); frame design

(framing) considerations: types of frame, transparency, bit – oriented vs. byte oriented;

study of two standard protocols: SDLC and HDLC. [10%]

E) Standard Wired / Wireless LAN: Study of application of both physical and data link

layer concepts in LAN; IEEE 802 standards for LANs; study of 802.2, 802.3, 802.4,

802.5, 802.11 LANs and their different variations; study of 802.1 standard for LLC;

existence of other standards in LAN. [12%]

F) Standard WAN: Concept of switching: circuit, packet / datagram; virtual circuit

networks; switching techniques; detailed study of ATM and X.25. [10%]

G) Interconnecting Networks: Requirement of interconnecting devices; amplifier,

repeater, hub, switch, bridge (source routing vs. transparent), router, brouter, gateway;

study of working of different devices; comparison between different devices; study of

different routing protocols. [8%]

H) Network Layer: Detailed study of different methods of achieving network layer

functionalities; study of exiting standard protocols for network layer: IPv4, IPv6, ARP,

42

RARP, BOOTP, DHCP, ICMP, IGMP, RIP, OSPF, BGP; study of MPLS; study of IP

security. [10%]

I) Transport Layer: detailed study of different methods for achieving transport layer

functionalities; details of TCP and UDP; transport layer security (SSL). [10%]

J) Session, Presentation and Application Layer: Some examples of existing standard

protocols. [5%]

REFERENCE BOOKS:

1) Computer Networking: A Top – Down Approach: James F. Kurose, Keith W. Ross,

Pearson

2) Computer Networks: Andrew S. Tanenbaum, David J. Wetherall, Pearson

3) Data and Computer Communications: William Stallings, Pearson

4) Data Communication and Networking: Behrouz A. Forouzan, Tata McGraw Hill

5) Computer Networks: A System Approach: Larry L. Peterson, Bruce S. Davie, Morgan

Kaufmann Publishers

6) Introduction to Data Communications and Networking: Wayne Tomasi, Pearson

7) Data Communication and Computer Networks: ISRD Group, Tata McGraw Hill

8) Data Communications and Computer Networks: Prakash C. Gupta, PHI

9) Data Communications and Computer Networks for Computer Scientists and

Engineers: Michael Duck, Richard Read, Pearson

10) Computer Networks and Internets with Internet Applications: Douglas E. Comer, M. S.

Narayanan, Pearson

11) Computer Networks – Protocols, Standards and Interfaces: Uyless Black, PHI

12) Data Communications and Networks: Achyut S. Godbole, Atul Kahate, Tata McGraw

Hill

MCA – 402: OPERATIONS RESEARCH:

A) Fundamental: Basic concept of operation research: quantitative approach to decision

making, history, features, OR models, solving OR model (analytical, numerical, Monte

Carlo methods), advantages of models, “more than just mathematics”, phases of an OR

study, opportunities and shortcomings of OR, application and scope. [5%]

B) Linear Programming: Mathematical model formulation of L. P.; graphical analysis;

simplex method of L. P. problems; duality; transportation problems; assignment

problems; sequencing problems, sensitivity analysis. [25%]

43

C) Integer programming; Dynamic Programming; Non-linear programming

(elementary); Quadratic programming. [20%]

D) Game Theory: Max-Min principle, LPP methods, Algebraic Methods [10%]

E) Queuing Theory: Queue disciplines, Pure birth process, Pure death process, FCFS,

M/M/1, M/M/N queues, Monte Carlo Simulation (elementary) [15%]

F) Network Scheduling: PERT/CPM, critical path analysis. [10%]

G) Inventory Control Models : Purchasing Model, Manufacturing Model, EOQ System

of ordering, Multi-Item Deterministic model, Stochastic models, Purchase Inventory

model with price breaks (effect of quantity discount) [15%]

REFERENCE BOOKS:

1. Operations Research an Introduction: Handy A. Taha, Pearson Education

2. Operations Research (Theory and Application): J. K. Sharma, McMillan Business Books

3. Quantitative Techniques in Management: N. D. Vohra, TMH

4. Operations Research: Kanti Swarup, P. K. Gupta, Man Mohan, Sultan Chand & Sons.

MCA – 403: JAVA TECHNOLOGIES :

A) Introduction: Java as object oriented language, internet language; review of object

oriented programming, GUI programming and Java. [5%]

B) Multithreaded Programming: Overview of threads, creating threads,

synchronization, deadlock, inter – thread communication. [8%]

C) Java Applet: Overview, life cycle of applet, Graphics class, colours, displaying text,

applet dimensions, applet in web page, Applet class, AppletContext class, using threads

and images. [7%]

D) Abstract Window Toolkit: Labels, buttons, canvases, check boxes, choices, text field

and text areas, lists, scroll bars, layout mangers, panels, frame, menu bar, dialog box,

peer based model and light weight model, awt vs. swing. [20%]

E) Introduction to Event Handling: Event delegation model, event classes, event

listeners, adapter classes, inner class, anonymous inner class. [10%]

F) Java Database Connectivity (JDBC): Introduction, concept of ODBC and JDBC,

PreparedStatement interface, CallableStatement interface, DatabaseMetadata interface:

getting driver information; working with tables, stored Procedures; working with

ResultsetMetadata object, using transactions; session. [10%]

44

G) Java Servlet: Introduction, three – tier architecture, concept of a web server and server

– side programming, basic Servlet structure, Servlet life cycle, Servlet API, Servlet

Interface, GenericServlet Class, HttpServlet Class. [20%]

H) Java Server Page: Introduction, architecture of JSP, concept of JSP API, life cycle of

JSP; interaction with database using JSP; JSP to Servlet Interaction. [15%]

I) Object Serialization and Remote Method Invocation (RMI): Introduction,

Distributed Object Model; CORBA; RMI: architecture, stub and skeleton, layer,

remote reference layer, transport layer, remote registry; package of RMI; implementing

RMI: the Server, the Client. [5%]

REFERENCE BOOKS:

1) Core Java (Volume I – Fundamentals): Cay S. Horstmann, Gary Cornell, Pearson

2) Core Java (Volume II – Advanced Features): C. S. Horstmann, G. Cornell, Pearson

3) Core Servlets and Java Server Pages (Volume 1: Core Technologies): Marty Hall,

Larry Brown, Pearson

4) Core Servlets and Java Server Pages (Volume 2: Advanced Technologies): Marty Hall,

Larry Brown, Yaakiv Chaikin, Pearson

5) Java Servlet and JSP Cookbook: Bruce W. Perry, Shroff / O’Reilly

6) Java: The Complete Reference, 8th Edition: Herbert Schildt, Tata McGraw Hill

7) The Complete Reference: J2EE: James Keogh, Tata McGraw Hill

8) Graphic Java: Mastering the AWT: David M. Geary, Alan L. McClellan, Prentice Hall

9) Graphic Java (Volume 2): Swing: David Geary, Pearson

MCA – 404: COMPILER DESIGN:

A) Introduction: Evolution of programming languages; language processors; interpreters,

compilers, assemblers, pre – processors, linker / loader, virtual machine. [10%]

B) Overview of Compiler: Overview of a compiler; structure, phases and passes of

compiler; problems of compiler design; application of compiler design technology;

inter – dependencies between compiler and computer architecture. [10%]

C) Formal Languages: Elements of formal language theory [10%]

D) Regular Languages: Regular grammars, regular expressions, finite state automata;

conversions; state minimization. [10%]

E) Lexical Analysis: Lexical analysis vs. parsing; tokens, patterns, lexemes; input

buffering; specification and recognition of tokens; lexical analyzer. [10%]

F) Syntax Analysis / Parsing: Context free grammar; parse trees and derivations;

ambiguity; elimination of left recursion and left factoring; top – down parsing:

recursive – descent parsing, predictive parsing, LL(1) parsers; bottom – up parsing:

45

shift – reduce parsing, conflicts; LR parsing (simple, canonical, look ahead); operator

precedence. [25%]

G) Intermediate Code Generation: Intermediate code generation, symbol tables, syntax

trees; type checking, control flow statements, back – patching; code optimization; code

generation; flow graphs. [20%]

H) Error Detection And Recovery: Error detection and recovery. [5%]

REFERENCE BOOKS:

1) Compilers – Principles, Techniques & Tools: Aho, Sethi & Ullman, Addison Wesley

2) Compiler Design in C: Holub, PHI

3) Compiler Design: Dhamdhere

4) Principles of Compiler Design: Alfred V. Aho & Jeffrey D. Ullman, Narosa

MCA – 405: .NET TECHNOLOGIES :

A) Introduction: Introduction to .NET; problem with DNA, COM; SOAP and .NET;

architecture of .NET framework: CLR (common type system, IL to native code

compiler, execution support, security, garbage collection, stack walk, code manager,

class loader, memory layout), framework base classes (IO, ADO.NET, XML,

threading, component model, security, diagnostics, others), Windows forms / services /

console applications, Web forms / services; elements of a .NET application

(assemblies, modular, types), versioning and deployment, memory management (better

/ optimized garbage collection, faster memory allocation for objects), cross language

integration, attributes, reflection API, IL disassemble; visual studio features (solution

explorer, namespace, code window, properties window, task list, command window,

server explorer, macros and others); current status and future of .NET; XML as meta

language. [10%]

B) VB .NET Language: .NET IDE; using features of IDE; VB.NET projects; compiling

and debugging VB.NET applications; option strict / explicit / compare; data types:

value types (structures) / primitive types / reference types (classes); variables,

properties, subroutines, functions; parameter passing, boxing; objects, classes,

instances; object declaration, instantiation, dereferencing; early vs. late binding;

constructor termination and clean up; overloading constructor / methods; shared

methods / variables / events; delegates; class vs. component; inheritance and multiple

interfaces; abstraction, encapsulation, polymorphism; namespace (namespace vs.

references, common namespaces, importing / aliasing namespaces, creating own

namespace); exception handling; using Visio; Windows forms and controls; Windows

forms inheritance; Threading; developing components; types of components;

46

components classes; describing assemblies, deployment strategies, deploying

applications. [50%]

C) C# .NET Language: Object oriented programming using C# .NET [20%]

D) ADO .NET Technology: ADO.NET overview; data providers; data set; data

designers; data binding; XML integration. [10%]

E) ASP .NET Technology: Web development using ASP.NET technology ; Web form

application development; building and using web services. [10%]

REFERENCE BOOKS:

1) Beginning VB .NET 2003: Richard Blair, Thearon Willis, Jonathan Crossland, Wrox

2) Learn to Program with VB.NET 2008 Express Edition: John Smiley, Smiley Publishing

3) Programming VB.NET: A Guide for Experienced Programmers: Gary Cornell,

Jonathan Morrison Joint, Apress

4) Moving to VB.NET: Strategies, Concepts and Code: Daniel Appleman, Apress

5) ASP.NET and VB.NET Web Programming: Matt J. Crouch, Pearson

6) The Ultimate VB.NET and ASP.NET Code Book: Karl Moore, Apress

7) Programming VB.NET: Julia C. Bradley, Anita C. Millspaugh, Tata McGraw Hill

8) Beginning Object – Oriented ASP.NET 2.0 with VB.NET: From Novice to

Professional: Brian R. Myers, Apress

9) Pro C# with .NET 3.0: Andrew Troelsen

10) C# 2012 Programming Covers .NET 4.5: Black Book: Kogent Learning Solutions Inc.

11) C# 3.0 Cookbook: Jay Hilyard, Stephen Teilhet, O’Reilly (Shroff Publishers)

MCA – 406: JAVA TECHNOLOGY LAB. & .NET LAB.:

A) JAVA TECHNOLOGY : Implementation of the following features: multithreaded

programming, Applet, event handling, abstract window toolkit, Java Servlet, Java

Server Pages, Java Database Connectivity (JDBC), object serialization and Remote

Method Invocation (RMI).

B) .NET Lab.: Windows and internet programming using VB .NET, C# .NET, ASP .NET

and ADO .NET

MCA – 407: COMPILER DESIGN LAB., OR & NETWORK LAB.:

A) Compiler Design Lab.: Implementation of different compiler design principles.

B) Operation Research Lab.: Implementation of different OR principles or methods.

C) Network Lab.: Implementation of different algorithms encountered in networking;

hands – on experiencing with networking.

47

FIFTH SEMESTER:

Theory: (L-T-P) Credit MCA – 501: Internet & Web Technologies (3-1-0) 4 MCA – 502: Artificial Intelligence (4-0-0) 4 MCA – 503: Elective – I (4-0-0) 4 MCA – 504: Elective – II (4-0-0) 4 Practical: MCA – 505: Term Paper & Seminar (0-0-2) 2 MCA – 506: Web Technology Lab. & AI Lab. (0-0-3) 3 MCA – 507: System Lab. (Elective – I and Elective – II) (0-0-3) 3

MCA – 501: INTERNET & WEB TECHNOLOGIES :

A) Internet: Evaluation of Internet, Internet applications: E – Commerce, E – Banking, E

– Learning, E – Governance and others; TCP/IP model, introduction to RFC, Internet

service providers, types of connectivity; addressing in Internet: IP, domains, DNS,

address translation, routing protocols; TCP and UDP; segmentation and reassembly,

congestion control, QoS; Internet server and clients module. [20%]

B) E - Mail and List – Servers: E-mail networks, E-mail protocols, format of an E-mail

message, description of E-mail headers, E-mail contents and encoding, E-mail routing,

List-servers, E-mail clients. [5%]

C) File Transfer Protocol and Telnet: Introduction to FTP, public domain software,

Types of FTP Servers, FTP clients, common commands; Telnet protocol, Server

daemon, Telnet clients, Terminal emulation. [15%]

D) World Wide Web: Evolution of WWW, features, WWW browsers, WWW servers,

URL; WWW Browsers: basic features, bookmarks, history, progress indicators,

personalization of browsers, printing displayed pages and forms, saving and

downloading, cookies; Web publishing: technology overview, web site planning,

where to host web site, multiple sites on one server, one site on multiple servers,

maintaining a web site, web publishing tools; Search Engines: Technology Overview,

Poplar Search Engines, How to register a Web Site on Search Engines; HTML:

document overview, page layout and rendering using HTML elements; CSS, XML

(DTD); use of multimedia in Internet. [30%]

E) Interactivity Tools: ActiveX, Applet, VB Script, JavaScript, ASP, JSP, PHP,

ColdFusion. [20%]

48

F) Internet Security: Overview of Internet security; threats, firewalls. [10%]

REFERENCE BOOKS:

1) Internet and Web Technologies: Raj Kamal, Tata McGraw Hill

2) Web Technologies Black Book: HTML, JavaScript, PHP, Java, JSP, XML and AJAX:

Kogent Learning Solutions Inc., Dreamtech Press

3) Programming the World Wide Web: Robert W. Sebesta, Pearson

4) Web Technologies: A Computer Science Perspective: Jeffrey C. Jackson, Pearson

5) The Complete Reference: HTML & CSS: Thomas A. Powell, Tata McGraw Hill

6) JavaScript: The Definitive Guide: David Flanagan, O’Reilly

7) The Complete Reference: PHP: Steven Holzner, Tata McGraw Hill

8) Internetworking with TCP/IP: Principles, Protocols and Architecture (Volume: 1):

Douglas E. Comer, PHI

9) Internetworking with TCP/IP: Design, Implementation and Internals (Volume: II):

Douglas E. Comer, David L. Stevens, PHI

10) Internetworking with TCP/IP: Client Server Programming and Applications (Volume:

III): Douglas E. Comer, Addison Wesley Professional

MCA – 502: ARTIFICIAL INTELLIGENCE :

A) Introduction: What is AI; thinking / acting rationally / humanly; foundations of AI

(Philosophy, Mathematics, Economics, Neuroscience, Psychology, Computer

Engineering, Control Theory, Cybernetics, Linguistics); history of AI. [5%]

B) Problem Solving and Search Strategies: Formulating problems, uninformed search

strategies (BFS, DFS, depth – limited search, iterative deepening DFS, bidirectional

search, avoiding repeated states); searching with partial information (sensorless

problems, contingency problems, exploration problems); informed (heuristic) search

strategies; greedy BFS; AND/OR graphs; A*, AO* Algorithm, Hill – climbing,

simulated annealing, local beam search; constraint satisfaction problems; adversarial

search, searching game trees; alpha – beta pruning. [15%]

C) Logic in AI: Propositional logic; First Order Predicate Logic; syntax, semantics,

equality, equivalence, validity, satisfiability; use of FOPL in knowledge representation;

inferences; forward and backward chaining; redundant inference and infinite loops;

CNF; resolution principle. [10%]

D) Uncertainty Management: Handling uncertain knowledge; probabilistic reasoning;

Bayesian inference and Bayesian networks; exact / approximate inferences in Bayesian

49

networks; clustering algorithms; Markov chain simulations; theory of beliefs;

ignorance representation: Dempster – Shafer theory; vagueness representation: Fuzzy

sets and Fuzzy logic. [15%]

E) Knowledge & Knowledge Representation: Semantic Networks, Frames, Conceptual

Dependency & Scripts. [5%]

F) AI Programming Languages: Introduction to LISP and PROLOG. [15%]

G) Expert Systems: Rule based system architecture, non – production system

architecture; knowledge acquisition methods; explanation methods; expert system

shells. [10%]

H) Learning: Learning from observations; inductive learning; statistical learning

(learning with complete data, learning with hidden variables, instance – based learning,

neural networks, connectionist AI, and symbolic AI, kernel machines); reinforcement

learning (active / passive); genetic learning. [15%]

I) Advanced Topics: Pattern recognition; natural language processing; computer vision;

planning; scheduling; decision making (beliefs, desires, utility theory, and decision

networks); perception; robotics. [10%]

REFERENCE BOOKS:

1) Artificial Intelligence – A Modern Approach: Stuart Russel, Peter Norvig, Pearson

2) Artificial Intelligence: Elaine Rich, Kevin Knight, Shivashankar B. Nair, Tata McGraw

Hill

3) Introduction to Artificial Intelligence and Expert Systems: Dan W. Patterson, PHI

4) Principle of Artificial Intelligence: Nils J. Nilsson, Narosa Publishing House

5) Artificial Intelligence: A New Synthesis: Nils J. Nilsson, Elsevier

6) Artificial Intelligence: George F. Luger, Pearson

7) Artificial Intelligence: Structures and Strategies for Complex Problem Solving: George

F. Luger, Pearson

8) Artificial Intelligence: Patrick Henry Winston, Pearson

9) Introduction to Artificial Intelligence: E. Charniak, D. McDermott, Pearson

MCA – 503: ELECTIVE – I: Please refer to the list of electives at page 52. MCA – 504: ELECTIVE – II: Please refer to the list of electives 52.

50

MCA – 505: TERM PAPER & SEMINAR :

A real life minor project: problem on current topics in the field of Computer

Science and / or Information Technology involving reasonable size program

development (which is not possible in practical classes) will be assigned to

every student and the student has to present the problem in form of seminar (at

the end of 5th semester) in presence of departmental teacher(s) and external

expert(s). Student will carry on his / her project work in guidance of one

departmental teacher.

MCA – 506: WEB TECHNOLOGY LAB. & AI LAB.:

A) Web Technology Lab.: Web development using various contemporary technologies.

B) AI Lab. : Programming using LISP, implementation of various AI concepts

through computer application / simulation.

MCA – 507: SYSTEM LAB.:

A) Implementation of the problems related to Elective – I

B) Implementation of the problems related to Elective – II

51

SIXTH SEMESTER: (L-T-P) Credit MCA – 601: Project Work (0-1-0) 12 (Report: 100, Seminar: 200) MCA – 602: Grand Viva (0-0-0) 8 MCA – 603: Social Outreach Programme (0-0-0) 2 MCA – 601: PROJECT WORK :

Students should complete their project work preferably in a software company / research

institute under the joint guidance of a teacher of the department and officer / scientist

of the company. Duration of the project in the industry should be about 5 months.

However, students can perform their project work in the department also, but, the

problem should be from current industry area.

After completion of the project work, student should prepare a report and present a

seminar in front of departmental teachers as well as external expert(s). Credits will be

given for the report (100 marks) and for seminar (200 marks).

MCA – 602: GRAND VIVA :

Every student must have to face a viva – voce examination in front of external expert(s).

Questions will be asked from any / all subjects taught in MCA course.

MCA – 603: SOCIAL OUTREACH PROGRAMME :

Every student must engage themselves in some kind of social service within the scope of

their subject domain. If the nature of the service is not within direct scope of the subject

domain, then at least some relevance should be there. They have to prepare a report after

completion of this kind of social contribution project. Nature of the project, plan,

procedure, implementation / execution, experience / observations, future scope, past or

contemporary endeavours should be reflected in the report. They have to present their

report in presence of departmental teachers as well as external expert(s).

52

L IST OF ELECTIVES :

Elective – I & Elective - II should be chosen from the given lists: Elective – I:

E – 01: Advanced Network Programming

E – 02: Network Security & Cryptography

E – 03: Mobile Computing

E – 04: Advanced Unix Programming

E – 05: Advanced Windows Programming

E – 06: Pattern Recognition

E – 07: Computational Geometry

Elective – II:

E – 08: Advanced Operating Systems

E – 09: Computational Intelligence

E – 10: Natural Language Processing

E – 11: Data Warehousing & Data Mining

E – 12: Advanced DBMS

E – 13: Embedded Systems & VLSI Design

E – 14: Image Processing

E – 15: Object Oriented Analysis & Design

L IST OF PAPERS OFFERED FOR STUDENTS OF OTHER PG DEPARTMENTS :

CSO – 01: Programming in C (L-T-P: 4-0-2)

CSO – 02: Object Oriented Programming in Java (L-T-P: 4-0-2)

CSO – 03: Computing for Management (L-T-P: 3-1-2)

CSO – 04: Computing for Commerce and Business (L-T-P: 3-1-2)

53

E – 01: ADVANCED NETWORK PROGRAMMING :

A) Introduction to Processes: Multitasking, processes, multithreading, threads; inter – thread &

inter – process communications, network communications. [10%]

B) Client – Server Network Programming: Unicast, multicast broadcast; sockets, RMI, applet –

servlet communications; ping, e – mail and file transfer; ICMP, SMTP, POP3, IMAP, FTP

protocols; web traffic: HTTP, HTTPS protocols. [10%]

C) Client – Side Network Programming: Static documents; HTML, XHTML, XML languages;

Dynamic documents; applets, Java Script. [10%]

D) Server – Side Network Programming: Database access; servlets, JSP, ASP, PHP technologies.

[10%]

E) Advanced Network Programming Issues: Firewalls, proxy servers, caches; elements of

CORBA, J2EE, and .NET technologies. [10%]

F) Low Level Issues: IP overview, data rates, MPLS, hardware vs. software; router architecture,

network device drivers, buffer management. [10%]

G) Transport Layer: Review of sockets, TCP protocol description; implementation of TCP, other

transport layer protocols (e.g. RTP, RTCP, RTSP). [10%]

H) Network Layer: Internet routing protocols (RIP, OSPF, BGP); router configuration and network

administration; IP support for multicast. [10%]

I) Signalling in Packet Networks: The control plane; why is signalling needed? End – to – end

signalling (e.g. SIP); QoS and resource reservation, signalling in IP networks, MPLS signalling.

[10%]

J) Advanced Packet Forwarding: Deep packet probes, policy – based routing; hardware

acceleration, network processors. [10%]

REFERENCE BOOKS:

1) Unix Network Programming: The Sockets And Networking API (volume – 1: W. Richard Stevens,

Bill Fenner, Andrew M. Rudoff, PHI

2) Unix Network Programming: Interprocess Communications (Volume - 2): W. Richard Stevens,

PHI

3) Internetworking with TCP / IP: Client – Server Programming and Applications (Volume – III):

Douglas E. Comer, David L. Stevens, PHI

4) Java Network Programming: Elliotte Rusty Harold, O’Reilly (Shroff Publishers)

5) Advanced Network Programming – Principles and Techniques (Network Application

Programming with Java): Bogdan Ciubotaru, Gabriel – Miro Muntean,” Computer

Communications and Networks”, Springer

54

6) Network Programming in .NET: with C# and Visual Basic .NET: Fiach Reid, Elsevier

7) Professional .NET Network Programming: Christian Nagel, Ajit Mungale, Vinod Kumar,

Nauman Laghari, Andrew Krowczyk, Tim Parker, Srinivasa Sivakumar and Alexandru Serban,

Appress

8) The Definitive Guide to Linux Network Programming: Keir Davis, John W. Turner, Nathan

Yocom, Appress

E – 02: NETWORK SECURITY AND CRYPTOGRAPHY :

A) Introduction: Basic concept of network security; attacks, services, mechanisms – security

attacks – security services – model for network security – Internet standards.

B) Conventional Encryption and Message Confidentiality: Conventional encryption principles;

conventional encryption algorithms; cipher block modes of operations; location of encryption

devices; key distribution; symmetric key cryptography: what is SKC? SKC in real world; DES,

IDEA, comparison between DES and IDEA, ATM transaction.

C) Public Key Cryptography and Authentication: Approaches to message authentication; secure

hash functions and HMAC; public key cryptography principles; public key cryptography

algorithms; RSA, DS, Elgamal DS; digital signatures; key management; digital certificates; how a

digital certificate is really made; example of use of DC; certificate hierarchies.

D) Authentication and E – Mail Security: Kerberos; X.509 directory authentication services; PGP;

S/MIME.

E) IP Security: IP security overview; IP security architecture; authentication header; encapsulating

security pay load; combining security associations; key management.

F) Web Security: Web security requirements; SSL and transport layer security; SET network

management security.

G) System Security: Intruders; viruses; related threats; fire design principles; trusted systems.

H) Firewall: Firewall and Internet access; firewall implementation, packet level filter; firewall

architecture.

REFERENCE BOOKS:

1) Network Security Essentials: Applications and Standards: William Stallings, Pearson

2) Network Security: Private Communication in a Public World: Kaufman, Pearson

3) Cryptography and Network Security: William Stallings, Pearson

4) TCP / IP: D. E. Comer, PHI

5) Network Security and Cryptography: Atul Kahate, Tata McGraw Hill

55

E – 03: MOBILE COMPUTING :

A) Unit – I: Introduction to Personal Communication Services (PCS): PCS architecture, mobility

management, networks signalling; Global System for Mobile Communication (GSM) system

overview: GSM architecture, mobility management, network signalling; General Packet Radio

Services (GPRS): GPRS architecture, GPRS network nodes; Mobile Data Communication:

WLANs (Wireless LANs), IEEE 802.11 standards, mobile IP.

B) Unit – II: Wireless Application Protocol (WAP): The mobile Internet standard, WAP Gateway

and protocols, wireless mark up languages (WML); Wireless Local Loop (WLL): introduction to

WLL architecture, wireless local loop technologies.

C) Unit – III: Third Generation (3G) mobile services: introduction to International Mobile

Telecommunications 2000 (IMT 2000) vision, Wideband Code Division Multiple Access (W –

CDMA) and CDMA 2000, QoS in 3G.

D) Unit – IV: Global Mobile Satellite Systems; case studies of the IRIDIUM and GLOBALSTAR

systems; Wireless Enterprise Networks: introduction to virtual networks, blue tooth technology,

blue tooth protocols.

E) Unit – V: Support for mobility: file systems: consistency, examples; WWW: HTTP, HTML,

some approaches that might help wireless access, sysem architecture; WAP; architecture, wireless

datagram protocol, wireless transport layer security, wireless transaction protocol, wireless

session protocol, wireless application environment, WML, WML script, wireless telephony

application, examples stacks with WAP, mobile databases, mobile agents.

REFERENCE BOOKS:

1) Principles of Mobile Computing: Uwe Hansmann, Lothar Merk, Martin S. Nicklous, Thomas

Stober, Springer

2) Mobile Communications: Jochen Schiler, Pearson Education (Addison – Wesley)

3) Wireless Communications: Principles and Practice: Theodore S. Rapport, Pearson

4) Wireless and Mobile Network Architectures: Yi Bing Lin, Imrich Chlamtac, Wiley India

5) Wireless Communications and Networks: William Stallings, Pearson Education

6) Mobile Computing: Technology, Application and Service Creation: Asoke K. Talukder, Hasan

Ahmed, Roopa R. Yavagal, Tata McGraw – Hill

7) Ad Hoc Mobile Wireless Networks: Protocols and Systems: C. K. Toh, Pearson

8) Principles of Wireless Networks: A Unified Approach: Kaveh Pahlavan, Prashant Krishnamurthy,

Pearson

9) Wireless Networking: Charles N. Thurwachter, Prentice Hall

56

10) Mobile Satellite Communications: Principles and Trends: Madhavendra Richharia, John Wiley &

Sons

11) Wireless Networks: P. Nicopolitidis, M. S. Obaidat, G. I. Papadimitriou, A. S. Pomportsis, Wiley

India

E – 04: ADVANCED UNIX PROGRAMMING :

A) Unit – I: Organisation of Unix; user interface; programmer interface; the environment of Unix

process; system calls; process control; file related system call; process related system calls;

signals programming using system calls. [40%]

B) Unit – II: Advanced I/O multiplexing, memory mapped I/O. [15%]

C) Unit – III : Inter – process communication, pipes, shared memory, semaphores, messages.

[20%]

D) Unit – IV: Advanced inter – process communications, streams, pipes, open server. [25%]

REFERENCE BOOKS:

1) Advanced Programming in the UNIX Environment: W. Richard Stevens, Stephen A. Rago,

Pearson Education

2) Advanced Linux Programming: Alex Samuel, Mark Mitchell, New Riders Pub.

3) Advanced Unix Programming: N. B. Venkateswadu, BSP Books Pvt. Ltd.

4) Advanced UNIX Programming: Marc J. Rochkind, Addison – Wesley Professional

5) UNIX System Programming Using C++: Terrence Chan, Prentice – Hall

6) The UNIX Programming Environment: Brian W. Kernighan, Rob Pike, PHI

7) The Design of the UNIX Operating System: Maurice J. Bach, PHI

8) Linux Kernel Development: Robert Love, Pearson

9) Linux System Programming: Robert Love, O’Reilly

E – 05: ADVANCED WINDOWS PROGRAMMING :

A) Unit – I: Windows concepts and terminology, key elements. [10%]

B) Unit – II: Creating look, using OO technology, communications via messages, windows

resources and functions, adding multimedia and sound resources. [40%]

C) Unit – III: Writing windows applications, taking control of windows, adding menus, dialog

boxes. [20%]

57

D) Unit – IV: Special control, MFC library, MFC programming concept and methods, developing an

application. [30%]

REFERENCE BOOKS:

1) Programming Windows: The Definitive Guide to the Win32 API: Charles Petzold, Dreamtech

Press

2) Programming Windows with MFC: Jeff Prosise, Dreamtech Press

3) MFC Internals: Inside the Microsoft Foundation Class Architecture: George Shepherd, Scot

Wingo, Pearson Computing

4) Windows Programming Primer Plus: Jim Conger, Galgotia Pub. Pvt. Ltd.

5) Programming Applications for Microsoft Windows: Jeffrey Richter, Dreamtech Press

6) The Pragmatic Programmer: From Journeyman to Master: Andrew Hunt, David Thomas,

Pearson

E – 06: PATTERN RECOGNITION :

A) Introduction: Machine perception, Pattern recognition systems, Design cycle, Learning and

Adaptation, Bayesian Decision Theory: Bayesian decision theory: Continuous features.

[10%]

B) Maximum-Likelihood and Bayesian Parameter Estimation: Maximum likelihood estimation,

Bayesian estimation, Bayesian parameter estimation: Gaussian caseand General theory, Problems

of dimentionality, Hidden Markov Model. [20%]

C) Nonparametric Techniques: Density estimation, Parzen windows, kn-Nearest- Neighbor

estimation, Nearest-Neighbor rule, Matrics and Nearest-Neighbor classification.

[15%]

D) Linear Discriminants Functions: Linear discriminant functions and decision surfaces,

Generalised linear discriminant functions, 2-Category linearly separable case, Minimising the

Perceptron criterion function, Relaxation procedure, Nonseparable behavior, Minimum squared

error procedure, Ho-Kashyap procedures, Multicategory generalizations.

[15%]

E) Non-metric Methods: Decision tree, CART, ID3, C4.5, Gramatical methods, Gramatical

interfaces. [10%]

F) Algorithm Independent Machine Learning: Lack of inherent superiority of any classifier, Bias

and Variance, Resampling for estimating statistic, Resampling for classifier design, Estimating

and comparing classifiers, Combining classifiers. [10%]

58

G) Unsupervised Learning and Clustering: Mixture densities and Identifiability, Maximum-

Likelihood estimations, Application to normal mixtures, Unsupervised Bayesian learning, Data

description and clustering criterion function for clustering, Hierarchical clustering, Applications

of Pattern Recognition. [20%]

REFERENCE BOOKS:

1) Pattern Recognition: Methods and Applications: Khalid Hosny, Jorge De La Calleja, Createspace

2) Pattern Recognition: Techniques and Applications: Rajjan Shinghal, Oxford University Press

3) Pattern Recognition: An Algorithmic Approach: M. Narasimha Murty, V. Susheela Devi,

University Press

E – 07: COMPUTATIONAL GEOMETRY :

A) Grids and Hulls: Fixed-radius near neighbours, convex hull algorithms, dominance and

applications. [10%]

B) Linear Programming: Half-plane intersection and randomized LP, backwards analysis,

applications of low-dimensional LP. [10%]

C) Intersections and Triangulation: Plane-sweep line segment intersection, triangulation of

monotone subdivisions, plane-sweep triangulation of simple polygons. [15%]

D) Point Location: Kirkpatrick's method, trapezoidal decompositions and analysis, history DAGs.

Voronoi Diagrams: Basic definitions & properties, Fortune's algorithm. [10%]

E) Geometric Data Structures: kd-trees, range trees and range searching, hereditary segment trees ,

segment trees, nearest neighbour searching. [15%]

F) Delaunay Triangulations: Point set triangulations, basic definition and properties, randomize

incremental algorithm and analysis. [10%]

G) Arrangements and Duality: Point/line duality, incremental construction of arrangements and the

zone-theorem, applications. [15%]

H) Geometric Approximation: Dudley's theorem and applications, well-separated pair

decompositions and geometric spanners, VC dimension, epsilon-nets and epsilon-approximations.

[15%]

REFERENCE BOOKS: 1) Computational Geometry: Algorithms and Applications: Mark Overmars, Otfried Cheong, Marc

Van Kreveld, Mark De Berg, Springer

2) Perceptrons - Expanded Edition: An Introduction to Computational Geometry (Expanded

Edition): Marvin L. Minsky, Seymour A. Papert, MIT Press

59

E – 08: ADVANCED OPERATING SYSTEMS:

A) Introduction : Introduction of operating system fundamentals, evolution of modern operating

systems, centralized operating system, OS kernel structures – microkernel, monolithic kernel –

characteristics and privileged, Process Synchronization Management, operations, Threads, Events

and Scheduling, Device Drivers – Concepts-Design and Implementation, Network operating

system, Distributed operating system, cooperative autonomous systems. [5%]

B) Distributed System concepts and Architectures: Introduction of Distributed Systems, goals,

transparency, services, Distributed System Architectures, communication network Architectures,

issues in distributed operating systems, communication networks, communication primitives,

inherent limitations of a distributed system. [10%]

C) Concurrent processes and programming: processes and threads, thread application, user space

thread implementation, kernel space thread implementation, physical clocks, lamp ports logical

clocks , vector clocks, matrix logical clocks, language mechanism for synchronization, object

model resource servers, concurrent programming languages, distributed and network

programming. [10%]

D) Inter Process Communication and Coordination: Inter process Communication – Remote

Processor Call – overview and implementation , basic communication primitives-message

synchronization and buffering-pipe and socket API – secure sockets - group communication and

multicast, Request / reply communication – RPC operations – RPC Exception and failure

handling – secure RPC, transaction communication, name and directory services, Distributed

Mutual Exclusion, the classification of mutual exclusion and associated algorithms – a

comparative performance analysis, distributed computing environment, complete topology,

logical ring topology, tree topologies. [10%]

E) Distributed Process Scheduling: Static process scheduling-precedence process model-

communication process model, dynamic load sharing and balancing- sender initiated algorithm-

receiver initiated algorithm, distributed process implementation-remote service-remote execution-

process migration, real time scheduling-rate monotonic-deadline monotonic-earliest deadline

first-real time synchronization-priority ceiling protocol. [7%]

F) Distributed Deadlock: Introduction of Distributed Deadlock, deadlock handling strategies in

distributed systems, issues in deadlock detection and resolution , control organizations for

distributed deadlock detection , centralized and distributed deadlock detection algorithms,-

hierarchical deadlock detection algorithms, Agreement protocols – introduction and the system

60

model, a classification of agreement problems, solutions to the Byzantine agreement problem,

applications of agreement algorithms. [7%]

G) Advanced File Systems: introduction to Advanced File Systems ,Caching, Unix FFS, Log-

based File System, Single Address space system – Opal, Operating System Organization,

Distributed Shared Memory, introduction of distributed file systems(DFS), DFS design and

implementation-files and file systems-services and servers, file mounting and server registration-

stateful and stateless file servers-file access and semantics of sharing-version control, transaction

and concurrency control, data and file replication. [10%]

H) Distributed shared memory: Introduction of Distributed shared memory, Architecture –

algorithms for implementing DSM, memory coherence and protocols, design issues, introduction

of Distributed Scheduling, issues in load distributing, components of a load distributing

algorithm, stability, load distributing algorithm, performance comparison, selecting a suitable

load sharing algorithm, requirements for load distributing, task migration and associated issues,

introduction of Failure Recovery and Fault tolerance, classification of failures, backward and

forward error recovery, backward error recovery – recovery in concurrent systems – consistent set

of check points – synchronous and asynchronous check pointing and recovery – check pointing

for distributed database systems – recovery in replicated distributed databases. [7%]

I) Protection and security - Introduction of Protection and security, the access matrix model and

its implementations, safety in matrix model- advanced models of protection, Data security, Model

of cryptography, conventional cryptography, modern cryptography, private key cryptography,

data encryption standard, public key cryptography , multiple encryption, authentication in

distributed systems. [8%]

J) Multiprocessor operating systems - Introduction of Multiprocessor operating systems, inter

connection networks for multiprocessor systems , caching , hypercube architecture, structures of

multiprocessor operating system, threads, process synchronization and scheduling.

[8%]

K) Database Operating systems : Introduction of Database Operating systems, requirements of a

database operating system, Concurrency control, a concurrency control model of database

systems, the problem of concurrency control, serializability theory, distributed database systems,

basic synchronization primitives, lock based algorithms-timestamp based algorithms, optimistic

algorithms, concurrency control algorithms, data replication. [8%]

L) Detailed Case Studies: Unix, Linux, Open Solaris, Windows NT/XP (at least any two), Real-

time OS – Characteristics an example. [10%]

61

REFERENCE BOOKS:

1) Advanced concepts in operating systems: Distributed, Database and multiprocessor operating

systems -Mukesh Singhal, Niranjan G.Shivaratri- TMH, 2001.

2) Modern operating system -Andrew S.Tanenbaum- PHI, 2003.

3) Distributed operating systems and algorithm analysis-Randy chow,Theodore Johnson-

Pearson,2011.

4) Distributed operating system Concepts and design -Pradeep K.Sinha- PHI, 2003

5) Distributed operating system -Andrew S.Tanenbaum- Pearson education, 2003

6) Distributed Systems Concepts and Design -G Coulouris, J Dollimore and T Kindberg- Third

Edition, Pearson Education.

E – 09: COMPUTATIONAL INTELLIGENCE :

A) Introduction to Soft Computing: Soft computing constituents and conventional Artificial

Intelligence; Neuro – Fuzzy and Soft Computing characteristics; Fuzzy Sets, Fuzzy Rules and

Fuzzy Reasoning: introduction, basic definitions and terminology, set – theoretic operations, MF

formulation and parameterization, more on Fuzzy union, intersection and complement, extension

principle and fuzzy relations, fuzzy if – then rules, fuzzy reasoning, fuzzy inference system:

Mandani fuzzy models, Sugeno fuzzy models, Tsukamoto fuzzy models, other considerations.

[30%]

B) Derivative free optimization: Genetic algorithm, simulated annealing, random search, Downhill

simplex search, Adaptive Networks: architecture, back propagation for feed forward networks,

extended back propagation for recurrent networks; hybrid learning rule: combining steepest

descent and LSE; supervised learning. [20%]

C) Neural Networks: Perceptrons, Adeline, back propagation multi layer perceptrons, radial basis

function networks, learning from reinforcement, failure is the surest path to success, temporal

difference learning, the art of dynamic programming, adaptive heuristic critic, Q – learning, a cost

path problem, world modelling, other network configurations. [30%]

D) Part IV: Reinforcement learning by evolutionary computations; unsupervised learning and other

neural networks: competitive learning networks, Kohonen self – organizing networks, learning

vector quantization, Hebbian learning, principal component networks, Hopfield network;

Adaptive neuro – fuzzy inference systems: ANFIS architecture, hybrid learning algorithms,

learning methods that cross – fertilize ANFIS and RBNF, ANFIS as universal approximator,

simulation examples, extensions and advance topics; coactive neuro – fuzzy modelling: towards

generalized ANFIS: framework, neuro function for adaptive networks, neuro – fuzzy spectrum,

analysis of adaptive learning capability. [20%]

62

REFERENCE BOOKS:

1) Computational Intelligence Systems and Applications: Neuro-Fuzzy and Fuzzy Neural Synergisms: Marian B. Gorzalczany, Physica – Verlag

E – 10: NATURAL LANGUAGE PROCESSING:

A) Introduction, Origins and History: Introduction to Natural Language Understanding: The study

of Language, Applications of NLP, Evaluating Language Understanding Systems, Different

levels of Language Analysis, knowledge representation, Introduction to semantics.

[10%]

B) Machine Translation: Word-based alignment and translation - n-gram language models; Phrase-

based translation – Maximum entropy; Minimum error – rate training. Perceptron; Subword

translation – Transliteration; Integrating traditional translation rules. Integrating morphology into

translation; Syntax-based translation – Hierarchical and syntax-based MT. CKY decoding,

Syntax-based language models. [30%]

C) Computational Linguistics: Relationship between linguistics and NLP, computational models

for phonology, unphology, lexicography, syntax, semantics and discourse. [20%]

D) Information Retrieval (IR): Definition of information retrieval system, Objectives of

information retrieval system, Function overview, Database file structures, Boolean retrieval

systems, Vector retrieval system, Probability Retrieval System. [40%]

REFERENCE BOOKS:

1) Natural Language Processing and Information Retrieval: U. S. Tiwary, Tanveer Siddiqui

2) Statistical Machine Translation: Philipp Koehn

3) Computational Linguistics: R., Grishman, Cambridge University Press

4) Introduction to Information Retrieval: Manning, C.D., Raghavan, P. and Schütze

E – 11: DATA WAREHOUSING & DATA M INING :

A) Introduction to Data Mining, Warehousing and Visualization: The modern Data Warehouse,

Data Warehouse role and structures, Data Warehouse capabilities, cost of warehousing data,

63

foundations of Data Mining, roots of Data Mining, approach to Data Exploration and Data

Mining, Foundations of Data Visualization. [10%]

B) Data Warehouse: Stores, Warehouses and Marts, Data Warehouse Architecture, Metadata,

Metadata Extraction, Implementation of Data Warehouse, Data Warehouse technologies.

[20%]

C) Basic Data Mining Tasks: classification, association rules, Regression, clustering, decision

trees, neural network, data mining using neural network, Fuzzy Logic and Linguistic Ambiguity,

Artificial Neural networks, Genetic Algorithms and Genetically Evolved Networks, Applications

of Machines that can learn, data mining using genetic algorithm, data mining using rough sets.

[20%]

D) Data Mining and Data Visualization: introduction to Data Mining, Online Analytical

Processing, Data Mining Techniques, Limitations and Challenges to Data Mining, data mining

application. [20%]

E) Designing and Building the Data Warehouse: Approach to Data Warehouse Design, Data

Warehouse Project Plan, Analysis and Design Tools, Data Warehouse Architecture Specification

and Development. [15%]

F) Web mining, spatial mining, temporal mining : introduction, web content mining, web

structured mining, web usage mining, spatial data, spatial mining, time series , temporal data

mining and associated rules. [10%]

G) Future: The Future of Data Mining, Warehousing and Visualization [5%]

REFERENCE BOOKS:

1) Data Mining Techniques: Arun Kr. Pujari, University Press

2) Data Mining: Pieter Adriaans, Dolf Zantinge, Addison Wesley, 1999

3) Modern Data Warehousing, Mining and Visualization: George M. Marakas, Pearson Education

E – 12: ADVANCED DBMS:

A) Overview: Introduction to database system concept and architecture, network model overview,

hierarchical model overview. [2%]

B) Transaction processing and concurrency control: Introduction of Transaction Processing,

Transaction Execution and problems, Transaction properties, concurrent executions,

serializability, recoverability, implementation of isolation, Transaction support in sql, Testing for

serializability, problems of Concurrency Control – Locks, Optimistic Concurrency Control,

Timestamping Concurrency Control, transaction processing monitors, transactional workflows,

64

main memory data-bases, real-time transaction systems, transaction management in

multidatabases . [15%]

C) Database Recovery Techniques: failure classification, recovery concept, log-based recovery,

recovery with concurrent transaction, buffer management, other recovery techniques.

[10%]

D) Advance relational database design: Multi valued dependencies, join dependencies, 4NF, 5NF,

domain-key normal form. [10%]

E) Advance SQL: Integrity constraints, authorization, embedded sql, dynamic sql, recursive

queries, advance sql features. [10%]

F) Object-based databases and XML: introduction, complex data types, structured types and

inheritance in SQL, table inheritance, array and multi – set types in SQL, object –identity and

reference types in SQL, implementing O – R features, introduction to XML, Structure of XML

data, XML document schema, querying and transformation, application program interfaces to

XML, storage of XML data, XML application. [15%]

G) Object oriented databases: introduction, notion of abstract data type, object oriented systems,

object oriented db design. [5%]

H) Expert data bases: use of rules of deduction in data bases, recursive rules. [5%]

I) Fuzzy data bases: fuzzy set & fuzzy logic, use of fuzzy techniques to define inexact and

incomplete data bases. [5%]

J) Distributed Databases: Distributed versus Centralized Databases, Principles of Distributed

Databases, types of distributed database systems, query processing in distributed databases,

Levels Of Distribution Transparency, Reference Architecture for Distributed Databases, Types of

Data Fragmentation, Integrity Constraints in Distributed Databases, Distributed Database Design,

The Management of Distributed Transactions, Concurrency Control and recovery in Distributed

databases, an overview of client-server architecture and its relationship to distributed databases

,distributed databases in oracle. [15%]

K) Data warehousing and Data Mining: brief overview, data analysis and OLAP, Architecture,

Data flows, Tools & Technologies, Data Marts, Online Analytical Processing.

[5%]

L) Mobile & Multimedia databases: introduction and overview. [3%]

REFERENCE BOOKS:

1) Modern Database Systems: W. Kim, Addison Wesley Pub. Co., 1995

2) Introduction to Object Oriented Databases: W. Kim, MIT Press, 1992.

65

3) Principles of Database and Knowledge Base Systems, Vol I & II: J. D. Ullman, Computer

Science Press, 1988.

4) Foundation of Deductive Databases and Logic Programming: J. Minker (Editor)

5) Distributed Databases Principles & Systems, Stefano Ceri, Giuseppe Pelagatti, TMH

6) Principles of Distributed Database Systems, M. Tamer Ozsu, Patrick Valduriez, Pearson

Education, 2nd Edition

7) Distributed Database Systems, Chhanda Ray, Pearson.

E – 13: EMBEDDED SYSTEMS & VLSI DESIGN:

EMBEDDED SYSTEMS:

A) Introduction: Introduction And Examples Of Embedded Systems, Concept Of Embedded

System,application areas.

B) Design: Design challenge, Processor technology, IC technology, Design technology, Trade-offs

Custom Single Purpose Processor Hardware, General-Purpose Processor: Introduction, Basic

Architecture, Operation, Super-Scalar And Vlsiiw Architecture, Application Specific Instruction

Set Processors (Asips), Microcontrollers, Digital Signal Processors, Selecting A Microprocessor.

C) Interfacing Analog and digital blocks: Analog-to-Digital Converters (ADCs), Digital-to-

Analog, Converters (DACs), Communication basics and basic protocol concepts, Microprocessor

D) interfacing: I/O addressing, Port and Bus based, I/O, Memory mapped I/O, Standard I/O

interrupts, Direct memory access, Advanced communication principles parallel, serial and

wireless, Serial protocols I2C, Parallel protocols PCI bus, Wireless protocol IrDA, blue tooth.

E) Different peripheral devices: Buffers and latches, Crystal, Reset circuit, Chip select logic

circuit, timers and counters and watch dog timers, Universal asynchronous receiver, transmitter

(UART),Pulse width modulators, LCD controllers, Keypad controllers.

F) Software aspect of embedded systems: Challenges and issues in embedded software

development, Co-design Embedded software development environments: Real time operating

systems, Kernel architecture: Hardware, Task/process control subsystem, Device drivers, File

subsystem, system calls, Embedded operating systems, Task scheduling in embedded systems:

task scheduler, first in first out, shortest job first, round robin, priority based scheduling, Context

switch: Task synchronization: mutex, semaphore, Timers, Types of embedded operating systems,

Programming languages: assembly languages, high level languages

G) Development for embedded systems: Embedded system development process, Determine the

requirements, Design the system architecture, Choose the operating system, Choose the

processor, Choose the development platform, Choose the programming language, Coding issues,

66

Code optimization, Efficient input/output, Testing and debugging, Verify the software on the host

system, Verify the software on the embedded system

VLSI DESIGN:

A) Introduction To MOS Circuits: MOS Transistors, MOS Transistor Switches, CMOS Logic,

Circuit and System Representations, MOS Transistor Theory - Introduction MOS Device Design

Equations, The Complementary CMOS Inverter-DC Characteristics, Static Load MOS Inverters,

The Differential Inverter, The Transmission Gate, The Tri State Inverter, Bipolar Devices.

B) Circuit Characterization And Performance Estimation: Introduction, Resistance Estimation,

Capacitance Estimation, Inductance, Switching Characteristics CMOS-Gate Transistor Sizing,

Power Dissipation, Sizing Routing Conductors, Charge Sharing, Design Margining, and

Reliability.

C) CMOS Circuit And Logic Design: CMOS Logic Gate Design, Basic Physical Design of Simple

Gate, CMOS Logic Structures, Clocking Strategies, I/O Structures, Low Power Design.

D) Systems Design And Design Method: Design Strategies CMOS Chip Design Options,

DesignMethods, Design Capture Tools, Design Verification Tools, Design Economics, Data

Sheets, CMOS Testing - Manufacturing Test Principles, Design Strategies for Test, Chip Level

Test Techniques, System Level Test Techniques, Layout Design for Improved Testability.

E) CMOS Sub System Design: Data Path Operations-Addition/Subtraction, Parity Generators,

Comparators, Zero/One Detectors, Binary Counters, ALUs, Multiplication, Shifters, Memory

Elements, Control-FSM, Control Logic Implementation.

REFERENCE BOOKS:

1) Frankvahid/Tony Givargis, “ Embedded System Design- A unified Hardware/software

Introduction”.

2) David E Simon, " An embedded software primer ", Pearson education Asia, 2001.

3) Dreamteach Software team,” Programming for Embedded Systems”

4) J.W. Valvano, "Embedded Microcomputor System: Real Time Interfacing"

5) Jack Ganssle, "The Art of Designing Embedded Systems", Newnes, 1999.

6) N. Weste and K. Eshranghian, "Principles of CMOS VLSI Design", Addison Wesley, 1998.

7) Jacob Backer, Harry W. Li and David E. Boyce, " CMOS Circuit Design, Layout and Simulation

", Prentice Hall of India, 1998.

8) L.Glaser and D. Dobberpuhl, "The Design and Analysis of VLSI, Circuits”, Addison Wesley

1993.

9) C.Mead and L. Conway, "Introduction to VLSI Systems", Addison Wesley, 1979.

10) Randel & Geiger, “ VLSI Analog and Digital Circuit Design Techniques” McGraw-Hill,1990.

67

11) Sahib H.Gerez, “Algorithms for VLSI design automation ”,1998.

12) William M. Penny, Lillian Lau, “ MOS Integrated Circuits- Theory, Fabrication, Design and

System

13) Applications of MOS LSI”, Van Nostrand Reihold Company.

14) Sung Ms Kang, Yusuf Lablebici, “CMOS Digital Integrated Circuits Analysis & Design”, Tata

Mc-Graw Hill.

E – 14: IMAGE PROCESSING:

A) Introduction: Introduction to image processing; areas of application of image processing;

fundamental steps in image processing; elements of an image processing system; digital

representation of image; elements of visual perception; light and electromagnetic spectrum;

image sensing and acquisition; image sampling and quantisation (spatial and gray – level

resolution, aliasing and Moiré patterns; zooming and shrinking images); image pixels

(neighbours, adjacency, connectivity, regions, boundaries); De, D4, D8 distances; operations on

image in pixel basis (linear or non – linear operations). [10%]

B) Frequency Domain Enhancement: Introduction to frequency domain analysis and image

filtering; Fourier transforms (1 – D and inverse, 2 – D DFT and inverse, fast Fourier transforms);

DCT, Walsh, Hadamard transforms; smoothing (blurring), sharpening and homomorphic

filtering; low – pass and high – pass filters; Gausian, Laplacian filters. [15%]

C) Spatial Domain Enhancement: Introduction to spatial domain enhancement; basic gray – level

transformations; histogram modification (equalization, matching, local enhancement, others);

image enhancement using arithmetic / logic operations; concept of spatial filtering; smoothing,

sharpening in spatial domain. [10%]

D) Segmentation: Discontinuities (point, line, edge, boundary); Hough transform; application of

graph – theory; thresholding (concept of illumination, global / optimal global / adaptive

thresholding, other thresholding methods); edge detection; segmentation by point / region

dependent techniques and morphological watershed techniques. [10%]

E) Encoding, Compression: Image encoding: redundancies, fidelity criteria; source / channel

encoder / decoder; Transform compression; KL, Fourier, DCT, spatial compression, run length

coding, Huffman and contour coding; loss – less and lossy compression; compression standards.

[15%]

F) Image Restoration: Models for image degradation / restoration process; models of noise; noise

reduction in spatial / frequency domain filtering; inverse filtering; mean square error / least

squares filtering; geometric, recursive filtration. [15%]

68

G) Representation and Description: Chain code, polygonal approximations, signatures, boundary

segments, skeleton of a region; boundary descriptors; regional descriptors; principal component;

relational descriptors. [10%]

H) Morphology: Biological vs. mathematical morphology; morphological operations; translation,

reflection, complement, difference, dilation / erosion, opening / closing, hit – or – miss transform

and others; morphological algorithms (boundary extraction, region filling, extraction of connected

components, convex hull, thinning, thickening, skeletons, punning), dilation / erosion and

opening / closing of gray – scale image; applications of gray – scale morphology (smoothing,

gradient, top – hat transformation, textural segmentation, granulometry). [15%]

REFERENCE BOOKS:

1) Digital Image Processing: Rafael C. Gonzalez, Richard E. Woods, Pearson Education

2) Digital Image Processing: PIKS Scientific Inside: William K. Pratt, Wiley India

3) Digital Image Processing: Kenneth R. Castleman, Pearson

4) Fundamentals of Digital Image Processing: A Practical Approach with Examples in MATLAB:

Chris Solomon, Toby Breckon, Wiley – Blackwell

5) Digital Image Processing using MATLAB: Rafael C. Gonzalez, Richard E. Woods, Steven L.

Eddins, Tata McGraw – Hill

6) Fundamentals of Digital Image Processing: Anil K. Jain, PHI

7) Digital Image Processing: S. Sridhar, Oxford University Press

8) Principles of Digital Image Processing: Fundamental Techniques: Wilhelm Burger, Mark J.

Burge, Springer

9) Feature Extraction & Image Processing for Computer Vision: Mark Nixon, Alberto S. Aguado,

Academic Press

10) Digital Image Processing: S. Jayaraman, S. Esakkirajan, T. Veerakumar, Tata McGraw – Hill

Education

E – 15: OBJECT ORIENTED ANALYSIS AND DESIGN:

A) Introduction: Inherent complexities of software; structure of complex systems; introduction to

object oriented analysis and development; OOA, OOD and OOP; classical methods vs. OO

methods; history / evolution of object model; benefits and risks of OOAD; software engineering

metrics for OOAD. [15%]

B) Object Oriented Analysis: Introduction to analysis phase of software development; the analysis

cycle; requirement of modelling during analysis; OO methodologies; structural / behavioural /

69

functional / scenario based / dynamic modelling; creating initial object model; iterative analysis;

unified process; use cases. [20%]

C) Object Oriented Design: Design constraints; implementation constraints; OO modelling in

solution domain; software architecture: architectural patterns and design patterns; class diagram;

state transition diagram; design level concurrency and design heuristics. [15%]

D) UML: Role of UML in OOAD; goals of UML; history of UML; UML tools; current standards;

criticism of UML; UML diagrams: structure and behaviour diagrams; use case diagram: actors,

use cases, use case relationships; objects and classes; relationships, associations, aggregations,

multiplicities, attributes and access specifiers; inheritance, realization; object interaction:

synchronous and asynchronous messages; sequence diagram, collaboration diagram,

communication diagram, timing diagram, interaction overview diagram, state transition diagram,

building iterations, action and activity, activity diagram, forks and joins, swim lanes, physical

diagrams, component diagram, profile diagram, composite structure diagram, deployment

diagram, package diagram; meta modelling architecture and MOF. [50%]

REFERENCE BOOKS:

1) Object Oriented Analysis and Design with Applications, 3rd Edition: Grady Booch, Robert A.

Maksimchuk, Michael W. Engle, Bobbi J. Young, Jim Conallen, Kelli A. Houston, Pearson

Education

2) Object Oriented Modelling and Design with UML: Michael R. Blaha, James R. Rumbaugh,

Dorling Kindersley (Pearson)

3) The Unified Modelling Language User Guide: Grady Booch, James Rumbaugh, Ivar Jacobson,

Pearson

4) Object – Oriented Systems Analysis and Design using UML: Simon Bennet, Steve McRobb, Ray

Farmer, McGraw Hill Higher Education

5) Object – Oriented Analysis and Design: John Deacon, Pearson

6) UML Distilled : A Brief Guide to the Standard Object Modeling Language: Cris Kobryn, Grady

Booch, Ivar Jacobson, Jim Rumbaugh, Doling Kindersley

7) Object – Oriented Metrics in Practice: Radu Marinescu, Michele Lanza, Springer

8) Object – Oriented Analysis & Design: Mike O’Docherty, Wiley India

9) Object – Oriented Analysis & Design: Andrew Haigh, Tata McGraw – Hill Education

10) Object – Oriented Software Engineering: Using UML, Patterns, and Java: Bernd Bruegge, Allen

H. Dutoit, Pearson

11) Practical Object – Oriented Design with UML: Mark Priestley, Tata McGraw - Hill

70

Note: Syllabus of offered papers CSO – 01 to CSO – 04 will be given only after consultation with

corresponding PG departments. It is not yet finalized as on 25 / 03 / 2014.