M.C.A.                                                                                                                                                                                  Prospectus No. 081774

             

    

ºÉÆiÉ MÉÉb÷MÉä ¤ÉɤÉÉ +¨É®úÉ´ÉiÉÒ Ê´ÉtÉ{ÉÒ`ö

 

sant gadge baba AMRAVATI  UNIVERSITY

 

(FACULTY OF ENGINEERING & TECHNOLOGY)

 

 

 

PROSPECTUS

 

prescribed for

master IN computer application

Second and Third Year M.C.A.

Examinations, 2007-2008

BI-ANNUAL PATTERN

 

 

 

 

2007

 

                                          

                                                                                                                                                                                                       (Price Rs.8/-)

                                                                                 

 

 

            PUBLISHED BY

         C. D. Deshmukh

            Registrar

            Sant Gadge Baba

            Amravati University

            Amravati- 444 602

 

 

 

 

         Ó          "ªÉÉ +¦ªÉɺÉGòʨÉEäòiÉÒ±É (Prospectus) EòÉähÉiÉɽþÒ ¦ÉÉMÉ ºÉÆiÉ MÉÉb÷MÉä ¤ÉɤÉÉ +¨É®úÉ´ÉiÉÒ Ê´ÉtÉ{ÉÒ`öÉSªÉÉ {ÉÚ´ÉÉÇxÉÖ¨ÉiÉÒ Ê¶É´ÉÉªÉ EòÉähÉɺɽþÒ {ÉÖxÉǨÉÖÊpùiÉ ËEò´ÉÉ |ÉEòÉʶÉiÉ Eò®úiÉÉ ªÉähÉÉ®ú xÉɽþÒ"

      

         Ó                   "No part of this prospectus can be reprinted or published without specific permission of Sant Gadge Baba Amravati University."

 

 

 

Syllabus

Prescribed for

master in computer application

Second Year M.C.A. examinations

bi-annual pattern

 

Part - i

 

2 CS1       OPERATIONS RESEARCH

 

                   Deterministic OR Models:-

Unit I       :    Introduction, Classification of problems, OR Mathematical modelling, Dynamic programming, Investment problem, DP solution of general allocation problem, Strategic problem, Production schedulling, Equipment replacement, Stage coach.                                                                               (9)

Unit-II      :    Linear and Integer Programming

                   Formulation of LP Models, Simplex methods, properties Duality theory, Post-optimality analysis, Transportation & assignment problems. Introduction to integer programming, Implicit enumeration and cutting plane technique, Introduction to branch & bound technique.                                  (9)

Unit-III     :    Deterministic Inventory models.

                   Introduction to deterministic inventory models, infinite delivery, rate with no back ordering, Finite delivery rate with one back ordering, Infinite & Finite delivery rate with back ordering, Introduction to sequencing problems, Two-machine, N-job three machine sequencing problem.                          (9)

                   Probabilistic OR Models :-

Unit-IV     :    Basic probability & statistical concepts, Introducing to decision theory-minimax decision procedure, Bayes decision procedure with & without data. Regret function Vs. loss function, Introduction to game theory-Minimax, Maximum pure strategies, mixed strategies & expected payoffs, Solution of 2x4 games, mX2 game, Brown’s algorithm.                                                                                                                                                         (9)

Unit-V     :    Introduction to PERT-PERT network, ET,TE,TL,SE, Critical path probability of completing events on schedule, Introduction to Queuing theory-Queuing model with poison input, Exponential service, Poison-input-arbitary service time simulation of queues.(9)

Unit-VI     :    Introduction to probabilistic inventory models-Single multiperiod models, Markov chains, Formulation of Markov chains, First passage time and Markov chain analysis.                                                                                                                                                                                        (9)

Books :-

1)       Introduction to OR, Billey E.Gillelt : TMH Edition

2)       A.K.Sharma : Operation Research (Macmillian)

3)       LP & N/W Model : S.K.Gupta, EWF

4)       Optimization Theory : S.S.Rao, Wiley

 

2 CS 2             ASSEMBLY LANGUAGE PROGRAMMING

 

Unit-I       :    Evolution of Microprocessors, Introduction to Pentium microprocessor, Real and protected mode, Functional description of pentium, Registers, Data types, Instruction types and address­ing modes. Interrupts. Introduction to ALP, Processor flags.                                                                     (8 Hours)

Unit-II      :    Pentium instructions & Programming :

                   Data transfer instructions, String manipulation. Arithmatic instructions, Logical instructions, Bit manipulation, program transfer & Processor control instructions, Relocatable code.                                                                                                                                                         (7 Hours)

Unit-III     :    Interrupt processing :

                   Hardware and software interrupts, IVT interrupt processing. Multiple interrupts, Special interrupts. ISRs. Writing software drives, data gathering & searching, sorting, control applications & number conversions.                                                                                                                           (8 Hours)

Unit-IV     :    Programming with DOS & BIOS function calls :

                   Introduction to DOS & BIOS function calls related to keyboard, display, speaker, printers. ALP for keyboard, controlling the video display, speaker & printers using ALP, Command line inter­face & other applications.                                                                                                                    (8 Hours)

Unit-V     :    Advanced Programming Applications :

                   EXTERN & PUBLIC directives, macros & procedures. Memory manage­ment, mouse usage. TSR programs. Protected mode detection. Inter­facing C with ALP using FP Unit.                                                                                                                                                                                 (7 Hours)

Unit -VI    :    Using Disks & Files :

                   Reading & writing disk-sectors through ALP. Directory functions. Reading / Creating Text files / Accessing files. Other disk & file related functions. Protected mode operation of pentium : segmentation, paging, protection, multitasking. I/O & interrupts.(8 Hours)

 

BOOKS :

(i)    James L. Antonakos : The Pentium Microprocessor.Prentice Hall PHIPE)

(ii)   Barog Brey : Programming the 80286, 80386, 80486 & Pentium Based PC (PHI)

2CS2 ALP Laboratory :

       Minimum 12 ALP based on Unit 3,4,5,6 with at least 3 programs covering each of these units.

 

2CS3           COMPUTER GRAPHICS

 

