You are on page 1of 42

PTU/BOS/MCA/210/13-07-2004

MCA COURSE STRUCTURE

SEMESTER I SEMESTER II

MCA-101 (N2) Introduction to Information Technology MCA-201 (N2) Management Information System
MCA-102 (N2) Programming in C MCA-202 (N2) Object Oriented Programming using C++
MCA-103 (N2) Accounting & Financial Mgmt. MCA-203 (N2) Data Communication & Networks
MCA-104 (N2) Computer Mathematical Foundation MCA-204 (N2) Principles of Management
MCA-105 (N2) System Analysis And Design MCA-205 (N2) Introduction to Micro Processor
MCA-106 (N2) Software Lab-I (IT) MCA-206 (N2) Software Lab-III (C++)
MCA-107 (N2) Software Lab-II (C) MCA-207 (N2) Hardware Lab-I (Micro Processor)

SEMESTER III SEMESTER IV

MCA-301 (N2) Computer System Architecture MCA-401 (N2) RDBMS-II
MCA-302 (N2) Data Structures MCA-305 (N2) Computer Based Optimization Methods
MCA-303 (N2) Workshop on Visual Basic MCA-403 (N2) System Software
MCA-304 (N2) RDBMS-I MCA-404 (N2) Operating System
MCA-402 (N2) Software Engineering MCA-405 (N2) Elective-I
MCA-306 (N2) Software Lab-IV (DS) MCA-406 (N2) Software Lab-VI (RDBMS)
MCA-307 (N2) Software Lab-V (RDBMS-I) MCA-407 (N2) Software Lab-VII (OS)
(LINUX/NT)

SEMESTER V SEMESTER VI

MCA-501 (N2) Computer Graphics MCA (N2)-601 Project
MCA-502 (N2) Internet Programming And Java
MCA-503 (N2) Elective-II
MCA-504 (N2) Elective-III
MCA-505 (N2) Software Lab-VIII (Graphics)
MCA-506 (N2) Software Lab-IX (Java)
MCA-507 (N2) Comprehensive Viva Voce

Elective-I Elective-II

MCA-405-A (N2) Artificial Intelligence MCA-503-A (N2) E-Commerce
MCA-405-B (N2) Robotics Engineering MCA-503-B (N2) Compiler Design
MCA-405-C (N2) Object Oriented Analysis and Design

Elective-III

MCA-504-A (N2) System Simulation And Modeling
MCA-504-B (N2) Advanced Microprocessor Systems

Note:

For 2003 batch & onward.
The course contents of scheme are exactly same as of N2 Scheme. Only few papers have been
shifted from one semester to another.
1st and 2nd semester courses are exactly the same.

PTU/BOS/MCA/210/13-07-2004
MCA 101(N2) INTRODUCTION TO INFORMATION TECHNOLOGY

Internal Assessment: 40
External Assessment: 60

Instructions for paper-setter
The question paper will consist of five sections A, B, C, D and E. Section A, B, C and D will have two
questions from the respective sections of the syllabus and will carry 10 marks each. Section E will have 10-
20 short answer type questions, which will cover the entire syllabus uniformly and will carry 20 marks in all.

Instruction for candidates
Candidates are required to attempt one question each from sections A, B, C and D of the question paper and
the entire section E

Use of non-programmable scientific calculator is allowed
_________________________________________________________________________________
Section A
Computer Fundamentals: Block structure of a computer, characteristics of computers, generation of
computers, classification of computers.

Number System: Bit, byte, binary, decimal, hexadecimal, and octal systems, conversion from one system to
the other, Binary Arithmetic: Addition, subtraction and multiplication. Representation of Information: Integer
and floating point representation, Complement schemes, Character codes (ASCII, EBCDIC, BCD, Excess-3,
Grey).

Section B
Elements of a computer processing system: Hardware – CPU storage devices and media, VDU, input-output
devices, data communication equipment. Software – system software, application software.

Programming languages: classification, machine code, assembly language, higher level language, and fourth
generation languages

Section C
Operating system: Batch, multi-programming, time sharing, mmultiprocessing, PC operating system, network
operating system, on-line and real time operating system.

Computer Network and Communication: Network types, network topologies, network communication
devices, physical communication media, network protocol, (TCP/IP.)
Internet and its Applications: E-mail, TELNET, FTP, World Wide Web, Internet chatting.

Section D
Range of application: Scientific, Business, educational, weather forecasting, and remote sensing, planning,
multilingual applications, management information, decision support system, inventory control, medical,
industrial control, banks, railways, etc.

References:
1. D.H. Sanders,” Computers Today”, Mc Graw Hill, 1988.
2. T.N. Trainers,” Computers” (4th edition) Mc Graw Hill, 1994.
3. V. Rajaraman,”Fundamentals of Computers” (2nd edition),

PTU/BOS/MCA/210/13-07-2004

MCA-102 (N2) PROGRAMMING IN C
Internal Assessment: 40
External Assessment: 60

Instructions for paper-setter
The question paper will consist of five sections A, B, C, D and E. Section A, B, C and D will have
two questions from the respective sections of the syllabus and will carry 15% marks each. Section E
will have 10-20 short answer type questions, which will cover the entire syllabus uniformly and will
carry 40% marks in all.
Instruction for candidates
Candidates are required to attempt one question each from sections A, B, C and D of the question
paper and the entire section E
Use of non-programmable scientific calculator is allowed
_________________________________________________________________________________
Section A
Problem Solving with Computers: Algorithms, and Flowcharts. Data types, constants, variables,
operators, data input and output, assignment statements, conditional statements.

Section B
Iteration, arrays, strings processing, defining function, types of functions, function prototype,
passing parameters, recursion.
Storage class specifiers, pre-processor, header files and standard functions.

Section C
Pointers: Definition and uses of pointers, pointer arithmetic, pointers and array, pointers and
functions, pointer to pointer.
Structures, union, pointers to structures, user-defined data types, enumeration.

Section D
Data files: Opening, closing, creating, processing and unformatted data files.
Introduction to Dynamic Memory Allocation
C-programming applications: Sorting (Bubble sort, Selection sort), Searching
(Binary search, Linear Search)

References:

1. Kerighan & Richie The C programming language (PHI Publication)
2. Byron Gottorfried Schaum’s outline of programming with C
3. E.Balaguruswamy Programming in ansi ‘C’ (Tata McGraw Hill)
4. Kanetkar “Let Us C”, BPB Publications. (Tata McGraw Hill)

PTU/BOS/MCA/210/13-07-2004
MCA-103 (N2) ACCOUNTING AND FINANCIAL MANAGEMENT

Internal Assessment: 40
External Assessment: 60

Instructions for paper-setter
The question paper will consist of five sections A, B, C, D and E. Section A, B, C and D will have
two questions from the respective sections of the syllabus and will carry 10 marks each. Section E
will have 10-20 short answer type questions, which will cover the entire syllabus uniformly and will
carry 20 marks in all.

Instruction for candidates
Candidates are required to attempt one question each from sections A, B, C and D of the question
paper and the entire section E

Use of non-programmable scientific calculator is allowed
_________________________________________________________________________________
Section A
Accounting: Principles, concepts and conventions, double entry system of accounting, introduction
to basis books of accounts of sole proprietary concern, closing of books of accounts and preparation
of trial balance.

Final Accounts: Trading, Profit and Loss accounts and Balance sheet of sole proprietary concern
(without adjustment)

Section B
Financial Management: Meaning, scope and role, a brief study of functional areas of financial
management. Introduction to various FM tools: Ration Analysis, Fund Flow statement and cash
flow statement (without adjustments)
Section C
Costing: nature, importance and basic principles. Marginal costing: Nature scope and importance,
Break even analysis, its uses and limitations, construction of break even chart, Standard costing:
Nature, scope and variances (only introduction)
Section D
Computerized accounting: Meaning and advantages, Computer Programs for accounting, Balancing
accounts, Trial balance and final accounts in computerized, Accounting, control, and Audit, Sub-
Modules of computerized accounting systems.

