PUNJABI UNIVERSITY, PATIALA

OUTLINES OF TESTS, SYLLABI AND COURSES OF READINGS FOR MCA (MASTER OF COMPUTER APPLICATIONS) (SEMESTER SYSTEM) 2nd Year ( III & IV Semester) 2010-11 & 2011-12 Sessions

ANNEXURE-I SYLLABUS OUTLINES OF PAPERS AND TESTS M.C.A. (MASTER OF COMPUTER APPLICATIONS) SECOND YEAR-THIRD SEMESTER EXAMINATIONS YEAR 2010-11 & 2011-12 Sessions CODE NO. TITLE OF PAPER CONTINUOUS ASSESSMENT MCA-211 MCA-212 MCA-213 MCA-214 MCA-215 MCA-216 Data Communications Software Engineering Algorithm Analysis & Design Data Base Management System Web Programming using ASP.NET Programming Lab-III (ASP.NET and Oracle Lab and Minor Project) Total 50 50 50 50 50 60 310 MAXIMUM MARKS UNIVERSITY EXAMINATION 50 50 50 50 50 40 290 TOTAL MARKS 100 100 100 100 100 100 600 TIME TOTAL ALLOWED 3 Hrs. 3 Hrs 3 Hrs. 3 Hrs. 3 Hrs. 3 Hrs.

CONTINUOUS ASSESSMENT (THEORY PAPERS) 1. Two or three tests out of which minimum two will be considered for assessment. Seminars/Assignments/Quizzes Attendance, class participation and behaviour 60% of the marks allotted for Continuous Assessment.

2. 3.

30% of the marks allotted for Continuous Assessment. 10% of the marks allotted for Continuous Assessment.

ANNEXURE-I SYLLABUS OUTLINES OF PAPERS AND TESTS M.C.A. (MASTER OF COMPUTER APPLICATIONS) SECOND YEAR-FOURTH SEMESTER EXAMINATIONS YEAR 2010-11 & 2011-12 Session CODE NO. TITLE OF PAPER CONTINUOUS ASSESSMENT MCA-221 MCA-222 MCA-223 MCA-224 MCA-225 MCA-226 Computer Networks Operating Systems Programming in Java Object Oriented Modelling Design Using UML Life Skills and Communication Skills Programming Lab IV (Java Lab and Minor Project) Total & 50 50 50 50 60 60 320 MAXIMUM MARKS UNIVERSITY EXAMINATION 50 50 50 50 40 40 280 TOTAL MARKS 100 100 100 100 100 100 600 TIME TOTAL ALLOWED 3 Hrs. 3 Hrs 3 Hrs. 3 Hrs. 3 Hrs. 3 Hrs.

CONTINUOUS ASSESSMENT (THEORY PAPERS) 1. Two or three tests out of which minimum two will be considered for assessment. Seminars/Assignments/Quizzes Attendance, class participation and behaviour 60% of the marks allotted for Continuous Assessment.

2. 3.

30% of the marks allotted for Continuous Assessment. 10% of the marks allotted for Continuous Assessment.

LTPC 3104 MCA-211: Data Communications Maximum Marks: 50 Minimum Pass Marks: 40% Maximum Time: 3 Hrs. Lectures to be delivered: 45-55

A) Instructions for paper-setter The question paper will consist of five sections A, B, C, D and E. Sections A, B, C and D will have two questions from the respective sections of the syllabus and will carry 20% marks each. Section E will have 5-10 short answer type questions which will cover the entire syllabus uniformly and will carry 20% marks in all. B) Instructions for candidates 1. Candidates are required to attempt one question each from sections A, B, C and D of the question paper E. 2. Use of non-programmable scientific calculator is allowed. SECTION A Introduction to Data Communications: Concepts & Terminology, Analog & Digital. Data Transmission: Data Signals & Transmission, Transmission Impairments, Electromagnetic spectrum. Transmission Media: Guided Transmission Media - twisted pair, coaxial cable, fibre optics, Unguided Transmission media Terrestrial microwave, Satellite, microwave, Broad cast Radio, Infrared. SECTION B Data Encoding: Digital Data, Digital Signals : NRZ, Multilevel Binary, Biphase, Modulation Rate, Scrambling Technique, Digital Data, Analog Signals : ASK, FSK, PSK. Analog Data, Digital Signals : PCM, DM. Analog Data, Analog Signals : Amplitude Modulation, FM, PM, QAM. SECTION C Asynchronous & Synchronous Transmissions. Line Configuration: Topology, full Duplex, Half Duplex, Intufacting. Multiplexing: FDM,. Synchronous TDM, Statistical TDM. Error Detection & Correction: Nature of Errors, Parity check, CRC, Hamming code. SECTION D Circuit Switching: Switching networks, circuit, switching networks, circuit switching concepts, routing in circuit, switching networks. Packet switches: Packet switching principles, routing in packet switching. Asynchronous Transfer mode (ATM): Protocol Architecture ATM logical connection, ATM calls, Transmission of cells, ATM Service Categories. Text Book 1. 2. Data & Computer Communications by William Stallings, Pearson Education. Infosys Campus Connect Foundation Program Volume:1 3, Education & Research Department, Infosys Technologies Ltd , Bangalore. and the entire section

LTPC 3104 MCA-212: Software Engineering Maximum Marks: 50 Minimum Pass Marks: 40% Maximum Time: 3 Hrs. Lectures to be delivered: 45-55

A) Instructions for paper-setter The question paper will consist of five sections A, B, C, D and E. Sections A, B, C and D will have two questions from the respective sections of the syllabus and will carry 20% marks each. Section E will have 5-10 short answer type questions which will cover the entire syllabus uniformly and will carry 20% marks in all. B) Instructions for candidates 1. Candidates are required to attempt one question each from sections A, B, C and D of the question paper E. 2. Use of non-programmable scientific calculator is allowed. SECTION A Introduction to Software Engineering: Problem Domain, Challenges, Software Engineering Approach ; Software Development process: Process Characteristics, Process Models : Waterfall, Prototype, Spiral, Iterative Enhancement; Project Management Process, The Inspection process, Software Configuration Management Process, Requirements Change. Management Process. Software Process Planning, Effort Estimation, Project Scheduling and Staffing, Risk Management. SECTION B Software Requirements Analysis and Specification: Analysis Approaches, Characteristics and Components of SRS, Validation, Metrics. Software Design: Design Principles, Module level concepts, Design Notation and Specification, Structured Design Methodology, Verification, Metrics, OO Analysis and OO Design, OO Concepts, Object oriented Design Methodology approach. Coding : Programming practice, Verification : code reading, reviews, static analysis, symbolic execution. SECTION C User-Interface Design : Introduction to User-Interface Design, Elements, Design Principles, Design Tips and Techniques, Good v/s Bad Interface. Software Metrics : Software Measurement and Metrics, Designing Software Metrics, Classification of Software Metrics, Issues in Software metrics,. Software Quality : Quality concepts, Software Quality Assurance Group, Activities, ISO 9000. Capability Maturity Model, SixSigma , Metrics for Software Quality, McCabs cyclomatic complexty metric. Software Reliability : Definition, Basic Concepts, Parameters for Evaluation. SECTION D Software Testing : Objectives, Principles, Test case design, White-Box testing and Black-Box testing techniques : Equivalence class partitioning, Boundary value analysis, cause-effect graphing, Graph Based Testing and mutation testing. Object-Oriented Testing : Comparison with traditional testing, Testing techniques, metrics for OO testing : CK metric suite, Lorenz and Kidds metric suite, Debugging. Software Re-engineering : Basics of Software Re-engineering, Re-engineering Process Model, Legacy Systems. and the entire section

Text Book 1. P. Jalota, "An Integrated Approach to Software Engineering", Third Edition, Narosa Publications 2005. References: 1. 2. 3. 4. 5. 6. 7. E. Fairley, "Software Engineering Concepts", McGraw-Hill, 1985. Rohit Khurana, Software Engineering : Principles and Practices, Vikas Publishing House 2007. Ian Sommerville, Software Engineering , Pearson Education, 2001 Roger. S. Pressman, Software Engineering - A Practitioners Approach, Fifth Edition, McGraw Hill, 2001 Designing User Interface, James E Powell, Galgotia Publications, 1991. About face : The Essentials of User Interface Design, Alan Cooper, IDG Books World Wide, Inc., 1995 Infosys Campus Connect Foundation Program Volume:1 3, Education & Research Department, Infosys Technologies Ltd , Bangalore.

LTPC 3104 MCA-213: Algorithm Analysis & Design Maximum Marks: 50 Minimum Pass Marks: 40% Maximum Time: 3 Hrs. Lectures to be delivered: 45-55