Unit-I       :    Overview of Graphics Systems :

                   Video display devices, Raster-scan systems. Graphics monitors & workstations. Input devices. Hard-copy devices, Graphics soft­ware. Survery of computer graphics applications.                                                                                                                                                                      (8 Hours)

Unit-II      :    Output Primitives :

                   Points & Lines, Line-drawing algorithms. Line functions, circle-generating algorithm, Ellipse - generating algorithm. Other curves. Parallel curve algorithms. Pixel addressing. Filled-area primitives using functions. Cell array. Character generation.                                                                      (7 Hours)

Unit-III     :    Attributes of output primitives :

                   Line attributes, curve attributes, color levels, Area-fill at­tributes. Character & Bundle attributes. Anti-aliasing. 2D geo­metric transformations : Basic & composite transformations. Reflection & shear.                                                                                                                                 (8 Hours) 

Unit-IV     :    2D Viewing :

                   Viewing pipeline, Viewing co-ordinate reference frame and co-ordinate transformation, 2D viewing functions. Clipping opera­tions & point, Line, Polygon, Curve, Text and exterior clipping. Structure concepts and hierachical modelling with structures.                                                                       (7 Hours)

Unit-V     :    GUI : Uses dialogue. Input of graphical data, input functions. initial values, Interactive picture constructions technique. Virtual reality environments. 3D concepts : 3D display methods.                                                                                                                                                       (7 Hours)

Unit-VI     :    3D objects Representations :

                   Polygon surfaces, curved lines & surfaces, quadric surfaces, super quadrics, Blobby objects, Spline representations, cubic spline, Be’ziew curves & surfaces. B_spline curves & surfaces. Displaying spline curves & surface.                                                                                           (8 Hours)

 

BOOKS :

(i)    D. Hearn & M.P. Bakes : Computer Graphics 2/e (PHI)

(ii)   S. Harrington : Computer Graphics : A programming Approach (McGraw Hill)

(iii) Rogers : Procedural Elements for Computer Graphics (McGraw Hill)

 

2CS3 : CG Laboratory :

Minimum 12 programs based on Unit 2 to 6 with at least 2 programs from each unit.

 

2CS4                                                 COMPUTER NETWORKS

Unit-I       :    Introduction, TCP.IP Layering, DNS, C/S Model, Link Layer, Ethernet, SLIP,PPP & MTU Protocols IP. Inlanet Protocol, IP heades & routing, subnet Mask, Address Resolution Protocol & RARP.                                                                                                                                              (8 Hours)

Unit-II      :    Internet Control Message Protocol. Message type, address mask request and reply. Ping program. Traceroute Program, IP Routing : Principles, Errors & Discovery messages Dynamic Routing Protocols : RIP, OSPF, BGP, CIDR.                                                                                        (7 Hours) 

Unit-III     :    User Datagram Protocol (UDP) :

                   Header, Checksum, UDP Server design. Broadcasting and Multicast­ing, IGMP message & protocol. Domain Name system : Basic, Message format, caching. Trivial FTP.                                                                                                                                                                        (7 Hours)

Unit-IV     :    Bootstrap Protocol :

                   BOOTP Packet format, server design. TCP services and header. TCP connection establishment and termination. TCP interactive data flow. TCP bulk data flow.                                                                                                                                                                                               (8 Hours)

Unit-V     :    TCP time out & Retransmission.  TCP persist timer, keepalive timer. TCP future and performances. Simple network management protocol (SNMP). Introduction, structure, object identifiers, Traps, ASN 1 & BER.                                                                                                           (7 Hours)

Unit-VI     :    Telnet & Remote Login :

                   Rlogin protocol & example, Telnet protocol & example. File trans­fer protocol (FTP) : Protocol & example. Simple Mail Transfer Protocol. Network File System. Finger protocol, Whois protocol. Archie, WAIS, Gopher, Veronica & WWW., X-Window System.                                             (8 Hours)

BOOKS :

(i)    W. Richard Stevens : TCP/IP Illustrated Vol. 1 (Addison Wesley) (The Protocols)

(ii)   Douglas. E. Colmev : Internetworking with TCP/IP (PHI)

(iii) A.S. Tanenbaum : Computer Networks (PHI)

 

2CS5           DATABASE MANAGEMENT SYSTEMS

 

Unit-I       :    Introduction, File systems Vs DBMS, Relational model, data independence, Queries, Structure & Advantage of DBMS, Rela­tions. Integrity constraints. Storing the data : disks & file : memory hierarchy, disk space management buffer manager, introduc­tion to indexes. System cataloge in RDBMS.                                                                                                                                                                                                                     (8 Hours)

Unit-II      :    File Organisation using Indexes :

                   Comparison of file organisation, Overview of indexes. Properties of indexes. B+ Trees. Format of a node, search, Insert, Multidi­mensional indexes. Static Hashing. Using B+ trees for sorting.                                                                                                                                                     (7 Hours)

Unit-III     :    Relational Algebra & Calculus :

                   Preliminaries, Selection - Projection, Set-operations, Renaming, Joins, divisions. Relational calculus : Tuple & domain. SQL : Basics, Union, Intersect, Except, Select. Nested queries. Ag­gregate operators. Views, Queries & Views.                                                                                      (8 Hours)

Unit-VI     :    Query Processing : Introduction. Selection operation, Join operations. Impact of buffering. Query optimization : Overview, Translating SQL queries into algebra. Alternative plans. Cost estimation of a plan.                                                                                                                             (7 Hours)

Unit-V     :    Database Design :

                   Overview. ER-model : Key concepts & features. Conceptual design using the ER model. Schema refinements : Introduction, Functional dependencies. Normal forms, decompositions and BCNF.                                                                                                                                           (8 Hours)

Unit-VI     :    Physical Database Design :

                   Introduction. Index selection. Overview of database tuning. Concept of a transaction. Transactions & schedules. Lock-based concurring control. Introduction to crash recovery.                                                                                                                                                                               (7 Hours)

 

BOOKS :

(i)    R. Ramakrishnan : Database Management Systems (McGraw Hill)

(ii)   C.J. Date : Introduction to Database Management System (AWL)

(iii) Korth & Silbewshatz : Database System Concepts (McGraw Hill)

 

2CS5 : DBMS Laboratory :      

This Lab. is based on the commercial DBMS ORACLE 8.

