Batch 2018 3rd Semester CSE

Department of Computer Science & Engineering
SCHEME
BE CSE
Batch 2018 – 2022
3rd Semester
Scheme Applicable to BE CSE Batch 2018 onwards

3rd Semester
Subject Subject
S. No. Subject Name L T P S Cr.
Code Type
Introduction to
1 Management & UCT-242 HSM 2 0 0 - 2
Leadership
2 Aptitude TDT-202 DC 0 2 0 - 2
Computer Organization
3 CST-203 ES 3 0 0 - 3
and Architecture
4 Data structure CST-231 DC 3 0 0 - 3
5 Discrete Mathematics SMT-221 BS 3 1 0 - 4
6 Software Engineering CST-220 DC 3 0 0 - 3
7 Software Engineering Lab CSP-207 DC 0 0 2 - 1
8 Java Programming Lab CSP-279 DC 0 0 4 - 2
9 Data Structure Lab CSP-232 DC 0 0 4 - 2
Total 14 3 10 0 22
1 Entrepreneurship UCW-249 MNG 0 0 0 2 1
11
Life Skill and Mentoring-3 UCY-246 MNG 0 1 0 - 1
Engineering Mathematics
12 SMY-222 MNG 3 1 0 - 4
(LEET)
Institutional/Summer
13 CSY-210 MNG 0 0 0 4 2
Training*

CHANDIGARH UNIVERSITY
GHARUAN
Syllabus
B.E. (Computer Science & Engineering)
3rd Semester
(Batch: 2018)

Chandigarh University, Gharuan

Introduction to Management
Subject Code L T P C
&Leadership
UCT-242 Total Contact Hours : 30Hours
2 0 0 2
CSE 2nd Year
Marks-100
Internal-40 External-60
Course Objectives
 To learn the basics of management and study its principles and functions.
 To study concept of operational aspects of management and management ethics.
 To understand concept of Leadership and its theories.
Unit Course Outcomes
Student will be able to appreciate & implement the concept of management in their
I
personal & professional life.
II Student will learn about operational aspects of management and management ethics.
Students will study the concept of leadership and its theories and apply the concepts
III
in their professions.
Contents of the Syllabus
UNIT- I
Introduction to Management: Nature of Management, Importance of Management, Concepts

of Management, The history and streams of management, the general and technical
environment in management and the business strategy
Strategic Management: Introduction to strategic management: The strategies, process, vision,
mission and goal setting. External and Internal analysis.
UNIT-II
Leadership Foundation And Theories: - Introduction to Leadership styles, Great Man theory,
Trait theory, Behavioral Theory, Contingency, Transformational and Transactional leadership
theory,
Group Dynamics and Teams; Leadership in Complex group and Organization: Being in
Communities, Renewing group organization and communities, Understanding the change and
strategies for change.
MBTI- Myers Brigg Type Indicator.

UNIT-III
Organizing People, Project and Process: Leading Teams, Managing Human Resource Systems,
Managing Individual and Diverse Systems
Control: Function of control, Cycle of Control and Control in the process of organizing.
Text Books:
1. Management Theory and Practice: Gerald A Cole, Cengage Learning EMEA Higher Education
2. Management Theory and Practice, Chandan, J.S, Vikas Publications, 1987
3. Management Theory, Sheldrake John, Published Intl Thomson Business Pre 1966
4. Introduction to Leadership: Concepts and Practice, Northouse.G.Peter, Sage Publications.
5. Reframing Organizations: Artistry, Choice and Leadership, Bolman. G. Lee

Computer Organization and Architecture L T P C

Subject Code Total Contact Hours : 45 Hours
CST-203/ITT-203
Common to all Specializations of CSE/IT 3 0 0 3
2nd Year
Marks-100
Course Objectives
 To familiarize students with the architecture of a processor.

 To have a good understanding of various functional units of computer.
 To understand the design of a basic computer system.
Understand the operation of electronic logic elements
I. Understand the organization of a computer system in terms of its main components

Understand different processor architectures
Understand input/output mechanisms
II.
Understand the various parts of a system memory hierarchy
Have practical experience of prototyping digital circuits
III.
Be able to interface digital circuits to microprocessor systems
UNIT-I [15h]
Basic concepts-Digital computer with its block diagram, computer hardware components - ALU,
registers, memory, system bus structure-data, address and control bus.
Instruction Set Architectures-Levels of programming Languages, Assembly Language
Instructions: instruction cycle, instruction types, addressing modes, RISC v/s CISC.
Computer Organization- CPU organization, Memory Subsystem Organization: Types of
memory, Internal Chip Organization, memory subsystem configuration.