A) Instructions for paper-setter The question paper will consist of five sections A, B, C, D and E. Sections A, B, C and D will have two questions from the respective sections of the syllabus and will carry 20% marks each. Section E will have 5-10 short answer type questions which will cover the entire syllabus uniformly and will carry 20% marks in all. B) Instructions for candidates 1. Candidates are required to attempt one question each from sections A, B, C and D of the question paper E. 2. Use of non-programmable scientific calculator is allowed. SECTION A Introduction to algorithm analysis: Introduction to algorithms, Algorithm Specifications, performance analysis, case study on analysis of algorithms. Recursion and Induction: recursive procedures, induction proofs, proving correctness, recurrence equations, recursion. Randomized Algorithms: Basic of Probability Theory, Description of Randomized algorithms, Identifying the repeated Elements, Primality Testing, Advantages and Disadvantages of using randomized algorithms. SECTION B Algorithmic Techniques: Introduction to Brute Force, Greedy, Divide and Conquer and Dynamic Programming techniques. Linear Search Algorithm, Performance analysis of linear search algorithm, Binary Search Algorithm, Performance analysis of Binary Search Algorithm Divide and conquer technique of problem solving: Quick sort, Merge Sort and Selection Sort Algorithms and their Performance Analysis. SECTION C Greedy algorithms: General Method, Case Study based on Greedy Algorithm (Knapsack Problem), Minimum-cost Spanning Trees: Prims algorithm, kruskals minimal spanning trees, Single source shortest paths, transitive closure and APSP problem. SECTION D Dynamic Programming: General Method, Multistage graphs, All Pair Shortest Paths, Optimal Binary Search Trees, String Editing. Intractable Problems: Nondeterministic Algorithms, NP Hard and NP complete Problems, NP Hard Graph Problem(Travelling Salesman problem), NP Hard Scheduling Problems (Job Shop Scheduling) Text Books: Sartaj Sahniet. Al : Fundamentals of Computer Algorithms, second edition, Universities Press. References: 1. Coreman, Leiserson & Rivest : Introduction to Algorithm, PHI Publication. 2. Aho t et. al. : Design & Analysis of Computer Algorithm, Pearson Education. 3. Infosys, Campus Connect, Analysis of Algorithms, Vol-3 4. Knuth : The art of programming (Vol I to III), Pearson Education. 5. Weiss M.A. : Data Structures and Algorithm Analysis in C, IInd Ed., Pearson Education. 6. Heilemau G. L. : Data Structures, Algorithm and Object Oriented Programming, T.M. H. Publications 7. Goodman S.E. and Hedeniemi : Introduction to the Design and Analysis and Algorithms, TMH Publications. 8. Sara Baose, Gelder A.V. : Computer Introduction to Design and Analysis Algorithms, 3rd Edition, Pearson Educations, Inc. and the entire section

LTPC 3104 MCA-214: Database Management System Maximum Marks: 50 Minimum Pass Marks: 40% Maximum Time: 3 Hrs. Lectures to be delivered: 45-55

A) Instructions for paper-setter The question paper will consist of five sections A, B, C, D and E. Sections A, B, C and D will have two questions from the respective sections of the syllabus and will carry 20% marks each. Section E will have 5-10 short answer type questions which will cover the entire syllabus uniformly and will carry 20% marks in all. B) Instructions for candidates 1. Candidates are required to attempt one question each from sections A, B, C and D of the question paper E. 2. Use of non-programmable scientific calculator is allowed. SECTION A Introduction to DBMS: Definition of Database, DBMS. File System Interface versus DBMS Interface, Master and Transaction Files Traditional Approach to Information Processing : Characteristics and Limitations. Components of DBMS Environment, Database Schema and Instance. Advantages of DBMS, Disadvantages of DBMS. Difference between Centralized and Distributed databases. Three Level architecture of DBMS, Mapping between different levels, Data Independence DBMS Users, Data Dictionary. Data Models: Definition Object Based Logical Model: E-R model: Definition, Entity and Relationship, cardinality of a relationship, E-R Diagram Notations, Modeling using E-R Diagrams, Aggregation, Generalization, Specialization, Transforming E-R Model into Physical database Design, merits and demerits of E-R Modeling. Record Based Logical Models: Hierarchical Model: Operations, Implementation, Advantages and Disadvantages. Network Model: Operations, Implementation, Advantages and Disadvantages. Relational Data Model: Basic Terminology, Operations, Advantages and Disadvantages. Comparison between Hierarchical, Network and Relational Model SECTION B RDBMS: Relational database, Definition of RDBMS Keys : Definition, Types: Super, Candidate, Primary, Alternate, Composite and Foreign Key. Relational Integrity Rules, CODDs Rules Relational Algebra: definition, Types of relational operator Relational Calculus: definition , Tuple and Domain oriented Relational Calculus. Normalization: Definition, Need, Process: Determinant, Functional Dependency, Full Functional Dependency, Partial Dependency, Transitive dependency, Multivalued Dependency, Join Dependency, Typed of Normal Forms, Merits and Demerits of Normalization. SECTION C Structured Query Language (SQL) : Purpose, Brief History, Data Types, Statement types. DDL Statements: Create table , Alter Table , Drop table , Truncate Table, Create Index DML Statements: Insert, Delete, Update, Select, Sub Queries, JOINS, Queries using EXISTS / NOT EXISTS, The Order of Execution of a SELECT Statement Views: Horizontal, Vertical, Drop, Joined. View Updates. Checking View Updates (Check Option), Advantages and Disadvantages of Views. DCL: Granting and Revoking Privileges. Limitations of SQL. Embedded SQL: Purpose and Need. PL/SQL, Cursors, Sequence, Triggers, Procedures and Functions. and the entire section

SECTION D On-line Transaction Processing (OLTP): Transaction, Transaction Processing Systems : Batch, On-line, Real time, Transaction Properties, Requirements of OLTP System: Integrity : Domain, Entity and Referential, Concurrency: Definition, Possible Problems : Lost Update, Dirty read, Incorrect Summary, Phantom Record, Locking, Granularity of Locking, Intent Locking, Deadlock, Timestamping. Security: Privileges, Granting and Revoking Privileges and roles. Recovery: Transaction Log: Deferred Update, Immediate Update, Check-Points, Shadow Paging. Online Analytical Processing (OLAP): Definition, OLTP Versus OLAP, Data Warehouse: Definition, Need, Characteristics, Terminology : Data Sources, Meta data, Measure attributes, dimension attributes. Data Collection for Data Warehouse Applications: ETL , Storing of data in data warehouse : Dimensional Modeling, Fact Tables, Dimension Tables, Cube, Dimension Hierarchies, Schemas for Dimensional Modeling, Reporting of a data warehouse application : Advantage of data marts. Difference between Data Warehouse and Data mart. Popular Tools available for data warehousing : Reporting / Analysis Tools, ETL, Databases. Text Book: 1. Elmasry, Navathe, Fundamentals of Database System, Pearson Education. 2. Henry F. Korth, A Silberschhatz, Database Concepts," Tata McGraw Hill. 3. C.J. Date ," An Introduction to Database Systems, Pearson Education. 4. Oracle SQL Complete Reference, Tata McGrawHill. References: 1. Infosys Campus Connect Foundation Program Vol-2, Education & Research Department, Infosys Technologies Ltd , Bangalore.

LTPC 3104 MCA-215: Web Programming using ASP.NET Maximum Marks: 50 Minimum Pass Marks: 40% Maximum Time: 3 Hrs. Lectures to be delivered: 45-55

A) Instructions for paper-setter The question paper will consist of five sections A, B, C, D and E. Sections A, B, C and D will have two questions from the respective sections of the syllabus and will carry 20% marks each. Section E will have 5-10 short answer type questions which will cover the entire syllabus uniformly and will carry 20% marks in all. B) Instructions for candidates 1. Candidates are required to attempt one question each from sections A, B, C and D of the question paper E. 2. Use of non-programmable scientific calculator is allowed. SECTION A Introduction to Microsoft ASP.NET, .Net Framework, An overview of .NET including the Common Language Interface, the Common Type System, the Common Language Runtime, and .NET Framework and class libraries. Language and platform neutrality. An introduction to Web Forms, The ASP.NET execution model,. SECTION B ASP.NET Web Application User Interface: Creating an ASP.NET Web application user interface, Implementing event handlers by using code-behind files, Explain user input by using validation controls, Create and use user controls, Server-side controls, events. SECTION C Managing State: The Various Means to Manage State, Request object, Application object, Cache object, Session object, Serverside state management, Using session for server-side and client-side state management. XML Web Services: Need of XML Web services, Understanding the Web Service Model, Creating an ASP.NET Web Service, Creating & Consuming Web Services with Visual Studio .NET, Creating Web Services, Discovering Web Services, Instantiating and Invoking Web Services, Creating Web reference proxy for an XML Web service, Consuming web services in both Windows Forms and Web apps. Creating a User Interface: Using Controls, Validating Data, Navigating Between Forms Implementing Navigation for the User Interface: Round Trip and Post back, State Management for user navigation, Navigation between Pages SECTION D Storing and Retrieving Data with ADO.NET: ADO.NET Overview, Connecting to Data, Executing SQL with Commands, Accessing Data with ADO.NET, Fast Data Access with DataReaders, DataSet Basics, Filling DataSets with DataAdapters, Using Data Sets on Web Forms, Processing Transactions Data Binding: Bind Data to the UI, Transform and Filter Data. Security: Authenticating and Authorizing Users, Using Windows Authentication, Using Forms Authentication Configuring, Tracing and Debugging Web Application: Configuration Files, Configuration Settings, Debugging Applications, Page-Level Tracing, Application-Level Tracing, Using Caching Page: Output Caching, User Control Caching, Data Caching. Handling Session State. and the entire section

10

Text Book: 1. Matthew MacDonald: ASP.NET: The Complete Reference, Osborne. References: 1. Jesse Liberty, Dan Hurwitz: Programming ASP.NET, OReilly. 2. Stephen Walther: ASP.NET 3.5 Unleashed, SAMS. 3. Infosys Campus Connect Foundation Program Volume:1 3, Education & Research Department, Infosys Technologies Ltd , Bangalore.

11

LTPC 0066 MCA-216: Programming Lab-III (ASP.NET and Oracle Lab and Minor Project) Maximum Marks: 100* Minimum Pass Marks: 40% Maximum Time: 3 Hrs. Practical units to be conducted: 55-60

