📝 DBMS – Unit 1 + Unit 2 (Long Answer Questions & Answers)

 

Unit 1: Introduction to DBMS

1️⃣ Define Database, DBMS and Explain Features of DBMS

Database: Collection of logically related data stored systematically to serve multiple applications.

DBMS: Software that manages databases, allowing users to store, modify, retrieve, and manage data efficiently.

Features of DBMS:

• Data Independence: Application programs do not depend on physical data storage.

• Efficient Data Access: Uses indexes, queries to retrieve data quickly.

• Data Security: Only authorized users can access.

• Data Integrity: Maintains accuracy and consistency using constraints.

• Data Concurrency: Multiple users can access data simultaneously without conflicts.

• Backup & Recovery: Provides automatic backup and recovery in case of failure.

---

2️⃣ Difference Between DBMS and File System

File System	DBMS
Data stored in files	Data stored in structured database
Redundancy & Inconsistency	Minimizes redundancy & maintains consistency
Limited data security	High-level security features
Difficult to update & manage	Easy update, retrieval, management
No support for concurrent access	Supports multiple concurrent users
Example: MS Excel	Example: MySQL, Oracle, PostgreSQL

---

3️⃣ Explain DBMS Architecture

Three levels of DBMS Architecture:

1. Internal Level: Physical storage of data, low-level description.

2. Conceptual Level: Logical structure of entire database, hides physical details.

3. External Level: User views or application views of data.

Diagram:

       +----------------+
       |   External     |
       |   Views        |
       +----------------+
              |
       +----------------+
       | Conceptual     |
       | Schema         |
       +----------------+
              |
       +----------------+
       |   Internal     |
       |   Storage      |
       +----------------+

Explanation:

• External level → user interface

• Conceptual → database structure for DBMS

• Internal → physical storage details

---

4️⃣ Advantages of DBMS

• Reduced data redundancy

• Data consistency & integrity

• Efficient data access via queries

• Data security & authorization

• Multi-user concurrent access

• Backup and recovery facilities

---

Unit 2: ER Model & Relational Model

1️⃣ Explain Entity, Attribute, Relationship & ER Diagram

Entity: Object or thing in real world (e.g., Student, Employee)
Attribute: Property of an entity (e.g., Name, Age, Roll No)
Relationship: Association among entities (e.g., Student enrolls in Course)

ER Diagram Example:

[Student]───Enrolled_In───[Course]
   | Name                    | CName
   | RollNo                  | CID

Types of Attributes:

• Simple / Composite

• Single-valued / Multi-valued

• Derived

Types of Relationships:

• One-to-One (1:1)

• One-to-Many (1:N)

• Many-to-Many (M:N)

---

2️⃣ Explain Keys in DBMS

Primary Key: Unique identifier for entity (e.g., RollNo)
Candidate Key: Possible key that can act as primary key
Foreign Key: Attribute referencing primary key of another table
Super Key: Any set of attributes that uniquely identifies entity

---

3️⃣ Relational Model Concepts

Relation: Table with rows (tuples) and columns (attributes)
Tuple: Row of a table (one record)
Attribute: Column of a table (property)
Domain: Set of possible values for an attribute

Example: Student Table

RollNo	Name	Age
101	Adarsh	21
102	Riya	20

---

4️⃣ Convert ER Diagram to Relational Schema

ER Diagram Example:

• Entities: Student(SID, Name), Course(CID, CName)

• Relationship: Enroll(SID, CID)

Relational Schema:

• Student(SID, Name)

• Course(CID, CName)

• Enroll(SID, CID)

---

5️⃣ Advantages of ER Model

• Easy to understand for users

• Helps in database design

• Visual representation of entities, relationships

• Identifies primary keys and constraints

Unit 1: Basics, Algorithm & Operators ( Programming in C Language)

1️⃣ Explain Algorithm with Example and Properties.

Definition:
Algorithm is a step-by-step procedure to solve a problem in a finite number of steps.

Example: Add two numbers

1. Start

2. Read two numbers, A and B

3. Calculate Sum = A + B

4. Print Sum

5. Stop

Properties of a good algorithm:

• Input: Accepts zero or more inputs

• Output: Produces at least one output