Text Book is R. Sunderraman : ORACLE 8 Programming Primer    (Addision  Wesley), Chapters 1, 2, 3, 4, 5, & 7.

Each student must perform at least 5 programs from chapter 2, 4, and 5, and one Project from chapter 7 and submit reprot.

 

Reference :                                                                                                                           

       Appendix A of R. Ramakrishnans Book Database Management Systems. Minimum Six Programming Projects on MiniBase database system should be performed a mentioned in A.2.1 appendix.

 

2CS 6                                                   COMPUTER LABORATORY

 

This lab is based on Win32 Programming Using MFC. Contents for this Lab shall be as follows :

(i)    MFC and Windows.

(ii)   MFC Fundamentals.

(iii) Processing Messages.

(iv)   Message Boxes & Menus

(v)   Dialog Boxes & Other Controls.

(vi)   Icons, Cursors & Bitmaps.

(vii) Working with Text & Graphics

(viii) Common Controls & Status Bar, Tab Controls, Tree Views

(ix) Properly Sheets & Wizards, Menus & Help.

(x)   Thread-based Multitasking in MFC

(xi) Creating Document / View Applications.

(xii)       Exploring Active X Controls.

BOOKS :

(i)    Hevbert Schildt : MFC Programming 2/e (TMH)

(ii)   MFC Programming Unleashed (Techmedia)

*****

PART-II

 

2CS7                       OPERATING SYSTEMS DESIGN

 

Unit-I       :    General Overview of Unix system kernel. Architecture of Unix OS. Kernel Data structures. System administration. Buffer cache : Operation, Advantages & Disadvantage.                                                                                                                                                                        (8 Hours)

Unit-II      :    Internal Representation of file, inodes, structures & directories, Super Block, Allocation of Disk Blocks. System calls for the file system in Unix.                                                                                                                                                                                                                     (7 Hours)

Unit-III     :    Processors :

                   States & transitions. Layout of system memory. Context switch, Process control in Unix, Process Scheduling & Time.                 (8 Hours)

Unit-IV     :    Unix Memory Management :

                   Policies, Swapping, Demand paging. Hybrid systems. I/O subsys­tems. Drivers & streams. Diver interfaces, Disk drivers, Termi­nal drivers.                                                                                                                                                                                                                                   (7 Hours)

Unit-V     :    Interprocess Communication :

                   Process tracing, system V IPC, Network communications. Sockets.                                                                                          (7 Hours)  

Unit-VI     :    Multiprocessor Systems :

                   Problems & solutions : Using Master/ slave processors. Solutions with semaphores. Distributed Unix Sytemss.                             (8 Hours)

 

BOOKS :

(i)    M.S. Bach : Design of Unix OS (PHI)

(ii)   A.S.Tanenbaum : Operation Systems (PHI)

(iii) D.E. Comes : Operating System Design (Prentice Hall)

(iv)   Crowly Operating System (McGraw Hill)

 

2CS7 : OSD Laboratory :

       Minimum 10 programming Assignment Covering Unit 1 to 5 with two assignments per unit. These assignments should include modifica­tion of existing code of Linux/ Minix OS and verification of various algorithms in Linus/ Minix OS.

 

2 CS 8  DESIGN OF MULTIMEDIA APPLICATIONS

 

Unit-I       :    Introduction, Multimedia highway, Application areas of Multimedia (MM), MM Projects : Hardware/Software /creativity / organisation. MM team, Training Opportunities in MM

Unit-II      :    MM Hardware :

                   MM PC Platform specifications, Hardware Peripherals, SCSI and MCI. Memory & Storage Devices, MM input devices. Output hardware & their specifications. Communication devices.

Unit-III     :    Media Software :

                   Basic Tools, Painting & Drawing tools, 3D Modelling and Animation tools, Image Editing tools. OCR software. Animation, Sound, Video and digital movies. Accessories. Linking MM objects with other software. MM authoring tools : types, page based, Icon-based, Time-based, object-oriented tools.

Unit-IV     :    MM Building Blocks :

                   Text, Font & font editing and Design Tools. HyperText and Hyper­media. Font Design tools. MM sound systems. Digital Audio. MIDI in Windows. NIFF. Sound Production Tips.

Unit-V     :    Images :

                   Fundamentals, Still images, color, Image file formats. Principles of animation. Video : Fundamentals. Broadcast Video Standards. PC & TV integration. Video edition. Recording formats. Video tips. Video compression.

Unit-VI     :    MM project Planning, Estimating. MM Designing & Pro­duction MM context & testing. Alpha-beta. CD-ROM Technology. MM on the Web. Designing MM for WWW : Text, Images, Sound and Anima­tion for the Web.

 

BOOK :

(i)    T. Vaughan : Multimedia : Making IT work (3/e) (TMH)

 

2CS8 : Laboratory :

       Minimum 10 MM applcations  design,  development and testing based on the above syllabus.

2 CS 9              MODELLING & SIMULATION

 

Unit-I       :    Nature of Simulation, systems, models & simulation. Discrete event simulation. Simulation of a single-server queing system, a inventory system. Monte Carlo simulation.                                                                                                                                                                             (8 Hours)

Unit-II      :    Modelling Complex Systems :

                   List programming, Time shared computer model. Job-shop model. Simulation software : Comparison, classification & features of simulation software. GPSS & SIMSCRIPT.                                                                                                                                                                                (8 Hours)

Unit-III     :    Review of Basic probability & statistics. Principles of valid simulation modeling. Verification & validation. Approach for developing valid & credible simulation models.                                                                                                                                                                                          (7 Hours)

Unit-IV     :    Useful Probability Distributions, Techniques for as­sessing sample independence. Activity I,II & III. Models of arri­val processes.                                                                                                                                                                                                                                              (8 Hours)

Unit-V     :    Random number generators :

                   Linear congruential generators. Other kind of generators. Testing random number generators. Generating random variates : General approach.                                                                                                                                                                                                                                                 (7 Hours)

Unit-VI     :    Output data analysis for a single system : Transient & steady-state behaviour. Types of simulation. Statistical analysis for terminating simulations, for steady state parameters. Multi­ple measures of performance.                                                                                                                          (7 Hours)

 

