mazters syllabus deepu

WITH EFFECT FROM THE ACADEMIC YEAR 2011-2012

Telangana University
SCHEME OF INSTRUCTION & EXAMINATION
MCA I YEAR
w.e.f: 2011-2012
SEMESTER – I

Scheme of
Scheme of Examination
Instruction
Syllabus
Sl. Periods per
Ref. SUBJECT Maximum Marks
No Week Duration
No.
in Hrs.
Univ. Exam Sessionals

THEORY

Discrete
1 CS 601 4 - 3 70 30
Mathematics
Probability &
2 CS 602 4 - 3 70 30
Statistics
Computer
Programming
3 CS 603 4 - 3 70 30
and Problem
Solving
Elements of
4 CS 604 Information 4 - 3 70 30
Technology
Modern
5 CS 605 Economic 4 - 3 70 30
Analysis

PRACTICAL

Programming
Lab – I
1 CS 631 - 6 3 50 25
(C & C++
Programming)
Programming
2 CS 632 Lab – II - 6 3 50 25
(EIT Lab)

Total 20 12 450 200

TELANGANA UNIVERSITY 1 MCA SYLLABUS


CS 601 DISCRETE MATHEMATICS
Instruction: 4 Periods per week
Duration of University Examination: 3 Hours
University Examination: 70 Marks
Sessional: 30 Marks

UNIT – I
Fundamentals of Login: Basic Connectives and Truth Tables, Logical Equivalence, Logical
Implication, Use of Quantifiers, Definitions and the Proof of Theorems.
Boolean Algebra: Switching Functions, Logic gates, Don’t Care Condition.
Set Theory: Sets and Subsets, Set operations and the Laws of Set theory, Counting and Venn
Diagrams.

UNIT-II

Properties of Integers: The well-ordering principle, Recursive definitions, The Division
Algorithm, Euclidean Algorithm, Fundamental theorem of arithmetic. Functions: Cartesian
Product, Functions, Onto Functions, Special Functions, Pigeonhole Principle ,Composition
and Inverse Functions, Computational Complexity. Relations: Partial Order Relations,
Lattices, Equivalence Relations and Partitions.

UNIT-III

Principle of inclusion and Exclusion: Principles of Inclusion and Exclusion,
Generalization of principle, Derangements, Rooks Polynomial, Arrangements with
Forbidden Positions.
Generating Functions: Introductory examples, Definitions and examples, Partition of
Integers, Exponential generating function, Summation operator.

UNIT-IV

Recurrence Relations: First-order linear recurrence relation, Second-order
linear homogeneous recurrence relations with constant coefficients, Non-homogeneous
recurrence relations, Divide -and- conquer algorithms.
Algebraic Structures: Definition , Examples and properties.
Groups: Definition, Examples and elementary properties, Homomorphism,
Isomorphism and Cyclic groups.

UNIT – V

Graph Theory: Definitions and examples, Subgraphs, Complements and graph isomorphism,
Vertex degree, Planar graphs: Hamiltonian paths and Cycles, Graph coloring.

Trees: Definitions, Properties and Examples, Rooted Trees. Spanning Trees and Minimum
Spanning Trees.



Suggested Reading:
1. Ralph P.Grimaldi, “Disrete and Combinatorial Mathematics”, person Education, 4th
Edition, 200,

References:
I. Kenneth H Rosen, "Discrete Mathematics and its Applications" Tata McGraw Hill , 6th
Edition,2007.
2. J.P.Tremblay & R.Manohar, "Discrete mathematical Structures-with Applications to
Computer science" ,McGraw Hi11.1987."
3. Joe L.Mott, A.kanda! & T.p.Baker, "Discrete mathematics for Computer scientists, &
mathematicians", prentice Hall N.J., 1986
4. Kevin Ferland, "Discrete Mathematics", Houghton Mifflin Company, 2009.



CS 602 PROBABILITY AND STATISTICS

Sessional: 30 Marks

UNIT -I

Data Validation and Information Abstraction: Methods of collecting data efficiently, Gathering
information from data charting.

UNIT -II

Probability: Laws of Probability, Probability distributions, Discrete, Equiprobable, binomial
Poisson.

UNIT -III

Continuous Distributions: Rectangular, normal, gamma and beta.

UNIT-IV

Statistical Methods: Frequency distributions, Mathematical Expectation, Moments, Skewness and
Kurtosis.

UNIT -V
Correlation and Regression, Introduction to tests of Significance, u, t, x tests.

Suggested reading:

1. S.C. Gupta and V.K. Kapoor, "Fundamentals of mathematical Statistics", 1989.

2. William Mendenhall, Robert J. Beaver, Barbara M. Beaver, " Introduction to
Probability and Statistics ", Thomson Brooks/Cole, Eleventh Edition, 2003.

3. Richard A. Johnson, "Probability and Statistics for Engineers ", Prentice Hall of
India. Seventh Edition 2005.



CS 603 COM PUTER PROGRAMMING AND PROBLEM SOLVING

Sessional: 30 Marks

The First Three Units (I, II & III) are for ‘C’ Programming and the last Two Units (IV and V)
are for C++
UNIT -I

Introduction to Computers: Computer Systems, Computing Environments, Computer Languages,
Creating and Running programs, System Development.

Introduction to C Language: C programs, identifiers, Types, Variables, Constants, Operators.
Input/Output, Expressions:- precedence and associatively, evaluating expressions, type conversion,
statements, Selection:- making decisions (conditional statements) ,repetition (control statements).

UNIT-II

Functions : Designing Structured Programs, Functions in C, User-defined functions, Inter-function
communication (Parameter passing mechanism), Standard Functions, Scope, Recursion.
Arrays: Concepts, Using Arrays in C, Inter-Function Communication (Passing arrays to functions), Two
Dimensional arrays, Multidimensional arrays. Application:- selection, bubble and insertion sort.'
Pointers: Introduction, Pointers for Inter-Function Communication, Pointers to Pointers, Compatibility,
Arrays and Pointers Cw.r.t arithmetic, passing arrays to function), memory allocation functions ..
Strings : String concepts, C Strings, String Input/Output Functions, Array of Strings, String Manipulation
functions.

UNIT -III

Enumerated, Structure, and Union Types: The Type -Definition ( typedef), Enumerated types,
Structure, Unions. Enumerations, Unions, Pre-Processor Directives.
Text Input/Output Files in C: Files, Streams, Standard Library Input/Output functions, Formatting
Input/Output Functions, Character Input/Output Functions,
Binary Input/Output : Text versus Binary streams, Standard Library Functions in Files, Converting File
Type.

UNIT-IV

Introduction to C++: Introduction and Basic elements of C++.
Functions in C++: User-defined functions, Types of functions, Parameter passing mechanisms,
Overloading, Inline fUl1ctions, Function Templates.

UNIT- V

Classes: Introduction to classes, Inheritance, Operator Overloading, Dynamic Polymorphism
using Virtual functions, Abstract Classes. Templates and Exceptional Handling.



Suggested Reading:

1) Behrouz A. Forollzan, Richard F Grilberg, "Computer Science - A Structured
approach using C", 3rd Edition, Cengage Learning 2007. (For Units I, II, III).

2) D. S. Malik, "C++ Programming Language ", Cengage Learning, 2009. (For Units IV
and V)

References:

1. Harry.H. Cheng, "CIC++ for Engineers and Scientist - An Inte1]Jretive
Approach", McGraw-Hill, International Edition, 2009.
2. Owen L. Astrachan, "Programming with C++", Tata Mcgraw Hill, 2007.
3. Bjarne Stroustrup, "The C++ Programming language", 3rd Edition,
Addison- Wesley, 1998 ..



CS 604 ELEMENTS OF INFORMATION TECHNOLOGY

Sessional: 30 Marks

UNIT -I

Digital Age: Digital basis of Computers, Data/Information, Hardware Input, Output, Memory,
Communication Hardware, Software, Application Software, System Software, Communications, Five
kinds of Computers, Development in communication Technology, Connectivity and . Interactivity, Five
Generations of Programming Languages, Programming languages used today, Object Oriented & Visual
Programming.
Operating Systems: Booting, Managing Storage, Resources, Files tasks, Common operating systems:
Windows 95/98, DOS, and Windows -NT.

UNIT -II

Processors: The CPU and Main Memory, Data Representation, Micro Computer System Unit, Input &
Output devices, Keyboard, Pointing devices, Source data entry devices, Soft copy output, Hardcopy
output, more output devices, Diskettes, Hard-disks, Optical disks, Flash memory, Magnetic tape,
Compression and Decompression.

UNIT -III

Telecommunications:DATA, Video, Audio communication, the Internet, the World Wide Web, new
Internet technologies, Communication channels, Networks,· conduits of communication, Communication
networks, Local networks, factors affecting communication among devices.

UNlT- IV

Files & Databases: Data storage hierarchy, File management, Files Management Systems, Database
Management Systems, type of database organization, and features of a DBMS.
Application Software: Common features of software, Word processing, Spread sheet, software for Cyber
space, Internet programming, HTML, XML, & Active X.

UNIT - V