UNIT-II [15h]
Design of control unit - Hardwired control unit, Micro-Programmed control unit and
comparative study.
Memory organization-Memory hierarchy, Cache Memory Associative Memory, Cache memory
with associative memory, Virtual Memory: Paging, Segmentation.
Input output organization –Asynchronous Data transfer: Source Initiated, Destination Initiated,
Handshaking, Programmed I/O, Interrupts DMA, and IOP
UNIT-III [15h]
Introduction to Parallel Processing- Parallelism in uniprocessor system, Flynn’s Classification,

Handler’s Classification, concept of pipelining, Instruction Pipeline, Arithmetic Pipeline.
Multiprocessors- Characteristics of multiprocessors, Uniform and non-uniform memory access
multi processors, various interconnection networks.
Text Books:
1. Carpinelli J.D,” Computer systems organization &Architecture”, Fourth Edition, Addison
Wesley.
2. Patterson and Hennessy, “Computer Architecture” , Fifth Edition Morgaon Kauffman.
Reference Books:
1. J.P. Hayes, “Computer Architecture and Organization”, Third Edition.
2. Mano, M., “Computer System Architecture”, Third Edition, Prentice Hall.
3. Stallings, W., “Computer Organization and Architecture”, Eighth Edition, Pearson
Education.


Subject L T P C
Code- DISCRETEMATHEMATICS 3 1 0 4
SMT-221
Applicable to CSE/IT/CSE (Hons.) Total hours =45
(Semester-3rd)
branch : (Batch 2017Regular, Objectives
LEET2018)
To Impart analytical ability in solving mathematical problems as applied to the
Respective branch of Engineering
Subject Outcome
1 Some fundamental mathematical concepts and terminology related to various
types of relations, functions, recursive relations and generating functions. To
use and analyze recursive definitions, To learn about the basic counting
principle and solution of the problems relating to Graphs, Trees and
fundamental circuit.
2 To learn about the various algebraic structures like binary/homomorphism/
Isomorphism /automorphism etc.
3 Study the different types of graphs as well as the tree & paths and difference between
them such as binary/spanning/minimal spanning/ traversal trees.
The content of the Syllabus
UNIT-I [15H]
Set Theory: Introduction to set theory, set operations, algebra of sets, combination of sets,
duality ,finite and infinite sets, classes of sets, power sets, Min sets & Max sets, Cartesian
product
Relations and functions: Binary relations ,types of relations, equivalence relations and
partitions, partial order relations ,mathematical induction, principles of inclusion & exclusion,
functions and its types, composition of function and relations, inverse relations and
functions, pigeon hole principle.
Propositional calculus: Basic operations: AND (˄)OR (˅), NOT(-) Truth value of a compound
statements, propositions, tautologies, contradictions.
UNIT-II [15H]
Recursion and recurrence relations: Sequence, partial fractions. Recurrence relations with
constant coefficients, homogeneous and particular solutions, solutions of recurrence
relation using generating functions.
Algebraic structures: Definition, elementary properties of algebraic structures, semi group

monoid,group,homomorphism,isomorphismandautomorphism,congruencerelations,
subgroups, normal subgroups, cosets, Lagrange's theorem, cyclic groups.
UNIT-III [15H]
Combinatorial Mathematics: Techniques of counting, rule of sum, rule of product

Permutations and combinations.
Graph Theory: Introduction to graphs, directed and undirected graphs, homomorphic and
isomorphic graphs, sub graphs multigraphs and weighted graphs, paths and circuits, shortest
pathinweightedgraphs,Eulerianpathsandcircuits,Hamiltonianpathsandcircuits,planer graphs
Euler's formula, chromatic numbers(Coloring problems).
Trees: Introduction to trees, difference between graphs and a tree rooted trees, path length
in trees, spanning trees & cut-sets, minimum spanning trees, binary trees and its traversal.
TextBooks:
1.C.L. Liu“Elementsof DiscreteMathematics". McGraw Hill,3rdEdition.
2.Santha,"DiscreteMathematics withGraphTheory, CengageLearning,1st Edition.
3.G. Ronald,Knuth,DonaldandPatashik,Oren," concreteMathematics:AFoundation
forComputer Science",Addison-Wesley.
Reference Material:
1.B. Kolaman,and R.C. Busby,“DiscreteMathematicalStructures”,PHI, 1stEdition.
2.Gersting, L. Judith“MathematicalStructuresfor computerScience”,ComputerSciencePress.
3.DoerrandLevasseur,“AppliedDiscerteStructureforComputerScience”.
4.Tembley&Manohar,“DiscreteMathematicalStructures with Applications toComputers”,Mc
GrawHill.
5.K.H. Rosen,“DiscreteMathematics anditsapplications” Mc-Grew hill.
6.NChSNLyengar. V.M.Chandrasekaran,,“DiscreteMathematics”.