This laboratory course will mainly comprise of exercises on what is learnt under the paper MCA-215: Web Programming using ASP.NET and a Minor Project in ASP.NET and Oracle. For the minor projects in a team of maximum size three will be allowed and the team will submit joint project report. The student team members must highlight their role and/or contributions in the joint project report. *The splitting of marks is as under Maximum Marks for Continuous Assessment : 60** Maximum Marks for University Examination : 40*** ** For the Continuous Assessment the evaluation will be done on the following basis 1. Two or three tests out of the which minimum one will be considered for assessment. Lab Assignments File Attendance, class participation and behaviour 60% of the marks allotted for Continuous Assessment.

2. 3.

30% of the marks allotted for Continuous Assessment. 10% of the marks allotted for Continuous Assessment.

*** For University Examination the evaluator will distribute the marks for the minor project work according to the following guidelines: Demonstration of Project Presentation and Viva Voce Project Report Document Source Code 50% of the marks allotted for University Examination 25% of the marks allotted for University Examination 15% of the marks allotted for University Examination 10% of the marks allotted for University Examination.

12

LTPC 3104 MCA-221: Computer Networks Maximum Marks: 50 Minimum Pass Marks: 40% Maximum Time: 3 Hrs. Lectures to be delivered: 45-55

A) Instructions for paper-setter The question paper will consist of five sections A, B, C, D and E. Sections A, B, C and D will have two questions from the respective sections of the syllabus and will carry 20% marks each. Section E will have 5-10 short answer type questions which will cover the entire syllabus uniformly and will carry 20% marks in all. B) Instructions for candidates 1. Candidates are required to attempt one question each from sections A, B, C and D of the question paper E. 2. Use of non-programmable scientific calculator is allowed. SECTION A: Introduction: uses of computer networks, Network hardware LAN, MAN, WAN, Wireless Networks, Internet works. Network Software Protocol hierarchies, Design issues for layers, Interfaces and services, types of services, service primitives, Reference models: OSI model, TCP/IP model, and Comparison of TCP/IP and OSI models. ISDN: Narrowband ISDN Services, architecture, Interface, Broadband ISDN and ATM virtual circuits and circuit switching, Transmission in ATM and ATM switches. SECTION B: Medium Access Sub layer: Static and dynamic channel allocation, Multiple access protocols - ALOHA, CSMA, CSMA/CD, Collision Free protocol, Limited-contention protocols, WDMA. Introduction to IEEE standards for LAN: Ethernet LAN (802.3), Token Bus (802.4), Token Ring (802.5), Wireless LAN(802.11, 802.15, 802.16 ) High speed LAN: FDDI, Fast Ethernet, HIPPI, Fibre channel. SECTION C: Data Link Layer: Design issues, Elementary data link protocols, sliding windows protocols. Network Layer: Design Issues. Routing Algorithms The optimality principle, Shortest path routing, flooding, flow based routing, distance vector routing, link state routing, Hierarchical routing, routing for mobile hosts, broadcast routing, multi cast routing. Congestion Control General principles, prevention policies, Traffic shaping, flow specification, congestion Control in virtual circuits, choke packets, load shedding, jitter control and congestion Control in multicasting. SECTION D: Internet protocols: How networks differ, internetworking devices, concatenated virtual circuits, connectionless internetworking, IPv6. Network Security: Security requirements, attacks, Cryptography principles, public key encryption and digital Signatures. Network Applications: SNMP model, protocol, Electronic mail architecture, services, user agents, message formats, message transfer, World Wide Web architecture, HTTP, Web browsers, HTML, URL. and the entire section

13

Text Books : 1. 2. Tanenbaum A. S. Computer Networks, 3rd Edition, PHI publications, . Data Communications & Networking by Forouzan, Tata McGraw Hills.

References: 1. 2. Infosys Campus Connect Foundation Program Volume:1 3, Education & Research Department, Infosys Technologies Ltd , Bangalore. Comer Douglas E, Computer Networks and Internet, 2nd Edition, PH, 2000

14

LTPC 3104 MCA-222: Operating Systems Maximum Marks: 50 Minimum Pass Marks: 40% Maximum Time: 3 Hrs. Lectures to be delivered: 45-55

A) Instructions for paper-setter The question paper will consist of five sections A, B, C, D and E. Sections A, B, C and D will have two questions from the respective sections of the syllabus and will carry 20% marks each. Section E will have 5-10 short answer type questions which will cover the entire syllabus uniformly and will carry 20% marks in all. B) Instructions for candidates 1. Candidates are required to attempt one question each from sections A, B, C and D of the question paper and the entire section E. 2. Use of non-programmable scientific calculator is allowed. SECTION A Introduction: Operating System as Resource Manager, types of operating system - batch processing, Multiprogramming, Multitasking, time sharing, parallel, distributed and PC operating system. Operating system structure, System services, system calls, system design and implementation. Process management: Process Concept, process scheduling, operations on process, co-operating process, inter process communication. CPU scheduling Criteria, scheduling algorithms and algorithm evaluation. SECTION B Process synchronisation: critical section problem, semaphores, critical regions, monitors. Deadlock: necessary conditions, deadlock prevention, deadlock avoidance, deadlock detection and recovery. File System: file concept, access methods, directory structure, directory implementation, allocation methods, examples of MSDOS and i-node structure of Unix file system. Disk scheduling: FCFS, SSTF, LOOK,C-LOOK,SCAN, C-SCAN algorithms. SECTION C Memory Management: Local vs. physical addresses space, swapping, contiguous allocation, paging, segmentation, and segmentation with paging. Virtual memory: demand paging, page replacement algorithms, thrashing. Security: security problem, user authentication, program threats, system threats, securing systems and facilities, intrusion detection, cryptography, security-classifications. SECTION D Introduction to distributed systems: topology, network types, communication, design strategies. Distributed file system: naming and transparency, remote file access. Distributed co-ordination: event ordering, mutual exclusion, atomicity, concurrency control, deadlock handling. Case study of LINUX: design principles, kernel modules, process management, scheduling, memory management, file system, I/O system, and inter-process communication. Text Books: 1. Silberschatz and Galvin, "Operating System Concepts", Sixth edition, Addison-Wesley publishing, Co., 1999. References: 1. Hansen, Per Brinch, "Operating System Principles", Prentice-Hall. 1984. 2. N. Haberman, "Introduction to Operating System Design", Galgotia Publication, 1986. 3. Hansen, Per Brich, "The Architecture of Concurrent Programs", PHI, 1978. 4. Shaw, "Logical Design of Operating System", PHI, 1978. 5. Infosys Campus Connect Foundation Program Volume:1 3, Education & Research Department, Infosys Technologies Ltd , Bangalore.

15

LTPC 3104 MCA-223: Programming in Java Maximum Marks: 50 Minimum Pass Marks: 40% Maximum Time: 3 Hrs. Lectures to be delivered: 45-55

A) Instructions for paper-setter The question paper will consist of five sections A, B, C, D and E. Sections A, B, C and D will have two questions from the respective sections of the syllabus and will carry 20% marks each. Section E will have 5-10 short answer type questions which will cover the entire syllabus uniformly and will carry 20% marks in all. B) Instructions for candidates 1. Candidates are required to attempt one question each from sections A, B, C and D of the question paper E. 2. Use of non-programmable scientific calculator is allowed. SECTION A Introduction to Java : Features of Java, difference between Java and C++, data types, Wrapper types, variables, arrays, operatorsarithmetic, bit-wise, relational, Boolean, various control statements. . SECTION B Introduction to Classes: Class fundamentals, declaring objects, methods, constructors, garbage collection, passing parameters to methods, recursion, access control, static, final and finally method. An introduction to AWT. SECTION C Inheritance, super, multilevel hierarchy, abstract methods and classes. Packages and interfaces, importing packages, exception handling. Exception types, try, catch, finally, throw and throws, creating exception subclasses. Multithread programming, thread priorities, synchronisation, messaging, creating multiplethreads, interthread communication. SECTION D Input/Output, streams, reading and writing console input/output, reading and writing files, applet fundamentals. Networking, socket overview, client/server, reserved sockets, proxy servers, Internet addressing, Java and the Net, TCP/IP client sockets. Text Book: 1 Patrick Naughton and Herbert Schildt, The Complete Reference Java 2, Tata McGraw Hill, 1999. References: 1. Java Programming Language, Third Edition by Ken Arnold, James Gosling, David Holmes. Pearson Publications. 2. Infosys Campus Connect Foundation Program Volume:1 3, Education & Research Department, Infosys Technologies Ltd , Bangalore. and the entire section

16

LTPC 3104 MCA-224: Object Oriented Modelling and Design Using UML Maximum Marks: 50 Minimum Pass Marks: 40% Maximum Time: 3 Hrs. Lectures to be delivered: 45-55