Information Systems: Organization:- Departments, Tasks, I'v1anagcment Levels, Management Information
systems, Six phases of system analysis and design.
Software Development: Programming as a five step procedures.
Security Issues: Threats to computers & Communication systems, Safeguarding computers, and
communications.

Suggesied Reading:
1) Williams B.K. Sawyer et.al., "Using. information Technology", Sixth Edition, Tata McGraw Hill, 2006.

References:
1) Aksoy & DeNardis " Introduction to fr?tormatiol1 technology", Cengage Learning, 2006.
2) Dennis P. Curtin & Kim Folley, et.a!., n!l?!i>rll1utiol1 Technolop,y. The breaking Wave", Tata McGraw
Hill, 1998.
3) ITL Edn Solutions Ltd. "Introduction to b!formaiiol1 Technology", Pearson Education,2005.


CM 605 MODERN ECONOMIC ANALYSIS

Sessional: 30 Marks

UNIT -I

The nature and scope of Managerial Economics, Fundamental concepts 0f managerial Economics.

UNIT -II

Demand Analysis, concepts of demand, demand elasticity’s.

UNIT -III

Production and cost analysis and principles: Production function, single output isoquantum, average cost
curve -Laws of returns -Laws of supply, price determination under different competitive situation.

UNIT -IV

National income: Concepts, measurement and determinants.
Planning: The machinery for planning in India, Salient features of India's Five, Year plans.

UNIT-V

Indian Financial Systems, Functions and role of Reserve Bank of India. Conventional Banks and Industrial
Finance. Term "lending Financial Institutions -role and functions .
. .

Suggested reading:

1) Dhiraj Bhatacharya & Pranab Chakraborti, "Fundamentals of Business Economics", A. H.
Wheeler & Co. (P) Ltd., 1986.
2) Barry Keating & J. Holton Wilson, "Mangeral Economics", Biztantra, Second edition,
2003.
3) Dominick Salvatore, "Manageral Economics", Thomson, Fourth Edition, 2001.



CS 631 PROGRAMM1NG LAB-1 (C & C++ PROGRAMMING)

Sessional: 25 Marks

C –Programs:

1. Program to calculate simple formulae like area of Circle, Rectangle etc,
2. Program to find Maximum, Minimum and Sum of given set of numbers.
3. Program to find whether a number is Prime or not.
4. Program to find Sinc(x) and Cosine(x,} using series expansion
5. Program to demonstrate Cal!-by-Reference parameter passing mechanism.
6. Program to implement Linear and Binary Search mechanisms.
7. Program to implement Selection and Bubble sort.
8. Program to implement Matrix multiplication using pointers.
9. Program to find the number of letters, words and sentences in a given string.
10. Program to do String manipulation without using in-built library functions.
11. Program to generate address labels using structures.
12. Program to demonstrate Sequential file Access.
13. Program to demonstrate Random File Access.

C++ Programs

1. Recursive functions (Greatest common divisor, Tower of Hanoi, Fibonacci etc).
2. Classes for Bank Account, Student Information, Library Catalogue, Employee
3. Creation of Complex, Vector classes using operator overloading.
4. Creation of Inheritance hierarchy (bank account, person)
5. Template functions for Min ( ) and Max ( ) for finding minimum and maximum in a List
6. Program on Class Templates
7. Programs demonstrating virtual, pure virtual functions using abstract base class
"Shape".
8. Programs to demonstrate multiple inheritances and exception handling.
9. Programs demonstrating Stream and File I/O using student and employee classes.



CS 632 PROGRAMMING LAB-II

(EIT Lab)

Sessional: 25 Marks

At the end or the course, students should be able to:
1.Identify and describe the relationships and role of the components of the "Logical'
diagram of the computer. (e.g. processor, RAM, ROM, BIOS, input, output, storage.)
2. Relate the "logical" diagram of a computer system to the "physical" system by
identifying physical components of a computer and describing their purpose. (e.g. the
processor, memory chips, motherboard, disk drives, and controller cards such as AGP
board, network cards, sound card, as well as parallel and serial ports etc)”
3. Assemble the computer which they will use and load the OS with partitions for
Windows and Linux, configure for network connection
4. Troubleshoot his/her PC from time to time

5. Install/Un installs SW/HW on his/her PC from time to time

6. Identify and distinguish between various types of application software. by describing
and using them. (e.g. word processor, spreadsheet, database, browser, mailers etc.)
7. MS Word: Create documents with standard formatting commands, single/multi
column, insert pictures/objects, drawings, hyperlinks, header/footer, and tables. No
macros.

8. MS Power Point: Create presentations with preset animations, using different layouts,
backgrounds, slide master, insert pictures/objects, drawings, hyperlinks, header/footer,
tables

9. MS Excel: Creating worksheets with various kinds of data, making charts, conditional
formatting, awareness of the various functions- statistical, date/time, math/trig etc,
ability to explore (help) and use these functions if need be, demonstration through some
common functions like sum, average, standard deviation, logical and information.

10. HTML: Should be able to create their web-page (title, text, frames, hyperlinks to
some sites, pictures, lists, tables, fonts, forms and color) without using any web
authoring tools.



11. Distinguish between various commercially available systems by relating the cost to features
available on each system.

Alias Cp Fip Man Talk
Banner Date Gv Mkdir telnet
Bc Diff Gunzip More Unzip
Gh Dir Head Mv Vi
Cal Display History Passwd Vim
Cat Df Id Pine Vimtutor
Cc Du Indent Ps Wall
Ed Echo Dill Pwd Wait
Chgrp Exit Last Reboot Whereis
Chmod Fg Login Rm Who
Clear File Logname Rmdir Whoami
Chfn Finger In Shutdown Wrie
Chown Find Logout Tail Zip
Cmp Gzip Is Tar Ands
mail

12. MS-Access: Create database for student information, library information and
inventory. Generation of queries, reports and transaction processing.



TELANGANA UNIVERSITY


MCA I YEAR
SEMESTER- II
w.e.f: 2011-2012

Scheme of
Instruction
Syllabus
Sl. Periods per
No Week Duration
No.
in Hrs.

THEORY

Accounting &
1 CS 651 Financial 4 - 3 70 30
Management
Principles of
Object
2 CS 652 4 - 3 70 30
Oriented
Programming
Management
3 CS 653 Information 4 - 3 70 30
Systems

4 CS 654 Data Structures 4 - 3 70 30

Computer
5 CS 655 4 - 3 70 30
Architecture

PRACTICAL

Programming
1 CS 681 Lab – III - 6 3 50 25
(OOP Lab)
Programming
2 CS 682 Lab – IV - 6 3 50 25
(DS Lab)

Total 20 12 450 200



CS 651 ACCOUNTINC AND FINANCIAL MANAGEMENT

Sessional: 30 Marks

UNIT -I
An overview of Accounting cycle -Basic. concepts and conventions -Books of Account -
Terminal statement.
UNIT- II
Financial statement analysis and interpretation -Ratio analysis.
UNIT -III
Working capital -Sources and uses –Funds flow and cash flow analysis -Management of
inventory_
UNIT- IV
Capital Budgeting -Techniques for evaluation -Cost of capital -Computation of specific costs,
and weighted average cost of capital
UNIT-V
Analysis of costs and their behavior -Cost volume -Profit analysis Variable costing and
absorption costing.
Budgets- Flexible Budgeting -Long and Short term forecasting.

Suggested Reading:
!) James. C Van Horne, "Fundamentals of Financial Management", Pearson edition,
Eleventh edition, 2001.
2) Khan MY, lain PK, "Financial Management", Tata McGraw Hill, Second Edition, 1993
3) Maheswari SN, "Management Accounting and Financial Control", Sultan Chand & Co.
4) Gupta G, Radhaswamy M, "Advanced Accountancy", Sultan Chand,& Sons.



CS 652 PRINCIPLES OF OBJECT ORIENTED PROGRAMMING

Sessional: 30 Marks

UNIT-I

Object Oriented System Development: Understanding Object Oriented Development, Understanding Object
Oriented Concepts, Benefits of Object Oriented Development.
Java Programming Fundamentals: Introduction, Overview of Java, Data types, Variables and Arrays,
Operators, Control Statements, Classes, Methods, Inheritance, Packages and Interfaces.

UNIT-II

Exceptional Handling, Multithreaded Programming, 1 to basics, Reading console input and output, Reading and
Writing Files, Print Writer Class, String Handling.

UNIT -III

Exploring Java language , Collections Overview, Collections interfaces, Collection Classes, Iterators, Random
Access Interface, Maps, Comparators, Arrays, Legacy classes and Interfaces, String Tokenizer, Bit Set, Date,
Calendar observable, Timer.

UNIT IV

Java I/O classes and Interfaces, Files, Stream and Byte Classes, Character Streams, Serialization.

UNIT -v

GUI and Event Driven Programming: Applet Class, Event Handling, Delegation event model event classes,
event listener Interfaces.
Customizing Frame Windows, GUI Programming Basics, Text Related CUI Components, Layout Managers,
Effective use of Nested panels, Other GUI components, Menus and Handling Mouse Events.

Suggested reading:

1. Patrick Naughton "JAVA 2, The Complete Reference" Tata McGraw Hi1l 2005.
2. Richard A. Johnson, "Java Programming and Object-Oriented Application Development"
Cengage Learning, India edition 2009

References:

1. John Dean and Raymond Dean "Introduction to Programming with JAVA Aproblem solving
approach", McGraw Hill 2008.
2. Joc Wigglesworth and Paula McMillan, Java Programming: Advanced Topics" Cengage
Learning, 3rd Edition 2009
3.



CS.653 MANAGEMENT INFORMATION SYSTEMS
Sessional: 30 Marks

UNIT-l

An Introduction to concepts of System and Organizations. Strategic uses of Information Technology,
Business Process in Engineering and Information Technology.

UNIT-II

..
Applications of Operational Information Systems to Business, Tactical and Strategic Information
System to Business.

UNIT -III

Information Systems Planning, approach to System Building Alternative Application Development.

UNIT-IV

Managing Knowledge, Knowledge Management in the Organization, Enhancing Management
Decision-Making, DSS, GDSS, and ESS.

UNIT- V

Management of Information Systems. Information System security and control, Ethical issue,
managing firm infrastructure and Enterprise system.

Suggested Reading:

1. Robert Schultheis, Mary Summer, "Management Information Systems The Manager's
view", Tata McGraw Hill, fourth edition, 2006.
2. Kenneth C. Loudon, Jane P laudon, "Management Information System", Prentice Hall, 2008

Reference:

1. Ralph Stair, George Reynolds" Principles information Systems", Cengage Learning 2008.

2. James A, O'Brien, " Management Information Systems ", Tata McGraw Hill,
Sixth edition, 2004.



CS 654 DATA STRUCTURES

Sessional: 30 Marks

UNIT – I

Linear Lists: Array based representation Linked Lists: Properties, Operations, Ordered Linked
Lists, Doubly Linked Lists, Circular Linked Lists.
UNIT - II

Matrices: Special and Sparse matrices.
Stacks: Operations, array and linked represent~tiol1 of stacks, applications of stacks
Queues: Operations, array and linked representation of queues, applications of queues.

UNIT-III

Trees: Definitions and properties. Binary trees: Binary tree traversal (recursive and non recursive).
Binary Search Trees: Operations and Analysis, A VL Trees: Operations on
AVL trees. B- Trees, Operations on B-Trees '

UNIT -IV

Searching Algorithms: Sequential Search and Binary Search. Complexity analysis of searching
algorithms. Hashing: Collision resolution, Open addressing, Quadratic probing, Chaining. Hashing
Analysis. Sorting Algorithms: Selection Sort, Quick Sort, Merge Sort, Heap Sort, Shell Sort.
Cornplexity analysis of sorting algorithms.

UNIT -v

Graphs: Definitions, notations and representations. Operations on Graphs, Graph
Traversals, Applications of Graphs: Shortest Path and Minimal Spanning Tree Algorithms.
Suggested Reading:

1. S Sahani, "Data Structures, Algorithms and Applications in C++" Second Edition,
Universities Press, 2005.

References:

2. D S Malik, "Data Structures using C++", Cengage Learning, 2003
3. Carmen Leiserson & Rivest, "Introduction to Algorithms", Prentice Hall India, 1996.
4. Mark Allen Weiss, "Data structures and Algorithm Analysis in C++", Third Edition, Pearson
Education,2007



CS 655 COMPUTER ORGANIZATION

Sessional: 30 Marks
UNIT -I

Digital Logic Circuits: Digital Computers, Logic Gates, Boolean Algebra, Map
Simplification, Combinational Circuits, Flip Flops, Sequential Circuits.
Digital Components: Integrated Circuits, Decoder, Multiplexers, 'Registers, Shift Registers,
Binary counter, Memory unit.
Data Representation: Data types, Complements, Fixed and Floating Point
Representation, Other binary codes and error Detection codes.

UNIT -II

Register Transfer and Micro operations:. Register Transfer language, Register transfer,
Bus and Memory Transfer, Arithmetic Micro operations, Logic Micro operations, Shift
Micro operations and Arithmetic logic shift unit.
Basic Computer Organization and Design: Instruction codes, Computer Registers, Computer
Instructions, Timing and Control, Instruction Cycles, Memory Reference Instructions, Input,
Output and Interrupts, Design of Accumulator logic.

UNIT -III

Programming the Basic Computer: Introduction, Machine Language, Assembly Language, The
Assembler, Programming Arithmetic and Logic Operations, Subroutines, and I/O, Programming.
Micro programmed Control: Control Memory, Address Sequencing, Micro program Example,
Design of Control Unit.

UNIT -IV
Central Processing Unit: Introduction, General Register Organization, Stack Organization,
Instruction Formats, Addressing Modes, Data Transfer and Manipulation, Program Control, RISC.
Parallel Processing: Pipelining, Arithmetic Pipeline, Instruction Pipeline, RISC Pipeline. Computer
Arithmetic: Addition and Subtraction, Multiplication algorithms, Division Algorithms, Floating point
arithmetic operations, decimal arithmetic unit, and decimal arithmetic operations.

UNIT -V

Input -Output organization: Peripheral Devices, I/O Output interlace, Asynchronous data transfer,
Modes 0ftransfer, Priority Interrupt, OM A, Input output Processor, Serial Communication.
Memory Organization: Memory Hierarchy, Main Memory, Cache Memory.



Suggestcd Reading:
1. M. Morris Mano, "Computer System Architecture", Pearson Education
Asia, Third Edition, 1993.
References:

2. Miles Murdocca, Vincent Heuring, "Computer Architecture and Organization", John
Wiley & Sons 2007.

3. Sivarama P Dandamudi “Fundamentals of Computer Organization and Design”,
Wiley Dream Tech publishers, 2003.

4. William stallings, “Computer Organization & Architecture”, Pearson Education, Sixth
Edition 2003,
5. G.V.Anjaneyulu “Computer Organization”.



CS 681 PROGRAMMING LAB - III
(OOP Lab)

Sessional: 25 Marks

I. A program to illustrate the concept of class with constructors, methods and overloading.
2. A program to illustrate the concept. of inheritance and dynamic polymorphism
3. A program to illustrate the usage of abstract class. ~
4. A program to illustrate multithreading.
5. A program to illustrate thread synchronization.
6. A program to illustrate Exception handling.
7. A program to illustrate user-defined Exceptions
8. A program to demonstrate use of User-defined Packages.
9. A program using String Tokenizer .
10. A program using Linked list class
11. A program using Tree Set class
12. A program using Hash Set and Iterator classes.
13. A program using Map classes.
14. A program using Enumeration and Comparator interfaces.
15. A program using File and File name Filter
16. A program to illustrate the Usage of Byte and Character I/O streams.
17. A program to illustrate the Usage of Serialization
18. Program using Date class
19. An application involving GUI with different controls, menus and event handling.
20. A program to implement an applet.



CS 682 PROGRAMMING LAB - IV

(Data Structures Lab)

Sessional: 25 Marks

1. Implementation of ADT Stacks.(Arrays and Linked representations).
2. Infix to Postfix conversion (unparenthesized)
3. Infix to Postfix conversion (Parenthesized)
4. Evaluation or postfix expression.
5. Implementing Parenthesis M8lching Application using Stack
6. Implementation of ADT Queues. (Linear, Circular and DeQueue)
Application of Queues (Super-market, Ticket reservation etc)
7. Implementation of ADT Linked Lists (Singly, doubly and Circular)
Implementation of Linear, binary search.
8. Implementation of Hashing
9. Implementation of Collision resolution techniques.
10. Implementation of Insertion sort.
11. Implementation of Selection sort.
12. Implementation of Shell sort.
13. Implementation of Quick sort.
14. Implementation of Merge sort.
15. Implementation of basic operations on Binary trees.
16. Implementation of traversals on binary trees.
17. Implementation of Binary Search Trees
18. Implementation of Heap sort.
19. Implementation of operations of A VL Trees.
20. Implementation of Red-Black Trees.
21. Implementation of Graph Search Methods.
22. Program to find a Minimal Spanning Tree.



MCA II YEAR
w.e.f: 2011-2012
SEMESTER – I
Scheme of
Instruction
Syllab
Sl. us Periods per
No Week Duration
No. in Hrs.

THEORY

CS SOFTWARE
1 4 - 3 70 30
701 ENGINEERING
DATABASE
CS
2 MANAGEMENT 4 - 3 70 30
702
SYSTEM
DESIGN &
CS
3 ANALYSIS OF 4 - 3 70 30
703
ALGORITHMS
CS OPERATING
4 4 - 3 70 30
704 SYSTEMS
CS OPERATIONS
5 4 - 3 70 30
705 RESEARCH

PRACTICALS

CS Programming Lab-
1 - 6 3 50 25
731 V (DBMS Lab)
CS Programming Lab-
2 - 6 3 50 25
732 VI (OS LAB)

Total 20 12 450 200



