SCHEME OF EXAMINATION

&

DETAILED SYLLABUS
(w. e. f. Academic Year 2010-2011)

For

MASTER OF COMPUTER APPLICATIONS
(MCA) DEGREE

GURU GOBIND SINGH
INDRAPRASTHA UNIVERSITY
KASHMERE GATE, DELHI

Syllabus of Master of Computer Applications (MCA), approved by MCA Coordination Committee on 7th May 2010 & Sub-Committee Academic Council held on 31st May 2010. W.e.f. academic session 2010-11

Master of Computer Applications
FIRST SEMESTER EXAMINATION
Paper ID 044101 044103 044105 044107 044109 044151 044153 044155 044161 Paper Code MCA 101 MCA 103 MCA 105 MCA 107 MCA 109 MCA 151 MCA 153 MCA 155 MCA 161 Paper Fundamentals of IT Programming in C Discrete Mathematics Computer Organization Principles and Practices of Management Practical Fundamentals of IT Lab. Programming in C Lab Computer Organization Lab. NUES General Proficiency – I* (It is suggested to have Personality Development and Communication Skills - I Course) Total L 3 3 3 3 3 0 0 0 0 T/P 1 1 1 1 1 2 4 4 2 Credit 4 4 4 4 4 1 2 2 1

15

17

26

* Non-University Examination System (NUES)

Syllabus of Master of Computer Applications (MCA), approved by MCA Coordination Committee on 7th May 2010 & Sub-Committee Academic Council held on 31st May 2010. W.e.f. academic session 2010-11

Master of Computer Applications
SECOND SEMESTER EXAMINATION
Paper ID 044102 044104 044106 044108 044110 044152 044154 044156 044158 044162 Paper Code MCA 102 MCA 104 MCA 106 MCA 108 MCA 110 MCA 152 MCA 154 MCA 156 MCA 158 MCA 162 Paper Data and File Structures Object Oriented Programming in C++ Operating Systems Database Management Systems Software Engineering Practical Data and File Structures Lab Object Oriented Programming in C++ Lab Database Management Systems Lab Software Engineering Lab. NUES General Proficiency – II* (It is suggested to have Personality Development and Communication Skills – II Course) Total L 3 3 3 3 3 0 0 0 0 0 T/P 1 1 1 1 1 2 4 2 2 2 Credit 4 4 4 4 4 1 2 1 1 1

15

17

26

* Non-University Examination System (NUES)

Syllabus of Master of Computer Applications (MCA), approved by MCA Coordination Committee on 7th May 2010 & Sub-Committee Academic Council held on 31st May 2010. W.e.f. academic session 2010-11

approved by MCA Coordination Committee on 7th May 2010 & Sub-Committee Academic Council held on 31st May 2010.e. W. NUES General Proficiency – III* (It is suggested to have Technical Paper Writing Course) Total L 3 3 3 3 3 0 0 0 0 T/P 1 1 1 1 1 2 4 4 2 Credit 4 4 4 4 4 1 2 2 1 15 17 26 * Non-University Examination System (NUES) Syllabus of Master of Computer Applications (MCA). academic session 2010-11 .Master of Computer Applications THIRD SEMESTER EXAMINATION Paper ID 044201 044203 044205 044207 044209 044251 044253 044255 044261 Paper Code MCA 201 MCA 203 MCA 205 MCA 207 MCA 209 MCA 251 MCA 253 MCA 255 MCA 261 Paper Theory of Computation Computer Graphics Java Programming Data Communications and Networking C# Programming Practical Computer Graphics Lab Java Programming Lab C# Programming Lab.f.

f. academic session 2010-11 .e.Master of Computer Applications FOURTH SEMESTER EXAMINATION Paper ID 044202 044204 044206 044208 044210 044252 044254 044256 044258 044260 044262 Paper Code MCA 202 MCA 204 MCA 206 MCA 208 MCA 210 MCA 252 MCA 254 MCA 256 MCA 258 MCA 260 MCA 262 Paper Design and Analysis of Algorithms Data Warehousing and Data Mining Advanced Computer Networks Object Oriented Analysis and Design Web Technologies Practical Design and Analysis of Algorithms Lab Data Warehousing and Data Mining Lab Advanced Computer Networks Lab Object Oriented Analysis and Design Lab Web Technologies Lab NUES General Proficiency – IV* (It is suggested to have Process Modeling Management Oriented Course) Total L 3 3 3 3 3 0 0 0 0 0 0 T/P 1 1 1 1 1 2 2 2 2 2 2 Credit 4 4 4 4 4 1 1 1 1 1 1 15 17 26 * Non-University Examination System (NUES) Syllabus of Master of Computer Applications (MCA). approved by MCA Coordination Committee on 7th May 2010 & Sub-Committee Academic Council held on 31st May 2010. W.

approved by MCA Coordination Committee on 7th May 2010 & Sub-Committee Academic Council held on 31st May 2010.e. academic session 2010-11 . W.f.I NUES 044361 MCA 361 General Proficiency – V* (It is suggested to have Intellectual Property Rights .II (Choose any One) 044323 MCA 323 Operational Research 044325 MCA 325 Distributed Systems 044327 MCA 327 Financial Accounting 044329 MCA 329 Organizational Behavior 044331 MCA 331 Advanced Computer Architecture 044333 MCA 333 Software Quality Management 044335 MCA 335 Digital Signal Processing 044337 MCA 337 Research Project Practical 044351 MCA 351 Linux Programming Lab 044353 MCA 353 Software Testing Lab 044355 MCA 355 Enterprise Computing with Java Lab 044357 MCA 357 Lab based on Elective .Master of Computer Applications FIFTH SEMESTER EXAMINATION Paper Paper Code 044301 MCA 301 Linux Programming 044303 MCA 303 Software Testing 044305 MCA 305 Enterprise Computing with Java Elective .I (Choose any One) 044307 MCA 307 Advanced Database Management Systems 044309 MCA 309 Numerical and Scientific Computing 044311 MCA 311 Software Project Management 044313 MCA 313 Multimedia Technologies 044315 MCA 315 Mobile Computing 044317 MCA 317 Artificial Intelligence 044319 MCA 319 Microprocessors 044321 MCA 321 Compiler Design Elective .Software Systems Oriented Course) Total Paper ID L 3 3 3 3 T/P 1 1 1 1 Credit 4 4 4 4 3 1 4 0 0 0 0 0 2 2 4 2 2 1 1 2 1 1 15 17 26 * Non-University Examination System (NUES) Syllabus of Master of Computer Applications (MCA).

The total number of the credits of the MCA programme = 160. 2.e.Master of Computer Applications SIXTH SEMESTER EXAMINATION Paper ID 044302 044362 Paper Code MCA 302 MCA 362 Paper Dissertation NUES General Proficiency – VI* (Seminar and Progress Report) Total L T/P Credit 26 4 30 * Non-University Examination System (NUES) The student will submit a synopsis at the beginning of the semester for approval from the departmental committee in a specified format. W. for the award of the degree a student shall be required to earn the minimum of 150 credits Syllabus of Master of Computer Applications (MCA). Note: 1. However. The student will have to present the progress of the work through seminars and progress reports. Each student shall be required to appear for examinations in all courses. approved by MCA Coordination Committee on 7th May 2010 & Sub-Committee Academic Council held on 31st May 2010. academic session 2010-11 .f.