A) Instructions for paper-setter The question paper will consist of five sections A, B, C, D and E. Sections A, B, C and D will have two questions from the respective sections of the syllabus and will carry 20% marks each. Section E will have 5-10 short answer type questions which will cover the entire syllabus uniformly and will carry 20% marks in all. B) Instructions for candidates 1. Candidates are required to attempt one question each from sections A, B, C and D of the question paper E. 2. Use of non-programmable scientific calculator is allowed. SECTION A Introduction to Object: Object Orientation, Development, Modelling, Object Modelling technique. Object modelling: Objects and classes, Links and Association, Generalization and inheritance, Grouping constructs, Aggregation, Abstract Classes, Generalization as extension and restriction, Multiple inheritance, Meta data, Candidate keys, Constraints. Dynamic modelling: Events and states, Nesting, Concurrency, Advanced Dynamic Modelling concepts Functional modelling: Functional Models, Data flow diagrams, Specifying operations, Constraints, Relation of Functional model to Object and Dynamic Models. SECTION B Design Methodology, Analysis: Object modelling, dynamic modelling, Functional modelling, Adding operations, Iterating Analysis. System design: Subsystems Concurrency, Allocation to processor and tasks, Management of data stores, Handling Global Resources, Handling boundary Conditions, Setting Trade-off priorities. Object Design: Overview, Combining the three models, Designing Algorithms, Design Optimization, Implementation of Control, Adjustment of Inheritance, Design of Associations, Object Representation, Physical Packaging, Document Design Decision. Comparison of methodologies: Structured Analysis/Structured Design, Jackson Structured Development. Implementation: Using Programming Language, Database System, outside Computer. Programming Style: Object Oriented Style, Reusability, Extensibility, Robustness, Programming-in-the-large. SECTION C UML: Basics, Emergence of UML, Types of Diagrams. Use Case: Actors, Use Case Diagram, Relationships between Use Cases. Classes: Class Diagram, Classes, Objects, Attributes, Operations, Methods, Interfaces, Constraints, Generalization, Specialization, Association, Aggregation. SECTION D Behavioural Diagrams: Activity Diagram, Collaboration Diagram, Sequence Diagram, State chart Diagram. Implementation Diagrams: Component Diagram, Deployment Diagram Text Books: 1. 2. References: 1. 2. 3. BOOCH, Object Oriented Analysis and Design, Addison Wesley Pierre-Alain Muller, Instant UML, Shroff Publishers, 2000 Booch, Rumbaugh, Jacobson, The Unified Modeling Language User Guide, Addison Wesley, 1999 Rambough, Object Oriented Modeling and Design, Pearson Education, 2002 Bernd Oestereich, Developing Software With UML, Pearson Education. and the entire section

17

4. 5. 6.

Booch, Rumbaugh, Jacobson, The Unified Modeling Language Reference Manual, Addison Wesley, 1999 Rebecca Wirfs-Brock, Design Object Oriented Software, PHI Infosys Campus Connect Foundation Program Volume:1 3, Education & Research Department, Infosys Technologies Ltd , Bangalore.

18

LTPC 2 0 2 4 MCA-225: Life Skills and Communication Skills Maximum Marks: 100* Minimum Pass Marks: 40% Maximum Time: 3 Hrs. Lectures to be delivered: 45-55

*The splitting of marks is as under Maximum Marks for Continuous Assessment : 60 Maximum Marks for University Examination : 40 Objectives: To provide students written and oral communication skills that enable them to get them placed in good positions. Methodology: Practical and Activity Based. No Theory examination. Internal evaluation will be based on class performance and attendance. Internal Evaluation will be done after the completion of each Module. Testing: Pre and Post Test for each Module, Classroom tasks, Activities, Quiz, Case Studies. Course Contents: Module I: Writing and Speaking English Parts of Speech, Resume Writing, Business Letters Vowels, Diphthongs, Consonants, Consonant Clusters, Stress, Syllable, Syllabic Division, Connected Speech, Making Presentations Module II: The Art of Communication Verbal Communication: Effective Communication, Effective/Active listening paraphrasing, Feedback Non Verbal Communication: Personality Enhancement, Body Language Module III: The Hidden Data of Communication The importance of feelings in communication, dealing with feelings, The importance of developing assertive skills, developing self-confidence, developing Emotional Intelligence, Dealing with People, Module IV: Group Activities and World of Teams Importance of Team work, working with Groups, Group Discussions, Group Decision-making Module V: Getting Ready for Interviews Corporate Dressing, Business Etiquettes, Media Etiquettes, Table Etiquettes Module VI: Ethical Orientation Ethical Dilemmas and Choices Recommended Books: 1. Infosys Campus Connect Soft Skills Participant Manual, Infosys Technologies Ltd. , Bangalore. 2. The Seven Habits of Highly Effective People - Stephen R. Covey. 3. 4. Who Moved My Cheese - Dr. Spenser Johnson. Seven Spiritual Laws of Success - Deepak Chopra. 5. Im OK Yar OK Erric Seghal 6. Emotional Intelligence - David Goleman 7. Working with Emotional Intelligence - David Goleman.

19

8. Good To Great - Jim Collins 9. Goal - Eliyahu Goldratt. 10. Only the Paranoid Survive - Andrew Grove 11. All the books in the Chicken Soup for the Soul series. 12. Effective Group Discussion: Theory and Practice by Gloria J. Galanes, Katherine Adams , John K. Brilhart 13. Effective Presentation, 3rd Edition by Ros Jay, Antony Jay published by Pearson 14. Effective Presentation Skills (A Fifty-Minute Series Book) by Steve Mandel 15. EatiQuettes The Main Course on Dining Etiquette: A step-by-step guide to dining with confidence in the 21st Century, by David Rothschild 16. The Complete Idiots Guide to Etiquette by Mary Mitchell Published by Alpha Books 17. Strategic interviewing by Richaurd Camp, Mary E. Vielhaber and Jack L. Simonetti Published by Wiley India Pvt. Ltd 18. Essentials of Effective Communication, Ludlow and Panthon; Prentice Hall of India. 19. Spoken English by V Sasikumar and PV Dhamija; Tata Mc Graw Hill 20. Developing Communication Skills by Krishna Mohan and Meera Banerji; MacMillan India Ltd., Delhi 21. Communication Skills by Ms. R. Datta Roy and K K Dhir, Vishal Publications, Jalandhar

20

LTPC 0066 MCA-226: Programming Lab-IV (Java Lab and Minor Project) Maximum Marks: 100* Minimum Pass Marks: 40% Maximum Time: 3 Hrs. Practical units to be conducted: 55-60

This laboratory course will mainly comprise of exercises on what is learnt under the paper MCA-223: Programming in Java and and a Minor Project in Java. The following categories of programs are to be developed:
1. Write a program to produce the truth table for Boolean and bit wise operations. Write a Program to demonstrate various methods for inputting data in Java Write a Program to find the sum and average of arbitrary n random numbers using random class. Write a program to implement Optimized Bubble Sort, Binary Search and Linear Search. Write a program to operate on matrices. Write a program to process strings, string sorting, counting character, words, sentences in string etc. Write a Class Date that takes day, month, and year while creating an object of this class. It should validate the date and then find a new date when the number of days is given. Write a program to find the volumes, areas, perimeters of different shapes using the principle of constructor overloading and Inheritance depending on the number of dimensions given in the input parameter list. Write a program to implement grow able and shrinkable Stack, Queue that can support all fundamental operations with concept of dynamic allocation using finalize () method. Write a program to demonstrate the concepts of private and public access methods to avoid accidental manipulations of any data structure such as stack.

2. 3.
4. 5.

6. 7. 8. 9.

For the minor projects in a team of maximum size three will be allowed and the team will submit joint project report. The student team members must highlight their role and/or contributions in the joint project report. *The splitting of marks is as under Maximum Marks for Continuous Assessment : 60** Maximum Marks for University Examination : 40*** ** For the Continuous Assessment the evaluation will be done on the following basis 1. 2. 3. Two or three tests out of the which minimum one will be considered for assessment. Lab Assignments File Attendance, class participation and behaviour 60% of the marks allotted for Continuous Assessment. 30% of the marks allotted for Continuous Assessment. 10% of the marks allotted for Continuous Assessment.

*** For University Examination the evaluator will distribute the marks for the minor project work according to the following guidelines: Demonstration of Project Presentation and Viva Voce Project Report Document Source Code 50% of the marks allotted for University Examination 25% of the marks allotted for University Examination 15% of the marks allotted for University Examination 10% of the marks allotted for University Examination.

21

PUNJABI UNIVERSITY, PATIALA

OUTLINES OF TESTS, SYLLABI AND COURSES OF READINGS FOR MCA (MASTER OF COMPUTER APPLICATIONS) (SEMESTER SYSTEM) 3rd Year ( V & VI Semester) 2011-12 & 2012-13 Sessions

22

ANNEXURE-I SYLLABUS OUTLINES OF PAPERS AND TESTS M.C.A. (MASTER OF COMPUTER APPLICATIONS) THIRD YEAR-Fifth SEMESTER EXAMINATIONS YEAR 2011-12 & 2012-13Session CODE NO. TITLE OF PAPER CONTINUOUS ASSESSMENT 50 50 50 100 60 50 360 MAXIMUM MARKS UNIVERSITY EXAMINATION 50 50 50 40 50 240 TOTAL MARKS 100 100 100 100 100 100 600 TIME TOTAL ALLOWED 3 Hrs. 3 Hrs 3 Hrs. 3 Hrs. 3 Hrs.

MCA-311 MCA-312 MCA-313 MCA-314 MCA-315

Artificial Intelligence Computer Graphics Theory of Computation Seminar Programming Lab-V (Graphics) Elective-I Total

List of Electives MCA-316 MCA-317 MCA-318 MCA-319 MCA-320 MCA-321 Note: ECommerce Corporate Strategy & Business Policy Digital Image Processing Organization Behaviour and Development Advanced Operating Systems Compiler Design MCA-322 MCA-323 MCA-324 MCA-325 MCA-326 MCA-327 Decision Support Systems Communication Skills & Report Writing Graph Theory Programming Languages Theory & Programming of Embedded Systems Computer Based Optimization Techniques

The electives will be offered to the students depending upon the availability of the teachers. The decision of the Head of the Department in this respect will be final.