Data Structures L T P C
Subject Code Total Contact Hours : 45Hours
CST-231/ITT-231
Common to all Specializations of CSE/ 2nd 3 0 0 3
Year
Marks-100
Course Objectives
 To understand the concept of the data structures and operations on them,

 To apply different data structures for modeling real world problems.
Understand the properties of various data structures.

I.
identify the strengths and weaknesses of different data structures
design and employ appropriate data structures for solving computing problems
II.
possess the knowledge of various existing algorithms
analyze and compare the efficiency of algorithms

III.
possess the ability to design efficient algorithms for solving computing problems
UNIT-I [15h]
Introduction: Concept of data and information, Introduction to Data Structures, Types of data
structure: Linear and non-linear data structures, operations on Data Structures, Algorithm
complexity, Time-space trade off, asymptotic notations.
Arrays: Basic terminology, Linear arrays and their representation, Traversing Linear Array,
Insertion & Deletion in arrays, searching – linear search, binary search, sorting – insertion sort ,
selection sort , bubble sort , merging arrays & merge sort , complexity analysis of each
algorithm, Multi-dimensional arrays and their representation, Pointers; Pointer Arrays, Records;

Record structure, representation of records in Memory, Parallel Arrays, sparse matrices and
their storage.
UNIT-II [15h]
Linked List: Linear linked list, Representation of Linked Lists in Memory, Traversing a linked list,
searching a linked list, insertion in & deletion from linked list, Header Linked List, doubly linked
list, Operations on doubly linked list, complexity analysis of each algorithm, Application of
linked lists.
Stacks: Basic terminology, Sequential and linked representations, Operations on stacks: PUSH &
POP, Application of stacks: Parenthesis matching, evaluation of postfix expressions, conversion
from infix to postfix representation, Quick Sort and its complexity analysis. Meaning and
importance of recursion, principles of recursion & implementation of recursive procedure
Queues: Linear queue, Sequential and linked representation of Linear queue, Circular queue,
Operations on queue, Deques, Priority queue.
UNIT-III [15h]
Graphs: Graph Theory terminology, sequential representation of graphs (adjacency matrix, Path
Matrix), traversing a graph, Operations on Graph.
Trees: Basic terminology, Binary Trees, Representation of Binary Trees in Memory, traversing
Binary Trees, Traversal Algorithms using stacks, Header Nodes; Threads, Binary Search trees,
Searching, Inserting & Deleting in Binary Search Trees, AVL Search trees, B Trees, Heap & Heap
Sort.
Hashing & File Organization: Hash Table, Hash Functions, Collision Resolution Strategies, Hash
Table Implementation. Concepts of files, Organization of records into Blocks, File organization:
Sequential, Relative, Index Sequential, Inverted File.
Text Books:
1. Lipschutz, Seymour, “Data Structures”, Schaum's Outline Series, Tata McGraw Hill.
2. Gilberg/Forouzan,” Data Structure with C ,Cengage Learning.
3. Augenstein,Moshe J , Tanenbaum, Aaron M, “Data Structures using C and C++”,
Prentice Hall of India.
Reference books:
1. Goodrich, Michael T., Tamassia, Roberto, and Mount, David M., “Data Structures and
Algorithms in C++”, Wiley Student Edition.
2. Aho, Alfred V., Ullman, Jeffrey D., Hopcroft ,John E. “Data Structures and Algorithms”,
Addison Wesley.

CHANDIGARH UNIVERSITY, GHARUAN
Subject Code Software Engineering L T P C
CST-220//ITT- Total Contact Hours : 45Hours

