SCHEME OF EXAMINATION

FOR MASTER OF COMPUTER APPLICATIONS

(Three Year Programme)

w.e.f. Academic Session 2003-2004

SEMESTER-I

----------------------------------------------------------------------

Paper     Nomenclature of Paper         Duration   Max. Marks    Total

No.                                     of Exam Theory Sessional   

----------------------------------------------------------------------

MCA-101   Computer Fundamentals         3 Hours   50       10     60

          and Problem Solving Through C

MCA-102   Computer Organisation         3 Hours   50       10     60

MCA-103   Discrete Mathematical         3 Hours   50       10     60

          Structure

MCA-104   Structured System Analysis    3 Hours   50       10     60

          and Design

MCA-105   Computer Oriented Numerical   3 Hours   50       10     60

          and Statistical Methods

          Using C

MCA-106   Software Laboratory-I         4 Hours                   40

          C (Based on MCA-101)

MCA-107   Software Laboratory-II        4 Hours                   40

          C (Based on MCA-105)

MCA-108   Seminar                                                 20

______________________________________________________________________

                                        Total   :                400

______________________________________________________________________

SEMESTER-II

 

MCA-201   Data Structures Using C       3 Hours   50       10     60

MCA-202   Software Engineering          3 Hours   50       10     60

MCA-203   System Simulation             3 Hours   50       10     60

MCA-204   Computer Oriented             3 Hours   50       10     60

          Optimization Techniques

MCA-205   Object Oriented Systems       3 Hours   50       10     60

          and C ++

MCA-206   Software Laboratory-III       4 Hours                   40

          C Language (Based on MCA-201)

MCA-207   Software Lab-IV               4 Hours                   40

          C++ (Based on MCA-205)

MCA-208   Seminar                                                 20

_____________________________________________________________________

                                        Total:                   400

_____________________________________________________________________

 


SEMESTER-III

----------------------------------------------------------------------

Paper     Nomenclature of Paper         Duration   Max. Marks    Total

No.                                     of Exam Theory Sessional     

----------------------------------------------------------------------

MCA-301   Data Base Systems             3 Hours   50       10     60

MCA-302   Visual Programming using VB   3 Hours   50       10     60

MCA-303   Computer Networks             3 Hours   50       10     60

MCA-304   Operating System              3 Hours   50       10     60

MCA-305   Windows Programming &         3 Hours   50       10     60

          Visual C++

MCA-306   Software Laboratory-V         4 Hours                   40

          ORACLE (Based on MCA-301)

MCA-307   Software Laboratory-VI        4 Hours                   40

          VISUAL PROGRAMMING

          (based on MCA-302 & MCA-305)

MCA-308   Seminar                                                 20

_____________________________________________________________________

                                        Total:                   400

_____________________________________________________________________

 

SEMESTER-IV

 

MCA-401   JAVA Programming              3 Hours   50       10     60

          and Internet Applications

MCA-402   Computer Architecture &       3 Hours   50       10     60

          Parallel Processing

MCA-403   LINUX and Shell Programming   3 Hours   50       10     60

MCA-404   Elective-I                    3 Hours   50       10     60

MCA-405   Elective-II                   3 Hours   50       10     60

MCA-406   Software Laboratory-VII       4 Hours                   40

          JAVA Programming

          (Based on MCA-401)

MCA-407   Software Laboratory-VIII      4 Hours                   40

          LINUX & Shell Programming

          (Based on MCA-403)

          and CASE Tools

MCA-408   Seminar                                                 20

_____________________________________________________________________

                                        Total:                   400

_____________________________________________________________________

List of Elective Papers

 

i)    Principles of Programming Languages

ii)   System Programming           

iii)  Advanced Database Systems

iv)   Microprocessors and Interfaces

v)    Design and Analysis of Algorithms

vi)   Software Project Management            

vii)  Management Information System

viii) Data Mining and Warehousing

ix)   Theory of Computation

x)    Network Management & Programming

 


SEMESTER-V

----------------------------------------------------------------------

Paper     Nomenclature of Paper         Duration   Max. Marks    Total

No.                                     of Exam Theory Sessional      

----------------------------------------------------------------------

MCA-501   Computer Graphics             3 Hours   50       10     60

          and Multimedia

MCA-502   Artificial Intelligence       3 Hours   50       10     60

MCA-503   Web Engineering               3 Hours   50       10     60

MCA-504   Elective-I                    3 Hours   50       10     60

MCA-505   Elective-II                   3 Hours   50       10     60

MCA-506   Software Laboratory-IX        4 Hours                   40

          PROLOG Programming

          and Graphics

          (Based on MCA-501 & MCA-502)

MCA-507   Software Laboratory-X         4 Hours                   40

          HTML,CGI using PERL,JSP,

          XML (Based on MCA-503)

MCA-508   Seminar                                                 20

_____________________________________________________________________

                                        Total:                   400

_____________________________________________________________________

 

List of Elective Papers

 

i)    Compiler Construction

ii)   Internet and Intranet Engineering

iii)  Principles of Finance & Accounting

iv)   E-Commerce

v)    Software Testing and Quality Assurance

vi)   Neural Networks

vii)  Fuzzy Logic

viii) Programming in C#

ix)   Professional Issues in I.T.

x)    Human Computer Interaction

 

SEMESTER-VI

 

MCA-601  Project (100 Evaluation, 50 Viva-voce, 50 Internal Ass.) 200

 

Grand Total for all Semesters                                    2200


MCA-101 COMPUTER FUNDAMENTALS & PROBLEM SOLVING THROUGH C

 

Note:  Total 10 questions are to be set by the examiner covering the entire syllabus uniformly. A candidate is required to attempt any five questions. All questions shall carry equal marks.

 

Total Marks : 60                                       Theory Paper       : 50

Time        : 3 Hours                           Internal Assessment: 10       

       

                                   

Computer Fundamentals: Computer components, characteristics & classification of computers, hardware & software, peripheral devices.

 

Algorithmic   Development:  Techniques of problem solving, Flowcharting, decision table, Structured programming concepts, Modular Programming, Algorithms for searching, sorting and merging. Programming methodologies:  top-down and bottom-up programming.

 

Elements of C: C character set, identifiers and keywords, Data types: declaration and definition.

 

Operators :  Arithmetic, relational,  logical,  bitwise,  unary, assignment   and  conditional  operators and  their  hierarchy & associativity.

 

Data input/output.

 

Control statements:  Sequencing, Selection: if and switch statement; alternation, Repetition: for, while, and do-while loop; break, continue, goto.

 

Functions: Definition, prototype, passing parameters, recursion.

 

Data Structures: arrays, struct, union, string, data files.

 

Pointers:  Declaration, operations on pointers, array of pointers, pointers to arrays.

 

References :

 

·           Jeri  R.  Hanly & Elliot P.  Koffman,  Problem  Solving  and Program Design in C, 3rd Ed., Addison Wesley, 2000.

·           Al Kelley, Ira Pohl, A Book on C, Programming in C, 4th Ed.,Addison Wesley, 2000.

·           Yashwant Kanetker, Let us C, BPB Publications.

·           Gottfried, Programming with C, Tata McGraw Hill.

 

 

MCA-102 Computer Organisation

 

Note:  Total 10 questions are to be set by the examiner covering the entire syllabus uniformly. A candidate is required to attempt any five questions. All questions shall carry equal marks.

                                                                 

Total Marks : 60                                Theory Paper       : 50

Time        : 3 Hours                                  Internal Assessment: 10      

 

Information Representation: Number systems, BCD codes, character codes, error detecting and correcting codes, fixed-point and floating point representation of information. Binary arithmetic operations, Booths multiplication.

 

Binary Logic: Boolean algebra, boolean functions, truth tables, canonical   and standard forms, simplification of boolean functions, digital logic gates.

 

Combinational Logic: Design  procedure,  adders,  subtractors, encoders, decoders, multiplexers, demultiplexers and comparators.

 

Sequential Logic: Flip-flops, shift registers and counters.

 

Memory System: Memory parameters, semiconductor RAMs, ROMs, magnetic and optical storage devices.

 

CPU organisation: Processor organisation, Machine instructions, instruction cycles, instruction formats and addressing modes, microprogramming concepts, microprogram sequencer.

 

I/O Organization: I/O interface, interrupt structure, transfer of information between CPU/memory and I/O devices, and IOPs.

 

References :

 

·           Mano, M. Morris  Digital Logic and Computer Design, Prentice Hall of India Pvt. Ltd., 2000.

·           Rajaraman, V., Radhakrishanan,T., An Introduction To Digital Computer Design,Prentice Hall of India Pvt. Ltd., 4th Ed.

·           Hayes, J.P., Computer Architecture and Organization, McGraw Hill, 1998, Third Ed.

·           Heuring, V.P., Jordan, H.F., Computer Systems Design and Architecture, Addison Wesley, 2000.

 

 

 

MCA-103 DISCRETE MATHEMATICAL STRUCTURES

 

Note:  Total 10 questions are to be set by the examiner covering the entire syllabus uniformly. A candidate is required to attempt any five questions. All questions shall carry equal marks.

                                                                 

Total Marks : 60                                Theory Paper       : 50

Time        : 3 Hours                           Internal Assessment: 10      

 

 

GROUP AND SUBGROUPS: Group axioms, Permutation Groups, Subgroups, Cosets, Normal subgroups, Semi-groups, FREE Semi-groups, Applications, (modular arithmatic, error correcting codes, grammars, language, Finite State Machine).

 

Graphs: Directed and undirected graphs, chains, Circuits, paths, Cycles, connectivity, Adjacency and incedence matrices, Minima's path Application(Flow  charts  and  state  transition   graphs, algorithms  for  determining  cycle  and  minimal  paths,  polish notation and trees, flows in networks).

 

Lattices  and  Boolean Algebra:  Relations to  partial  ordering, Lattices, Hasse diagram, Axiomatic definition of Boolean  algebra as  algebraic structures with two operations basic results  truth values and truth tables. The  algebra of propositional  function.  The   Boolean  algebra  of  truth   values, Applications (Switching circuits, Gate circuits).

 

Finite Fields: Definition Representation, Structure, Integral domain Irreducible polynomial, Polynomial roots, Splitting field.

 

REFERENCES:

 

·           Alan Doerr, Kenneth Levaseur, APPLIED DISCRETE STRUCTURES    FOR COMPUTER SCIENCE, Galgotia Publications Pvt. Ltd.

·           Scymour Lipschutz, Marc Lars Lipson, DISCRETE MATHEMATICS, McGRAW-HILL international editions, Schaum's Series.

·           Bernard Kolman,Robert C.Busby,DISCRETE MATHEMATICAL STRUCTURES FOR COMPUTER SCIENCE, Prentice-Hall of India Pvt. Ltd.

·           Kenneth G.Rosen: DISCRETE MATHEMATICS and ITS APPLICATIONS, McGRAW-HILL INTERNATIONAL EDITIONS, Mathematics series.

 

MCA-104 STRUCTURED SYSTEM ANALYSIS AND DESIGN

 

Note:  Total 10 questions are to be set by the examiner covering the entire syllabus uniformly. A candidate is required to attempt any five questions. All questions shall carry equal marks.

                                                                