BOOKS :

(i)    A.M. Law  W.d. Kelton : Simulation, Modelling & Analysis, 2/e (Mcgraw Hill)

(ii)   G. Gordan : System Simulation (PHI)

(iii) J.A. Payne : Introduction to Simulation (McGraw Hill)

 

2CS9 : MAS Laboratory :

       Minimum 12 simulation Assignment with programming based on Unit 1 to 6 uniformly.

 

2CS10                                      CLIENT/SERVER COMPUTING

 

Unit-I       :    Java Networking Model :

                   URL class, Java TCP socket classes & introduction to socket programming in Java. Creating a TCP Client/ server application. Overview of UDP sockets & classes. Java-net package. Multicast sockets.

Unit-II      :    Java Database Connectivity (JDBC) :

                   Overview, JDBC-ODBC bridge Javas SQL package and JDBC related classes. Architecture of a JDBC application. Creating client/ server applications using JDBC for Oracle / and Access databases.

Unit-III     :    Remote Method Invocation (RMI) :

                   Object serialization in Java, concepts of Remote objects, Archi­tecture of RMI application. Java rmi package & classes / inter­face. Client/ server application using RMI. Combining RMI and JDBC. RMI applicaiton.

Unit-IV     :    Servlets :

                   Introduction, Life cycle of a serolet, JSDK. Simple servlets. Servlet API. javax, servlet package. Reading servlet & initiali­zation parameters. javax. servlet. http package. Using cookies. Session tracking. Client/server applications using servlets. RMI servlet, JDBC servlet, RMI-JDBC servlet.

Unit-V     :    Java Beans :

                   Concepts in component model. Basics of designing a JavaBean. Beans properties. Properties, methods & events exposure. Creating & using beans properties. Using events for communication. Intro­spection.

Unit-VI     :    Enterprise JavaBeans (EJBs) :

                   Introduction, Integration of business logic with software compon­ents. Basic concepts. Serves components. “Run Any where” model. Client/Server application development & partitioning. Reusability and integration. Nonvisual components. Naming.

 

BOOKS :

(i)    H.Schildt & P. Naughta : Java 2 Complete Reference, 4/e (TMH)

(ii)   C.S. Horstmann & G.Cornell : “Core Java 2” Vol II (Addison-Wesley)

(iii) J.L. Webev : “Using Java 2 Platform” (PHI)

 

Note :

       Lab. exercise based on each unit shall be carried out as part @ of the 2CS12 Project/Seminar.

 

2CS11                                      SOFTWARE ENGINEERING

 

Unit-I       :    Introduction:

                   Software products, process, spiral model. Computer-based systems Engineering, systems procurement, architecture modelling, reli­ability engineering; Project Management : Planning, organising and scheduling.                                                                                                                (7 Hours)

Unit-II      :    Requirement Engineering :

                   Process, requirement documents, requirement validation & evolu­tion; requirement analysis : various methods & issues. System models : Data-flow, semantic & object models, data dictionaries. Requirement definitions & specification.                                                                                         (8 Hours)

Unit-III     :    Software Design :

                   Design process, strategies and quality.

                   Architectiural Design :

                   System structuring, control models, modular decomposition, do­main-specific architectures. Object-oriented design : Objects, classes, inheritance, identification, example, concurrent ob­jects.                                                                                                                                       (7 Hours)

Unit-IV     :    Function-Oriented Design :

                   Data flow design, structural decomposition. Detart design & comparison. Real-time systems design, state machine modelling, real-time executives, DAS, Uses interface design : Principles, uses-system interaction, information presentation, uses guidanc­es, interface evaluation.                    (8 Hours)

Unit-V     :    Verification & Validation, Software testing process, test planning & test strategies, black-box testing, structural testing, interface testing. Program inspection, verification & static analysis tools. CASE life cycle.                                                                                                                           (7 Hours)

Unit-VI     :    Software Cost estimation, productivity, estimation techniques, Algorithmic cost modelling. Project duration & staff­ing. Quality management : Software standards. documentation standards. Software maintenance : process, system documentation, dynamics, maintenance costs & maintanability measurements.                                                                                                                                                                               (8 Hours)

 

BOOKS :

(i)    Ian Sommeville : Software Engineering 6/e (Addison-Wesley)

(ii)   Richard Fairley : Software Engineering Concepts (TMH)

(iii) Pressman : Software Engineering : A practitionar Approach (McGraw Hill)

 

2CS 12                                     PORJECT / SEMINAR

 

(6 Hours/Week)

6 Hours of Project & Seminar are divided as follows : 1 Hour Seminar ; 2 Hours Project & 3 Hours for Programming prac­tice based on 2CS 10 Client / Server Computing.

                Project is divided into two sub parts :

            (a) Laboratory work based on (3 Hours/ week)

            2CS10 Client/ Server Computing

                   This Lab should cover programming exercises based on Java Net­working, JDBC, RMI, Servlets, JavaBeans, EJBs.

 

            (b) A term project based on the concepts of Java networking  JDBC, RMI, Servlet, Java Beans or EJBs. (2 Hours/Week)

 

                   Project / Seminar evaluation shall be done both for subparts (a) and (b).

 

                   Each student shall submit a Project report containing the Client/Server application details on 2CS10 and the details about the Project carried under part (b)

 

*****

syllabus

prescribed for

master in computer application

third year

part-i

3CS1                                                                                          Work Flow Automation

I.                 Introduction : Purposes, Systems and Methods. The System Context. The Users, The Business of the Office. Trivial Interaction Sequences. Business Requirements.

                   Workflow Requirements. Overview of the Method. Four Phases and a Database. Project Flexibility. The Method Phase Chapters. The Method Phases. Database Implementation.

II.                 The Basic Entity Model : Entities. Further Modeling. Some Basic Ideas. Representing the Model. Choosing Entity Classes and Attributes. Entity Keys. The Limitations of a Data Model. Initial Lifecycle Definitions. Lifecycle Stages. Flexible Sequencing. Office Tasks. Starting a Lifecycle.

                   Lifecycles and Entities. Lifecycles and Stages. Lifecycles and Tasks. Interacting Lifecycles.