MCA II YEAR
w.e.f: 2011-2012
SEMESTER – II
Scheme of
Instruction
Sl. Syllabus Periods
SUBJECT Maximum Marks
No Ref. No. per Week Duration
in Hrs. Univ.
Sessionals
Exam

THEORY

Data Warehousing and Data
1 CS 751 4 - 3 70 30
Mining

2 CS 752 Computer Networks 4 - 3 70 30

3 CS 753 Unix Programming 4 - 3 70 30

4 CS 754 Web Programming 4 - 3 70 30

ELECTIVE –I (Any One)

CS 755 Artificial Intelligence
5 4 - 3 70 30
CS 756 Distributed Systems

CS 757 Information Retrieval Systems

PRACTICALS

Programming Lab – VII
1 CS 731 - 6 3 50 25
Unix Programming Lab
Programming Lab – VIII
2 CS 732 - 6 3 50 25
Web Programming Lab

Total 20 12 450 200



SCEME OF INSTRUCTIION & EXAMINATION

MCA III YEAR
w.e.f: 2011-2012
SEMESTER – I

Scheme of
Instruction
Sl. Syllabus Periods
SUBJECT Maximum Marks
No Ref. No. per Week Duration
in Hrs.
Univ.
Sessionals
Exam

THEORY

1 CS 801 SOFTWARE TESTING 4 - 3 70 30

2 CS 802 MIDDLE WARE TECHNOLOGIES 4 - 3 70 30

3 CS 803 OBJECT ORIENTED SYSTEM 4 - 3 70 30
DEVELOPMENT

ELECTIVE – II (Any One)

CS 804 ELECTRONIC COMMERCE

CS 805 HUMAN COMPUTER
INTERACTION

CS 806 SOFTWARE REUSE
4 4 - 3 70 30
TECHNIQUES

CS 807 SOFT COMPUTING

CS 808 XML AND WEB SERVICES



ELECTIVE – III (Any One)

CS 809 MOBILE COMPUTING

CS 810 INFORMATION SECURITY

5 CS 811 SYSTEM ADMINISTRATION 4 - 3 70 30

CS 812 RICH INTERNET APPLICATIONS

CS 813 SOFTWARE PROJECT
MANAGEMENT

PRACTICALS

Programming Lab – IX
1 CS 831 - 6 3 50 25
(OOSD LAB)

Programming Lab - X
2 CS 832 - 6 3 50 25
(MIDDLEWARE TECHNOLOGIES
LAB)

Total 20 12 450 200



CS 801
SOFTWARE TESTING

Instruction 4 Periods per week
Duration of University Examination 3 Hours
University Examination 70 Marks
Sessional 30 Marks

Unit-I
A Mathematical Context: A Perspective on Testing, Examples
Functional Testing: Boundary Value Testing, Equivalence Class Testing, Decision Table-
Based Testing, Retrospective on Functional Testing.

Unit-II
Structural Testing: Path Testing, Dataflow Testing, Retrospective on Structural Testing.

Unit-III
Integration and System Testing: Levels of Testing, Integration Testing, System Testing,
Interaction Testing.

Unit-IV
Object-Oriented Testing: Issues in Object-Oriented Testing, Class Testing, Object-Oriented
Integration Testing, GUI Testing, Object-Oriented System Testing.
Unit-V
Millennium Testing: Exploratory Testing, Model-Based Testing, Test-Driven Development,
All Pairs Testing, Software Testing Excellence.

Suggested Reading:

1. Paul C. Jorgensen, Software Testing: A Craftsman’s Approach, 3rd Edition, CRC Press,
2007.
2. Boris Beizer, Software Testing Techniques, Dreamtech, 2009.



C S 802
M ID D L E W A R E T E C H N O L O G IE S

In s tru c tio n 4 P e rio d s p e r w e e k
D u ra tio n o f U n iv e rs ity E x a m in a tio n 3 H o u rs
U n iv e rs ity E x a m in a tio n 7 0 M a rk s
S e s s io n a l 3 0 M a rk s

U n it – I
C lie n t/S e rv e r C o n c e p ts :C lie n t-S e rv e r,F ile S e rv e r, D a ta b a s e s e rv e r, G ro u p s e rv e r, O b je c t S e rv e r,
W eb s e rv e r, M id d le w a re – G e n e ra l m id d le w a re – S e rv ic e s p e c ific m id d le w a re . C lie n t/S e rv e r
B u ild in g b lo c k s – R PC – M e s s a g in g – P e e r- to - P e e r. W e b S e rv ic e s – SO A , SO A P, W SD L,
R E S T S e rv ic e s .

U n it – I I
E JB A rc h ite c tu re : E J B – E J B A rc h ite c tu re – O v e rv ie w o f E J B s o ftw a re a rc h ite c tu re – V ie w of
E J B – C o n v e rs io n – B u ild in g a n d D e p lo y in g E J B s – R o le in E J B .

U n it – I I I
E JB A p p lic a tio n s : E J B S e s s io n B eans – E JB e n tity beans – E JB C lie n ts – E JB D e p lo y m e n t
B u ild in g a n a p p lic a tio n w ith E J B .

U n it – I V

C O R B A : E J B – D is tr ib u te d S y s te m s – P u r p o s e – E x p lo rin g C O R B A a lte rn a tiv e s – A rc h ite c tu re
o v e rv ie w – C O R B A a n d n e tw o rk in g m o d e l – C O R B A o b je c t m o d e l – ID L – O R B – B u ild in g a n
a p p lic a tio n w ith C O R B A .

U n it – V

C O M : C O M - D a ta ty p e s – In te rfa c e s – P ro x y and S tu b – M a rs h a llin g – Im p le m e n tin g
S e rv e r/C lie n t – In te rfa c e P o in te rs – O b je c t C re a tio n , In v o c a tio n , D e s tru c tio n – C o m p a ris o n
C O M and C O R B A – In tro d u c tio n to .N E T – O v e rv ie w o f .N E T a rc h ite c tu re – M a rs h a llin g –
R e m o tin g .

S u g g e s te d R e a d in g :

1. R o b e rt O rfa li, D a n H a rk e y and J e ri E d w a rd s , T h e E s s e n tia l C lie n t / S e rv e r S u rv iv a l
G u id e , G a lg o tia P u b lic a tio n s P v t.L td , 2 0 0 2 (U n it 1 ).
2. T o m V a le s k y , E n te rp ris e J a v a B e a n s , P e a rs o n E d u c a tio n , 2 0 0 2 (U n it 2 & 3 ).
3. J a s o n P r itc h a r d , C O M a n d C O R B A s id e b y s id e , A d d is o n W e s le y , 2 0 0 0 ( U n it 4 & 5 ) .
nd
4. J e s s e L ib e rty , P ro g ra m m in g C # , 2 E d itio n , O ’ R e illy P re s s , 2 0 0 2 (U n it5 ).
5. A rn o P u d e r, K a y R o m e r a n d F ra n k P ilh o fe r, D is trib u te d S y s te m s A rc h ite c tu re , M o rg a n
K a u fm a n , 2 0 0 6 .
6. M o w b ra y , In s id e C O R B A , P e a rs o n E d u c a tio n , 2 0 0 2 .
7. J e re m y R o s e n b e rg e r, T e a c h y o u rs e lf C O R B A in 1 4 d a y s , T e c M e d ia , 2 0 0 0 .



C S 803
O B J E C T O R IE N T E D S Y S T E M D E V E L O PM E N T


U n it – I
U M L In tro d u c tio n : W h y w e m o d e l, In tro d u c in g th e U M L , H e llo W o rld . B a s ic S tru c tu ra l
M o d e lin g : C la s s e s , R e la tio n s h ip s , C o m m o n M e c h a n is m s , D ia g r a m s , C la s s D ia g r a m s .
A d v a n c e d S tru c tu ra l M o d e lin g : A d v a n c e d C la s s e s , A d v a n c e d R e la tio n s h ip s , R e la tio n s h ip s ,
I n te r f a c e s , T y p e s a n d R o le s , P a c k a g e s , I n s ta n c e s , O b je c t D ia g r a m s , C o m p o n e n ts .

U n it – I I
B a s ic B e h a v io ra l M o d e lin g : In te ra c tio n s , U s e C a s e s , U s e C a s e D ia g ra m s , In te ra c tio n D ia g ra m s ,
A c tiv ity D ia g ra m s .
A dvanced B e h a v io r a l M o d e lin g : E v e n ts a n d s ig n a ls , S ta te M a c h in e s , P r o c e s s e s a n d T h re a d s ,
T im e s a n d s p a c e , S ta te C h a rt D ia g ra m s .

U N IT – III
A rc h ite c tu ra l M o d e lin g : A rtifa c ts , D e p lo y m e n t C o lla b o ra tio n s , P a tte rn s and F ra m e w o rk s ,
A r tif a c t d ia g r a m s , D e p lo y m e n t d ia g r a m s , S y s te m s a n d m o d e ls .

U n it – I V
U n ifie d S o ftw a re D e v e lo p m e n t P ro c e s s : T h e U n ifie d P ro c e s s ,T h e F o u r P s , A U s e - C a s e - D riv e n
P ro c e s s , A n A rc h ite c tu re , A n A rc h ite c tu re – C e n tric P ro c e s s , A n Ite ra tiv e a n d in c re m e n ta l
P ro c e s s .