Total Marks : 60                                       Theory Paper       : 50

Time        : 3 Hours                                  Internal Assessment: 10      

 

System Concepts & the Information System Environment, The System Development Life Cycle, Role of the System Analyst, Automated Tools for System Development.

 

System Analysis: Requirement determination and specification, feasibility study, Information gathering, structuring system requirements, process modelling, logic modelling and conceptual data modelling.

 

System Design : Designing forms  and  reports,  interface  and dialogues, databases, process, output/input, files.

 

Implementation:  Preparing for implementation, planning, test plans, program development, implementation management, changeover and routine operations.

 

Maintenance and Review: Types of maintenance Cost of maintenance, performance evaluation.

 

References :

 

·           Modern  System Analysis & Design, Hoffer J.A., George  J.F., Valacich J.S., Addison-Wesley, Second Edition.

·           Practical SSADM 4 3/e, A Complete Tutorial Guide, Philip Weaver, Nicholas Lambrou & Matthew Walkley, Addison-Wesley.

·           Systems Analysis and Design, Awad E.M., Galgotia Booksource.

·           Elements of System Analysis, Gore M. & Stubbe J., Galgotia Booksource, Third Edition.

·           Introducing System Analysis and Design, Lee, Galgotia Booksource, Combined Volume Set.

 

MCA-105 COMPUTER ORIENTED NUMERICAL AND STATISTICAL METHODS USING C

 

Note:  Total 10 questions are to be set by the examiner covering the entire syllabus uniformly. A candidate is required to attempt any five questions. All questions shall carry equal marks.

                                                                

Total Marks : 60                                Theory Paper       : 50

Time        : 3 Hours                           Internal Assessment: 10                             

 

Computer  Arithmatic : Floating point representation of  numbers, arithmatic operations with normalized floating point  numbers and their consequences.  Error in number representation - pitfalls in computing.

 