References:
1. J.C.Katyal,” Principles A Book-Keeping”.
2. Jain and Narang,” Principles of Accounting”.
3. I.M.Pandey,” Financial Management, Vikas Publications.
4. Sharma, Gupta & Bhalla,”Management Accounting”.
5. Jain and Narang,” Cost Accounting”.
6. Katyal,"Cost Accounting”.
7. P.H.Barrett,” Computerized Accounting”, BPB.

minset. properties of relations Section B Algebra of logic. quantifiers. universal set. . graph coloring. Connectives. Partitions of sets. De-Morgan’s laws. Section A. solving simultaneous equations using Gauss elimination. transpose etc. graphs of relations. inverse and rank of a square matrix. Section D A general introduction. matrix addition and scalar multiplication. Instruction for candidates Candidates are required to attempt one question each from sections A. Chromatic number. Equivalence and implication. Bipartite graph. directed and undirected graphs. subsets.”Applied Discrete Structures for Computer Science”. Principle of Mathematical induction. PTU/BOS/MCA/210/13-07-2004 MCA-104 (N2) COMPUTER MATHEMATICAL FOUNDATION Internal Assessment: 40 External Assessment: 60 Instructions for paper-setter The question paper will consist of five sections A. which will cover the entire syllabus uniformly and will carry 20 marks in all. intersection and union of sets. Equivalent sets. Gauss Jordan Methods. C and D will have two questions from the respective sections of the syllabus and will carry 10 marks each. References: Alan Doerr. Relations: Basic definitions. Matrix Inversion method. B. Cartesian products. B. B. Eulerian and Hamiltonian Graphs. C. Kolman and Busby “ Discrete Mathematical structures for Computer Sciences” PHI. C and D of the question paper and the entire section E Use of non-programmable scientific calculator is allowed _________________________________________________________________________________ Section A Sets and Relations: Definition of sets. D and E. Square matrices. its different kinds. Propositions. complement of a set. simple and multipgrpahs. Shortest path algorithms. Section C Introduction of a Matrix. Section E will have 10-20 short answer type questions. Tautologies and contradiction. Galgotia Publications. Countable and uncountable sets. multiplication of matrices.

Section E will have 10-20 short answer type questions. Ltd 2. Decision tables and structured English. Criteria for software selection. Addison-Wesley Publishing Co . System Development Life Cycle. EM: System Analysis and Design. Tools of structured Analysis – Data Flow Diagrams. Cost and Benefit analysis. Awad. Section C System Design: Structured Design. Hardware/Software Selection: Procedure for selection. Major phases in selection. elements and types of system. and Output design. Section B System Analysis: Problem Definition. Initial investigation. PTU/BOS/MCA/210/13-07-2004 MC-105 (N2) SYSTEMS ANALYSIS AND DESIGN Internal Assessment: 40 External Assessment: 60 Instructions for paper-setter The question paper will consist of five sections A. ML: System Analysis and Design. Information requirements. References: 1. Make v/s buy decision. System Testing: Test Plan AND test data. B. Chaining and Inverted list organization. Instruction for candidates Candidates are required to attempt one question each from sections A. B. Characteristics. C and D of the question paper and the entire section E Use of non-programmable scientific calculator is allowed ________________________________________________________________________________ Section A System: Definition. Feasibility study-Technical. Input design. which will cover the entire syllabus uniformly and will carry 20 marks in all. C and D will have two questions from the respective sections of the syllabus and will carry 10 marks each. Section A. Section D System Implementation: Implementation Plan. Silver. Data Dictionary. C. Galgotia Publications Pvt. B. D and E. 3. GA. Information gathering tools. Silver. File Organization: Sequential Indexed Sequential. Decision Tree. combating resistance to change. Form Design. type s of system test. economic and behavioral feasibility. Gane and Sarson: Structured System Analysis and Design. Role of system analyst. activity network for conversion.

PTU/BOS/MCA/210/13-07-2004 MCA-106 (N2) SOFTWARE LAB-I (IT) Internal Assessment: 40 External Assessment: 60 This laboratory course will mainly comprise of exercises on: MCA 101: Typical Commands of DOS. GUI in Windows. MCA-103: Introductory Study of Computerized Accounting Packages Maximum marks for continuous assessment: 40 Maximum marks for university examination: 60 Note: The break up of marks for the practical 9university examination) will be as under Lab record 15 marks Viva Voce 15 marks Execution of commands 30 marks .

Flow charts should be developed wherever necessary.Using input and output statements 2. 6.Using control statements. 7. 4.Using structure. Write program in ‘C’ language 1.Using files.Using array 5. ¾The break up of marks for the practical 9university examination) will be as under Lab record 15 marks Viva Voce 15 marks Program Development 30 marks And execution . 3.Using functions.To sort an array using different methods 8. PTU/BOS/MCA/210/13-07-2004 MCA-107 (N2) SOFTWARE LAB II (C) Internal Assessment: 40 External Assessment: 60 This laboratory course will mainly comprise of exercises on what is learnt under paper: MCA-102 Maximum marks for continuous assessment: 40 Maximum marks for university examination: 60 Note: Program should be fully documented with simple I/O data.To search an element from array.

B. Simon’s Model of decision – Making. Robert G. financial and Production MIS References: 1. Kanter. C. Section E will have 10-20 short answer type questions. Structure and Development: 3. The systems Approach.H.Olsca “ Management Information Systems: Conceptual Foundation. Section D Functional MIS: A study of Marketing. Sub – systems of information systems: EDP and MIS. 2.” Management Information Systems”. Claggett. Design & Implementation of Information system”. Instruction for candidates Candidates are required to attempt one question each from sections A. EDP/MIS/DSS Section B An overview of Management Information System: Definition and Characteristics. which will cover the entire syllabus uniformly and will carry 20 marks in all. types of Information. B. Goirden B. Personnel. D and E. . Pitfalls in MIS development. Types of systems. “ Information Systems for Modern Management”. structured Vs un-structured decisions. C and D will have two questions from the respective sections of the syllabus and will carry 10 marks each. management levels. C and D of the question paper and the entire section E Use of non-programmable scientific calculator is allowed ________________________________________________________________________________ Section A Introduction to systems and Basic systems concepts. Ross & James R. role of Information in Decision – Making. PHI. Information systems: Definition and characteristics. B. Section A. Frame Work understanding MIS: Robert Anthony’s Hierarchy of Management Activity. Information requirements and Levels of Management. PTU/BOS/MCA/210/13-07-2004 MCA-201 (N2) MANAGEMENT INFORMATION SYSTEM Internal Assessment: 40 External Assessment: 60 Instructions for paper-setter The question paper will consist of five sections A. Murdick & Joel E. 4. Davis & M. J. Components of MIS. Lucas. “analysis. PHL. Information systems Section C Developing Information systems: Analysis and design of information systems: Implementation and evaluation. Formal Vs.