CONTINUOUS ASSESSMENT (THEORY PAPERS) 1. Two or three tests out of which minimum two will be considered for assessment. Seminars/Assignments/Quizzes Attendance, class participation and behaviour 60% of the marks allotted for Continuous Assessment.

2. 3.

30% of the marks allotted for Continuous Assessment. 10% of the marks allotted for Continuous Assessment.

23

LTPC 3104 MCA-311: Artificial Intelligence Maximum Marks: 50 Minimum Pass Marks: 40% Maximum Time: 3 Hrs. Lectures to be delivered: 45-55

A) Instructions for paper-setter The question paper will consist of five sections A, B, C, D and E. Sections A, B, C and D will have two questions from the respective sections of the syllabus and will carry 20% marks each. Section E will have 5-10 short answer type questions which will cover the entire syllabus uniformly and will carry 20% marks in all. B) Instructions for candidates 1. Candidates are required to attempt one question each from sections A, B, C and D of the question paper E. 2. Use of non-programmable scientific calculator is allowed. SECTION A Introduction to AI: Definitions, Basic Elements of AI, Application Areas. Prepositional Logic: Syntax and semantics of Preposition Logic. First Order Predicate Logic: Syntax, Semantics, Properties of wff, Clausal form, Inference rules, Unification, resolution, non deductive Inference methods. SECTION B Logic Programming: procedural vs. declarative knowledge, AI programming vs. conventional programming, forward vs. backward reasoning. AI Language PROLOG: Features of Prolog, Elementary Data Types, Compound objects in Prolog, Recursion, Understanding Default flow control of the Prolog Program, Controlling Program Flow with cut and fail, List Manipulation, String manipulation, Arithmetic operators, Input /Output statement, Recursion. (No programming exercises). SECTION C Knowledge Base Systems: Introduction, Overview of Knowledge Acquisition, Representation, Organization, manipulation. Knowledge Representation: Types of knowledge, features of good representation, structured knowledge representation techniques semantic nets, conceptual dependencies, frames, Scripts. Knowledge Organisation and Manipulation: Features of good organization, Blind Search Breadth first search, depth first search, Heuristic search - Simple Hill climbing, Searching OR and AND-OR graphs. Matching: Matching process, factor affecting matching. Knowledge Acquisition: Learning model. SECTION D Expert System: Architecture, Applications. Natural language processing: Features of natural language, Steps in Natural Language Processing, Syntactic processing Grammar and Parsers, Augmented Transition Networks, Semantic analysis Semantic grammars, Case Grammars, Conceptual parsers, discourse and pragmatic processing types of relation among sentences. Text Books: 1. Dan W. Patterson, Introduction to Artificial Intelligence and Expert Systems, PHI. 2. E. Rich and K. Knight," Artificial Intelligence", Tata McGraw Hill. 3. W.F. Clofisin and C.S. Mellish, Programming in PROLOG, Narosa Publishing Co. References: 1. E. Charnaik and D. McDermott," Introduction to artificial Intelligence", Addison-Wesley Publishing Company. 2. Nils J. Nilson, Principles of Artificial Intelligence, Narosa Publishing Co. 3. Sanjiva Nath, Turbo PROLOG, Galgotia Publications Pvt. Ltd. 4. M. Chandwick and J.A. Hannah, Expert Systems for Personal Computers, Galgotia Publications Pvt. Ltd. and the entire section

24

LTPC 3104 MCA-312: Computer Graphics Maximum Marks: 50 Minimum Pass Marks: 40% Maximum Time: 3 Hrs. Lectures to be delivered: 45-55

A) Instructions for paper-setter The question paper will consist of five sections A, B, C, D and E. Sections A, B, C and D will have two questions from the respective sections of the syllabus and will carry 20% marks each. Section E will have 5-10 short answer type questions which will cover the entire syllabus uniformly and will carry 20% marks in all. B) Instructions for candidates 1. Candidates are required to attempt one question each from sections A, B, C and D of the question paper E. 2. Use of non-programmable scientific calculator is allowed. SECTION A Computer Graphics: Introduction, Applications areas, Components of Interactive Computer Graphics System. Input devices: Keyboard, Touch panel, Light pens, Graphic tablets, Joysticks, Trackball, Data glove, Digitizer, Image scanner, Mouse, Voice Systems. Hard copy output devices: Impact and non impact printers, such as line printer, dot matrix, laser, ink-jet, electrostatic, flatbed and drum plotters. Video Display Devices: Refresh cathode ray tube systems raster scan CRT displays, random scan CRT displays, colour CRTmonitors, direct view storage tube. Flat panel displays emissive vs non emissive displays, LCD displays, plasma panel displays, 3-D viewing devices, virtual reality. SECTION B Scan conversion: Line (DDA and Bresenham line algorithm), Circle (Polar, Bresenham and Mid point circle algorithm), Ellipse(Polar and Midpoint ellipse algorithm), Area filling techniques (Boundary fill, Flood fill, scan line area fill algorithm), character generation, limitations of scan conversion. 2-dimensional Graphics: 2D Cartesian and Homogeneous co-ordinate system, Geometric transformations (translation, Scaling, Rotation, Reflection, Shearing), Composite transformations, two dimensional viewing transformation and clipping (Cohen Sutherland, Liang-Barsky, Sutherland-Hodge man algorithms). SECTION C 3-dimensional Graphics: 3D Cartesian and Homogeneous co-ordinate system, Geometric transformations (translation, Scaling, Rotation, Reflection), Composite transformations. Mathematics of Projections Perspective Projections, Anomalies of perspective projections, Parallel Projections, orthographic and oblique projections. Introduction to 3D viewing pipeline and clipping. SECTION D Hidden line and surface elimination algorithms: z-buffer, scan-line, sub-division, Painter's algorithm. Illumination Models: Diffuse reflection, Specular reflection, refracted light, texture surface patterns, Halftoning, Dithering. Surface Rendering Methods: Constant Intensity method, Gouraud Shading, Phong Shading. Text Book : 1. D. Hearn and M.P. Baker, Computer Graphics, PHI New Delhi; Second Edition, 1995. and the entire section

References: 1. 2. J.D. Foley, A.V. Dam, S.K. Feiner, J.F. Hughes,. R.L Phillips, Introduction to Computer Graphics, Addison-Wesley Publishing company, N.Y.; Second Edition,1994. R.A. Plastock and G. Kalley, Computer Graphics, McGraw Hill, 1986.

25

LTPC 3104 MCA-313: Theory of Computation Maximum Marks: 50 Minimum Pass Marks: 40% Maximum Time: 3 Hrs. Lectures to be delivered: 45-55

A) Instructions for paper-setter The question paper will consist of five sections A, B, C, D and E. Sections A, B, C and D will have two questions from the respective sections of the syllabus and will carry 20% marks each. Section E will have 5-10 short answer type questions which will cover the entire syllabus uniformly and will carry 20% marks in all. B) Instructions for candidates 1. Candidates are required to attempt one question each from sections A, B, C and D of the question paper E. 2. Use of non-programmable scientific calculator is allowed. SECTION A Formal language, Need for formal computational models, Non computational models. Finite Automata: Deterministic finite Automata, Non deterministic finite Automata, Equivalence of NFA and DFA, Finite Automata with Epsilon-moves. 2-Way Finite Automata, Crossing sequences, Moore and Mealy Machine, Application of finite automata i.e. Lexical Analyzers, text editors. SECTION B Regular Expression and Languages : Regular expression, Equivalence of finite Automata and Regular expressions, Conversion between regular expressions and finite automata : Application of Regular Expressions : Regular Expression in UNIX, Lexical analysis, Finding pattern in text. Regular Languages and Regular sets : Pumping lemma for regular sets, Applications of pumping lemMa. Closure properties of regular language, The Myhill-Nerode Theorem, Minimization of finite Automata. SECTION C Context free Grammar and Languages : Context free Grammars : Derivation Trees, Leftmost and rightmost derrivations, Ambiguity, Parsing techniques for parsing of general CFG's-Early's, Cook-Kassami-Younger (CKY) and Tomitas's Parsing. Properties of Context free Languages- Normal forms for context free grammars, The Pumping Lemna for context free Languages; Closure properties of context free languages. SECTION D Pushdown Automata: Pushdown Automata : Deterministic Push Down Automata; Equivalence of Push Down Automata and Context free grammar. Linear Bounded Automata (LBA) : Power of LBA, Closure Properties. Turning Machine (TM): One Tape, multitape, The notions of time and space complexity in terms of T.M. Construction of simple problems. Computational complexity. Chomsky Hierarchy of Languages: Recursive and recursively-enumerable languages. Text Books: 1. J.E. Hopcroft, R. Motwani and J.D. Ullamn, Introduction to Automata Theory, Languages and Computation, Pearson Education Asia, 2nd Edition. and the entire section

Reference: 1 2. 3. Daniel I.A. Cohen, "Introduction to Computer Theory", Wiley, Second edition. B. M. Moret, The Theory of Computation, Pearson Education Asia. H.R. Lewis and C.H. Papa dimitriou, Elements of the theory of Computation, Pearson Education Asia 2nd Edition.

26

LTPC 4 0 0 4 MCA-314: Seminar Maximum Marks: 100 Minimum Pass Marks: 40%

Lectures to be delivered: 45-55

There will be at least two teachers in charge for the evaluation of seminar. The topic of seminar must be relevant to computer science or computer industry and not to be the part of the course contents to be studied in the theory papers. First few lectures (5-10) will be spent by the teacher in charge on the allocation of seminar, how to prepare presentations, presentation skills etc. The following books can act as the reference 1. Effective Presentation, 3rd Edition by Ros Jay, Antony Jay published by Pearson 2. Effective Presentation Skills (A Fifty-Minute Series Book) by Steve Mandel