3 0 0 3
220 nd
Common to all Specializations of CSE 2 Year
Prerequisite: Studied Project Basics in Institutional Training
Marks-100
Course Objectives
 To study and learn various methods of software engineering.

 To understand the various phases of software development.
 To understand the various testing techniques.
 To learn various user interface designs.
 Selection and implementation of different software development process models

I  Extracting and analyzing software requirements specifications for different
projects
 Defining the basic concepts and importance of Software project management

concepts like cost estimation, scheduling and reviewing the progress.
II  Identification and implementation of the software metrics
 Applying different testing and debugging techniques and analyzing their
effectiveness.
 Analyzing software risks and risk management strategies

III  Defining the concepts of software quality and reliability on the basis of
International quality standards.

Unit-I [15h]
Introduction: Definition of software and Software engineering, Difference between Program

and Product, Software development life cycle, Different life cycle models (waterfall, Iterative

waterfall, Prototype, Evolutionary and Spiral model), Agile software development and Their
characteristics.
Software requirement: Requirement Analysis, Analysis principle, Software prototyping

Specification, Data modeling, Functional modeling and information flow, behavioral modeling,
Mechanics of structural modeling, Data dictionary.
Function and Object oriented design: Structured analysis, Data flow diagrams, Basic object
orientation concepts, Unified modeling language, Unified modeling language, Use case model,
Class diagrams, Interaction diagrams, Activity diagrams, State chart diagrams.
UNIT –II [15h]
Software design: Design process and concepts, Effective Modular design, the design model,
Design documentation, Approaches to Software design.
Software Project management: Software project planning, Project estimation techniques,

COCOMO Model, Project scheduling, Risk analysis and management, Software quality and
management, Staffing, software configuration management.
User interface Design: Characteristics of good user interface design, Command language user
interface, Menu based, Direct manipulation interfaces, Fundamentals of command based user
interface.
UNIT-III [15h]
Software Testing: Testing levels, Activities, Verification and Validation, Unit testing, System
testing Integration testing, Validation testing, Black box and white box testing.
Quality management: Software quality, Software reliability, Software reviews, Formal technical
reviews, Statistical SQA, Software reliability, The ISO 9000 coding standards, SQA plan, SEICMM.
Software Maintenance and Reuse: Definition, Types of maintenance, Software reverse

engineering, Different Maintenance models, Basic issue in any reuse program, reuse approach
Text & Reference Books:
1. Pressman Rogers, “Software Engineering: A Practitioner's Approach”, Sixth edition.

2. Somerville Ian, “Software Engineering”, Addison Wesley, 8th Edition.
3. James FPeters and PedryezWitold, “Software Engineering – An Engineering Approach”,
Wiley Student Edition.
4. Kassem ,” Software Engineering”, engage Learning.

Software Engineering Lab L T P C

Subject Code
Total Contact Hours : 45Hours
CSP-207/ITP- 0 0 2 1
nd
Common to all Specializations of CSE 2 Year
207
Prerequisite: Basic Knowledge of project management
Marks-100
Course Objectives
 To understand the various phases of software development.

 To learn various user interface designs.
 To understand the various testing techniques.
 To study and draw different level DFD and charts.

I-III
 To study and design models using UML modeling objects
List of Experiments
Unit-I
1) Draft a project plan for the any of the project, student submitted in previous semester.
2) Development of SRS document, Design document for the selected project.
3) To draw a different level DFD.
Unit-II
4) To draw a ER diagram.
5) To draw a case diagrams.
6) To draw a sequence diagrams.
7) To draw a class diagrams.
Unit-III
8) To draw collaboration diagrams.
9) To draw Gantt chart and network diagram.
10) To draw a structured chat

Data Structures Lab L T P C

Subject Code Common to all Specializations of CSE 2nd 0 0 4 2
CSP-232/ITP-232 Year
Prerequisite: Studied C/C++ in previous semesters
Marks-100
Course Objectives
 To implement various data structure and operations on them using C++.
 To implement various sorting and searching algorithms using C++.