III.                Further Entity Modeling : Further Topics. Entitites and Classes. Classification Entities. Entity Classes and Roles. Datasets. Null and Special Values. Tasks, Lifecylces and Programs. Progress through a Lifecycle. Programs for Tasks. The Context and Content of a Task. Tasks and Lifecycles. Backtracking. Dataset Context of a Task. Data Interactions. Rules and Functions. Decision Tables.

IV.               Office Workflow. Scheduling User's Work. The Workflow Problem. System Action and Reaction. A Data Model For Tasks. Task Coordination. Menu Structure. Supporting the Menu Structure. Templates. Workflow Reporting.

V.                A Database Implementation. Aspects of Database Design. Data and Programs. Classes and Individual Instances. The Large Structure of the database. View of Lifecycles and Tasks. Advantages for Work flow and Lifecycles. Effective Dates, Implementing Roles. Special Pointer Values.

VI.               Project structure Larger View. Goals and Risks. Technical Constraints and Freedoms. User Commitment and Discovery. Total User Ownership. Speed of Development. Documentation. Incompleteness Risks.

Text Book :

Michael Jackson and Graham Twaddle "Business Process Implementation : Building Workflow Systems" (Addison-Wesley)

3CS1 Work Flow Automation Lab :

Minimum eight programs based on the syllabus covering all the units.

3CS 2                                                                                                Electronic -  Commerce

I.                 Introduction : E-Commerce basic concepts, e-commerce environment, electronics marketplace technologies. Modes of electronic commerce : open issues, electronic data exchange, migration to open EDI, e-commerce with www/internet, commerce Net advocacy.

II.                 Safe e-commerce : Secure transport protocols, S-HTTP, SSL, alternatives, Secure transactions, Secure Electronics Payment Protocol, Secure Electronics Transaction, Security on Web server & Enterprise networks.

III                 Internet money payment & security requirements, Payment & purchase order process, On-line electronic cash. Need for computer security, Security strategies & tools, Encryption : conventional, public-key & application. Data encryption stndard, government security levels.

IV.               Master cards/Visa secure transaction :  introduction, Business requirements, Concepts : Payment system participants, cryptography, certificate issuance, kinds of shopping. Paymenr processing : various activities and their implementation.

V.                Secure e-mail technologies for e-commerce : introduction, means of distribution, model for message handling, e-mail working, Multipurpose Internet Mail Extensions, Secure MIME, Message Object Security Services. Comparison of security methods. MIME & related facilities for EDI over Internet.

VI.               Internet resources for E-commerce : Introduction & basic concepts, technologies for web servers, internet tools relevant to commerce, internet applications for commerce, internet charges, internet access and architecture, Internet searching.

Text Book :

D.Minoli & E.Minoli "Web Commerce Technology Handbook" (TMH)

 

References :

     1.      R.Kalakota & A.Whinston 'Frontiers of Electronic Commerce' (Addison-Wesley)

     2.      Agrawala & Lal "Business on the Net" (Macmillan)

     3.      J.Sterne "World Wide Web Marketing" (John Wiley)

     4.      Dietel & Dietel "E-Business & E-Commerce : How to Program" (Pearson Education)

 

3 CS 2         E - Commerce lab :

                   Minimum eight programs based on the syllabus covering all the units.

 

3 CS 3         Web Publishing

 

I.                 Introduction to XHTML : Editing, Headers, Linking, Images, Lists : unordered, ordered, & nested. Basic XHTML tables & their formatting. XHTML forms : simple & complex. Cascaded Style Sheets : inline & embedded, linking, element positioning & dimensioning.

II.                 Introduction to Scripting : Java Script basics, operators, data types, logical operators, control structures : if, if-else, switch-case. Looping structures : for, do-while, while. Break/continue statements.

III.                Java Script functions : declaration, definition, and referencing. Identifiers scope rules. Recursion. Arrays; declaration, allocation & accessing, sorting of arrays, JavaScript objects : Math, String, Date, Number and Boolean.

IV.               Introduction to XML : Basic concepts, structuring data, and namespaces.

                   Document Type Definitions & shcemas. XML vocabularies. Document Object Model (DOM), DOM methods. SAX concepts. XSL concepts. MS-Biz Talk. Simple Object Access Protocol.

V.                VBScript : basics, operators, Data types, control structures, function & arrays in VBScript. String manipulation, classes & objects. Introduction to active server pages (ASP) : working of ASP, setup, ASP objects, file system object, session tracking & cookies. Accessing databases using ASP.

VI.               ASP & XML case study : advantages of integrating ASP & XML. Introduction to Java Server Pages (JSP): scripting standard actions, Directives. Custom tag libraries. JSP & XML case study : advantages of integrating JSP & XML.

Text Book :

Deitel & Deitel "WWW:How to Program" (Pearson education)

 

References :

     1.      Techmedia : The Complete Java Script

     2.      Pekowsky : "Java Server Pages" (Pearson Education)

     3.      Eddy et. al. : "Teach Yourself Active Server Pages" (IDG)

 

3CS3           Web Publishing lab :

                   Minimum eight programs based on the syllabus covering all the units.

3CS4                                                                                                             Elective

(i)  Artificial Intelligence

 

I.                 Introduction to artificial Intelligence : Overview of artificial Intelligence.

                   Knowledge : General concept, Introduction to LISP : syntax and numerical functions. Basic list manipulation function in LISP. Functions, predicates and conditionals Input, output and local variables, interation and recursion. Property list and arrays.

II.                 Knowledge representation - I: Syntax and symantics for propositional logic. Syntax and symantics for FOPL. Properties of Wffs. Conversion to clausal form. Inference fuels. The resolution principle, Nondeductive inference methods. Representation using rules.

III.                Knowledge representation - II : Truth maintenance system. Default reasoning and closed world assumption. Predicate completion and circumscription, model and temporal logics. Overview of object oriented systems, object classes messages and methods, simulation examples using OOS program.

IV.               Knowledge organization and manipulation : Preliminary concept, Examples of search problems, Uniformed and blind search. Infromed search. Searching AND - OR graphs, structure used in matching. Measures for matching : distance matrices, qualitative measures, similarly measures. Partial matching, Indexing and retrieval technique, Integrating knowledge in memory. Memory organization system.