Each student will deliver half hour seminar on the topic to be assigned by the teacher in charge. Students will be evaluated marks on the following basis: 1. 2. 3. Contents: Relevance, innovativeness, and the amount of the contents with the topic assigned. Presentation: Oral presentation method, aids used etc. Seminar Chair: Each student will be chairing one seminar session. He/she will be evaluated on the basis of role played by him/her as the chairperson. Seminar Reporting: Each student will act as the reporter for one seminar session and evaluation will be done on the basis of reporting done by the student. Questioned asked by the student in seminars: Students are supposed to actively participate in the seminar sessions and will be evaluated on the basis of relevance of the questions asked by them. Viva voce 25% of the total marks 25% of the total marks 15% of the total marks

4.

15% of the total marks

5.

10% of the total marks

6.

10% of the total marks

27

LTPC 0066 MCA-315: Programming Lab V (Graphics) Maximum Marks: 100* Minimum Pass Marks: 40% Maximum Time: 3 Hrs. Practical units to be conducted: 55-60

This laboratory course will mainly comprise of exercises based on paper MCA-322: Computer Graphics The following categories of programs are to be developed in C/C++/Java related to MCA-322: Computer Graphics: 1. 2. 3. 4. 5. 6. 7. Simple programs to handle graphics (drawing sine curve, cosine curve, animating an object around curve) Program to draw bar chart, frequency curve and pie chart. Program to draw line, rectangle, circle using rubber banding. Program to implement various Line, circle and ellipse drawing algorithms. Program to implement area fill techniques. Program to demonstrate 2D Transformations like translation, scaling, rotation, reflection, shearing. Program for perform 2D Clipping.

*The splitting of marks is as under

Maximum Marks for Continuous Assessment: 60 Maximum Marks for University Examination: 40

28

LTPC 3104 MCA-316: E-Commerce Maximum Marks: 50 Minimum Pass Marks: 40% Maximum Time: 3 Hrs. Lectures to be delivered: 45-55

A) Instructions for paper-setter The question paper will consist of five sections A, B, C, D and E. Sections A, B, C and D will have two questions from the respective sections of the syllabus and will carry 20% marks each. Section E will have 5-10 short answer type questions which will cover the entire syllabus uniformly and will carry 20% marks in all. B) Instructions for candidates 1. Candidates are required to attempt one question each from sections A, B, C and D of the question paper E. 2. Use of non-programmable scientific calculator is allowed. SECTION A Meaning and Concept of Electronic Commerce, Potential Benefits of E-Commerce, Ecommerce Technologies, Types of Ecommerce, Business Models of E-Commerce. Framework of Ecommerce, Technology behind Ecommerce, The Anatomy of Ecommerce Applications. SECTION B Ecommerce Security Issues : Asses, Threats and Impacts. Messaging Security Issues, Cryptography : Encryption Technique and Mechanism, Firewall : Components and Functionality, Factors in Firewall Design. Regulatory and Legal Environment for Ecommerce SECTION C Electronic Data Interchange : Types of Edi, Benefits and Functionality of EDI. Electronic : Payment Mechanism : Issues in Electronic Payment Systems, Types of Electronic Payment Schemes : Smart Card, Debit Card, Credit Card, Electronic Cash, Electronic Cheque. Risk & Electronic Payment Systems. SECTION D Web Based Marketing : Online Advertising Mechanism, Internet Marketing Techniques, Marketing Strategies for Internet, Factors in Ecommerce Website Design. E-Commerce in India. Present Status and Future Scope. Text Books : 1. Ravi Kalakota, Andrew B. Whinston : "Frontiers of Electronic Commerce", Addison Wesley. and the entire section

References: 1. 2. 3. Efrain Turbon, Lee, David King : "Electronic Commerce-A managerial Perspective", Prentice-Hall. Grenstein, Feinnman, "Electronic Commerce", Tata McGraw-Hill. Pete Loswin, Paul A Murphy : "Electronic Commerce", Jaico Publishing House.

29

LTPC 3 10 4 MCA-317: Corporate Strategy & Business Policy Maximum Marks: 50 Minimum Pass Marks: 40% Maximum Time: 3 Hrs. Lectures to be delivered: 45-55

A) Instructions for paper-setter The question paper will consist of five sections A, B, C, D and E. Sections A, B, C and D will have two questions from the respective sections of the syllabus and will carry 20% marks each. Section E will have 5-10 short answer type questions which will cover the entire syllabus uniformly and will carry 20% marks in all. B) Instructions for candidates 1. Candidates are required to attempt one question each from sections A, B, C and D of the question paper E. 2. Use of non-programmable scientific calculator is allowed. SECTION A Introduction to Corporate Strategy, Corporate Mission purpose & Goals Objectives, Types & Hierarchy of Objectives, Strategic Management Process, Determination of Objectives - Internal & external environmental scanning, the different forms of strategy. SECTION B Concept & approaches to strategy formulation, expansion, Diversification, Acquisition, Merger & Divestment, Evaluation of alternatives. Analysis & Formulation of organisational Policies - Marketing, Production, Financial & Personnel, Productivity & Competitive Analysis. SECTION C Strategic Planning: Technological & Demand forecasting : Long & Short term planning, Tactical Plans, criterion & Provision of Planning, the analytical relationships among cash , Growth & Investment goals. SECTION D Nature & Type of organisational structure, information & control system, Mobilisation of resources. Corporate performance, appraisals & Review of Plans, Objectives & strategy, Rescheduling of Resources, Techniques for Improving organisational effectiveness. Text Books: 1. H. Ansoff Igor, Corporate Strategy, McGraw Hill, New Delhi, 1987. References: 1. Strategic Management, Altex Muller, M.H. 2. Colley, Doyle & Hardie, Organisations, Richard Hale, Pearson Education, Corporate Strategy, TMH. 3. Kazmi Azar , Business Policy, Tata McGraw Hill, Delhi, 1993. 4. Bus Strategy Management, Wheelan, Pearson Education. and the entire section

30

LTPC 3104 MCA-318: Digital Image Processing Maximum Marks: 50 Minimum Pass Marks: 40% Maximum Time: 3 Hrs. Lectures to be delivered: 45-55

A) Instructions for paper-setter The question paper will consist of five sections A, B, C, D and E. Sections A, B, C and D will have two questions from the respective sections of the syllabus and will carry 20% marks each. Section E will have 5-10 short answer type questions which will cover the entire syllabus uniformly and will carry 20% marks in all. B) Instructions for candidates 1. Candidates are required to attempt one question each from sections A, B, C and D of the question paper E. 2. Use of non-programmable scientific calculator is allowed. SECTION A Digital Image Processing: Definition, Problems and Applications Fundamental Steps in Digital Image Processing, Components of an Image Processing System. Digital Image Fundamentals: Image Sensing, and Acquisition, Image Sampling and Quantization, Basic Relationship between Pixels, Linear and Non-linear Operations. SECTION B Image Enhancement in Spatial Domain: Basic Gray Level Transformations, Histogram Processing, Enhancements using Arithmetic/Logic Operations, Basics of Spatial Filtering, Smoothing, Spatial Filters, Sharpening Spatial Filters, Combining Spatial Enhancement Methods. Introduction to Fourier Transformation and Frequency Domain. Smoothing Frequency Domain Filters, sharpening Frequency Domain Filters, Homomorphic Filtering, Implementation. SECTION C Image Restoration : Noise Models, Restoration in the Presence of Noise Only-Spatial Filtering, Periodic Noise Reduction by Frequency Domain Filtering, Linear, Position-Invariant Degradations, Estimating the Degradation Function, Inverse Filtering, Minimum Mean Square Error (Wiener) Filtering, Constrained Least Squares Filtering, Geometric Mean Filter, Geometric Transformations. Colour Image Processing: Colour Models, Pseudocolour Image Processing, Basics of Full Colour Image Processing. Colour Transformations, Smoothing and Sharpening. Colour Segmentation. SECTION D Image Compression: Image Compression Models, Elements of Information Theory, Error Free Compression, Lossy Compression, Image Compression Standards. Point Detection, Line Detection and Edge Detection, Edge Linking and Boundary Detection. Text Book: 1. R. C. Gonzalez, R. E. Woods, Digital Image Processing, Pearson Education-2002 References: 1. A. K. Jain, Fundamentals of Digital Image Processing, PHI, 2002 and the entire section

31

LTPC 3104 MCA-319: Organisational Behaviour and Development Maximum Marks: 50 Minimum Pass Marks: 40% Maximum Time: 3 Hrs. Lectures to be delivered: 45-55