Designing and applying appropriate data structure using simple algorithms for
I.
modeling and solving given computing problems.
Understand and implement the both array based and linked-list based data
II.
structures, including singly, doubly, and circular linked-lists.
III. Understand and implement the Stack data structure and stack operations.
List of Experiments
UNIT-I
1. Write a menu driven program that implement following operations (using separate
functions) on a linear array:
a) Insert a new element at end as well as at a given position
b) Delete an element from a given whose value is given or whose position is given
c) To find the location of a given element
d) To display the elements of the linear array
2. Program to demonstrate the use of linear search to search a given element in an array.
3. Program to demonstrate the use of binary search to search a given element in a sorted array
in ascending order.
4. Program to sort an array of integers in ascending order using bubble sort.
5. Program to sort an array of integers in ascending order using selection sort.
6. Program to sort an array of integers in ascending order using insertion sort.
7. Program to sort an array of integers in ascending order using merge sort.

UNIT-II
8. Write a menu driven program that maintains a linear linked list whose elements are stored in
on ascending order and implements the following operations (using separate functions):
a) Insert a new element

b) Delete an existing element
c) Search an element
d) Display all the elements
9. Write a program to demonstrate the use of stack (implemented using linear array) in
converting arithmetic expression from infix notation to postfix notation.
10. Program to demonstrate the use of stack (implemented using linear linked lists) in
evaluating arithmetic expression in postfix notation.
11. Program to sort an array of integers in ascending order using quick sort.
12. Program to demonstration the implementation of various operations on a linear queue
represented using a linear array.
13. Program to demonstration the implementation of various operations on a circular queue
represented using a linear array.
UNIT-III
14. Program to demonstrate the implementation of various operations on a queue represented
using a linear linked list (linked queue).
15. Program to illustrate the implementation of different operations on a binary search tree.
16. Program to sort an array of integers in ascending order using heap sort.
17. Program to illustrate the traversal of graph using breadth-first search.
18. Program to illustrate the traversal of graph using depth-first search.

Java Programming Lab L T P C

Subject Code Common to all Specializations of CSE 2nd 0 0 4 2
CSP-279/ITP-279 Year
Prerequisite: Studied C/C++ in previous semesters
Marks-100
Course Objectives
 To implement programs in java.
 To enable students to retrieve and update data from relational databases using JDBC.

The students will learn to write, compiling & execute basic java program.
I. The student will learn the use of data types & variables, decision control structures: if,
nested if etc.
II. The student will learn the use loop control structures: do, while, for etc.
III. The student will be able to create classes and objects and use them in their program.
List of Experiments
UNIT-I
1. Write a program to study different types of constructors in java
2. Write a program to create classes and use of different types of methods.
3. Program to learn different types of inheritance in java.
4. Write program to study access modifiers in java using packages.
UNIT-II
5. Write program to differentiate between method overloading and method overriding.
6. Create an interface and design a class to implement an interface.
7. Write a program to read and write data to a file.

UNIT-III
8. Write a program to read and write an object to file.
9. Write a program to handle an exception using try, catch and throw.
10. Write a program to insert values in a table at run time using JDBC.

ENGINEERING MATHEMATICS L T P C
Total contact hours : 45 3 1 0 MNG
Applicable to all branches of Engineering
SMY-222 LEET (3rd semester)
(Mandatory Non Graded Course )
Prerequisite: Knowledge of mathematics
up to senior secondary level.
Marks
Internal (40) External (60)
PURPOSE
To impart analytical ability in solving mathematical problems as applied to the respective
branches of Engineering
Unit INSTRUCTIONAL OBJECTIVES
To have knowledge in linear algebra and infinite series.
1.
To improve their ability of computation in matrices and complex nos.
To familiarize students with partial differentiation.
2.
To enable the students to apply the notions practically.
3. To have knowledge Multiple Integral And Vector Calculus
UNIT-I [15 H]
BASIC ALGEBRA
Matrices: Rank of matrix; elementary operations; reduction to normal form; consistency and
solution of homogenous and non-homogeneous simultaneous equations
Complex Numbers: De-Moivre’s theorem, applications of De-Moivre’s theorem ; Exponential
function; logarithmic function ; circular function
Infinite Series: Convergence and divergence of series; tests of convergence (without proofs),
comparison test; ratio test and Gauss test; convergence and absolute convergence of
alternating series.
UNIT-II [15 H]
ORDINARY DIFFERENTIAL EQUATIONS & PARTIAL DIFFERENTIATION
Partial Differentiation: Review of basic differentiation, Definition of Partial Differentiation,

Function of two or more variables; homogeneous function; Euler’s theorem.

Differential equations: Ordinary Differential Equation, Exact differential equations, Variable