Iterative Methods: Bisection, False position, Newton-Raphson methods, Discussion of convergences, Polynomial evaluation, Solving polynomial equations (Bairstow's Method).

 

Solving of Simultaneous Linear Equations and ordinary Differential Equations:  Gauss elimination method, Ill-conditioned equations, Gauss-Seidal iterative method, Taylors series and Euler methods, Runge-kutta methods, Predictor corrector methods.

 

Numerical  Differentiation  and  Integration  :   Differentiation formulae  based on polynomial fit, Pitfalls  in  differentiation, Trapezoidal, Simpson's rules and Gaussian  Quadrature.

 

Interpolation  and  Approximation  :  Polynomial   interpolation, Difference tables, Inverse interpolation, Polynomial fitting  and other curve fitting. Approximation of functions by Taylor  series and Chebyshev polynomials.

 

Statistical methods: Sample distributions, Test of Significance, n2, t and F test.

 

Analysis of Variance :  Definition,  Assumptions,   Cochran's Theorem,    One-way   classification,   ANOVA   Table,    Two-way classification (with one observation per cell).

 

Time Series Analysis : Components and Analysis of  Time  Series, Measurement of Trend, Seasonal fluctuations and Cyclic movement.

 

References :

 

·           Gupta S.P. and Kapoor, V.K., Fundamentals of Applied station statistics, Sultan Chand & Sons, 1996.

·           Gupta S.P. and Kapoor, V.K., Fundamentals of Mathematical   statistics, Sultan Chand and Sons, 1995.

·           Rajaraman V., Computer Oriented Numerical Methods, Prentice Hall, India.

·           Graybill, Introduction to Statistics, McGraw.

·           Anderson, Statistical Modelling, McGraw.

 

 

MCA-201 DATA STRUCTURES USING C

 

Note:  Total 10 questions are to be set by the examiner covering the entire syllabus uniformly. A candidate is required to attempt any five questions. All questions shall carry equal marks.

                                                                

Total Marks : 60                                       Theory Paper       : 50

Time        : 3 Hours                                  Internal Assessment: 10      

                      

Introduction to Data Structures, Primitive and Composite, Arrays, Matrices,    Sparse   Matrices,   String    representation    and manipulation, Stack, Queue, Dequeue, Linked lists, Trees,  Binary trees,  Threaded  Binary  tree,  Balanced  tree,  Different  tree traversal algorithms, Representation of Graphs and  Applications, various searching and sorting techniques, Hashing, Dynamic Memory Management.

 

References:

 

·           Yedidyah Langsam, Moshe J Augernstein and Aarson M.Tanenbaum, Data Structures using C and C ++, PHI, New Delhi (1997)

·           Trembley,  J.P.  and  Sorenson P.G.An  Introduction  to  Data Structures   with  Applications,  McGraw-Hill   International Student Edition, New York(1984

·           Seymour Lischutz, Data Structures, McGraw-Hill Book  Company, Schaum's Outline Series, New York(1986).

 

 

MCA-202 SOFTWARE ENGINEERING

 

Note:  Total 10 questions are to be set by the examiner covering the entire syllabus uniformly. A candidate is required to attempt any five questions. All questions shall carry equal marks.

                                                                

Total Marks : 60                                       Theory Paper       : 50

Time        : 3 Hours                                  Internal Assessment: 10      

                      

 

Software  and  software engineering -  Software  characteristics, software crisis, software engineering paradigms.

 

Planning  a software project - Software cost estimation,  project scheduling, personnel planning, team structure.

 

Software  configuration  management, quality  assurance,  project monitoring, risk management.

 

Software  requirement  analysis  -  structured  analysis,  object oriented   analysis  and  data  modeling,  software   requirement specification, validation.

 

Design   and  implementation  of  software  -   software   design fundamentals,  design methodology (structured design  and  object oriented  design), design verification, monitoring  and  control, coding.

 

Software reliability - metric and specification, fault avoidance and tolerance, exception handling, defensive programming.

 

Testing - Testing fundamentals, white box and black box testing, software  testing strategies: unit testing, integration  testing, Validation testing, System testing, debugging.

 

Software     maintenance    -    maintenance     characteristics, maintainability, maintenance tasks, maintenance side effects. CASE tools.

 

References :

 

·           Pressman S. Roger, Software Engineering, Tata McGraw-Hill.

·           Jalote   Pankaj,   An  integrated   Approach   to   Software, Engineering, Narosa Publishing House

·           Sommerville  Ian,  Software Engineering,  5th  ed.,  Addison Wesley-2000

·           Fairley Richard, Software Engineering Concepts, Tata  McGraw Hill


MCA-203  SYSTEM SIMULATION

 

Note: Total 10 questions are to be set by the examiner covering the entire syllabus uniformly. A candidate is required to attempt any five questions. All questions shall carry equal marks.

                                                                 

Total Marks : 60                                Theory Paper       : 50

Time        : 3 Hours                                  Internal Assessment: 10      

 

                      

INTRODUCTION:   Concept   of   System,   stochastic   activities, continuous and discrete systems, system modeling, principals used in modeling.

 

SIMULATION  OF  SYSTEM  : Concepts of  simulation  of  continuous system  with the help of examples; use of  integration  formulas; concepts   of  discrete  system  simulation  with  the  help   of examples.  Generation   of  random numbers,  Generation  of  non-uniformly distributed random numbers.

 

SIMULATION OF QUEUING SYSTEMS:  Basic concepts of queuing theory, Simulation  of  single - server, two-server and  general  queuing systems.

 

SIMULATION  IN  INVENTORY CONTROL AND FORECASTING:   Elements  of inventory  theory,  inventory models, Generation  of  Poison  and Erlang variates, forecasting and aggression analysis.

 

DESIGN  AND  EVALUATION  OF  SIMULATION  EXPERIMENTS:  Experiment layout and Validation.

 

SIMULATION   LANGUAGES  :  Continuous  and  discrete   simulation languages,  Black-Structured  continuous  simulation   languages, Expression based languages, Discrete system simulation languages: GPSS,  SIMCRIPT, SIMULA, Factors in selection of discrete  system simulation languages.

 

References:

 

·           Gordon G. :"System Simulation" , Prentice-Hall of India Pvt. Ltd. New Delhi-1993

·           Narsingh  Deo : "System Simulation with  Digital  Computer", PHI, New Delhi, 1993

·           Payne,  James A. : Introduction to  Simulation:  Programming Techniques   and   Methods   of   Analysis.   Mcgraw-Hill International   Editions,  Computer  Science   Series,   New York(1998).

 

 

MCA-204 COMPUTER ORIENTED OPTIMIZATION TECHNIQUES

 

Note:  Total 10 questions are to be set by the examiner covering the entire syllabus uniformly. A candidate is required to attempt any five questions. All questions shall carry equal marks.

                                                                

Total Marks : 60                                       Theory Paper       : 50

Time        : 3 Hours                                  Internal Assessment: 10      

                      

Introduction  : The Historical development, Nature,  Meaning  and Management  Application of Operations research.  Modelling,  It's Principal  and Approximation of O.R.Models,  Main  characteristic and  phases,  General  Methods  of  solving  models,   Scientific Methods,  Scope,  Rule  on Decision  Making  and  development  of Operation Research in India.

 

Linear  Programming : Formulation, Graphical  solution,  standard and  matrix forms of linear programming problems, Simplex  method and its flow chart, Two phase Simplex method, Degeneracy.

 

Dualily : Introduction, Definition, General Rule for  converting  any primar into its Dual, Dual Simplex method and its flow chart.

 

Integer Programming: Importance and Applications, Gomorg's  all integer programming problem technique, Branch and Bound Method.

 

Queuing   Models  :  Introduction,  Applications,  Characteristic Waiting  and  Ideal  time costs,  Transient  and  Steady  states, Kendall's  Notations,  M/M/1,  M/M/C,  M/Ek/1  and  Deterministic Models. (No Mathematical derivations included).

 

PERT and CPM : Basic steps in PERT and CPM, Forward and  Backward computation, Representation in Tabular  form, Slack and  Critical path, Difference between CPM and PERT, Float.

 

 

References :

 

·           Gupta P.K., Hira and D.S., Operation Research, Sultan Chand & Sons, New  Delhi, 1994.

·           Kanti Swarup, Gupta P.K. & Man Mohan, Operation Research, Sultan Chand  & sons, New  Delhi, 1990. 

·           Mittal, K.V., Optimization  Methods in Operations  Research   and System  Analysis, New  Age International  (P)   Ltd., New Delhi, 1992.

·           Rao S.S., Optimization  Theory  and Applications,Wiley Eastern Ltd. New Delhi, 1991.

·           Sharma, S.D., Operations Research, Kedar Nath and Ram Nath, Meerut, 1996.

·           Taha, H.A., Operation  Research  -  An Introduction, McMillan Publishing  Co, New  York, 1986.

·           Bazara, Operation Research & Networking, Wiley.

·           Avieral, Optimization Techniques.

 

 

MCA-205 OBJECT ORIENTED SYSTEMS AND C++

 

Note:  Total 10 questions are to be set by the examiner covering the entire syllabus uniformly. A candidate is required to attempt any five questions. All questions shall carry equal marks.

                                                                

Total Marks : 60                                    Theory paper       : 50

Time        : 3 Hours                               Internal Assessment: 10

 

 

Object-Oriented Concepts: Data abstarction, encapsulation, Classes and   objects,   modularity,  hierarchy,   typing,   concurrency, persistence.

 

Object-Oriented  Methodology: Advantages and disadvantages of  OO methodologies. Modeling, Domain analysis. OMT Methodology- Object Model,  links  and associations, multiplicity,  link  attributes, role  names, ordering qualification, aggregation,  generalization and  inheritance,  abstract  class, meta  data,  object  diagram. Dynamic  Model-events,  states,  scenarios,event  traces,   state diagram.  Functional Model-data flow diagrams.  Analysis,  System design and Object design.

 

Programming  in C++: Data Types, structs vs classes, static  data & member function, constant parameters & member functions, friend functions  & friend classes, role of constructors &  destructors, dynamic  objects,  operator  overloading,  function  overloading, inheritance,  virtual functions, abstract class,  virtual  class, template  functions & template classes, exception handling,  file stream  classes,  ASCII  &  Binary  files,  sequential  &  random access to a file.

 

References :

 

·           Rumbaugh, J. et. al., Object-Oriented Modelling and Design, Prentice Hall of India, 1998

·           Booch, Grady, Object Oriented Analysis & Design, Addison Wesley, 1994

·           Stroustrup, B., The C++ Programming Language, Addison-Wesley,1993

·           Lippman, C++ Primer, 3/e, Addison-Wesley

·           Balaguruswami, E., Object Oriented Programmming In C++, Tata McGraw-Hill,1998

·           Schildt, Herbert, C++ : The Complete Reference, 2/e, Tata McGraw-Hill,1998

 


MCA-301  DATABASE SYSTEMS

 

Note: Total 10 questions are to be set by the examiner covering the entire syllabus uniformly. A candidate is required to attempt any five questions. All questions shall carry equal marks.

                                                                 

Total Marks : 60                                       Theory Paper       : 50

Time        : 3 Hours                                  Internal Assessment: 10      

                      

 

Basic Concepts: A Historical perspective, File Systems vs. DBMS, Characteristics of the Data Base Approach, Abstraction and Data Integration, Database users, Advantages and Disadvantages  of  a DBMS, Implication of Data Base approach.

 

Data Base Systems Concepts and Architecture:  Data Models, Schemas and Instances, DBMS architecture and Data Independence, Data base languages & Interfaces, DBMS functions and component modules.

 

Entity Relationship Model : Entity Types, Entity Sets, Attributes &  Keys, Relationships, Relationship Types, Roles and  Structural Constraints,  Design  issues, weak entity  types,  E-R  Diagrams. Design of an E-R Database Schema, Reduction of an E-R Schema to Tables, The Unified Modeling Language (UML).

 

Relational  Data  Model : Relational  model  concepts,  Integrity constraints   over   Relations,  Relational   Algebra   -   Basic Operations.

 

SQL  :  Data Definition, Constraints, & Schema  Changes  in  SQL, Insert,  Delete  &  update  statements  in  SQL,  view  in   SQL, Specifying Constraints and Indexes in SQL, Queries in SQL.

 

A Relational Data Base Management System : ORACLE - A  Historical perspective,  Basic  structure,  Data  base  Structure  and   its manipulation   in   ORACLE,   Storage  Organisation   in   ORACLE Programming ORACLE Applications.

 

Conventional   Data   Models  :  An  overview  of   Network   and Hierarchical Data Models.

 

Relational   Data   Base  Design   :   Functional   Dependencies, Decomposition,  Desirable  properties  of  decomposition,  Normal forms based on primary keys (1 NF, 2 NF, 3 NF and BC NF).

 

Practical  Data  Base Design : Role of  Information   systems  in Organizations, Database design process, physical database  design in Relational Databases.

 

Transaction  Processing  Concepts : Introduction  to  Transaction Processing,   Transaction  &  System  Concepts,   Properties   of Transaction,  Schedules  and Recoverability,  Serializability  of Schedules.

 

Concurrency  Control Techniques : Locking Techniques, Time  stamp ordering,   Multiversion   Techniques,   Optimistic   Techniques, Granularity of Data Items.

 

Recovery  Techniques : Recovery concepts, Recovery Techniques  in centralized DBMS.

 

Data Base Security : Introduction to Database Security issues.

 

References :

 

·           Elmasri  &  Navathe: Fundamentals of Database  systems, 3rd Edition, Addison Wesley, New Delhi.

·           Korth & Silberschatz : Database System Concept, 4th  Edition, McGraw Hill International Edition.

·           Raghu  Ramakrishnan & Johannes Gehrke:  Database  Management Systems, 2nd edition, Mcgraw Hill International Edition.

·           C.J.Date  :  An  Introduction  to  Data  bases  Systems  7th Edition, Addison Wesley, New Delhi.

·           Bipin C.Desai : An Introduction to Database System, Galgotia Publication, New Delhi

·           Abbey, Abramson & Corey : Oracle 8i-A Beginner's Guide  Tata McGraw Hill Publishing Company Ltd.

·           Ivan  Bayross : SQL, PL/SQL-The Program Language of  ORACLE, BPB Publication, New Delhi.

 

 

MCA-302  VISUAL PROGRAMMING WITH VISUAL BASIC

 

Note:  Total 10 questions are to be set by the examiner covering the entire syllabus uniformly. A candidate is required to attempt any five questions. All questions shall carry equal marks.

                                                                

Total Marks : 60                                Theory Paper       : 50

Time        : 3 Hours                           Internal Assessment: 10      

                      

 

Concepts  of  Object  based  Event  Oriented  Languages,   Visual Atchitecture  :  Method, Statement, Properties and  Event;  Basic concept of Visual Program Design and comparison with Non-Visuals.

 

The VB Integrated Development Environment and its elements : Menu bar,  tool bars, project explorer, tool box,  properties  window, form designer, form layout, etc.

 

The VB language and its elements : Variables, constants,  arrays, collections,  subroutines,  functions,  arguments,  and   control structures.

 

Designing  a  VB  application  :  Working  with  VB  forms,  form properties,  adding,  deleting, and managing forms at  run  time, coding  event procedures, implementing drag and drop  operations, menu designing, adding menu interface to forms, attaching code to events, dynamic menu appearance.

 

Coding  a VB application : Implementing user interface  controls, common  controls and their properties, dynamic  controls,  custom controls,  control arrays, using variable, subroutines,  function and  control  structures, accessing data through  code  and  data controls,  using  DLLs  in  VB  applications,  building   ActiveX clients,  activeX servers, ActiveX controls,  ActiveX  documents, and web-enabled applications, Multiple Document Interface, Graphics Programming.

 

Database programming(DAODC,ADODC) and Object Oriented programming  with VB.

 

References :

 

·           Visual Basic - 6    by Howard Hawee PHI

·           Teach yourself Visual Basic  by Warner   TMH

·           Mastering VB-6  by Evangelos  Petroutsos   TMH

·           Programming in VB-6   by J C Bradley   TMH

·           VB-6  The Complete Reference  by Jerke   TMH

·           Visual Basic by Gery Corner.

 

 

MCA-303 COMPUTER NETWORKS

 

Note: Total 10 questions are to be set by the examiner covering the entire syllabus uniformly. A candidate is required to attempt any five questions. All questions shall carry equal marks.

                                                                    

Total Marks : 60                                 Theory Paper       : 50

Time        : 3 Hours                           Internal Assessment: 10      

                      

Network  Concepts : Goals and applications of Computer  Networks; Topologies;   Categories   of   Networks   -   LAN,   MAN,   WAN, Internetworks;    point-to-point    and    broadcast    networks; Introduction  to SMDS, X.25 Networks, ISDN, frame relay  and  ATM networks.

 

Network architecture : Concept of protocols & services; OSI model and functions of its layers; TCP/IP reference model.

 

Data communication concepts : Components of a data  communication system;   transmission  modes;  transmission  media - guided  and wireless  media; introduction to switching (circuit, message  and packet) and multiplexing (frequency division and time  division); concept of Modems.

 

Framing  and Error control : Framing techniques;  Error  control- error detection & correction.

 

Data   Link  Control  :  Acknowledgments;  Elementary   data-link protocols, Automatic Repeat Request; Sliding Window protocols.

 

Medium Access Control and LANs : Multiple Access protocols of MAC sublayer  - ALOHA, 1-persistent, p-persistent and  non-persistent CSMA,  CSMA/CD,  Collision  free  protocols,  Limited  contention protocols, Wavelength Division Multiple Access, MACA, GSM,  CDPD, CDMA;  IEEE Standard 802 for LANs and MANs- Ethernet, token  bus, token ring, DQDB, Logical Link Control; High-Spped LANs.

 

Routing  :  Deterministic and Adaptive routing;  Centralized  and distributed   routing;  shortest-path;  flooding;   flow   based; optimal;  distance vector, link-state, hierarchical; routing  for mobile hosts; broadcast and multicast routing;

 

Congestion  control : Principles of congestion  control;  Traffic shaping; choke packets; load shedding; RSVP.

 

TCP/IP: Elements of Transport Protocols; transmission control protocol(TCP);user datagram protocol(UDP); Internet protocol(IP).

 

References:

 

·           Computer Networks - Andrew s. Tanenbaum, PHI.

·           Data Communications, Computer Networks and Open Systems, fourth edition-Fred Halsall, Addison Wesley.

·           Introduction   to   Data   communications   and   Networking- Behrouz, Forouzan, Tata Mc-Graw Hill.

·           Data and Computer Communications, fifth edition-William Stallings, PHI.

 

 

MCA-304 OPERATING SYSTEMS

 

Note:  Total 10 questions are to be set by the examiner covering the entire syllabus uniformly. A candidate is required to attempt any five questions. All questions shall carry equal marks.

                                                                

Total Marks : 60                                   Theory paper       : 50

Time        : 3 Hours                            Internal Assessment: 10      

 

                      

Introductory Concepts: Operating system functions and characteristics, historical evolution of operating systems, Real time systems, Distributed systems, Methodologies for implementation of O/S service system calls, system programs, Interrupt mechanisms.

 

File Systems: Functions of the system, File access and allocation    methods, Directory Systems: Structured Organizations, directory   and file protection mechanisms, implementation issues: hierarchy of file and device management.

 

CPU Scheduling:  Levels of Scheduling, Comparative study of scheduling algorithms, Multiple processor scheduling.

 

Storage Management: Storage allocation methods: Single contiguous allocation, Multiple contiguous allocation, Paging; Segmentation combination of Paging and Segmentation, Virtual memory concepts, Demand Paging, Page replacement Algorithms, Thrashing.

 

Hardware Management: Hardware Organisation, Device scheduling policies.

 

Deadlocks: Deadlock characterization, Deadlock prevention and avoidance, Deadlock detection and recovery, practical considerations.

 

Concurrent Processes: Critical section problem, Semaphores, Classical process co-ordination problems and their solutions, Interprocess Communications.

 

Protection: Goals of protection, mechanism & policies implementation dynamic protection structures, revocation protection schemes in UNIX / MULTICS.

 

Case Studies: Comparative study of DOS, WINDOW, UNIX & LINUX system.

 

References :

 

·           Peterson, J.L.& Silberschatz, A., Operating System Concept, Addison Wesley, reading.

·           Brinch, Hansen, Operating System Principles, Prentice Hall of India

·           Haberman, A.N., Introducing to Operating System Design Galgotia Publication, New Delhi

·           Tanenbaum, A.S., Operating System

·           Hansen P.B., Architecture Concurrent Programs,PHI

·           Shaw, A.C., Logic design of Operating Systems, PHI

·           Deitel, H.M., Operating System, John Wiley/Addison Wesley.


               MCA-305 WINDOWS PROGRAMMING WITH VISUAL C++

 

Note: Total 10 questions are to be set by the examiner covering the entire syllabus uniformly. A candidate is required to attempt any five questions. All questions shall carry equal marks.

                                                                 

Total Marks : 60                                Theory Paper       : 50

Time        : 3 Hours                                Internal Assessment: 10      

 

                      

Windows basic concepts, window API, DEF files, creating windows, message, x-windows, Mouse and keyboard.

 

Introduction to resources, designing and creating menus, pop-up menus, user defined resources.

 

Bitmaps and dialogues;  windows animation;  Font  basics; window controls;  Font  display; static controls,  edit  controls,  list boxes, psychic windows.

 

Overview   and    structure  of   widows   programming,   coding conventions; Displaying text, mouse, graphics  device interfaces.

 

Programming using visual C++.

 

References:

 

·           Windows Programming by Charles Petzol.

·           Windows Programming by Jim Conger.

·           Visual C++ by Yashwant Kanetkar.

 

 

MCA-401 JAVA PROGRAMMING AND INTERNET APPLICATIONS

 

Note: Total 10 questions are to be set by the examiner covering the entire syllabus uniformly. A candidate is required to attempt any five questions. All questions shall carry equal marks.

                                                                

Total Marks : 60                                       Theory Paper       : 50

Time        : 3 Hours                                  Internal Assessment: 10      

                      

 

Internet   Applications  :  Introduction  to  internet;   E-Mail- Architecture  & services, user agent, message format &  transfer, SMTP; World Wide Web(WWW) - Domain Name System, The Client  side, The  Server side, Creating and locating information on  the  web, search  engines, URL's, HTTP, FTP, Telnet; Web Browsers,  Chat  & Bulletin Board, USENET & NNTP (Network News Transfer Protocol).

 

JAVA  and  The Internet : The JAVA programming language  and  its characteristics; Java run- time environment; Java compiler;  Java developers kit; running Java applications and Java applets.

 

JAVA  programming  : Elements of Java: Data  types,  scalar  data types,  operators  &  expressions,  control  structures.   Class, objects & methods, constructors, finalizer, visibility  controls, array,  string  &  vectors,  inheritance,  interfaces,   packages multithreading, applet programming.

 

Exception  Handling- defining and throwing  exceptions,  creating your own exceptions.

 

Input/Output:  streams,  byte  and character  stream,  the  class Printstream,   data   streams,  StringTokenizer   class,   stream tokenizers.

 

Delegation  Event  Model.  AWT  classes,  AWT  controls,   Layout managers & menues.

 

References :

 

·           Computer Networks and Internets, second edition - Douglas E. Comer, Addison-Wesley, 2000

·           Programming the Internet with Java, revised  edition-  Darrel     Ince & Adam Freeman, Addison-wesley,2000

·           Programming with Java - E.Balaguruswami, Second Edition, TMH-1998.

·           The  Complete  Refernce  Java 2,  Fourth  edition  -  Herbert Schildt (TMH),2001

·           A  Programmer's  Guide to Java  Certification,  Mughal  K.A., Rasmussen R.W., Addison-Wesley,2000

 

 

MCA-402 COMPUTER ARCHITECTURE & PARALLEL PROCESSING

 

Note: Total 10 questions are to be set by the examiner covering the entire syllabus uniformly. A candidate is required to attempt any five questions. All questions shall carry equal marks.

                                                                

Total Marks : 60                                Theory Paper       : 50

Time        : 3 Hours                           Internal Assessment: 10      

  

                   

Fundamentals   :  Computational  model.  Evolution  of   computer architecture, process, thread, concurrent and parallel execution, types  and  levels of parallelism,  classifications  of  parallel architectures.  Relationships between  languages  and   parallel architectures.

 

Instruction-Level-Parallel  Processors  :  Dependencies   between instruction.  Principles  of  Pipelining.  Pipelined  instruction processing. Synchronous & asynchronous pipeline. Linear Pipeline-clocking & timing control, speedup, efficiency & throughput. Non linear  pipeline- reservation table, latency analysis,  collision free  scheduling, internal data forwarding. Superscalar pipeline design-  structure,  data dependencies, pipeline  stalling,   in-order  issue,  out  of order  issue.  VLIW  architecture.  Branch handling-   delayed   branching,  branch   processing,   multiway branching,   guarded  execution.  Code  sceduling-  basic   block scheduling, loop scheduling, global scheduling.

 

Memory Hierarchy Technology : inclusion, coherence and  locality, virtual  memory  models,  TLB, paging  and  segmentation,  memory replacement policies, cache addressing models, cache  performance issues, interleaved memory organisation.

 

Shared-Memory   MIMD  architectures  :  Dynamic   interconnection networks- shared path, switching networks- crossbar &  multistage networks. Cache coherence problem, Hardware based cache coherence protocol-Snoopy   cache  protocol,  directory  scheme,   scalable coherent  interface, hierarchical cache coherence protocol.  UMA, NUMA, CC-NUMA and COMA multiprocessors.

 

References :

 

·           Sima, D. et al., Advanced Computer Architecture, Addison Wesley, 2000

·           Hwang, Kai, Advanced Computer Architecture, McGraw Hill, International Ed.

·           Hwang Kai, Briggs Faye A., Computer Architecture and Parallel Processing, McGraw Hill, International Ed.

·           Kain, Richard Y., Advanced Computer Architecture, PHI, 1999

 

 

                MCA-403 LINUX & SHELL PROGRAMMING

 

Note: Total 10 questions are to be set by the examiner covering the entire uniformly. A candidate is required to attempt any five questions. All questions shall carry equal marks.

                                                                

Total Marks : 60                                Theory Paper       : 50

Time        : 3 Hours                           Internal Assessment: 10      

                      

 

Linux Startup

User accounts, accessing linux - starting and shutting processes, Logging in and Logging out, Command line, simple commands.

 

Shell Programming

Unix file system: Linux/Unix files, inodes and structure and file system  related  commands,  Shell  as  command  processor,  shell variables,  creating  command substitution,  scripts,  functions, conditionals, loops, customizing environment.

 

Regular Expressions and Filters

Introducing  regular  expressions  patterns,  syntax,   character classes,  quantifiers,  introduction to egrep,  sed,  programming with awk and perl.

 

The C Environment

The  C compiler, vi editor, compiler options, managing  projects, memory  management,  use of makefiles,  dependency  calculations, memory management - dynamic and static memory, building and using static and dynamic libraries, using ldd, soname, dynamic  loader, debugging with gdb.

 

Processes in Linux

Processes,  starting  and  stopping  processes,   initialization Processes,  rc  and init files, job control -  at,  batch,  cron, time,   network  files,  security,  privileges,   authentication, Password administration, archiving, Signals and signal  handlers, Linux I/O system.

 

References:

 

·           John Goerzen: Linux Programming Bible, IDG Books, New  Delhi, 2000.

·           Sumitabha Das: Your Unix - The Ultimate Guide, TMH, 2000.

·           Aho, Hopcroft and Ullman: The Design and Analysis of Computer Algorithms, Addison Wesley.

 

 

MCA-404 & MCA-405(Elective-i) PRINCIPLES OF PROGRAMMING LANGUAGES

 

Note: Total 10 questions are to be set by the examiner covering the entire syllabus uniformly. A candidate is required to attempt any five questions. All questions shall carry equal marks.

                                                                

Total Marks : 60                                       Theory Paper       : 50

Time        : 3 Hours                                  Internal Assessment: 10      

                      

Preliminaries  - language paradigms, language criteria,  language design trade-offs, influences on language design, bindings,  type checking,  and scopes, variables and data types:  primitive  data types,  variables,  structured  data  types.  Abstraction:   data abstraction, control abstraction, procedural abstraction.

 

Formal  languages and automata - The Chomsky hierarchy of  formal languages,   regular   grammars:  regular   expressions,   finite automata,  Context-free  grammars: pushdown  automata,  ambiguous grammars.

 

Imperative   programming  -  structured  programming,   procedure activations:  parameter passing methods, scope rules,  activation records.

 

Object    oriented   programming   -   messages,   methods    and encapsulation,  classes and polymorphism, inheritance and  object orientation, design issues for object oriented languages.

 

Functional  programming  -  Features  of  functional   languages, implementing  functional  languages, applications  of  functional languages.

 

Logic  programming - Formal logical systems, implementations  and applications.

 

Languages for databases - manipulating relational databases using SQL.

 

Language  constructs  for  parallel processing  -  the  paradigm, multiple processes, synchronization of cooperating processes.

 

 

References :

 

·           Sebesta W. Robert, Concepts of programming languages 4th ed.,(Addison Wesley - 2000)

·           Appleby   Doris   &  VandeKopple  J.   Julius,   Programming languages-Paradigm and practice 2nd ed. (Tata McGraw Hill  - 1999)

·           Sethi Ravi, Programming languages 2nd ed. (Addison Wesley  - 2000)

 

 

MCA-404 & MCA-405 (Elective-ii) SYSTEM PROGRAMMING

 

Note: Total 10 questions are to be set by the examiner covering the entire syllabus uniformly. A candidate is required to attempt any five questions. All questions shall carry equal marks.

                                                                

Total Marks : 60                                       Theory Paper       : 50

Time        : 3 Hours                                  Internal Assessment: 10                             

 

Introduction  to  System  Software :  Definition,  Components  of System Software, evolution of System Software.

 

Assemblers : Elements of Assembly language programming,  overview of  assembly process, design options- one pass assembler &  multi pass assembler.

 

Macroprocessors: Basic functions, Design options-Recursive  macro expansion,  General  purpose macro processors,  Macro  processing within language translators.

 

Compilers : Overview of Compilation process, Programming Language Grammar, Scanning,  Parsing, Storage allocation,  Compilation  of expressions,    Compilation   of   Control    Structures,    Code optimization,   Design   options-   Compiler-Compilers,    P-code compilers, Interpreters.

 

Loaders  &  Linkage  Editors :  Loading,  Linking  &  Relocation, Program relocatibility, Overview of Linkage editing, linking  for program overlays.

 

Software  Tools  :  Spectrum of  Software  tools,  text  editors, Program generators, debug monitors, Programming environments.

 

References :

 

·           Beck  L. Leland, System Software, 3rd ed. (Addison Wesley  - 2000)

·           Donovan J. John, System Programming, (Tata McGraw Hill)

·           Dhamdhere D.M, System programming and operating system, (Tata Mc-Graw-Hill)

 

 

MCA-404 & MCA-405 (Elective-iii) ADVANCED DATABASE SYSTEMS

 

Note: Total 10 questions are to be set by the examiner covering the entire syllabus uniformly. A candidate is required to attempt any five questions. All questions shall carry equal marks.

                                                                

Total Marks : 60                                       Theory Paper       : 50

Time        : 3 Hours                                  Internal Assessment: 10      

                      

 

Extended  E-R Model : Subclasses, Superclasses  and  Inheritance, Specialization  and Generalization, Constraints and  Characteristics of Specialization and Generalization.

 

Object-Oriented  Data Model : Object Identity, Object  Structure, and  Type Constructors, Encapsulation of Operations, Methods  and Persistence,  Type Hierarchies and Inheritance, Complex  Objects, Polymorphism, Multiple Inheritence, Versions and Configurations.

 

Object Relational Databases : Basic Concepts of Object-Relational Systems,  Object-Relational  features of Oracle, An  Overview  of SQL3,  Object-Relational support in SQL3, Nested Relational  Data Model.

 

Further   Normalization  :  Higher  Normal   Forms,   Multivalued Dependencies and Fourth Normal Form, Join Dependencies and  Fifth Normal Forms, Domain-Key Normal Form.

 

Database  System  Architectures :  Centralized  Systems,  Client-Server  Systems,  Server System Architecture,  Parallel  Systems, Distributed Systems.

 

Distributed   Databases   and   Client-Server   Architecture    : Distributed  Database Concepts, Data  Fragmentation,  Replication and Allocation Techniques for Distributed Database Design,  Types of Distributed Database Systems, Overview of Concurrency  Control and  recovery  in Distributed Databases. An Overview  of  Client-Server Architecture, Distributed Databases in Oracle.

 

Web Interfaces to Databases : Web Fundamentals, Databases and the Web,  Web Servers and Sessions, Providing access to  Database  on WWW. The Oracle Webserver.

 

Performance Tuning, Performance Benchmarks.

 

Enhanced  Data Models for Advanced Applications : An overview  of Active  Databases,  Spatial Databases,  Deductive  Databases  and Multimedia Databases.

 

References :

 

·           Elmasri  &  Navathe: Fundamentals of Database  systems,  3rd Edition, Addison Wesley, New Delhi.

·           Korth & Silberschatz : Database System Concept, 4th  Edition McGraw Hill International Edition.

·           Raghu  Ramakrishnan & Johannes Gehrke:  Database  Management Systems, 2nd Edition, Mcgraw Hill International Edition.

·           C.J.Date  :  An  Introduction  to  Data  bases  Systems  7th      Edition, Addison Wesley, New Delhi.

·           Bipin C.Desai : An Introduction to Database System, Galgotia Publication, New Delhi

·           Abbey, Abramson & Corey : Oracle 8i-A Beginner's Guide  Tata McGraw Hill Publishing Company Ltd.

·           Ivan  Bayross : SQL, PL/SQL-The Program Language of  ORACLE, BPB Publication, New Delhi.

 

MCA-404 & MCA-405 (Elective-iv) MICROPROCESSORS AND INTERFACES

 

Note: Total 10 questions are to be set by the examiner covering the entire syllabus uniformly. A candidate is required to attempt any five questions. All questions shall carry equal marks.

                                                                

Total Marks : 60                                       Theory Paper       : 50

Time        : 3 Hours                                  Internal Assessment: 10      

 

 

Introduction  to  Microprocessor and Microcomputer  :  Historical background,    modern   microprocessors    and    microcomputers, architecture   of pentium processor, real and protected modes  of operations,  addressing  modes  and instruction set of pentium processor, concept of RISC and CISC microprocessors.

 

Memory Interface : Memory devices, address decoding, 8/16/32/64 - bit memory interfaces.

 

Input-Output  Interfaces  : Introduction to I/O  interfaces,  I/O mapped I/O and memory mapped I/O, basic input interface and basic output interface, I/O port  address decoding, 8/16/32 - bit  wide I/O ports, 82C55 PPI.

 

Interrupt  Structure  :  Basic  interrupt  processing,  interrupt instructions  of pentium, operations of real and  protected  mode interrupts,  8259  PIC and its programming,  expanding  interrupt structure by cascading 8259's.

 

Direct   Memory  Access  :  DMA  data  transfer  and  basic   DMA operations, 8237 DMA controller, its programming.

 

Bus  Interface : The 8/16 - bit ISA bus and its interfacing  with input & output ports, EISA 32 - bit bus and its interfacing, VESA and VL busses, PCI and PCMCIA busses.

 

REFERENCES :

 

·           The  Intel Microprocessors : Architecture, Programming,  and Interface. By Berry B. Brey   (PHI).

·           Microcomputer  Systems  :  Architecture,  Programming,   and Design. By Liu and Gibson  (PHI).

·           Microprocessors By DV Hall.

 

 

MCA-404 & MCA-405(ELECTIVE-v) DESIGN AND ANALYSIS OF ALGORITHMS

 

Note: Total 10 questions are to be set by the examiner covering the entire syllabus uniformly. A candidate is required to attempt any five questions. All questions shall carry equal marks.

                                                                 

Total Marks : 60                                       Theory Paper       : 50

Time        : 3 Hours                                  Internal Assessment: 10      

                      

 

Introductory  Concepts : Review of important data structures  and programming   techniques,   analyzing   algorithms,    asymptotic notation, recurrence relations, introductory concepts in  program verification and testing, Structured design methodology.

 

Design   Structures  :  Outline  of  the  general   method,   its illustration with several well chosen examples for the  following basic  algorithm  design  strategies :Divide  &  Conquer,  Greedy method,   Dynamic   Programming,  Basic  search   and   traversal Techniques, Basic tracking, Branch and Bound.

 

Lower  Bound  Theory : Comparison trees,  oracles  and  adversary arguments,  techniques  for algebraic problems, lower  bounds  on parallel computation.

 

NP-Hard  and  NP-Complete  Problems  :  Basic  concepts,   Cook's theorem, examples of NP-Hard problems, approximation algorithms.

 

References :

 

·           Horowitz, Ellis and Sahni, Sartaj, Fundamentals of Computer Algorithms, Galgotia Publications.

·           Aho, Hopcroft, and Ullman, The Design and  Analysis  of Computer Algorithms, Addison Wesley.

·           Horowitz, E. and Sahni, S., Fundamentals of Data Structure, Galgotia Publications.

·           Trembley and Sorenson, An Introduction of Data Structures, with Applications, McGraw Hill.

·           Goodman, S.E., and Hetedniemi, S.T., Introduction to the Design and Analysis of Algorithms, McGraw Hill.

 

 

MCA-404 & MCA-405 (Elective-vi) SOFTWARE PROJECT MANAGEMENT

 

Note: Total 10 questions are to be set by the examiner covering the entire syllabus uniformly. A candidate is required to attempt any five questions. All questions shall carry equal marks.

                                                                

Total Marks : 60                                       Theory Paper       : 50

Time        : 3 Hours                                  Internal Assessment: 10      

                      

Conventional Software Management. Evolution of software economics. Improving software economics : reducing product  size, software   processes,  team  effectiveness,  automation   through software environments. Principles of modern software management.

 

A  software  management process framework : Life cycle  phases  - inception,   elaboration,   construction  and   training   phase. Artifacts  of  the  process  -  the  artifact  sets,   management artifacts,  engineering  artifacts, pragmatics  artifacts.  Model based   software   architectures.  Workflows  of   the   process. Checkpoints of the process.

 

Software  management  disciplines : Iterative  process  planning. Project  organizations and responsibilities. Process  automation. Project  control  and  process instrumentation  -  core  metrics, management   indicators,   life   cycle   expectations.   Process discriminants.

 

References :

 

·           Software  Project management, Walker Royce, Addison  Wesley, 1998.

·           Project management 2/e, Maylor.

·           Managing the Software Process, Humphrey.

·           Managing Global Software Projects, Ramesh, THM, 2001.

 

 

MCA-404 & MCA-405(ELECTIVE-vii) MANAGEMENT INFORMATION SYSTEM

 

Note: Total 10 questions are to be set by the examiner covering the entire syllabus uniformly. A candidate is required to attempt any five questions. All questions shall carry equal marks.

                                                                

Total Marks : 60                                  Theory Paper       : 50

Time        : 3 Hours                                   Internal Assessment: 10      

                      

Background Meaning, Nature, Need, Role, Importance, Evolution  of management  through information system; Relatedness of  MIS  with management activities. Management functions and decision making.

 

Concept of balance MIS effectiveness and efficiency criteria.

 

Development of MIS:  Methodology  and  Tools  techniques   for systematic identification, evaluation, modification of MIS.

 

References:

 

·           Robert G.Mudrick, Coel E.Ross, James  R.Claggett,Information Systems for Modern Management.

·           James A.O'Brien, Management Information Systems.

 

 

MCA-404 & MCA-405 (Elective - viii)  DATA MINING AND WAREHOUSING

 

Note: Total 10 questions are to be set by the examiner covering the entire syllabus uniformly. A candidate is required to attempt any five questions. All questions shall carry equal marks.

                                                                

Total Marks : 60                                Theory Paper       : 50

Time        : 3 Hours                                  Internal Assessment: 10      

                      

 

Introduction : The Evolution Of Data Warehousing (The  Historical Context), The  Data  Warehouse  -  A  Brief  History,   Today's Development Environment.

 

Principles   Of   Data  Warehousing  (Architecture   And   Design Techniques)  :  Types  of Data and Their  Uses,  Conceptual  Data Architecture,  Design  Techniques, introduction  to  the  Logical Architecture.

 

Creating   The  Data  Asset:  Business  Data  Warehouse   Design, Populating the Data warehouse.

 

Unlocking  the  Data  Asset for End Users (The  Use  of  Business Information)   :  Designing,  Business  Information   Warehouses, Populating  Business  information  Warehouses,  User  Access   to Information, Information Data in Context.

 

Implementing   The   Warehouse   (Managing   The   Project    and Environment):   Obstacles   to  Implementation,   Planning   your implementation,   Justifying   the   Warehouse,    Organizational Implications  of  Data Warehousing, The Data  Warehouse  in  Your Organization, Data Warehouse Management, Looking to the Future.

 

Data Mining:

Introduction: Motivation, Importance, data mining, kind of data, Functionalities,  interesting  patterns, Classification  of  data mining systems, Major issues.

 

Data Warehouse and OLAP Technology tor Data  Mining:   data warehouse,  operational  database systems  and  data  warehouses, Architecture,   Implementation,   development   of   data    cube technology,  data  warehousing  to data  mining,  Data  warehouse usage.

 

Data Preparation: Preprocess, Data cleaning, Data integration and transformation,   Data  reduction,  Discretization  and   concept hierarchy generation.

 

Data  Mining  Primitives, Languages,  and  System  Architectures, graphical user interfaces.

 

Concept   Description:  Characterization  and  Comparison,   Data generalization    and    summarization-based    characterization, Analytical  characterization,  analysis of  attribute  relevance, Mining class comparisons, Mining descriptive statistical measures in large databases.

 

Mining  Association  Rules  in Large  Databases,  Mining  single-dimensional   Boolean   association  rules   from   transactional databases,  mining multilevel association rules from  transaction databases,   Mining  multidimensional  association   rules   from relational databases and data warehouses, From association mining to correlation analysis, Constraint-based association mining.

 

Classification and prediction, issues, classification by decision induction, Bayesian classification, classification by back propagation, classification based on concepts from association rule mining other classification methods.

 

References:

 

·           Data Mining, Alex Berson,Stephen Smith,Korth Theorling,TMH.

·           Data Mining, Adriaans, Addison-Wesley Longman.

·           Data Warehousing in the Real World, Anahory, Addison-Wesley Longman.

·           Data Mining and Warehousing, Chanchal Singh, Wiley.

·           Data Mining, John E, Herbert P.


MCA-404 & MCA-405 (Elective - ix)  THEORY OF COMPUTATION

 

Note: Total 10 questions are to be set by the examiner covering the entire syllabus uniformly. A candidate is required to attempt any five questions. All questions shall carry equal marks.

                                                                 

Total Marks : 60                                Theory Paper       : 50

Time        : 3 Hours                                  Internal Assessment: 10      

 

 

Regular  sets  and regular expressions;  Deterministic  and  Non-Deterministic  finite automata, equivalence of deterministic  and non-deterministic  finite  acceptors,  Kleen's   characterization theory  for  sets  accepted  by  finite  automata,  finite  state machines and their relations to combinatorial switching circuits, complexity,   Regular   sets,   State   equivalence   and   state minimization  of  finite  automata,  Algebra  decomposition   and structure theory, Hantmannis systems structure theory,  Semgroups and Krobu Rhodes decompostion, generalized segmential machines.

 

Chomsky  to  Greibiech  normal  form  theorems,  Self  embedding, ambiguity,  Equivalence  of  context  free  languages  and   sets accepted  by non-deterministic push down store automata,  closure properties   of   context   free   languages,   Coke-Kasami-Young algorithm,  top-down and bottom-up methods,  Deterministic  push-down automata and parsing, deterministic context free  languages, Restrictions   of  push-down  automata,  parsing  algoritms   and compiler design.

 

Multitape turing machines and related formalism for  recognition, Unsolvability   of  the  halting  problem,  reduction   of   post correspondence  problem  to  the  halting  problem,   Undecidable properties   of   grammars,   program   correctness,   Algorithms complexity.

 

References:

 

·           Lewis, H.R.& Papadimitrious, C.H. Elements of the theory  of computation.PHI

·           Salomma, A.K. Formal languages, Academic press.

·           Hopcroft,J.E.&Ullman,J.D.   Formal   languages   and   their relation to Automata Addison-Wasley

·           E.V.Krishnamurthy  Introductoty theory of  computer  science East-West press pvt. ltd.

·           Zoha  Mauna Mathematical theory of computation, Wiley inter-science.

·           John Minsky, Theory of computation, PHI.

·           Greenberg M.,Introduction to Automata Theory,Addison Wesley.

 

 

MCA-404 & MCA-405 (Elective-x) NETWORK MANAGEMENT AND PROGRAMMING

 

Note: Total 10 questions are to be set by the examiner covering the entire syllabus uniformly. A candidate is required to attempt any five questions. All questions shall carry equal marks.

                                                                 

Total Marks : 60                                Theory Paper       : 50

Time        : 3 Hours                           Internal Assessment: 10      

 

Telecommunication Network Architecture, TMN management layers, Management information Model, Management servicing and functions, Structure of management information and TMN information model, SNMP v1, SNMP2 & SNMP3, RMON1 & 2, Broadband Network Management (ATM, HFC, DSL, ASN).

 

Introduction to networking, TCP/IP Protocol architecture, Classful internet addresses, subnets, super netting, address resolution Protocol(RAP) and RARP, IP datagram format, UDP and TCP/datagrams, ICMP its purpose, FINGER, NET STAT details & Ipconfig, Ping, TRACERT, ROUTE.

 

Socket introduction, elementary TCP sockets, TCP client server, I/O functions, select & poll functions, socket options, elementary UDP sockets, elementary node & address conversions, echo service (TCP & UDP).

 

Algorithms and issues in server software design: iterative connectionless servers (UDP), Iterative connection oriented services (TCP), single process, concurrent servers multiprotocol servers (TCP, UDP), multi service servers (TCP, UDP).

 

Remote procedure call concept (RCP) : RCP models, analogy between RPC of client and server, remote programs and procedures, their multiple versions and mutual exclusion communication semantics, RPC retransmits, dynamic port mapping, authentication.

 

Network file system, concept of data link access, debugging techniques, Routing sockets, broadcasting to mobile network.

 

References:

 

·           Network Management Principles & Practices by Subramanian, Mani, AWL.

·           SNMP, Stallings Willaim, AWL.

·           SNMP: A guide to Network Management, MGH.

·           Telecom Network Management by B.B.Wang, MGH.

·           Network Management by U.Black, MGH.

·           Unix Network Programming 2nd edition, W.Richard Stevens.

·           Internetworking with TCP/IP Vol. I, Douglus E.Comer.

·           Internetworking TCP/IP Vol. III, Douglus E.Comer, David L.Stevens.

·           Internetworking with TCP/IP Vol. II, Douglus E.Comer.


MCA-501 COMPUTER GRAPHICS AND MULTIMEDIA

 

Note: Total 10 questions are to be set by the examiner covering the entire syllabus uniformly. A candidate is required to attempt any five questions. All questions shall carry equal marks.

                                                                  

Total Marks : 60                                       Theory Paper       : 50

Time        : 3 Hours                                  Internal Assessment: 10      

            

Introduction : Survey of computer Graphics and its  applications; Interactive and passive graphics; Introduction to GKS primitives; display processors;

 

Graphic  Devices : Display systems-refresh CRTs, raster scan  and random scan monitors, Grey shades, Interlacing, beam  penetration shadow  mask monitors, look up tables, plasma panel, LED and  LCD monitors,  VGA and SVGA resolutions; Hard copy  Devices-printers, plotters;  Interactive Input  Devices-mouse,  digitizing  tablet, light  pen,  touch  panels, image scanners,  voice  systems,  joy stick, track ball.

 

Drawing   Geometry  :  Coordinate  system;  resolution;  use   of homogeneous   coordinate   system; scan conversion: symmetrical  DDA, simple DDA, Bresenhams line drawing  algorithm, Circle drawing using DDA and polar coordinates, Bresenhams circle drawing    algorithm,   generation   of    ellipse.

 

2-D  Transformations  : Translation;  rotation;  scaling;  mirror reflection;   shearing;  zooming;  panning;   input   techniques-pointing,   positioning,  rubber  band  methods   and   dragging; tweening.

 

Graphic  operations  : Clipping-line clipping  using  Sutherland-Cohen  and  midpoint sub-division  algorithm,  polygon  clipping; window  and  viewport;  windowing  transformation;  Filling-stack based  fill algorithm, scan-line seed fill algorithm;

 

3-D  Graphics : 3D modelling of objects; 3D  display  techniques; coordinate  system; 3D transformation matrices  for  translation, scaling   and   rotation;   parallel   projection;    perspective projection;  Hidden-surface removal - Z-buffer,back  face,  scan-line, depth-sorting, area subdivision; Shading - modelling  light intensities, gouraud shading, phong shading.

 

Multimedia: Concepts of Hypertext/Hypermedia; multimedia applications; multimedia authoring; multimedia hardware; images; bitmaps; windows paint brush.

 

References :

 

·           Computer Graphics - Donald Hearn, M.Pauline Baker, PHI

·           Principles of Interactive Computer Graphics - Newman & Sproull, McGraw Hill

·           Multimedia Systems - John F. Koegel Buford, Addison Wesley

·           Computer Graphics Principles & Practice - Foley etc. Addison Wesley

·           Procedural elements of Computer Graphics – Rogers McGraw Hill

·           Fundamentals of Computer Graphics and Multimedia - D.P. Mukherjee, PHI


MCA-502 ARTIFICIAL INTELLIGENCE

 

Note: Total 10 questions are to be set by the examiner covering the entire syllabus uniformly. A candidate is required to attempt any five questions. All questions shall carry equal marks.

                                                                

Total Marks : 60                                       Theory Paper       : 50

Time        : 3 Hours                                  Internal Assessment: 10      

 

Introduction: Background and history, Overview of AI applications areas.

 

The  predicate  calculus: Syntax and  semantic  for  propostional logic  and  FOPL, Clausal form, inference rules,  resolution  and unification.

 

Knowledge   representation:  Network   representation-Associative network & conceptual graphs, Structured representation- Frames  & Scripts.

 

Search strategies: Strategies for state space search-data  driven and  goal  driven search; Search  algorithms-  uninformed  search (depth   first,  breadth  first,  depth  first   with   iterative deepening)  and  informed search (Hill climbing, best  first,  A* algorithm,  mini-max etc.), computational complexity,  Properties of  search  algorithms-Admissibility,  Monotonicity,  Optimality, Dominance, etc.

 

Production system: Types of production system, Control of  search in production system.

 

Rule  based expert systems: Architecture,  development,  managing uncertainty   in  expert  systems(Bayesian  probability   theory, Stanford   certainty  factor  algebra,  Nonmonotonic  logic   and reasoning  with beliefs, Fuzzy logic, Dempter/Shaffer  and  other approaches to uncertainty.

 

Knowledge  acquisition:  Types of  learning,  learning  automata, genetic algorithms, intelligent editors, learning by induction.

 

Programming with Prolog.

 

References :

 

·           George   F.  Luger,  William  A.   Stubblefield   Artificial Intelligence, The Benjamin/Cummings Publishing Company, Inc.

·           Dan W. Patterson Introduction to Artificial Intelligence and Expert system PHI.

·           Eugene  Charniak, Drew McDermott Introduction to  Artificial Intelligence Addison Wesley-2000.

·           Nils J. Nilsson Principles of Artificial Intelligence Narosa publishing house.

·           Jackson  Peter,  Introduction to Expert systems,  3rd   ed., (Addison Wesley -2000).

·            

MCA-503 WEB ENGINEERING

 

Note: Total 10 questions are to be set by the examiner covering the entire syllabus uniformly. A candidate is required to attempt any five questions. All questions shall carry equal marks.

                                                                

Total Marks : 60                                       Theory Paper       : 50

Time        : 3 Hours                                  Internal Assessment: 10      

                                           

Information  Architecture  The  Role  of  Information  Architect,  Collaboration   and   Communication,   Organizing    information, Organizational  challenges, Organizing Web Sites  and  Intranets, Creating  Cohesive  Organization  Systems,  Designing  Navigation Systems,  Types  of  navigation  Systems,  Integrated  Navigation Elements,   Remote   Navigation   Elements,   Designing   Elegant Navigation Systems, Searching your Web Site, Designing the Search Interface, Indexing the Right Stuff, To Search or Not To  Search, Grouping  Content,  Conceptual  Design;  High-Level  Architecture Blueprints, Architectural Page Mockups, Design Sketches.

 

Dynamic  HTML  and Web Designing HTML Basic  Concepts,  Good  Web Design,   Process   of  Web  Publishing,  Phases  of   Web   Site development,  Structure of HTML documents, HTML Elements  -  Core attributes, Language attributes, Core Events, Block Level Events. Text  Level Events, Linking Basics, Linking in HTML,  Images  and Anchors,  Anchor  Attributes, Image Maps, Semantic  Linking  Meta Information,  Image Preliminaries, Image Download issues,  Images as Buttons, Introduction to Layout: Backgrounds, Colors and Text, Fonts,  Layout with Tables, Advanced Layout : Frames and  layers, HTML  and  other media types. Audio Support  in  Browsers,  Video Support,  Other  binary Formats. Style Sheets,  Positioning  with Style  sheets.  Basic  Interactivity,  and  HTML:  FORMS,   Forms Control, New and emerging Form Elements.

 

CGI using PERL Introduction to CGI, Alternative Technologies, The Hypertext  Transport  Protocol,  URLs,  HTTP,  Browser  Requests, Server  Responses,  Proxies,  Content  Negotiation,  the   Common Gateway  Interface, The CGI Environment,  Environment  Variables. CGI Output, Forms and CGI, Sending Data to the Server, Form Tags, Decoding Form Input, Architectural Guidelines, Coding Guidelines, Efficiency and Optimization.

 

Java  Server  Pages  Basics, Integrating  Scripts  in  JSPs,  JSP Objects  and  Components, configuring and  troubleshooting,  JSP: Request  and  response objects, Retrieving the Contents of  a  an HTML  form,  Retrieving  a  Query  String,  Working  with  Beans. Cookies, Creating and Reading Cookies. Using Application  Objects and Events.

 

XML Relationship between HTML, SGML, and XML, Basic  XML,  Valid Documents.  Ways  to use XML, XML for Data Files,  Embedding  XML into  HTML  documents,  Converting  XML  to  HTML  for   DISPLAY, Displaying  XML  using CSS and XSL, Rewriting HTML  as  XML,  The future of XML.

 

References:

 

·           Thomas A Powell, HTML-The Complete Reference,Tata McGraw Hill.

·           Scott  Guelich,  Shishir Gundavaram,  Gunther  Birzniek;  CGI Programming with Perl 2/e. O'Reilly.

·           Doug  Tidwell, James Snell, Pavel Kulchenko; Programming  Web Services with SOAP, O'Reilly.

·           Pardi, XML in Action, Web Technology, PHI.

·           Yong, XML Step by Step, PHI.

·           Aaron Weiss, Rebecca Taply, Kim Daniels, Stuven Mulder, Jeff Kaneshki, Web Authoring Desk Reference, Techmedia Publications.

 

MCA-504 & MCA-505 (Elective-i) COMPILER CONSTRUCTION

 

Note: Total 10 questions are to be set by the examiner covering the entire syllabus uniformly. A candidate is required to attempt any five questions. All questions shall carry equal marks.

                                                                  

Total Marks : 60                                       Theory Paper       : 50

Time        : 3 Hours                                  Internal Assessment: 10                             

 

Introduction   to   Compilation  :  Compilers   and   phases   of compilation,  analysis-synthesis model of  translation,  compiler construction tools.

 

Lexical  Analysis  : Process of lexical  analysis,  finite  state automata, DFA and NFA, recognition of regular expressions, LEX.

 

Syntax  Analysis : Process of syntax analysis, types of  grammar, top-down and bottom-up parsing techniques, parser generator.

 

Intermediate Code Generation : Intermediate languages, generating intermediate   code   for   declarative   statement,   assignment statement, boolean expression, and case statement.

 

Code Optimization : Introduction to code optimization,  potential cases  of code optimization, optimization of basic blocks,  loops in flow graphs, code improving transformation.

 

Code  Generation : Issues in the design of a code generator,  the target  machine,  dynamic storage management,  translating  basic blocks,  a simple code generator,peephole optimization,  directed acyclic  graphs and basic blocks, code generation  from  directed acyclic graphs.

 

Overview  of syntax directed translation scheme.

 

REFERENCES :

 

·           Compilers : Principles, Techniques & Tools, By Aho, Ullman, & Sethi (Addison Wesley)

·           Principles of Compiler Design, By Aho & Ullman (Narosa Publications)

·           Practice & Principles of Compiler Building with C, By Henk Alblas et al. (PHI)

·           Principles of Compiler Design, By Trembley & Sorenson (McGraw Hill)

 

 

MCA-504 & MCA-505 (Elective-ii) INTERNET AND INTRANET ENGINEERING

 

Note: Total 10 questions are to be set by the examiner covering the entire syllabus uniformly. A candidate is required to attempt any five questions. All questions shall carry equal marks.

                                                                

Total Marks : 60                                Theory Paper       : 50

Time        : 3 Hours                           Internal Assessment: 10      

                      

 

Internet Architecture

Introduction  to Internet and Intranets,  Internet  Architecture, Inter-networking  issues and components, Review of TCP/IP  model, Internet  addressing,  Ip address hierarchy  and  classes,  IPv6, Internet routing, Interior and Exterior gateway protocols,  CIDR, Multi-casting, Mobile Routing, Address Resolution  Protocol(ARP), IP datagrams and datagram forwarding.

 

Intranet Technologies

Intranets integrated with LAN technologies, E-Mail representation and  transfer,  SMTP, MIME, E-Mail gateways,  File  transfer  and remote file access, FTP, Network File Systems (NFS), Introduction to Novel Netware and Windows NT/2000.

 

Web-Server & Client-Server Technology

Web  Servers,  Web  Access,  Server  Architectures,  Links  among servers,  the client-server paradigm, the socket interface,  DNS, CGI  technologies  for  dynamic  Web  documents,  WWW  pages  and browsing,    Browser   Architecture,   Browser    features    and capabilities.

 

Network Security and Management

Aspects of security, Secure Networks and policies, Integrity mechanisms, Access control, Encryption and Authentication, Kerberoes, Packet filtering, Internet firewalls, Proxy servers, Internet control message protocol(ICMP), Network management  and SNMP, MIB, Concept of Network Management Software.

 

References:

·           Internet and Intranet Engineering - Technologies, Protocols and Applications - Daniel Minoli, TMH.

·           Computer Networks and Internets - Douglas E.Comer, Addison Wesley.

·           An Engineering Approach to Computer Networking - S.Keshav, Addison Wesley.

·           The ABCs of Intranets - Dyson, Coleman, Gilbert, BPB Publications.

·           Business  Data  Communications and Networking  -  Jerry  Fitz gerald, Alan Dennis, John Wiley and Sons.

·           Internet Complete, BPB Publications.

 

 

MCA-504 & MCA-505(ELECTIVE-iii)Principles of Finance & Accounting

 

Note: Total 10 questions are to be set by the examiner covering the entire syllabus uniformly. A candidate is required to attempt any five questions. All questions shall carry equal marks.

                                                                

Total Marks : 60                                   Theory paper       : 50

Time        : 3 Hours                            Internal Assessment: 10      

                      

 

Accounting - Meaning, objectives and Basic Accounting Terms.

 

Accounting  Equation,  Recording  of  Business  Transactions   in Subsidiary Books, Preparation of Ledger and Trial Balance.

 

Preparation of financial statements of a sole trader with  simple adjustments.

 

Analysis  of financial statements-need for analysis of  financial statements;  various Tools of analysis  -comparative  statements, Trend analysis, common size statements, Ratio analysis.

 

Statement of changes in financial positions. Funds Flow statement  and cash flow statement.

 

Budgetary Control - Objectives of budgetary control,  Preparation of Cash budget, Fixed Budget and Flexible Budget.

 

References :

 

·           Advanced Accounts by R.L.Gupta, Vol.I & II

·           Advanced Accounts by T.S.Grewal, Vol.I

·           Financial Management by Shashi K.Gupta.

 


MCA-504 & MCA-505 (Elective-iv) E-COMMERCE

 

Note: Total 10 questions are to be set by the examiner covering the entire syllabus uniformly. A candidate is required to attempt any five questions. All questions shall carry equal marks.

                                                                

Total Marks : 60                                       Theory Paper       : 50

Time        : 3 Hours                                  Internal Assessment: 10      

                      

 

Electronic  Commerce  Framework, Electronic  Commerce  and  media Convergence, The Anatomy of E-commerce Applications.

 

Architectural Framework for Electronic Commerce, World Wide  Web as  the  Architecture,  Web Background  :  Hypertext  publishing, Security and the Web.

 

Client-Server Network Security, Emerging Client-Server  Security Threats,  Firewalls  and  Network  Security,  Data  and   Message Security,  Digital signatures, Encrypted Documents and Electronic Mail : PGP and PEM.

 

Legal,  Ethical  and  other  public  policy  issues  related   to Electronic    Commerce   :    Protecting   privacy,    protecting Intellectual   property,  Copyright,  trademarks   and   patents, Taxation and encryption policies.

 

Consumer   oriented  Electronic  commerce  :  Consumer   oriented applications,  Mercantile  process  models,   Mercantile  process models,  Mercantile  models  from  the  Consumer's   perspective-Mercantile models from the Merchant perspective.

 

Types  of  Electronic  Payment  Systems,  Digital  Token-   Based Electronic  Payment Systems, Smart cards and  Electronic  payment Systems,  Credit Card-Based Electronic Payment Systems, Risk  and Electronic   payment  Systems,   Designing   Electronic   Payment Systems.

 

Electronic Data Interchange, EDI Applications in Business, EDI  : Legal, Security and  Privacy Issue, EDI and Electronic Commerce.

 

References:

 

·           Ravi  Kalakota, Andrew B. Whinston : Frontiers of  Electronic Commerce, Addison Wesley.

·           Efraim  Turbon,  Jae  Lee, David  King,  Chung  :  Electronic Commerce   -   A   managerial   perspective,    Prentice-Hall International.

·           Greenstein, Feinnman : Electronic Commerce, Tata McGraw-Hill.

·           Jeffrey F.Rayport, Bernard J.Jaworski : e-Commerce,  Tata McGraw Hill.

·           David Whiteley  : e-Commerce, Tata McGraw Hill.

·           Pete  Loshin,  Paul A. Murphy :  Electronic  Commerce,  Jaico Publishing House.

 

MCA-504 & MCA-505 (ELECTIVE-v) SOFTWARE TESTING AND QUALITY ASSURANCE

 

Note: Total 10 questions are to be set by the examiner covering the entire syllabus uniformly. A candidate is required to attempt any five questions. All questions shall carry equal marks.

                                                                

Total Marks : 60                                       Theory Paper       : 50

Time        : 3 Hours                                  Internal Assessment: 10                             

 

Testing and the related  concepts: significance  and  potential; Testability   and  features  of  Test  cases;  software   Testing techniques;  WBT,  BBT,  Ticking Box  testing;  static  analysis, symbolic   testing,  program  mutation  testing,   input   space, partitioning,  functional  program  testing,  data  flow   guided testing;   software   testing   strategies:   Approach,   Issues, integration,  incremental,  system,  alpha,  Beta  testing  etc.; comparative  evaluation  of  techniques:  Testing  tools, Dynamic analysis  tools,  test data generators, Debuggers,  test  drivers etc. : Technical  Metrics  for  Software:   Quality   factors, framework, Metrics for analysis, design, testing source code etc. Object Oriented Testing: OOT strategies and issues:  Test case design, interface testing; Quality assurance: concept, importance and essence; FTR, structured walk through technique etc.; SW Reliability,  validation, safety and Hazards  Analysis;  Features affecting  quality  of software; SQA Plan,  Quality  models;  ISO 9000 and SEI-CMM and their relevance.

 

References:

 

·           Software testing by Boris Beizer, Academic Press.

·           Art of Testing by G.J.Myers.

·           Software Quality by Robert H.Dunn.

·           Software Reliability by J.D.Musa,Okumota, Janino, McGraw Hill.

 

 

MCA-504 & MCA-505 (ELECTIVE-vi) ARTIFICIAL NEURAL NETWORK

 

Note: Total 10 questions are to be set by the examiner covering the entire syllabus uniformly. A candidate is required to attempt any five questions. All questions shall carry equal marks.

                                                                

Total Marks : 60                                       Theory Paper       : 50

Time        : 3 Hours                                  Internal Assessment: 10      

                      

 

Fundamental of Neural Networks

Overview  of  Biological neurons, neuron  concept,  single  layer neural   network,   notation   and   representation   of   neural networks, training of ANNs.

 

Single Layer Neural network

Representation of preceptron and issues, perceptron learning  and training,  classification,  Linear  seperability,  structure   of Hopfield nets, training, application and stability.

 

Backpropagation

Backpropagation   training   algorithm,   application   of   back propagation, advance algorithms.

 

Counter propagation networks

Kohonen   network,  Grossberg  layer,  application   of   counter propagation, Image classification.

 

Multilayer Neural Networks

BAM  structure  retrieving  a  stored  association,encoding   the association, memory capacity, ART architecture,ART classification operation,cognitron and neocognitron.

 

References:

 

·           Jock. M.Juroda, "Artificial Neural Systems".

·           Kevin Gurney,"Introduction to Neural Networks: (UCL Press).

·           Philip D. Wasserman,Neural Computing and Practice, ANZA Research Inc. 

 

 

MCA-504 & MCA-505 (ELECTIVE-vii) FUZZY LOGIC

 

Note: Total 10 questions are to be set by the examiner covering the entire syllabus uniformly. A candidate is required to attempt any five questions. All questions shall carry equal marks.

                                                                

Total Marks : 60                                Theory Paper       : 50

Time        : 3 Hours                           Internal Assessment: 10      

                      

 

Introduction:-  Crisp sets, Fuzzy sets, Representations of  fuzzy sets,  Extension  principle for fuzzy sets; types  of  operatins, Fuzzy    complements,   Fuzzy   intersections,    fuzzy    union, combinations of operations, Aggretation operations.

 

Fuzzy   arithmetic:-   Fuzzy  numbers,   linguistics   variables, operation  on  internals,  Operation  on  fuzzy  numbers,   Fuzzy relations:-  projections and cylinder extensions,  Primary  fuzzy relations,  Binary  relations on single  set,  Fuzzy  equivalence relations, Fuzzy ordinary relations.

 

Fuzzy  logic:-  Overview of classical logic,  Multivalued  logic, fuzzy  propositions,  fuzzy quantifiers,  Interence;  Conditional fuzzy   proportions,  conditional  and   qualified   proposition. Quantified propositions. Uncertaionty-based information.

 

Applications:- Approximate reasoning, pattern recognition,  fuzzy databases   and  information  retrieval  systems,  fuzzy   linear programming, Fuzzy regerssion, Interpersonal communication.

 

References:

 

·           George J.Keln, Boyuan, "Fuzzy sets and fuzzy logic,"P.H.I.

 

 

MCA-504 & MCA-505(ELECTIVE-viii)  PROGRAMMING IN C#

 

Note: Total 10 questions are to be set by the examiner covering the entire syllabus uniformly. A candidate is required to attempt any five questions. All questions shall carry equal marks.

                                                                 

Total Marks : 60                                Theory Paper       : 50      

Time        : 3 Hours                           Internal Assessment: 10

                      

 

Introduction: C# environment, characterstics of C#.

 

Data  types:  Data types, value types, reference  types,  default value,  constants  variables,  scope  of  variables,  boxing  and unboxing.

 

Operators  and  expressions:  Arithmatic,  relational,   logical, bitwise,  special operators, evolution of  expressions,  operator precedence & associativity.

 

Control constructs: Decision making, loops.

 

Classes  &  methods: Class, methods,  constructors,  distructors, overloading of operators & functions.

 

Inheritance  &  polymorphism:  visibility  control,   overriding, abstruct class & methods, sealed classes & methods, interfaces.

 

Advanced  features  of C#: Exception handling &  error  handling, Interfacing with COM, automatic memory management.

 

References:

 

·           Programming in C# By E. Balaguruswamy, Tata McGraw Hill

·           The Complete Guide to C# Programming by V.P.Jain

·           C# : A Beginner's Guide, Herbert Schildt,Tata McGraw Hill

 

                     

MCA-504 & MCA-505(ELECTIVE-ix) Professional Issues in IT

 

Note: Total 10 questions are to be set by the examiner covering the entire syllabus uniformly. A candidate is required to attempt any five questions. All questions shall carry equal marks.

                                                                 

Total Marks : 60                                Theory Paper       : 50      

Time        : 3 Hours                           Internal Assessment: 10

 

 

Legal Issues: Introduction to legal concepts, Basic outline of Criminal and Civil Laws, Concepts relating to laws of Contract and Commercial Law, Substantive Legal Issues, Intellectual property Issues,       Cyber crime, Data protection principles and implications of the European Union Data Protection Directive, Confidentiality and privacy, Intellectual property rights, Copyright and Industrial Property, Patents, Trade Marks and laws relating to designs, Software Protection and piracy, Dealing with Copyright, Originality, Exception to Copyright infringement, Employees and freelance programs, devices to overcome protection.

 

Software Licensing, Methods of licensing, Copyright & electronic publishing, Copyright problems posed by electronic publishing.

 

Multimedia, licensing and related issues:  Protection of Databases, Trade marks and passing off, Internet related issues, Contract issues and Law, Basic understanding of the Types of Agreements in large computerization projects – Implementation Agreements, License Agreements, Maintenance agreements etc., Enforcement issues, dispute resolution, arbitration, legislative action.

 

Other Professional Issues: Duties of a professional, Duties to client, Duties to Employer, Duties to profession, Duties to society, Accountability for quality, timeliness and use of resources, Human relationships and change management, Avoiding computer misuse, Hacking, unauthorized access and types of Computer Crime, Introduction of Viruses, Fraud and types of Computer Fraud, Implications arising from the Draft Computer Crimes Act (Sri Lanka), Public interest and Social implications, Environmental protection, Health and safety issues, Privacy, Ethics and Codes of Professional Conduct, The need for professional ethics, Characteristics of professions, Integrity & Honesty, Competence, Professional development, judgment, knowledge of law, relations, standards, independence, Acting with responsibility, professional skill, comply with law, Confidentiality, due care, Contribute towards advancement of human welfare, Public interest, Public awareness, Basic human rights, Ethics and the Internet, Netiquette and Policy approaches, Professional relationships, Are computer professionals “Professionals”, Conflicting responsibilities and misconduct, Codes of Ethics.

 

References:

 

·           Bott F. et al. Professional Issues in Software Engineering (2nd edition.), UCL Press. 1995. ISBN: 1-85728-450-X BP.

·           Myers C., Hall T. and Pitt D., (Eds), The Responsible Software Engineer: Selected Readings in IT Professionalism, Springer, 1997, ISBN: 3-540-76041-5.

 

 

MCA-504 & MCA-505(ELECTIVE-x) Human Computer Interaction

 

Note: Total 10 questions are to be set by the examiner covering the entire syllabus uniformly. A candidate is required to attempt any five questions. All questions shall carry equal marks.

                                                                 

Total Marks : 60                                       Theory Paper       : 50      

Time        : 3 Hours                                  Internal Assessment: 10

 

Introduction & overview of HCI.

Objectives of course, Course administrivia, Review of course plan, A (semi-) complete history of computer user interfaces, HCI - history and intellectual roots, Research

 

Human information processing limitations, human decision making.

Human cognitive and sensory limits, Human memory, Human problem solving, Skill acquisition, Users’ conceptual models (mental models), Decision making.

 
Computer systems and user interfaces, human-system interaction.

Input and output devices, Mechanics of particular devices, Speech input, sound and speech output, Computer architecture, Performance characteristics of humans and systems, Color issues, Computer graphics, Color representation, color maps, color range of devices.

 
Interaction models and metaphors.

Use of abstract metaphors for describing interface behavior, Use of metaphors to support user understanding, Dialog input and output techniques and purposes, Screen layout issues, Dialog interaction: types and techniques, navigation and orientation, multimedia and non-graphical dialogues, Dialog issues: response time, control, standards, look and feel, Layers model of architecture of design and windowing systems, Windows manager models, e.g., X, Macintosh, MS Windows, Hypermedia and WWW.

 
Principles guiding well-designed human-system interaction.

Paradigms for interaction, Principles to support usability, Accounting for users with disabilities.

 

The design process - overview.

The typical software development lifecycle(idealized vs. actual), User-centered design overview, “Three pillars of design”, Usability engineering overview, Reconciling UCD and usability testing.

 
The design process - task and user needs analysis.

Task analysis definition, Techniques for task analysis, Sources of information.

 
The design process – making use of task and user data for system design.

Use cases, scenarios, Structuring the information, Information architecture, User and process flows, Wireframes, Mockups, comps, Other methods of conveying structure and function

 

Designing for universal access.

What is accessibility? What is accessible software, Examples of accessibility adaptations, What’s driving software accessibility, Implications for software organizations

 

Verifying the design – usability evaluation and testing.

Terms, Overview of methods – professional evaluation vs. testing, Usability testing, pluralistic cognitive walkthrough, When to use which method.

 

Speech user interfaces.

Attributes of speech user interfaces, Evaluating speech user interface quality.

 

Computer-supported cooperative work; organizational and social issues.

Interaction types, Computer systems for group tasks, workflow, Applications of CSCW, Socio-technical systems, impact of systems on work and vice versa, Quality of work life and job satisfaction.

 
HCI in mission-critical and high-risk environments.

Safety implications of human-computer interaction, Effects of automation, Addressing the effects

 
Beyond the PC.

Other interaction paradigms

 

References:

 

·          Hackos, J.T. & Redish, J.C. (1998). User and task analysis for interface design. John New York: Wiley & Sons. ISBN 0471178314.

·          Norman, D. (1988). The design of everyday things. New York: Basic Books. ISBN 0-385-26774-6.

·          Human Computer Interaction    Dix, A et al. Prentice Hall 1993

·          Graphical User Interface Design and Evaluation Redmond-Pyle, D. & Moore, A. Prentice Hall 1995 

·          The Art of Human-Computer Interface Design    Laurel, B    Addison-Wesley 1990