: MCA 101 Paper: Fundamentals of Information Technology LTC 3 1 4 INSTRUCTIONS TO PAPER SETTERS: 1. Raster Scan Display. There should be 10 questions of short answer type of 2 marks each. linkers.e. 1. if any. Design (algorithm. Network Types (LAN. student may be asked to attempt only 1 question from each unit. of Hrs: 10] UNIT – IV Basic elements of a Communication System. Introduction to Database Management System and its types. signed binary number. data. Liquid Crystal Display. • Define "Software Engineering". of Hrs: 12] UNIT . Light Pen.f. Microprocessors: Introduction. Every unit should have two questions to evaluate analytical/technical skills of candidate. Coding. of Hrs: 10] UNIT – II Introduction to software: Software types and Software Development activities (Requirement. flowchart. interpreters. • Demonstrate an understanding of the importance of algorithms in the development of IT applications. • Describe the different components of a computer network.III Introduction to Operating system. • Demonstrate an understanding of different types of networks. DOS commands. Number systems: Binary. octal and hexadecimal number systems. Data transmission media. [No. External Storage devices. File Structure and Storage. Topics include basics of graphics. decision table and tree). Network topologies. Maintenance). Upon completion of this course the student should be able to: • Describe the major components of information technology applications: • Hardware. Apart from Question No. [No. scheduling and synchronization. assemblers. data and an overview of the use of information technology in organizations. binary arithmetic. academic session 2010-11 . • Discuss the role of databases in IT applications. [No. 1 should be compulsory and cover the entire syllabus. Joystick. Plotters. computer networks. threads. Different types of operating systems and its working. compilers. Inter networking tools. processes. Low and high level languages. database design and networking. 2. Architecture and operation of 8085 microprocessor and instruction set. OBJECTIVE: This course is an introductory course in information technology. W. software. Installation. System Bus. Mouse. Plasma Display. of Hrs: 10] Syllabus of Master of Computer Applications (MCA). [No. 2’s complement arithmetic. WAN and MAN). Introduction to Graphics primitives: Display Devices: Refresh Cathode Ray Tube. Introduction to Communication protocols. Each question should be 10 marks including subparts. Tablet and Digitizing Camera. systems development. PRE-REQUISITE: • None UNIT – I Digital Signals and Logic gates. Testing.Code No. software. rest of the paper shall consist of four units as per the syllabus. approved by MCA Coordination Committee on 7th May 2010 & Sub-Committee Academic Council held on 31st May 2010. Keyboard. Trackball. Topics include foundations in hardware. and people. However. Question No. Introduction to process management: process. Digital and Analog Transmission. Printers. having at least 2 questions from each unit.

Leon Techworld. 5. Norton Peter. 4. “Fundamentals of Computers”. “Introduction to computers”. 6. “Communication System”. “Computer Fundamentals”. Alex Leon and Mathews Leon. "Microprocessor Architecture Programming and Application with 8085”. 2006. 4. 2007. “Introduction to Computers”.e.. Basaraj. Gaonkar. 3rd Ed. 2007. Alex Leon and Mathews Leon. 2006. 2006. “Digital Principles and Application”. W. Syllabus of Master of Computer Applications (MCA). 3. 4th Ed. 1999. REFERENCES: 1. John Wiley & Sons.TEXT BOOKS: 1. PHI. K. “Digital Fundamentals”. 2008. David Anfinson and Ken Quamme. Vikas Publications. Simon Haykins. BPB Publications. academic session 2010-11 . V. Rajaraman. 7. Sinha and Priti Sinha .. Vikas Publishing House. 2. 2006. TMH. Ramesh S. P. “IT Essentials PC Hardware and Software Component on Guide”. “Introduction to Information Technology”. 2. 2001. “Fundamentals of Information Technology”. PHI. 1999. TMH.f. B.. Rajaraman. PHI. 3. Malvino and Leach. Pearson. 2007. 5th Ed. approved by MCA Coordination Committee on 7th May 2010 & Sub-Committee Academic Council held on 31st May 2010. V.

: 12 Hrs] UNIT -III The C Preprocessor: (#define. 1. passing parameters. Question No.: MCA 103 Paper: Programming in C L T C 3 1 4 INSTRUCTIONS TO PAPER SETTERS: 1. Variables. student may be asked to attempt only 1 question from each unit. Command line input. W. Other Preprocessor Commands) C. The switch statement) Looping and Iteration (The for statement. void pointers. returning values. far and huge pointers Dynamic Memory Allocation and Dynamic Structures: (malloc. Characteristics of C.e. const pointers. Conditionals (The if statement .I Introduction: GCC. Pointer to array. Logical Operators. Array of pointers. Constants.Conditional inclusion.Code No. near.dimensional arrays) Advanced Pointer Topics: (Pointers to Pointers. Arithmetic Operations. Unions. free. rest of the paper shall consist of four units as per the syllabus. The do-while statement. The while statement. Defining Global Variables. C Program Structure. #if -. if any. Enumerated Types. 1 should be compulsory and cover the entire syllabus. break and continue) Arrays and Strings (Single and Multi-dimensional Arrays.f. Type-Casting. of Hrs. sizeof. recursion) Storage classes (auto. • Passing by value and pass by reference • Difference between array names and pointers • Allocating memory over the heap to two dimesional array ( Matrices application could be taken as a case study) • Pointer and pointer operations( Linked lists . Apart from Question No. approved by MCA Coordination Committee on 7th May 2010 & Sub-Committee Academic Council held on 31st May 2010. register) [No. PRE-REQUISTE: • Basic Programming UNIT. extern. having at least 2 questions from each unit. Every unit should have two questions to evaluate analytical/technical skills of candidate. Bit Fields) Pointers: Pointers arithmetic and Arrays. introduction to Linked Lists and dynamic 2. #undef. Low Level Operators and Bit Fields (Bitwise Operators. of Hrs. However. OBJECTIVES : After covering the core C in about 25 lectures the course shall aim to aquaint the students about advanced features of the language the following features are listed as suggested guideline for the teacher. Comparison Operators. Structures. GDB. Strings) Functions (Function Prototyping. Pointers to a Function. doubly linked lists circular linked lists can be taken as a case study • Pointers to functions and call back functions • Bitwise operations and a case based upon these operations • MACROs and their pitfalls • Final case study could be an application making extensive handling of binary files. 2. Printing Out and Inputting Variables. Linux and Standard Libraries: (Advantages of using Linux with C. Using MAKE Utility. Each question should be 10 marks including subparts. Using Syllabus of Master of Computer Applications (MCA). calloc and realloc. #include. Implementing Callbacks) [No. C Basics: History of C. Order of Precedence. : 10 Hrs] UNIT-II Further Data Types: Defining New Data Types. academic session 2010-11 . static. The ? operator. There should be 10 questions of short answer type of 2 marks each.

Forouzan and Richard F. Paul Deitel and Harvey Dietel.h> (Basic String Handling Functions and safety issues. 3rd Ed. 2002. Pearson. Hanly and Elliot B. errno. Input and Output (I/O):stdio. and Alex Samuel. PHI. Deletion and Renaming. Behrouz A. 2007. Searching and Sorting: <stdlib. Syllabus of Master of Computer Applications (MCA). chmod. 6th Ed. 2010. PHI. stat. Math Constants). Reddy and Carol A. 5th Ed. PHI. Character conversions and testing: ctype. fork(). Rama N. String Conversion. File Positioning.. Mark Mitchell. Files Character and Line Based I/O. exit() ) Streams (Predefined Streams. Ritchie. Ziegler. Thread creation-a simple implementation. Temporary Files [No. 2007. BPB Publications. Process Control: (Running Linux Commands from C. 3. 2. Random Number. of Hrs. Kernighan and D.. “The ANSI C Programming Language”. Yashwant Kanetkar.f. BPB Publications. Gilberg. 3. 5. 2002.e. exit() ). [No. “Problem Solving and Programming in C”. wait(). scanf ). approved by MCA Coordination Committee on 7th May 2010 & Sub-Committee Academic Council held on 31st May 2010. Block I/O. 2000 REFERENECES: 1. Status Functions. academic session 2010-11 . 2. “Computer Science A Structured Programming Approach Using C”. printf.h Reporting Errors (perror(). Jones and Bartlet. chown …. “Let us C”. chdir. 2010.Linux System Calls and Library Functions) Integer Functions..h. “Pointers in C”. Jeffrey Oldham. Redirection) Basic I/O (Formatted I/O. “Advanced Linux Programming”. String Searching). chroot…). of Hrs: 09 Hrs] TEXT BOOKS: 1. 2001. Formatted I/O. the exec family. “C Programming for Scientist and Engineers with Applications”. B. Jeri R. New Riders Publishing. String Handling: <string. Yashwant Kanetkar. 4. “How to Program”.h> Mathematics: <math. : 11 Hrs] UNIT -IV File Accessibility and Directories (access.h> (Math Functions. W. Koffman.

primes.e. pigeonhole principle. structures with binary operations) sub algebra. inverse and its uniqueness. Quantifiers. binary and unary operations on a set. Algorithm analysis and Cryptography. binominal theorem. Groups.. Proof by exhaustive cases and proof by contradiction. of Hrs: 12] UNIT – II Lattices: sub lattices. Normal forms. [No. Every unit should have two questions to evaluate analytical/technical skills of candidate. direct product. RSA Cryptosystem. properties. 1 should be compulsory and cover the entire syllabus. 1. properties of function. student may be asked to attempt only 1 question from each unit. Euler’s formula (proof). However. in order. of Hrs: 12] UNIT – IV Graph Terminology. Primality and Factoring. Question No. [No. of Hrs: 08] UNIT – III GCD. OBJECTIVES: This course covered the mathematical topics most directly related to computer science. Symbolic Representation and Tautologies. principle of mathematical induction. principle of inclusion and exclusion Relation. Principle of Well Ordering Recursive definitions. Sets. direct product and homomorphism. properties of binary relation. principle of complete induction. [No. if any. approved by MCA Coordination Committee on 7th May 2010 & Sub-Committee Academic Council held on 31st May 2010. composition of function. LCM. closures. Apart from Question No. Computer representation of graphs. Congruence. academic session 2010-11 . isomorphism and homomorphism. Group identity and uniqueness. Edge Coloring. Boolean function. pascal’s triangles.Code No. Learning Outcome of this course is to prepare students to take courses related with Data Structure. partial ordering. There should be 10 questions of short answer type of 2 marks each. [No. Cut-Vertices. power set. solution methods for linear. Isomorphism. Normal subgroup and quotient groups. Fundamental Theorem of Arithmetic. Predicates and validity. Cosets and Lagrange’s theorem. 2. Proof by Contraposition. Direct Proof. W. Simple Cryptosystems. Fermat’s Little Theorem. of Hrs: 10] Syllabus of Master of Computer Applications (MCA). Planar graphs. isomorphic structures (in particulars. inverse. four color problem and the chromatic number of a graph. Eu ler graphs. definition of Boolean algebra. Trees terminology. having at least 2 questions from each unit. permutation and combination. preorder & post order trees traversal algorithms. directed graphs. representation & minimization of Boolean function. Error Correcting codes and groups. Predicate Logic. Vertex Coloring. five color theorem. composition of cycles. rest of the paper shall consist of four units as per the syllabus. Isomorphism as relations. subgroups. set operations/set identities. fundamental counting principles. This course develops ability to write independent mathematical Proofs. Permutation group and Cayley ’s theorem (without proof). Permutation function. Subsets. first-order recurrence relations with constant coefficients. Euler Phi function. MCA 105 Paper: Discrete Mathematics L T C 3 1 4 INSTRUCTIONS TO PAPER SETTERS: 1. equivalence relation. Boolean expression. Propositional Logic. Hamiltonian graphs. PRE-REQUISITE: • Basic Mathematics UNIT – I Formal Logic: Statement.f. Each question should be 10 marks including subparts.

“Graph Theory”. Thomson Learning. “A course in number theory and cryptography ”. Narosa.. Hunter “Essentials of Discrete Mathematics” Johns and Bertlett. Syllabus of Master of Computer Applications (MCA).TEXT BOOKS: 1. “Discrete Mathematics for Computer Science”. Narsingh Deo. 7. CUP. Malik and M. D. Kolman. 2nd Ed. 5. 6. David J. 2nd Ed. 2009. W. New Delhi.. S. P. Sengadir. 5. “Elements of Discrete Mathematics”... Swapan Kumar Sarkar. 8. BPB Publications. Neal Koblitz. Kenneth Bogart Clifford and Stein Robert Drysdale.e. 4th Ed. C. Jones and Bartlett. Liu. 2006. academic session 2010-11 . 2006. S. “Essentials of Discrete Mathematics”. David J. T. “Discrete Mathematics with Combinatorics and Graph Theory”. J. 6th Ed. 7.. J. McGraw Hill Book Company. 2nd Ed. S. PHI. Rosen. Sen. 4. 6th Ed. 6. 2003. Hein. Pearson. “Discrete Mathematical Structure with Application to Computer Science”. 1985. 3rd Ed.. approved by MCA Coordination Committee on 7th May 2010 & Sub-Committee Academic Council held on 31st May 2010. Santha. “Discrete Mathematical Structures”. G. “Discrete Mathematics”. 10. Whitesides. 2009. REFERENCES: 1. J. 2010.. “A Computational Introduction to Number Theory and Algebra”. “Discrete Structures. 2. 4. 3. Kenneth H. Busby and Ross “Discrete Mathematical Structures” PHI/Pearson. Cengage Publication. 2009. Manohar. V. 1998. Schlipf and S. Shoup. Tremblay and R. 24th Indian Print. L. 2007. 2006. Vinay Kumar. 9. 2008. “Discrete Mathematics for computer science" Springer. Haggard. “Discrete Mathematics & Applications”. 2004. 3. Hunter. 2008. “Discrete Mathematics and Combinationatorics”. Cengage Learning. 2000. 2009. L. “Discrete Mathematics”. 2006. TMH. 2. Springer – Verlag. TMH. Chand. Logic and Computabili ty”. K..f.

“Computer System and Architecture”. PRE-REQUISITE: • Basics of Digital Electronics • Internal Components of the CPU UNIT – I Introduction and overview: Multiplexes. computer registers. virtual memory. [No. Mano M. Master Slave and Edge triggered. There should be 10 questions of short answer type of 2 marks each. 1. [No. arithmetic microoperations. address sequencing. Each question should be 10 marks including subparts. main memory. 1 should be compulsory and cover the entire syllabus. Demultiplexers. shift registers. 2. of Hrs: 11] UNIT – III Pipeline and Vector processing: Parallel Processing. Input-Output Organization: Peripheral devices. general register organization. timing & control. [No. D. Syllabus of Master of Computer Applications (MCA). “Computer Organization & Architecture”. Register Transfer and Microoperation: Register transfer language. rest of the paper shall consist of four units as per the syllabus. T.: MCA 107 Paper: Computer Organization L T C 3 1 4 INSTRUCTIONS TO PAPER SETTERS: 1. cache memory. of Hrs: 12] UNIT – II Basic Computer Organization and Design: Instruction codes. Central Processing Unit: Introduction. input-output and interrupts. REFERENCES: 1. Interprocessor Communication & Synchronization. stack organization. JK. modes of data transfer. RISC Pipeline. Microprogrammed Control Unit: Control memory.e. of Hrs: 10] UNIT – IV Memory organization: Memory hierarchy. 8th Ed. arithmetic pipeline. Decoders. asynchronous data transfer. Apart from Question No. Array Processors. auxiliary memory. Adders. Multiprocessors: Characteristics of multiprocessor. bus and memory transfer. Vector Processing. instruction formats. logic microoperations. Every unit should have two questions to evaluate analytical/technical skills of candidate. student may be asked to attempt only 1 question from each unit.f. instruction cycle. OBJECTIVE: The main objective of the syllabus is to make students understand the relevance Computer Organization in the software oriented course. Question No.. academic session 2010-11 . addressing modes. W. Bi-direction shift registers. if any. Interconnection Structure. input-output interface. McGraw Hill. input-output processor. It aims at introducing basic digital concepts and then use them to explain details of computer organization. PHI. 1993. priority interrupt. memory management hardware. computer instructions. Stallings W. design of basic computer. design of accumulator logic. Malvino. having at least 2 questions from each unit. Pearson. register transfer. 3rd Ed. “Digital Computer Electronics: An Introduction to Microcomputers”. Registers. 2009 2. approved by MCA Coordination Committee on 7th May 2010 & Sub-Committee Academic Council held on 31st May 2010. [No. shift microoperations. Flip-flops : S-R. of Hrs: 09] TEXT BOOKS: 1. memory reference instructions. pipelining. associative memory.. 2010.Code No. However. direct memory access.

S Rao. 5th Ed. “Computer System Architecture”. 1998. 2006. academic session 2010-11 .f. V. “Computer Architecture and Organization”. approved by MCA Coordination Committee on 7th May 2010 & Sub-Committee Academic Council held on 31st May 2010. 5th Ed. McGraw Hill.. “Assembly Language and Computer Architecture using C++ and Java”. P. Hayes.. Cengage Learning. Dos Reis. W. 4. Syllabus of Master of Computer Applications (MCA). Anthony J. P. Andrew S. 5.e. 2004. J.2. PHI. Tanenbaum. 2009. “Structured Computer Organization”. 3. PHI.

having at least 2 questions from each unit. Management: Art and Science.: 10] UNIT – IV Leadership: The Core of Leadership: Influence. Evolution of Management: Early contributions. Bureaucracy. student may be asked to attempt only 1 question from each unit. Combining Jobs: Departmentation. Developing a Quality Control System. Management Skills. Theories Of Motivation. Authority & Responsibility. of Hrs.: 11] Syllabus of Master of Computer Applications (MCA). An Integrated Control System. Motivation and Performance. Objectives and Significance of Planning. [No. Span of Control. Communication Channels. New Trends in Organisational Change. Importance of Communication. [No. W. Types of Planning. Alternative Change Techniques. There should be 10 questions of short answer type of 2 marks each.e. Planning Premises and Forecasting. Process of Planning. OBJECTIVE: The purpose of this course is to expose the student to the basic concepts of management in order to aid the student in understanding how an organization functions. Each question should be 10 marks including subparts. Morale Building. Fayol’s Administrative Management. Organization Theories. Organizing: Concept.: 10] UNIT – III Staffing: Concept. Pre-control of Inputs. Social System Approach. Forms of Organizational Structure. Apart from Question No. Characteristics of Quality Managers. of Hrs. of Hrs. Total Quality Control. Performance Appraisal. Motivation: Concept. approved by MCA Coordination Committee on 7th May 2010 & Sub-Committee Academic Council held on 31st May 2010. Methods: Pre-control: Concurrent Control: Post-control. Every unit should have two questions to evaluate analytical/technical skills of candidate. Decision Theory Approach. Pay and Job Performance. Functions of Leaders.f. Scope. Shift to Ethics. Manpower Planning. Hawthorne Experiments and Human Relations. Planning: Nature. Tools of Ethics [No. Concurrent Control of Operations. Leadership Style. Post Control of Outputs. Training & Development. Recruitment & Selection. Taylor and Scientific Management. Forces for Change. Decision Making. Importance.Code No. Barriers to Communication. Barriers to Effective Planning. Business Ethics and Social Responsibility: Concept. rest of the paper shall consist of four units as per the syllabus. Job Design. Leadership Development. Change and Development: Model for Managing Change. Need for Change. 2. of Hrs : 11] UNIT – II Introduction to Functions of Management. Types of Control. Controlling: Concept. Management Vs. 1 should be compulsory and cover the entire syllabus. Delegation of Authority.Communication: Communication Process. Administration. Quality of Work Life. Approaches for Improving Motivation. The Quality Concept Factors affecting Quality. academic session 2010-11 . Nature. System Approach. Key to Planning. Levels of Management. [No. Organizational Design. 1. Management As a Profession. Directing: Concept. Direction and Supervision. if any.: MCA 109 Paper: Principles and Practices of Management L T C 3 1 4 INSTRUCTIONS TO PAPER SETTERS: 1. PRE-REQUISITE: • None UNIT – I Management: Concept. Question No. However. and in understanding the complexity and wide variety of issues managers face in today’s business firms.

. Satya Raju and A. Stoner.Fundamentals of Management: Essential Concepts and Applications”. academic session 2010-11 . Mc Graw Hill. 12th Ed.. “Management”. PHI. Freeman and Gilbert Jr. .Introduction to Management Science: A Modeling and Case Studies Approach with Spreadsheets.e. 5th Ed. Tata Mc Graw Hill.. 2. 2008. P. Parthasarathy. Syllabus of Master of Computer Applications (MCA). R. and Hillier Mark S. Robbins S. PHI. W. 2008. “Management: A Global and Entrepreneurial Perspective”. 2008. 1st Ed.TEXT BOOKS: 1. Pearson Education. Tata Mc Graw Hill. 3. “A. Robbins and Coulter. 8th Ed. REFERNCES: 1. 4. “Management”. 2nd Ed.. approved by MCA Coordination Committee on 7th May 2010 & Sub-Committee Academic Council held on 31st May 2010. 6th Ed.f. “Management Text and Classes”. “Principles of Management”. Koontz . 3. and Decenzo David. PHI. 2. 2009.. . Hillier Frederick S. 2nd Ed. Weihrich Heinz and Koontz Harold.

approved by MCA Coordination Committee on 7th May 2010 & Sub-Committee Academic Council held on 31st May 2010. academic session 2010-11 . Computer Organization Lab MCA 111 MCA 113 MCA 115 Syllabus of Master of Computer Applications (MCA). Problem Solving Using C Lab 3. W.There will be following Practical: 1.e. Fundamentals of IT Lab 2.f.

academic session 2010-11 . The performance of the candidates should continuously be evaluated by an internal committee. This paper is under Non University Examination system its detail content will be decided by the respective Institute.Code No. W.f. *Non University Examination Scheme (NUES) There will not be any external examination of the university. : MCA 161 Paper: General Proficiency – I* It is suggested to have a fundamental course on Personality Development and Communication Skills – I in this semester. under approval of the coordination committee based on the requirement of individual institution. Syllabus of Master of Computer Applications (MCA). The committee may conduct vivavoce at the end for the award of the marks.e. approved by MCA Coordination Committee on 7th May 2010 & Sub-Committee Academic Council held on 31st May 2010.

deques. Quick sort. Topological sort. linked lists: singly and doubly linked lists. approved by MCA Coordination Committee on 7th May 2010 & Sub-Committee Academic Council held on 31st May 2010. Horowitz and S. Hash function. Time and space complexity of algorithms. Floyd Warshall’s Algorithm. Traversals. Each question should be 10 marks including subparts. Syllabus of Master of Computer Applications (MCA). Search tree. Universities Press. [No. OBJECTIVE: In this course student will become familiar with Algorithm analysis: Trees. postfix and prefix arithmetic expression conversion and evaluations.: MCA 102 Paper: Data and File Structures L T C 3 1 4 INSTRUCTIONS TO PAPER SETTERS: 1. of Hrs: 10] UNIT – III Graphs: Representation (Matrix and Linked). Threaded binary tree. 2008. PRE-REQUISITES: • C Programming • Basic Concepts in Data Structure • Prelims of Trees and Graphs Functionality of Group Theory UNIT – I Fundamentals of algorithm analysis Big ‘O’ notations. Merge sort. creating updating retrieving from sequential files advantages and disadvantages of sequential file organization. academic session 2010-11 . 1. Dijkstra’s Algorithm. Every unit should have two questions to evaluate analytical/technical skills of candidate. 2nd Edition. Activity network. Data representation and denisity. E. properties. queues. Selection sort. stacks. of Hrs: 16] UNIT – IV Files: Sequential file organization. 2nd Edition AddisonWesley. Tree Traversals (recursive and stack based non-recursive). rest of the paper shall consist of four units as per the syllabus. Path enumeration. Shortest path and Transitive closure. B+ tree.f. uses. Heaps and priority queues. 1997. handling sequential files in C language. Spanning Tree. creation. student may be asked to attempt only 1 question from each unit. parity and error control techniques. AVL Trees BTree: need. Heap sort. However. having at least 2 questions from each unit. 2. “Data Structures and Algorithm Analysis in C”. infix. if any. Internal sort: Radixsort. Apart from Question No. positioning. multistacks and multiqueues. [No. “Fundamentals of Data Structures in C”. seeking. devices and channels. External Sorting and merging files k way and polyphase merge [No. of Hrs: 08] TEXT BOOKS: 1. B* tree. Connected components. 2. searching and sorting and files. Sahani. Hash table. Question No. double stack. reading and writing binary files in C. Insertion sort. There should be 10 questions of short answer type of 2 marks each. 1 should be compulsory and cover the entire syllabus. Prim’s Algorithm) Searching & Sorting: Binary search. [No. polynomial arithmetic.Code No.e. of Hrs: 08] UNIT – II Trees: Binary trees: Definition. double buffering and block buffering. Critical path. Mark Allen Weiss. Coloring of Graphs. Shell sort. Spanning trees. Binary Search Tree basic operations. W. Graphs. Minimum Spanning Tree Algorithms (Kruskal’s Algorithm.

academic session 2010-11 . TMH. W. “Data Structures using C and C++”. 2nd Ed.f. “Data Structures”.e. Gilberg and Behrouz A. “Data Structure A Pseudocode Approach with C”. 3. Dale and S. 2.C. “Data Management and File Structure”. “Data Structure”. Cengage Learning. Richard F. 5... 2005. Special Indian Ed. approved by MCA Coordination Committee on 7th May 2010 & Sub-Committee Academic Council held on 31st May 2010. (P) Ltd. Syllabus of Master of Computer Applications (MCA). Forouzan. 1999. PHI. N.REFERENCES: 1. Y. Book Publishing Co. PHI. S.. Mary E. Lilly. Salaria. “Data Structure & Algorithms”. R. 1989... D. 2002. Seventeenth Reprint. 2nd Ed. al. 1995. 4. Schaum’s Outline Series. 2009. Khanna..C. S. Loomes. Langsam et. Heath and Co. 6.

delete operators. instantiation of objects. approved by MCA Coordination Committee on 7th May 2010 & Sub-Committee Academic Council held on 31st May 2010. Overloading Output/Input. Default Parameter Value. Characteristics of Object-Oriented Programming Languages. public and protected. W. Object & Class. Implementation of operator overloading of Arithmetic Operators. • • • • • • • • Copy construtor. Inheritance. Using Static Class members.streams classes PRE-REQUISITES: • Data Structure Concept • Real Programming Experience with C Language • UNIT-III of MCA-102 should be finished before start of Unit-IV of this paper UNIT – I OOP Paradigm: Comparison of Programming paradigms. student may be asked to attempt only 1 question from each unit. Deep and shallow coping. if any. Object-based programming languages C++: Brief History of C++.cin. ANSI/ISO Standard C++. Data Abstraction. 2. having at least 2 questions from each unit.: MCA 104 Paper: Object Oriented Programming in C++ LTC 31 4 INSTRUCTIONS TO PAPER SETTERS: 1. new. [No.f. Access modifiers – private. when the programmer must implement these Static and late binding. Dynamic Binding. Stacks Queues and Linked Lists as cases Implementing Trees and Graph and all comparison based sorting algorithms Function objects and call backs Templates and Generics Stack Queses should be implemented in the practicals Extensive coverage of all the three components of STL namely containers. academic session 2010-11 . Class Component. Implementing Class Functions within Class declaration or outside the Class declaration. Comments. Overloading comparison operators. Structure of a C++ program. rest of the paper shall consist of four units as per the syllabus. Assignment operator deep and shallow coping. Syllabus of Master of Computer Applications (MCA). cout. 1. 1 should be compulsory and cover the entire syllabus. Using Reference variables with Functions. iterators and algorithms throgh suitable pratical caseletts Final case study could be an application making extensive handling files. OBJECTIVES: After covering the core C++ in about 25 lectures the course shall aim to aquaint the students about advanced features of the language the following features are as suggested guideline for the teacher. Classes. Polymorphism. Difference between C and C++ . Arrays and Pointer. Working with Variables and const Qualifiers. Implementing oops concepts in c++ Objects. of Hrs: 09] UNIT – II Abstract data types. Constructors Default and Copy Constructor. Working with Friend Functions. assignment operator and destrutors. Enumeration. Message Passing. Apart from Question No.e. Scope resolution operator. Prefix/ Postfix Increment and decrement Operators. virtual functions and VTABLE Implementing ADT with C++ classes. However. There should be 10 questions of short answer type of 2 marks each. Each question should be 10 marks including subparts. Understanding Compile Time Polymorphism function overloading Rules of Operator Overloading (Unary and Binary) as member function/friend function. Encapsulation. Every unit should have two questions to evaluate analytical/technical skills of candidate.Code No. Run time and comile time polymorphism. Question No.

Nell Dale. Venugopal. 2010. President. 2. “C++ Primer”. W. Lawlor. Understanding Inheritance with Generic Class. 4. Forouan. “Thinking in C++”.f. Type of Polymorphism – compile time and runtime. Mindview Inc. Ambiguity resolution using scope resolution operator and Virtual base class. dijkastra etc using STL [No. minimum spanning tree . composition vs classification hierarchies. Binary Search Tree basic operations. Gilberg. Types of Inheritance. “Object Oriented Programming with C++”. Understanding Implementation of Files. Rajkumar. of Hrs: 12] TEXT BOOKS: 1. Writing and Reading Objects. 3rd Ed. pure virtual functions. Using Manipulators. academic session 2010-11 . 2. B. Understanding Class Templates using Implementation of Generic stack.. Algorithms. Understanding of Algorithms Requiring Operations on the element using function objects. Implementation of Sequence and Associative containers for different Algorithms using their Iterator. linked lists: singly and doubly linked lists. A. Behrouz A. [No. Tata McGraw Hill. Bruce Eckel. Bjarne Stroustrup . Constructors and Destructor in derived classes.. R. Parasons. 2000. Virtual Functions (concept of VTABLE) . 1997. TMH. Using istream / ostream member functions. approved by MCA Coordination Committee on 7th May 2010 & Sub-Committee Academic Council held on 31st May 2010. 3. Aggregation. S. 5. Understanding Dynamic polymorphism: Pointer to objects. “C++ Plus Data Structure”. Nell Dale. 6. Working of Containers. Ravishanker “Mastering C++”. “Programming and Problem Solving with C++”. Vikas Publication. Addison Welsley. concepts of namespaces. and T. [No. Abstract Class. 7. 2010. bfs.e. Schildt Herbert. Abstract Classes. Overriding inheritance methods. Prentice Hall. Understanding of working and implementation of Exception Handling. 2004. Exception Handling and Manipulating strings.Assignment. “The Art of Programming Computer Science with C++”. BPB Publication. Syllabus of Master of Computer Applications (MCA). Addison Wesley. 1999. Jones and Bartlett . 3rd Edition. Creating Manipulator Functions. Advanced Input/Output. Lajoie. 10] UNIT – III Inheritance: Inheritance. Iteraters and Other STL Elements. “C++: The Complete Reference”. Computer Science . “The C++ Programming Language”. Chips Weens. 2nd Ed. Lippman and J. Multiple Inheritance. Standard Template Library:– Understanding Components of Standard Template Library. Implementing graph algorithm dfs. 3. Overloading of Function Templates. Cengage Learning. Polymorphism: Polymorphism. 4th Ed. 4th Ed. of Hrs: 11] UNIT – IV Generic Programming: and mastering STL Understanding Generic Functions with implementation of searching sorting algorithm. REFERENCE: 1. Steven C.. of Hrs. D .A Structural Approach Using C++”. 5th Ed. Jones and Bartlett.. subscript and function call Operator . Richrad F.

1 should be compulsory and cover the entire syllabus. 1. student may be asked to attempt only 1 question from each unit.:10] UNIT – II Interprocess Communication and Synchronization: Background. Operating system components and services. MultipleProcessor Scheduling. Processes: Process Concept. System calls. However. • Help students become competent in recognizing operating systems features and issues. of Hrs: 11] UNIT – III Device Management: Techniques for Device Management. the student shall be able to: • Exhibit familiarity with the fundamental concepts of operating systems. rest of the paper shall consist of four units as per the syllabus. CPU Scheduling: Basic Concepts. Message Passing. Scheduling Criteria.: MCA 106 Paper: Operating Systems L T C 3 1 4 INSTRUCTIONS TO PAPER SETTERS: 1. Segmentation with Paging. The Critical-Section Problem. time– sharing parallel. Synchronization Hardware. Dedicated Devices. Upon successful completion of this course. Page-replacement Algorithms. Syllabus of Master of Computer Applications (MCA). Question No. multi programming. Segmentation. 2. Page Replacement. Virtual Memory: Demand Paging. There should be 10 questions of short answer type of 2 marks each. academic session 2010-11 . Real-Time Scheduling. Every unit should have two questions to evaluate analytical/technical skills of candidate. [No. Classical Problems of Synchronization. • Exhibit competence in recognizing operating systems features and issues. Types of OS. Demand Segmentation. [No. Other Considerations. Role. Cooperating Processes. Shared Devices. Logical vs. Contiguous allocation. Virtual Devices. Recovery from Deadlock. Algorithm Evaluation. having at least 2 questions from each unit. swapping. Allocation of Frames. Operation on Processes. of Hrs. OBJECTIVE: The objectives of this course are to: • Help students become familiar with the fundamental concepts of operating system. Monitors. Semaphores. • Provide students with sufficient understanding of operating system design and how it impacts application systems design and performance. Critical Regions. approved by MCA Coordination Committee on 7th May 2010 & Sub-Committee Academic Council held on 31st May 2010. Methods for Handling Deadlocks. Physical Address space. • Apply a mature understanding of operating system design and how it impacts application systems design and performance. Memory Management: Background.Code No. Deadlock Prevention. Batch Systems. PRE-REQUISTES: • Basics of Computer System Architecture • C/C++ Programming Skills UNIT – I Operating System: Introduction.e. Combined Approach to Deadlock Handling. Scheduling Algorithms. Operating system structure.f. Deadlocks: System Model. Paging. W. Deadlock Detection. Thrashing. Channels and Control Units. if any. Device Characteristics-Hardware Consideration. Deadlock Characterization. Process Scheduling. Deadlock Avoidance. Apart from Question No. distributed and real-time systems. Threads. Performance of Demand Paging. Each question should be 10 marks including subparts.

: 10] TEXT BOOKS: 1. 2009. Access matrix. Deitel. Deitel and Choffnes. 4th Ed. Cengage Learning. Access Methods. 5. Sibsankar Halder and Alex A. “Operating Systems”. [No. Silbersachatz and Galvin.. Goals of protection.. SwapSpace Management. [No. 2000. 2009. Pearson Education. 2009. Aravind. Program threats. W. Madnick E. “Operating Systems Internals & Design Principles”. Block Multiplexing. “Operating System”. 2. Allocation Methods. 2006. 2. Tannenbaum.Independent Device Operation. “Operating System Concepts”. 4. Authentication. Cryptography. 2001. Directory Structure.. of Hrs. approved by MCA Coordination Committee on 7th May 2010 & Sub-Committee Academic Council held on 31st May 2010. “Operating System Principles and Design”. PHI. Pearson . File-System Structure. PHI.e.f. “Operating Systems”. Buffering. Free-Space Management. William Stallings. 2001 3. “Operating Systems”.: 12] UNIT – IV File-System Interface: File Concept. of Hrs. 6. Basic File System. Disk Scheduling. 8th Ed. Pbitra Pal Choudhury. “Operating Systems”. 2009. Milan Kovic. Disk Management. John Wiley. Intrusion detection . academic session 2010-11 . 6th Ed. File-System Implementation: Introduction. Directory Implementation. Case Study: Linux Operating System and Windows XP. and Donovan J.3rd Edition REFERENCES: 1. 3. Syllabus of Master of Computer Applications (MCA). Disk Reliability. System threats. Flynn McHoes.. Multiple Paths.. “Operating System”. Pearson. Tata McGraw Hill. Security : The Security problem. Tata McGraw Hill. Device Allocation Consideration Secondary-Storage Structure: Disk Structure.

Pearson. date models. “Fundamentals of Database Systems”. 2010. User Defined Functions. 10] UNIT . database backup and recovery from catastrophic failures. relational algebra. OBJECTIVES: The purpose of this course is to enable the students know about the fundamental concepts necessary for designing. B. However. Error Handling. lossless join and dependency preserving decomposition. Galgotia. 12] UNIT . Network & Relational Data Base Management Systems. MCA 108 Paper: Data Base Management Systems LTC 3 1 4 INSTRUCTIONS TO PAPER SETTERS: 1. student may be asked to attempt only 1 question from each unit. languages & systems: relational data model & relational algebra: relational model concepts. Table Spaces. Instances. schemas & instances. [No. database systems. academic session 2010-11 . Each question should be 10 marks including subparts.Code No. Roles & Privileges. SQL. 2NF. 1 should be compulsory and cover the entire syllabus. “An Introduction to Database Concepts”. “Oracle 11g with PL/SQL Approach”. 2. 3NF & BCNF). Types of Tablespaces. W.e. (1NF. Distributed Data Base Management Systems. 5th Ed. Korth. TMH.a relational database language: date definition in SQL. relational model constraints. 11] TEXT BOOKS: 1. “Fundamentals of Database System Concepts”. There should be 10 questions of short answer type of 2 marks each. Elmsari and Navathe. concepts and architecture. if any. recovery techniques: recovery concepts. characteristics of the database. Internal Memory Structure.f. of Hrs. 6th Ed.. Background Processes. DBMS architecture & data independence. using and implementing database systems and applications. Data Types.IV Relational data base design: function dependencies & normalization for relational databases: functional dependencies.. of Hrs. time stamp ordering. locking techniques. having at least 2 questions from each unit. 4. Concepts of object oriented database management systems.. of Hrs. specifying constraints and indexes in sql. Question No. 1. Cursors. PRE-REQUISITE: • Elementary Maths (Sets. rest of the paper shall consist of four units as per the syllabus. 2006. Relations) • Basic Data Structure Concepts UNIT . database languages & interfaces. of Hrs. Pearson Education. approved by MCA Coordination Committee on 7th May 2010 & Sub-Committee Academic Council held on 31st May 2010. 2010. Sham Tickoo and Sunil Raina. view and queries in SQL. Concurrency control & recovery techniques: concurrency control techniques. 2. Logical Data Structures Physical Data Structure. Silberschatz. Overview of hierarchical. It also covers advanced techniques and technologies. Apart from Question No. Every unit should have two questions to evaluate analytical/technical skills of candidate.III Oracle Architecture. Stored Procedures. 3. Triggers. normal forms based on primary keys. [No.II Relational model. Desai.I Basic concepts: database & database users. granularity of data items. [No. data modeling using the entity-relationship approach. [No. Syllabus of Master of Computer Applications (MCA). 9] UNIT .

2005.. Design. Kiffer. Pearson.f. Singh. W. 1st Ed.. 2. “Databases Systems Concepts. Pearson’s Education. 5. J.REFERENCES: 1. K. 4. “Database Systems: Concept. Shio Kumar Singh. Narosa Publishing. Ullman J.e. D. approved by MCA Coordination Committee on 7th May 2010 & Sub-Committee Academic Council held on 31st May 2010. academic session 2010-11 . S. 7th Ed. Design and Applications. “Principals of database systems”.” Pearson.. Date C. “An Introduction to Database Systems”. Galgotia . “Database Systems: An Application oriented Approach”. 2008. and Applications”.. 2006. 3. Syllabus of Master of Computer Applications (MCA).

W.f. for SRS. Waterfall. However. Software Reliability: Importance. [No. Validating Software Estimates. Cost Estimation Models. Classification of Cohesiveness & Coupling. Nature of SRS. Object Oriented Design. Unit Testing. documentation and maintenance. Evolutionary and Spiral Models. Halstead Software Science Measures. Software Design: Cohesion & Coupling. Debugging. 2. academic session 2010-11 . IEEE Std. Information Flow Metrics. and that is reasonably easy to understand. Logarithmic Poisson Model. [No. requirement elicitation techniques like FAST. MCA 110 Paper: Software Engineering LTC 31 4 INSTRUCTIONS TO PAPER SETTERS: 1. of Hrs. Software Quality Models. Token Count. Characteristics & organization of SRS. Requirement Management. Software Requirements analysis & specifications: Requirement engineering. COCOMO. 1 should be compulsory and cover the entire syllabus. Reliability Models. Design of test cases. Syllabus of Master of Computer Applications (MCA). Introduction to functional testing & Structural testing.Code No. having at least 2 questions from each unit.Basic Model. CMM & ISO 9001. PRE-REQUISITE: • Program Development • Basic Concepts of Data Management UNIT-I Introduction: Software Crisis. rest of the paper shall consist of four units as per the syllabus. Hardware Reliability & Software Reliability. Function Oriented Design. Question No. Software life cycle models. The concept covered in syllabus are • The software development process. Failure and Faults. Alpha & Beta Testing. Each question should be 10 marks including subparts. • Software design techniques. Integration and System Testing. Apart from Question No. Every unit should have two questions to evaluate analytical/technical skills of candidate. Software Processes & Characteristics.: 10] UNIT-II Software Project Planning: Size Estimation like lines of Code & Function Count. Requirements documentation. modify and maintain. Data dictionaries & ER Diagrams. QFD & Use case approach. approved by MCA Coordination Committee on 7th May 2010 & Sub-Committee Academic Council held on 31st May 2010. requirements analysis using DFD. • Software requirements and specifications.e. [No. • Techniques for developing large software systems. • Software testing. Putnam resource allocation model.: 12] UNIT-III Software Metrics: Software measurements: What & Why. Prototype. of Hrs. • CASE tools and software development environments. if any. Data Structure Metrics. OBJECTIVE: Course is intended to help students to develop skills that will enable them to construct software of high quality – software that is reliable. of Hrs. Risk Management. There should be 10 questions of short answer type of 2 marks each. student may be asked to attempt only 1 question from each unit.: 10] UNIT-IV Software Testing: Testing process. 1.

“Fundamrntal of Software Engineering”. Narosa.e. 5th Ed. “Essentials of Software Engineering”. 2. K. John Wiley & Sons. PHI. Mel Rosso-Llopart and Gil Taran. Carlo Ghizzi . 3rd Ed. Aggarwal and Yogesh Singh. 2nd Ed. Cengage Learning.. Software Re-engineering. Rajib Mall. Kassem A. Syllabus of Master of Computer Applications (MCA). 2010. Mehdi Jazayeri and Dino Mandrioli. “An Integrated Approach to Software Engineering”. Joes and Bartlett. Carol L. approved by MCA Coordination Committee on 7th May 2010 & Sub-Committee Academic Council held on 31st May 2010. Stephen R. Saleh.2003. Addison Wesley. Frank Tsui and Orlando Karan. 5. 2001. academic session 2010-11 . Documentation. PHI. “Software Engineering”. W. 3rd Ed. “Software Engineering: An Engineering Approach”. “ Fundamental of Software Engineering”. Configuration Management. Pedrycz. I. 2nd Ed. 2010. Hoover. R. Reverse Engineering. Sommerville.Software Maintenance: Management of Maintenance. 2005. S.. W. Pressman... New Age International. “Software Engineering”.. McGraw Hill Int. 7.8th Ed. Pearson. 2009. of Hrs. 3. 2009. 8. “Classical & Object Oriented Software Engineering”. 2009.f. Maintenance Models. Schach. “Software Engineering – A Practitioner’s Approach”. K. 2. 4. IRWIN. 2005. REFERENCES: 1. Pankaj Jalote. “Evaluating Project Decision Case Studies in Software Engineering”. “Software Engineering”. . 6.. James Peter. Maintenance Process. 3rd Ed.. 1996. 3. Regression Testing.: 10] TEXT BOOKS: 1. [No.

f. Data and File Structure Lab Object Oriented Programming in C++ Lab Database Management System Lab Software Engineering Lab MCA 112 MCA 114 MCA 116 MCA 118 Syllabus of Master of Computer Applications (MCA). 3. approved by MCA Coordination Committee on 7th May 2010 & Sub-Committee Academic Council held on 31st May 2010. academic session 2010-11 .There will be following Practical: 1.e. 4. 2. W.

Code No. Syllabus of Master of Computer Applications (MCA). This paper is under Non University Examination system its detail content will be decided by the respective Institute. approved by MCA Coordination Committee on 7th May 2010 & Sub-Committee Academic Council held on 31st May 2010.f.e. under approval of the coordination committee based on the requirement of individual institution. W. : MCA 162 Paper: General Proficiency – II* It is suggested to have a fundamental course on Personality Development and Communication Skills – II in this semester. academic session 2010-11 . *Non University Examination Scheme (NUES) There will not be any external examination of the university. The committee may conduct vivavoce at the end for the award of the marks. The performance of the candidates should continuously be evaluated by an internal committee.

J. Learning outcome of this course will be theoretical treatment of following • What can be computed and how fast it can be done? • Use of Automata and Language theory in the development of different modules of a compiler as a case study. of Hr: 10] UNIT . if any. There should be 10 questions of short answer type of 2 marks each. NP. Introduction to JFLAP Simulation. However. Non-Regular Languages. and Complexity Theory. Introduction to System software including various phases / Modules in the design of a typical compiler . Complexity classes P. Every unit should have two questions to evaluate analytical/technical skills of candidate. Push Down Automata (deterministic and nondeterministic) (PDA). Myhill Nerode Theorem. PRE-REQUISITE: • Discrete Mathematics • Skills in writing Formal Mathematical Proofs UNIT . W. [No.III Turing Machines and Computability Theory: Definition of Turing Machine. SLR and LR(1) Parsing Method). 2007. PSPACE complexity . space complexity . Decidability. having at least 2 questions from each unit. Equivalence of various Turing Machine Formalisms. Regular Expressions. Hierarchy theorems. Post correspondence problem.Code No. 2. 1. academic session 2010-11 . student may be asked to attempt only 1 question from each unit. “Introduction to Languages and the Theory of Computation”.II Context Free Languages: Context Free Grammar (CFG). Finite Automata. MCA 201 Paper: Theory of Computation L TC 3 1 4 INSTRUCTIONS TO PAPER SETTERS: 1. of Hr. approved by MCA Coordination Committee on 7th May 2010 & Sub-Committee Academic Council held on 31st May 2010. TMH. Closure properties of CFLs. Equivalence of CFGs and PDAs.f. Computability Theory.: 12] UNIT . NFAs and Regular Expressions. [No. Syllabus of Master of Computer Applications (MCA). Parse Trees.I Automata and Language Theory: Overview of Theoretical Computer Science ( including computationally intractable problems) . Deterministic Finite Automata (DFA). Recursion Theorem. Pumping Lemma. Question No. Topics include Automata and Language Theory. C. Pumping Lemma. rest of the paper shall consist of four units as per the syllabus. Closure properties of Regular Language. 3rd Ed. Extensions of Turing machines. Probabilistic computation.IV Complexity Theory: Time and Space measures. of Hr: 12] UNIT . 1 should be compulsory and cover the entire syllabus. [No. L. Savich theorem . Reducibility. Church – Turing Thesis. Parsing ( including LL(1) . Martin.e.statement of Kleen's Theorem. NL. Chomsky Classification. Halting Problem. OBJECTIVES: This course is extensive and theoretical treatment of issues in Computability and Complexity. Non-Deterministic Finite Automata (NFA). of Hr: 6] TEXT BOOKS: 1. [No. Use of Regular expressions in the Design of scanner (lexical analyzer). Apart from Question No. Non – deterministic Turing machines. Each question should be 10 marks including subparts. Equivalence of DFAs.

REFERENCES: 1.2. M. “Theory of Computation”. Dexter C. Bernard Moret. Kozen “Theory of Computation “. H. Rodger. and J. R. 2006.. “Introducing the Theory of Computation”. approved by MCA Coordination Committee on 7th May 2010 & Sub-Committee Academic Council held on 31st May 2010. Jones & Bartlett Student Ed. “JFLAP: An interactive Formal Languages and Automata Package”. 1997. Motwani. Pearson Education. “Theory of Computer Science Automata Language Computation”. “Elements of the Theory of Computation”.. academic session 2010-11 . 4. Syllabus of Master of Computer Applications (MCA). 3.. Cohen. 6. Chandrasekharan. Cengage Publication. “Languages and Machines”. L. 7. Jones & Bartlett. Wayne Goddard.e. Lewis and C. 2007. R. 3. 2nd Ed. 3rd Ed. Pearson. Pearson. Wiley. Pearson Education. “Introduction to Automata Theory. Springer 2006. 8. 2007. D. Mishra and N. 2nd Ed. J. H. K. W. 2. 2009. Susan H.. 2008. Narosa. 5.f. Language and Computation”. Ullman. “Introduction to Formal Languages and Automata”. “Introduction to Computer Theory. 2008. N. Sipser. Peter Linz. Sudkamp. “Introduction to the Theory of Computation”. 2nd Ed. 4. 2006. Papadimi Triou. Hopcroft. PHI. York.

Translation. PRE-REQUISITE: • Mathematical Concepts UNIT-I Scan conversion: Scan converting a point. of Hrs.P. 2-D transformations (Rotation. Rotation. Sutherland-Hodgeman. CSG – Constructive Solid Geometry. BSP. Hidden Surface Removal: Floating Horizon Method. Shearing and Reflection). BSpline Curves.tree Method. Shearing and Transformation between coordinate Systems. Projection: Parallel and Perspective Projections Solid Modeling: Sweeping a polygon or a surface patch along a path to form solids. of Hrs: 10] UNIT-IV Shading: Shading. 4 point and 5 point Bezier curves using Bernstein Polynomials. 2. W. Scaling. Conditions for smoothly joining curve segments. Computing location of V. Phong Model. Various 2D and 3D Transformation matrices (Translation. Illumination Model for diffused Reflection. Rotation about an arbitrary line. Scaling. 1. Effect of ambient lighting & distances. Rotation about : (i) an arbitrary axis (ii)about an arbitrary point. Gourard Shading. The objective of this course is to introduce the programming principles of computer graphics. Sutherland Cohen clipping algorithms. Effect of multiple control points at same location. Bezier bi-cubic surface patch. Scan Line Method. Geometrical Construction. [No. Computing Reflection Vector. student may be asked to attempt only 1 question from each unit. if any. Basic Transformation.f. Transformation: 2D transformation. : 10] UNIT-III Transformations: 3-D Transformation. first and second order continuities. Shearing. However.Code No. Specular Reflection Model.e. 2-D viewing. DDA). [No. [No. Reflection. and mathematical and theoretical foundations. A-Buffer) Method. and Reflection about an arbitrary line). rest of the paper shall consist of four units as per the syllabus. Computing control points given end slopes for a specified curve segment. The course will cover Practical programming through C. approved by MCA Coordination Committee on 7th May 2010 & Sub-Committee Academic Council held on 31st May 2010. [No. There should be 10 questions of short answer type of 2 marks each. Apart from Question No. of Hrs: 12] Syllabus of Master of Computer Applications (MCA). of Hrs: 10] UNIT-II Curves and Surfaces Bezier Curves. OBJECTIVES: Computer graphics is used in diverse applications from the visualization of complex scientific data to the special effects in computer games. octrees. academic session 2010-11 . Boundary Representation (B-Rep). Every unit should have two questions to evaluate analytical/technical skills of candidate. Polygonal Approximations. Curved Surfaces. Area Subdivision Method. Depth Buffer (Z-Buffer. Cubic B-Spline curves using uniform knot vectors. having at least 2 questions from each unit. Depth Sorting Method. Window-toview port transformation Clipping: Line Clipping. Each question should be 10 marks including subparts. MCA 203 Paper: Computer Graphics L T C 3 1 4 INSTRUCTIONS TO PAPER SETTERS: 1. Composite transformations: Reflection. Question No. 1 should be compulsory and cover the entire syllabus. circle and ellipse. line (Bresenham’s.

“Computer Graphics using Open GL”. Foley James D. “Principal of to Interactive Computer Graphics”. Pakhira. “Procedural Element of Computer Graphics”. 4. Newman and Sproul. “Theory and Problems of Computer Graphics”. REFERENECS: 1. approved by MCA Coordination Committee on 7th May 2010 & Sub-Committee Academic Council held on 31st May 2010. PHI. McGraw Hill.TEXT BOOKS: 1. TMH. “Computer Graphics: A programming Approach”. 5. Donnald Hearn and M. “Computer Graphics Multimedia Animation”. R. 3rd Ed. Pauline Baker. 1986. F. Malay K. 2. Mc Graw Hill. 6.. 2008. “Computer Graphics”. Stephen M. Syllabus of Master of Computer Applications (MCA). “Computer Graphics”. PHI. Hill.f.e. Kelley. 2009. 3. AW 2nd Ed. Schaum’s Series. Jr. Ven Harrington. Roge and Adams. Rogers. 3. McGraw Hill. 2. W. Plastock and G Kalley. academic session 2010-11 . S. PHI. McGraw Hill. “Mathematics Element of Computer Graphics”.

inter thread Communication. Language Construct of java including Keywords. packages. sound and video.net package. Overview of class loaders and Sandbox model of security. variables and looping and decision making construct. Working with windows.class file. Extending Interfaces. networking classes and interfaces. constructors. of Hrs. rest of the paper shall consist of four units as per the syllabus. 1. However. doing TCP/IP and Data-gram Programming. Byte and Character Stream. Multithreaded Programming: Fundamentals. final.f. suspending. adding variables and methods. Access protection. Byte code engineering libraries. The Collection Framework: The Collection Interface. util. built in exception. having at least 2 questions from each unit. Working with Maps & Sets Syllabus of Master of Computer Applications (MCA).Code No. Multilevel hierarchy abstract and final classes. Using Standard Java Packages (lang. Event Classes. one and two dimensional arrays. resuming and stopping threads. Runnable interface. Every unit should have two questions to evaluate analytical/technical skills of candidate. W. There should be 10 questions of short answer type of 2 marks each. Introduction to JVM and its architecture including set of instructions. Networking: Basics. [No. of Hrs. animation. Packages and interfaces. Overview of JVM Programming . thread classes.class file format. Streams. uncaught exceptions. Object class. Input/Output Programming: Basics. messaging. Wrapper classes: Basics types. 1 should be compulsory and cover the entire syllabus. Reading and writing from console and files. Apart from Question No. string array and methods. io. using java. student may be asked to attempt only 1 question from each unit. [No. handling Image. Internal and detailed explanation of a valid . Classes: String and String Buffer classes. Graphics and Text. 2.: 10] UNIT – III Event Handling: Different Mechanism. Instrumentation of a .: 12] UNIT – II Exception Handling: Fundamentals exception types. Layout managers and menus.e. if any. Arrays and String: Creating an array. creating objects. throw. Collection Classes. OBJECTIVE: In this course student will become familiar with features of Java language. approved by MCA Coordination Committee on 7th May 2010 & Sub-Committee Academic Council held on 31st May 2010. synchronization. academic session 2010-11 . objects and methods: defining a class. Event Listener Interfaces. throw. using AWT controls. they will learn how to write Java code according to Object-Oriented Programming principles.: MCA 205 Paper: Java Programming (Core & Advance Java) LTC 31 4 INSTRUCTIONS TO PAPER SETTERS: 1. Java thread model: priorities. predefined streams. the Delegation Event Model. Question No. Each question should be 10 marks including subparts. Java Applet. constants. using super. how to design GUI applications and Applets using AWT. Introducing classes. PRE-REQUISITES: • Basic Object Oriented Programming Concepts UNIT – I Importance and features of Java. Classes and their implementation. creating your own exceptions. Adapter and Inner Classes. net). RMI (Remote Method Invocation). how to develop multithreaded and Networking applications and how to create dynamic pages. class inheritance.

Horstmann. JDBC Models: Two Tier and Three Tier Model. 2nd Ed. 2000. Swing : Introduction to JFC (Java Foundation Classes). DBC API. Techmedia. Decker and Hirshfield. “Programming Java: A Introduction to Programming Using JAVA”. “The Java #EE5 Tutorial”. of Hrs: 09] UNIT – IV RMI (Remote Method Invocation): Introduction. 1998. Daniel Liang. 4. 3. 2. Comparison with AWT. “Web Technology. Generating Stub & Skeleton. 2010. 2007. Java bean package. RMI Architecture. Bill Vanners. methods and events. TMH. W. Pearson. 6. Using the Bean Development Kit. 5.P Gopalan and J. “Java How to Program”. Eric Jendrock. Callable Statement. Shelley Powers. John Wiley. Java Bean: Introduction.f. “Dynamic Web Publishing”. 7th Ed. 1999. REFERENCES: 1. Features of Swing. Pearson. N. 2007. Obtaining a Connection. 8th Ed. Vikas Publication. “Computing Concepts with Java 2 Essentials”. PHI. Packing beans. Syllabus of Master of Computer Applications (MCA). JDBC Application Architecture. TMH. Creating simple bean-properties. 2. of Hrs. E. Patrick Naughton and Herbertz Schildt.. academic session 2010-11 . Introduction to NetBean.. Paul Dietel and Harvey Deitel. 2010. 5. Rick Dranell. 2000 4. “Programming with Java: A Primer”.e. [No. Prepared Statement. Techmedia Publication. 1998. [No. “Java-2: The Complete Reference”. 2nd Ed. Bean Architecture. PHI.the manifest & the jar. RMI packages.: 11] TEXT BOOKS: 1.A Developer’s Perspective”. TMH... “Introduction to Java Programming”. “HTML 4 unleashed”. Steps in creating a Remote Object. ResultSet. “Inside Java Virtual Machine”. approved by MCA Coordination Committee on 7th May 2010 & Sub-Committee Academic Council held on 31st May 2010. Akilandeswari. Advanced Control. 3.JDBC: Introduction to DBMS & RDBMS. Balaguruswamy. 3rd Ed. Jennfer Ball and Debbei Carson.

II The Data Link Layer: Data Link Layer Design Issues. academic session 2010-11 . Internetworking. Electronic Mail. Digitization – Sampling Theorem. TCP window management. Error Control. routing algorithms. Sliding – Window Flow Control. rest of the paper shall consist of four units as per the syllabus. Analog Modulation – Introducing AM. wireless LANs. Collision free protocols. The Network Layer in the Internet.I Introductory Concepts: Goals and Applications of Networks. IPv6. Physical Layer: The Physical Layer. internetworking. Selective-repeat. DM. bipolar-AMI.: 11 ] UNIT . Guided Transmission Media. IP packet.: 11 ] UNIT . 1. PCM. Digital Modulation – ASK. the OSI reference model. Basics of networking and protocols.IV Transport Layer: Design Issue. of Hrs. Wireless Transmission. Application Layer: DNS. [No of Hrs. IP addresses. [No of Hrs. Communication Satellites Digital Signal Encoding Formats – NRZ-L. PSK.: 10] Syllabus of Master of Computer Applications (MCA). having at least 2 questions from each unit. if any. Example of Data Link Protocols-HDLC Medium access sub layer: Channel allocations. MCA 207 Paper: Data Communications and Networking L T C 3 1 4 INSTRUCTIONS TO PAPER SETTERS: 1. Question No. User Datagram Protocol. Go-back-N. Data Link Layer Switching. Manchester. PSK. 2. FM. Performance Issues. Carrier Sense Multiple Access Protocols. Ethernet. OSI network layered models and Application layer protocols. Blue Tooth. FSK. OBJECTIVE: This course covers theory and practice of data communication between computing devices. There should be 10 questions of short answer type of 2 marks each. student may be asked to attempt only 1 question from each unit. Theoretical Basis for Data Communication. Transmission Control Protocol. Differential Manchester. [No. Network Security: Cryptography and Compression Techniques.f. PRE-REQUISITE: • Basic Networking • Operating System Concepts UNIT . ALOHA Protocols. CSMA with Collision Detection. Quality Control. Every unit should have two questions to evaluate analytical/technical skills of candidate.Code No. However. Each question should be 10 marks including subparts. services. approved by MCA Coordination Committee on 7th May 2010 & Sub-Committee Academic Council held on 31st May 2010. Flow Control Protocols. W.III Network Layer: Point-to-Point network. Topics include network architecture and topology. PM. Stop-and-wait Flow Control. WWW. congestion control. networks topology.e. Error Detection and Correlation.: 10] UNIT . connection management. NRZI. Apart from Question No. 1 should be compulsory and cover the entire syllabus. Network structure and architecture. [No of Hrs. The Mobile Telephone System. Stop-and-wait ARQ. MUTIMEDIA.

S. academic session 2010-11 . McMillan. approved by MCA Coordination Committee on 7th May 2010 & Sub-Committee Academic Council held on 31st May 2010. J. 4. REFERNCES: 1. M. 5. PHI. “Computer Networks and Internet”. 5. W. “An Engineering Approach to Computer Networking. A. “Data Communication and Networking”. 3. PHI. W. Forouzan. Tanenbaum. S. Stallings. McMillan. “Data and Computer Communication”. 3. PHI. Comer. 4th Edition.TEXT BOOKS: 1. “Local Networks”. 2001. 2. “Computer Networks”.e. Martin. Macmillan Press. “Data and Computer Communication”.f. PHI. 4th Edition. Comer. W. Syllabus of Master of Computer Applications (MCA). PHI. Keshav. “Internetworking with TCP/IP”. Pearson”. Stallings. “Computer Communication Network Design and Analysis”. Stallings. W.Schwertz. “Computer Network and Distributed Data Processing”. 2. 4. TMH.

LINQ and C#. Implicitly typed local variables. IList.NET(Mono / Portable . nesting of classes.NET platform. Each question should be 10 marks including subparts. 2. indexers arrays and readonly fields. Know the role of the Common Intermediate Language (CIL). Overloading Methods. type distinction. Inheritance and polymorphism specialization and generalization.NET Updating retrieving and deleting data using LINQ to SQL. of Hrs.I The CLR and . This course will help to develop real life projects. Structures. Common Language Infrastructure (CLI). having at least 2 questions from each unit. Apart from Question No. access modifiers. Defining and executing a Query. Every unit should have two questions to evaluate analytical/technical skills of candidate. Working with generic List. LINQ to SQL Fundamentals of ADO. String and DateTime classes. 1 should be compulsory and cover the entire syllabus. IEnumerator. rest of the paper shall consist of four units as per the syllabus. Dictionary and Queue. W. Encapsulating data.subscribers paradigm for handling events. properties.: 08] UNIT . Putting LINQ to work. There should be 10 questions of short answer type of 2 marks each. Introduction to WPF and building an WPF application [No. [No. PREREQUISITES: • Basic Programming Language UNIT . Anonymous Types.Code No. overriding interface implementation.f. Reference and value Types. primitive types the Nullable and enum types. Abstract classes. approved by MCA Coordination Committee on 7th May 2010 & Sub-Committee Academic Council held on 31st May 2010.NET Framework: Understand the motivation behind the . student may be asked to attempt only 1 question from each unit.IV Introducing LINQ and XML: XML A quick introduction.: MCA 209 Paper: C# Programming L TC 3 1 4 INSTRUCTIONS TO PAPER SETTERS: 1. Explicit interface implementation. Programming Window Forms Applications:. [No.NET distributions). . Platform independent . Various Constructors. Handling errors and throwing exceptions The Root object class. Anonymous delegates and lambda expression FUNC and Action delegates. [No. 1. Stack.III Event handling paradigm Delegates and events. namespace. Classes and objects. Contrast single-file and multi-file assemblies. IEnumerable.II Evolution of C# Language: Language Fundamentals. OBJECTIVE: In this course student will become familiar with an with C# language. metadata. of Hrs: 10] UNIT . IComparer and their Generic equivalent. Know the role of the Common Type System (CTS). Question No. Collection. academic session 2010-11 . if any. Understand the assembly. of Hrs: 14] UNIT . The notifies .e. Extension Methods and Lambda Expressions.NET framework for handling GUI events. However. Defining classes Creating objects. Generics Collections Interfaces. Garbage Collector. of Hrs: 10] Syllabus of Master of Computer Applications (MCA). Using static members. the Common Language Specification (CLS) and the Common Language Runtime (CLR).

PHI. “C# 2008 for Programmers”. Joseph Mayo. O’REILLY. “Essential of .G. Jesse Liberty and Donald Xie . J. O’REILLY.e.R.f.TEXT BOOKS: 1.0 in NUTSHELL”. Jon Skeet. approved by MCA Coordination Committee on 7th May 2010 & Sub-Committee Academic Council held on 31st May 2010. “Programming with C# . 2. Sathiaseelan. Atul Kahate.net”. 2nd Ed.net”. “Programming C# 3. ASP. academic session 2010-11 . O’REILLY Syllabus of Master of Computer Applications (MCA). XML. Perry. “C# in Depth ”. 2010. Joseph Albahari and Ben Albhari. Pearson. Stephen Walther.0”. 2009. 3rd Ed.net and Related Technologies with a focus on C#. Deitel. 2009. Stephen C. Harvey Deitel. 3. 4. N Sasikaladevi. “C# 3.0/4.net and ADO. REFERENCES: 1. W. Paul J. Pearson.. 2.

academic session 2010-11 . W. C# Lab MCA 211 MCA 213 MCA 215 Syllabus of Master of Computer Applications (MCA).f.Practical will be based on following: 1. Computer Graphics Lab 2.e. approved by MCA Coordination Committee on 7th May 2010 & Sub-Committee Academic Council held on 31st May 2010. Java Programming Lab 3.

e.Code No. *Non University Examination Scheme (NUES) There will not be any external examination of the university. The committee may conduct vivavoce at the end for the award of the marks. Syllabus of Master of Computer Applications (MCA).f. approved by MCA Coordination Committee on 7th May 2010 & Sub-Committee Academic Council held on 31st May 2010. academic session 2010-11 . The performance of the candidates should continuously be evaluated by an internal committee. This paper is under Non University Examination system its detail content will be decided by the respective Institute. : MCA 261 Paper: General Proficiency – III* It is suggested to have a fundamental course on Technical Paper Writing in this semester. under approval of the coordination committee based on the requirement of individual institution. W.

order statistics. Use of Big O . Question No.Mathematical Analysis of few Non-recursive and Recursive Algorithms .: 10] Syllabus of Master of Computer Applications (MCA). Divide and conquer Paradigm of Problem solving .II Sorting and Searching Techniques . 2. θ. NP-Completeness and Reducibility.I Notion of Algorithm. Quick Sort . Recurrences: The substitution method. OBJECTIVE: In this course. rest of the paper shall consist of four units as per the syllabus. Prim’s Algorithm.: 10] UNIT . NPComplete problems. 1 should be compulsory and cover the entire syllabus. Sorting in linear time. Every unit should have two questions to evaluate analytical/technical skills of candidate. Medians and Order statistics.III: Greedy Techniques. Matrix multiplication Problem . • To solve problems and to express your solutions using the language and concepts of algorithms and its mathematical tools. [No of Hrs. academic session 2010-11 . Heaps and Heap sort . Branch and bound.: 10] UNIT . Binary Search Trees. Red-Black trees . approved by MCA Coordination Committee on 7th May 2010 & Sub-Committee Academic Council held on 31st May 2010.e. Apart from Question No. Polynomial-time verification.Code No. Knapsack Problem . Insertion Sort . Huffman trees. disjoint set and their implementation . maximum network flow problem . Depth first Search and Breadth First Search. 0/1 Knapsack Problem . complexity analysis and understanding of Merge sort .IV Backtracking. [No of Hrs. students will learn how: • To design new algorithms based on standard algorithm-design strategies. • To analyze the time and space usage and correctness of new algorithms based on standard algorithm-analysis techniques. Warshall ’s and Floyd’s Algorithm .f.: MCA 202 Paper: Design and Analysis of Algorithms L TC 3 1 4 INSTRUCTIONS TO PAPER SETTERS: 1. travelling salesman problem. Hash Tables. Asymptotic Notations and Basic Efficiency Classes. Growth of functions. The Rabin-Karp Algorithm. . 1. Selection Sort . [No of Hrs. Subset-Sum problem. Each question should be 10 marks including subparts. Proof of cook's theorem. n-Queen’s Problem. Bubble Sort . NP-Completeness Proof. However. having at least 2 questions from each unit. if any. Introduction to Computability. naive string matching algorithm . student may be asked to attempt only 1 question from each unit. string matching with finite automata Knuth morris Pratt algorithm . Summations. The iteration method. Optimal Binary Search trees . Sequential Search Binary Search . searching. AVL Trees . graph algorithms) to new situations. Dynamic Programming paradigm .: 10] UNIT . in analysis . Dijkstra’s and Bellman Ford Algorithm . [No of Hrs. Balanced Search trees . W. Kruskal’s Algorithm . • To apply and adapt fundamental algorithms (sorting. Hamiltonian Circuit problem. Proof of Correctness. PRE-REQUISITES • Programming in C • Data Structure in C • Discrete Mathematics UNIT . There should be 10 questions of short answer type of 2 marks each. Assignment problem.

E. 5.H. 4. “Data Structure & Algorithms”. 2004. “Introduction to Algorithms” PHI. Rivest and C. “Introduction to the Design and Analysis of Algorithm”. Hopcroft and J. Panneerselvam. Ellis Horowitz. 2002. R. S. Skiena . “Computer Algorithms . academic session 2010-11 .D. 6. Jon Kleinberg and Eva Tardos. Pearson Education. Aho. 3. T. R. Salaria. 2. Pearson Education. 2006. Leiserson. 1998. E.V. Richard Neapolitan and Kumarss Naimipour. Sara Baase and Allen Van Gelder. 2007. “Design and Analysis of Algorithm”. 2009. (P) Ltd. “The Design and Analysis of Computer Algorithms”. 3rd Ed. Sanguthevar Rajasekaran. approved by MCA Coordination Committee on 7th May 2010 & Sub-Committee Academic Council held on 31st May 2010. Cormen. 2003. “Algorithms”.e. “Algorithm Design”. OrientLongman . “Foundations of Algorithms”. Pearson Edition.f. Khanna. Johnsonbaugh .Introduction to Design and Analysis”.. Book Publishing Co. 7. Springer. Sartaj Sahni.L.. “Algorithm Design Manual”. W. 2004. A. Syllabus of Master of Computer Applications (MCA). Stein. 8.TEXT BOOKS 1. 3. 2006. Anany Levitin. “Fundamental of Computer Algorithms”. J. 2003.Ullman. Steven S. 2. REFERENCES: 1. PHI. Pearson Education. C. Pearson. 2003. Jones & Bartlett. R.

Code No.: MCA 204 Paper: Data Warehousing & Data Mining

LTC 314

INSTRUCTIONS TO PAPER SETTERS: 1. Question No. 1 should be compulsory and cover the entire syllabus. There should be 10 questions of short answer type of 2 marks each, having at least 2 questions from each unit. 2. Apart from Question No. 1, rest of the paper shall consist of four units as per the syllabus. Every unit should have two questions to evaluate analytical/technical skills of candidate. However, student may be asked to attempt only 1 question from each unit. Each question should be 10 marks including subparts, if any.

OBJECTIVES: This course is an attempt to provide you with the basic information about data ware house and their development. This course also provides the basic conceptual background necessary to design and develop data ware house applications. PRE-REQUISITE: • Information System Concepts UNIT- I The Compelling Need for data warehousing: Escalating Need for strategic information, failures of Past decision-support systems, operational versus decision-support systems, data warehousing – the only viable solution, data warehouse defined Data warehouse – The building Blocks: Defining Features, data warehouses and data marts, overview of the components, metadata in the data warehouse Defining the business requirements: Dimensional analysis, OLAP operations : Drilldown and roll-up, slice-and-dice or rotation.
[No. of Hrs: 11]

UNIT- II Principles of dimensional modeling: , the STAR schema, STAR Schema Keys, Advantages of the STAR Schema Dimensional Modeling: Updates to the Dimension tables, miscellaneous dimensions, the snowflake schema, aggregate fact tables, families of STARS ,Steps for the Design & Construction of Data warehouse : Framework , Architecture , Type of OLAP Servers : ROLAP , MOLAP , Data warehouse implementation tolls & techniques.
[No. of Hrs.: 10]

UNIT- III Data Mining, Data Mining of what kind of Data , Knowledge discovery process (KDD) , What kind of patterns can be mined , OLAP versus data mining, data mining and the data warehouse, Data mining functionalities, classification Systems , Data processing : Cleaning , Integration & transformation, Reduction . Data Mining primitives: What defines a Data Mining Task.
[No. of Hrs.: 10]

UNIT- IV Data Mining Query language (DMQL), Cluster Analysis : Partitioning , Hierarchical Density , Grid & Model based methods ., Major Data Mining Techniques, Cluster detection, decision trees, memory-based reasoning, link analysis, neural networks, genetic algorithms, moving into data mining, Data Mining Applications, Benefits of data mining & applications. [No. of Hrs.: 11]

Syllabus of Master of Computer Applications (MCA), approved by MCA Coordination Committee on 7th May 2010 & Sub-Committee Academic Council held on 31st May 2010. W.e.f. academic session 2010-11

TEXT BOOKS: 1. Paul Raj Poonia, “Fundamentals of Data Warehousing”, John Wiley & Sons, 2003. 2. W. H. Inmon, “Building the Operational Data Store”,2nd Ed., John Wiley, 1999 3. Sam Anahony, “Data Warehousing in the Real World: A Practical Guide for Building Decision Support Systems”, John Wiley, 2004. 4. Jarke, “Fundamentals of Data Warehouse”, Springer REFERENCES: 1. Kamber and Han, “Data Mining Concepts and Techniques”, Hartcourt India P. Ltd., 2001. 2. G. K. Gupta, “Introduction to Data Mining with Case Studies”, PHI, 2006. 3. A. B. M. Shawkat Ali, Saleh A. Wasimi, “Data Mining Methods and Techniques”, Cengage Learning, 2009. 4. Pang - Ning, Michael- Steinbach, “Introduction to Data Mining”, Pearson, 4th Ed., 2009.

Syllabus of Master of Computer Applications (MCA), approved by MCA Coordination Committee on 7th May 2010 & Sub-Committee Academic Council held on 31st May 2010. W.e.f. academic session 2010-11

Code No. MCA 206 Paper: Advanced Computer Networks

L T C 3 1 4

INSTRUCTIONS TO PAPER SETTERS: 1. Question No. 1 should be compulsory and cover the entire syllabus. There should be 10 questions of short answer type of 2 marks each, having at least 2 questions from each unit. 2. Apart from Question No. 1, rest of the paper shall consist of four units as per the syllabus. Every unit should have two questions to evaluate analytical/technical skills of candidate. However, student may be asked to attempt only 1 question from each unit. Each question should be 10 marks including subparts, if any.

OBJECTIVE: • To grasp the current directions of computer networks research. • To fill in gaps in students’ networking knowledge. • To better understand experimental methodology. PREREQUISITE: • Data Communications and Networking UNIT - I Introduction : Overview of computer network, seven- layer architecture, TCP/IP suite of protocol, etc, Mac protocol for high speed LANS, MAN’s & WIRLESS LANs (for example, FDDI, DQDB, HIPPI, Gigabit Ethernet, Wireless Ethernet etc) Fast access technologies.(For example, ADSL, cable Modem Etc.), Wi Fi, Wimax. [No. of hrs: 10] UNIT – II IPV6: Why IPV6, basic protocol, extension & option, support for QS, Security, etc, neighbor discover, auto-configuration, routing, Change to other protocols, Application programming interface for IPV6.6 bone. ATM: Introduction, ATM reference Model, AAL layers, AAL0, AA1, AAL2, AAL3/4, AAL5 [No. of hrs: 12] UNIT – III Mobility in network, mobile, Security related issues. IP Multicasting: Multicasting routing protocols, address assignment, session discovery, etc. [No. of hrs: 10] UNIT-IV TCP extensions for high – speed networks, transaction – oriented application, other new option in TCP. Network security at various layers: Secure-HTTP, SSP, ESP, Authentication header, key distribution protocols, Digital signatures, digital certificates. [No. of hrs: 10] TEXT BOOKS: 1. W. ER. Stevens, “TCP/IP illustrated, Volume 1: The protocols”, Addison Wesley, 1994. 2. G. R. Wright, “TCP/IP illustrated volume 2. The Implementation”, Addison Wesley , 1995. 3. Frouzan, “TCP/IP Protocol Suite”, Tata Mc Grew Hill, 4th Ed., 2009. REFERENCES: 1. William Stalling, “Cryptography and Network Security”, Pearson Publication. 2. James Martin, Joseph Lebin, Kavanagh Chapman “Asynchronous Transfer Mode: ATM Architecture and Implementation”, Prentice Hall PTR, Facsimile Ed. 3. Nader F. Mir, “Computer and Communication Networks”, Pearson, 2009.
Syllabus of Master of Computer Applications (MCA), approved by MCA Coordination Committee on 7th May 2010 & Sub-Committee Academic Council held on 31st May 2010. W.e.f. academic session 2010-11

integration testing. 2009. of Hrs.OOD. of Hrs. the requirements model. analysis model. Generalization and specialization. the implementation model. Each question should be 10 marks including subparts. model architecture. of Hrs. REFERENCES: Syllabus of Master of Computer Applications (MCA). To develop skills to evolve object-oriented systems from analysis. test model. having at least 2 questions from each unit.: 09] UNIT . approved by MCA Coordination Committee on 7th May 2010 & Sub-Committee Academic Council held on 31st May 2010. Objects and Classes. to design. Object Oriented Lifecycle Model.I Review of Object modeling. system testing. 2nd Edition. working with construction. 2. 2008. OOSE. if any. OBJECTIVE: The objective of the course is to give students a detailed understanding of processes and techniques for building large object-oriented software systems. languages. PRE-REQUISITE: • Software Engineering Concepts • Object Oriented Programming Concepts UNIT . Pearson. Inheritance. OOSA. UML Diagrams. block design. Metadata. new paradigm. frameworks. and design patterns. the design model. Pearson. the testing process. [No. HOOD. Polymorphism. Links and association. Case Studies.Code No. [No.e. 1 should be compulsory and cover the entire syllabus. to implement and to understand most of the major object-oriented technologies including basic OO concepts. academic session 2010-11 . W. Grouping concepts.f. James Rumbaugh. 4+1 view architecture of UML. the analysis model. rest of the paper shall consist of four units as per the syllabus. OMT. Basic Structural Modeling. Every unit should have two questions to evaluate analytical/technical skills of candidate. on testing.IV Modeling with UML: Origin of UML. Grady Booch. user interfaces. MCA 208 Paper: Object Oriented Analysis and Design L T C 3 1 4 INSTRUCTIONS TO PAPER SETTERS: 1. OORASS. of Hrs. There should be 10 questions of short answer type of 2 marks each.: 12] TEXT BOOKS: 1. OOSD. Testing: introduction. Introduction to Object Oriented Methodology. student may be asked to attempt only 1 question from each unit. “The UML User Guide”. aggregation. CRC. Ivar Jacobson. Constraints. requirements model.II Architecture: Introduction.III Construction: Introduction. Seventh Impression . Reuse. Overview of various object oriented methodologies. OOA. abstracts classes. [No. [No. the design model. unit testing. Basic Building Blocks of UML. A Conceptual Model of UML. databases. processes. Ivar Jacobson. 2. “Object Oriented Software Engineering”.: 09] UNIT .: 12] UNIT . 1. However. object oriented thinking-rethinking. Question No. Apart from Question No. Analysis: Introduction. System development is model building. composition .

Blaha . James R. PHI.e. Pearson. Pearson. 2nd Ed. James R. PHI. 2007. ”Object Oriented Software Engineering”. Tepfenhard. A Practical guide to objectoriented Development”. 4.1. W. Runbaugh.William Premerlani . Fifth Impression. Frederick Eddy . Stephen R. 7. “Classical & Object Oriented Software Engineering with UML and Java”. 2009. “Object-Oriented Modeling and Design “. Blaha. 6. Michael R. 2008. Richard C. Syllabus of Master of Computer Applications (MCA). “The Unified Software Development Process”. Ivar Jacobson. 2. 5. 1999. McGraw Hill. William Lorensen . approved by MCA Coordination Committee on 7th May 2010 & Sub-Committee Academic Council held on 31st May 2010. Scach. Pearson. Mahesh P. academic session 2010-11 . “Object Oriented Analysis and Design using UML”. Lee. Matha. 2008. Grady Booch & James Rumbaugh. 3. William M. Bernd Bruegge. 2nd Edition. 2nd Ed.f. “Object Oriented Modeling and Design with UML”. Pearson. “UML and C++.. Rumbaugh . Michael R.

Sharma.f. “Internet and Web Technologies”.Net Application. Working with ASP. [No. Ethan Cerami. “Web Technology”. academic session 2010-11 . Tracking User Sessions. DHTML. This course also provides some basic knowledge of web services which are useful for the same.B. Vikas Publishing House. Binding Data to web Control. Each question should be 10 marks including subparts. O'Reilly Media. Advanced Control Programming.Net Applications: Using Form-Based Authentication. Using Windows-Based Authentication. A Case Study for developing interactive web applications [No. PRE-REQUISITE: • Web Designing Tools • Object-Orientated Paradigm • Concept of a Namespace UNIT-I Overview of Internet and web. “Web Technologies”. Achyut S Godbole and Atul Kahate. Latest trends in Web technologies. 2. rest of the paper shall consist of four units as per the syllabus.Net. Introduction to Java Script and Cascading Style Sheets. “Active Server Pages “. Building Forms with Web Server Controls. However. 2. 1 should be compulsory and cover the entire syllabus.Net: Introduction to ADO. of Hrs 10] UNIT-III Working with ASP. Stephen Walther.NET”. [No. Working with DataSets. 2002. Performing Form Validation with Validation Control. Using various Web Design Tools like Dream Weaver .Net.Net Applications: Creating ASP. OBJECTIVE: In this course student will learn how to design and develop a dynamic website. Heith Morneau. of Hrs 10] UNIT-II ASP. 2004. Question No. A. Forms & Frames .Code No. K. WSDL. Working with XML. K. Using the DataList and DataGrid Controls. Every unit should have two questions to evaluate analytical/technical skills of candidate. Apart from Question No. “Web Services”. TMH. Second Edition. Application Tracking and Error Handling. Overview of Grid and Cloud Computing. Securing ASP. HTML Tags.Net Page. REFERENCES: 1. There should be 10 questions of short answer type of 2 marks each. Gif Animator etc [No. Syllabus of Master of Computer Applications (MCA). of Hrs 12] TEXT BOOKS: 1. Pearson Education. 5. Raj Kamal . student may be asked to attempt only 1 question from each unit.Net Application. Tata McGraw Hill. of Hrs 10] UNIT-IV Web Services: Introduction to Service-Oriented Architectures. SOAP message structure. Caching ASP. Encrypting Data over the Network. Working with ADO. Publication Delhi.e. UDDI. if any.Net Web Forms: Building ASP. having at least 2 questions from each unit. XML basics. 3. SOAP. “ASP. approved by MCA Coordination Committee on 7th May 2010 & Sub-Committee Academic Council held on 31st May 2010. First Edition. W.: MCA 210 Paper: Web Technologies L T 3 1 C 4 INSTRUCTIONS TO PAPER SETTERS: 1. 2008. 1. 4.

A Computer Science Perspective”. Java script. “HTML4 unleashed”. Jackson. 5. W. Cyber tech. Pearson. “An Introduction to XML and Web Technologies”. “Internet & World Wide Web . Dhruv. Jain. Kathleen Kalata. PHI.2. Ramachandran . 10. Ivan Bay Ross. Anders Moller. 2005. “Designing interactive web sites”.f.net 2. Syllabus of Master of Computer Applications (MCA). 2nd Ed. 6. Crouch. “Web Technologies. . Michael Schwartzcach. J. Rick Dranell. Delmar Thomson Learning. 2000. Perl CGI”. 2002. Pearson. “Internet & Web development”. 11. “Web Application using ASP.net and VB. 8. DHTML. 2009. “HTML. How to Program”. Deitel.0”. Pearson. James L Mohler and Jon Duff. K. BPB. 9. Techmedia Publication. “Advanced programming in Web Design”. Jeffrey C. 2009.e.net Web Programming”. “ASP. approved by MCA Coordination Committee on 7th May 2010 & Sub-Committee Academic Council held on 31st May 2010. T. V. Malt. 7. 3. 4. M. academic session 2010-11 .

2.Practical will be based on following: 1. 5. 4. approved by MCA Coordination Committee on 7th May 2010 & Sub-Committee Academic Council held on 31st May 2010.e. W.f. academic session 2010-11 . Design and Analysis of Algorithm Lab Data Warehousing and Data Mining Lab Advance Computer Networks Lab Object Oriented Analysis and Design Web Technologies Lab MCA 212 MCA 214 MCA 216 MCA 218 MCA 220 Syllabus of Master of Computer Applications (MCA). 3.

f. under approval of the coordination committee based on the requirement of individual institution. The performance of the candidates should continuously be evaluated by an internal committee. The committee may conduct vivavoce at the end for the award of the marks. approved by MCA Coordination Committee on 7th May 2010 & Sub-Committee Academic Council held on 31st May 2010. W. academic session 2010-11 .e.Code No. This paper is under Non University Examination system its detail content will be decided by the respective Institute. : MCA 262 Paper: General Proficiency – IV* It is suggested to have a fundamental course on Process Modeling (Management Oriented) in this semester. *Non University Examination Scheme (NUES) There will not be any external examination of the university. Syllabus of Master of Computer Applications (MCA).

system calls for files Process Management. if any. advanced filters-sed and awk. Pearson Education. “Linux Programming by Examples The Fundamentals”. [No. Arnold Robbins.: 10] UNIT – IV Networking in LINUX: Socket Introduction. 1. The powers of Root. Each question should be 10 marks including subparts.e. There should be 10 questions of short answer type of 2 marks each. Bind. Sumitabha Das. of Hrs. “Unix Concepts and Applications”. student may be asked to attempt only 1 question from each unit. Installation. TCSH. [No. Listen. storing and executing scripts. system processes (an overview). Korn or so on). Elementary TCP Sockets (Socket Function. 2. 2009. 1 should be compulsory and cover the entire syllabus.: 10] TEXT BOOKS: 1. file permissions. TMH. System V IPC. 2008.: 10] UNIT – III Shell Programming:Available shells under Linux (viz. Cox K. Overview of Linux architecture. 4. W. The Ext3 File system. Apart from Question No. Elementary UDP Sockets. 2008. of Hrs. [No. 4th Ed. shell scripts: shell variables. Question No. Stevens. Linux distributions. 2nd Ed. “Red Hat Linux Administrator’s Guide”. 2.f. “UNIX Network Programming”.Linux Security. 3rd Ed. environmental variables. Syllabus of Master of Computer Applications (MCA). Message Queues. Bash. IPC: Pipes. editors. academic session 2010-11 .: 10] UNIT – II Resource Management in Linux: file and directory management. Linux features. writing. system calls for processes. Memory Management. library and system calls for memory.Paper Code: MCA-301 Paper: Linux Programming L TC 3 1 4 INSTRUCTIONS TO PAPER SETTERS: 1.. TCP Client server Example. FIFOs. having at least 2 questions from each unit. OBJECTIVES: The main objective of this course is to provide Students • A comprehensive overview of the Linux operating system along with Shell commands and shell scripting • Implementation of Linux System programmes through GCC compiler.. rest of the paper shall consist of four units as per the syllabus. PHI. Every unit should have two questions to evaluate analytical/technical skills of candidate. [No. R. Start up scripts.The grep family. purpose of shell scripts. of Hrs. shell commands. PHI. approved by MCA Coordination Committee on 7th May 2010 & Sub-Committee Academic Council held on 31st May 2010. 2009.. Linux’s relationship to Unix. managing users (adding and deleting): using the command line & GUI tools. Fork and Exec). Connect Function. Signals. User Management: Types of users. Filters. 3. different Shell features. Accept. of Hrs. However. • Understanding of basic concept of Socket programming (TCP and UDP) PRE-REQUISTE: • Operating system • Computer Network • C /C++ Programming UNIT – I Linux – The Operating System: Linux history. The Ext2 and Ext3 File systems :General Characteristics of.

3. 2009.e. Ellen Siever. “Linux Administrator Handbook”. SAMS. “The Design of the Unix Kernel”. 2nd Ed. Cox K. Mark G. Linux”. 7th Ed. “Linux in a Nutshell”. academic session 2010-11 .. 2007... 7.. Robert Love. Trent R. W. Bach. 6th Ed. Yashwant Kanetkar .REFERENCES: 1. 2nd Ed.. “A Practical Guide to Ubuntu Linux”. Garth Snyer. PHI. Sobell. PHI. Tammy Fox. 2008. 2000. 2nd Ed. 9. Syllabus of Master of Computer Applications (MCA). 3rd Ed. O'Reilly Media. “Introduction to Unix. Pearson.f. 2001. Richard Stones. Hein... Peterson Richard. 2007.O'Reilly Media. BPB. “Beginning Linux Programming”.0 Administrator Unleashed”. “Unix Shell Programming”. 4. “Linux System Programming” . 2. 6. Tata McGraw Hill. 2004. Evi Nemeth. approved by MCA Coordination Committee on 7th May 2010 & Sub-Committee Academic Council held on 31st May 2010. 5. 2007. Robert Love. Pearson 3rd Ed. Arnold Robbins. “Red Hat Linux Administrator’s Guide”.2009. 8. Stephen Figgins. Pearson. “The Complete References Linux”. Christopher Diaz. 2000. Alan Cox. Neil Matthew. 2nd Ed. 10. 11. “Red Hat Enterprise Linux 5.

PRE-REQUISITE: • Software Engineering Concepts UNIT . Apart from Question No. Failure. the profession and the wider community.: 08] UNIT . [No. [No.: 12] UNIT . V Shaped Software Life Cycle Model. Validity Checks: Strategy for Data Validity.Code No.I Introduction: What is software testing and why it is so hard?. OBJECTIVE: At the end of this course the student will be able to: • Appreciate the fundamentals of software testing and its application through the software life cycle. Prioritization guidelines. Structural Testing: Identification of Independent Paths: Control Flow Graph. Cause Effect Graphing Technique. academic session 2010-11 . Code Coverage Techniques for Prioritization of Test Cases. W. Risk Analysis. of Hrs. • Develop skills in designing and executing software tests suitable for different stages in the software life cycle. and obtain satisfaction from its study and practice. Verification Testing: Verification Methods. There should be 10 questions of short answer type of 2 marks each. Some Software Failures.f. Minimization. Database testing. Graph Matrix. [No. Prioritization of test cases for Regression Testing: Regression Testing. DD-Paths. rest of the paper shall consist of four units as per the syllabus. Testing Process. Software Design Document Verification. • Develop a continuing interest in software testing. Error. Cyclomatic Complexity. Limitations of Testing. Generation of Test Cases from Use Cases. having at least 2 questions from each unit. of Hrs. User Documentation Verification. Slice Based Testing. Applicability. Control Flow Testing. • Appreciate the responsibilities of software testers within software projects. Mutation testing. 1. Software Project Audits. Levels of Testing. However. Overview of Graph Theory. MCA 303 Paper: Software Testing LTC 31 4 INSTRUCTIONS TO PAPER SETTERS: 1. Code Reviews. if any. deployment and maintenance.IV Testing Activities: Unit Testing. approved by MCA Coordination Committee on 7th May 2010 & Sub-Committee Academic Council held on 31st May 2010. Question No. Test Cases.e. 1 should be compulsory and cover the entire syllabus. Decision Table Based Testing.: 10] UNIT . Integration Testing. Priority category Scheme. Each question should be 10 marks including subparts. System Testing. Incident. Equivalence Class Testing. No absolute proof of correctness. Every unit should have two questions to evaluate analytical/technical skills of candidate. • Understand and appreciate the role of software testing in systems development.III Use Case Testing: Use Case Diagrams and Use Cases. Guidelines for Generating Validity Checks. Data Flow Testing. 2. Regression Test Case Selection. Fault. Selection. of Hrs.II Functional Testing: Boundary Value Analysis. SRS Verification. Debugging Syllabus of Master of Computer Applications (MCA). student may be asked to attempt only 1 question from each unit.

“Zero Defect Software”.e. . Roger S. academic session 2010-11 . 1990. Van Nostrand Reinhold. “Software Testing”. “Software Testing Techniques”.f. 1994. Pearson. 3rd Ed. 9. New Delhi. “Software Engineering – A Practitioner’s Approach”. Jorgenson.. “Software Engineering”. 2003. Van Nostrand Reinhold. 7. Second Volume. What should we measure during testing?. K. Gordon Schulmeyer. [No. “Effective Methods for Software Testing”. New York. categories of Metrics. PHI. New York. approved by MCA Coordination Committee on 7th May 2010 & Sub-Committee Academic Council held on 31st May 2010. 3. 2nd Ed. “Software System Testing and Quality Assurance”. New York. Fault Prediction Model. 5th Ed.: 12] TEXT BOOKS: 1. New York. John Wiley & Sons Inc. ISTQB Certification”. McGraw-Hill Book Co. 8th Ed.. Paul C. New York. Boris Beizer. of Hrs. “Managing the Software Process”. 8. 1990. Jack Falk. 1984. 11. 1989. 2002. McGraw-Hill International Edition.. New York. New Delhi. Nguyen Quoc. 1979. K. 1995. Addison Wesley Pub. London. New York. Van Nostrand Reinhold. Software Quality Attributes. Path testing. “Software Testing”. 2. McGraw-Hill.Object Oriented Testing: Issues in Object Oriented Testing. REFERENCES: 1. Class Testing. Van Nostrand Reinhold. 4. Cem Kaner. Metrics and Models in Software Testing: What are Software Metrics.. Pearson Education Asia. 2008. 2001. 1997. “Testing Computer Software”. CRC Press. 6. Louise Tamres. John Wiley & Sons Inc. Inc. Dorothy Graham. Co. Aggarwal & Yogesh Singh. “Black-Box Testing – Techniques for Functional Testing of Software and Systems”. Mathur. 2009. Syllabus of Master of Computer Applications (MCA). object Oriented Metrics used in testing. 4. 2nd Ed. 1995. 5. 5. “Foundation of Software Testing. New Age International Publishers. 2003. Elfriede Dustin. Erik Van Veenendaal. 2nd Ed. Watts Humphrey... John Wiley & Sons. W. Prediction Model: Reliability Modes. Glenford Myers. “The Art of Software Testing”. William Perry. “Foundation of Software Testing”.. Software Testing A Craftsman’s approach.. . 1993. “Effective Software Testing: 50 Specific ways to improve your Testing”. Boris Beizer. Aditya P. Object Oriented Integration and System Testing. 2. New York. Marc Roper. Isabel Evans and Rex Black. Pressman. 10. state based testing. 3.. Massachusetts. Pearson.. Boris Beizer.

3.: MCA 305 Paper: Enterprise Computing in Java LTC 3 1 4 INSTRUCTIONS TO PAPER SETTERS: 1. Cambridge University Publications.3 Ed. of Hrs. Govind Seshadri. Apress. student may be asked to attempt only 1 question from each unit. Govind Sesadri . “Enterprise Java Computing: Application and Architectures”. : 12 Hrs] UNIT III EJB fundamentals: Motivation for EJB. academic session 2010-11 . Subrahamanyam Allamaraju. Wiley. [No. 1999. PRE-REQUISITES: • Core JAVA UNIT I Introduction to J2EE and building J2EE applications. : 10 Hrs] TEXT BOOKS: 1. 1 should be compulsory and cover the entire syllabus. 1. Introducing Entity beans: persistence concepts. Every unit should have two questions to evaluate analytical/technical skills of candidate. OBJECTIVE: In this course student will learn about J2EE technology and will be able to develop dynamic websites. standard actions. EJB Echo system. approved by MCA Coordination Committee on 7th May 2010 & Sub-Committee Academic Council held on 31st May 2010. John Hunt and Chris Loftus. Enterprise beans and types. Apart from Question No. “Mastering Enterprise Java Beans”. remote local and home interface. Shroff . 1. Ivan Bayross and Sharanam Shah. Question No. : 10 Hrs] UNIT II JSP Basics and Architecture: JSP directives. Tyler Jewell. rest of the paper shall consist of four units as per the syllabus. Cedric Buest. servlet configuration. Introduction to servlets and it’s life cycle .e. distributed objects and middleware. Ed Roman. Each question should be 10 marks including subparts. 2005. advantages and application of Struts. of Hrs. “Enterprise Java Computing: Application and Architectures”. developing EJB components. of Hrs. [No. 2. “Guide to J2EE: Enterprise Java” Springer Verlag Publications. “Professional Java Server Programming.f. This course will explain how Enterprise JavaBeans (EJBs) contain the application's business logic and business data. 4. [No. of Hrs. implicit objects. However. Cambridge University Press. J2EE. 1999. statefull and Stateless session beans beans. Introduction to JMS & Message driven beans. servlet colloboration. features of entitiy beans . There should be 10 questions of short answer type of 2 marks each.. bean class and deployment descriptor. J2EE technologies. MVC architecture. 5. various session tracking techniques. [No. Syllabus of Master of Computer Applications (MCA). 3.Code No. Scripting elements. 2005. W. problems with cgi-perl interface . servlet configuration. if any. Struts: Introduction of Struts and its architecture. 2. having at least 2 questions from each unit. generic and http servlet . 2nd Ed. jsp design strategies. servlet context.. “Java Server Programming” . lifecycle of session beans. entity context.: 10 Hrs] UNIT IV Introducing session beans: Session beans life time. Scott W Ambler.

f. “Enterprise Java for SAP” . W. Syllabus of Master of Computer Applications (MCA). Eddison -Wesley. O’Reilly and Associates.REFERENECES: 1. Ted Neward. 3rd Ed. Thomson. “Effective Enterprise Java”. 2004. 2003. William Crawford. A Press Publications. “ Java Enterprise in a Nutshell”.e. Austin Sincock . 3. 2 Jim Farley. 4. “Java Programming: Advanced Topic”.. approved by MCA Coordination Committee on 7th May 2010 & Sub-Committee Academic Council held on 31st May 2010. Joe Wigglesworth and McMilan Paula. academic session 2010-11 . 3rd Ed.

having at least 2 questions from each unit. models and mapping normalization and denormalization.: 10] UNIT -II Design Process: Design process. components. modeling process. data replication. MCA 307 Paper: Advanced Database Management System L T C 3 1 4 INSTRUCTIONS TO PAPER SETTERS: 1. design principles. Data warehousing. SQL server and Oracle sever tuning. Every unit should have two questions to evaluate analytical/technical skills of candidate.. data fragmentation. object oriented model. However. 2. “Introduction to Database Systems”. Each question should be 10 marks including subparts. W. OLAP and data mining. academic session 2010-11 .: 12] TEXT BOOKS: 1. Question No. Oracle & SQL Server Documentation. Warrington . Morgan Kaufman. This course also provides the conceptual background necessary to design and develop distributed database system for real life applications. Principles. recovery management. approved by MCA Coordination Committee on 7th May 2010 & Sub-Committee Academic Council held on 31st May 2010. Date. 2. L. Morgan Kaufman. [No. of Hrs. Oracle server tuning. if any. J. AWL. levels of data & process distribution. 1 should be compulsory and cover the entire syllabus.e. [No. JDBC and JSQL overview. transaction and concurrency control. 08] UNIT-IV Distributed Database Management Systems. normalization. of Hrs. DB2. design evaluation. Tewrey. Syllabus of Master of Computer Applications (MCA). of Hrs. There should be 10 questions of short answer type of 2 marks each. student may be asked to attempt only 1 question from each unit. E-R model. of Hrs. relational algebra and relational calculus. C. REFERENCES: 1. OBJECTIVES: This course is an attempt to provide you with the advanced information about database management system and their development. transparency features. PRE-REQUISITE: • Centralized Database Management System Concepts UNIT -I Review of traditional DBMS’s. Client Server Systems.: 12] UNIT -III Architecture: Architecture of SQL server. and semantic data model. “Database Modeling and Design”. rest of the paper shall consist of four units as per the syllabus. [No. 1. J. OS tuning (Microsoft OS’s).f. J. T. [No. Components. Apart from Question No. “Object Oriented Database Design”. ADO. 3.Code No. SQL server tuning. ODBC.

approved by MCA Coordination Committee on 7th May 2010 & Sub-Committee Academic Council held on 31st May 2010.e.f. W.Syllabus of Master of Computer Applications (MCA). academic session 2010-11 .

of Hrs. Boundary value problems: Finite Difference method. Parameter Estimation: method of Moments.II Systems of Linear equations:Solutions of systems of Linear equations. rest of the paper shall consist of four units as per the syllabus. exponential curves etc. 1 should be compulsory and cover the entire syllabus. Question No. Taylor’s series method. Weddle’s Rule. smoothening of curves.Code No. Linear and Non-linear regression. we shall often integrate a discussion of the properties of engineering and physical problems with the discussion of methods by which such problems may be solved numerically. Approximation of function by Taylor’s series and Chebyshev polynomial. Rate of convergence of Iterative methods. Variance. Hermite’s Interpolation. Ill Conditioned system of equations. approved by MCA Coordination Committee on 7th May 2010 & Sub-Committee Academic Council held on 31st May 2010. Difference of Means. of Hrs.f. This approach is more “natural” and more like the one students actually follow when applying numerical methods within their areas of interest. PRE-REQUISITE: • Basic of Mathematics UNIT . Euler’s Method.e. Automatic error monitoring. student may be asked to attempt only 1 question from each unit. if any. LU-decomposition method. Normalization. 2. Polynomial Interpolation: Newton’s forward and backward formula. polynomials. Newton-Raphson method. Romberg’s integration. Newton Divided difference method. Gauss quadrature formulas. Apart from Question No. W. Multiple regression. [No.: 10] UNIT .. Moving averages. Pitfalls of floating point representation. fitting of straight lines. Simpson’s rules. Every unit should have two questions to evaluate analytical/technical skills of candidate. 1. However. Methods for finding complex roots. and Proportions. Boole’s Rule. Gauss Elimination: Direct method and pivoting.Numerical Solution of Ordinary Differential Equations: Picard’s Method. Rather than a pure discussion and analysis of methods. Interpolation and Approximation:Langrange’s Interpolation.IV Method of least squares. Numerical Integration: Trapezoidal rule. [No. RungeKutta (RK) methods: second and fourth order RK methods. academic session 2010-11 . [No.I Floating Point Arithmetic: Representation of floating point numbers: Operations. Each question should be 10 marks including subparts. OBJECTIVES: This course responds to the needs of the engineering and physical sciences curricula by providing an applications-oriented introduction to numerical methods/analysis. Central Difference Formulae: Gauss forward and backward formula. Rate of Convergence of Gaus Seidal method. having at least 2 questions from each unit. Gauss Seidal iterative method. stability of solution. . Regula-Falsi method. Everett’s formula. Modified Euler’s method.: 12] UNIT . Refinement of solutions.III Numerical Differentiation and Integration:Introduction to Numerical Differentiation. There should be 10 questions of short answer type of 2 marks each. Sampling distributions: Mean. Finite Differences.: 10] UNIT . Errors in numerical computation. of Hrs. Random Sampling. Solution of Transcendental and Polynomial Equations: Zeros of a single transcendental equation and zeros of a polynomial using Bisection Method. Maximu m Syllabus of Master of Computer Applications (MCA). MCA 309 Paper: Numerical and Scientific Computing L T C 3 1 4 INSTRUCTIONS TO PAPER SETTERS: 1. Iteration Method.

New Age Int. Jain. 3.e. Curtis F. Cheney. Pradip Niyogi.. academic session 2010-11 . TMH. Kincaid and W.: 10] TEXT BOOKS: 1. T Ramachandran.f. Iyengar and Jain. “ Applied Numerical Analyses” . Veerarajan. “Numerical Analysis” . Kincaid and W. Wheatley. “Numerical Analysis: Mathematics of Scientific Computing”. Prientice Hall. 2002. 5. of Hrs. [No. Khanna Publishers. approved by MCA Coordination Committee on 7th May 2010 & Sub-Committee Academic Council held on 31st May 2010. Interval Estimation. Syllabus of Master of Computer Applications (MCA).. 1984. 2. Proportions. D. 2. “Numerical Methods for Scientific and Engineering Computations ”.Likelihood Estimation. Gerald and Patrick O. Cheney. TMH. Chi-square Test for best fit. 3. Hypothesis Testing: Mean. 4. Delhi. T. Thomson/Brooks-Cole. “Numerical Analysis and Algorithms”. Francis Scheld. REFERENCES: 1. S. W. “Theory and Problems in Numerical Methods”. 1991. Difference of Means. Variance. Grewal B. “Numerical Analysis”. D. TMH. “Numerical methods in Engineering and Science”. Thomson/Brooks Cole.

W. Performance Reporting. having at least 2 questions from each unit. of Hrs. of Hrs. Risk Response Development and Control. COCOMO).: MCA 311 Paper: Software Project Management L TC 3 1 4 INSTRUCTIONS TO PAPER SETTERS: 1.IV Project Risk Management: Common Sources of Risk in IT projects. Every unit should have two questions to evaluate analytical/technical skills of candidate. Project Human Resource Management: Definition.: 10] UNIT . Apart from Question No.Code No. Project Cost Management: Resource planning. Solicitation. [No. Critical path Analysis. which show how a project can be monitored. Issues in Project Staff Acquisition and Team Development. 2. Estimation by Analogy. PRE-REQUISITE: • Software Engineering Concepts • Academic Project UNIT . Basic measurements are presented with examples from real-world projects. rest of the paper shall consist of four units as per the syllabus. 1. Source Selection. PERT. Use of Software (Microsoft Project) to Assist in Project Planning Activities. The analysis of project characteristics in order to select the best general approach. Question No. Risk Quantification.II Project Scheduling: Time Management.III Project Quality Management: Stages.f. However. OBJECTIVE: Software Project Management provides insight to the importance of careful project management. Defining effective project objectives where there are multiple stakeholders.I Introduction: Introduction to software project management and control Whether software projects are different from other types of projects. Each question should be 10 marks including subparts. Organization Planning. student may be asked to attempt only 1 question from each unit. Plan Execution. Scope Management. Topics are presented in the same order that they appear in the progression of actual projects and covers the following concepts. Contract Administration. Software Tools for Project Management.e. Communication Planning. [No. Project Network Diagram. Project Planning: Creation of a project plan -step by step approach. The management of project life cycle.: 12] UNIT . if any. Project Procurement Management: Procurement Planning. Expert Judgment. of Hrs. The course will introduce and develop the concepts that are seen as central to the effective management of software projects. Key to managing People. academic session 2010-11 . Syllabus of Master of Computer Applications (MCA). The scope of project management. Cost Estimation (Types. Using Software to Assist in Human Resource Management. Quality Planning.: 10] UNIT . Quality Control. Use of Software (Microsoft Project) to Assist in Project Scheduling. 1 should be compulsory and cover the entire syllabus. Information Distribution. There should be 10 questions of short answer type of 2 marks each. controlled and assessed. Quality Assurance. [No. approved by MCA Coordination Committee on 7th May 2010 & Sub-Committee Academic Council held on 31st May 2010. Tools and Techniques for Quality Control. Risk Identification. Quality Standards.

PHI.A. 2003. “ Software Project Management in Practice”. Maylor.. Futrell. Elaine Marmel. Wiley Publishing Inc. Mike Cotterell. . approved by MCA Coordination Committee on 7th May 2010 & Sub-Committee Academic Council held on 31st May 2010.A Concise Study”. Sharp H.e.. Kathy Schwalbe . 2. AddisonWesley. . “ Peopleware: Productive Projects and Teams”. 1993.. Pearson Education. [No. Bentley C. “Software Project Management . 3rd Ed. Robert T. McGraw-Hill. 3rd Ed. J. and Woodman M. Futrell.“Information Technology Project Management. 8. 4. 2002. 3. 2010. 2003. S. 3rd Ed. Henry. and Lister T. Pearson. . 2002. .. 2nd Ed.. 4. “Software Project Management – A Real-World Guide to Success”. “Project Management”. 2. 2004. 3. 5. Project Controlling and Configuration Management.: 10] TEXT BOOKS: 1. REFERECES: 1. Syllabus of Master of Computer Applications (MCA).1999. 6. PHI. THOMSON Course Technology.. “Software Project Management” Tata McGraw-Hill. Robert T. 2010. Dorset House. Pearson. “PRINCE2: A Practical Handbook”. 2010. Demarco T. of Hrs.Introduction to Project Management Process Groups. “Quality Software Project Management”. Pankaj Jalote. academic session 2010-11 . H. “Microsoft Office Project 2003 Bible”. ” International Student Edition. “Quality Software Project Management”. W. Revised Edition.f. Kelkar. Bob Hughes. Ince D. NCC Blackwell. 7. “Introduction to Software Project Management and Quality Assurance”.

Tools for the WWW – Web Servers.: 08] TEXT BOOKS: 1. Digital Broadcasting. Assembling and delivering a project-planning and costing. Multimedia software and Authoring tools. [No. Tay Vaughan. Digitization of Audio and Video objects. There should be 10 questions of short answer type of 2 marks each.Code No. Working Exposure on Tools like MAYA. • To study the graphics techniques and algorithms. Internet working. OBJECTIVES: As technology advances and hardware and software improves. CD-ROM technology. 1999. PHI. 2. of Hrs.: 08] UNIT – IV Multimedia-looking towards Future: Digital Communication and New Media. Images. Apart from Question No. 1 should be compulsory and cover the entire syllabus. “Multimedia: Making it work”.f. 3. Multimedia-Hardware and Software: Multimedia Hardware – Macintosh and Windows production Platforms. • To enable the students to develop their creativity PRE-REQUISITE: • Multimedia Application UNIT – I Introductory Concepts: Multimedia – Definitions. Thakkar. Uses of Multimedia. audio. [No. Delivering. Hardware peripherals – Connections. K. it becomes much more feasible to integrate multimedia directly into classroom activities and the core curriculum. Sound. Andleigh and K. Understanding why. W. “Multimedia & Communication Systems”.: 10] UNIT – II Multimedia – making it work – multimedia building blocks – Text. TMH. Focal Press. Web page makers and editors. Designing for Multimedia Applications – Media Communication. The World Wide Web. • To study the multimedia concepts and various I/O technologies. Syllabus of Master of Computer Applications (MCA). Each question should be 10 marks including subparts. having at least 2 questions from each unit. making instant multimedia. PTR. 1999. and where multimedia is appropriate and beneficial is the first step toward successful implementation. Designing and Producing. approved by MCA Coordination Committee on 7th May 2010 & Sub-Committee Academic Council held on 31st May 2010. if any. Multimedia Conferencing. video and images etc. Internet Services. the requirements to make good multimedia. Every unit should have two questions to evaluate analytical/technical skills of candidate. CD-ROM and the Multimedia Highway.e. Steve Heath. Plug-Ins and Delivery Vehicles. content and talent. Training opportunities in Multimedia. academic session 2010-11 . [No.. [No. Introduction to making multimedia – The Stages of project. student may be asked to attempt only 1 question from each unit. of Hrs. Multimedia skills and training. VRML. Animation and Video. Memory and storage devices.: 16] UNIT – III Multimedia and the Internet: History. However. UK. of Hrs. rest of the paper shall consist of four units as per the syllabus. Web Browsers. 1. MCA 313 Paper: Multimedia Technologies LTC 3 1 4 INSTRUCTIONS TO PAPER SETTERS: 1. 2000. Data Compression: Different algorithms concern to text. “Multimedia System Design”. when. of Hrs. Media software – Basic tools. Question No. Digital Radio. Connections. Interactive Television. 2.

Steve Rimmer. 2. Syllabus of Master of Computer Applications (MCA). 3. Communications & Applications”.REFERENCES: 1. Ze-Nian Li. “Multimedia: Computing. PHI. 4. 2000. Ralf Steinmetz and Klara Naharstedt. “Multimedia Handbook”. Pearson. approved by MCA Coordination Committee on 7th May 2010 & Sub-Committee Academic Council held on 31st May 2010.f. TMH. academic session 2010-11 . “Advanced Multimedia Programming”. 2010. W. Keyes. 2000. and Mark S. “Fundamentals of Multimedia”. 2001.e. Drew. PHI.

IV Transaction management: Introduction. network protocols. Shambhu Upadhyaya. Wireless Multiple Access protocols . Comparison of TCP wireless. rest of the paper shall consist of four units as per the syllabus. and security.: 10] UNIT . Security fault tolerance for mobile N/W. Apart from Question No. information management. Frequency Reuse. Propagation Models for Wireless Networks. Multipart Effects in Mobile Communication. Third Generation 3G Wireless Networks. 2. having at least 2 questions from each unit. applications/services. All-IP Network: Vision for 4GIssues in Mobile computing. Propagation Models Description of Cellular system. Students will learn the principles of Mobile Computing and its enabling technologies. of Hrs. OBJECTIVE: This course will cover a broad selection of topics in data communications. There should be 10 questions of short answer type of 2 marks each. Second Generation (2G) Wireless Cellular Networks. 1. Every unit should have two questions to evaluate analytical/technical skills of candidate. of Hrs. user interfaces. “Mobile Communications”. “Mobile Syllabus of Master of Computer Applications (MCA). [No. 1 should be compulsory and cover the entire syllabus. if any.e. 2. PRE-REQUISITE: • Operating Systems • Networking • Distributed Computing. Mobile transaction processing.Mark Weises. Co channel and Adjacent channel interference. basic concept of multihopping. Automatically Locating Mobile Users. distributed computing. Models for Multipart Reception Evolution of Modern Mobile Wireless Communication System . Major 2G standards. Question No.5G Wireless Networks. of Hrs. academic session 2010-11 . and paradigm shifts.f. solutions. Location Based Services . Pearson.: 10] UNIT – III Location Management: Introduction. approved by MCA Coordination Committee on 7th May 2010 & Sub-Committee Academic Council held on 31st May 2010. [No. data replication Schemes . [No.: 10] TEXT BOOKS: 1. MCA 315 Paper: Mobile Computing L T C 3 1 4 INSTRUCTIONS TO PAPER SETTERS: 1. Wireless Local Area Networks (WLANs). Schiller. Cache Consistency. of Hrs. resource management. • Programming skill in C/C++ UNIT . 2. Data Dissemination.I Cellular Mobile Wireless Networks: Systems and Design Fundamentals. Keviven Kwiat.First Generation Wireless Networks. Abhjeet Chaudhary. Each question should be 10 marks including subparts.: 12] UNIT – II Data management issues: mobility. Adaptive Clustering for mobile Network .Code No. However. mobile IP. channel Allocation. student may be asked to attempt only 1 question from each unit. Is Use and future directions. mobile database research directions. Multicluster Architecture. wireless communication and portability. W. and explore a young but rich body of exciting ideas. Locating and Organizing Services. [No.

Martin-S-Nickious. “Mobile Computing. UIWE Hansmann. Pearson. “Principles of Mobile computing”. Biplab K.e. TMH. PHI. Springer international Edition. Kliuwer Acadmic Publishers.Computing”. Thomas Stohe. Syllabus of Master of Computer Applications (MCA). C. “Mobile Computing”. academic session 2010-11 . Kumkum Garg. K. approved by MCA Coordination Committee on 7th May 2010 & Sub-Committee Academic Council held on 31st May 2010. 2009. W. 3. TOH . Sikdar. Other Merk . Sipra DasBit. REFERENCES: 1. 3. “Mobile Adhoc Networks”.f. 2.

Code No. MCA 317 Paper: Artificial Intelligence

L T C 3 1 4

INSTRUCTIONS TO PAPER SETTERS: 1. Question No. 1 should be compulsory and cover the entire syllabus. There should be 10 questions of short answer type of 2 marks each, having at least 2 questions from each unit. 2. Apart from Question No. 1, rest of the paper shall consist of four units as per the syllabus. Every unit should have two questions to evaluate analytical/technical skills of candidate. However, student may be asked to attempt only 1 question from each unit. Each question should be 10 marks including subparts, if any.

OBJECTIVE:This course covers the issues and techniques involved in the creation of computer systems that engage in intelligent behaviour. Students will explore problem-solving paradigms, logic and theorem proving, search and control methods, and learning. Learning outcome of this course is • Introducing students to the basic concepts and techniques of Artificial Intelligence. • Learning AI by doing it, i.e. developing skills of using AI algorithms for solving Practical problems. PRE-REQUISITES: • Discrete Mathematic

Analysis of Algorithms

UNIT- I Intelligent Agents – Agents and environments - Good behavior – The nature of environments – structure of agents - Problem Solving - problem solving agents – exa mple problems – searching for solutions – uniformed search strategies - avoiding repeated states – searching with partial information. [No. of Hrs.: 10] UNIT- II Informed search and exploration – Informed search strategies – heuristic function – local search algorithms and optimistic problems – local search in continuous spaces – online search agents and unknown environments - Constraint satisfaction problems (CSP ) – Backtracking search and Local search for CSP – Structure of problems - Adversarial Search – Ga mes – Optimal decisions in games – Alpha – Beta Pruning – imperfect real-time decision – games that include an elemen t of chance. [No. of Hrs.: 12] UNIT- III First order logic – representation revisited – Syntax and semantics for first order logic – Using first order logic – Knowledge engineering in first order logic - Inference in First order logic – prepositional versus first order logic – unification and lifting – forward chaining – backward chaining - Resolution – Knowledge representation - Ontological Engineering - Categories and objects – Actions - Simu lation and events - Mental events and mental objects. [No. of Hrs.: 10] UNIT -IV Learning from observations - forms of learning - Inductive learning - Learn ing decision trees Ensemble learning - Knowledge in learning – Logical formulation of learning – Explanation base learning – Learn ing using relevant information – Inductive logic programming – Statis ical learning methods - Learn ing with complete data - Learn ing with hidden variable - EM algorithm – Insta ce based learning - Neural networks - Reinforcement learning – Passive reinforcement learning - Active r inforcement learning - Generalization in reinforcement learning.
Syllabus of Master of Computer Applications (MCA), approved by MCA Coordination Committee on 7th May 2010 & Sub-Committee Academic Council held on 31st May 2010. W.e.f. academic session 2010-11

[No. of Hrs.: 10]

TEXT BOOK: 1. Stuart Russell, Peter Norvig, “Artificial Intelligence – A Modern Approach ”, Pearson, 2nd Ed. 2. D. W. Paterson, “Introduction to Artificial Intelligence and Expert System”, PHI, 2009. 3. George F. Luger, “Artificial Intelligence- Structures and Strategies For Complex Problem Solving”, Pearson Education, 5th Ed., 2010. 4. Elaine Rich and Kevin Knight, “Artificial Intelligence ”, Tata McGraw-Hill. 5. Michel Negneritsky, “Artificial Intelligence: A Guide to Intelligent System”, Addison Wesley, 2nd Ed. REFERENCES: 1. Nils J. Nilsson, “Artificial Intelligence: A new Synthesis ”, Narosa. 2. R. J. Schalloff, “Artificial Intelligence –An Engineering Approach”, McGraw Hills, International Ed. , Singapore,1992. 3. M. Savi Kumar, S. Ramani, “Rule Base Expert System”, Narosa Publishing House. 4. Rejendra Akerkar, “Introduction to Artificial Intelligence”, PHI, 4th Ed., 2009. 5. Joseph C. Giarratano, Gary D. Riley, “Expert System Principles and Programming”, Cengage Learning, 3rd Ed., 2009.

Syllabus of Master of Computer Applications (MCA), approved by MCA Coordination Committee on 7th May 2010 & Sub-Committee Academic Council held on 31st May 2010. W.e.f. academic session 2010-11

Code No. MCA 319 Paper: Microprocessors

LTC 3 1 4

INSTRUCTIONS TO PAPER SETTERS: 1. Question No. 1 should be compulsory and cover the entire syllabus. There should be 10 questions of short answer type of 2 marks each, having at least 2 questions from each unit. 2. Apart from Question No. 1, rest of the paper shall consist of four units as per the syllabus. Every unit should have two questions to evaluate analytical/technical skills of candidate. However, student may be asked to attempt only 1 question from each unit. Each question should be 10 marks including subparts, if any.

OBJECTIVE:The objective of this course is to introduce students to features and technology of microprocessor systems. Gain experience in assembly language programming of microproessor peripherals and interrupt service routines, as well as data processing tasks.At the end of the course the student should: • Know basics of microprocessor-based Systems. • Know basics of assembly language. • Know the process of compilation from high level language to assembly language to machine language. • Know interaction between hardware and software, i.e. `interfacing'. PRE-REQUISITE: • Digital Systems Fundamentals • Assembly Language Programming • Electronics UNIT – I Computer Number Systems, Codes, and Digital Devices: Computer Number Systems and Codes, Microprocessor Evolution and Types, the 8086 microprocessor family-overview, 8086 internal architecture, introduction to programming the 8086, addressing modes of 8086.8086 Family Assembly Language Programming: Program Development Steps, Constructing the machine codes for 8086 instructions, writing programs for use with an assembler, assembly language program development tools. [No. of Hrs.: 10] UNIT – II Implementing Standard Program Structures in 8086 Assembly Language: Simple Sequence Programs, Jumps, Flags, and Conditional Jumps, If-Then, if-then-else, and multiple if-then else programs, while-do programs, while-do programs, repeat-until programs, instruction timing and delay loops Strings, Procedures, and macros: the 8086 string instructions, writing and using procedures, writing and using assembler macros 8086 Instruction Descriptions and Assembler Directives. [No. of Hrs.: 11] UNIT – III 8086 System Connections, Timing, and Troubleshooting: A basic 8086 microcomputer System, An example Minimum-mode System, the SDK-86, Troubleshooting a simple 8086- based microcomputer, Timing Diagrams 8086 Interrupts and Interrupt Applications: 8086 interrupts and Interrupt Responses, Hardware Interrupt Applications. [No. of Hrs.: 11] UNIT – IV Interfacing 8086 with 8255, 8254, 8259, 8253, 8251, 8259, 8279. Brief Introduction to Architecture of 80186, 80286, 80386, 80486, 8087 and Pentium architecture.
Syllabus of Master of Computer Applications (MCA), approved by MCA Coordination Committee on 7th May 2010 & Sub-Committee Academic Council held on 31st May 2010. W.e.f. academic session 2010-11

Orlando Karan. Frank Tsui. 4th Ed. Walter A.e. academic session 2010-11 .. 4. 3. “Programming Interfacing Software Hardware and Applications”. Pearson. John Uffenbeck. Pearson. “Essentials of Software Engineering”. “The 8086 / 8088 Family Design Programming and Interfacing”. Barry B. REFERENCES: 1. 2009. Programming and Interfacing”. 2009. 1999 2. Triebel. 1999. V. “IBM PC Assembly Language Programming”. “An Introduction to the Intel Family of Microprocessors”. Hall. James. 2. 8th Ed. approved by MCA Coordination Committee on 7th May 2010 & Sub-Committee Academic Council held on 31st May 2010. 1994. Programming & Design”. Antonaks.. 1999. Jones and Bartletts. W. 5. Liu Gibson. Peter Able.[No. PHI.. 2010. 2nd Ed. L. 2nd.f. of Hrs. Ed. TMH. Syllabus of Master of Computer Applications (MCA). “Microprocessors and Interfacing”. Avtar Singh. PHI. “The Intel Microproccessors Architecture. D.. 2009.: 10] TEXT BOOKS: 1. 3. Addison Wesley. PHI. “Microprocessor Systems: The 8086/8088 Family Architecture.

PRE-REQUISITES • Programming Language • Theory of Computation • Design and Analysis of Algorithms • Computer Organization UNIT . W.e. 1. Boolean expressions and procedure calls. of Hrs. student may be asked to attempt only 1 question from each unit. error reporting and implementation. top down parsing. design of a typical scanner using LEX or Flex. Apart from Question No.f.and S-attributed definitions. academic session 2010-11 . LR). Every unit should have two questions to evaluate analytical/technical skills of candidate. ambiguity. dependency graph. dynamic storage allocation. • To develop Skills to use Tools like Lex and YACC in writing scanners and parsers. overloaded function and operators. assignments. Bottom up parsing. Each question should be 10 marks including subparts. structural and name equivalence of types. transformation on the grammars. [No. associability. bottom up and top down evaluation of attributes.: 12] Syllabus of Master of Computer Applications (MCA). OBJECTIVES: This course develops the mathematical basis for syntax specification and translation and shows how this basis can be used to design and implement compilers? Learning outcomes of this course are: • To stimulate deeper learning of algorithms and data structures by practicing compiler writing algorithm. Intermediate Code generation for control flow. L. precedence. Nor LL(1) grammar. Question No. of Hrs.I Compiler Structure: Analysis-synthesis model of compilation. various phases of a compiler. However. LR parsers (SLR. approved by MCA Coordination Committee on 7th May 2010 & Sub-Committee Academic Council held on 31st May 2010.: 10] UNIT . type conversion.: 10] UNIT . activation record. [No. predictive parsing LL(1) grammar. Run time system: storage organization. lexeme and patterns. activation tree.II Syntax Analysis: Context free grammars. tool based approach to compiler construction. difficulties in lexical analysis. recursive descent parsing. of Hrs. translation of declarations. Type checking: type: type system.III Syntax directed definitions: Inherited and synthesized attributes. MCA 321 Paper: Compiler Design L T C 3 1 4 INSTRUCTIONS TO PAPER SETTERS: 1. [No. parameter passing symbol table. LALR. Design of a typical parser using YACCor Bison. Intermediate code generation: intermediate representation. Transition diagrams. implementation issues. top down parsing. Lexical analysis: Interface with input parser and symbol table. Regular grammar & language definition. • To develop a cross-compiler. operator precedence grammars. if any. rest of the paper shall consist of four units as per the syllabus. polymorphic function. evaluation order. type expressions.Code No. 2. There should be 10 questions of short answer type of 2 marks each. having at least 2 questions from each unit. 1 should be compulsory and cover the entire syllabus. token.

Holub. “Crafting a Compiler in C”. Principle and Practice”. 2005. C.“Compiler Design using FLEX and YACC”. basic blocks and flow graphs. specification of machine. 1998. peep hole optimization. DAG representation of programs. 3. Ravi Sethi and Jeffrey. “Compiler Construction. Elsevier. 2. 4.“Modern Compiler Implementation in C”. . “Principles of compiler Design”. loops. Code optimization: source of optimizations. REFERENCES: 1.2009.IV Code generation and instruction selection: Issues. Allen. code generation. V. Muchnick Harcourt Asra. “Engineering a Compiler”. S. Cambridge Uty. code generation from DAGS. Pearson. Alan I. “Compiler Design in C”.UNIT . Alfred V. Pearson 2005. Fisher. global dataflow analysis. code generator generators. solution to iterative dataflow equations. S. PHI. Levine. 1998. dealing with aliases.Raghvan. Cengage Publication 6th Ed. 3. register allocation. VinuV. Morgan Kaufman. Ullman.e. 2006. TMH. code improving transformations. 2009. academic session 2010-11 . Syllabus of Master of Computer Applications (MCA). optimization of basic blocks. of Hrs: 10] TEXT BOOKS: 1. Techniques and Tools”. W. “Lex & Yacc”. 2. data flow analysis of structured flow graphs. approved by MCA Coordination Committee on 7th May 2010 & Sub-Committee Academic Council held on 31st May 2010. PHI. 2005. Aho. 5. [No. K. Press 1997. 6.f. D. 2009. 4. “Advanced Compiler Design implementation”. Das. Cooper. Louden. Mason and Brown. O’ Reilly. “Compilers Priciples.

Overview of OR modeling. H. Maximal flow model. Critical path calculations. Hilier and Liebermann.. [No. MCA 323 Paper: Operational Research L T C 3 1 4 INSTRUCTIONS TO PAPER SETTERS: 1. Pollaczek-Khintchine formula. the dual Simplex method. [No. minimal spanning tree algorithm. [No. machine servicing model. sensitivity analysis. Determination of floats. Each question should be 10 marks including subparts. of Hrs: 10] TEXT BOOKS: 1. Apart from Question No. min-cut. 2009.f. 1 should be compulsory and cover the entire syllabus. Big M-method and Two-Phase simplex method. Johnson’s algorithm for processing n jobs on two machines and n jobs on three machines. Cost-Time analysis of projects : crashing activities in a project. Integer programming models. relationship between the primal and dual solutions. role of exponential distribution. Question No. Program Evaluation and Review Technique (PERT). PRE-REQUISITES: • Design and Analysis of Algorithms • Programming Language UNIT-I Introduction to operations research. if any. of Hrs: 11] UNIT-II JobSequencingModels:Sequencing problems.Code No.multiple-server models. 2. Linear Programming (LP): Assumptions of LP models. single server models . Duality: Definition of the dual problem. 1. approved by MCA Coordination Committee on 7th May 2010 & Sub-Committee Academic Council held on 31st May 2010. “Operations Research: An Introduction”. LP problem formulation. “Introduction to Operations Research”. The Simplex method. 8th Ed. However. OBJECTIVES: This course is to equip students with the ability of conceptualization of real life systems in the form of mathematical models. birth and death models. rest of the paper shall consist of four units as per the syllabus. of Hrs: 10] UNIT-IV Queuing systems. Every unit should have two questions to evaluate analytical/technical skills of candidate. queuing decision models.. academic session 2010-11 . 2. Elements of queuing model. Zero-sum Game. having at least 2 questions from each unit. 2009. Syllabus of Master of Computer Applications (MCA). PHI.e. Processing 2 jobs on n machines using graphical method. 8th Ed. Learning Outcome of this course are: • Understanding of Principles of model building and basic optimization concepts. Graphical methods for solving LP problems. W. There should be 10 questions of short answer type of 2 marks each. student may be asked to attempt only 1 question from each unit. Introduction to Game theory. Transportation and Assignment problems. [No. Taha. Multi criteria Decision making. min-cut Max-flow theorem. Cutting Plane method. of Hrs: 11] UNIT-III Project Scheduling by CPM/PERT: Designing an activity network. Branch and Bound method. Review of Network models. steady statemeasures of performance. McGraw-Hill. • To Develop skills to deploy these concepts indiverse fields of application in manufacturing /service/ distribution systems. and shortest route problems: Dijkstra’s algorithm. Economic interpretation of duality. maximal flow algorithm.

W. Cengage. Tamilarasi. 4.M. J. “Operations Research Models and Methods”.. “Operational Research Principles and Applications”. Balasubramani. 4th Ed. 2008. approved by MCA Coordination Committee on 7th May 2010 & Sub-Committee Academic Council held on 31st May 2010. G. Pearson.f.. Natarajan. John Wiley. REFERENCES: 1. “Operations Research: Applications and Algorithms”. Wayne Winston. 2. 2009. academic session 2010-11 . K. Syllabus of Master of Computer Applications (MCA). 4th Ed. “Operation Research Theory and Applications”.e. 3. A. Srinivasan. Macmillan. India.. 2009. 3rd Edition. Jensen. “Operational Research”. 2003. P. Sharma. 2nd Ed.3. Paul A. A. PHI.

PRE-REQUISITE • Database Management System • Distributed Systems UNIT – I Distributed DBMS features and needs. comparison reliability – non-blocking commitment protocols. loosely and tightly coupled. Node and link failure recoveries.. of Hrs. of Hrs. Distributed query optimization. [No. Pelagatti. W. M. 2. Storage mechanisms. Ceri. Partitioned networks. Distributed database administration.: 10] TEXT BOOKS: 1. Question No. Reference Architecture. distributed deadlocks. Architectural aspects. rest of the paper shall consist of four units as per the syllabus. Distributed query processing. academic session 2010-11 . Syllabus of Master of Computer Applications (MCA).f. 2009. Replication. Distributed data dictionary management. Temporal Databases. allocation criteria. Pearson. approved by MCA Coordination Committee on 7th May 2010 & Sub-Committee Academic Council held on 31st May 2010. of Hrs. OBJECTIV: An in-depth study of design and implementation issues in distributed database systems. McGraw Hill. Advance Database Concept: Object Oriented Databases Introduction. [No. Every unit should have two questions to evaluate analytical/technical skills of candidate. Deductive Databases. reference architecture. Tamer Ozsu. Distributed concurrency control. Apart from Question No.Code No. Distributed reliability protocols and Multidatabase systems.: 10] UNIT – IV Heterogeneous database-federated database.: 10] UNIT – III Management of Distributed Transactions – 2 phase unit protocols.e. of Hrs. operation – global task management. Levels of Distribution Transparency. Constructing an Application. together with a coverage of Database distribution architectures . 1 should be compulsory and cover the entire syllabus. Each question should be 10 marks including subparts. Query Execution and access plan. [No. “Distributed Database: Principles and Systems”. 2nd Ed. 1985. 1. Patrick Valduriez. G. Spatial Databases. Distributed transaction management. Translation of Global Queries / Global Query Optimization. [No. However. 2.Distributed database design. Multimedia Databases. Client server databases – SQL server. S. MCA 325 Paper: Distributed DBMS And Object Oriented Databases LTC 3 1 4 INSTRUCTIONS TO PAPER SETTERS: 1. There should be 10 questions of short answer type of 2 marks each. “Principles of Distributed Databases System”. Advantages and Disadvantages. time based and quorum based protocols. Development tasks. New York. Distributed database design – Fragmentation.: 12] UNIT – II Concurrency control – 2 phase locks. if any. student may be asked to attempt only 1 question from each unit. Check points and Cold starts. Alternative architectures. Open database connectivity. having at least 2 questions from each unit.

2001. 2.f. Syllabus of Master of Computer Applications (MCA). Jain. 2000. V. Kluwer Academic Publishes. 4.e. UK. Veeravalli Bhardwaj. Pearson. “ Distributed Database Management System”. 5. Shivendra Goel. 2009. Artech House. K. “Object Management is Distributed Database Systems”.REFERENCES: 1. Lin Wujuan. approved by MCA Coordination Committee on 7th May 2010 & Sub-Committee Academic Council held on 31st May 2010. “Advanced DBMS”. “Distributed Database System”. 2009. Chhanda Ray. 2003. Cyber Tech Publications. Sun India Publications. academic session 2010-11 . Mario Piattini. W. Divya Goel. 3. UK. “Advanced Database Technology and Design”.

Accounting and other Disciplines. Basic Features of Depreciation. Trial Balance Sub-Division of Journal: Cash Journal. Role of Accountant. Opening Entry Ledger Posting and Trial Balance: Ledger. Apart from Question No. • Preparation of Financial Statements. Rules Regarding Posting. There should be 10 questions of short answer type of 2 marks each. PRE-REQUISITE: • Mathematical Concepts UNIT . • Analyzing Financial Statements. Systems of Accounting Journalising Transactions: Journal. OBJECTIVE: Any organization that deals with money or money's worth needs to record every transaction that it enters into. Rectifying Accounting Entries. Every unit should have two questions to evaluate analytical/technical skills of candidate. After completing this course you will be conversant with: • Accounting Concepts. Effect on Profit [No. of Hrs: 12] UNIT – II Depreciation Provisions and Reserves: Concept of Depreciation. academic session 2010-11 . • Rules of Accounting. Methods of Recording and Providing Syllabus of Master of Computer Applications (MCA). right from scratch to preparation and analysis of financial statements. 2. Question No. • Accounting Equation. • Recording the transactions. in accordance with the 'learn by doing' approach. student may be asked to attempt only 1 question from each unit. Classification of Receipts Rectification of Errors: Classification of Errors. Causes of Depreciation. The courses in this product give a complete understanding. Location of Errors. Suspense Account. Fixation of Depreciation Amount. Rules of Debit and Credit. 1. W. rest of the paper shall consist of four units as per the syllabus. Systems of Book Keeping. Relationship between Journal and Ledger. Sales Journal. Each question should be 10 marks including subparts. Difference between Management Accounting and Financial Accounting Meaning of Accounting Principles: Accounting Concepts. Purchase Journal. if any.e. 1 should be compulsory and cover the entire syllabus. Book Keeping and Accounting. • Reconciling the books. Sales Return Journal Capital and Revenue: Classification of Income. Accounting Conventions. Th product is supplemented with a number of interactive exercises. Objectives of Providing Depreciation. MCA 327 Paper: Financial Accounting LTC 3 1 4 INSTRUCTIONS TO PAPER SETTERS: 1. Is Accounting Science or Art? End User of Accounting Information.Code No. Petty Cash Book.I Meaning and Scope of Accounting: Need for Accounting. • Adjusting & Rectifying the books. Posting. having at least 2 questions from each unit. approved by MCA Coordination Committee on 7th May 2010 & Sub-Committee Academic Council held on 31st May 2010. Definition and Functions of Accounting. Branches of Accounting. Compound Journal Entry. Classification of Expenditure. Meaning of Depreciation Accounting. Introduction to Accounting Standards.f. However.

L. K. “Financial Accounting”.e. New Delhi. S. of Hrs: 10] TEXT BOOKS: 1. Limitations of Ratio Analysis. C. 1988. L. 2009. Maheshwari & Dr. “Principles and Practice of Accountancy”. Profitability Ratios. Gupta. Sultan Chand. Maheshwari “Advanced Accountancy”. AS-6(Revised) Depreciation Accounting Final Accounts: Manufacturing Account.R. 6TH Ed. Vikas Publishing House. Methods of Valuation of Inventories Accounting Standard 2 (Revised): Valuation of Inventories Accounts of Non-profit Making Organizations: Receipts and Payments Account. S. “Principles of Financial & Management Accounting”. Charles Horngren. Advantages of Ratio Analysis. Of Hrs: 10] UNIT – IV Company Final Accounts: Familiarity with the requirements of Schedule VI to the Companies Act 1956. Ratio Analysis. Gupta & V. Turnover Ratios. 8th Ed.A Dynamic Approach.Analysis and Interpretation: Meaning and Types of Financial Statements. REFERENCES: 1. E. Classification of Ratios. Simple Adjustment Entries [No. “Management Accounting”. Nature of Financial Statements.Depreciation. 9. Dr. “Fundamentals of Management Accounting”. Inventory Systems. Hingorani an A. Richard D Irwin. 7. 2010.. (Preparation of Company Final Accounts not required) Financial Statements . Maheshwari. Limitations of Financial Statements. 8. 1995. N. Income and Expenditure Account.. P. New Delhi. N.f. Homewood.K. R. Reece “Accounting Principles”. McGraw Hill. Steps involved in Financial Statement Analysis. Financial Ratios. Maheshwari & Dr. K. 2. 5. Objectives of Inventory Valuation. 1990. Elementary Knowledge about Items in the Profit & Loss Account and Balance Sheet of a Company. S. Baneyee. 5th Ed. Kaplam & Young. Heitger and Serge Matulich. Ghosh and G. B. 3. Englewood Cliffs. 6. “Financial Accounting”. Prentice Hall. 2009 Syllabus of Master of Computer Applications (MCA). N. Vikas Publication. S. S. academic session 2010-11 . K. Balance Sheet. 8th Ed. 2nd Ed. Trading Account. [No. Atkinson. 2009. Anthony & J. R. New Jersey. Sultan Chand & Sons. PHI. 1999. “Financial Accounting . P..L. 1984. Illinois. 4th Ed. N. Pearson. W. approved by MCA Coordination Committee on 7th May 2010 & Sub-Committee Academic Council held on 31st May 2010. Banker. “Management Accounting”. 4. Balance Sheet. Analysis and Interpretation of Financial Statements. Items Peculiar to Non-trading Concerns [No. 2009. Ramanathan. New Delhi. S... Tulsian. 2003. Profit and Loss Account. Gupta. K. of Hrs: 10] UNIT – III Inventory Valuation: Meaning of Inventory. “An Introduction to Accountancy”. Dr. 2. 9thEd.

Google. Management Skills. 1. IBM. the students should be able to: Explain and apply principles of organizational behavior and management. Controlling. Social System Approach . Management by Objectives. Organizing: Concept. Upon completion of this course. Understanding management and organizational behavior with reference to key organizations in the IT sector. of Hrs : 12] Tutorial : [No. Forms of Organisational Structure. Question No. Hawthorne Experiments and Human Relations. of Hrs: 04] 2 Article Review Presentations UNIT . Understand organizational culture and managing change in organizations. W. academic session 2010-11 . and managing people at workplace through motivation.: MCA 329 Paper: Organizational Behavior & Management Principles L TC 3 1 4 INSTRUCTIONS TO PAPER SETTERS: 1. A proper understanding of organizational dynamics and the various management concepts is essential for every manager. Case 2 : Larry Ellison .f. leadership. Every unit should have two questions to evaluate analytical/technical skills of candidate. Levels of Management. Identify individual and organizational practices for managing workplace stress. if any. HBS case. performance management. student may be asked to attempt only 1 question from each unit. PRE-REQUISITE: • Concept of Formal and Informal Organization Management UNIT . The objective of this paper is to provide understanding to the participants in understanding.I Introduction to OB and Management Principles Conceptual Framework. 10] Tutorial : [No.Apple. Process & barriers. 2. Fayol’s Administrative Management. Administration. career planning & development and stress management. predicting. Manpower Planning. having at least 2 questions from each unit. [No. Organizational context of decisions. of Hrs: 41 Case 1: HBS case John Chambers – CISCO’s Driving Force. Scientific Management Theories . culture. Recruitment & Selection. There should be 10 questions of short answer type of 2 marks each. Span of Control. 1 should be compulsory and cover the entire syllabus. Taylor and Scientific Management. Organizational effectiveness depends largely on its ability to manage the human behavior. Job Design. Understand group dynamics. Types & process of decision making ..e. approved by MCA Coordination Committee on 7th May 2010 & Sub-Committee Academic Council held on 31st May 2010. Characteristics of Quality Managers. Syllabus of Master of Computer Applications (MCA). Each question should be 10 marks including subparts. Intel.Management Vs.Managerial Implications . System Approach.Code No. Challenges and Opportunities for OB . OBJECTIVE: Effective management of Human Resources is one of the prerequisites of a successful organization. rest of the paper shall consist of four units as per the syllabus.The Source of Oracle Wisdom. Delegation of Authority. However. Bureaucracy. Infosys. Training & Development [No. Apart from Question No. especially in the present day context of an evolving changing and competitive environment. Cisco.Evolution of Management Principles . Evolution of Management: Early contributions. of Hrs. Combining Jobs: Departmentation. and specifically the way individuals within a group work together to attain certain goals. Organisation Theories. Authority & Responsibility. Staffing: Concept.II Planning: Types.

and Sanghi. Techniques of TQM. 6. of Hrs. Weiss. HBS (February 29. Richard Pettinger. Pay and Job Performance. “Organizational Behavior”. of Hrs. 4. Motivation and Performance. PHI. “Organizational Behavior”. Leadership Styles & Influence Ethics and leadership. Morale Building. Methods: Pre-control: Concurrent Control: Post-control. “Organization Behavior Text and Cases”. Robbins. Case 4 : Inside Intel Inside HBS-9-502-083 (October 2009). Vikas Publishing House. 2004. Palgrave McMillan . S. 2002. Vikas Publishing House.. S. N9-708-480 Case2: Article Review : Leadership the Bill Gates Way –HBS case. of Hrs: 04/week] Case1 : Apple Inc. Importance of Culture. Approaches for Improving Motivation. Forces for Change. Joseph W. S. 2002. Pearson.. Interpersonal relations. K. “Principles of Organizational Behavior and Management”. A. 2. 2005. “Organizational Behavior. 2008) Yoggie David B. 2002. Performance Appraisal. Chopra and Archana Despande. “Organizational Behavior & Change.. Empowerment. Pearson Education.N.ECCH-402-017-1 Case 2 : Case of Google culture. Stoner. Chhabra. al. Managing Diversity. 5. [No. J. 3rd Ed. “Introduction to Management”. 2001. Model for Managing Change.. 2. 9th Ed. 2004. “Fundamentals of Management”... Emerging Design Options Different Organizational Structures. “Leading Issues in Management & Organizational Behavior (Text & Cases)”. Kavita Singh. Fred Luthans.UNIT . Pearson. Managing Culture. 2008. R. 4. Stephen P. Case 3: Article : Louis Gerstner The Man Who Turned IBM Around’ ICMR LDEN007. Benchmarking. Quality of Work Life. Behaviours. resistance to change. Management of Change. Organizational Culture (creation and sustenance of cultures) . Motivation. High performance culture. Sun India Publications. P. 10] Tutorial : [No. Educational & Technical Publisher. W. of Hrs: 04/week] Case 1 : Case of Infosys (Learning Organisation) ICMR-LDEN003..IV Individual Determinants of organizational. 2nd Ed. Job Anxiety & Stress. UNIT . Group Dynamics. Learning organizations. Oxford University Press 1st Ed.f. CrossCultural Dynamics & Ethics”. Organizational Designs. David & Decenzo. 2009. “Organization Theory & Behavior”. Downsizing. Judge. Management of Organizational Conflicts. 3. 2010. . 2009. Sturd Michael ..e.III Organizational structure & Design. Re-engineering. Total Quality Management. 7. Syllabus of Master of Computer Applications (MCA). Prasad L.Management of resistance.” McGraw Hill International Edition. [No. T. REFERENCES: 1. [No. approved by MCA Coordination Committee on 7th May 2010 & Sub-Committee Academic Council held on 31st May 2010. Chandan. “Understanding Organizational Behavior”. 9th Ed. 5. 2001. Singh & Chabra. Orgnaizational climate. of Hrs: 01] TEXT BOOKS: 1. Theories Of Motivation. academic session 2010-11 . Udai Pareek. 3. 6th Ed.ECCH-803-018-1 (2003). T. 10] Tutorial : No. Types of Control. “Management”. Robbins. M. Analysing. Controlling: Concept. An Integrated Control System. et.

Code No.: 11] UNIT . if any. Hierarchical bus systems. of Hrs. Mechanisms for instruction pipelining. Multistage and combining network. rest of the paper shall consist of four units as per the syllabus. Cache addressing models. W. of Hrs. 1 should be compulsory and cover the entire syllabus. Memory capacity planning. Data flow architecture. Grain size and latency. Vector-access memory schemes. Branch handling techniques.: 11] UNIT . It should be noted that the use of parallelism is secondary to the objective of achieving high performance.IV Vector Processing Principles: Vector instruction types. student may be asked to attempt only 1 question from each unit. Multifunctional arithmetic pipelines. to develop the foundations for analysing the benefits of design options in computer architecture. Coherence and Locality.: 10] UNIT . Processors and Memory Hierarchy: Advanced processor technology. Addressing and timing protocols. PRE-REQUISITE : • Computer Organization UNIT – I Parallel computer models: The state of computing . Multiprocessors and multicomputers. OBJECTIVE: The objective of this course is to introduce the fundamental techniques on which high-performance computing is based. Virtual Memory Technology. Synchronous Parallel Processing: SIMD Architecture and Programming Principles. CISC Scalar Processors. Comparisons of flow mechanisms. 1. Crossbar switch and multiport memory. There should be 10 questions of short answer type of 2 marks each. MCA 331 Paper: Advanced Computer Architecture LTC 31 4 INSTRUCTIONS TO PAPER SETTERS: 1. Memory Technology: Hierarchical memory technology. Vector and Symbolic processors.: 10] Syllabus of Master of Computer Applications (MCA). Superscalar Processors.f. approved by MCA Coordination Committee on 7th May 2010 & Sub-Committee Academic Council held on 31st May 2010. 2. Static arithmetic pipeline. [No. Multivector and SIMD computers. Architectural development tracks Program and network properties: Conditions of parallelism. Arithmetic Pipeline Design. Dynamic interconnection Networks. Instruction pipeline design. Computer arithmetic principles. Static interconnection networks. Every unit should have two questions to evaluate analytical/technical skills of candidate. Apart from Question No. Control flow versus data flow.e. Data and resource dependences. Demand driven mechanisms. [No. of Hrs. and to give some experience of the application of these techniques. Inclusion. However. Instruction-set Architectures. having at least 2 questions from each unit. Arbitration transaction and interrupt. academic session 2010-11 .II System Interconnect Architectures: Network properties and routing. Each question should be 10 marks including subparts. Program partitioning and scheduling. Nonlinear pipeline processor. Pipelining :Linear pipeline processor. Question No. Direct mapping and associative caches. VLIW Architectures. SIMD Parallel Algorithms. Program flow mechanisms. [No. [No. Dynamic instruction scheduling. SIMD Computers and Performance Enhancement. RISC Scalar Processors.III Backplane Bus System: Backplane bus specification. Hardware and software parallelism. Multiprocessor system interconnects. of Hrs.

Hennessy. Kai Hwang. 1996. “Computer Architecture: A Quantitative Approach”.TEXT BOOKS: 1. Syllabus of Master of Computer Applications (MCA). 3. MGH. J. Flynn. “Advanced computer architecture”. P. REFERENCES: 1. 4. Patterson. TMH. J. L. “Computer Architecture and Organization”. 1998. A. D.A System Design Approach”. MGH. Pipelined and Parallel Processor Design”. 2. “Computer Architecture and Parallel Processing”. Hwang and Briggs. 1998. 2002.f. M. J. Narosa Publishing. “Computer Architecture.e. Richard Y. Kain. Hayes. W. “Advance Computer Architecture . approved by MCA Coordination Committee on 7th May 2010 & Sub-Committee Academic Council held on 31st May 2010. Morgan Kauffmann. academic session 2010-11 . 2. PHI. 2000.

Major SQA activities. Major SQA issues. approved by MCA Coordination Committee on 7th May 2010 & Sub-Committee Academic Council held on 31st May 2010. • How it can be implemented. The content covers: • Basic Concepts of Software Quality. Test Planning and conduct. 2. • Describe how to conduct formal technical reviews and why they are the most important SQA activity. Question No. However.e. Implementation of Correction. Determining the Action to be Taken.III Configuration Management: Configuration Management Components. Correction of Defect.II Tailoring the Software Quality Assurance Program: Reviews. Walkthrough. Every unit should have two questions to evaluate analytical/technical skills of candidate. rest of the paper shall consist of four units as per the syllabus. Quality Attributes. SQA Techniques.Code No. Inspection. Software Quality Assurance: The Philosophy of Assurance. The course will be helpful for the students and to get acquaint with the industry prespective towards software Quality. Collecting measurements. if any. The Meaning of Quality.: 10] UNIT . Version Control. W. Analysis of Defect. Integration and Testing.: 12] UNIT . OBJECTIVE: This course covers the issues and techniques related to the Quality Management of software. Relationship of Development Phases. Detailed design. and Configuration Audits. academic session 2010-11 . Coding and Unit Test. Metrics.: MCA 333 Paper: Software Quality Management LTC 31 4 INSTRUCTIONS TO PAPER SETTERS: 1. Quality tools.: 10] UNIT . Who does the testing? [No. of Hrs. PRE-REQUISITE: • Concepts of Software Engineering UNIT . • Formal Technical Reviews. [No. having at least 2 questions from each unit. Defect Repair and closure. Periodic Review of Syllabus of Master of Computer Applications (MCA). The Relationship of Assurance to the Software Life-Cycle. 1 should be compulsory and cover the entire syllabus. types of Evaluations. Each question should be 10 marks including subparts. 1. Implementing defect analysis. student may be asked to attempt only 1 question from each unit.IV Defect Analysis: Analyzing concepts.f. Locating data. Software Quality Control and Software Quality Assurance. Configuration Management Planning. Regression Testing. Selecting metrics. • Software Quality Assurance. Implementing the Correcting the corrective Action. Preliminary design. [No. Elements of a complete Software Quality System. of Hrs. Zero defect Software. Program Unit Complexity. Evaluation: Software Requirements. Error Reporting: Identification of Defect. Testing: Types of testing. There should be 10 questions of short answer type of 2 marks each. Categorization of Defect. Maintaining Product Integrity. Apart from Question No. of Hrs. Change Management. Evolution of SQA. Corrective Action as to Cause: Identifying the Requirement for Corrective Action.1 Concepts and Overview: Concepts of Software Quality. System Testing.

8. academic session 2010-11 . 2003. 2008. approved by MCA Coordination Committee on 7th May 2010 & Sub-Committee Academic Council held on 31st May 2010. Addison-Wesley.“Software Quality Producing Practical Consistent Software”. Software Quality System Plan. Daniel Freedman. “Metrics and Models in Software Quality Engineering”. “Software Inspection” Addison-Wesley.Actions Taken. Pearson.1993. Traceability. K. Theory and Management”. 7. Software Documentation. 2009. Marless. “Principles of Software Engineering Management”. Arthur Lowell. Stephen H. Addison-Wesley. Artech House.e.K. Chapman and Hall. Robert Dunn. 2. Tom Gilb. Cengage Learning.. 6. Syllabus of Master of Computer Applications (MCA). 2nd Ed. Gary S. Gerald Weinberg. 2. Horch . “Software Quality Concepts and Plans”. Prentice-Hall. Aggarwal & Yogesh Singh. 1990. REFERENCE: 1. 9. [No.. 2nd Ed. “Practical Guide to Software Quality System”. “Improving Software Quality An Insiders guide to TQM”. “Software Engineering”. 1992. Tom Gilb. “Managing the Software Process”. “Handbook of Walkthroughs. Kan. 2003. New Age International Publishers. 1990. 3. John W. Inspections and Technical Reviews”. Watts Humphrey. Mordechai Ben-Menachem. Dorothy Graham. 5. 1993. Addison-Wesley. “A Discipline for Software Engineering”. of Hrs. “Software Quality. 4.. Watts Humphrey. 3. Software Quality Program Planning.: 10] TEXT BOOKS: 1. 3rd Ed. W. 1988. 1995. Dorset House Publishing. Records.f. 1990. Wiley & Sons. Alan Gillies.

Z-transforms. Correct acquisition of the signal is absolutely necessary for proper use of digital signal processing. Noise analysis of digital filters. DFT. Operations on Sequences. Time Domain Representation of Signals & Systems: Discrete Time Signals. power spectrum estimation. A/D & D/A converter. Methods for computing FFT. 2. academic session 2010-11 . Discrete-Time systems. 1. Every unit should have two questions to evaluate analytical/technical skills of candidate. sample-and-hold circuits. and output transducer. Apart from Question No. antialiasing filter. of Hrs: 12] UNIT – III Digital Processing of continuous-time signals: sampling of continuous signals. Linear Convolution using the DFT. A complete model of a DSP system is examined from the input transducer. rest of the paper shall consist of four units as per the syllabus. Question No. Each question should be 10 marks including subparts. However. Design of Digital IIR notch filters. Time-Domain characterization of LTI Discrete-Time systems. 1 should be compulsory and cover the entire syllabus. [No. [No. FIR filter Design based on truncated Syllabus of Master of Computer Applications (MCA). approved by MCA Coordination Committee on 7th May 2010 & Sub-Committee Academic Council held on 31st May 2010. Frequency transformations: linear phase design. input-output processor. Transform-Domain Representation of LTI Systems: the frequency response. output smoothing filter. It starts by explaining the need for digital signal processing and DSP systems.f. reconstruction filter design. DFT properties. Signals and signal Processing: characterization & classification of signals. Z-transforms. analog filter design. student may be asked to attempt only 1 question from each unit. Equivalent Structures. [No. There should be 10 questions of short answer type of 2 marks each. transform domain representations of random signals. Signal Flow Graph Representation. OBJECTIVE This course is an introduction to DSP concepts and implementation. FFT. priority interrupt. of Hrs: 10] UNIT – IV Digital Filter Design: Impulse invariance method of IIR filter design. PREREQUISITE • Digital Electronics • Operating System UNIT – I Discrete time signals and systems. Digital Filter Structure: Block Diagram representation. analog-to-digital and digital-to-analog conversion. properties of ztransform. Inverse z-transform. Discrete Fourier Transform. example of typical Signals. typical Signals Processing applications. modes of data transfer. through all the stages including: signal conditioning. Bilinear Transform method of IIR Filter Design. minimum-phase and maximum-Phase transfer functions. transfer. if any.Code No. of Hrs: 10] UNIT – II Transform-Domain Representation of Signals: the Discrete-Time Fourier Transform. the sampling process. the transfer function.e. design procedures for FIR and IIR filters. computation of the DFT of real sequences. IIR Filter Structures. types of transfer function. typical Signal Processing operations. W. having at least 2 questions from each unit. filter design. anti-aliasing. structures for digital filters.: MCA 335 Paper: Digital Signal Processing L TC 3 1 4 INSTRUCTIONS TO PAPER SETTERS: 1. FIR Digital Filter Structures. direct memory access.

Cengage Learning. “Digital Signal Processing .e.f. “The Digital Signal Processing Hand Book”. 2009. 1999. 1975. W. “Digital Signal Processing: Principles. Vijay K. ButterworthHeinemann. [No. Oppenhein & Ronald W. PHI. FIR filter design based on Frequency Sampling approach.fonner sens. REFERENCES: 1. Algorithms and Applications”. of Hrs: 10] TEXT BOOKS: 1. Vinay K. “Digital Signal Processing a Computer based approach”. Madisetti. John G. Mitra. Applications of DSP. PHI. Sanjit K. 2. Proaksis. 2003. Allan Y. Schater . Proakis Manodans.A MATLAB Based Approach”. USA. "Digital Signal Processing”. Ingle. 3. 2009. 2. Syllabus of Master of Computer Applications (MCA). academic session 2010-11 . approved by MCA Coordination Committee on 7th May 2010 & Sub-Committee Academic Council held on 31st May 2010. TMH.

Practical will be based on following: 1.f. academic session 2010-11 .e. 3. approved by MCA Coordination Committee on 7th May 2010 & Sub-Committee Academic Council held on 31st May 2010. 2. 4. Linux Programming Lab Software Testing Lab Enterprising Lab Lab based on Elective-I MCA 339 MCA 341 MCA 343 MCA 345 Syllabus of Master of Computer Applications (MCA). W.

: MCA 361 Paper: General Proficiency – V* It is suggested to have a fundamental course Intellectual Property Rights (Software Systems Oriented) in this semester. The performance of the candidates should continuously be evaluated by an internal committee.e. *Non University Examination Scheme (NUES) There will not be any external examination of the university. Syllabus of Master of Computer Applications (MCA). academic session 2010-11 . This paper is under Non University Examination system its detail content will be decided by the respective Institute.f. approved by MCA Coordination Committee on 7th May 2010 & Sub-Committee Academic Council held on 31st May 2010. under approval of the coordination committee based on the requirement of individual institution.Code No. The committee may conduct vivavoce at the end for the award of the marks. W.