Separable method to solve ODE .
UNIT-III [15 H]
MULTIPLE INTEGRAL AND VECTOR CALCULUS
Double and Triple Integration: Review of basic of integration, Double and triple Integration;
Vector Calculus : Scalar and vector fields; differentiation and integration of vectors ; vector
differential operators: del, gradient, divergence, curl , properties; Statement of Gauss, Green
and Stoke's theorem.
TEXT BOOKS
1. Grewal, B.S., Higher Engineering Mathematics, Khanna Publishers, New Delhi, 42 th ed.2013
REFERENCE MATERIAL:
1. Kreyszig , E., Advanced Engineering Mathematics, John Wiley,10th Ed.2011.
2. Ray Wylie, C., Advanced Engineering Mathematics, 6th ed., McGraw Hill.
3. Jain, R.K. and lyengar, S.R.K., Advanced Engineering Mathematics, 3rd Edition.
Narosa Publishing House, New Delhi,2004.
4. Ramana , B.V Advanced Engineering Mathematics, McGraw Hill, July 2006.

Batch 2018 3rd Semester CSE

Uploaded by

Document Information

Original Description:

Original Title

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

Batch 2018 3rd Semester CSE

Uploaded by

Copyright:

Available Formats

Department of Computer Science & Engineering

Scheme Applicable to BE CSE Batch 2018 onwards

4 Data structure CST-231 DC 3 0 0 - 3

5 Discrete Mathematics SMT-221 BS 3 1 0 - 4

6 Software Engineering CST-220 DC 3 0 0 - 3

7 Software Engineering Lab CSP-207 DC 0 0 2 - 1

8 Java Programming Lab CSP-279 DC 0 0 4 - 2

9 Data Structure Lab CSP-232 DC 0 0 4 - 2

1 Entrepreneurship UCW-249 MNG 0 0 0 2 1

Scheme Applicable to BE CSE Batch 2018 onwards

Scheme Applicable to BE CSE Batch 2018 onwards

Chandigarh University, Gharuan

Contents of the Syllabus

Introduction to Management: Nature of Management, Importance of Management, Concepts

Scheme Applicable to BE CSE Batch 2018 onwards

Scheme Applicable to BE CSE Batch 2018 onwards

Chandigarh University, Gharuan

Computer Organization and Architecture L T P C

 To familiarize students with the architecture of a processor.

Understand the operation of electronic logic elements

I. Understand the organization of a computer system in terms of its main components

Contents of the Syllabus

Scheme Applicable to BE CSE Batch 2018 onwards

Introduction to Parallel Processing- Parallelism in uniprocessor system, Flynn’s Classification,

Scheme Applicable to BE CSE Batch 2018 onwards

Chandigarh University, Gharuan

The content of the Syllabus

Scheme Applicable to BE CSE Batch 2018 onwards

Combinatorial Mathematics: Techniques of counting, rule of sum, rule of product

Scheme Applicable to BE CSE Batch 2018 onwards

Chandigarh University, Gharuan

 To understand the concept of the data structures and operations on them,

Understand the properties of various data structures.

analyze and compare the efficiency of algorithms

Contents of the Syllabus

Scheme Applicable to BE CSE Batch 2018 onwards

Scheme Applicable to BE CSE Batch 2018 onwards

CHANDIGARH UNIVERSITY, GHARUAN

Subject Code Software Engineering L T P C

CST-220//ITT- Total Contact Hours : 45Hours

Prerequisite: Studied Project Basics in Institutional Training

 To study and learn various methods of software engineering.

Unit Course Outcomes

 Selection and implementation of different software development process models

 Defining the basic concepts and importance of Software project management

 Analyzing software risks and risk management strategies

Contents of the Syllabus

Introduction: Definition of software and Software engineering, Difference between Program

Scheme Applicable to BE CSE Batch 2018 onwards

Software requirement: Requirement Analysis, Analysis principle, Software prototyping

UNIT –II [15h]

Software Project management: Software project planning, Project estimation techniques,

Software Maintenance and Reuse: Definition, Types of maintenance, Software reverse

Text & Reference Books:

1. Pressman Rogers, “Software Engineering: A Practitioner's Approach”, Sixth edition.

Scheme Applicable to BE CSE Batch 2018 onwards

CHANDIGARH UNIVERSITY, GHARUAN

Software Engineering Lab L T P C

 To understand the various phases of software development.

Unit Course Outcomes

 To study and draw different level DFD and charts.

Scheme Applicable to BE CSE Batch 2018 onwards