U n it – V
C o re W o rk flo w s : R e q u ire m e n ts C a p tu re , C a p tu rin g R e q u ire m e n ts as U se C a s e s , A n a ly s is ,
D e s ig n , Im p le m e n ta tio n , T e s t.

1. G ra d y B ooch, Jam es R u m b a u g h , Iv o r Jacb so n , T h e U n ifie d M o d e lin g Language – U ser
nd
G u id e , (C o v e rin g U M L 2 .0 ) 2 E d itio n , P e a rs o n E d u c a tio n , I n d ia , 2 0 0 7 .
2. Iv o r J a c b s o n , G ra d y B o o c h , J a m e s R u m b a u g h , T h e U n ifie d S o ftw a re D e v e lo p m e n t P ro c e s s ,
P e a rs o n E d u c a tio n , In d ia , 2 0 0 8 .



C S 804
E L E C T R O N I C C O M M E R C E (E le c tiv e -I I )


U N IT – I
E le c tro n ic C o m m e rc e – E le c tro n ic C o m m e rc e F ra m e W o rk , E le c tro n ic C o m m e rc e a n d M e d ia
C o n v e rg e n c e , A n a to m y of E - C o m m e rc e a p p e lla tio n s , E le c tro n ic C o m m e rc e C onsum er
a p p lic a tio n s , E le c tro n ic C o m m e rc e O rg a n iz a tio n A p p lic a tio n s .
C onsum er O rie n te d E le c tro n ic C o m m e rc e – C o n su m e r- O rie n te d A p p lic a tio n s , M e rc a n tile
P r o c e s s M o d e ls , M e r c a n tile M o d e ls f r o m th e C o n s u m e rs ’ P e rs p e c tiv e ., M e rc a n tile M o d e ls fro m
th e M e rc h a n ts ’s P e rs p e c tiv e .

U N IT – II
E le c tro n ic P a y m e n t s y s te m s – T y p e s o f E le c tro n ic P a y m e n t S y s te m s , D ig ita l T o k e n – B ased
E le c tro n ic P a y m e n t S y s te m s , S m a rt C a rd s E le c tro n ic P a y m e n t S y s te m s , C re d it C a rd - B a s e d
E le c tro n ic Paym ent S y s te m s , R is k and E le c tro n ic Paym ent s y s te m s , D e s ig n in g E le c tro n ic
P a y m e n t S y s te m s .

U N IT – III
In te r O rg a n iz a tio n a l C o m m e rc e A nd E D I - E le c tro n ic D a ta In te rc h a n g e , E D I a p p lic a tio n s in
b u s in e s s , E D I: L e g a l, S e c u rity , a n d P riv a c y is s u e s , E D I a n d E le c tro n ic C o m m e rc e
ED I Im p le m e n ta tio n , M IM E , and V a lu e added net w o rk s .-S ta n d a rd iz a tio n and E D I, ED I
S o ftw a re Im p le m e n ta tio n , ED I E n v e lo p e fo r M essage T ra n s p o rt, V a lu e -A d d e d N e tw o rk s ,
In te rn e t-B a s e d E D I.
In tra o rg a n iz a tio n a l E le c tro n ic C o m m e rc e – In te rn a l In fo rm a tio n S y s te m s , W o rk F lo w
A u to m a tio n and C o o rd in a tio n , C u s to m iz a tio n and in te r n a l C o m m e rc e , S u p p ly c h a in
M a n a g e m e n t.

U N IT – IV
C o rp o ra te D ig ita l L ib ra ry – D im e n s io n s o f I n te r n a l e le c tr o n ic C o m m e rc e S y s te m s , T y p e s o f
D ig ita l D o c u m e n ts , Is s u e s b e h in d D o c u m e n t In fra s tru c tu re , C o rp o ra te D a ta W a re h o u s e
A d v e rtis in g and M a rk e tin g on th e In te rn e t – In fo rm a tio n based m a rk e tin g , a d v e rtis in g on
In te rn e t, o n -lin e m a rk e tin g p ro c e s s , m a rk e t re s e a rc h .

U N IT –V
C onsum er S e a rc h and R e s o u rc e D is c o v e r y – S e a rc h and R e s o u rc e D is c o v e r y p a ra d ig m s ,
I n f o r m a tio n s e a r c h a n d R e tr ie v a l, E le c tr o n ic C o m m e r c e c a ta lo g u e s o r D ir e c to r ie s , in f o r m a tio n
filte rin g , C o n s u m e r -D a ta In te rfa c e 3 :E m e rg in g T o o ls .
M u ltim e d ia and D ig ita l V id e o – key m u ltim e d ia c o n c e p ts , D ig ita l V id e o and E le c tro n ic
C o m m e rc e , D e s k to p v id e o p ro c e s s in g , D e s k to p v id e o c o n fe re n c in g .



C S 805
H U M A N C O M P U T E R I N T E R A C T I O N (E le c tiv e -I I )


U N IT - I
Im p o rta n c e o f th e u s e r in te rfa c e . C h a ra c te ris tic s o f g ra p h ic a l a n d w e b u s e r in te rfa c e s ,U s e r
In te rfa c e D e s ig n P ro c e s s : K n o w in g th e c lie n t, U n d e rs ta n d in g b u s in e s s fu n c tio n , P rin c ip le s o f
g o o d s c re e n d e s ig n .

U N I T -I I
S y s te m M e n u s a n d N a v ig a tio n S c h e m e s , K in d s o f w in d o w s , D e v ic e b a s e d c o n tro ls , S c re e n
b a s e d c o n tro ls , T e s t a n d M e s s a g e s .

U N IT - III
F e e d b a c k , G u id a n c e a n d a s s is ta n c e . In te rn a tio n a liz a tio n a n d a c c e s s ib ility , g ra p h ic s , ic o n s a n d
im a g e s , c o lo u rs , L a y o u t w in d o w s a n d p a g e s .

U N IT - IV
I n te r a c tio n D e s ig n : I n tr o d u c tio n , G o a ls , U s a b ility , C o n c e p tu a liz a tio n in te r a c tio n : P r o b le m
s p a c e , C o n c e p tu a l m o d e ls , I n te r f a c e m e ta p h o r s , I n te r a c tio n p a r a d ig m s , C o g n itio n : C o n c e p tu a l
fra m e w o rk s fo r c o g n itio n . C o lla b o ra tio n a n d C o m m u n ic a tio n : S o c ia l m e c h a n is m , C o n c e p tu a l
fra m e w o rk .

U N IT - V
A ffe c tiv e a s p e c ts , E x p re s s iv e in te rfa c e , U s e r fru s tra tio n , A g e n ts , P ro c e s s o f in te ra c tio n
d e s ig n , A c tiv iti e s c h a r a c te r is tic s , P r a c tic a l is s u e s , L if e c y c le m o d e ls , D e s ig n : P r o to ty p in g a n d
c o n s tru c tio n , P ro to ty p in g , c o n c e p tu a l d e s ig n , P h y s ic a l d e s ig n E v a lu a tio n : In tro d u c tio n ,
F ra m e w o rk , T e s tin g a n d m o d e llin g u s e rs : K in d s o f te s ts ,D o in g u s e r te s tin g , E x p e rim e n ts ,
P re d ic tiv e m o d e ls .

1. W ilb e rt O .G a litz , T h e E s s e n tia l G u id e to U s e r In te rfa c e D e s ig n , W ile y D re a m te c h 2 0 0 2 .
2. S h a rp , R o g e rs , P re e c e , In te ra c tio n D e s ig n , J o h n W ile y , 2 0 0 7 .
3. A n d re w S e a rs , J u lie A J a c k o , H u m a n , C o m p u te r In te ra c tio n F u n d a m e n ta l s , C R C P re s s ,
2009.
4. D a n R O s le n , H u m a n , C o m p u te r In te ra c tio n , C e n g a g e L e a rn in g , 2 0 1 0 .



C S 806

S O F T W A R E R E U S E T E C H N I Q U E S (E le c tiv e – I I )


U N I T -I
S o ftw a re re u s e su ccess fa c to rs , R e u s e d riv e n s o ftw a re e n g in e e rin g b u s in e s s , O b je c t o ri e n te d
s o ftw a re e n g in e e rin g , a p p lic a tio n s a n d com p onent sub s y s te m s , u s e case c o m p o n e n ts , o b je c t
c o m p o n e n ts .

U N I T -I I
D e s ig n P a tte rn s – In tro d u c tio n , C re a tio n a l p a tte rn s , fa c to ry , fa c to ry m e th o d , a b s tra c t fa c to ry ,
s in g le to n , b u ild e r p ro to ty p e .

U N I T -I II
S tru c tu ra l P a tte rn s - A d a p te rs , b rid g e , c o m p o s ite , d e c o ra to r, fa ç a d e , fly w e ig h t, p ro x y .
B e h a v io ra l P a tte rn s – C h a in o f re s p o n s ib ility , c o m m a n d , in te rp re te r.