V.                Knowledge Acquisition : General concept in knowledge acquisition, Learning by induction. Analogical and explanation based learning : Analogical learning and reasoning, Explanation based learning.

VI.               Expert system : Expert system architectures : Introduction, Rules based system architecutre. Nonproductive system architecture, Dealing with uncertainty. Knowledge acquisition and validation. Knowledge system building tools.

 

Reference Books :

     1.      P.H. Winston, "Artificial Intelligence," Addison - Wesley Publication Company II Edition, 1984.

     2.      E.Charniac and D. Mc Dermott, "Introduction to Artificial Intelligence, "Addison - Wesley Publishing Company, 1985.

     3.      F.Holtz,"LISP - The language of Artificial Intelligence, "TAB Books Inc.Blue Rodge Summit, PA17214, 1985.

     4.      Peter Jackson, "Introduction to Expert Systems, "Addison - Wesley Publishing Company, 1986.

     5.      D.W.Rolston, "Principles of Artificial Intelligence and Expert Systems Development, "McGraw Hill International Edition, 1988.

     6.      E.Rich, K.K.Knight, "Artificial Intelligence, "Tata McGraw Hill, New Delhi, 1991.

 

3CS4                                                                                                             Elective

(ii) Image Processing

I.                 Digital image processing problems & applications. Image representation, Modeling, Enhancement, restoration, analysis, reconstruction & Image-data compression. Two-dimensional system : Fourier transform, Z-transform, Matrix theory results, block matrices & Kroneeker products.

II.                 Image perception, MTF, Visibility function, Monochrome Vision models, Image fidelity criteria : color representation, matching & reproduction, color co-ordinate Temporal properties of vision.

III.                Image sampling, Introduction, Two-dimensinoal sampling theory, Extensions of sampling theory, practical limitations. Image quantization, the optimum mean square quantizes, the OMSU quantizer for Non uniform densities visual quantization.

IV.               Image transforms : Two-dimensional orthogonal & unitary transforms properties of unitary transforms, one-dimensional DFT, Two-dimensional DFT. The cosine transform, the sine transform; Properties of these transforms.

V.                Introduction to following transforms with their properties : The Hadamard transform, the haar transform, the slant transform, the KL transform. A simusoidal family of unitary transforms, outer product expansion and Svd, Properties of SVD transform.

VI.               Image enhancement, point operations, Histogram modeling; equalization modification & specifications. Spatial operations. Transform  operations. Multispectral image enhancement. False & Pseudo colors, color image enhancement.

 

Books :

 

     1.      Jain A.K. : Fundamentals of Digital Images Processing. (PHI)

     2.      Gonzalez & Wintz : Digital Image Processing (Addison - Wesley)

     3.      Pratt W.K. : Digital Image Processing (Wiley-Inter Science)

     4.      Rosenfield & Kah : Digital Image Processing Vol. I,Vol. II (Academic Press)

     5.      Ekstorm M.P. (Ed) : Digital Image Processing Techniques (Academic Press)

 

3CS4                                                                                                             Elective

(iii) Computer Vision

I.                 Mathematical Preliminaries : Random Signals, Discrete Random fields, Spectral density function, Review of Estimation theory, Review of Information theory. Image Representation by Stochastic models : one dimensional Causal models. Levinson Algorithm.

II.                 Noncausal representation, Linear prediction in two-dimensions. Two dimensional spectral factorization & Stochastic decoupling.

III                 Image Observation models, Inverse & Weiner fittening, FIR Weiner fitters. Fitterning using Image transforms, Least Square fittiers. Generalized inverse, SVD and iterative methods.

IV                Spatial feature Extraction, Transform features, Edge detection Boundary extraction, Boundary Representation Region representation, Moment representation.

V.                Structure, Shape features, Texture, Seene matching and detection, Image Segmentation, Classification techniques, Image understanding.

VI.               Image reconstruction from projections. Ramdom & Inverse Random transforms, projection theorem. Back projection algorithms : Digital implementation. Image data compression. Pixel coding.

Reference Books :

 

     1.      A.K.Jain : Fundamentals of Digital Image Processing (PHI)

     2.      D.H.Ballard & C.M.Brown : Computer Vision (Prentice Hall)

     3.      R.C. Gonzalez & R.E. Woods : Digital Image Processing (Addison - Wesley)

 

3CS4                                                                                                             Elective

(iv) Parallel Computing

 

I.                 Introduction to parallel processing, Architectural classification scheme, Memory hierarchy optimization, Segmented memory system, Paged segments, Memory allocation and Management. I/O processors and I/O channels.

II.                 General pipelines & reservations tables. interleaved memory organizations, Multifunctions and array pipelines, Internal forwarding and register tagging. Hazard detection, Job sequencing, pipelined vector processing methods.

III.                Vector processing in streaming mode. Back end vector computation, vector processing in Cyber. Language features in Vector processing. Design of vectorizing compilers, Optimization of vector operations. Performance evaluation.

IV.               Cube interconnection networks, Barrel shifter, suffle exchange & Omega networks, Parallel sorting on array processors, SIMD FFT, Connection issues for SIMD processing. Associative processors, Associative search Algorithms.

V.                Multistage Network for Multiprocessors. Performance of Interconnection networks, Parallel memory organizations. Software requirements for multiprocessors, Operating system requirements. Exploiting concurrency for multiprocessing.

VI.               Multiprocessing control & algorithms, Process synchronization with semaphores. System deadlock and protection. Deterministic scheduling models. Synchronized and asynchronous parallel Algorithms. Performance of parallel Algorithms.

 

Books :

 

     1.      Hwang & Bridge : Computer Architecture & Parallel Processing (McGraw Hill)

     2.      Quinn M.J. : Designing Efficient Algorithms for Parallel Computers (McGraw Hill)

     3.      Akl S.G. : Design & Analysing Parallel Algorithms (PHI)

     4.      Bhatkar V.P. : Advanced Computing (TMH)

 

3CS5                            Component Based Computing

 

I.                 Introduction : Software distribution, Dynamic Linking, Portability, Encapsulation features & C++. Interfaces & implementation. Abstract based as binary interfaces. Runtime polymorphism. Object extensibility.

