SCHEME/SYLLABUS
: MCA(SE)
(Second Semester)
Code
No : IT 602
Paper: Software Engineering
Introduction:
Software Crisis, Software Processes, Software life cycle models: Waterfall,
Prototype, Evolutionary and Spiral models, Overview of Quality Standards
like ISO 9001, SEI-CMM
Software Metrics:
Size Metrics like LOC, Token Count, Function Count, Design Metrics, Data Structure
Metrics, Information Flow Metrics.
Software Project Planning:
Cost estimation, static, Single and multivariate models, COCOMO model, Putnam
Resource Allocation Model, Risk management.
Software Requirement Analysis and Specifications:
Problem Analysis, Data Flow
Diagrams, Data Dictionaries, Entity-Relationship diagrams, Software Requirement
and Specifications, Behavioural and non-behavioural
requirements, Software Prototyping.
Software Design:
Cohesion & Coupling, Classification of Cohesiveness & Coupling, Function
Oriented Design, Object Oriented Design, User Interface Design.
Software Reliability:
Failure and Faults, Reliability Models: Basic Model, Logarithmic Poisson Model,
Calender time Component, Reliability Allocation.
Software Testing:
Software process, Functional testing: Boundary value analysis, Equivalence
class testing, Decision table testing, Cause effect graphing, Structural testing:
Path testing, Data flow and mutation testing, unit testing, integration and
system testing, Debugging, Testing Tools & Standards.
Software Maintenance:
Management of Maintenance, Maintenance Process, Maintenance Models, Reverse
Engineering, Software Re-engineering, Configuration Management, Documentation.
Text:
Reference:
Code No: IT 604
Paper : Data Base Management Systems
Basic concepts: database & database users, characteristics of the database, database systems, concepts and architecture, date models, schemas & instances, DBMS architecture & data independence, database languages & interfaces, data modelling using the entity-relationship approach. Overview of hierarchical, Network & Relational Data Base Management Systems.
Relational model, languages & systems: relational data model & relational algebra: relational model concepts, relational model constraints, relational algebra, SQL- a relational database language: date definition in SQL, view and queries in SQL, specifying constraints and indexes in sql, a relational database management systems, DB2.
DB2 Architecture, Logical Data Structures Physical Data Structure, Instances, Table Spaces, Types of Tablespaces, Internal Memory Structure, Background Processes, Data Types, Roles & Privileges, Stored Procedures, User Defined Functions, Cursors, Error Handling, Triggers.
Relational data base design: function dependencies & normalization for relational dataases: functional dependencies, normal forms based on primary keys, (1NF, 2NF, 3NF & BCNF), lossless join and dependency preserving decomposition.
Concurrency control & recovery techniques: concurrency control techniques, locking techniques, time stamp ordering, granularity of data items, recovery techniques: recovery concepts, database backup and recovery from catastrophic failures.
Concepts of object oriented database management systems, Distributed Data Base Management Systems.
Text:
- Desai, B., “An introduction to database concepts”, Galgotia publications.
References:
Code No: IT 606
Paper: Algorithm Analysis and Design
Preliminaries:
Growth of functions, Summations, Recurrences: The substitution method, The
iteration method, The master method, Divide and Conquer paradigm, Dynamic
programming, Greedy Algorithms.
Sorting and Order Statistics:
Merge Sort, Heap sort, Quick sort, Sorting in linear time, Medians and Order
statistics.
Searching and Data Structures for Disjoint Sets:
Hash Tables, Binary Search Trees, Red-Black trees, order statistic tree, disjoint-set
Operations, Linked list representation of disjoint sets, Disjoint set forests.
Graph Algorithms:
Representation of Graphs, Breadth First Search, Depth First Search, Topological
Sort, Strongly Connected Components, Algorithm for Kruskal’s and Prim’s
for Finding Minimum cost Spanning Trees, Dijkstra’s and Bellman Fort
Algorithm for finding Single source shortest paths. All pair shortest paths
and matrix multiplication, Floyd-Warshall algorithm for all pair shortest paths.
String matching:
The naïve String Matching algorithm, The Rabin-Karp Algorithm, String
Matching with finite automata, The Knuth Marris Pratt algorithm.
NP-Complete Problem
Polynomial-time verification, NP-Completeness and Reducibility, NP-Completeness
Proof, NP-Complete problems.
Text:
References:
Code No: MS 608
Paper : Organizational Behaviour
Introduction: Meaning and nature of management; management systems and process, Tasks and responsibilities of a professional manager; Managerial skills.
Organization Structure and Processes: Organizational climate and culture, Management ethos; Organizational Structure and Design; Managerial Communication; Planning process; Controlling.
Behavioural Dynamics: Individual determinants of Organization Behaviour; Perceptions, Learning, Personality, Attitudes and Values, Motivation; Stress and its management.
Interactive Aspects of Organizational Behaviour; Analysis inter-personal relations; Group Dynamics; Management of Organizational Conflicts; Leadership Styles.
Decision Making: Organizational Context of Decisions, Decision Making Models; Problem Solving and Decision Making.
References:
Code No: BA 610
Paper : Mathematics II
Linear programming : graphical methods for two dimensional problems – central problem of linear programming – various definitions – statements of basic theorems and properties – phase i and phase ii of the simplex method – revised simplex method –primal and dual – dual simplex method – sensitivity analysis – transportation problem and its solution – assignment problem and its solution by Hungarian method.
Integer programming: Gomory cutting plane methods – branch and bound method.
Queuing theory: characteristics of queuing systems – steady state m/m/1,m/m/1/k and m/m/c queuing models.
Replacement theory : replacement of items that deteriorate – replacement of items that fail group replacement and individual replacement.
Inventory theory : costs involved in inventory problems – single item deterministic models – economic lot size models without shortages and with shortages having partition rate infinite and finite.
Pert and CP/M : arrow network- time estimates – earliest expected time, latest allowable occurrence time, latest allowable occurrence time and slack – critical path – probability of meeting scheduled date of completion of project – calculation of CP/M network – various floats for activities – critical path – updating project – operation time cost trade off curve – selection of schedule based on cost analysis
References:
Code No: IT 652
Lab: Computer Lab II
The practical will be based on the following paper:
Code No: IT 654
Lab: Computer Lab IV
The practical will be based on the following papers:
Code No: IT 656
Title: Term Paper – II
Every student is required to submit a term paper on topic related to the course offered in semester – I and /or semester – II. The term paper should include subject matter not covered in the syllabi. The presentation will be held in the last two weeks of the semester – II. (Duration of presentation: 30 minutes).