U N I T -I V
B e h a v io ra l P a tte rn s – Ite ra to r, m e d ia to r, m e m e n to , o b s e rv e r, s ta z te , s tra te g y , te m p la te , v is ito r,
o th e r, d e s ig n p a tte rn s - W h o le p a rt, m a s te r - s la v e ,v ie w h a n d le r, fo rw a rd e r - re c e iv e r, c lie n t –
d is p a tc h e r- s e rv e r, p u b lis h e r – s u b s c rib e r.

U N I T -V
A rc h ite c tu ra l p a tte rn s – L a y e rs ,p ip e s a n d filte rs , b la c k b o a rd , b ro k e r ,m o d e l - v ie w c o n tro lle r
,p r e s e n ta tio n - a b s tr a c tio n – c o n t r o l, m ic r o k e r n e l, r e f l e c tio n .

1. Iv a r ja c a b s o n , M a rtin G ris s , P a tric k H ohson – S o ftw a re R e u s e . A rc h ite c tu re , P ro c e s s a n d
O rg a n iz a tio n fo r B u s s in e s s S u c c e s s , A C M P re s s , 1 9 9 7 .
2. E r ic h G a m m a , R ic h a r d H e lm , R a lp h J o h n s o n , J o h n V lis s id e s – D e s ig n P a tte r n s - A d d is o n ,
1 9 9 5 , P e a rs o n E d u c a tio n .
3. F ra n k B u s c h m a n n e tc . – P a tte rn O rie n te d S o ftw a re A rc h ite c tu re – V o lu m e 1 , W ile y 1 9 9 6 .
4. Jam es W C o o p e r – J a v a D e s ig n P a tte rn s , a tu to ria l, A d d is o n 2 0 0 0 , P e a rs o n E d u c a tio n .



C S 807

S O F T C O M P U T I N G (E le c tiv e - I I )


U N I T -I
F u n d a m e n ta ls o f N e u ra l N e tw o rk s : B a s ic C o n c e p ts o f N e u ra l N e tw o rk s , H u m a n B ra in , M o d e l o f
an A rtific ia l N e u ro n , N e u ra l N e tw o rk A rc h ite c tu re s , C h a ra c te ris tic s of N e u ra l N e tw o r k s ,
L e a rn in g M e th o d s , T a x o n o m y o f N e u ra l N e tw o rk A rc h ite c tu re s , H is to ry o f N e u ra l N e tw o rk
R e s e a rc h , E a rly N e u ra l N e tw o rk A rc h ite c tu re s , S o m e A p p lic a tio n D o m a in s .
B ack P ro p a g a tio n N e tw o rk s : A rc h ite c tu re of a B ack P ro p a g a tio n N e tw o rk , B a c k P ro p a g a tio n
L e a rn in g , Illu s tra tio n , A p p lic a tio n s .

U N I T -I I
A s s o c ia tiv e M e m o ry : A u to c o rre la to rs , H e te r o c o r r e la to r s , W ang Et A l’s M u ltip le T ra in in g
E n c o d in g S tra te g y , E x p o n e n tia l B A M , A s s o c ia tiv e M e m o ry fo r R e a l-C o d e d P a tte rn P a irs ,
A p p lic a tio n s , R e c e n t T re n d s .
A d a p tiv e R e s o n a n c e T h e o ry : In tro d u c tio n , A R T 1 , A R T 2 , A p p lic a tio n s , S e n s itiv e s o f O rd e rin g
o f D a ta .

U N I T -I II
F u z z y S e t T h e o ry : F u z z y V e rs u s C ris p , C ris p S e ts , F u z z y S e ts , C ris p R e la tio n s , F u z z y R e la tio n s .
Fuzzy S y s te m s : C ris p L o g ic , P re d ic a te L o g ic , Fuzzy L o g ic , Fuzzy R u le B ased S y s te m s ,
D e fu z z ific a tio n M e th o d s , A p p lic a tio n s .

U N I T -I V
F u n d a m e n ta ls o f G e n e tic A lg o rith m s : G e n e tic A lg o rith m s : H is to ry , B a s ic C o n c e p ts , C re a tio n o f
O ffs p rin g s , W o rk in g P rin c ip le , E n c o d in g , F itn e s s F u n c tio n , R e p ro d u c tio n .
G e n e tic M o d e lin g : In h e rita n c e O p e ra to rs , C ro s s O v e r, In v e rs io n , A nd D e le tio n , M u ta tio n
O p e ra to r, B it-W is e O p e ra to rs , B it-W is e O p e ra to rs u s e d in G A , G e n e ra tio n a l C y c le , C o n v e rg e n c e
o f G e n e tic A lg o rith m s , A p p lic a tio n s , M u lti - L e v e l O p tim iz a tio n , R e a l L ife P ro b le m , D iffe re n c e s
a n d S im ila ritie s B e tw e e n G A a n d O th e r T ra d itio n a l M e th o d s , A d v a n c e s in G A .

U N I T -V
In te g ra tio n o f N e u r a l N e t w o r k s , F u z z y L o g i c a n d G e n e t i c A l g o r i t h m s : H y b r i d S y s te m s , N e u r a l
N e t w o r k s , F u z z y L o g ic , a n d G e n e t ic A lg o r i t h m s H y b r i d s , P r e v i e w o f H y b r i d S y s t e m s
G e n e tic A lg o rith m s B a s e d B a c k p ro p a g a tio n N e tw o rk s : G a B a s e d W e ig h t D e te rm in a tio n , A p p lic a tio n s .
F u z z y L o g ic C o n tr o lle d C o n tr o lle d G e n e tic A lg o rith m s : S o ft C o m p u tin g T o o ls , P r o b le m D e s c rip tio n o f
O p tim u m D e s ig n , F u z z y C o n s tr a in ts , I llu s tra tio n s , G A in F u z z y L o g ic C o n tro lle r D e s ig n , F u z z y L o g ic
C o n tro lle r, F L C -G A B a s e d S tr u c tu ra l O p tim iz a tio n , A p p lic a tio n s .

1. S .R a ja s e k a ra n , G .A . V ija y a la k s h m i P a i, N e u ra l N e tw o rk s , fu z z y lo g ic , and g e n e tic
a lg o rith m s - G e n e tic A lg o rith m , P H I L e a rn in g P riv a te L im ite d -2 0 1 0
2. S .N .S iv a n a n d a m , S .N .D e e p a W ile y In d ia , P rin c ip le s of SO FT C O M P U T IN G , Second
E d itio n 2 0 1 1 .



C S 808
X M L A N D W E B S E R V I C E S (E le c tiv e – I I )


U N IT - I :
I n tr o d u c tio n : R o le O f X M L - X M L a n d T h e W e b - X M L L a n g u a g e B a s ic s - S O A P - W e b
S e rv ic e s - R e v o lu tio n s O f X M L - S e rv ic e O rie n te d A rc h ite c tu re (S O A ).

U N IT - II :
X M L T e c h n o lo g y : X M L T e c h n o lo g y , X M L - N a m e S p a c e s - S tru c tu rin g W ith S c h e m a s a n d
D T D - P re s e n ta tio n T e c h n iq u e s - T ra n s fo rm a tio n - X M L In fra s tru c tu re .

U N IT - III:
S O A P : O v e rv ie w O f S O A P - H T T P - X M L -R P C - S O A P : P ro to c o l - M e s s a g e S tru c tu re -
In te rm e d ia rie s - A c to rs - D e s ig n P a tte rn s A n d F a u lts - S O A P W ith A tta c h m e n ts .

U N IT - IV :
W E B S e rv ic e s : O v e rv ie w - A rc h ite c tu re - K e y T e c h n o lo g ie s - U D D I - W S D L - e b X M L - S O A P
A n d W e b S e rv ic e s In E -C o m - O v e rv ie w O f .N E T A n d J 2 E E .

U N IT - V :
X M L S e c u rity : S e c u rity O v e rv ie w - C a n o n ic a liz a tio n - X M L S e c u rity F ra m e w o rk - X M L
E n c ry p tio n - X M L D ig ita l S ig n a tu re - X K M S S tru c tu re - G u id e lin e s F o r S ig n in g X M L
D o c u m e n ts - X M L In P ra c tic e .

1. F ra n k . P . C o y le , X M L , W e b S e rv ic e s A n d T h e D a ta R e v o lu tio n , P e a rs o n E d u c a tio n , 2 0 0 2 .
2. R a m e s h N a g a p p a n , R o b e rt S k o c z y la s a n d R im a P a te l S rig a n e s h , D e v e lo p in g J a v a W e b
S e rv ic e s , W ile y P u b lis h in g In c ., 2 0 0 4 .
3. S a n d e e p C h a tte rje e , J a m e s W e b b e r, D e v e lo p in g E n te rp ris e W e b S e rv ic e s , P e a rs o n
E d u c a tio n , 2 0 0 4 .
4. M c G o v e rn , e t a l., J a v a W e b S e rv ic e s A rc h ite c tu re , M o rg a n K a u fm a n n P u b lis h e rs ,2 0 0 5 .
G u s ta v o A , F a b io C , H a ru m i K , V ija y M . W e b S e rv ic e s : C o n c e p ts , A rc h ite c tu re s a n d
A p p lic a tio n s . S p rin g e r (U n iv e rs itie s P re s s ), 2 0 0 4