polymorphism. C. OOP Paradigm. member access control Section D Function overloading.h input and output. single inheritance. polymorphism with pointers. . B. Instruction for candidates Candidates are required to attempt one question each from sections A. opening and closing of files. destructors. Identifier and keywords. Arrays. Section E will have 10- 20 short answer type questions. operator overloading. recursion. Section B Defining function. 2. which will cover the entire syllabus uniformly and will carry 40% marks in all.”Programming with C++”. Introduction to C++. polymorphism. classes. static class member. storage class specifiers. early binding. pointers and structures. inheritance. 4. B. pointers and classes. pre-processor. 1994. TMH. 1994.”Object Oriented Programming in Turbo C++”. Section A. types of derivations. References: 1. header files and standard functions. Ravichandran. member functions. classes and file operations. 1996. C and D of the question paper and the entire section E Use of non-programmable scientific calculator is allowed _________________________________________________________________________________ Section A Evolution of OOP. 1995. stream state member functions. statements. addition-Wesley Publ. Galgotia Publ. Robert Lafore. type conversion. S. objects. Bjarne Strautrup. Comparison between functional programming and OOP Approach. conditional expression loop statements. PTU/BOS/MCA/210/13-07-2004 MCA-202 (N2) Object Oriented Programming Using C++ Internal Assessment: 40 External Assessment: 60 Instructions for paper-setter The question paper will consist of five sections A. inline member functions. user defined data types. types of base classes. enumerations. D and E. C++ operators. features of iostream. Inheritance. friend functions. random access file processing. pure virtual functions. reusability. D. Variable declaration. BPB Publ. multiple inheritance.Halladay and M. advantages of OOP. B. constants. container classes. 3. binary file operations. C and D will have two questions from the respective sections of the syllabus and will carry 15% marks each. late binding. constructors. Section C Classes. Wiebel. breaking control statements. nested classes. overloading. structures. bit fields typed. pointer arithmetic’s. types of functions. structures and file operations. dynamic memory allocation. expressions. characteristics of object oriented language – objects.h and iomanip. virtual functions. unions.”The C++ programming language”.” Object Oriented Software Engg”. arrays of class objects.

PTU/BOS/MCA/210/13-07-2004 MCA-203 (N2) DATA COMMUNICATION & COMPUTER NETWORKS Internal Assessment: 40 External Assessment: 60 A) Instructions for papers-setter The question paper will consist of five A. 1992. ALOHA. 2nd Edition.”Inter Networking With TCP/IP: Principles. Protocol And Architecture”. Bertsekas And R. 2 Schwaber. TCP/IP model. OSI reference model. Band Width limitation. D and E. packet switching. and D of the question paper and the entire section E. distance vector routing. TCP connection management. Section A. ______________________________________________________________________________ SECTION A Introduction to data communication. modems. “ Data And Computer Communication”. REFERENCES: 1 Andrew S. CRC. the network layer in the Internet IP protocol. PHI. token bucket. C. TCP/IP service model. network standardization. transmission media. network software. B) Instructions for candidates 1. TDM. HDLC/SDLC. . Multiplexing: SDM. parity check. D. Error detection and correction. 4 D. flow control & buffering. C and D will have two question from the respective sections of the syllabus and will carry 15% marks each. telephone system. terminal handling. physical layer: circuit switching. Network layer: design issues. flow based routing. network hardware. CSMA/CD. Fourier Analysis. Modulation. Third Edition 1997.Gallagar.E. Corner. IEEE standard 802 for LAN and WAN. section E will have 10-20 short answer type questions which will cover the entire syllabus uniformly and will carry 40% marks in all. B. Tanenbaum. message switching. B. flooding. hamming code. B. 1991 5. nature of errors. analog Vs Digital Communication.”Data Networks”. “Computer Network 2nd Edition”. STDM. elements of transport protocol. Prentice Hall. IP address. Candidates are required to attempt one question each from sections A. SECTION-D Transport layer: design issues. C. elementary data link protocols-sliding window protocol. connections. SECTION C Data link layer: design issues. token passing. Congestion control algorithms: leaky bucket. 2nd Edition Prentice Hall. addressing establishing & releasing a connection. Vol1. SECTION B Introduction to computer networks and application. data rate of a channel. Internet working. 2nd Edition. 2. “ Data Communication” 3 William Stallin Maxwell. Routing algorithms: shortest path routing. Use of non-programmable scientific calculator is allowed. FDM.

motivation. project and matrix organization. PTU/BOS/MCA/210/13-07-2004 MC-204 (N2) PRINCIPLES OF MANAGEMENT Internal Assessment: 40 External Assessment: 60 Instruction for paper setter The question paper will consist of two sections A and B.M. Need. Robbins Management Chabbra Business Organization and Management T. Steps in planning. Sharma Principles of Business Management . Controlling: Control process. setting of objectives. Sections B will have six questions and will carry 10 marks each. line and staff arrangement. delegation. Process of organizing. Organizing: nature. strategies policies and planning premises. which will cover the entire syllabus uniformly and will carry 20 marks in all. types and techniques. Finance – Finance functions. departmentation. the process of decision making. decentralization. marketing mix. marketing research.Arun Kumar & R.Prasad Principles & Practice of Management L. organization structure and design. authority. communication and leadership. sources of finance for fixed assets and working capital structure HRD – concept. Section A will have 10 short answer type questions. the process of planning. recruitment and selection techniques.N. Instructions for Candidates Candidates are required to attempt four questions from section B and the entire section A. creating an effective span of management. control techniques Directing: .Nature. segmentation of market. Use of non-programmable scientific calculator is allowed Use of non-programmable scientific calculator is allowed _________________________________________________________________________________ Management: Nature and scope Planning: . types of interview co-ordination: Need and importance. different functions of HRD Reference: Koontz & O’ Donnell Essentials of Management Stephen P. work study Marketing – Concept.Conception. Introduction of the following function Areas: Production – Production systems Production planning and control. Types.

real and Protected mode. Memory read and Memory Write operations. 8085 MPU and its architecture. Brey The Intel microprocessors 8086/8086. and branch control instructions. Addressing Modes. and program control. 8086Architecture. C and D will have two questions from the respective sections of the syllabus and will carry 15% marks each. 8085 instruction cycle and timing diagram. B. which will cover the entire syllabus uniformly and will carry 40% marks in all. C and D of the question paper and the entire section E Use of non-programmable scientific calculator is allowed _________________________________________________________________________________ Section A Introduction to Microprocessor. its historical background and Microprocessor applications.. Arithmetic coprocessor. Section A. Section E will have 10-20 short answer type questions. Ram Fundamentals of microprocessors and HI microcomputers Dhanpat RaiPublication. 8257 Interrupt controller. 80186/80188. B. 80486 Pentium pro processor Architecture. 80286. Penram International Publishing (India) . Memory Paging. B. C. Programming and Applications with 8085. D and E. Instructions for 8085: Data movement. INTEL 8085: Microprocessor Architecture and its operations. 3. Memory Addressing. Arithmetic and logic. Instruction for candidates Candidates are required to attempt one question each from sections A. Section D Interrupts: Introduction. Gaonkar Microprocessor Architecture. 80X87 Architecture REFERENCES: 1. B. Programming and interfacing 4th Edition. Pin diagram of 8086. B. Section B INTEL 8086: Introduction. Arithmetic and logic. PTU/BOS/MCA/210/13-07-2004 MCA-205 (N2) INTRODUCTION TO MICROPROCESSOR Internal Assessment: 40 External Assessment: 60 Instructions for paper-setter The question paper will consist of five sections A. 80386. basic DMA operation and 8237 DMA Controller. clock generator (8284A) Section C Various types of instructions: Data movement. 2. Ramesh S. RISC v/s CISC processors.4th edition.