• Definiteness: Steps are clear and unambiguous

• Finiteness: Algorithm must terminate after finite steps

• Effectiveness: Steps are basic, feasible, and solvable manually or by machine

---

2️⃣ Draw Flowchart and Explain Sum of First 10 Numbers

Flowchart:

   ┌───────┐
   │ Start │
   └───┬───┘
       ↓
   i=1, sum=0
       ↓
 ┌── i ≤ 10 ? ──┐
 │ Yes        No│
 ↓             ↓
sum=sum+i     Print sum
i=i+1         ↓
 │          ┌───────┐
 └─────────► Stop  │
             └─────┘

Explanation:

• Initialize i=1 and sum=0.

• Check condition i ≤ 10.

• Add i to sum and increment i.

• Repeat until i > 10.

• Print final sum and stop.

---

3️⃣ Explain Compilation & Execution Process in C

Steps:

1. Editing: Write source code in .c file.

2. Preprocessing: Removes comments, expands macros, includes header files.

3. Compilation: Converts source code to assembly code.

4. Assembly: Converts assembly code into object code (.o file).

5. Linking: Combines object code with libraries to produce executable.

6. Execution: OS loads and runs the executable file.

Example:

#include <stdio.h>
int main() {
    printf("Hello, World!");
    return 0;
}

---

4️⃣ Explain Keywords, Identifiers, and Constants in C

Keywords: Reserved words in C with predefined meaning.
Example: int, float, if, else, return

Identifiers: User-defined names for variables, functions, arrays, etc.
Example: sum, age, myFunction

Constants: Fixed values that do not change.
Example: #define PI 3.14 or const int x = 5;

Difference between Keywords and Identifiers:

Keywords	Identifiers
Reserved by C	User-defined names
Cannot be used as variable names	Can be used as variable or function names
Example: int, float	Example: sum, age

---

5️⃣ Explain Operators in C with Examples

Types of operators:

1. Arithmetic: + - * / %

2. Unary: ++ --

3. Relational/Logical: > < == != && || !

4. Bitwise: & | ^ << >>

5. Assignment: = += -= *= /= %=

6. Conditional: ?:

Examples:

int a=5, b=3;
int c;
c = a + b;  // 8
c = a & b;  // 1 (bitwise AND)
c = a << 1; // 10 (left shift)

Precedence & Associativity:

• Precedence decides which operator evaluated first

• Associativity decides order for operators with same precedence

Example:

10 + 20 * 5  // 110, '*' has higher precedence
100 / 10 * 5 // 50, '/' and '*' have same precedence, left-to-right

---

Unit 2: Control Structures, Functions, Arrays

6️⃣ Explain Control Structures in C with Examples

Definition: Control structures manage the flow of execution in a program.

Types:

1. Sequential: Statements executed line by line.

2. Decision Making (Selection): if, if-else, switch-case

3. Loops (Iteration): for, while, do-while

4. Jump Statements: break, continue, goto

Examples:

For Loop (Factorial):

int n=5, i, fact=1;
for(i=1;i<=n;i++) fact*=i;
printf("%d", fact);

While Loop (Even Numbers):

int i=2;
while(i<=10){ printf("%d ",i); i+=2; }

Switch-Case:

int day=3;
switch(day){
  case 1: printf("Mon"); break;
  case 2: printf("Tue"); break;
  default: printf("Other"); 
}

---

7️⃣ Explain Functions in C with Types and Examples

Definition: Block of code that performs a specific task and can be reused.

Advantages: Code reusability, easy debugging, modularity

Types:

• Library functions: printf(), scanf()

• User-defined functions

Categories based on arguments & return type:

1. No arguments, no return:

void hello(){ printf("Hi"); }

2. Arguments, no return:

void sum(int a,int b){ printf("%d",a+b); }

3. No arguments, return value:

int getNum(){ return 10; }

4. Arguments & return:

int add(int a,int b){ return a+b; }

Call by value vs Call by reference:

• Call by value → function gets a copy, original variable not changed

• Call by reference → function gets address, original variable can be changed

---

8️⃣ Explain Arrays in C with Examples

Definition: Array = collection of elements of same type in contiguous memory.