C S 809
M O B I L E C O M P U T I N G (E le c tiv e -I I I )


U N IT - I
In tro d u c tio n a n d a p p lic a tio n s o f m o b ile c o m p u tin g , W ire le s s tra n s m is s io n : F re q u e n c ie s , S ig n a ls ,
A n te n n a s , S ig n a l P ro p a g a tio n , M u ltip le x in g , M o d u la tio n , S p re a d s p e c tru m , C e llu la r s y s te m s .
M e d iu m A c c e s s C o n tro l, S D M A , F D M A , T D M A , C D M A , C o m p a ris o n s .

U N IT - II
T e le c o m m u n ic a tio n s y s te m , G S M , D E C T , T D M A , T E T R A , U M T S & IM T -2 0 0 0 .
S a te llite s y s te m s : A p p lic a tio n s , B a s ic s , ro u tin g , lo c a liz a tio n , H a n d o v e r.
B ro a d c a s t s y s te m s : C y c lic re p re s e n ta tio n o f d a ta , D ig ita l a u d io B ro a d c a s ti n g , D ig ita l v id e o
B ro a d c a s tin g , C o n v e rg e n c e o f B ro a d c a s tin g a n d m o b ile c o m m u n ic a tio n .

U N IT - III
W ire le s s L A N : In fra re d V s R a d io T ra n s m is s io n , In fra s tru c tu re a n d A d h o c N e tw o rk s , IE E E
8 0 2 .1 1 , H IP E R L A N , B lu e to o th .

U N IT - IV
M o b ile IP , D y n a m ic H o s t C o n fig u ra tio n P ro to c o l, M o b ile A d h o c N e tw o rk s , M o b ile T ra n s p o rt
L a y e r, T ra d itio n a l T C P , C la s s ic a l T C P im p ro v e m e n ts , T C P o v e r 2 .5 /3 G W ire le s s N e tw o rk s ,
P e rfo rm a n c e E n h a n c in g P ro x ie s .

U N IT - V
O p e ra tin g S y s te m s fo r M o b ile D e v ic e s : F e a tu re s o f W in d o w s C E , P a lm O S , S y m b ia n O s , J a v a
C a r d s u p p o r t f o r M o b ility : F ile s y s te m s , W W W , W ir e le s s A p p lic a t io n P r o to c o l.

nd
1. J o c h e n M .S c h ille r, M o b ile C o m m u n ic a tio n s , 2 e d itio n , P e a rs o n E d u c a tio n , In d ia 2 0 0 3 .
nd
2. H a n s m a n n , M e rk , N ic k lo u s , S to b e r, P rin c ip le s o f M o b ile C o m p u tin g , 2 e d itio n S p rin g e r
In te rn a tio n a l e d itio n , 2 0 0 3 .
nd
3. D h a rm a P . A g a rw a l, Q in g A n Z e n g , In tro d u c tio n to w ire le s s a n d M o b ile s y s te m s , 2 e d itio n
T h o m a s In d ia 2 0 0 7 .
4. F ra n k A d e ls tie n , S a n d e e p K .S .G u p ta , F u n d a m e n ta ls o f M o b ile a n d P e rv a s iv e C o m p u tin g ,
T a ta M c G ra w H ill, 2 0 0 5 .
5. Iv a n S to jm e n o v ic , H a n d b o o k o f W ire le s s a n d M o b ile C o m p u tin g , W ile y In d ia , 2 0 0 6 .



C S 810
I N F O R M A T I O N S E C U R I T Y ( E le c t iv e – I I I )


U N I T -I
In tro d u c tio n :H is to ry , C ritic a l c h a ra c te ris tic s o f in fo rm a tio n , N S T IS S C s e c u rity m o d e l,
C o m p o n e n ts o f a n in f o r m a tio n s y s te m , S e c u r in g th e c o m p o n e n ts , B a la n c in g s e c u r ity a n d
a c c e s s , T h e S D L C , T h e s e c u rity S D L C .
N e e d fo r S e c u rity : B u s in e s s n e e d s , T h re a ts , A tta c k s - s e c u re s o ftw a re d e v e lo p m e n t.

U N I T -I I
L e g a l, E th ic a l a n d p ro fe s s io n a l Is s u e s : L a w a n d e th ic s in in fo rm a tio n s e c u rity , R e le v a n t U .S
la w s - in te rn a tio n a l la w s a n d le g a l b o d ie s , E th ic s a n d in fo rm a tio n s e c u rity .
R is k M a n a g e m e n t: O v e r v ie w , R is k id e n tif ic a tio n , R is k a s s e s s m e n t, R is k c o n tr o l s tr a te g ie s ,
s e le c tin g a r is k c o n tr o l s tr a te g y , Q u a n titiv e v e rs u s q u a lita tiv e r is k c o n tr o l p r a c tic e s , R is k
m a n a g e m e n t d is c u s s io n p o in ts , R e c o m m e n d e d ris k c o n tro l p ra c tic e s .

U N I T -I II
P la n n in g fo r S e c u rity : S e c u rity p o lic y ,S ta n d a rd s a n d p ra c tic e s , S e c u rity b lu e p rin t, S e c u rity
e d u c a tio n , C o n tin u ity s tra te g ie s .
S e c u rity T e c h n o lo g y :F ire w a lls a n d V P N s : P h y s ic a l d e s ig n , F ire w a lls , P ro te c tin g re m o te
c o n n e c tio n s

U N I T -I V
S e c u r ity T e c h n o lo g y : I n tr u s io n d e te c tio n , a c c e s s c o n tr o l a n d o th e r s e c u r ity to lls : I n tr u s io n
d e te c tio n a n d p re v e n tio n s y s te m s , S c a n n in g a n d a n a ly s is to o ls , A c c e s s c o n tro l d e v ic e s .
C ry p to g ra p h y : F o u n d a tio n s o f c ry p to lo g y , C ip h e r m e th o d s , C ry p to g ra p h ic A lg o rith m s ,
C ry p to g ra p h ic to o ls , P ro to c o ls fo r s e c u re c o m m u n ic a tio n s , A tta c k s o n c ry p to s y s te m s .

U N IT - V
Im p le m e n tin g In fo r m a tio n S e c u rity : In fo rm a tio n s e c u rity p ro je c t m a n a g e m e n t, T e c h n ic a l
to p ic s o f im p le m e n ta tio n , N o n te c h n ic a l a s p e c ts o f im p le m e n ta tio n , S e c u r ity c e r tif ic a tio n a n d
a c c re d ita tio n .
S e c u rity a n d P e rs o n n e l: P o s itio n in g a n d s ta ffin g s e c u rity fu n c tio n , E m p lo y m e n t p o lic ie s a n d
p ra c tic e s , In te rn a l c o n tro l s tra te g ie s .In fo rm a tio n s e c u rity m a in te n a n c e : S e c u rity m a n a g e m e n t
m o d e ls , T h e m a in te n a n c e m o d e l, D ig ita l fo re n s ic s

1. M ic h e l E W ith m a n a n d H e rb e rt J M a tto rd , P rin c ip le s a n d P ra c tic e s o f In fo rm a tio n
S e c u rity , C e n g a g e L e a rn in g , 2 0 0 9 .
2. T h o m a s R P e ltie r, J u s tin P e ltie r, J o h n B la c k le y , In fo rm a tio n S e c u rity F u n d a m e n ta ls ,
A u e rb a c h P u b lic a tio n s , 2 0 1 0 .
3. D e tm a r W S tra u b , S e y m o u r G o o d m a n , R ic h a rd L B a s k e rv ille , In fo rm a tio n S e c u rity ,
P o lic y , P ro c e s s e s a n d P ra c tic e s , P H I , 2 0 0 8 .
4. M a rk M e rk o w a n d J im B re ith a u p t, In fo rm a tio n S e c u rity P rin c ip le a n d P ra c tic e s , P e a rs o n



C S 811
SY ST E M A D M IN IST R A T IO N (E le c tiv e – I I I )
I n s tr u c tio n 4 P e r io d s p e r w e e k
D u r a tio n o f U n iv e r s ity E x a m in a t io n 3 H ours
U n iv e r s ity E x a m in a tio n 70 M arks
S e s s io n a l 30 M arks

U N IT - I
F u n c tio n s o f s y s te m a d m in is tra tio n , U N IX : F ile s , P ro c e s s e s D e v ic e s , file s y s te m , e s s e n tia l
a d m in is tra tiv e to o ls : G re p , a w k , file s a n d d ire c to ry c o m m a n d s , s ta rtin g a n d s h u td o w n p ro c e s s .

U N IT - II
U s e r a c c o u n ts , s e c u rity , m a n a g in g s y s te m re s o u rc e s : S y s te m p e rfo rm a n c e , m a n a g in g C P U
u s a g e , m e m o ry , d is k I/O a u to m a tin g ta s k s w ith s c rip ts .