II.                 Interfaces : IDL, Methods & results, Interfaces & IDL, IUnknown, Resource, management and IUnknown. Type coercion. IUnknown implementation. Using COM interface pointers. Query Interface optimization. Data types. Attributes. Properties and Exceptions.

III.                Classes : Interface & implementation. Class objects. Activation. Using SCM, Classes & Services. Generalizations. Optimization. Monikers, Composition. Persistence. Service lifetime. Classes & IDL. Class emulation. Component categories.

IV.               Objects : QueryInterface properties : Symmetric, Transitivity, Reflexivity. Static types. Query Interface & IUnknown. Uniqueries & identiry. Multiple interface and method names. Dynamic, Binary compositions. Containment.

V.                Apartments : Basic concepts. Cross-apartment Access. In-process marshalling Helpers. Standard marshalling Architecture. Life cycle management & marshalling. Custom marshalling. Free threaded marshaler.

VI.               Applications : Inprocess Activation pitfalls. Activation & SCM. Application IDS. COM and security. Programmatic security. Access control. Token Management. Pointers & memory. Arrays. Dynamic Vs static invocation.

 

Textbook :

Don Box : Essential COM Addison - Wesley (LPE)

 

References :

     1.      MFC Programming Unleashed (Techmedia)

     2.      COM/DCOM Unleashed (Techmedia)

     3.      J.Pritchard COM & CORBA side by side (Pearson Education)

 

Component Based Computing Lab

                   Minimum Eight programs based on above syllabus.

                   Most recent version of C++ compiler should be used.

3CS6           Computer Lab : Network Programming lab  :

                   This lab is based on Unix network programming :

                   Unix model, Interprocess communication, communication protocols, Berkeley Sockets, Transport layer Interface,

                   Library routines, Ping Routines, file Transfer program,

                   Remote command execution, Remote login, Remote procedure Call.

Books :

             R. Stevens. "Unix Network Programming" Vol. I & II (Addison - Wesley)

 

part-ii

3cs7     Project

3cs8     seminar

*# ORDINANCE NO.5 OF 1996        

Examinations leading to the Degree of Master in 

Computer Application (Biannual pattern)

(Three Year Course) Ordinance,1996

 

Whereas it is expedient to prepare a new Ordinance for Examinations leading to the Degree of Master in Computer Application (Bi-annual pattern)(Three Year Course) for the purposes hereinafter appearing, the Management Council is hereby pleased to make the following ordinance.

1.       This Ordinance may be called “Examinations leading to the Degree of Master in Computer Application (Bi-annual pattern) (Three Year Course) Ordinance,1996".

2.       This ordinance shall come into force w.e.f. the session 1995-96.

3.       Subject  to their compliance with the provisions of this Ordinance and other ordinances in force from time to time, the following person shall be eligible for admission to MCA.

        (a)     Graduate in any Discipline with minimum 50% marks and math upto 10+2 level (5% Relaxation for B.C.)

        (b)     A person passing a PGDCS Exam. of Amravati University, satisfying the condition given in "a" above are eligible to take admission directly at second year of MCA(subject to condition of availability of seats, in total intake capacity)  subject to condition that he will pass the subject heads of 1st MCA not covered at PGDCS level.

4.     (i)     Duration of the course shall be three academic years.

        (ii)      Courses  of First year MCA, Second year MCA and Third year  MCA are divided into two parts every year i.e. part-I and part-II and the University shall held Examination in winter and in summer every year for both the part-I & II.

        (iii)     The main Examination of Part-I shall be held in Winter & the Main Examination of Part-II shall be held in Summer every year. The Supplementary examination for Part-I shall be held in Summer and the Supplementary Examination for  part-II shall be held in Winter every year.

5.       For purposes of instruction and examination the student shall study sequentially.

* As Approved by the Management Council, dated 15.5.1996

#As amended by Ordinance Nos. 20/2000 & 2/2003

 

6.       The  period of academic session/term shall be such as may be notified by the University.

7.       The  Examinations shall be held at such places and on such dates as may be notified by the University.

8.  Subject to his/her compliance with the provisions of this Ordinance and of other Ordinances (Pertaining to examinations in general) in force from time to time, the applicant for admission, at the end of the course of study of a particular term shall be eligible to appear at it, if,

        i)       He/She satisfied the condition in the table and the provision thereunder.

        ii)       He/She was prosecuted a regular course of study in the University/College affiliated  to the University.

        iii)      He/She has in the opinion of the Head of the Department/Principal shown satisfactory progress  in his/her studies.

 

   Name of Exam       The student should have       The student should have                                                                                                                                                                                                                               passed the examination of    completed the session/                                                                                                                                                                                                                                                                                     term satisfactorily      

1.                         2.                                                        3.

      First Year             The qualifying Examination   First Yr. MCA                                                                                                                                                                                                                      MCA   Part-I        mentioned in para-3               Part-I

      First Year                                                                 First Yr. MCA 

               

      MCA Part-II                                                              Part-I & II

 

      Second Year                                                           Second Year MCA                                                                                                                                                                                                             MCA  Part-I                                                              Part-I

     Second Year                                           Second Year MCA 

               

      MCA  Part-II                                                             Part I & II

               

      Third Year            Shall have cleared Ist of         Third year MCA                                                                                                                                                                                                  MCA Part - I         MCA & qualified for                  Part-I

      Third Year            admission to Third Year        Third Year MCA   

                                               

      MCA Part - II        as per para-4                           Part-I & II

9.       The  paper and practical in which an examinee is to be examined, the maximum marks for these and the minimum pass marks which an examinee must obtain in order to  pass in the subjects and the examination shall be as per Appendix-A.

10.  i)      The scope of the subject is as indicated in the syllabus.

        ii)       The medium of instruction and examination shall be English.

11.     There shall be no classification of examinees successful in First  Year MCA Part-I examination, First Year MCA Part-II exam., Second Year MCA Part-I exam. and Second Year MCA Part-II exam., Third Year MCA Part-I and Third Year MCA Part-II exam separately.

12.     Examinees who are  successful in Third  Year  MCA Part-II examination and all other five  previous examinations and have obtained not less than 60% marks in aggregate shall be placed in First Division & those who have obtained less than 60% shall be placed in Second Division.