Friend and Static Functions) ¾The break up of marks for the practical 9university examination) will be as under Lab record 15 marks Viva Voce 15 marks Program Development 30 marks And execution .Using input and output statements 2. 3.Using array 5.Using OOP’s Concepts (Inheritance.Using control statements. Encapsulation.Using functions.Using Classes and implementation of Constructor and Destructor. 7. PTU/BOS/MCA/210/13-07-2004 MCA-206 (N2) SOFTWARE LAB III (C++) Internal Assessment: 40 External Assessment: 60 This laboratory course will mainly comprise of exercises on what is learnt under paper: MCA 202 Maximum marks for continuous assessment: 40 Maximum marks for university examination: 60 Note: Program should be fully documented with simple I/O data.Using files. 4. Polymorphism. 6. Write program in ‘C++’ language 1. Flow charts should be developed wherever necessary.

To multiply an ASCII string of eight numbers by single ASCII digit. To subtract two hexadecimal nos. 8.To find the maximum no in a given string (16 bytes long) and store it in a particular location. 7. 8086 1. To separate hexadecimal number into two digits(Breaking the byte into two nibbles). For addition of 8 bit no series neglecting the carry generated. 6. 6. To multiply two binary no’s. To examine and modify the contents of a register and memory location. 3. The result should not be greater than 199.To calculate the no. PTU/BOS/MCA/210/13-07-2004 MCA-207 (N2) Practical Hardware Lab – I(Microprocessor) Internal Assessment 40 External Assessment 60 This laboratory course will mainly comprise of exercise on what is learnt under the paper: MCA- 205 (up). To add two hexadecimal nos. To add two sixteen bit nos. 3. 5. 5. 4.To find the minimum no in a given string (16 bytes long) and store it in a particular location. Using 8085 and 8086 microprocessor kits do the following programs: 8085 1. To add two hexadecimal nos. 2 To add two binary no’s each 8 bit long. of bytes in a string starting from a particular location up to an Identifier (data byte) placed in AL register. To subtract two sixteen bit nos.To sort a string of a no of bytes in descending order. 2. . Store the actual count in a particular memory Location.To add two binary no’s each 8 bit long. 8. 4. 7.

memory reference instructions. I/O interrupts. Tata Mc Graw Hills.P. channels. Mc Graw Hill R.Hayes: Computer Architecture and Organizations”. C and D of the question paper and the entire section E Use of non-programmable scientific calculator is allowed _________________________________________________________________________________ Section A Logic gates. Tata Mc Graw Hill. data transfer techniques. MUX and DEMUX. Instruction formats and addressing modes Program control. storage technologies. flip flops. CPU: Stack organization. Mano “Computer System Architecture”. C and D will have two questions from the respective sections of the syllabus and will carry 10 marks each. I/O. Subtractor. I/O and their brief description. Memory hireachary. processing.M. Registers. C. instruction cycle.Jain “Modern Digital Electronics”. which will cover the entire syllabus uniformly and will carry 20 marks in all. Encoder- Decoder Section –B Computer organization and design: Instruction codes. Types of Interrupts Section C Control Memory. Bus interface. Instruction for candidates Candidates are required to attempt one question each from sections A.P. Adder. R.P. Counters. Memory management. Micro programming vs Hardwired control unit. D and E. op-code. B. . Associative. B. computer registers. B. computer instructions. J. PHI. Overview of RISC/CISC. Section A. Timing and control. Section E will have 10-20 short answer type questions.Jain “Modern Digital Electronics”. Virtual and cache memory References: M. Section D Memory system. Main and Auxiliary memory. Stallings “Computer Organization and Architecture” PHI. PTU/BOS/MCA/210/13-07-2004 MCA-301 (N2) COMPUTER SYSTEM ARCHITECTURE Internal Assessment: 40 External Assessment: 60 Instructions for paper-setter The question paper will consist of five sections A.

Quick sort.Augenstein. . 1988. Galgotia. Section A. data structures and data structure operations. Selection sort. Section D Searching and sorting use of various data structures for searching and sorting. B. traversing a graph.”Data structures with Pascal”. representation of linked list. Section E will have 10-20 short answer type questions. AVL trees. B. 3rd edition. Linear and Binary search. Basic data structures such as arrays. 1991. B. Bubble sort. Y. Programs are to be implemented in ‘C/C++’ 2. Lanhgsam and A. Insertion. Merge sort. References: 1.J. heap tree and heap sort algorithm. representations in contiguous storage. binary trees. algorithmic complexity and time space trade off. stack and queues and their applications. deletion.Sahni. search and traversal operations are to be performed on all the data structures. linked tree representation. sequential and linked representation of graph – adjacency matrix. Section B Trees-definitions and basic concepts. searching insertion and deletion in binary trees. Seymour Lipschultz. C and D of the question paper and the entire section E Use of non-programmable scientific calculator is allowed _________________________________________________________________________________ Section A Basic concepts and notations. binary tree traversal. linked and sequential representation. Instruction for candidates Candidates are required to attempt one question each from sections A. Insertion sort. Horowitz and S. Linked list. Radix sort. 1990 2. C. Mc Graw Hill. DFS and BFS. D and E. C and D will have two questions from the respective sections of the syllabus and will carry 10 marks each. Heap Sort.”Data Structures Using C”. Note: - 1. 3. Dijkstra’s algorithm for shortest distance. Tannenbaum. E. PTU/BOS/MCA/210/13-07-2004 MCA-302 (N2) DATA STRUCTURES Internal Assessment: 40 External Assessment: 60 Instructions for paper-setter The question paper will consist of five sections A. operations on graph. Section C Graphs and their application. Hashing. Prentice Hall of India. mathematical notation and functions. “ Theory and Practice of Data structures”. which will cover the entire syllabus uniformly and will carry 20 marks in all. A. multi linked structures.

Bank transactions management 3. Inventory Management 11. Railway Automation 7. Gas agency management 5. Competitive examination database 12. Computerization course registration 8. . Hospital Management 10. PTU/BOS/MCA/210/13-07-2004 Workshop on Visual Basic MCA-303 (N2) Internal Assessment 100 Develop an application using Visual Basic. Office Automation 6. Hotel Management 4. College admission 15. Hospital automation 2. Transport management 14. 1. Hostel Management 9. Library management Note: Any similar project using Relational Database System. Air line reservation 13.

which will cover the entire syllabus uniformly and will carry 20 marks in all. Introduction to database management”. multivalued dependencies. TMH. 1997 (reprint) 2. concurrency. ”principles of database systems”. B. C. relational algebra. B. Instruction for candidates Candidates are required to attempt one question each from sections A. ullman. client/server architecture. PTU/BOS/MCA/210/13-07-2004 MCA-304 (N2) RELATION DATA BASE MANAGEMENT SYSTEM-I Internal Assessment: 40 External Assessment: 60 Instructions for paper-setter The question paper will consist of five sections A.korth. Bobrowski. D and E. “ An introduction to database systems”. functional dependencies. 1987) 4. security.J. 1996.. 6. “ client server architecture and introduction to oracle 7”. recovery. Basic DBMS terminology. hierarchical model: from network to hierarchical. “ database system concepts”. Galgotia. Kroenke. D. and normalization. (3rd ed Narosa publishers. C and D of the question paper and the entire section E Use of non-programmable scientific calculator is allowed _________________________________________________________________________________ SECTION-A Overview of DBMS. 1993. “ database processing”. References: 1. Date. Architecture of a DBMS. McGraw hill Inc. 1984). Section A. 5. Naveen Prakash. (Galgotia. hierarchical and relational models. SECTION-C Relational model: storage organizations for relations. structure of distributed databases. SECTION-B Introduction to data models: entity relationship model. data independence. . Abraham. SECTION-D Relational query language: SQL. and technical introduction to oracle. design of distributed databases. comparison of network. database integrity. C. B. 3. relational model. object relational database. relational calculus. 1985). Henry F. Distributed databases. (2nd ed. C and D will have two questions from the respective sections of the syllabus and will carry 10 marks each. object oriented database. 1997. comparison of OOD & ORD. Section E will have 10-20 short answer type questions.

McGraw Hill 2. (Narosa Publishing House). which will cover the entire syllabus uniformly and will carry 20 marks in all. SECTION-D Testing Fundamentals: Objectives. Jalota. “software engineering – A practitioner’s approach “. B. Section E will have 10-20 short answer type questions. Role Of Metrics And Measurement. fairly. Process Based Estimation. Decomposition Techniques: S/W Sizing. Unit Test. B. System Analysis: Principles Of Structured Analysis. Components Applications. Concepts. Testing Strategies: Verification & Validation. Cost Estimation Models: COCOMO Model. Roger s. “software engineering concepts”. Fourth Generation Techniques. Object – Oriented Concepts. Procedural Design. Data Dictionary. Testability. 3. Principles. Test Cases: White Box & black box Testing.B S/W Project Planning: Objectives. Concepts Of Project Management. Instruction for candidates Candidates are required to attempt one question each from sections A. C. Reference: 1. The S/W Equation. Section A. DFD. C and D of the question paper and the entire section E Use of non-programmable scientific calculator is allowed _________________________________________________________________________________ SECTION-A Software: Characteristics. Integration Testing. Principles. System Testing. B.E. Spiral. “an integrated approach to software engineering”. D and E. Software Process Models: Waterfall. McGraw Hill. . SECTION . Design Mythologies: Data Design. Prototyping. pressman. PTU/BOS/MCA/210/13-07-2004 MCA-402 (N2) SOFTWARE ENGINEERING Internal Assessment: 40 External Assessment: 60 Instructions for paper-setter The question paper will consist of five sections A. C and D will have two questions from the respective sections of the syllabus and will carry 10 marks each. Architecture Design. Problem Based Estimation. Entity Relationship Diagram. Requirement Analysis. R. SECTION-C S/W Design: Objectives. Validation Testing.

To find traversals of expressions using binary tree 15. 11. 5. To merge two arrays. 10. Write program in C / C++ 1. 7. 6. To search an element using binary tree. Resemblance of particular words with respect to meaning or spelling checking 13. To insert and delete a node in a linked list 2. To solve polish expression using stacks. To implement a queue using arrays and linked list. 12. For tower of hanoi problem using recursion. To implement a stack using arrays and linked list. To insert and delete a node in a circular linked list. To add two polynomials using linked list 3. To invert a linked list. 4. PTU/BOS/MCA/210/13-07-2004 MCA-306 (N2) SOFTWARE LAB IV (DS) Internal Assessment: 40 External Assessment: 60 This laboratory course will mainly comprise of exercises on what is learnt under paper: mca-302 (Data Structures) Maximum marks for continuous assessment: 40 Maximum marks for university examination: 60 Note: Program should be fully documented with sample I/O data Flow charts should be developed wherever necessary. ¾The break up of marks for the practical (university examination) will be as under Lab record 15 marks Viva Voce 15 marks Program Development 30 marks And execution . 8. Library management application using searching and sorting technique. 9. List words with their occurrence in a paragraph-using file. To insert and delete node in binary search tree 14.

* Maximum Marks For Continuous Assessment: 40 Maximum Marks For University Examination: 60 Note: The break up of marks for the practical will be as under Lab Record 15 marks Viva Voce 15 marks Program development 30 marks And execution . PTU/BOS/MCA/210/13-07-2004 MCA-307 (N2) SOFTWARE LAB V (RDBMS-I) Internal Assessment: 40 External Assessment: 60 This laboratory course will mainly comprise of exercise on what is learnt under the paper: MCA- 304 (RDBMS-I).

Client / Server Systems. Client / Server: Architecture And Implementation Issues. What Is A Transaction? Concurrency Control (Locking Methods. Multiple-Site Data) SECTION-C Systems. C and D of the question paper and the entire section E Use of non-programmable scientific calculator is allowed _________________________________________________________________________________ SECTION-A Degree Of Data Abstraction. OLAP And Comparison. PTU/BOS/MCA/210/13-07-2004 MCA-401 (N2) RELATIONAL DATABASE MANAGEMENT SYSTEM-II Internal Assessment: 40 External Assessment: 60 Instructions for paper-setter The question paper will consist of five sections A. B. Operation. An Introduction To Database Systems By Bipin C. Decision Support Data. Optimistic Method) DDBMS Distributed Database Management Systems) Advantage And Disadvantages. Maintain Ace And Evaluation. MPMD (Multiple –Site Processing. By Peter Rob Carlos Coronel 3. REFERENCES: 1. B. Rules For Data Warehouse. Single Site Data). What Is Client / Server? The Forces That Drive Client /Server SECTION-D (DSS) Decision Support Systems: Operational Data Vs. Data Mining. C. Desai . which will cover the entire syllabus uniformly and will carry 20 marks in all. Instruction for candidates Candidates are required to attempt one question each from sections A. Testing And Evaluation. Homogeneous And Heterogeneous DBMS. Online Analytical Processing (OLAP): OLAP Architecture Relational. C and D will have two questions from the respective sections of the syllabus and will carry 10 marks each. SECTION-B Centralized Verses Decentralized Design.Date 2. The DSS Database Requirements. B. Data Base Systems (3rd Edition) Galgotia Publications (P) Ltd. Section E will have 10-20 short answer type questions. Distributed Database Transparency Features.J. An Introduction To Database Systems (Sixth Edition) By C. Level Of Data And Process Distribution: SPSD (Single–Site Processing. Single-Site Data). MPSD (Multiple-Site Processing. Time Stamping Method. The Data Warehouse: The Evaluation Of The Data Warehouse. Section A. Database Design. Implementation And Loading. D and E. The Database Life Cycle (DBLC): Initial Study Of The Database.

SECTION – D Revised Simplex Method. . Decision Tree Analysis. “ Operation Research “. use & limitations of O. Decision Making: Decision Making. S.. Unbalanced Transportation Problems.R. Tenth Ed. Conditional Probability.P.R. D and E. Enviorment. Test For Optimality. Kanti Swarup P. Branch & Bound Method. Meerut. Decision Under Risk. Instruction for candidates Candidates are required to attempt one question each from sections A. B. Dynamic Programming. Traveling Salesman Problem. Nature & Characteristic features of O. Seventh Ed.R. Sample Space & Probability. graphical & simplex method.R.1994. SECTION-C Probability & Uncertainty. SECTION-B Transportation Problems: Loops. which will cover the entire syllabus uniformly and will carry 20 marks in all. duality in L. C. 1992. B. Section E will have 10-20 short answer type questions. Decision Under Uncertainty. Models & Modeling in operation research.”Operation Research “. 2. Sultan Chand & Sons. Section A.K. Assignment & Routing Problems.R. C and D will have two questions from the respective sections of the syllabus and will carry 10 marks each. Integer Programming. Kedar Nath Ram Nath And Co. B.. & decision making. general methods for solving O. C and D of the question paper and the entire section E Use of non-programmable scientific calculator is allowed _________________________________________________________________________________ SECTION-A Origin & development of O.Sharma. Transmanship Problems.D. Gupta And Manmohan. Degeneracy In Transpiration Problems. Linear Programming formulation.. Algebra Of Events. PTU/BOS/MCA/210/13-07-2004 MCA-305 (N2) COMPUTER BASED OPTIMISATION METHODS Internal Assessment: 40 External Assessment: 60 Instructions for paper-setter The question paper will consist of five sections A. References: 1. application. methodology of O.

(MC Graw Hill) . B. syntax analysis. self relocating programs. Paged allocation. Demand paged allocation. features of macro facility. Section D Basic concept so f an operating system and its functions. Absolute loader. pure and impure interpreter Loaders: Compile and go loader. C and D of the question paper and the entire section E Use of non-programmable scientific calculator is allowed _________________________________________________________________________________ Section A Introduction to software processors. compilation of expressions. C and D will have two questions from the respective sections of the syllabus and will carry 10 marks each. Dhamdhere. compilation of control structures. Processor management: Scheduler. and direct linking loader. segmented paged allocation. lexical analysis. intermediate code for expressions. Interpreters: use of interpreter. Donovan. PTU/BOS/MCA/210/13-07-2004 MCA –403 (N2) SYSTEM SOFTWARE Internal Assessment: 40 External Assessment: 60 Instructions for paper-setter The question paper will consist of five sections A. race condition. Section B Macros and microprocessor: macro definition. general design procedure of a two pass assembler Software Tools: Text editor and its design. B. memory allocation. macro expansion. B. Section C Compilers: Aspects of compilation. elements of assemble language programming. TMH. objectives of segmented environment References: 1. 2. C. Memory management: contiguous. relocation and linking concepts. which will cover the entire syllabus uniformly and will carry 20 marks in all. single pass and two pass assembler. Code optimization – local and global optimization. traffic controller. Information management: Structure and features of file systems. Design of a linker.” System Programming”. Relocating loader.”Systems Programming and operating systems”. non-contiguous memory allocation. Linkers – translated linked and load time addresses. Section A. assembly scheme. Nested macro calls. D and E. design of a macro preprocessor. Section E will have 10-20 short answer type questions. Instruction for candidates Candidates are required to attempt one question each from sections A.

. Section A. and Directory structure – single level. Silberscahatz. 2nd. Virtual memory: Demand paging. Allocation algorithms. Section C File Management: File concept. Device management: Disk structure. C and D will have two questions from the respective sections of the syllabus and will carry 10 marks each. Program Threats. SCAN scheduling. System Threats. semaphores. Partition. Swapping. Avoidance. Real time system Process Management: Process concept. multi user. “Operating System Concepts”. Prevention. B. Security: Authentication. CPU scheduling: Basic concepts. domain of protection. 1985. 2. Addison-Wesley publishing Co. Andrew S. file protection. B. Detection and Recovery. simple batch processing. Ed. disk scheduling. C-SCAN scheduling. tree structures. Paging and segmentation. Section B Memory management: Logical versus Physical address space. two lever. parallel Systems. threads. Peterson. its need and operating system services. Thrashing. Multitasking. access methods. Multiprogramming. Selecting Disk Scheduling Algorithms Section D Deadlock: Deadlock characteristics. References: 1. synchronization hardware. Section E will have 10-20 short answer type questions. which will cover the entire syllabus uniformly and will carry 20 marks in all. access matrix. PTU/BOS/MCA/210/13-07-2004 MC-404 (N2) OPERATING SYSTEMS Internal Assessment: 40 External Assessment: 60 Instructions for paper-setter The question paper will consist of five sections A. Tanenbaum “Modern Operating System”. and Encryption. C. B. Instruction for candidates Candidates are required to attempt one question each from sections A. overview of Inter process communication. Scheduling Criteria. FCFS scheduling. Distributed system. combined approach to deadlock handling Resource Management: Mechanism and Policy. acrylic graph and general graph directory. operating system classification – single user. linked and index allocation. Page replacement algorithms. critical section.. free space management. Process scheduling. D and E. Scheduling algorithms. Allocation methods: Contiguous. C and D of the question paper and the entire section E Use of non-programmable scientific calculator is allowed _________________________________________________________________________________ Section A Introduction to operating system. SSTF scheduling.

N. which will cover the entire syllabus uniformly and will carry 20 marks in all. Industrial Robotics. Touch. B. PWM amplifiers. Weins. Motion Planning in fixed. Section B Robot arm kinematics. DH transformation and Inverse Kinematics. and Joint coordinates. Robotics Control. Section D Robot programming and languages and environment: Different methods. Feeders and Oriented Device. C and D of the question paper and the entire section E Use of non-programmable scientific calculator is allowed _________________________________________________________________________________ Section A Introduction to robotics. References: 1. Section E will have 10-20 short answer type questions. C. obstacle Representatives. features of various programming methods. Image processing and analysis. World. Section A.A and Michael “Robotic Engineering” PHI 3. and Robotics sensors: Range. Proximity. Transmission and actuators. McGraw Hill 2. Richard. D and E.D. Changing structured. Fu Gonzalez. Fundamentals of Closed loop control. different methods. B.C. N. Low and High level vision.S. uses of sensors in Robotics. Robot and effectors. K. Robot Task planning: concept. robot learning. The sensing and digitizing function in Machine Vision. Robot Anatomy. Vision and intelligence . Robot Applications.P. M.Groover. Training and vision system. case study. Tool. Classification of Robots. Section C Machine Vision: Introduction to machine Vision. Sensing. Force and Torque Sensing. Mobile Robot: Introduction. C and D will have two questions from the respective sections of the syllabus and will carry 10 marks each. Robotic Application. Instruction for candidates Candidates are required to attempt one question each from sections A.Nage. PID control. B.Odrey. Lee. K. with special reference to servomotors. Industrial application environment and work cells. Manipulators & Mobile Robots. R. Chmielewski T. M. PTU/BOS/MCA/210/13-07-2004 MCA-405-B (N2) ROBOTICS ENGINEERING (ELECTIVE I) Internal Assessment: 40 External Assessment: 60 Instructions for paper-setter The question paper will consist of five sections A.

Ltd." Introduction to artificial Intelligence". Narosa Publishing Co. Section E will have 10-20 short answer type questions. E. Nils J.clausal form. Galgotia Publications Pvt. “Expert Systems for Personal Computers”. 4.F. Inference Mechanisms. References: 1. Resolution. Unification. and Recursion. discourse and pragmatic processing. which will cover the entire syllabus uniformly and will carry 20 marks in all.S. Clofisin and C. Mellish. Sanjiva Nath. C. Strings. Data Structures. Instruction for candidates Candidates are required to attempt one question each from sections A. SECTION B AI Language PROLOG: Operators. 6. 7. Hannah. SECTION C Knowledge Based Systems: Knowledge representation. Controlling Program Flow. . Tata McGraw Hill. Addison-Wesley Publishing Company. M. “Principles of Artificial Intelligence”. Input & Output. B. Introductory Concepts of AI . SECTION D Natural language processing: syntactic processing. organization & Manipulation. PTU/BOS/MCA/210/13-07-2004 MCA-405-A (N2) ARTIFICIAL INTELLIGENCE (ELECTIVE-I) Internal Assessment: 40 External Assessment: 60 Instructions for paper-setter The question paper will consist of five sections A. W. AI application Areas. Section A. “Turbo PROLOG”. Nilson. 5. C and D will have two questions from the respective sections of the syllabus and will carry 10 marks each. 3. Rich and K. Charnaik and D.A. Morphological. Chandwick and J. Patterson. ES-Shells. Narosa Publishing Co. semantic analysis. C and D of the question paper and the entire section E Use of non-programmable scientific calculator is allowed _________________________________________________________________________________ SECTION A Introduction to AI: Definitions. 2. Galgotia Publications Pvt. B. E. Knight. Dealing with uncertainty. B. acquisition." Artificial Intelligence". “Introduction to Artificial Intelligence and Expert Systems”. Ltd. Basic Components & architecture of Expert systems. D and E. “Programming in PROLOG”. PHI. Basic Elements of AI. McDermott. Dan W.

Pre and Post conditions of Methods. Object Design. Prototype Systems and Delegation. Section – D Semantic and Entity Relationship Modeling: Contrasting Design for Databases and OOA/OOD. Implicit of hidden Metaclasses. Overview C + +: Linkages. Object-Oriented Modeling and Design by Rambaugh & Others (Prentice Hall) 2. System Design. Inheriting the Interface. Default Labels. Increment and Decrement A string Class. Input. Section A. Object Oriented User Interface. Implicit Subtyping verses Explicit inheritance. Operator Overloading: Operator Function. Private and Public Members. PTU/BOS/MCA/210/13-07-2004 MCA-405-C (N2) OBJECT ORIENTED ANALYSIS AND DESIGN (ELECTIVE-I) Internal Assessment: 40 External Assessment: 60 Instructions for paper-setter The question paper will consist of five sections A. References 1. Creating and destroying Objects. Hiding Instance Variables inheriting methods. Object Oriented Design.I. Invoking Superclass method. Object Oriented Programming Languages. Entity Relationship Model. How to make a Library. Large Objects. Section E will have 10- 20 short answer type questions. . Mastering C ++ by Robert Lafore. Explicit Support. Overview of Existing methodologies. Public. Deferencing. Templates and Design of Libraries: Output. Object Oriented Analysis & Design: Object Oriented Development. Protected. Object Diagram. Method Overriding.Balagursamy (Tata Mc-Graw Hill) 4. D and E. B. B. Assignments and Intialization. Excluding Super class Methods metaclasses. Inheritance: Subsets as Subtypes. Multiple inheritance. Class & Objects: Data Members. Macros. Functions. Formatting. Dynamic Model. Section – C Inheritance through Extending C: Concept of Inheritance. Object-Oriented Programming: Fundamental and Applications by Sengupta & Chaudhuri (P. Member Functions. Arrays within a class. Object Oriented Programming using C ++ by E. Autonomy. B. Private. Sub typing of Structured Types Contrasting in inheritance with subtyping. Subtyping and dynamic binding class inheritance.H. Methods and Messages. Object Identity. Constrained Overriding. Redefining Instance variables. Friends and Members. C and D of the question paper and the entire section E Use of non-programmable scientific calculator is allowed _______________________________________________________________________________ Section – A Abstract Data Types: Model of Real World. Constraints on object and Instance Variables. Class Function Definition and pass values. Single Inheritance: Privately derived.) 3. Reusability Classes. Subcripting. Object Oriented Languages without Metaclasses. Visibility Modes. Overview of Existing Methodologies: Object Oriented Analysis. C. Section – B Polymorphism. Data hiding and Encapsulation. Instance Values. which will cover the entire syllabus uniformly and will carry 20 marks in all. Design of libraries. C and D will have two questions from the respective sections of the syllabus and will carry 10 marks each. Instruction for candidates Candidates are required to attempt one question each from sections A. Object Oriented Design. Function Call. Streams. Object Modeling concepts. User Defined Type Conversion Literal. Files and Streams. Generation of correct Applications. Object Oriented Database. Publicly derived. Functional Model.

PTU/BOS/MCA/210/13-07-2004 MCA-406 (N2) SOFTWARE LAB VI (RDBMS II) Internal Assessment: 40 External Assessment: 60 This laboratory course will mainly comprise of exercise on what is learnt under the paper: MCA- 401 (RDBMS II). Maximum Marks For Continuous Assessment: 40 Maximum Marks For University Examination: 60 Note: The break up of marks for the practical will be as under Lab Record 15 marks Viva Voce 15 marks Program development 30 marks And execution .

PTU/BOS/MCA/210/13-07-2004 MCA-407 (N2) Practical S/W Lab . .VII Internal Assessment 40 External Assessment 60 Paper MCA-404 Practical to Learn NT/Unix/Linux commands.

Random Scan Systems.Kalley . 3-D Viewing Transformation And Clipping. Phong Shading. Breshenham’s Algorithm. Joysticks. B. PTU/BOS/MCA/210/13-07-2004 MCA-501 (N2) COMPUTER GRAPHICS Internal Assessment: 40 External Assessment: 60 Instructions for paper-setter The question paper will consist of five sections A. Video Display Devices: Refresh Cathode–Ray Tube. Reflection.Hearn And M. Mathematics And Projections (Parallel And Perspective). Color CRT-Monitors. Refracted Light. SECTION – D Hidden Line Surface Removal Algorithms. Dot Matrix Printers. Laser. Electrostatic. References: 1. Instruction for candidates Candidates are required to attempt one question each from sections A.K. Such As Line Printers. Light Pens. Rotation. Reflection. Area Filling Techniques.Phillips 3. Trackball. Digitizer.Plastock And G. Surface Shading Methods: Constant Intensity Method. Scaling. C. Raster Scan Display. "Introduction To Computer Graphics” J. Shearing). R. Sub Division Shading: Modeling Light Intensities: Diffuse Reflection. which will cover the entire syllabus uniformly and will carry 20 marks in all. B.Baker 2. Voice Systems. Polygon And Text) SECTION-C 3-Dimensional Graphics: Geometrical Transformation (Translation. Two Dimensional Viewing Transformation And Clipping (Line.Feiner. Input Device: Keyboard Touch Panel.Foley.Hughes. Section E will have 10- 20 short answer type questions. Geometrical Transformation (Translation. C and D of the question paper and the entire section E Use of non-programmable scientific calculator is allowed _________________________________________________________________________________ SECTION A Graphics Hardware: The Functional Characteristics Of The Systems Are Emphasized. Flat Panel Displays. Ink- Jet. Direct View Storage Tube. A.L.P. Gouraud Shading. Half toning.A. Circle And Ellipse. Scan Line. Character Generation. Graphic Tablets. Z-Buffer.Dam. Shearing). Scaling. Mouse. Raster Scan Systems. 2-Dimensional Graphics: Cartesian And Homogenous Co-Ordinate Systems.D. ”Computer Graphics” R. Data Glove. ”Computer Graphics” by D. J. Flatbed And Drum Plotters. Hard Copy Devices: Impact And Non Impact Printers. Graphic Monitors And Workstation. S. D and E.F. SECTION-B Scan Conversation Algorithm Line. C and D will have two questions from the respective sections of the syllabus and will carry 10 marks each. B. Random Scan Displays. Image Scanner. Section A.V. 3-D Viewing Devices. Rotation.

WAIS (Wide Area Information Service). ECOM And Portals. Data Types. Difference Between HTML And DHTML. JDBC. Modifiers And Expressions. E-Mail Basic. Domain Name Revolution. Network Programming. What Special About Internet? Dial Up Connection/Direct Connection. Application & JDK. Flat Name Space. D and E. Slip Or PPP WWW: The Client Site. Internet Addressing. B. Domain Name System: Name for Machine. TELNET. Java 2 The Complete Reference By Petric Noughton And Herbet Schildt. SECTION –B Internet Internals: Transmission Control Protocol/Internet Protocol (TCP/IP). PTU/BOS/MCA/210/13-07-2004 MCA-502 (N2) INTERNET PROGRAMMING AND JAVA Internal Assessment: 40 External Assessment: 60 Instructions for paper-setter The question paper will consist of five sections A. Section E will have 10-20 short answer type questions. JComponents. Internetworking With TCP/IP Vol-I Third Edition (Phi) By Douglas E. Instruction for candidates Candidates are required to attempt one question each from sections A. Server Site. Inheritance And Polymorphisms. Constructors. HTTP. Web Pages In HTML. Section A. IP Address. Event Handling. Array and Flow Control Statement. B. Hierarchical Names Internet Domain Names. C. REFERENCES: - 1. C and D of the question paper and the entire section E Use of non-programmable scientific calculator is allowed _______________________________________________________________________________ SECTION-A Internet Basics: What Is Internet. Data Types. B. Differences between Java and C++. URL. FTP. SECTION-D Socket Interface: Socket Abstraction. SECTION-C Introduction To Java: Applets. Receiving Data Through A Socket. Working With Java Objects: Encapsulation. Threads. . which will cover the entire syllabus uniformly and will carry 20 marks in all. Using Socket With Servers. Garbage Collection and finalize. C and D will have two questions from the respective sections of the syllabus and will carry 10 marks each. CGI Programming Overview. Exception Handling. Comer 2. Environment Variables. Creating Socket. Electronic Mail Address.

How to create dynamic web pages. REFERENCES: 1. GOPHER. forms and their advantages. processing data using session variables. FTP. which will cover the entire syllabus uniformly and will carry 20 marks in all. Ray 3. C. D and E. B. network protocols. its origin. Data base connectivity through ADO’s. HTTP. SECTION-C DHTML (Dynamic HTML) What is DHTML? Style sheets. Instruction for candidates Candidates are required to attempt one question each from sections A. SECTION-B HTML (hypertext marking language) Basic HTML and tags. Section A. connectivity and service. C and D will have two questions from the respective sections of the syllabus and will carry 10 marks each. Under standing ASP objects model. Asp In 21 Days . C and D of the question paper and the entire section E Use of non-programmable scientific calculator is allowed _______________________________________________________________________________ SECTION-A Internet Fundamentals Internet. B. Java Script: R. Mastering HTML 4. Introduction to www. B. Section E will have 10-20 short answer type questions. Allenwyke 4. What is the purpose of global asa file. Telnet. PTU/BOS/MCA/210/13-07-2004 MCA 503-A (N2) E-Commerce (Elective II) Internal Assessment: 40 External Assessment: 60 Instructions for paper-setter The question paper will consist of five sections A. Creating tables. their advantages and interaction with scripting language. Java script objects and events. SECTION-D ASP (Active Server Pages) Introduction to ASP technology.S. usability.0 BPB: D. Internet facilities through www.Internet For Every One: Leon And Leon 2. Language description. cookies. static creation of HTML web pages.

Aho. B. Finite Automata. D and E. Compiler Tools. which will cover the entire syllabus uniformly and will carry 20 marks in all. C and D of the question paper and the entire section E Use of non-programmable scientific calculator is allowed SECTION–A The Structure Of A Compiler. Conversion From Regular Expression To Finite Automata. Instruction for candidates Candidates are required to attempt one question each from sections A. Phase Trees. Section A.Ullman: “compiler principles. Code Generation. Regular Expressions. techniques & tools” . Phase Of A Compiler. Context Free Grammars. Problem In Code Generation. Parameter Passing. B. Top Down & Bottom Up Parsing Techniques. SECTION-D Run Time Environment: Storage Organization. Aho & ulman: “principles of compiler design” 2. Syntax Trees. C. Symbol Tables. Storage Allocation Strategies. SECTION-B Syntax Analysis. Intermediate Code. B. SLR&LALR Parsers. Ravi Sethi Jaffery D. Construction of LR. SECTION-C Syntax Directed Translation & Their Implementation. A Simple Code Generation & Code Optimization: Principle Sources. Postfix Translation. Loop Optimization. Section E will have 10-20 short answer type questions. C and D will have two questions from the respective sections of the syllabus and will carry 10 marks each. DAG Representation REFERENCES:- 1. PTU/BOS/MCA/210/13-07-2004 MCA-503-B (N2) COMPILER DESIGN (Elective II) Internal Assessment: 40 External Assessment: 60 Instructions for paper-setter The question paper will consist of five sections A.Alfred V.

which will cover the entire syllabus uniformly and will carry 20 marks in all. Alpha 2106. B.T.Rafiquzzaman : Microprocessors and microcomputers 3. M. C. C and D will have two questions from the respective sections of the syllabus and will carry 10 marks each. B. Instruction for candidates Candidates are required to attempt one question each from sections A. PTU/BOS/MCA/210/13-07-2004 MCA-504-B (N2) ADVANCED MICRO PROCESSORS SYSTEMS (Elective III) Internal Assessment: 40 External Assessment: 60 Instructions for paper-setter The question paper will consist of five sections A. B.Kain : IEEE Press 1984 2. J. Case Studies SECTION-C 403 GA Development Systems and Support Contents SECTION-D Selected Applications References: 1. Pentium super space. D and E. Section A. Daniel Tabak : Advanced microprocessors McGraw Hill . Section E will have 10-20 short answer type questions. C and D of the question paper and the entire section E Use of non-programmable scientific calculator is allowed _______________________________________________________________________________ SECTION-A Review of 8 bit microprocessors and support components Selected Case Studies of 16/32//64 bit microprocessors and support Contents SECTION-B Power PC 601. Transporter Architectures and Case Studies: High Performance Embed Micro controllers.

Introduction to GPSS. Discrete system simulation. Generation of Random numbers. SECTION-D Case study: Simulation of an autopilot. Simulation of single and two server queue. Narsingh Deo “System Simulation with Digital Computers” PHI 2. C and D will have two questions from the respective sections of the syllabus and will carry 10 marks each. System Analysis. C. Instruction for candidates Candidates are required to attempt one question each from sections A. SECTION-B Probability concepts in simulation: Stochastic variables and probability functions. which will cover the entire syllabus uniformly and will carry 20 marks in all. Types of Models. System design. Monte Carlo Computation V/S Stochastic simulation. C and D of the question paper and the entire section E Use of non-programmable scientific calculator is allowed SECTION-A System Models: Concept Environment. B. Section E will have 10-20 short answer type questions. Subsystems. method types. Telephone system & Inventory system. PTU/BOS/MCA/210/13-07-2004 MCA-504-A (N2) SYSTEM SIMULATION & MODELLING (Elective III) Internal Assessment: 40 External Assessment: 60 Instructions for paper-setter The question paper will consist of five sections A . G. B. Network Model of a project. Section A. D and E. System simulation: Technique. fixed time step v/s event-to-event model.Gordon “System Simulation” PHI . Continues and discrete systems. References: 1. B. SECTION-C Simulation of Queuing system.

PTU/BOS/MCA/210/13-07-2004 MCA-505 (N2) SOFTWARE LAB VIII (Graphics) Internal Assessment: 40 External Assessment: 60 This laboratory course will mainly comprise of exercise on what is learnt under the paper: MCA-501 Maximum Marks For Continuous Assessment: 40 Maximum Marks For University Examination: 60 Note: The break up of marks for the practical will be as under Lab Record 15 Marks Viva Voce 15 Marks Program Development 30 Marks And Execution .

PTU/BOS/MCA/210/13-07-2004 MCA-506 (N2) SOFTWARE LAB IX (Java) Internal Assessment: 40 External Assessment: 60 This laboratory course will mainly comprise of exercise on what is learnt under the paper: MCA-502 Maximum Marks For Continuous Assessment: 40 Maximum Marks For University Examination: 60 Note: The break up of marks for the practical will be as under Lab Record 15 Marks Viva Voce 15 Marks Program Development 30 Marks And Execution .

. computer mathematical fondation. PTU/BOS/MCA/210/13-07-2004 MCA-507 (N2) Comprehensive Viva Voce External Assessment: 100 This course will mainly comprise of what is learnt under the MCA course. A student should make a programe of his/her choice written in atleast four different languages like basic. which should have atleast 100 terms drawn from topics relevant to the courses studied by him/her during MCA. A student should present a file at the time of viva-voce. The programe should solve a problem based on MCA-104 (N2). . The choice should be as per student’s own method of selection. The listings and the solution should be presented to the examiner. C. C++ and java.

division in which you are working. S/W. Academic dairy is to be maintained by the student which should have day to day work done by him/her. ¾System requirements o Product Definition ƒProblem Statement ƒFunction to be Provided ƒProcessing Environment: H/W. Project: 400 Marks The evaluation committee will distribute these marks for seminar/viva/voce/ Project report and for any other activity. location. ¾A brief overview of the organization (regarding function area. turnover) ¾Profile of problems assigned. abstract of the project (abstract of actual workdone). This dairy should be presented at the time of viva. ƒSolution Strategy ƒAcceptance Criteria o Feasibility Analysis o Project Plan ƒTeam Structure ƒDevelopment Schedule ƒProgramming Languages And Development Tools ¾System Requirement Specifications o Developing / Operating / Maintenance Environments . which the committee thinks to be proper. Format Of Project Report ¾Title Cover ¾Certificate from organization about your stay (Project Duration) at that place and about submission of work done under external guide at the place of training. ¾Table of Contents. as decided by the Head of the Department. Individual project will be recognized and the student should highlight their contribution in a joint project report. ¾Study of existing system. ¾Certificate from your guide about the submission of work done under his/her guidance. PTU/BOS/MCA/210/13-07-2004 MCA-601 (N2) SYLLABUS OUTLINE OF PAPER AND TESTS MCA (Master of Computer Applications) Project in a Computer Organization/University computer Center/Dept. Internal Supervisor. of Computer Science. Committee for evaluation of project report / work: Head of department / director Internal guide (if any) faculty External examiner. if any. etc. Joint project will be allowed and joint project report will be also being accepted.

user command summary ƒHigh level DFD and data dictionary o Functional and performance specifications ¾Design o Detailed DFD’s and structure diagrams o Data structures. Performance. You may add to. You may also consult your internal supervisor for the same. .The above is meant to serve as a guideline for preparation of your project report. database and file specifications o Pseudo Code ¾Test Plan o Functional. Stress tests etc. ¾Implementation / Conversion Plan ¾Project Legacy o Current status of project o Remaining areas of concern o Technical and managerial lessons learnt o Future recommendations ¾Bibliography ¾Source Code (if available) Note: . PTU/BOS/MCA/210/13-07-2004 o External Interface And Data Flows ƒUser display and report format. modify or omit some of the above-mentioned points depending upon their relevance to your project.