Types:

• 1D Array: int arr[5]={1,2,3,4,5};

• 2D Array: int mat[2][2]={{1,2},{3,4}};

• Multidimensional Array

Example Programs:

Sum of 1D Array:

int arr[5], i, sum=0;
for(i=0;i<5;i++){ scanf("%d",&arr[i]); sum+=arr[i]; }
printf("Sum=%d", sum);

Matrix Addition (2D Array):

int a[2][2], b[2][2], sum[2][2], i,j;
for(i=0;i<2;i++) for(j=0;j<2;j++) scanf("%d",&a[i][j]);
for(i=0;i<2;i++) for(j=0;j<2;j++) scanf("%d",&b[i][j]);
for(i=0;i<2;i++) for(j=0;j<2;j++) sum[i][j]=a[i][j]+b[i][j];
for(i=0;i<2;i++){ for(j=0;j<2;j++) printf("%d ",sum[i][j]); printf("\n"); }

---

9️⃣ Program Based Long Questions

1. Factorial using recursion:

int fact(int n){ if(n<=1) return 1; else return n*fact(n-1);}

2. Sum of first 10 numbers using loop & function:

int sum10(){ int i, sum=0; for(i=1;i<=10;i++) sum+=i; return sum; }

3. Matrix addition program → See 2D array example above.

4. Demonstrate Bitwise Operators:

int a=5,b=3;
printf("%d %d %d %d %d", a&b, a|b, a^b, a<<1, a>>1);

Unit 1 (Programming in C with Data Structures) – Short Notes (6 Marks Type)

 Q1. Define Algorithm and its properties.

Answer:
An algorithm is a step-by-step finite process to solve a specific problem.

Properties:

1. Definiteness → Steps must be clear.

2. Finiteness → Algorithm must end after finite steps.

3. Input → Zero or more inputs accepted.

4. Output → At least one output produced.

5. Effectiveness → Steps must be simple and feasible.

---

Q2. What is a Flowchart? List its advantages.

Answer:
A flowchart is a graphical representation of an algorithm using symbols like oval (Start/End), rectangle (Process), diamond (Decision), parallelogram (I/O).

Advantages:

• Easy to understand.

• Helps in debugging before coding.

• Improves communication between developers.

---

Q3. Explain the structure of a C program.

Answer:
Basic structure:

1. Preprocessor directives (#include <stdio.h>)

2. Main function (int main() { ... })

3. Declarations (variables)

4. Statements (logic/code)

5. Return statement (return 0;)

---

Q4. Explain Compilation & Execution of a C program.

Answer:
Steps:

1. Writing → Save program as .c file.

2. Compilation → Compiler converts C code → machine code.

3. Linking → Connects with libraries.

4. Execution → Run the program → output is shown.

---

Q5. What are Data Types in C?

Answer:
Data types define the kind of data stored in variables.

• Basic: int, float, char, double.

• Derived: arrays, functions, pointers.

• User-defined: structures, union, enum.

• Void: no value.

---

Q6. What are Identifiers and Keywords in C?

Answer:

• Identifiers: Names given to variables, functions, etc. (e.g., marks, sum).

• Keywords: Reserved words with special meaning, cannot be used as identifiers (e.g., int, while, return).

📘 Unit 3 – Boolean Algebra (MCA)

 

1. Boolean Algebra Basics

• Boolean Algebra deals with variables that take two values only:

  • 0 (false/LOW)

  • 1 (true/HIGH)

• The main operations are:

  • AND (·) → Output is 1 if both inputs are 1.

  • OR (+) → Output is 1 if at least one input is 1.

  • NOT (') → Output is the complement of the input.

---

2. Basic Boolean Laws

Here are some important laws of Boolean algebra:

• Identity Laws

  • A + 0 = A

  • A · 1 = A

• Null Laws

  • A + 1 = 1

  • A · 0 = 0

• Idempotent Laws

  • A + A = A

  • A · A = A

• Complement Laws

  • A + A' = 1

  • A · A' = 0

• Involution Law

  • (A')' = A

---

3. DeMorgan’s Theorems

Two very important rules:

1. (A · B)' = A' + B'

2. (A + B)' = A' · B'

👉 These are very useful for simplification and circuit design.

---

4. Duality Principle

Every Boolean expression remains valid if:

• + is replaced with ·

• 0 is replaced with 1
  (and vice versa).

Example:
(A + 0) = A
Dual → (A · 1) = A ✅

---

5. Simplification Example

Simplify:
F = A · (B + B')

• B + B' = 1 (Complement Law)

• So F = A · 1 = A ✅

UNIT 1 - DBMS (MCA )

 

Lesson 1: The Problem with Files (and why we need a DBMS)

Imagine you own a small online store. Initially, you might manage your business using spreadsheets, just like a regular file system. You'd have:

• Customers.xlsx (with customer names, addresses)

• Products.xlsx (with product names, prices)

• Orders.xlsx (with who ordered what, and the customer's shipping address)

This works for a while, but as your store grows, you'll run into some major headaches. 🤯

Problem 1: Data Redundancy (Duplication)

Notice that the customer's shipping address is in Customers.xlsx AND in Orders.xlsx. You're storing the same piece of information in multiple places. This is data redundancy. It wastes space and leads to the next big problem.

Problem 2: Data Inconsistency

A customer, Rohan, moves to a new house. He emails you his new address. You update his address in your main Customers.xlsx file, but you forget to update it in the Orders.xlsx file for a recent order he placed.

Now you have a conflict! Which address is correct? The data is inconsistent. You might accidentally ship his order to the old address.

Problem 3: Difficult Data Access

One day, you want to ask a simple business question: "Show me the top 3 products bought by customers from Delhi."

With your spreadsheets, this is a nightmare. You'd have to:

1. Go to Customers.xlsx to find all customers from Delhi.

2. Copy their names.

3. Go to Orders.xlsx and manually filter through thousands of rows to find the orders placed by those specific customers.

4. Count the products to find the top 3.

This is slow, tedious, and prone to errors.

The Solution: The Database Management System (DBMS) ✨

A DBMS is a smart software system designed to solve all these problems. Think of it as a highly organized, intelligent, and secure digital filing cabinet.

Here's how a DBMS would handle your store:

Instead of separate files, you'd have one central database. Inside, the data is stored in structured tables that are linked together.

1. A Customers Table: Stores customer info (ID, Name, Address). Each customer is listed only once.

2. A Products Table: Stores product info.

3. An Orders Table: When an order is placed, this table doesn't copy the customer's whole address. It simply references the customer using their unique Customer ID.

Now, let's see how the problems are solved:

• No Redundancy: Rohan's address is stored in only one place: the Customers table.

• Guaranteed Consistency: When Rohan moves, you update his address in the Customers table. Since the Orders table just points to Rohan's ID, any new order automatically uses the correct, updated address. The data is always consistent.

• Easy Data Access: Answering "Show me the top 3 products bought by customers from Delhi" becomes a simple, one-line command in a language like SQL (which we'll cover in Unit 3). The DBMS does all the hard work of linking the tables and finding the answer in seconds.

In summary:

Feature	File System (e.g., Excel)	DBMS
Structure	Unstructured, separate files 👎	Centralized, structured tables 👍
Redundancy	High	Minimal
Consistency	Low	High
Security	Poor (file-level)	Excellent (user-level)
Access	Difficult, manual	Easy, powerful (using SQL)

This fundamental difference is why almost every modern application, from banking apps to social media, is built on a database.

📖 Paper 1 – Unit 1: Algorithm Development and C Language Programming (MCA)

Part 1: Structure and Properties of an Algorithm

---

1. What is an Algorithm?

An algorithm is a step-by-step set of instructions to solve a specific problem.

Example:
If you want to make tea:

1. Boil water.

2. Add tea leaves.

3. Add sugar.

4. Add milk.

5. Stir and serve.

That’s an algorithm — but in cooking terms.

---

Properties of a Good Algorithm

1. Definiteness → Every step must be clear and unambiguous.

2. Finiteness → Must end after a finite number of steps.

3. Input → Takes zero or more inputs.

4. Output → Produces at least one output.

5. Effectiveness → Steps are basic enough to be done by hand or by computer.

---

Example in Computing:
Problem: Find the largest of two numbers A and B.

Algorithm:

1. Start.

2. Input A and B.

3. If A > B, print A.

4. Else, print B.

5. Stop.

---

📍 Flowcharts

A flowchart is a graphical representation of an algorithm, using different shapes to represent different actions.

---

Common Flowchart Symbols

Symbol	Meaning
⭕ Oval	Start / End
⬜ Rectangle	Process / Instruction
🔶 Diamond	Decision (Yes/No)
⬠ Parallelogram	Input / Output

---

Example Flowchart:
Algorithm: Find the largest of two numbers.

   ⭕  Start
    ↓
  ⬠  Input A, B
    ↓
  🔶 Is A > B ?
   /  \
 Yes    No
 |      |
⬜ Print A  ⬜ Print B
 |      |
 ⭕ End

---

Why Flowcharts Matter:

• Makes logic visual.

• Easier to debug before coding.

• Helps in team communication.

---

✅ Practice Task:
Draw a flowchart for finding the largest of three numbers (A, B, C).
Hint: You’ll need two decision diamonds.

MCA SYLLABUS ALLAHABAD UNIVERSITY 2025

 PAPER 1: PROGRAMMING IN ‘C’ WITH DATA STRUCTURES (MCA540) 

Unit 1 : Algorithm development and C language Programming: Structure and properties of algorithm,   Flowchart, Introduction to C, Compilation & execution of C programs, , Data types & sizes, Declaration of variables, Modifiers, Identifiers & keywords, Symbolic constants, Operators: Unary operators, Arithmetic & Logical operators, Bit-wise operators, Assignment operators and expressions, Conditional expressions, Precedence & associativity, order of evaluation. Control statements: If-else, Switch, Break, Continue, Go-to statement; Loops: For, While, Do-while. 

Unit 2: Functions and Arrays: Functions: Built-in & User-defined, Function declaration, Definition &function call, Parameter passing: Call by value, Call by reference, Recursive functions. Linear arrays, Multi-dimensional arrays, passing arrays to functions, Arrays & Strings; Storage classes: Automatic, External, Register & Static. 

Unit 3: Pointers and Linked list: Pointers: Value at (*) and address of (&) operator, Pointer to pointer, Dynamic memory allocation, Calloc & Malloc functions, Array of pointers, Function of pointers, Macros, C pre-processor, Structures & Union: Definition and differences. Linked list and Operations (insertion, deletion and modification): Singly linked lists, Circular list, Doubly linked lists and its application, array and linked representation.  

Unit 4: Stacks and Queues and Trees: Stacks: Basic idea, array and linked representation. Prefix/ infix / postfix expressions and their inter-conversion for evaluation. Queues:  Basic idea, array and linked representation, Priority queues and simulation, Recursion. Trees: Definition, terminologies and properties, Binary tree representation traversals and applications, Binary Search trees, Threaded binary trees.

 Unit 5:Sort and Search Algorithms: Linear and Binary search. Internal and External Sorting algorithms, Heap sort, Merge sort, Quick-sort, Radix sort, Bucket sort. Hashing: Hash functions, collision resolution techniques (chaining, linear offset, others). 

Reference Books: 

1. The C Programming Language, B.W. Kernighan and D.M. Ritchie (PHI) 

2. Programming using the C language, R.C. Hutchinson and S.B. Just (McGraw Hill) 

3. Data Structures and Program Design- Robert Kruse. 

4. Data Structures- Horowitz and Sahni 

5. Data Structures through C- A. Tennenbaum 4 

PAPER 2: DATABASE MANAGEMENT SYSTEM (MCA541) 

Unit 1: Introduction and ER Modelling: An overview of database management system, Database System Vs File System, Data models schema and instances, data independence and data base languages. Data Definitions Language, Data Manipulation Language, Overall Database Structure. Data Modelling using the Entity Relationship Model: ER model concepts, notation for ER diagram, mapping constraints, keys, Concepts of Super Key, candidate key, primary key, Generalization, aggregation, reduction of an ER diagrams to tables, extended ER model, relationships of higher degree. 

Unit 2: Relational data Model and Language: Relational data model concepts, integrity constraints: entity integrity, referential integrity, Keys constraints, Domain constraints, relational algebra, relational calculus, tuple and domain calculus. 

Unit 3: Introduction to SQL: Characteristics of SQL, Advantages of SQL, SQL data types and literals, Types of SQL commands, SQL operators and their procedure, Tables, views and indexes, Queries and sub queries, Aggregate functions, Insert, update and delete operations, Joins, Unions, Intersection, Minus, Cursors in SQL. PL/SQL, Triggers and clusters. 

Unit 4: Data Base Design & Normalization: Functional dependencies, normal forms, first, second, third normal forms, BCNF, inclusion dependencies, normalization using functional dependency, Multivalued dependency and Join dependency. 

Unit 5: Transaction Processing & System Architecture: Introduction: Transaction Processing, Transaction System Concepts, Transaction Atomicity, Durability, and Isolation, Serializability. Concurrency Control: Deadlock Handling, Multiple Granularity, Lock-Based Protocols, TimestampBased Protocols, Validation-Based Protocols. Database-System Architectures: Centralized and ClientServer Architectures, Server-System Architectures, Parallel Systems, Distributed Systems, Network Types. 

References: 

1 Date C J, “An Introduction To Database System”, Addision Wesley 

2 Korth, Silbertz, Sudarshan, “Database Concepts”, McGraw Hill 

3 Elmasri, Navathe, “Fundamentals Of Database Systems”, Addision Wesley 

4 Paul Beynon Davies, “Database Systems”, Palgrave Macmillan 5 

PAPER 3: COMPUTER ORGANIZATION & ARCHITECTURE (MCA542) 

Unit 1: Generation of Computers, Functional block diagram of a computer, Hardware and Software, Generation of programming languages-Machine Level Language, Assembly Level language and High Level Language; Digital Computers ,Number Systems-Binary, Octal, Decimal Hexadecimal, and Conversion; Binary Arithmetic- Binary Addition, Subtraction etc. 

Unit 2: Logic Gates, Boolean Algebra, Minterms, Maxterms, Sum of Product Form, Product of Sum Form, realization of switching expressions by Karnaugh map ; Codes- weighted, unweighted codes, self Complementing Code, Gray Code, BCD, Excess 3 Code ; Code Conversion 

Unit 3: Adder-Half, Full, 4 and 8 bit parallel adder circuits,  and Subtractor-Half, full, 4 and 8 bit  parallel subtractor circuits; Magnitude comparator, Decoders, Encoders, Multiplexer and demultiplexer, Realization of switching expressions by decoders, encoders, multiplexer and Demultiplexer, Sequential circuits, latches and Flip Flops-SR, D, JK and T flip flops;  Analysis of clocked sequential circuits. State reduction and assignment; Counters-Ripple Counter, Ring Counter etc 

Unit 4: Introduction to microprocessors, essential and non-essential elements of a microprocessor, addressing modes, Interrupts and its types, Instruction cycle, machine cycle, T-state, pipelining, Superpipeline, Superscalar Pipeline, Pipeline Hazards. 

Unit 5: Memory Hierarchy, IO methods-Direct IO (DMA) and Indirect IO-Memory Mapped IO and IO Mapped IO; Memory Interleaving-Lower and Higher order Interleaving , Memory organization-2D and 3D, Cache Memory, addressing cells in the cache memory: Associative and Direct memory organization, Memory Management. 

References: 

1. William Stalling, “Computer Organization & Architecture”, Pearson education Asia 

2. Mano Morris, “Computer System Architecture”, PHI 

3. Zaky&Hamacher, “Computer Organization”, McGraw Hill 

4. B. Ram, “Computer Fundamental Architecture & Organization”, New Age 6 

PAPER 4: PRINCIPLES OF MANAGEMENT (MCA543) 

Unit 1: Definition, Functions, Process, Scope and Significance of Management. Nature of Management, Managerial Roles, Managerial Skills and Activities, Difference between Management and Administration. Significance of Values and Ethics in Management.  

Unit 2: Evolution of Management Thought, Approaches of Management Thought, Functions of Management.  

Unit 3:  Planning and Organizing Nature, Scope, Objective and Significance of Planning, Elements and Steps of Planning, Decision Making Organizing Principles, Span of Control, Line and Staff Relationship, Authority, Delegation and Decentralization. Effective Organizing, Organizational Structures, Formal and Informal Organizations, Staffing.  

Unit 4: Directing -Effective Directing, Supervision, Motivation, Different Theories of Motivation Maslow, Herzberg, Mc Clelland, Vroom, Porter and Lawler, Job Satisfaction. Concept of Leadership- Theories and Styles. Communication Process, Channels and Barriers, Effective Communication.  

Unit 5: Controlling and Coordinating- Elements of Managerial Control, Control Systems, Management Control Techniques, Effective Control Systems. Coordination Concept, Importance, Principles and Techniques of Coordination, Concept of Managerial Effectiveness. 

References: 1. Management: Principles and Practice by S.K. Mandal 

2. Management Principles and Practices by Parag Diwan 7 

PAPER 5: SOFTWARE ENGINEERING & CASE TOOLS (MCA544) 

Unit 1: Introduction to software engineering and software development life cycle models: Introduction to Software, Types of Software, Introduction to Software Engineering, Software Processes; SDLC: Introduction, Models. 

Unit 2: Software Requirement and Quality Assurance: Requirement Engineering, Types of Requirements, SRS, Characteristics of SRS, DFD and ERD; Verification and Validation; Software quality Assurance: definition, Objectives, Goals and Plan; CMM. 

Unit 3: System Design and Software Measurement: Design Objective, Design Principles, Modularization, Coupling and Cohesion; Software Metrics: Definition and Types. 

Unit 4: Software Testing and Maintenance: Testing Principles, Levels of Testing, White Box and Black Box Testing; Software Configuration Management, Need and Types of Maintenance, COCOMO. 

Unit 5: Risk Management, CASE Tools and Case Studies: Risk Analysis; Project Scheduling; Reverse Engineering; Re-engineering. Introduction to CASE tools, Use and Application; Case Study: To analyse a problem and prepare a SRS document including DFD and ERD. 

References:
1. Pressman, Roger S., “Software Engineering: A Practitioner’s Approach Ed. Boston: McGraw Hill, 2001 

2. Jalote, Pankaj, “Software Engineering Ed.2”, New Delhi: Narosa 2002 

3. Schaum’s Series, “Software Engineering”, TMH 

4. Ghezzi, Carlo and Others, “Fundamentals of Software Engineering”, PHI 8 

PAPER 6: DISCRETE STRUCTURES & GRAPH THEORY (MCA545) 

Unit 1: Logic: Logical Statement, Logical Operators and their Properties, Tautology, Contradiction and Contingency, Normal Forms and Properties, Implications and Biconditional, Arguments and Fallacy, Rules of Inference, Predicate Logic: Quantifier, Validity of a Predicate, Properties and Translation. 

Unit 2: Combinatorics: Permutations and Combination, Summation: Properties of Binomial Function and Generating Functions, Solution of Recurrence Relation. 

Unit 3: Set Theory: Relations: Definition of Relation, R-Relative Set, Representation of a Relation, Operations on Relations, Types of Relations, Counting of Relations and Closure of Relations, Equivalence Relations and Partial Order Relation, Properties of Equivalence Relations and Power of a Relation, Functions: Definition of Function, Domain and Range, Types of Functions, Counting of Functions, Inverse of Function, Composition, Group Theory 

Unit 4: Poset, Lattices and Boolean Algebra: Poset, Toset, Woset, Topological Sorting, Hasse Diagram, Extremal Elements of Posets, Lattice, Semi Lattice, Properties of Lattice, Types of Lattice, Boolean Algebra 

Unit 5: Graph Theory: Definition of Graph, Types of Graph, Degree of a Vertex, Special Graph, Graph Representation, Graph Traversal (BFS and DFS), Isomorphism of Graph, Connectivity of Graph, Applications: Euler’s Graph, Hamiltonian Graph, Planar Graph, Trees: Spanning Tree, Enumeration of Graph and Graph No. 

References: 1. Discrete Mathematical Structures with Application to Computer Science- Tremblay &    Manohar.   

2. Discrete Mathematical Structures – Preparata and Yeh