13.     An examinee at First Year MCA Part-I,First Year MCA Part-II, Second Year MCA Part-I and Second Year MCA Part-II, Third year MCA Part-I and Third year MCA Part-II  examination  shall  have to  option  of  not being declared successful; at the examination in case he/she  does not secure a minimum of 50% marks at the examination. The option will have to be exercised every time an application is submitted to any of these examinations and shall be on the proforma printed on the application form itself. Once exercised, the option shall be binding upon the examinee and shall not be revoked under any circumstances.

14.     Any candidate who  has obtained a Third Division at the MCA examination of this University shall be eligible to take the examination again under this Ordinance in the same subject or group of subjects as the case may be for improvement of the division. In such case, the provision of Ordinance No. 138 relating to the improvement of Division shall apply.

15.     The provision of Ordinance No. 7-A relating to the condonation of deficiency of marks for passing an examination and Ordinance No. 10 relating to exemption and compartment shall apply to the examination under this Ordinance.

16.     An examinee who does not pass or who fails to present himself/herself for the examination shall be eligible for readmission to the same examination, on payment of fresh fees and such other fees as may be prescribed.

17.     As soon as  possible after the examination, the Management Council shall publish a result of the examinees. The result of final MCA Examination shall be classified as above and meritlist shall be notified as per Ordinance No.6.

18.     Notwithstanding anything  to the contrary in this Ordinance, no person shall be admitted to an examination under this Ordinance, if  he/she  has  already  passed the same examination or an equivalent examination of any  statutory University.

19.  i)      The examinees who have passed in all the subjects prescribed for all the examinations shall be eligible for award of the Degree of Master in  Computer Application.

        ii)       An  examinee successful at the examination shall on payment  of prescribed fees receive a degree in prescribed form signed by the Vice-Chancellor.

* * * * *

Three Year Course

Master IN Computer Application (MCA)

Semester Pattern

Second Year

 

                                                                                                 Teaching Scheme                                                          Examination Scheme

                                                                                                 L      T       Total                                        Theory                                                               Practical

Sr.       Subject                  SUBJECT                                                         Periods/  

No.      Code No.                                                                                       week       Duration   Max.      Max.         T      Min       Max      Max.          T      Min        Grand

                                                                                                                                 of             Marks    Marks       o     pass    Marks   Marks        O     pass     Total

                                                                                                                                  papers     Theory   College     T      Marks               College      T      Marks

                                                                                                                                  (HRS.)      papers   Assess- A                                                Assess-       A

                                                                                                                                                                ment                L                                         ment.            L

           PART - I                                                                                                                                       

   1.     2CS1           Operations Research                            4                    -              4                3         80          20      100        40        —          —      —               —             

 

   2.     2CS2           Assembly Language                            4                   2               6                3         80          20      100        40        25          25      50               25             

                               Programming         

 

   3.     2CS3           Computer Graphics                               4                   2               6                3         80          20       100        40        25          25      50               25            

 

   4.     2CS4           Computer Networks                              4                    -              4                3         80          20      100        40        —          —      —               —          

 

   5.     2CS5           Data Base Management                       4                   2               6                3         80          20      100        40        25          25      50               25          

                               Systems

 

   6.     2CS6           Computer Laboratory                           -                  6               6                 -       —         —      —        —        —          50      50               25

                               TOTAL                                                     20                  12    32                                                        500                                           200                               700 

           PART - II                                                                                                                     

 

   1.     2CS7           Operating Systems Design                  4                   2               6                3         80          20      100        40        25          25      50               25            

 

   2.     2CS8           Design of Multimedia                           4                   2               6                3         80          20      100        40        25          25      50               25            

                               Applications

 

   3.     2CS9           Modelling & Simulation                       4                   2               6                3         80          20      100        40        25          25      50               25         

 

   4.     2CS10         Client/Server Computing                     4                    -              4                3         80          20      100        40        —          —      —               —              

 

   5.     2CS11         Software Engineering                           4                    -              4                3         80          20      100        40        —          —      —               —

 

   6.     2CS12         Project/Seminar                                      -                   6               6                 -       —         —      —        —        75          50   150               75

                                                                                                                                                                                                                  +25   

                               TOTAL                                                     20                  12             32                                                500                                           300                               800 

   Three Year Course

Master IN Computer Application (MCA)

Semester Pattern

third Year

 

                                                                                                 Teaching Scheme                                                          Examination Scheme

                                                                                                 L      T       Total                                        Theory                                                               Practical

Sr.       Subject                  SUBJECT                                                         Periods/  

No.      Code No.                                                                                       week       Duration   Max.      Max.         T      Min       Max      Max.          T      Min        Grand

                                                                                                                                 of             Marks    Marks       o     pass    Marks   Marks        O     pass     Total

                                                                                                                                  papers     Theory   College     T      Marks               College      T      Marks

                                                                                                                                  (HRS.)      papers   Assess- A                              Assess-    A

                                                                                                                                                                ment          L                             ment.         L

           PART - I

   1.     3CS1           Work Flow Automation                             4                   2               6                3         80          20      100        40        25          25      50               25             

 

   2.     3CS2           Electronic Commerce                            4                   2               6                3         80          20      100        40        25          25      50               25            

 

   3.     3CS3           Web Publishing                                    4                   2               6                3         80          20      100        40        25          25      50               25      

 

   4.     3CS4           Elective *                                                4                    -              4                3         80          20      100        40        —          —      —               —             

 

   5.     3CS5           Component Based Computing            4                   2               6                3         80          20      100        40        25          25      50               25              

 

   6.     3CS6           Computer Laboratory                           -                   4               4                 -       —         —      —        —        —          50      50               25

 

                               TOTAL                                                     20                 12    32                                                        500                                           250               750

Elective *     i) Artificial Intelligence    ii) Image Processing   iii) Computer Vision    iv) Parallel Computing.

 

           PART-II

 

   1.     3CS7           Project    }                                                                                                       -       —                —      —   —      100        100   200               100             

                                               }   FULL TIME                                                                                                     

   2.     3CS8           Seminar  }                                                                                                       -       —         —      —        —        25          25      50               25

———————————————————————————————————————————————————————————

                                                                                                                                                                                                                                250

                                                                                                                                                                                               TOTAL : 250