A) Instructions for paper-setter The question paper will consist of five sections A, B, C, D and E. Sections A, B, C and D will have two questions from the respective sections of the syllabus and will carry 20% marks each. Section E will have 5-10 short answer type questions which will cover the entire syllabus uniformly and will carry 20% marks in all. B) Instructions for candidates 1. Candidates are required to attempt one question each from sections A, B, C and D of the question paper section E. 2. Use of non-programmable scientific calculator is allowed. SECTION A Defining OB, Fundamentals of OB, Foundations for the study of OB: The Hawthorne studies and its implications, Human relation movement, organisational culture, the basic theories of behaviour prediction of human behaviour at work. Understanding Indian social and cultural environment and its influence on industrial behaviour. Challenges & Opportunities for OB. Developing an OB Model, SECTION B Personality, and its determinants, Personality traits attributes, influencing OB. Personality development Understanding attitudes, values and formation of organisational culture, job satisfaction. Perception, its nature and importance, perception vs sensation, perceptual organisation and selectivity, social perception. Learning theories of Learning, learning principles, Reinforcement-kinds and administration. SECTION C Motivation, its meaning, type of motives, theories of Motivation (Marlow, herzberg, Mecgreger & McClellands) job designing and goal setting. Interpersonal Behaviour : Understanding conflicts and its dimensions. Goal congruence and group Behaviour & dynamics. SECTION D Power and politics: meaning and relationship. Source and types of power, implications and acquisition of power, Leadership & is theories. O.D defined and its importance, underlying assumptions and values, characteristics and foundations of OD, operational components of OD, conditions for success of OD, Interventions-its overview, kinds and applications. Text Books: 1. Stephen P. Robbins Organisational Behaviour, Pearson Education, References: 1 2. 3. J.W. Newston & Keith Davis, OB, 11th editio, TMH. Fred Luthaus, Organiations Behaviour, McGraw Hill. R.W. Griffn & Moohead . Organisational Behaviou, Jaico Books. and `the entire

32

LTPC 3104 MCA-320: Advanced Operating Systems Maximum Marks: 50 Minimum Pass Marks: 40% Maximum Time: 3 Hrs. Lectures to be delivered: 45-55

A) Instructions for paper-setter The question paper will consist of five sections A, B, C, D and E. Sections A, B, C and D will have two questions from the respective sections of the syllabus and will carry 20% marks each. Section E will have 5-10 short answer type questions which will cover the entire syllabus uniformly and will carry 20% marks in all. B) Instructions for candidates 1. Candidates are required to attempt one question each from sections A, B, C and D of the question paper E. 2. Use of non-programmable scientific calculator is allowed. SECTION A Distributed OS: Goals, H/W Concepts, S/W Concepts, Client/Server Model. Communication: Layered Protocols, RPC, Remote Object Invocation, Message and Stream Oriented Communication. Processes: Threads, Clients, Servers, Code Migration, S/W Agents. Process Synchronization Mechanism: Process Concepts, Concurrent Processes, Threads, Critical Section Problem, Synchronization Problems (Dining Philosophers, Producer-Consumer, Reader-Write). Clock Synchronization, Logical Clocks, Global State, Election Algorithms, Mutual Exclusion SECTION B Naming: Naming Entities, Locating Mobile Entities, Removing Unreferenced Entities. Distributed Deadlock Detection: Deadlock Handling Strategies, Control Organization for Distributed Deadlock Detection, Centralized, Distributed and Hierarchical Deadlock Detection Algorithms. SECTION C Security: Introduction, Secure Channels, Access Control, Security Management. Distributed Object Based System: CORBA, DCOM, GLOBE, Comparison. Distributed File System: Architecture, Mechanism for Building Distributed File System, Design Issues Distributed Shared Memory: Architecture, Memory Coherence, Coherence Protocols, Design Issues. Failure Recovery: Classification of Failures, Backward and Forward Recovery, Recovery in Concurrent Systems. Fault Tolerance: Introduction, Process Resilience, Reliable Client/Server Communication, Group Communication, Distributed Commit, Recovery. SECTION D Resource Security and Protection: Access Matrix Model, Safety in Access Matrix Model, Advanced Models of Protection, Cryptography Introduction to Multiprocessor Operating Systems and Database Operating Systems. 1. 2. 1. 2. Text Books: M. Singhal, N. G. Shivaratri, Advanced Concepts in Operating Systems, Tata McGraw-Hill. A. S. Tanenbaum, Distributed Systems, Pearson Education. Reference: Silberschatz and Galvin, "Operating System Concepts", Addison-Wesley publishing, Co., 1999. D. M. Dhamdhere, Operating Systems A Concept Based Approach, Tata McGraw-Hill. and the entire section

33

LTPC 3104 MCA-321: Compiler Design Maximum Marks: 50 Minimum Pass Marks: 40% Maximum Time: 3 Hrs. Lectures to be delivered: 45-55

A) Instructions for paper-setter The question paper will consist of five sections A, B, C, D and E. Sections A, B, C and D will have two questions from the respective sections of the syllabus and will carry 20% marks each. Section E will have 5-10 short answer type questions which will cover the entire syllabus uniformly and will carry 20% marks in all. B) Instructions for candidates 1. Candidates are required to attempt one question each from sections A, B, C and D of the question paper E. 2. Use of non-programmable scientific calculator is allowed. SECTION A. Introduction to Compiling : Compilers v/s Interpretes, Phases of a Compiler, Cross-compiler, Compiler-Construction tools. One Pass-Compiler, Syntax definition, Parsing : Predictive Paring, Design of a Predictive Parser, Symbol tables. SECTION B Lexical Analysis : Rote of Lexical Analyser, Specification and Recognition of Tokens, finite Automata, From Regular expression to a NFA. Syntax Directed Translation : Syntax Directed definitions, Syntax directed translation scheme : Quadruples, Triples, Indirect triples, Constructing syntax trees, Bottom-up evaluation of S-attributed definitions, L: attributed definitions. SECTION C Syntax Analysis : Rate of parsing, CFG, Top-down parsing, Bottom up, Parse tree, Operator-Precedene Parsing, LR parsers, Using ambiguous grammar. Runtime Environment-Storage organisation, storage allocation strategies. SECTION D Code Generation : Issue in design of code generator, Basic Block and flow graphs, Next-use Information, DAG representation of basic blocks. Code Optimization : Peep optimization, Principle source of optimization, Optimization of basic blocks. Introduction to Global DFA. Text Book : 1. Ah. A. V. Ulman Sethi, R, Compilers : Principles, Techniques & , Addison-Wesley, 1999. and the entire section

34

LTPC 3104 MCA-322: Decision Support Systems Maximum Marks: 50 Minimum Pass Marks: 40% Maximum Time: 3 Hrs. Lectures to be delivered: 45-55

A) Instructions for paper-setter The question paper will consist of five sections A, B, C, D and E. Sections A, B, C and D will have two questions from the respective sections of the syllabus and will carry 20% marks each. Section E will have 5-10 short answer type questions which will cover the entire syllabus uniformly and will carry 20% marks in all. B) Instructions for candidates 1. Candidates are required to attempt one question each from sections A, B, C and D of the question paper E. 2. Use of non-programmable scientific calculator is allowed. SECTION A Concept of Decision - making, Decision - Making Process, Simons Model, Programmed Vs. Non-Programmed decisions, Decision models: Decision-Making Under assumed certainty, risk & uncertainty, Quantitative Tools for Decision-Making. SECTION B Introduction to Decision Support Systems, Characteristics & Objectives, Benefits of DSS, DSS Vs. EDP/MIS, Specific DSS, DSS Generator, DSS tools and their relationships, Role of DSS & its applications. SECTION C Components of DSS - Data Subsystem, Model Subsystem, User - Interface, DBMS in DSS, Report generator, Types of Models & Modeling in DSS. DSS Software Tools : Standard Packages, specialized tools & Generators-DBMS, Information retrieval packages, statistical data analysis packages, forecasting packages, Programming Languages for DSS. SECTION D Group Decision Support Systems : Group versus Individual activities, Benefits of GDSS, types of Groups DSS, Groups DSS in use : Electronic Meeting Systems, Work flow systems. Expert Systems : Basic idea, components of Expert Systems, Pros and cons. of Expert Systems. Expert Systems and DSS. Dataware housing and Executive Information System Fundamentals. Text Books : 1. 2. Efren G. Mallach, Decision Support & Data Warehouse Systems, Tata McGraw Hill. DSS & Intelligent Systems by Efrain Turban, Jay E. Aronson, Pearson Education. and the entire section

References: 1. Michael W-Davis, Applied Decision Support, Prentice Hall. 2. R. Jaya Shankar, Decision Support Systems, Tata McGraw Hill. 3. Sprague and Watson, Decision Support Systems: Theory & Practice, PHI. 4. J.L. Bennett, Building Decision Support System, Addison-Wesley Publications.

35

LTPC 3104 MCA-323: Communication Skills & Report Writing Maximum Marks: 50 Minimum Pass Marks: 40% Maximum Time: 3 Hrs. Lectures to be delivered: 45-55

A) Instructions for paper-setter The question paper will consist of five sections A, B, C, D and E. Sections A, B, C and D will have two questions from the respective sections of the syllabus and will carry 20% marks each. Section E will have 5-10 short answer type questions which will cover the entire syllabus uniformly and will carry 20% marks in all. B) Instructions for candidates 1. Candidates are required to attempt one question each from sections A, B, C and D of the question paper and the entire section E. 2. Use of non-programmable scientific calculator is allowed. SECTION A Communication : Meaning & Importance, Communication process, Forms of Communication, including electronic Communication-Telephone Voicemail, Tele-conferencing, video conferencing, e-mail, discussion groups. Intranet & Internet. Communication in Information Technology Age-Changing role of communication. SECTION B Barriers to Effective Communication, OverComing barriers, Inter-personal and Intra-personal Communication. Personality and Communication, Role of effective Communicator, Cross-Cultural Communication and its determinants. Problem in Cross Cultural Communication. SECTION C Introduction to Communication models-Aristotles Communication models- Shannon and Weaver transmission model, Berlos model, Lasswells model, The two way communication model. Non verbal Communication-Nature, Importance and media of Non-verbal Communication. SECTION D Written Communication : Business Letters, memo, Report Writing-Types of reports. Elements of Report and presentations. Listening : types of Listening barriers in Listening. Text Book : 1. C.S. Rayndu, Communication, Himalya Publishing House. References : 1. Basic Communication Skills for Technology, A Rutherford, Pearson Education, Asia, 2000. 2. Robert E. Swindle, Elizabeth M. Swindle, The Business Communicator, Prentice Hall, 3rd Edition. 3. Parag Diwan, Communication Management, Deep and Deep Publications, 1997. 4. Mahesh Kumar Communication Skills, SLIET Publication, 2001. 5. Communication for Business, Shirley Taylor, Pearson Education. 6. Communication in IT Age, "Dhiraj Sharma," Himalya Publications, 2004.

36

LTPC 3104 MCA-324: Graph Theory Maximum Marks: 50 Minimum Pass Marks: 40% Maximum Time: 3 Hrs. Lectures to be delivered: 45-55

A) Instructions for paper-setter The question paper will consist of five sections A, B, C, D and E. Sections A, B, C and D will have two questions from the respective sections of the syllabus and will carry 20% marks each. Section E will have 5-10 short answer type questions which will cover the entire syllabus uniformly and will carry 20% marks in all. B) Instructions for candidates 1. Candidates are required to attempt one question each from sections A, B, C and D of the question paper E. 2. Use of non-programmable scientific calculator is allowed. SECTION A Graphs : Introduction, Applications, finite and infinite graphs, incidence and degree, Isomorphism, Subgraphs, Walks, paths and circuits, connected Graphs, Disconnected graphs and components. Euler graphics, details of euler graphs, travelling salesman problem. SECTION B Trees : Introduction, properties, pendent vertices in a tree, distance and centres in a tree, rooted and binary trees, spanning trees, fundamentals, circuits, spanning trees in weighed graph, Cut Sets : Introduction, fundamental circuits and cut sets, connectivity and separability, network flows. SECTION C Planar graphs: Introduction, Kuratowrskis two graphs, detection of planarity, geometric dual, combnational dual. Matrix Representations: Incidence matrix, adjacency matrix. SECTION D Chromatic number, Chromatic, polynominal, the four colour problem, Directed graphs : Introduction, types diagraphs and binary relation, directed paths and connectdness, Euler diagraphs, trees with directed edges : Enumeration of graphs : types, Counting labeled trees. Text Book: 1. Narsingh Deo : Graph Tehory, PHI. and the entire section

References: 1. West D. B.: Introduction to graph theory, Second, Edition, Pearson Education Asia. 2. Wilson R. J.: Introduction to graph theory, fourth edition, Pearson Education, Asia.

37

LTPC 3104 MCA-325: Programming Languages Maximum Marks: 50 Minimum Pass Marks: 40% Maximum Time: 3 Hrs. Lectures to be delivered: 45-55

A) Instructions for paper-setter The question paper will consist of five sections A, B, C, D and E. Sections A, B, C and D will have two questions from the respective sections of the syllabus and will carry 20% marks each. Section E will have 5-10 short answer type questions which will cover the entire syllabus uniformly and will carry 20% marks in all. B) Instructions for candidates 1. Candidates are required to attempt one question each from sections A, B, C and D of the question paper E. 2. Use of non-programmable scientific calculator is allowed. SECTION A Need of studying Programming Languages, Evolution of Programming Languages, Criterion for Language Design, Computer Hardware, Firmware Computers, Translators and Software Simulators, Virtual Computers and Binding Times. Type Checking, Strong Typing, Type Compatibility, Scope and Lifetime, Referencing Environment. Elementary and Structured Data Type. Sequence Control: Within Expression, Between Statements, Non-arithmetic Expressions. SECTION B Subprogram Control: Sequence Control, Data Control, Parameter Transmission, Explicit Common Environment, Co-routines Storage Management: Elements Requiring Storage, Programmer and System Controlled Storage, Static Storage, Heap Storage Management. Exception Handling SECTION C Functional Programming: Functions, Recursion, Control Structures, Implementation, Introduction to Logic Programming: Concepts, Computing with Relations; Rules, Facts and Queries. Concurrent Programming: Concepts, Parallelism in H/W, Implicit Synchronization, Concurrency as Interleaving, Liveness Properties, Safe Access to Shared Data, Concurrency in ADA Synchronized Access to Shared Variables. SECTION D Object Oriented Programming: Concepts, Objects, Classes, Instances, Abstraction, Data Encapsulation, Information Hiding, Inheritance, Polymorphism its Implementation in C++. Text Books: 1. T.W. Pratt, M. V. Zelkowitz," Programming Languages :Design and Implementation", Pearson Education. 2. R. W. Sebesta, Concepts of Programming Languages, Pearson Education. References: 1. Ravi Sethi, " Programming Languages :Concepts and constructs", Pearson Education. 2. Michael Marcotty and Henry Ledgard," Programming Languages & Landscape: Syntax/ Semantics/ Implementation", 3. Allen Tucker, Robert Noonam, Programming Languages Principles and Paradigms, Tata McGraw Hill. and the entire section

38

LTPC 3104 MCA-326: Theory & Programming of Embedded Systems Maximum Marks: 50 Minimum Pass Marks: 40% Maximum Time: 3 Hrs. Lectures to be delivered: 45-55

A) Instructions for paper-setter The question paper will consist of five sections A, B, C, D and E. Sections A, B, C and D will have two questions from the respective sections of the syllabus and will carry 20% marks each. Section E will have 5-10 short answer type questions which will cover the entire syllabus uniformly and will carry 20% marks in all. B) Instructions for candidates 1. Candidates are required to attempt one question each from sections A, B, C and D of the question paper E. 2. Use of non-programmable scientific calculator is allowed. SECTION A Micro Controllers : Introduction and Embedded processors, overview of 8051 family. 8051 Assembly language programming : Introduction, Assembling and running 8051 program. The program Counter and ROM space in 8051, Datatypes and directives, 8051 flag bits and PSW register, register banks and stack. SECTION B Jump, loop and Call Instruction, Call instructions, time delay generation and calculation. I/O port programming : pin description of 8051, I/O programming : Bit manipulation : Addressing Modes : Immediate and register addressing, accessing memory using various addressing models. SECTION C Artihemantic Instructions and programs unsigned addition, Subtraction, multiplication and : Division, signed number concepts and arithhematic operations, Logic Instructions and programs : Logic and compare instructions, rotate and sharp instructions BCD and ASCIII Application program. SECTION D Single Instructions and programming : Single bit instruction programming, Single bit operations with CY, reading input pins vs port batch. Timer/Counter in 8051: programming 8051 timers, Counter programming : 8051 interrupts, timer interrupts, external hardware interrupts, interrupt priority in 8051, 8051 interfacing to keyboard and with DAC. Text Book 1. Mazid : M.A. and Mazidi J.G. : The 8051 Microcontroller and Embedded Systems, Pearson Education, Asia. and the entire section

39

LTPC 3104 MCA-327: Computer Based Optimization Techniques Maximum Marks: 50 Minimum Pass Marks: 40% Maximum Time: 3 Hrs. Lectures to be delivered: 45-55

A) Instructions for paper-setter The question paper will consist of five sections A, B, C, D and E. Sections A, B, C and D will have two questions from the respective sections of the syllabus and will carry 20% marks each. Section E will have 5-10 short answer type questions which will cover the entire syllabus uniformly and will carry 20% marks in all. B) Instructions for candidates 1. Candidates are required to attempt one question each from sections A, B, C and D of the question paper E. 2. Use of non-programmable scientific calculator is allowed. SECTION A OR models, solving the OR Model, Introduction to Linear Programming, two variable LP model, Graphical LP Solution, Graphical sensitivity Analysis, Simplex Method, Big M Method, Two Phase Method, Special cases in Simplex Method Application. SECTION B Duality and Sensitivity Analysis : Definition of the Dual problem, Primal dual relationship,, Additional Simplex Algorithm for LP, Post Pptimal or Sensitivity Analysis. Transportation Model, Transportation Algorithm, Assignment Model. SECTION C Networks Models : Definition, Minimum spanning trees algorithms, Shortest Route Problem, Maximum flow Model, Minimum Cost Capacitors flow problem, PERT & CPM. SECTION D Non-Linear Programming : Unconstrained Algorithms, Direct search Method, Gradient Method, Constrained Algorithm, Separable programming, Quadratic Programming, Geometric Programming Text Book 1. H.A. Taha, Operations Research, Seventh Edition, PHI, New Delhi. and the entire section

Reference Books 1. 2. 3. 4. 5. 6. Kanti Swarup, "Operations Research" N.G.Nari, "Operations Research" Heara and Gupta, "Operations Research" S.D.Sharma, "Operations Research" Goel and Mittal, "Operational Research" V.K.Kapoor, "Problems and Solutions in Operations Research"

40

SYLLABUS OUTLINE OF PAPERS AND TESTS M.C.A. (MASTER OF COMPUTER APPLICATIONS) THIRD YEAR SIXTH SEMESTER YEAR 2011-12 & 2012-13 Sessions CODE MCA-328 TITLE OF PAPER PROJECT TOTAL MAXIMUM MARKS 400 400

MCA-328

Project in a Computer Organisation/University Computer Centre/Dept. of Computer Science, etc., as decided by the Head of the Department

Project : 400 Marks 1. 2. The evaluation committee will distribute these marks for seminar/viva/project report and for any other activity, which the committee thinks to be proper. Joint projects will be allowed and joint project reports will also be accepted. Individual project reports will be recognised and the students should highlight their contributions in a joint project report. Committee for Evaluation of project report/work: i. ii. Head of the Department Internal Guide (if any)

iii. One or two nominee(s) of Dean, Academic Affairs iv. External Examiner

Quorum will be of any three members.

41

42