U N IT - III
F ile s y s te m a n d D is k s : M o u n tin g , a d d in g d is k s , C D -R o m d e v ic e s , a n d b a c k u p a n d re s to re
te rm in a ls m o d e m s a n d p rin te rs .

U N IT - IV
T C P /IP N e tw o rk M a n a g e m e n t: T C P /IP n e tw o rk in g , a d d in g a n e w h o s t, N F S /N IS , m o n ito rin g th e
n e tw o rk , E -m a il,c o n fig u rin g a n d b u ild in g K e rn e l fo r L in u x .

U N IT - V
W in d o w s 2 0 0 3 S e rv e r : S ta rtu p , s h u td o w n , s e rv e r c o n fig u ra tio n , u s e r a c c o u n ts , m a n a g in g
p ro c e s s e s , d is k s a n d file s y s te m s e c u rity .

N o te : F irs t fo u r u n its a re re la te d to U N IX s y s te m , F ifth u n it is re la te d to W in d o w s 2 0 0 3 S e rv e r.

1. A e le o n F ris c h , E s s e n tia l S y s te m A d m in is tra tio n , O ’R e illy , 1 9 9 5 , S e c o n d E d itio n .
2. A e le o n F ris c h , E s s e n tia l W in d o w s A d m in is tra tio n , O ’R e illy , 1 9 9 8 , F irs t E d itio n .
3. N e m e th , U n ix S y s te m A d m in is tra tio n , P e a rs o n E d u c a tio n , 2 0 0 0 .



C S 812

R I C H I N T E R N E T A P P L I C A T I O N S (E le c tiv e -I I I )

I n s tr u c tio n 4 P e r io d s p e r w e e k
D u r a tio n o f U n iv e r s ity E x a m in a t io n 3 H ours
U n iv e r s ity E x a m in a tio n 70 M arks
S e s s io n a l 30 M arks

U N I T -I
W e b 2 .0 F o lk s o n o m ie s a n d W e b 2 .0 , S o ftw a re a s a s e rv ic e . M u ltip le d e liv e ry c h a n n e ls
(V o ic e – V O X M L , a n d A N T (H T M L ), S o c ia l N e t w o rk in g .

U N IT - II
C lie n t s id e p ro g ra m m in g – O v e rv ie w o f J a v a S c rip t, O b je c ts in J a v a S c rip t, R e g u la r e x p re s s io n s ,
O v e rv ie w o f X M L , D T D a n d X M L S c h e m a , D O M a n d S A X P a rs e rs ,C S S ,X S L T .

U N IT - III
W e b S e rv ic e s - S O A ,S O A P ,W S D L ,R E S T S e rv ic e s .
J S O N F o rm a t- A ja x in tro d u c tio n , X M L H T T P o b je c t c o m p a ris o n w ith I fra m e s .

U N I T -I V
B u ild in g R ic h In te rn e t A p p lic a tio n - F la s h P la y e r, F le x fra m e w o rk , M X M L in tro d u c tio n , A c tio n
S c rip t In tro d u c tio n , w o rk in g w ith A c tio n S c rip t, F le x D a ta b in d in g , C o m m o n U I C o m p o n e n ts
u s in g D a ta g rid s . T re e c o n tro ls , P o p u p c o n tro ls e tc .

U N I T -V
M a s h u p u s in g F le x a n d A ja x . W e b s e rv ic e s in F le x . S e m a n tic w e b (W e b 3 .0 ). R e s o u rc e
D e s c rip tio n F ra m e w o rk , u s e a n d e x a m p le s , O n to lo g ie s , W e b o n to lo g y la n g u a g e (O W L ).

1. Iv a n B a y ro s s ,W e b E n a b le d C o m m e rc ia l A p p lic a to n D e v e lo p m e n t u s in g H T M L , D H T M L ,
J a v a s c rip t , P e r l C G I ,B P B P u b lic a tio n s , 2 0 0 7 .
2. C o lin M o o c k , E s s e n tia l A c tio n s c rip t 3 .0 , O ’R e illy p u b lic a tio n s , 2 0 0 7 .
3. S te v e n H o lz n e r, A ja x B ib le W ile y In d ia E d itio n , 2 0 0 7 .
4. J u s tin G e h tla n d e t a l, A W e b 2 .0 P rim e r P ra g m a tic A ja x , S P D P u b lic a tio n s , 2 0 0 6 .



C S 813
S O F T W A R E P R O J E C T M A N A G E M E N T (E le c tiv e -I I I )


U n it – I

In tro d u c tio n to S o f tw a re P ro je c t M a n a g e m e n t, P ro je c t E v a lu a tio n a n d P ro g ra m m e M a n a g e m e n t,
A n O v e rv ie w o f P ro je c t P la n n in g .

U n it – I I

S e lc tio n o f a n A p p ro p ria te P ro je c t A p p ro a c h , S o ftw a re E ffo r t E s tim a tio n , A c tiv ity P la n n in g .

U n it – I I I

R is k M a n a g e m e n t, R e s o u rc e A llo c a tio n , M o n ito rin g & C o n tro l.

U n it – I V

M a n a g in g C o n tra c ts , M a n a g in g P e o p le in S o ftw a re E n v iro n m e n ts , W o rk in g in T e a m s .

U n it – V

S o ftw a re Q u a lity , A n O v e rv ie w o f P R IN C E 2


th
1. B o b H u g h e s a n d M ik e C o tte re ll, “ S o ftw a re P ro je c t M a n a g e m e n t” , T a ta M c G ra w H ill, 5
E d itio n , 2 0 1 0 .

st
2. “ W a lk e r R o y c e ” , P e a rs o n ,1 E d itio n .



C S 831
P R O G R A M M IN G L A B IX

O O SD L A B

S tu d e n ts h a v e to p e r fo r m th e fo llo w in g O O A D s te p s o n a g iv e n
C a s e S tu d y :
* U s e C a s e M o d e lin g

* S tru c tu ra l M o d e lin g

* B e h a v io ra l M o d e lin g

* A rc h ite c tu ra l M o d e lin g

T h e o u tp u t s h o u ld c o n s is ts o f:

* U s e c a s e D ia g ra m s

* C la s s D ia g r a m s

* S e q u e n c e D ia g ra m s

* C o lla b o ra tio n D ia g ra m s

* S ta te C h a rt D ia g ra m s

* A c tiv ity D ia g ra m s

* D e p lo y m e n t D ia g ra m s

* C o m p o n e n t D ia g ra m s

S tu d e n ts s h o u ld fo rm in to g ro u p s . T h e y s h o u ld c a rry o u t th e C a s e S tu d y a s a g ro u p a c tiv ity . T h e
la b s h o u ld b e c a rrie d o u t u s in g a C A S E T o o l. F in a lly th e y s h o u ld s u b m it a re p o rt.
S tu d e n ts s h o u ld fa m ilia riz e th e m s e lv e s w ith R a tio n a l T e s t S u ite / W in R u n n e r/ L o a d R u n n e r.



C S 832

P R O G R A M M IN G L A B X

M ID D L E W A R E T E C H N O L O G IE S L A B


1. C re a te a D is trib u te d n a m e S e rv e r (lik e D N S ) R M I.

2. C r e a te a J a v a B e a n to d r a w v a r io u s g r a p h ic a l s h a p e s a n d d is p la y it u s in g o r w ith o u t u s in g

B D K .

3. D e v e lo p a n e n te rp ris e J a v a B e a n fo r s tu d e n t In fo rm a tio n S y s te m .

4. D e v e lo p a n e n te rp ris e J a v a B e a n fo r L ib ra ry o p e ra tio n s .

5. C re a te a n d in v o k e W e b S e rv ic e s .

6. D e v e lo p a c o m p o n e n t fo r c o n v e rtin g th e c u rre n c y v a lu e s u s in g C O M /.N E T .

7. D e v e l o p a c o m p o n e n t f o r b r o w s i n g C D c a t a l o g u e u s i n g C O M / .N E T .

8. D e v e lo p a c o m p o n e n t fo r re trie v in g in fo rm a tio n f ro m m e s s a g e b o x u s in g D C O M /.N E T .

9. D e v e lo p a m id d le w a re c o m p o n e n t fo r re trie v in g S to c k M a rk e t E x c h a n g e in fo rm a tio n

u s in g C O R B A .

1 0 . D e v e lo p a m id d le w a re c o m p o n e n t fo r re trie v in g B a n k b a la n c e u s in g C O R B A .



SCEME OF INSTRUCTIION & EXAMINATION
MCA III YEAR
w.e.f: 2011-2012
SEMESTER – II
Scheme of
Instruction
Syllabus
Sl. Periods per
No Week Duration
No.
in Hrs.
L/T D/P Univ. Exam Sessionals

THEORY

Project
1 CS 851 3 - - 25
Seminar
Project
2 CS 852 6 - Grade 50

GRADES: Excellent / Very Good / Good / Satisfactory / Unsatisfactory


mazters syllabus deepu

Recommended

More Related Content

Viewers also liked

Viewers also liked (15)

Similar to mazters syllabus deepu

Similar to mazters syllabus deepu (20)

Recently uploaded

Recently uploaded (20)

mazters syllabus deepu