Вы находитесь на странице: 1из 155

Computer Science & Engineering

2012-13

SCHEME OF STUDY &


SYLLABI
BE CSE
Batch 2012 Regular
& 2013LEET

UNIVERSITY INSTITUTE OF
ENGINEERING(UIE)
www.cuchd.in

Version 1.1, Page 1 of 155

Computer Science & Engineering

2012-13

1st Semester Scheme


Chemistry Group
(ECE, EEE, EE, CIVIL)
Subject
Subject
L T
code
Applied
AMT4 2
Mathematics - I
101
Applied
ACT3 0
Chemistry
102
Environmental
Science and
EVT3 0
Disaster
104
Management

Cr.

Physics Group
(ME, CSE, CCE)
Subject
Subject
L T
code
Applied
AMT4
2
Mathematics - I
101
APTApplied Physics
3
1
109

Cr.

3.5

Professional
Communication
Skills

PCT111

EET113

Basics of
Computer and
Programming in
C

CST105

4.5

Basics Electrical
and Electronics
Engineering

Basics of
Mechanical
Engineering

MET107

3.5

Engineering
Drawing

MET115

2.5

Applied
Chemistry Lab

ACP103

Applied Physics
Lab

APP110

Basics of
Computer and
Programming in
C Lab

CSP106

Professional
Communication
Skill Lab

PCP112

1.5

Workshop
Practice

MEP108

1.5

Basics Electrical
and Electronics
Engineering Lab

EEP114

Computer
Graphic Lab

MEP116

1.5

Class counseling

Total

14

13

22

Class counseling

Total

17

23.5

Version 1.1, Page 2 of 155

Computer Science & Engineering

2012-13

2nd Semester Scheme


Chemistry Group
(ME, CSE,CCE)
Subject
Subject
L T
code
Applied
ACT3
0
Chemistry
102
Environmental
Science and
EVT3
0
Disaster
104
Management

Physics Group
(ECE, EEE, EE, CIVIL )
Subject
Subject
L T
code
APTApplied Physics
3
1
109

Cr.

3.5

Professional
Communication
Skills

PCT111

EET113

Cr.

Basics of
Computer and
Programming in
C

CST105

4.5

Basics Electrical
and Electronics
Engineering

Basics of
Mechanical
Engineering

MET107

3.5

Engineering
Drawing

MET115

2.5

Applied
Mathematics - II

AMT121

Applied
Mathematics - II

AMT121

Applied
Chemistry Lab

ACP103

Applied Physics
Lab

APP110

Basics of
Computer and
Programming in
C Lab

CSP106

Professional
Communication
Skill Lab

PCP112

1.5

Workshop
Practice

MEP108

EEP114

MEP116

1.5

Class counseling

Total

14

13

22

Class counseling

Total

1.5

Basics Electrical
and Electronics
Engineering Lab

Computer
Graphic Lab

17

23.5

Version 1.1, Page 3 of 155

Computer Science & Engineering

2012-13

3rd Semester Scheme


SUBJECT
CODE

SUBJECT NAME

CST-201

S.NO

Hours Per
Week

Marks

Credits

ANALOG AND DIGITAL


ELECTRONICS

40

60

100

3.5

CST-202

COMPUTER
ORGANIZATION &
ARCHITECTURE

40

60

100

CST-203

DATA STRUCTURES

40

60

100

CST-204

DISCRETE
MATHEMATICS

40

60

100

3.5

CST-205

OBJECT ORIENTED
PROGRAMMING

40

60

100

CSP-206

ANALOG AND DIGITAL


ELECTRONICS LAB

60

40

100

CSP-207

DATA STRUCTURES
LAB

60

40

100

CSP-208

OBJECT ORIENTED
PROGRAMMING LAB

60

40

100

CSP-209

SEMINAR

100

100

10

HUP-201

PROFESSIONAL
COMMUNICATION
SKILLS LAB

60

40

100

11

CSP-210

INSTITUTIONAL
PRACTICAL TRAINING

60

40

100

TOTAL

15

18

600

500

1100

27

INT EXT Total

Version 1.1, Page 4 of 155

Computer Science & Engineering

2012-13

4th Semester Scheme


SUBJECT
CODE

SUBJECT NAME

S.NO

Hours Per
Week

Marks

Credits

INT EXT Total

CST-221

NUMERICAL &
STATISTICAL
TECHNIQUES

40

60

100

3.5

CST-222

MICRO PROCESSORS &


INTERFACING

40

60

100

3.5

CST-223

DIGITAL
COMMUNICATION &
COMPUTER NETWORK

40

60

100

CST-224

OPERATING SYSTEM

40

60

100

CST-225

WEB TECHNOLOGIES

40

60

100

CSP-226

MICRO PROCESSORS &


INTERFACING LAB

60

40

100

CSP-227

NETWORK &
OPERATING SYSTEM
LAB

60

40

100

CSP-228

WEB TECHNOLOGIES
LAB

60

40

100

CSP-229

SEMINAR

100

100

10

HUP- 221

PROGRAMMING
APPTITUDE

TOTAL

15

14

480

420

900

23

Note: Students will undergo 6 weeks vocational training after 4th semester. Students are required
to submit one minor project.

Version 1.1, Page 5 of 155

Computer Science & Engineering

2012-13

5th Semester Scheme


SUBJECT
CODE

SUBJECT NAME

S.NO

Hours Per
Week

Marks

Credits

INT EXT Total

CST-301

DESIGN AND
ANALYSIS OF
ALGORITHMS

40

60

100

3.5

CST-302

SOFTWARE
ENGINEERING

40

60

100

3.5

CST-303

SIMULATION AND
MODELING

40

60

100

CST-304

RELATIONAL
DATABASE
MANAGEMENT
SYSTEMS

40

60

100

3.5

CST-305

WIRELESS NETWORKS

40

60

100

CSP-306

SIMULATION AND
MODELING LAB

60

40

100

CSP-307

SOFTWARE
ENGINEERING LAB

60

40

100

CSP-308

RELATIONAL
DATABASE
MANAGEMENT
SYSTEMS LAB

60

40

100

CSP-309

INDUSTRIAL
TRAINING I

60

40

100

10

CSP-310

SEMINAR

100

100

11

HUP- 301

SOFT SKILLS

60

40

100

TOTAL

15

18

600

500

1100

27.5

Version 1.1, Page 6 of 155

Computer Science & Engineering

2012-13

6th Semester Scheme


SUBJECT
S.NO
CODE

SUBJECT NAME

Hours Per
Week
L

Marks

Credits

INT EXT Total

CST-321

THEORY OF
COMPUTATION

40

60

100

3.5

CST-322

SOFTWARE PROJECT
MANAGEMENT

40

60

100

CST-323

COMPUTER GRAPHICS

40

60

100

3.5

HUT-324

ENGINEERING
ECONOMICS &
PRINCIPLES OF
MANAGEMENT

40

60

100

CSTXXX

ELECTIVE I

40

60

100

3.5

CSP-325

COMPUTER GRAPHICS
LAB

60

40

100

CSP-326

SOFTWARE PROJECT
MANAGEMENT LAB

60

40

100

CSPXXX

ELECTIVE- I LAB

60

40

100

CSP-327

SEMINAR

100

100

10

HUP-322

APTITUDE SKILLS

60

40

100

TOTAL

15

12

540

460

1000

22.5

Note: Students will undergo 6 weeks vocational training after 6th semester. Students are required
to submit one project.

Version 1.1, Page 7 of 155

Computer Science & Engineering

2012-13

6th Semester Elective


S.NO.

SUBJECT
CODE

SUBJECT NAME

CST-331 and
CSP-334

SOFTWARE TESTING & QUALITY ASSURANCE AND


SOFTWARE TESTING & QUALITY ASSURANCE LAB

CST-332 and
CSP-335

LINUX PROGRAMMING AND LINUX PROGRAMMING LAB

CST-333 and
CSP-336

OBJECT ORIENTED SOFTWARE ENGINEERING AND


OBJECT ORIENTED SOFTWARE ENGINEERING LAB

CST-334 and
CSP-337

ENTERPRISE INTEGRATION AND ENTERPRISE


INTEGRATION LAB

CST-335 and
CSP-338

ADVANCED PROGRAMMING AND ADVANCED


PROGRAMMING LAB

Version 1.1, Page 8 of 155

Computer Science & Engineering

2012-13

7th Semester Scheme


SUBJECT
CODE

S.NO

SUBJECT NAME

Hours Per
Week
L

Marks

Credits

INT EXT Total

CST-401

SYSTEM SOFTWARE

40

60

100

CST-403

ARTIFICIAL
INTELLIGENCE

40

60

100

CST-404

SECURITY &
CRYPTOGRAPHY

40

60

100

3.5

XXXXXX

OPEN ELECTIVE

40

60

100

3.5

CST-405

COMPILER DESIGN

40

60

100

3.5

CSP-405

ARTIFICIAL
INTELLIGENCE LAB

60

40

100

CSP-406

MINOR PROJECT LAB

60

40

100

CSP-408

SEMINAR

100

100

CSP-409

INDUSTRIAL TRAINING II

60

40

100

TOTAL

15

16

480

420

900

28.5

S.NO.

7th Semester Open Elective


SUBJECT CODE
SUBJECT NAME

CSO-441

Cyber Laws and Security

CSO-442

Software Engineering Methodologies

CSO-443

E-Banking & Commerce

CSO-444

Enterprise Resource Planning

Version 1.1, Page 9 of 155

Computer Science & Engineering

2012-13

8th Semester Scheme


SUBJECT
CODE

SUBJECT NAME

CST-421

S.NO

Hours Per
Week

Marks

Credits

DIGITAL IMAGE
PROCESSING

40

60

100

3.5

CST-422

BUSINESS
INTELLIGENCE &
ANALYSIS

40

60

100

CST-423

SOFT COMPUTING

40

60

100

3.5

CST-XXX

ELECTIVE-II

40

60

100

CSP-424

DIGITAL IMAGE
PROCESSING LAB

60

40

100

CSP-425

SOFT COMPUTING
LAB

60

40

100

CSP-426

MAJOR PROJECT LAB

60

40

100

CSP-427

SEMINAR

100

100

TOTAL

12

14

440

360

800

22

INT EXT Total

8th Semester Elective-II


S.NO.

SUBJECT CODE

SUBJECT NAME

CST-431

EMBEDDED SYSTEMS

CST-432

ADVANCED DBMS

CST-433

MOBILE APPLICATION DEVELOPMENT

CST-434

BIOINFORMATICS

CST-435

CLOUD COMPUTING

Version 1.1, Page 10 of 155

Computer Science & Engineering

2012-13

CHANDIGARH UNIVERSITY
GHARUAN

Scheme & Syllabus of B.E.


Computer Science & Engineering [CSE]
1st & 2nd Semester

Version 1.1, Page 11 of 155

Computer Science & Engineering

2012-13

CHANDIGARH UNIVERSITY, GHARUAN


APPLIED MATHEMATICS-I
(AMT-101)
L
4

T P
2 0

Credits
5

Total Hours: 60 Hrs.


Course Objective:
(1) To enhance students knowledge in mathematics and co- relate to engineering situations.
(2) To provide students with the mathematical knowledge and skills that are needed to
support their concurrent and subsequent engineering studies.
(3) To lay a foundation for further studies in Engineering Mathematics.
Unit-I

(20 Hrs.)

Matrices: Matrices, Types of Matrices: Orthogonal Matrices, Unitary Matrices, Hermitian


Matrices, Similar Matrices, Rank of matrices, Elementary transformation, Reduction to normal
form, Consistency and solution of homogenous and non homogeneous algebraic equations,
Linear transformations, Orthogonal transformations, Eigen values & Eigen Vectors, Linear
dependence and independence of vectors, Cayley Hamilton Theorem(without proof), Reduction
to diagonal form.
Unit-II

(20 Hrs.)

Partial Differentiation: Function of two or more variables, Homogeneous function, Eulers


theorem, Composite functions, Implicit functions, Total derivatives, Change of variable,
Jacobians.
Application of partial Differentiation: Tangent & Normal to the surface, Taylors and
Maclaurins series for a function of two variables, Errors and Approximations, maxima and
minima of functions of several variables, Lagranges method of undetermined multipliers.
Unit-III

(20 Hrs.)

Ordinary Differential Equations: Exact Differential equations, Equations reducible to exact


form by integrating factors, Equations of the first order and higher degree, Clairauts equation

Version 1.1, Page 12 of 155

Computer Science & Engineering

2012-13

Linear Differential Equations: Leibnizs linear differential equation and Bernoullis


differential equation, Methods of finding Complete Solutions: complementary functions ,
particular integrals, Method of variation of parameters to find the particular integrals, Linear
Differential Equation with variable coefficient : Cauchys homogeneous linear equation,
Legendres linear equation, Simultaneous linear equations
with constant coefficients,
Applications Linear Differential Equations in: Electric/electronic L-R-C circuits , Simple
harmonic motion
Text Books:
1. Kreyszig , E., Advanced Engineering Mathematics, John Wiley,10th Ed.(2011).
2. Grewal, B.S., Higher Engineering Mathematics, Khanna Publishers, New Delhi,40th ed.
(2012).
Reference Books:
1. Ray Wylie, C., Advanced Engineering Mathematics, 6th ed., McGraw Hill.
2. Jain, R.K. and lyengar, S.R.K., Advanced Engineering Mathematics, Narosa Publishing
House, New
Delhi, (2004).
3. Ramana , B.V Advanced Engineering Mathematics, McGraw Hill, July (2006).
Instructions for the Paper-Setter:
Please go through these instructions thoroughly and follow the same pattern while setting the
paper as the students have been prepared according to this format.
Maximum Marks = 60

Time: 3 Hrs

Weightage per unit = 20 marks (excluding over attempt weightage)


Weightage :

Analytical Part = 90%


Conceptual Questions=10%

The syllabus has been divided into three equal units. The paper setter is required to set ten
questions in all, three questions from each unit and a compulsory question consisting of five sub
parts and based on the whole syllabus. The candidate will be required to attempt six questions
including the compulsory question number no 1 and not more than two questions from each unit.

Version 1.1, Page 13 of 155

Computer Science & Engineering

2012-13

CHANDIGARH UNIVERSITY, GHARUAN


APPLIED CHEMISTRY
(ACT-102)
L- T- P
3- 0 - 0

Credits
3

Total Hours: 45 Hrs.


Course Objectives:
1) To acquaint the students with the relevance of chemistry in core engineering.
2) To make the students familiar with the latest breakthroughs and developments related to
engineering chemistry.
3) To enhance the scientific and logical approach of the students towards the new
technologies.
Unit-I
(15 Hrs.)
Fuels: Classification of fuels, Characteristics of good fuel, Calorific value of a fuel, Coal,
Classification of Coal Proximate analysis of coal, Ultimate analysis of coal, Quality of PetrolOctane Number, Quality of Diesel-Cetane Number, Comparison of Solid, Liquid and gaseous
fuels.
Lubricants: Lubricants, its Classification, Properties of Lubricants-Viscosity, Oiliness, Flash
and Fire Point, Cloud and Pour Point, Saponification Number and Aniline Number, Selection of
a Lubricant
Polymers: Polymerization, Degree of Polymerization, Classification of polymers, Determination
of Number Average and Mass Average Molecular Weight, Polymer Reinforced Composites.
Unit-II

(15 Hrs.)

Water: Types of impurities in water, Hard water and Soft water, Types of Hardness and units of
measuring hardness, Softening Methods:- Lime Soda Process, Zeolite Process, Ion-exchange
resin method and EDTA method, Scale and Sludge formation , Caustic embrittlement and Boiler
Corrosion, Desalination of sea water
Spectroscopy and its application: Definition, EM Spectrum, Absorption and Emission Spectra,
UV Visible Spectroscopy: Principle and Instrumentation, Electronic Transitions, Franck Condon
Principle,Applications, IR Spectroscopy: Principle, Fundamental modes of Vibrations and
Types, Factors affecting vibrational frequency, Applications

Version 1.1, Page 14 of 155

Computer Science & Engineering

Unit-III

2012-13

(15 Hrs.)

Photochemistry: Types of Photochemical reactions, Beer Lamberts Law and laws of


photochemistry, Quantum Yield , Primary and Secondary Photochemical Reactions, Jablonski
Diagram, Semiconductors in Photochemistry Photovoltaic Cell and Optical sensors.
Corrosion :Definition, Cause of Corrosion, Dry Corrosion, Pilling Bed worth Rule, Wet
Corrosion and its types, Factors affecting Corrosion, Protective measures against corrosion
Electrochemistry: Electrolytic & electrochemical cells, Electrochemical series, Cell potential or
EMF of a cell, Nernst equation & its applications, Cell concentration, Varieties of cells, Over
voltage
Textbooks:
1. Jain & Jain, Engineering Chemistry, DhanpatRai and Sons, New Delhi, (2009).
2. Oberoi S. Malik M. Engineering Chemistry Cengage Learning (2012)
Reference Books:
1. Siva Sankar B., Engineering Chemistry, Tata McGraw-Hill, New Delhi (2009).
2. Dara S.S. ,Umare S.S. ,A text book of Engineering Chemistry, S.Chand & Company, New
Delhi (2007)
3. Senapati, M., Advanced ., Engineering Chemistry, Firewale Media Infinity Science Press
LLC, (Ed.2010)
4. RathP., Engineering Chemistry CENGAGE Learning (2012)
5. Oberoi, S. Malik M. Engineering Chemistry CENGAGE Learning (2012)
6 . Jain & Jain, Engineering Chemistry, Dhanpat Rai& Sons, New Delhi (2011)
Instructions for the Paper-Setter:
Please go through these instructions thoroughly and follow the same pattern while setting the
paper as the students have been prepared according to this format.
Maximum Marks = 60
Weightage per unit = 20 marks (excluding over attempt weightage)
Weightage : Numerical Part = 10%
Conceptual Questions=30%
Diagrammatic Questions=20%
Explanatory Questions= 40%
The syllabus has been divided into three equal units. The paper setter is required to set Ten
questions in all, three questions from each unit and a compulsory question consisting of five sub
parts and based on the whole syllabus. The candidate will be required to attempt six questions
including the compulsory question number no 1 and not more than two questions from each unit.
Version 1.1, Page 15 of 155

Computer Science & Engineering

2012-13

CHANDIGARH UNIVERSITY, GHARUAN


ENVIRONMENT SCIENCE & DISASTER MANAGEMENT
(EVT-104)
L-T-P Credits
3-0-0
3
Total Hours: 45 Hrs.
Course Objectives:
(1) To acquaint the students with the forces shaping our planet and develop the feeling
of concern for environment.
(2) To develop critical thinking on management of resources.
(3) To encourage active participation of students in bringing out solution to various
environmental problems.
Unit-I
(15 Hrs.)
Introduction: Definition, Scope and Importance , Need for Public Awareness.
Ecosystems: Concept of Ecosystem , Structure, interrelationship, Producers ,consumers and
decomposers ,Ecological pyramids-biodiversity and importance, Hot spots of biodiversity.
Environmental Pollution: Definition, Causes, effects and control measures of air pollution,
Water pollution, Soil pollution, Marine pollution, Noise pollution, Thermal pollution, Nuclear
hazards, Solid waste Management: Causes, effects and control, Measure of urban and industrial
wastes, Role of an individual in prevention of Pollution, case studies.
Unit-II

(15 Hrs.)

Social Issues and the Environment: From Unsustainable to Sustainable development, Urban
problems related to energy, Water conservation, rain water harvesting, watershed management.
Resettlement and rehabilitation of people, its problems and concerns. Case studies,
Environmental ethics: Issues and possible solutions, Climate change, global warming, acid rain,
ozone layer depletion, Nuclear accidents and holocaust, Case studies, Wasteland reclamation,
Consumerism and waste products, Environment Protection Act, Air (Prevention and Control of
Pollution) Act, Water (Prevention and control of pollution) Act, Wildlife Protection Act, Forest
Conservation Act, Issues involved in enforcement of environmental legislation, Public
awareness.
Natural Resources: Natural Resources and associated problems, Over exploitation , Case
Studies of forest resources and water resources
Version 1.1, Page 16 of 155

Computer Science & Engineering

Unit-III

2012-13

(15 Hrs.)

Human Population and the Environment: Population growth, variation among nations.
Population explosion Family Welfare Programme, Environment and human health, Human
Rights, Value Education, HIV/AIDS, Women and child Welfare, Role of Information
Technology in Environment and human health, Case studies.
Disaster management: Definition, types of disasters, Floods, Earthquakes, Cyclones and
landslides, preventive measures, case studies.
Text books:
1. Joseph Benny ,Environmental studies , Tata Mc Graw Hill Education Private Limited , New
Delhi, (2006)
2. Ahluwalia V.K &Malhotra Sunita ,Environmental Science, Ane Books India, (2009).
Reference books :
1. Bhasin, S.K &KaurVerinder, Introductory environmental studies, Ajay Publications, (2012).
2. Ahluwalia, V.K ,Environmental chemistry , Ane Books India, (2010).
3. Chhatwal Johar Rajni ,Environmental Sciences ,UDH Publishers & Distributors (P) Ltd,
(2009).
4. Rana, S.V.S , Essentials Of Ecology and Environment science ,PHI Learning Private
Limited, (2009).
Instructions for the Paper-Setter:
Please go through these instructions thoroughly and follow the same pattern while setting the
paper as the students have been prepared according to this format.
Maximum Marks = 60

Time: 3 Hrs

Weightage per unit = 20 marks (excluding over attempt weightage)


Weightage :

Conceptual Questions =10%


Diagrammatic Questions=20%
Explanatory Questions= 70%

The syllabus has been divided into three equal units. The paper setter is required to set Ten
questions in all, three questions from each unit and a compulsory question consisting of five sub
parts and based on the whole syllabus. The candidate will be required to attempt six questions
including the compulsory question number no 1 and not more than two questions from each unit.

Version 1.1, Page 17 of 155

Computer Science & Engineering

2012-13

CHANDIGARH UNIVERSITY, GHARUAN


BASICS OF COMPUTERS & PROGRAMMING IN C
(CST-105)
L
4

T P Credits
1 0
4.5

Total hours: 60 Hrs.


Course Objectives:
Familiarize with Computer Hardware & Software.
Identify basic computer operations.
Define operating systems and their functions.
Develop the programs in C
Unit I

(20 Hrs.)

Introduction: Definition, Classification and generation of computers, Applications of


computers, Block diagram and working of a computer system, Different Peripheral devices,
Main storage and auxiliary storage devices, Computer hardware and software.
Working knowledge of a computer system: Introduction to operating systems, Functions of
operating systems, Features of DOS and WINDOWS, Introduction to internet, Features and
applications.
Problem solving and program development: Meaning of a problem and problem solving.
Programming and its need, steps in program development, Program design tools: Algorithms,
Flowcharts and Pseudo code, Brief introduction about various type of languages, Translators and
their needs, Definition of Compiler, Interpreter and assemblers.
Unit II

(20 Hrs.)

C Programming Basics : Structure of a C program, Basic constructs : preprocessor directives,


Header files, character set, Keywords, identifiers, variables, constants, Data types and their
storage, Compilation process.
Operators,
expressions
and
I/O: Arithmetic,
Relational,
Logical,
Bitwise,
Increment/Decrement operators, Expressions, conditional expressions, Assignment operators
,Type conversions, Precedence and order of evaluation, Basic input output, Formatted I/O.
Control Flow: Statements and blocks, conditional statements: IF, ELSE-IF, Switch case
statements, Control loops: For, while and do-while, Jumping Statements: break, continue & goto.
Version 1.1, Page 18 of 155

Computer Science & Engineering

2012-13

Functions: Basic concepts, structure of a function, Function types, Declaring and defining
functions, Returning values from functions, Arguments: formal and actual arguments, Concept of
pointer, Passing arguments to functions: call by value and call by reference, Library functions,
recursion, need of recursion, inline functions, Storage classes.
Unit III

(20 Hrs.)

Arrays and strings: Declaring an array, Initializing arrays, Accessing the array elements,
Passing arrays as arguments to functions, Working with multidimensional arrays, Strings:
declaration and initialization, String handling functions, Passing strings to a function.
Structures and Union: Declaring and initializing a structure, Accessing the members of a
structure, Nested structures, Array of structures, Using structures in functions, Declaring and
initializing a union, Difference between a structure and a union.
File Handling: File Streams, Opening /Closing of File, Read/Write operations on file.
Text Books:
1.
2.
3.

Kernighan &Ritchie, The C Language, Pearson Publications.


Balagurusamy E., Programming in ANSI C, McGraw Hill Publications.
Sanders, D.H., Computers Today, McGraw Hill Publications

Reference Books:
1. KanetkarYashwant, let us C , BPB Publications
2. Sinha P.K., SinhaPriti, Computer Fundamentals BPB Publications
Instruction for paper setter:
The Syllabus has been divided into three equal units. The paper setter is required to set the ten
questions in all, three questions from each unit and a compulsory question consisting of five sub
parts and based on the whole syllabus. The candidate will required to attempt six questions
including the compulsory question no.1 and not more than two questions from each unit.

Version 1.1, Page 19 of 155

Computer Science & Engineering

2012-13

CHANDIGARH UNIVERSITY, GHARUAN


BASICS OF MECHANICAL ENGINEERING
(MET-107)
L-T
-P Credits
3-1-0
3.5
Total Hours: 45 Hrs.
Objectives of the course:
(1) To introduce the student to the fundamentals of Mechanical Engineering, so that they get
a sound knowledge of the important aspects of Mechanical Engineering.
(2) To share the knowledge related to Energy and its sources with emphasis on energy
conversion and transmission of Mechanical Energy.
(3) To know about various applications of mechanical power which play an important role in
industries as well as in our day-to-day life.
(4) To give introduction about the various concepts of mechanical engineering like Thermal,
Design and Manufacturing

Unit I

(15 Hrs.)

Basic Concept of Thermodynamics: Thermodynamics system and surroundings, State


properties, processes and cycles, Thermodynamic equilibrium, Heat and work transfer across
boundary, Quasi-static process, Zeroth law and concept of thermal equilibrium.
First Law of Thermodynamics: Joule's Experiments for cycle process, Internal energy as a
property; First law for a closed system undergoing a cycle and undergoing a change of state,
Enthalpy; free expansion process; first law applied to various non-flow/flow processes,
Representation of various processes on P-V and T-S diagram; Steady flow energy Equation;
Application of Steady flow energy equation to various engineering devices; Throttling Process
Unit II

(15 Hrs.)

Second Law of Thermodynamics: Limitation of 1st Law, Heat Engine; Refrigerator; Heat
Pump; Efficiency & COP; Statements of Second law, Kelvin plank and clausius statement and
their equivalence; PMM2; Carnot Cycle; Carnot Theorem; Entropy; Entropy as Property of
system; Clausius Inequality
I. C. Engines: Introduction of IC engine as a power developing device; Working principle of
Version 1.1, Page 20 of 155

Computer Science & Engineering

2012-13

two and four stroke engines, difference between petrol and diesel engines, brief introduction to
MPFI and CRDI systems;
Unit III

(15 Hrs.)

Mechanics of Solid: Mechanical Properties of engineering materials like tension, compression,


elasticity, hardness, toughness, fatigue & creep; Stresses; Types of stresses, Strain; Longitudinal
& lateral strains; Poisson's Ratio; Concept of Stress Strain Diagram with various salient points;
Elastic Constants and their relationship
Machine Elements: Machine, Mechanisms and their concept; Definition of element, link,
kinematic chain, Mechanism, Inversions (Inversions of Four bar chain only) Concept of Basic
machines, Reversibility of lifting Machine, Law of Lifting Machines
Text Books :
1. Nag P. K., Engineering Thermodynamics, Tata McGraw Hill Publication
2. Singhal B.L, Elements of Mechanical Engineering ,TechMax Publishers
3. Bansal R.K. Strength of Materials ,S. Chand & Sons
4. Khurmi R.S. ,Theory of Machines , S. Chand & Sons
5. Singh Kirpal, Automobile Engineering ,Strandard Publishers, Delhi

Instructions for the Paper-Setter:

Please go through these instructions thoroughly and follow the same pattern while setting
the paper as the students have been prepared according to this format.

Maximum Marks = 60

Weightage per unit = 20 marks (excluding over attempt weightage)

Time: 3 Hrs

The syllabus has been divided into three equal units. The paper setter is required to set Ten
questions in all, three questions from each unit and a compulsory question consisting of five sub
parts and based on the whole syllabus. The candidate will be required to attempt six questions
including the compulsory question number no 1 and not more than two questions from each unit.

Version 1.1, Page 21 of 155

Computer Science & Engineering

2012-13

CHANDIGARH UNIVERSITY, GHARUAN


APPLIED CHEMISTRY LAB
(ACP-103)
L T
P Credits
0 0
2
1
Total Hours: 30 Hours.
Unit-I
(10 Hrs.)
1. To estimate the amount of moisture in the given coal sample gravimetrically
2. To determine viscosity of the given lubricants by Ostwalds Viscometer
3. To determine Flash point and Fire point of the given lubricant.
4. To Prepare Urea-formaldehyde resin.
Unit II

(10 Hrs.)

5. Determination of the hardness of given hard water sample by EDTA method. Provided
standard hard water.
6. Determination of the amount of residual chlorine present in the given water sample.
7. To determine the acid number and Base number of given water sample
Unit-III

(10 Hrs.)

8. To determine -max by spectrophotometer and determination of unknown concentration


of binary mixture of liquids.
9. To determine the concentration of a solution conductometrically.
10. To determine the surface tension of given liquid using stalagamometer by drop number
method.
Textbooks:
1. Applied Chemistry by Dr. S.K. Bhasin (Ajay Publishers)
2. Engineering Chemistry by R. P. S. Grewal (Kalyani Publishers)
3. Vogels Practical Chemistry
Reference books:
1. Jain & Jain, Engineering Chemistry, DhanpatRai& Sons, New Delhi
2. S. C. Ahuja, Applied Chemistry II, Eagle Prakashan, Jalandhar
Version 1.1, Page 22 of 155

Computer Science & Engineering

2012-13

CHANDIGARH UNIVERSITY, GHARUAN


BASICS OF COMPUTERS AND PROGRAMMING IN C LAB
(CSP-106)
L
0

0 4

Credit

Total Hours: 60 Hrs.

Unit-1

(20 Hrs.)

1. Introduction & demonstration of various components of computer.


2. Introduction to windows: user interface, icon, folder and its features, Installing window7,
features and various settings in windows. Navigation with drives. Creating and sharing
of folders, moving files into folders.
3. Introduction to internet: creating email accounts, sending & receiving e-mails, search
engines. Surfing and downloading from internet.
4. Microsoft-word basics opening document, saving and closing, text creation and editing,
concept of headers & footers, use of formatting features, working with tables.
5. Create a resume using ms-word.
6. Letter writing in Word processor.
7. To understand the mail-merge and to use mail merge feature of MS-Word
8. Ms-excel: basics, elements of electronic spread sheet, manipulation of cells. Providing
formulas, using spread sheets for small accountings, insertion/deletion of columns/rows,
creation of various charts. Import & export of data.
9. Create a spread sheet consisting of total marks of student in different subjects and
calculate the percentage for same.
10. Ms-PowerPoint: basics, creating presentation, preparation of slides and slide show, slide
manipulation, use of design templates, adding pictures/clip art, diagram, tables & charts
in slides, set of animations.
11. Create a power point presentation on any topic.
Unit II

(20 Hrs.)

12. Write a program to print a message on screen.


13. Wap to find that given number is even or odd.
14. Wap to find the greatest among 3 numbers using if else statement.
15. Wap to add, subtract, multiply, divide using switch statement.
16. Wap to print pyramid for different patterns using for loop.
Version 1.1, Page 23 of 155

Computer Science & Engineering

2012-13

17. Wap to print the table of a given number using while/ do while loop.
18. Wap to print the factorial of a no.
19. Wap to check whether a given number is palindrome or not.
20. Wap to list the prime numbers upto n no.
21. Wap to find the nature of the roots as well as value of the roots .however, in case of
imaginary roots, find the real part separately.
22. Wap to print the Fibonacci series a) by using function b) by using recursion.
23. Wap to find the greatest common divisor from given 2 numbers by using recursion.
24. To find the area of a triangle using function.
25. Wap to swap two numbers using call by value & call by reference.
26. Wap to find the area of a circle using call by value & call by reference.
Unit III

(20 Hrs.)

27. Wap to display the biggest value in an integer array.


28. Wap to sort the array using bubble sort.
29. Wap to multiply two matrices using arrays.
30. Wap to concatenate two strings & store the result in third string.
31. Wap to check whether the string is palindrome a) without using string inbuilt functions b)
with using string inbuilt functions.
32. Wap to read & print the record of 15 students using structures .
33. Wap to implement the concept of Nested structures.
34. Wap to copy the contents of one file to another file.

Note: Students are required to exercise all the experiments in lab but prepare the file of Part-B
i.e. C Programs only.

Version 1.1, Page 24 of 155

Computer Science & Engineering

2012-13

CHANDIGARH UNIVERSITY, GHARUAN


WORKSHOP PRACTICE
(MEP-108)
L T P Credits
0 0 3 1.5
Total Hours: 45 Hrs.
Course Objectives:

Introduction of various Workshop Practices.


To give an on-hand practice to the students to handle the different tools on the shop floor.
To get acquainted with the different processes and should be able to select the appropriate
process.
To obtain desired shapes and forms of jobs using the basic hand working and joining
processes.
Convey all the information that will be helpful for understanding of different processes
used on the shop floor.

Workshop Practices
Students are required to prepare the jobs in each shop individually. The student must learn to
handle the different tools and equipments. He must also learn all the safety precautions and
follow them while making jobs in the shop.
1. Carpentry Shop
Study of tools & operations and carpentry joints; Simple exercise using jack plane; To
prepare half-lap corner joint, mortise & tennon joints.
2. Fitting Shop
Students will learn the use of fitting hand tools, marking tools, marking tools and gauges.
Exercises: Jobs made out of MS Flats, making saw cut filling V-cut taper at the corners,
circular cut, fitting square in square, triangle in square.
3. Sheet Metal Shop
Learning use of sheet-metal tools, Exercises: Making jobs out of GI sheet metal.
Cylindrical, Conical and Prismatic shapes.
4. Welding Shop
Version 1.1, Page 25 of 155

Computer Science & Engineering

2012-13

Electric arc welding, Edge preparations,


Exercises : making of various joints. Bead formation
5. Electrical & Electronics Shop
Introduction to electrical wiring, Stair case Wiring;
Preparation of PCB's involving soldering applied to various electrical and electronics
appliances.
6. Automobile Shop
Study of transmission, braking, clutch system; Steering mechanism & Differential
System;
Engine operation & its working.
Text Books:
1) Chaudhury Hazra ,Workshop Technology, Vol. I, Media Promotors & Publication
2) Raghuvanshi, B. S Workshop, Technology, Vol. I, Dhanpatrai and Sons.
3) Singh Swarn, Workshop Practice by S. Chand and Sons.

Student Learning Outcomes:


At the end of the semester students will be to able understand

Various processes and equipment used for making different jobs

Hands on practice to operate various tools

Version 1.1, Page 26 of 155

Computer Science & Engineering

2012-13

CHANDIGARH UNIVERSITY, GHARUAN


APPLIED PHYSICS
(APT-109)
L
T P Credits
3
1 0
3.5
Total Hours: 45 Hrs.
Course Objectives:
(1) The engineering physics will develop sufficient depth in both engineering and physics
skills to produce engineers who can relate fundamental physics to practical engineering
problems.
(2) It will possess the versatility to address new problems in our rapidly changing
technological base.
Unit-I

(15 Hrs.)

Lasers: Introduction to lasers, Advantages of LASER ,stimulated absorption, spontaneous


emission, stimulated emission, Einsteins coefficients, Components of laser, Types of LASERRuby laser, Semiconductor laser, He-Ne laser, Applications of LASER, Holography and its
applications
Magnetic Materials: Introduction and classification of magnetic materials, Qualitative view of
Dia, para, ferro, antiferro and ferrimagnetism, Hysteresis curve, soft and hard magnetic
materials, Ferrites and its applications, Magnetic Anisotropy, Magnetostriction
Superconductivity: Introduction, Meissner effect, type 1 and type 2 superconductors ,BCS
theory , applications of superconductivity.
Unit-II

(15 Hrs.)

Fibre Optics: Introduction to optical fibre, Refractive index, Propagation of light through optical
fibre, Acceptance angle, Acceptance cone, Numerical aperture, Types of optical fibre,
Normalized frequency, Optical -couplers, Connectors, Splicers, Fibre losses, Applications.
Electrostatics: Charge distribution, Gauss law and its applications, Faradays law of
electromagnetic induction, Amperes circuital law, Polarisation , Displacement current, Maxwell
equations, speed of EM waves.

Version 1.1, Page 27 of 155

Computer Science & Engineering

Unit-III

2012-13

(15 Hrs.)

Nanotechnology: Introduction to nanomaterials, properties of nanoparticles, Synthesis of


nanomaterials, Bucky Ball, CNTs-synthesis and application, Nanodevices, Applications of
nanotechnology
Ultrasonics: Introduction-piezoelectric effect, production and detection of ultrasonics,
application of ultrasonics, Acoustics of buildings, Reverberation time, methods of design for
good acoustics
Semiconductor Physics: Band structure, Mobility and conductivity, generation and
recombination of charges, diffusion, continuity equation.
Text Books:
1. Classical Electrodynamics by S P Puri, Narosa Publication
2. Physics for engineering Applications by Sanjiv Puri Narosa Publication
3. Semiconductor Devices: Physics & Technology, 2nd Edition by S. M. Sze, Wiley India
Edition
4. Introduction to Nanoscience &Nanotechnology by K .K. Chattopadhyay, A.N. Banerjee,
PHI
5. Engineering Physics by Navneet Gupta, DhanpatRai& Co
Reference Books:
1. Introduction to Electrodynamics by D.J.Griffiths, Prentice Hall
2. Solid State Physics by M A Wahab, Alpha Science Intl Ltd
3. Fabrication of Nano Devices by Dr. Cows, Pearsons Education
4. Optical Fibre Communication by Gerd Keiser, Tata Mc Graw Hill
Instructions for the Paper-Setter:
Please go through these instructions thoroughly and follow the same pattern while setting the
paper as the students have been prepared according to this format.
Maximum Marks = 60

Time: 3 Hrs

Weightage per unit = 20 marks (excluding over attempt weightage)


The syllabus has been divided into three equal units. The paper setter is required to set Ten
questions in all, three questions from each unit and a compulsory question consisting of five sub
parts and based on the whole syllabus. The candidate will be required to attempt six questions
including the compulsory question number no 1 and not more than two questions from each unit.
In the question paper, distribution of the questions should be by considering 30 % numerical
part and 70 % conceptual.
Version 1.1, Page 28 of 155

Computer Science & Engineering

2012-13

CHANDIGARH UNIVERSITY, GHARUAN


PROFESSIONAL COMMUNICATION SKILLS
(PCT-111)
L
2

T
0

P
0

Credit
2

Total Hours: 30 Hrs.


Course Objectives:
(1) To make students aware of the value and importance of Good oral and written
Communication Skills in professional life.
(2) To sensitize students to their communicative behavior.
(3) To motivate the students to listen and speak the correct accent and pronunciation of
words in English
(4) They are able to produce text which is clear and coherent.
Unit I

(10 Hrs.)

Business Communication: Meaning, importance, types and models, Barriers to communication,


7C of Communication for effective business communication, Grapevine, verbal and non-verbal
Communication.
Reading Comprehensions: Technical
English Grammar: Noun, pronoun, verb, adjective, adverb
Unit II

(10 Hrs.)

Writing Skills: Paragraph writing (250 words), Leave application, Permission letter and
Business letters-Sales and Inquiry, Job Application, email etiquette, Memorandum, Notice
writing, Resume writing
Report Writing: Introduction to proposals, Types of reports, Steps in Report Writing,
English Grammar: Preposition, articles, conjunction, tenses, punctuation
Unit III
(10 Hrs.)
Reading: Ten Mighty Pens- Reference to Context, word meanings of Short Stories-The Model
Millionaire, The gift of the Magi, The Judgement-seat of Vikramaditya, Fur, Play-Chandalika,
Essay-A Bachelors Complaint of the Behaviour of Married People.
English Grammar:, Antonyms, Homonyms, Homophones, Active & Passive voice, Reported
Speech, Idioms, Abbreviations, Technical Terms, Analogy, Correction of spellings and sentences,
Version 1.1, Page 29 of 155

Computer Science & Engineering

2012-13

rearranging of paragraphs and transformation of sentences.


Instructions for the paper setters:
Paper would be divided into four sections.
Section A is compulsory and consists of questions from all units.
One question each from all sections is to be attempted.
Questions for Section B are set from Unit I, Section C from Unit II and Section D from Unit III.
Textbooks:
1) Kalia, K., A., Ten Mighty Pens, Oxford University Press
2) Murphy, Raymond., Elementary Grammar (Intermediate Level), Cambridge University
Press (2012)
3) Professional Communication Skills Study Material, Chandigarh University
4) Professional Communication Skills Workbook, Chandigarh University
Reference Books:
1) Dhaneval, S. P., Communicative English for Engineers and Scientist, Orient Blackswan
Publication.
2) Chaturvedi, P.D., Chaturvedi, Mukesh, Business Communication, Pearson Education
(2011)
3) Lesikar, Petit & Flately, Lesikars Basic Business Communication Tata McGraw
Hill(2011)

Version 1.1, Page 30 of 155

Computer Science & Engineering

2012-13

CHANDIGARH UNIVERSITY, GHARUAN


BASIC ELECTRICAL & ELECTRONICS ENGG.
(EET-113)
L
T P Credits
4
0 0
4
Total Hours: 60 Hrs.
Course Objectives:
(1) Students will understand how to analyze and design simple electrical circuits
(2) To study of principles of electricity to develop machines, devices and systems
(3) Students will also understand basic electronic devices
Unit-I

(20 Hrs.)

DC Circuits: Basic concepts; concepts of linear, nonlinear, active, passive, unilateral and
bilateral elements; ideal and practical voltage & current sources conversion from one from the
other. Kirchhoffs Laws Statement and Illustration, Method of solving Circuits by Kirchhoffs
Laws, Star-Delta conversion, DC Transients for RL and RC series circuits.
Single Phase AC Circuits: Generation of single phase A.C. voltage and determination of
average (mean) and RMS (effective) values of voltage and current with special reference to
sinusoidal waveforms; Form factor and peak factor for various waves, Introduction of Resistive,
Inductive and Capacitive circuits and their series and parallel combinations, Concept of
admittance, susceptance in parallel circuits; calculation of branch currents in parallel circuits.
Concept of resonance in series and parallel circuits.
Unit-II

(20 Hrs.)

Magnetic Circuits: Magnetic circuit & its similarity with electric circuits; solution of series,
parallel & series parallel magnetic circuits, Energy stored in a magnetic field, Law of
Electromagnetic Induction and its law, Self Inductance, Mutual Inductance, Coupling Coefficient
between two magnetically coupled Circuits. Principle of operation; efficiency, voltage regulation
and applications of transformer.
Transducers: Introduction, working and application of LVDT, Strain Gauge and Thermistor.
Introduction and application of Digital Multimeter, CRO, Data Acquisition Systems.

Version 1.1, Page 31 of 155

Computer Science & Engineering

Unit-III

2012-13

(20 Hrs.)

Semiconductor Devices: Introduction to p-n junction diode, Rectifiers, Zener Diode, Concept of
amplifiers and its characteristics, Operational amplifiers and its application, Regulated Power
Supply.
Digital Electronics: Digitization and its advantages, Binary number system, Octal and
hexadecimal, logic gates. Introduction and truth table, flip flops: R-S, J-K, D and T, Counter,
Shift register, MUX-DEMUX, Introduction to D/A, A/D Converters.
Text Books:
1. Sahdev S.K., Fundamentals of Electrical and Electronics Engineering, Dhanpat Rai & Co.
2. Theraja B.L., Fundamentals of Electrical and Electronics, S.Chand & Co.
3. Gupta J.B., Basic Electrical and Electronics Engineering, S.K.Kataria& Sons.
Reference Books:
1. Katre J.S., Basic Electrical and Electronics Engineering, Tech Max Publications
2. Bhargava N.N., Basic Electronics and Linear Circuits, Tata McGraw Hill

Version 1.1, Page 32 of 155

Computer Science & Engineering

2012-13

CHANDIGARH UNIVERSITY, GHARUAN


ENGINEERING DRAWING
(MET-115)
L T P Credits
1 0 3
2.5
Total Hours: 90 Hrs.
Objectives of the course:
(1) To introduce the student to the universal language and tool of communication of
engineers
(2) To make them thorough in understanding and using the various concepts, elements
and grammar of Engineering Graphics.
(3) Enhancing imagination, visualization, presentation and interpretation skills
(4) Engineering drawing is a formal and precise way of communicating information
about the shape, size, features and precision of physical objects.
(5) To accurately and unambiguously capture all the geometric features of a product or a
component.
(6) Convey all the required information that will allow a manufacturer to produce that
component.
Note: All Orthographic Projections will be in 1st Angle Projections.
Unit I

(30 Hrs.)

Fundamentals of Engineering Drawing: Scope & Importance of Engineering Drawing;


Drawing instruments and their uses; Indian standards for drawing, (SP-46 : 1988) Lettering,
Lines and dimensioning, Scales (Plain & Diagonal Scale)
Projections and their types; Orthographic Projection, Introduction of planes of projection,
Reference and auxiliary planes
Projection of points: Projection of point in all the four quadrants, Calculation of Shortest
Distance
Projection of lines: Projection of lines in different quadrants; True and Apparent lengths; True
and apparent inclination of line to reference planes; Traces of lines

Version 1.1, Page 33 of 155

Computer Science & Engineering

Unit II

2012-13

(30 Hrs.)

Projection of Planes: Projections of plane surfaces-triangle, square, rectangle, pentagon,


hexagon and circular planes in different positions when plane is parallel inclined to one or both
the reference planes.
Projection of Solids: Solids & their classification; Right & Oblique Solids, Projections of right
regular- Prisms, pyramids, cylinders and cones in different positions when their axis is parallel,
inclined to one or both the reference planes.
Sections of Solids: Introduction to Section and its importance; Methods of Sectioning, apparent
shapes and True shapes of Sections of right regular prisms, pyramids, cylinders and cones
resting with base on HP.
Unit III

(30 Hrs.)

Development of Surfaces: Development of lateral surface of right regular prism, pyramid,


cylinder & Cone resting on their base on HP with their frustum and truncation.
Isometric Projection: Introduction, Isometric scale, Isometric Projection of simple plane
figures, Isometric Projection of cube, square block, right regular prisms, pyramids, cylinders and
cones and their combinations
Orthographic Projection: Orthographic projections of simple solids from the given
3D/isometric view
Lab work shall consist of A2 (594x420mm) (Half imperial) size drawing sheets.
Text Books :
1. Gill P.S. Engineering Drawing ,S.K. Kataria& Sons
2. Dhawan R. K Engineering Drawing ,S. Chand and Sons
3. Bhatt N.D, Engineering Drawing ,Charotar Publication
Student Learning Outcomes:
At the end of the semester students will be to able understand

The interpretation of drawing which is used in industries.

Understanding further subjects of Machine design/Machine Drawing.

The conversion of 2D into 3D and vice versa.

Student will be able to know the fundamental of Computer Aided Drafting & 3D
Modeling.

Version 1.1, Page 34 of 155

Computer Science & Engineering

2012-13

CHANDIGARH UNIVERSITY, GHARUAN


APPLIED PHYSICS LAB
(APP-110)
L
0

T P
0 2

Credit
1

Total Hours: 30 Hrs.


Course Objectives:
(1) Physics Lab demonstrates the fundamental principles of Physics.
(2) It provides the modest experience that allows students to develop and improve his/her
experimental technique and develop ability to analyze data.
Unit-I

(10 Hrs.)

1. To study the divergence of LASER beam.


2. Study of diffraction using LASER beam and find the grating element.
3. To find the susceptibility of ferromagnetic material by Quinkes method.
4. To study the magnetic field produced along the axis of a circular coil carrying current
Unit-II

(10 Hrs.)

5. To find the refractive index of a material / liquid using spectrometer.


6. To determine the numerical aperture of optical fibre.
7. To study attenuation and propagation losses in optical fibre.
Unit-III

(10 Hrs.)

8. To find the velocity of ultrasound in liquid.


9. To find the frequency of AC mains using electric vibrator in transverse and longitudinal
arrangement.
10. To study B-H curve using CRO and find the energy losses.
Text books:
1. Sharma, Saroj, Physics Experiments for engineers, Oscar publications Singh, Devraj
Engineering Physics Dhanpat Rai& Co.
Version 1.1, Page 35 of 155

Computer Science & Engineering

2012-13

CHANDIGARH UNIVERSITY, GHARUAN


PROFESSIONAL COMMUNICATION SKILLS LAB
(PCP-112)
L
0

T
0

P
3

Credit
1.5

Total Hours: 45 Hrs.


Course Objectives:
1. One of the major goals of this course is to improve a student's self confidence so as to
express views and ideas effectively in English through fluent oral communication.
2. The syllabus covers one-to-one and small group communication, and promotes the
effective use of verbal and nonverbal skills to improve relationships.
3. Active listening skills are learned and practiced through class discussions.
4. Eventually the student should lead group discussions and meetings independently in
English.
Unit I
(15 Hrs.)
Soft Skills Development: Verbal Skills -Art of Self Introduction, Greetings, Asking for things,
Inviting, Congratulating and Apologizing. Art of Complimenting, Telephone Etiquette, Roleplays
Non-Verbal Skills- Positive body language, posture, gestures, symbols and signs, Personal
Appearance and the art of self-presentation & conduct. Developing positive personal attitudes.
Listening Skills- Answering questions to passages after listening, English Songs
Unit II

(15 Hrs.)

Art of Public Speaking: Newspaper Reading, Extempore, Just a Minute, Group Discussion
Presentation Skills: Principles of Oral presentations, Strategies for improving oral
presentations, Presentation on a technical topic by the student
Unit III

(15 Hrs.)

English Grammar: Workbook-Noun, pronoun, verb, adjective, adverb, preposition, article and
conjunction.
Vocabulary Building- Synonyms, Antonyms, Homonyms, Homophones, Analogy,
Version 1.1, Page 36 of 155

Computer Science & Engineering

2012-13

Abbreviations, Technical Terms, difficult spellings


Sentence Syntax- Tenses, Punctuation, Active & Passive voice, Reported Speech, Idioms,
Correction of sentences, rearranging of sentences in paragraphs and transformation of sentences.
Textbooks:
1) Chandigarh University-Professional Communication Skills - Workbook
2) Chandigarh University - Professional Communication Skills -Study Material
3) L- Client Software for Listening Skills
Reference Book:
1)
2)
3)
4)

Hewings, Martin, Advanced English Grammar, Cambridge University Press (2011)


Lewis, Norman., Word Power Made Easy (2012)
Sadanand, K., Spoken English part 1 (CD's)
Murphy, Raymond., Elementary Grammar (Intermediate Level), Cambridge University
Press (2012)

Version 1.1, Page 37 of 155

Computer Science & Engineering

2012-13

CHANDIGARH UNIVERSITY, GHARUAN


BASIC ELECTRICAL AND ELECTRONICS ENGINEERING (BEEE) LAB
(EEP-114)
L

P Credits

Total Hours: 30 Hrs.


Course Objectives:
(1) Students will understand the language of electrical engineering and how to formulate and
solve basic electrical engineering problems.
(2) To understand how electrical circuits and systems fit into the larger context of
engineering careers.
(3) To understand the basic principles and abstractions that is used to analyze and design
electronic circuits and systems.
Unit-I

(10 Hrs.)

1. To verify ohms Law, Kirchhoffs Laws and its limitations.


2. To measure the resistance and inductance of a coil by ammeter voltmeter method.
3. To find voltage-current relationship in an R-L series circuit and to determine the power
factor of the circuit.
4. To verify the voltage and current relations in star and delta connected systems.
Unit-II

(10 Hrs.)

5. To measure power and power factor in a single-phase AC circuit.


6. To use a bridge rectifier for full-wave rectification of AC supply and to determine the
relationship between RMS and average values of the rectified voltage.
7. To verify the working of a) Thermocouple b) LVDT.
8. To obtain the characteristics of a P-N junction diode.
Unit-III

(10 Hrs.)

9. To verify the truth table of logic gates.


10. To connect the following, measuring instruments to measure current, voltage and power
in AC/DC circuits:
a) Moving coil Instruments
Version 1.1, Page 38 of 155

Computer Science & Engineering

2012-13

b) Moving iron instruments


c) Dynamometer Instruments.
d) Multimeter both Digital and Analog Type.
11. To perform open and short circuit tests on a single phase transformer and calculate its
efficiency.
Reference Books:
1. Bhattacharya S.K. and Rastogi R.K., Experiments in Electrical Engineering, New Age
International Publishers Ltd., New Delhi.

Version 1.1, Page 39 of 155

Computer Science & Engineering

2012-13

CHANDIGARH UNIVERSITY, GHARUAN


COMPUTER GRAPHICS LAB
(MEP-116)
L

Credit

1.5

Total Hours: 45 Hrs.


List of Experiments
1. Introduction of CAD Software's and its GUI, Co-ordinate System Basics, UCS
commands
2. Study of all the status bar commands, limits, units, zoom, pan commands
3. Study of various toolbars of AutoCAD software (Draw, Modify, Object Snap,
Dimensioning)
4. Drawing at least two questions of Projection of Lines (inclined to both the reference
plane)
5. Drawing atleast two questions related to Projection of planes (Two, Three stage
Question)
6. Drawing atleast two questions related to Projection of Solids (Two, Three stage
Question)
7. Drawing atleast two questions from section of solids
8. Drawing atleast two questions from Development of Surfaces
9. Drawing two questions from Isometric Projection using isoplane option
10. Drawing 3D objects using extrude, revolve command and drawing its orthographic
projections.

Version 1.1, Page 40 of 155

Computer Science & Engineering

2012-13

CHANDIGARH UNIVERSITY, GHARUAN


APPLIED MATHEMATICS-II
(AMT- 121)
L T P
4 2

Credits
5

Total Hours: 60 Hrs.


Course Objectives:
(1) To enhance students knowledge in mathematics and co- relate to engineering situations.
(2) To provide students with the mathematical knowledge and skills that are needed to
support their concurrent and subsequent engineering studies.
(3) To lay a foundation for further studies in Engineering Mathematics.
Unit I

(20 Hrs.)

Complex Numbers: De-Moivres theorem, Applications of De-Moivres theorem, Real and


imaginary parts of Exponential function, Logarithmic function, Circular function, Hyperbolic
functions and inverse functions, Summation of trigonometric series.
Unit II
(20 Hrs.)
Infinite Series: Convergence and divergence of series, Tests of convergence (without proofs) :
Comparison test, Integral test Ratio test, Rabee's test, Logarithmic test, Cauchy's root test and
Gauss test. Convergence and absolute convergence of alternating series.
Double and Triple Integration : Double and Triple Integration, change of order of integration,
change of variable.Application of double integration to find areas, Review of standard 3-D
surfaces like Sphere, Cylinder and Cone, Application of double and triple integration to find
volumes.
Unit III

(20 Hrs.)

Vector calculus : Scalar and vector fields. differentiation of vectors , Vector differential
operators: Del ,Gradient, Divergence, Curl and their physical interpretations. Formulae involving
del applied to point functions and their products (without proofs), Line integrals, surface
integrals and volume integrals.

Version 1.1, Page 41 of 155

Computer Science & Engineering

2012-13

Application of Vector Calculus : Flux , Solenoidal and Irrotational vectors, Gauss Divergence
theorem, Greens theorem in plane, Stokes theorem (without proofs) and Applications .
.
Text books:
1. Kreyszig , E., Advanced Engineering Mathematics, John Wiley,10th Ed. (2011).
2. Thomas,B. and Finney ,R.L.,Calculus and Analytic Geometry, Pearson Education.
Reference books:
1. Ray Wylie, C., Advanced Engineering Mathematics, 6th ed., McGraw Hill.
2. Jain, R.K. and lyengar, S.R.K., Advanced Engineering Mathematics, Narosa Publishing
House, New
Delhi, (2004).
3. Ramana , B.V Advanced Engineering Mathematics, McGraw Hill, July (2006).
Instructions for the Paper-Setter:
Please go through these instructions thoroughly and follow the same pattern while setting the
paper as the students have been prepared according to this format.
Maximum Marks = 60

Time: 3 Hrs

Weightage per unit = 20 marks (excluding over attempt weightage)


Weightage :

Analytical Part = 90%


Conceptual Questions=10%

The syllabus has been divided into three equal units. The paper setter is required to set ten
questions in all, three questions from each unit and a compulsory question consisting of five sub
parts and based on the whole syllabus. The candidate will be required to attempt six questions
including the compulsory question number no 1 and not more than two questions from each unit.

Version 1.1, Page 42 of 155

Computer Science & Engineering

2012-13

CHANDIGARH UNIVERSITY
GHARUAN

Scheme & Syllabus of B.E.


Computer Science & Engineering [CSE]
3rd Semester

Version 1.1, Page 43 of 155

Computer Science & Engineering

2012-13

CHANDIGARH UNIVERSITY, GHARUAN


Analog and Digital Electronics (CST-201)
L T P Credits
3 1 - 3.5
Total Hours: 48
Course Objectives:

To understand the operational basics and design of electronics devices & circuits.
To gain knowledge about various digital circuits and systems.
To develop an applied base for your field of practice knowledge.
UNIT-I

Electronic Devices: p-n junction diode and its characteristics, diode as a circuit element, zener
diode, pnp & npn transistor and characteristics in CB, CE and CC modes.
[4]
Amplifiers: Concept of an amplifier, Class A direct coupled with resistive load, Transformer
coupled with resistive load, characteristics of amplifiers.
[4]
Oscillators: Concept of feedback and its merits and demerits, block diagram of Oscillators,
Conditions of oscillations.
[3]
Number Systems: Introduction, Binary, decimal, Octal and hexadecimal number systems
(including fractions), Conversion from one number system to another.
[4]
UNIT-II
Computer Arithmetic: Signed and unsigned numbers, Binary operations-addition; Subtraction,
Multiplication and division, Floating Point addition & subtraction, Subtractions using 1's and 2's
compliment; codes : ASCII code; Excess 3 code Gray code
[6]
Logic gates and functions: Introduction to digitization. Basic gates: AND, OR, NOT. Universal
gates: NAND, NOR. Basic idea of XOR and XNOR gates, Basic theorems of Boolean Algebra,
principle of duality. Sum of products (SOP) and Product of sums (POS), canonical form,
Simplification using K-map.
[8]
UNIT-III
Combinational circuits: Multiplexers, de-multiplexer, encoders, decoders, adders, subtracters
and code converters, BCD to 7 segment display. A/D and D/A convertors.[8]
Version 1.1, Page 44 of 155

Computer Science & Engineering

2012-13

Sequential Circuits: Difference between combinational and sequential circuits, Synchronous


and asynchronous sequential circuit. Flip flops: SR, JK, D, T, Shift registers and its operations,
counters: synchronous and asynchronous counters, modulo N counters, updown counters.[6]
Memories: RAM, ROM, EPROM, EEPROM, PLA.

[5]

Text Books:
1.
2.
3.

Malvino L., Digital Principle and Applications ,Tata McGraw Hill.


Ghoshal, Digital Electronic , Cengage Learning.
Boylestad ,R., Electronics Devices and Circuit Theory ,Pearson Publication.

Reference Books:
1. Halkias, Millman , Electronic Devices and Circuit, Tata McGraw Hill.
2. Mano Morris, Digital Design, Prentice Hall of India.
3. Fletcher, An Engg. Approach to digital design, Prentice Hall of India.
Instructions for paper setter:
The syllabus has been divided into three equal units. The paper setter is required to set Ten
questions in all, three questions from each unit and a compulsory question consisting of five sub
parts and based on the whole syllabus. The candidate will be required to attempt six questions
including the compulsory question number no 1 and not more than two questions from each unit.

Version 1.1, Page 45 of 155

Computer Science & Engineering

2012-13

CHANDIGARH UNIVERSITY, GHARUAN


Computer Organization and Architecture (CST-202)
L T P Credits
3 - -

3
Total Hours: 48

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.


UNIT-I

Basic concepts-Digital computer with its block diagram, computer hardware components-ALU,
registers, memory, system bus structure-data, address and control bus.
[4]
Instruction Set Architectures-Levels of programming Languages, Assembly Language
Instructions: instruction cycle, instruction types, addressing modes, RISC vs CISC.
[6]
Computer Organization- CPU organization, Memory Subsystem Organization: Types of
memory, Internal Chip Organization, memory subsystem configuration.
[6]

UNIT-II
Design of control unit - Hardwired control unit, Micro-Programmed control unit and
comparative study.
[4]
Memory organization-Memory hierarchy, Cache Memory Associative Memory, Cache memory
with associative memory, Virtual Memory: Paging, Segmentation. [6]
Input output organization Asynchronous Data transfer: Source Initiated, Destination Initiated,
Handshaking, Programmed I/O, Interrupts DMA, IOP
[7]

UNIT-III
Introduction to Parallel Processing- Parallelism in uniprocessor system, Flynns Classification,
Handlers Classification, concept of pipelining, Instruction Pipeline, Arithmetic Pipeline.
[8]

Version 1.1, Page 46 of 155

Computer Science & Engineering

2012-13

Multiprocessors- Characteristics of multiprocessors, Uniform and non-uniform memory access


multi processors, various interconnection networks.
[7]
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.
Instructions for paper setter:
The syllabus has been divided into three equal units. The paper setter is required to set Ten
questions in all, three questions from each unit and a compulsory question consisting of five sub
parts and based on the whole syllabus. The candidate will be required to attempt six questions
including the compulsory question number no 1 and not more than two questions from each unit.

Version 1.1, Page 47 of 155

Computer Science & Engineering

2012-13

CHANDIGARH UNIVERSITY, GHARUAN


Data Structures (CST-203)
L T P Credits
3 - - 3
Total Hours: 48

Course Objectives:

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

To apply different data structures for modeling real world problems.

Unit I

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.
[4]

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.
[12]
Unit II

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.
[6]

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.[6]

Version 1.1, Page 48 of 155

Computer Science & Engineering

2012-13

Queues: Linear queue, Sequential and linked representation of Linear queue, Circular queue,
Operations on queue, Deques, Priority queue.
[4]
Unit III
Graphs: Graph Theory terminology, sequential representation of graphs (adjacency matrix, Path
Matrix), traversing a graph, Operations on Graph.
[4]
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.
[8]
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.
[4]
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.
Instructions for paper setter:
The syllabus has been divided into three equal units. The paper setter is required to set Ten
questions in all, three questions from each unit and a compulsory question consisting of five sub
parts and based on the whole syllabus. The candidate will be required to attempt six questions
including the compulsory question number no 1 and not more than two questions from each unit.

Version 1.1, Page 49 of 155

Computer Science & Engineering

2012-13

CHANDIGARH UNIVERSITY, GHARUAN


Discrete Mathematics (CST-204)
L T P Credits
3 1 0 3.5
Total Hours: 48
Course Objectives:

To be familiar with fundamental mathematical structures useful for problem solving in


engineering domain.
To understand basic data structures and algorithms
To recognize and represent problems in better way to find the optimal solution.
Unit-I

Set Theory: Introduction to set theory, Set operations, Algebra of sets, combination of sets,
Duality, Finite and Infinite sets, Classes of sets, Power Sets, Multi sets, Cartesian Product. [4]
Relations and Functions : Representation of relations, Types of relation, Binary Relations,
Equivalence relations and partitions, Partial ordering relations and lattices, Mathematics
Induction, Principle of Inclusion & Exclusion. Function and its types, Composition of function
and relations, Cardinality and inverse relations. Functions & Pigeonhole principle.
[8]
Propositional Calculus: Basic operations: AND (^), OR (v), NOT (~), Truth value of a
compound statement, propositions, tautologies, contradictions.
[4]
Unit-II
Recursion And Recurrence Relation: Sequences, Introduction to AP and GP series, partial
fractions, linear recurrence relation with constant coefficients, Homogeneous solutions,
Particular solutions, Total solution of a recurrence relation using generating functions.
[8]
Algebraic Structures: Definition, elementary properties of algebraic structures, Basic algebraic
structures: Semigroup, monoid, group, subsemigoup, submonoid, subsemigroup. Congruence
relations. Homomorphism, Isomorphism and Automorphism, Subgroups and Normal subgroups,
Cosets, Lagranges theorem, Cyclic groups. Rings, Types of rings, division rings, Integral
domains and fields
[8]

Version 1.1, Page 50 of 155

Computer Science & Engineering

2012-13

Unit-III
Combinatorial Mathematics: Techniques of counting: Rule of sum, Rule of product.
Permutations and combinations, Generating Functions.
[4]
Graph Theory: Introduction to graphs , Directed and undirected graphs, Homomorphic and
Isomorphic graphs, Subgraphs, Multigraph and Weighted graph, Paths and circuits, Shortest path
in weighted graphs, Eulerian paths and circuits, Hamiltonian paths and circuits. Planar graphs,
Eulers formula.
[6]
Trees: Introduction to trees, Difference between a graph and a tree, Rooted Trees, Path length in
trees, Spanning Trees & cut-sets, Minimum cost spanning trees, Binary trees and its traversal.[6]
Text Books:
1. Liu C.L, Elements of Discrete Mathematics, McGraw Hill.
2. Santha, Discrete Mathematics with Graph Theory, Cengage Learning.
3. Ronald G, Knuth, Donald and Patashik, Oren, Concrete Mathematics: A Foundation for
Computer Science, Addison-Wesley.
Reference Books:
1. Kolman , B. and Busby ,R.C, Discrete Mathematical Structures, PHI.
2. Gersting, Judith L. Mathematical Structures for Computer Science, Computer Science
Press.
3. Doerr and Levasseur , Applied Discrete Structures for Computer Science.
4. Tembley&Manohar , Discrete Mathematical Structures with Applications to
Computers, McGraw Hill.
5. Rosen K. H, Discrete Mathematics and its applications, Mc-Graw hill.
6. Lyengar, N Ch SN, Chandrasekaran, VM, Discrete Mathematics.
Instructions for paper setter:
The syllabus has been divided into three equal units. The paper setter is required to set Ten
questions in all, three questions from each unit and a compulsory question consisting of five sub
parts and based on the whole syllabus. The candidate will be required to attempt six questions
including the compulsory question number no 1 and not more than two questions from each unit.

Version 1.1, Page 51 of 155

Computer Science & Engineering

2012-13

CHANDIGARH UNIVERSITY, GHARUAN


Object Oriented Programming (CST-205)
L T P Credits
3 - - 3
Total Hours: 48

Course Objectives:

To understand object oriented programming concepts.


To differentiate between object oriented and procedural concepts.
To understand the Concept of classes, objects, constructors, destructors, inheritance,
operator overloading and polymorphism, pointers, virtual functions, templates, exception
handling, file, file operations and handling.
UNIT-I

Introduction: Differences between object oriented and procedure oriented programming.


Object Oriented Programming Paradigm, Basic Object oriented concepts: class, object, data
abstraction and encapsulation information hiding, inheritance, polymorphism, dynamic binding,
message passing. Benefits of OOPS.
[6]
Basic Constructs In C++: Basic structure of a C++ program, main function, input and output
operators, tokens, keywords, identifiers and constants, basic data types, user defined data types,
operators in C++, unformatted and formatted I/O Operations, manipulators, control statements,
functions: function call, parameter passing mechanisms, function overloading, inline functions,
Arrays and Strings.
[6]
Classes and Objects:, Difference between structure and class, specifying a class, access
specifies, creating objects, accessing class members, defining a member function inside and
outside class, private member function, static data members & member functions, Objects as
function arguments, friend function and returning objects to functions.
[6]
UNIT-II
Constructors and Destructors: Need for constructors, types of constructors: parameterized,
Constructors with default arguments, Constructor Overloading and copy constructors, destructors
and their need.
[4]

Version 1.1, Page 52 of 155

Computer Science & Engineering

2012-13

Operator Overloading and Type Conversions: Defining operator overloading, rules for
overloading operators, overloading of unary & binary operators, type conversion - basic type to
class type & vice versa.
[4]
Inheritance: Defining derived class, modes of inheritance, types of inheritance, ambiguity in
inheritance, virtual base class, Function overriding, order of execution of constructors, Member
Classes: Nesting of Classes
[6]
UNIT-III
Pointers, Virtual Functions& Polymorphism: Introduction &types of polymorphism: static
and dynamic binding, Introduction to pointers, need for pointers, declaring & initializing
pointers, Array of pointers, pointer to objects, this pointer, pointer to derived classes, Dynamic
memory allocation: new and delete operator, virtual functions and pure virtual functions, abstract
class.
[7]
Templates & Exception Handling: Concept of Templates & Generic Programming, Class
Templates, Function Templates, Overloading of Template Functions, Basics of C++ Exception
Handling: Try, Throw, Catch, Throwing an Exception, Catching an Exception, Re-throwing an
Exception.
[5]
Files: Introduction to File streams, Hierarchy of file stream classes, File operations, File I/O, File
opening Modes, Reading/Writing of files, Error handling in files, Random-access to files. [4]
Text books:
1. Balagurusami, E., Object Oriented Programming in C++, Tata McGraw-Hill.
2. Lafore Robert, Object Oriented Programming in C++, Waite Group.
Reference Books:
1. Scildt, Herbert, C++- The Complete Reference, Tata McGraw-Hill.
2. Stroustrup, Bjarne, The C++ Programming Language, Pearson Education.
3. Ravichandran D., Programming with C++, Tata McGraw-Hill.
4. Farrell, Object Oriented Programming Using C++,Cengage Learning.
Instructions for paper setter:
The syllabus has been divided into three equal units. The paper setter is required to set Ten
questions in all, three questions from each unit and a compulsory question consisting of five sub
parts and based on the whole syllabus. The candidate will be required to attempt six questions
including the compulsory question number no 1 and not more than two questions from each unit.

Version 1.1, Page 53 of 155

Computer Science & Engineering

2012-13

CHANDIGARH UNIVERSITY, GHARUAN


Analog and Digital Electronics Lab (CSP-206)
L T P Credits
- - 2

Course Objectives:

To study the characteristics of different amplifiers and oscillators.


To realize different combinational and sequential circuits.

UNIT I
1. Study Zener regulator as voltage regulator.
2. Plot the input and output characteristics of CE configuration.
3. Study the characteristics of a Class- A amplifier.
4. Study the response of RC phase shift oscillator and determine frequency of oscillation.
UNIT II
5. Study the response of Hartley oscillator and determine frequency of oscillation.
6. Truth-table verification of OR, AND, NOT, XOR, NAND and NOR gates.
7. Realization of OR, AND, NOT and XOR functions using universal gates.
UNIT III
8. Realization Half Adder / Full Adder using Logic gates.
9. Design 4-Bit magnitude comparator using logic gates. Multiplexer: Truth-table verification
and realization of Half adder and Full adder using MUX.
10. Flip Flops: Truth-table verification of RS, JK, D, JK Master Slave Flip Flops.

Version 1.1, Page 54 of 155

Computer Science & Engineering

2012-13

CHANDIGARH UNIVERSITY, GHARUAN


Data Structures Lab (CSP-207)
L T P Credits
- - 4

Course Objectives:

To implement various data structure and operations on them using C++.


To implement various sorting and searching algorithms using C++.
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
Version 1.1, Page 55 of 155

Computer Science & Engineering

2012-13

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.

Version 1.1, Page 56 of 155

Computer Science & Engineering

2012-13

CHANDIGARH UNIVERSITY, GHARUAN


Object Oriented Programming Lab (CSP-208)
L T P Credits
- - 4 2
Course Objectives:

To implement basic programs using C++.


To implement various object oriented concepts like classes, objects, inheritance,
polymorphism, overloading etc. using C++.
To handle exceptions in C++.
UNIT-I

1. Write a program to print prime numbers bet. 1 to 100.


2. Write a program to find whether a given number is palindrome or not. (For Ex2112 is palindrome)
3. Write a program to find whether a given string is palindrome or not. (For ExMADAM is palindrome)
4. Write a program which takes two n*n matrices where n will be specified by the user.
Write a method which does summation of both matrices and store the result in third
matrix also display the resultant matrix.
5. Write a program to generate the Fibonacci series up to user specified limit using recursive
function.
6. Define the structure called student having properties like stud_id, stud_name,
stud_branch, and email_add. Write a program which takes the details of 5 students and
print them on console.
7. Write a program having class calculator, such that the function addition, subtraction are
defined inside a class and multiplication and division are defined outside the class.
8. Write a program which takes 10 integer numbers from user. Save all the
positive numbers to one file, all the negative numbers to another file.

UNIT-II
9. Write a program to demonstrate constructor overloading in a class.
10. Write a program to define a static data member which has the initial value of 55 and to
find the sum of the following series. Sum=1+2+3+4+10.
Version 1.1, Page 57 of 155

Computer Science & Engineering

2012-13

The addition of series is to be repeated five times.


11. Write a program for addition of complex numbers by overloading binary operator.
12. Write a program to demonstrate the overloading of increment and decrement operator.
13. Write a program to access the private data of a class by non-member function through
friend function.
14. Write a program to read the derived class data members such as name, roll no, sex,
marks and displays it on screen. The program should follow single inheritance concept.
15. Write a program having three classes Person, Student and Exam. The Person class is
the base class, Student class is derived from Person and Exam class is derived from
Student.
16. Write a program that shows order of execution of base and derived class constructors
and destructors using inheritance.
UNIT-III
17. Write a program to display the concept of virtual functions.
18. Write a program to demonstrate the use of new and delete operators.
19. Write a program to demonstrate the exception handling.
20. Write a program to demonstrate use of template function in a template class.
21. Write a program to store the information of about 5 students in a file student and read
the content and print them on screen.
22. Write a program to put Integer values in file and then opens that file and put odd
numbers in file named odd and even numbers in file named even and display the
contents of both files.
23. Write a program to demonstrate the use of File Pointers.

Version 1.1, Page 58 of 155

Computer Science & Engineering

2012-13

CHANDIGARH UNIVERSITY
GHARUAN

Scheme & Syllabus of B.E.


Computer Science & Engineering [CSE]
4th Semester

Version 1.1, Page 59 of 155

Computer Science & Engineering

2012-13

CHANDIGARH UNIVERSITY, GHARUAN


Numerical and Statistical Techniques (CST-221)
L T P Credit
3 1 - 3.5
Total Hours: 48
Course Objectives:

To co-relate knowledge in mathematic with engineering situations.


To lay a foundation for further studies in Engineering Mathematics.
UNIT -I

Interpolation: - Newtons interpolation formulas, Newtons forward interpolation formula,


Newtons backward interpolation formula, Interpolation with unequal intervals: Lagranges
formula for unequal intervals, divided differences, Newtons divided differences formula. [7]

Numerical Integration: Trapezoidal Rule, Simpsons one third Rule, Simpsons three
eighth Rule.

[5]

Numerical solution of Ordinary Differential Equations: Introduction, Solution of


Polynomial equation by Bisection and Newton Raphson Method, Eulers method, Modified
Eulers Method, Runge Kutta method of fourth order, Predictor Corrector Method-Milnes
method. Adam Bash forth.
[5]
UNIT-II

Statistics: - Measure of central tendency: Mean, Median and Mode, Measures of dispersion
coefficient of variations, Relations between measures of dispersion, Standard deviation of the
combination of two groups, Skewness, Kurtosis.
[8]

Probability: Basic concepts and axioms in probability, conditional probability, Bayes theorem,
Bernoulli trials.

[7]
UNIT-III

Random Variables: Discrete and continuous random variables. Basic discrete distributions:
Binomial, geometric and Poisson distribution. Basic continuous distributions: Exponential and
normal distributions.
[8]
Version 1.1, Page 60 of 155

Computer Science & Engineering

2012-13

Sampling and Testing of Hypothesis: Sampling methods, student t-test, Chi-square , F-test
and curve fitting. Correlation and regression analysis.

[8]

Text Books:
1.
2.
3.
4.

Kreyszig , E., Advanced Engineering Mathematics, John wiley.


Grewal, B.S., Higher Engineering Mathematics, Khanna Publishers. New Delhi.
Bali, N. P., A Text Book on Engineering Mathematics, Luxmi Pub., New Delhi.
Fisher Sir Ronald Aylmer, Statistical Methods for Research Workers, Oliver & Boyd
publishers.

Reference Books:
1. Ott. R. Lyman, Longnecker T. Micheal, An Introduction to Statistical Methods and Data
Analysis, Cenage Learning.
2. Ray Whlie, C., Advanced Engineering Mathematics, McGraw Hill.
3. Schilling, Numerical Methods Using C, Cengage Learning.
4. Freund, Mohr, Wilson, Statistical Methods, Academic Press.
Instructions for paper setter:
The syllabus has been divided into three equal units. The paper setter is required to set Ten
questions in all, three questions from each unit and a compulsory question consisting of five sub
parts and based on the whole syllabus. The candidate will be required to attempt six questions
including the compulsory question number no 1 and not more than two questions from each unit.

Version 1.1, Page 61 of 155

Computer Science & Engineering

2012-13

CHANDIGARH UNIVERSITY, GHARUAN


Microprocessors and Interfacing (CST-222)
L T P Credit
3 1 - 3.5
Total Hours: 48
Course Objectives:

To understand the architecture, components, flags and instruction set of 8085 and 8086.
To design interfacing circuits using 8085 and 8086.
To gain familiarity with 8255(PPI), 8253(Programmable interval timer), 8259(PIC),
8237(DMA) and advanced microprocessor chips.

Unit-I
Introduction: Review of Hardwired Logic v/s Flexible Logic, Tri State Logic. Introduction to
microprocessor, Difference between microprocessor and microcomputer, Basic components of a
microprocessor, system bus: address, data and control buses.
[6]
8085 microprocessor: Architecture, pin diagram, flags, addressing modes, instruction set and
assembly language programming, timing diagrams, interrupt structure of 8085.
[8]
Memory Interfacing: Interfacing memory- Interfacing SRAM, DRAM, EPROM etc.

[3]

Unit-II
Interfacing devices:
Architecture, Block Diagram, Control words, Modes and working of 8255

[4]

Architecture, Block Diagram and working of8251

[3]

Architecture, Block Diagram and working of 8253

[3]

Architecture, Block Diagram and working of 8259

[3]

Architecture, Block Diagram and working of 8237

[3]

Version 1.1, Page 62 of 155

Computer Science & Engineering

2012-13

Unit-III
8086 Microprocessor: Architecture, block diagram and pin diagram of 8086, operating modes
of 8086, details of sub-blocks such as EU, BIU; memory segmentation and physical address
computations, program relocation, addressing modes.
[9]
Advanced Microprocessors: Introduction to
microprocessors.

80186, 80286, 80386, 80486, Pentium


[6]

Text Books:
1. Gaonkar, Ramesh S., Microprocessor Architecture, Programming & Applications with
8085, Wiley Eastern Ltd.
2. Ayala, The 8086 Microprocessor: Programming& Interfacing the PC, Cengage
Learning.
3. Bhurchandi, K.M , Ray, A.K , Advanced microprocessors and peripherals, TMH.

Reference Books:
1. Brey, The Intel Microprocessors 8086- Pentium processor, PHI.
2. Triebel and Singh, Avtar , The 8088 & 8086 Microprocessors-Programming,
interfacing, Hardware & Applications ,PHI .
3. Liu,Yu-Chang &Gibson, Glenn A, Microcomputer systems: The 8086/8088 Family:
architecture, Programming & Design, PHI.
4. Antonakos, James L., The Pentium processor, Pearson.
Instructions for paper setter:
The syllabus has been divided into three equal units. The paper setter is required to set Ten
questions in all, three questions from each unit and a compulsory question consisting of five sub
parts and based on the whole syllabus. The candidate will be required to attempt six questions
including the compulsory question number no 1 and not more than two questions from each unit.

Version 1.1, Page 63 of 155

Computer Science & Engineering

2012-13

CHANDIGARH UNIVERSITY, GHARUAN


Digital Communication & Computer Network (CST-223)
L T P Credit
3 - - 3
Total Hours: 48
Course Objectives:

To understand Data Communication , its components & network types


To understand and Compare models, signals, multiplexing, switching & transmission
media.
UNIT I

Introduction: Introduction to network, types of transmission technologies, Network Categories:


LAN, MAN, WAN (Wireless /Wired), Network Software: Concept of Layers, Protocols,
interfaces and services. Reference Models: OSI, TCP/IP and comparison.
[8]
Physical Layer: Bit rate, Baud rate, Bandwidth, Transmission Impairments: Attenuation,
Distortion, Noise; Data rate limits: Nyquist formula, Shannon Formula, Modulation & modems;
Transmission Modes, Multiplexing: Frequency Division, Time Division, Wavelength Division;
Concept of Topologies, Transmission Media: Twisted pair, coaxial, fiber optics, Wireless
Transmission (radio, microwave & infrared);Message switching, Circuit Switching & Packet
Switching.
[8]
UNIT II
Data Link Layer: Design issues, Error Detection & Correction; Flow control & Error Control;
Sliding Window Protocols, ARQ: Stop & Wait , Go Back n, Selective Repeat ; Examples of
DLL protocols HDLC, PPP; Medium Access Sub layer: Channel Allocation; Random Access:
ALOHA, CSMA protocols; Controlled Access: Polling, Reservation, Token Passing; Examples
of IEEE 802.2,802.3,802.4, 802.5,802.11 standards.
[8]
Network Layer: Design issues, Logical Addressing: IPv4 & IPv6; Packet Formats & their
comparison IPv4 & IPv6; Routing Algorithms: Distance Vector, Link State, Hierarchical,
Supernetting and Subnetting; Congestion Control: Principles of congestion control; Congestion
prevention policies, Leaky bucket & Token Bucket Algorithms.
[8]

Version 1.1, Page 64 of 155

Computer Science & Engineering

2012-13

UNIT III
Transport Layer: Services provided to upper layers, Elements of Transport protocols.
Addressing, Flow Control & buffering; Example Transport protocols: TCP, SCTCP & UDP
[8]
Application Layer: Network security, Domain Name System, Simple Network Management
Protocol, Electronic Mail, World Wide Web.
[8]
Text Books:
1. Forouzan, Behrouz A.: Data Communications & networking, 4th edition Tata Mcgraw
Hill.
2. Tanenbaum, Andrew S: Computer networks, 4th Edition, Pearson education.
Reference Books:
1. Stallings, William: Data and computer communications, 8th edition, Pearson
Education.
2. Ross, Kurose, Computer Networking: A top down Approach, 2nd edition, Pearson
Education.
3. Coomer, Douglas E.: Internet working with TCP/IP , 2 nd edition, Pearson Education
4. Dave, Computer Networks, Cengage Learning.
Instructions for paper setter:
The syllabus has been divided into three equal units. The paper setter is required to set Ten
questions in all, three questions from each unit and a compulsory question consisting of five sub
parts and based on the whole syllabus. The candidate will be required to attempt six questions
including the compulsory question number no 1 and not more than two questions from each unit.

Version 1.1, Page 65 of 155

Computer Science & Engineering

2012-13

CHANDIGARH UNIVERSITY, GHARUAN


Operating System (CST-224)
L T P Credit
3 - - 3
Total Hours: 48

Course Objectives:

To grasp a fundamental understanding of operating systems and its functionalities.


To understand process management, various scheduling algorithms, concurrency and
synchronization.
To understand memory management and virtual memory concepts in modern Operating
systems.
UNIT I

Introduction to the Operating System: Introduction to Operating Systems, Operating System


Structure, Main Functions and characteristics of Operating Systems, Types of Operating
Systems, System calls, Types of system calls, System programs.
[5]
Process Management: Process Concept, Process Control Block, Process Scheduling, Threads,
CPU Scheduling : Preemptive/ Non Preemptive Scheduling, Scheduling Criteria, Scheduling
Algorithms, inter-process communication, remote procedure calls, Process Synchronization.
[6]
Deadlocks: Deadlock characterization and conditions for deadlock, deadlock prevention,
Deadlock avoidance-safe state, resource allocation graph algorithm, Bankers algorithms-Safety
algorithm, Deadlock detection, Recovery from deadlock.
[6]
UNIT II
Memory Management: Address binding, logical versus physical address space, dynamic
loading, Swapping, contiguous memory allocation, Fragmentation, Paging, Segmentation,
Segmentation with Paging, Virtual Memory Concept, Demand Paging, Page Replacement, Page
Replacement Algorithms.
[6]
Device Management: Disk Structure, Disk formatting, Disk Scheduling Algorithms, RAID
structure-RAID levels, problems with RAID.
[5]
Version 1.1, Page 66 of 155

Computer Science & Engineering

2012-13

File Management: File Concepts, Access Methods, Directory Structure, Allocation Methods,
Free Space Management.
[5]
UNIT III
System Protection and Security: Goals, principles and domain of protection, Access matrix,
implementation of access matrix, the security problem, program threats, system and network
threats.
[8]
Distributed and Network Operating Systems: Overview: Topology, connection strategy,
network operating system types: Peer to Peer & Client server, Distributed message passing. [7]
Text Books:
1. Galvin, Peter B., Silberchatz, A., Operating System Concepts, Addison Wesley, 8th
Edition.
2. Flynn, Operating Systems, Cengage Learning.
3. Dhamdhere,
D.M.,
"Operating
System:A
Concept
Based
Approach",
Tata Mc-Graw- Hill.
Reference Books:
1. Mad nick, Stuart E., Donovan, John J. Operating System, McGraw Hill.
2. Stalling, William, Operating Systems, Pearson Education, Fifth Edition.
Instructions for paper setter:
The syllabus has been divided into three equal units. The paper setter is required to set Ten
questions in all, three questions from each unit and a compulsory question consisting of five sub
parts and based on the whole syllabus. The candidate will be required to attempt six questions
including the compulsory question number no 1 and not more than two questions from each unit.

Version 1.1, Page 67 of 155

Computer Science & Engineering

2012-13

CHANDIGARH UNIVERSITY, GHARUAN


Web Technologies (CST-225)
L T P Credit
3 -- 3
Total Hours: 48
Course Objectives:

To design and format web pages using HTML and CSS.


To handle events and client side processing using Java Scripts
To handle graphics and media objects in Web page
To gain familiarity with the principles of electronic documentation and structured
documents, particularly the XML standard family.
UNIT I

Introduction: Web Standards, Web browsers, Variety of displays, Server & server software,
HTTP and FTP , WCAG 1.0, 2.0, Character sets & encoding.
[5]
Document structure: Minimal document structure, type declaration, switching, route and
header elements, text and formatting tags, links, images and objects, table, Frames and Frame
sets, Forms
[5]
Web Publishing using CSS: CSS Basics: benefits of CSS, selectors and its types, adding styles,
introduction to box model, browser support, Creating an overall look: font and text properties,
basic box properties, colors and backgrounds, floating and positioning.
[6]
UNIT II
Formatting: Table formatting, list and generated content, two, three column layouts, Box
formatting, image replacement, rollovers, Navigation bars.
[6]
Introduction to java script: Dos and Donts, implementation method, Java script syntax:
Statements, variables, data types, arrays, Operators, Control statements, Objects, Event handling,
Browser object, DOM Scripting, Functions, Dialogs: performing I/O.
[9]

Version 1.1, Page 68 of 155

Computer Science & Engineering

2012-13

UNIT III
Objects in java script: Such as Array, date, math, string, Accessing page elements using DOM
(Document object model)
[4]
Web Graphics Overview: Web graphic file formats, image resolution, web graphic production
tips, Gif format, jpeg format, PNG format, Animated GIFs.
[4]
Media: Basic digital audio concepts, Creating and optimizing audio for the web, Streaming
audio, Audio formats, Basic digital video concepts, Compression, Video File formats, Adding
video to HTML document.
[4]
Introduction to XML: XML basics, XML document syntax, Well-Formed and Valid XML,
XML Document type definition, XML on the web, XML application.
[5]
Text Books:
1. Niederst , Jennifer , Web design in a nutshell, O'Reilly Media.
2. Moseley Ralph, Savaliya M. T., Developing Web Applications, Wiley India.
Reference Books:
1. Powers S., Dynamic Web Publishing, Tech Media.
2. Thomas A. Powell, The Complete Reference HTML & XHTML, Tata McGraw-hill.
3. Sklar, Web Design Principles, Cengage Learning.
Instructions for paper setter:
The syllabus has been divided into three equal units. The paper setter is required to set Ten
questions in all, three questions from each unit and a compulsory question consisting of five sub
parts and based on the whole syllabus. The candidate will be required to attempt six questions
including the compulsory question number no 1 and not more than two questions from each unit.

Version 1.1, Page 69 of 155

Computer Science & Engineering

2012-13

CHANDIGARH UNIVERSITY, GHARUAN


Microprocessors &Interfacing Lab (CSP-226)
L T P Credits

-- 2 1
Course Objectives:

To get familiarization with 8085 kit and simulator.


To implement basic programs using 8085 kit/simulator.
UNIT-I

1.
2.
3.
4.
5.

To study 8085-microprocessor trainer kit.


Addition of two 8-bit numbers; sum 8 bits
Addition of two 16 bit number; sum 16- bits.
Subtraction of two 8-bit numbers; result 8 bits.
Subtraction of two-16 bit numbers; sum 16 bits.
Unit-II

6. Find ones complement of an 8-bit number.


7. Find ones complement of a 16-bit number.
8. Find twos complement of a 8-bit number.
9. Find twos complement of a 16- bit number.
10. Shift an 8 -bit number to left by 1- bit.
11. Shift an 8-bit number to left by 2-bits.
12. Shift a 16 -bit number to left by 1- bit.
13. Shift a 16-bit number to left by 2- bits.
Unit- III
14. Mask of least significant 4 bits of an 8-bit number.
15. Mask of most significant 4 bits of an 8-bit number.
16. Find the smaller out of two numbers.
17. Find the smaller number in a data array
18. Find the larger out of two numbers.
19. Find the largest number from data array.
Version 1.1, Page 70 of 155

Computer Science & Engineering

2012-13

CHANDIGARH UNIVERSITY, GHARUAN


Network & Operating System Lab (CSP-227)
L T P Credit
- -4

Course Objectives:

To understand Computer Hardware and networking.


To execute various commands in LINUX.
To understand the concept of shell programming.
UNIT I

1. Familiarization with Computer Hardware & write specifications of latest desktops and laptops.
2. Installation Process of various operating systems.
3. Study of LAN Components.
4. Introduction of Shell programming using
- Command syntax
- simple functions
- basic tests
5. preparing straight and cross cables.
UNIT II
6. (a)Write programs using the I/O system calls of UNIX operating system (open, read, write
etc.)
(b)Write C programs to simulate UNIX commands like ls, grep, etc.
7. Familiarization with transmission media viz. coaxial cable, twisted pairs, optical fibre
networking, wireless networking, connectors etc.
8. Write programs using the following system calls of UNIX operating system:
fork, exec, getpid, exit, wait, close, stat, opendir, readdir.
9. Creation of different topologies.

Version 1.1, Page 71 of 155

Computer Science & Engineering

2012-13

UNIT III
10. Simulate the Bankers algorithm for deadlock avoidance and deadlock prevention.
11. Sharing of resources with two connected nodes.
12. Configuration of TCP/IP Protocols.
13. Network troubleshooting.

Version 1.1, Page 72 of 155

Computer Science & Engineering

2012-13

CHANDIGARH UNIVERSITY, GHARUAN


Web Technologies Lab (CSP-228)
L T P Credit
- - 4

Course Objectives:

To design web pages using HTML and CSS


To handle client side processing of web page using java script.
To learn the storage and retrieval of data using XML.
Unit I

1. Design Simple Web Pages using standard HTML tags like, HEAD, TITLE, BODY
2. Design HTML web pages, which make use of INPUT, META, SCRIPT, FORM,
BGSOUND,
3. Working with various attributes of standard HTML elements.
4. Design an image library of your department activities using HTML and CSS.
5. Design a web template using HTML and CSS.
Unit II
6. Using Java Script's Window and document objects and their properties and various
methods like alert (), evaI (), Parselnt (), input() etc. methods to give the dynamic
functionality to HTML web pages.
7. Writing Java Script snippet which make use of Java Script's inbulit as well as user
defined objects like navigator, Date Array, Event, Number etc.
8. Create a web page of user records. These records should be entered using form elements
on the same page and page should be updated dynamically using JavaScript.
9. Write code which does the form validation in various INPUT elements like TextFiled,
Text Area, Password, Selection list etc.
Unit III
10. Writing XML web Documents which make use of XML Declaration, Element
Declaration, Attribute Declaration.
11. Write a Java script code to read the data from XML and embed in HTML document.
12. Write a java script code to read the data from the HTML form elements and store it in
XML file.
Version 1.1, Page 73 of 155

Computer Science & Engineering

2012-13

13. Create a web page using HTML and JavaScript to search the records with different search
criteria from XML file and display the result in tabular form on the page.
14. Modify above page by adding an option to edit the searched record and update it in XML
file.
Note: Students are also required to make one small project by using different concepts of web
technologies.

Version 1.1, Page 74 of 155

Computer Science & Engineering

2012-13

CHANDIGARH UNIVERSITY
GHARUAN

Scheme & Syllabus of B.E.


Computer Science &Engineering [CSE]
5th Semester

Version 1.1, Page 75 of 155

Computer Science & Engineering

2012-13

CHANDIGARH UNIVERSITY, GHARUAN


Design and Analysis of Algorithms (CST-301)
L T P Credit
3 1 -

3.5

Total Hours: 48
Course Objective:

To understand meaning and characteristics of algorithms


To study different algorithm design techniques.
To implement different algorithm design techniques for solving engineering and related
problems.
UNIT-I

Algorithm and its characteristics: - Algorithms and its characteristics, Growth of functions:
asymptotic notations, Analyzing and design of algorithms, Performance analysis and
measurement of algorithms, Time and space complexity.
[6]
Elementary Data Strictures: - Stacks, Queues, Trees, Graphs, Sets and Disjoint Set, Union [4].
Divide and Conquer: - General method, Binary Search, Merge sort, Quick sort, Finding
maximum and minimum.
[6]
UNIT-II
Greedy Algorithms: - General method, Elements of greedy strategy, An Activity Selection
Problem, Knapsack problem. Huffman codes, Minimum cost spanning trees.
[6]
Dynamic Programming:- General method, Elements of dynamic programming, Matrix-chain
multiplication problem, Longest common Subsequence Problem, Multistage Graph, 0/1
Knapsack, Travelling salesperson problem (TSP).
[6]
Back Tracking: - General method, 8 queen's problem, Graph coloring.
[4]

UNIT-III
Elementary Graph Algorithms: - Basic terminology, Representation of Graphs, Depth First
Search, Breath First search, topological sort, Single source shortest path: Bellman- Ford
Version 1.1, Page 76 of 155

Computer Science & Engineering

2012-13

algorithm, Dijkstras Algorithm, All Pair shortest paths: Floyd Warshall algorithm.
[8]
Branch and Bound: - Branch and Bound method, 0/1 Knapsack problem, Travelling
salesperson problem.
[4]
NP Hard and NP Complete Problems: - Basic concepts, The classes P and NP, NP Hard and
NP Complete problems, NP-completeness & reducibility.
[4]
Text Books:
1. Cormen, Leiserson, Rivest, Stein, Introduction to Algorithms, Prentice Hall of India, 3rd
edition 2012.
2. Horowitz, Sahni and Rajasekaran, Fundamentals of Computer Algorithms, University
Press (India), 2nd edition.
Reference Books:
1. Tanenbaum, Augenstein, &Langsam, Data Structures using C and C++, Prentice Hall of
India.
2. Brassard, Bratley, Fundamentals of Algorithms, Prentice Hall of India.
3. Knuth The Art of Computer Programming, Volume 1: Fundamental Algorithms (AddisonWesley, Third Edition).
4. Lipschutz, S., Data Structures, Schaum's Outline Series, Tata McGraw Hill.
5. Kruse, Data Structures & Program Design, Prentice Hall of India.
6. Aho, Haperoft and Ullman, The Design and analysis of Computer Algorithms, Pearson
Education India.
Instructions for paper setter:
The syllabus has been divided into three equal units. The paper setter is required to set Ten
questions in all, three questions from each unit and a compulsory question consisting of five sub
parts and based on the whole syllabus. The candidate will be required to attempt six questions
including the compulsory question number no 1 and not more than two questions from each unit.

Version 1.1, Page 77 of 155

Computer Science & Engineering

2012-13

CHANDIGARH UNIVERSITY, GHARUAN


Software Engineering (CST-302)
L T P Credits
3 1 -

3.5

Total Hours: 48
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.
UNIT-I

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 .
[6]
Software requirement: Requirement Analysis, Analysis principle, Software prototyping
Specification, Data modeling, Functional modeling and information flow, behavioral modeling,
Mechanics of structural modeling, Data dictionary.
[4]
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.
[6]
UNIT -II
Software design: Design process and concepts, Effective Modular design, The design model,
Design documentation, Approaches to Software design
[4]
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 .
[7]
User interface Design: Characteristics of good user interface design, Command language user
interface, Menu based, Direct manipulation interfaces, Fundamentals of command based user
interface.
[5]

Version 1.1, Page 78 of 155

Computer Science & Engineering

2012-13

UNIT-III
Software Testing: Testing levels, Activities, Verification and Validation, Unit testing, System
testing Integration testing, Validation testing, Black box and white box testing.

[4]

Quality management: Software quality, Software reliability, Software reviews, Formal


technical reviews, Statistical SQA, Software reliability, The ISO 9000 coding standards, SQA
plan, SEICMM.
[6]
Software Maintenance and Reuse: Definition, .Types of maintenance, Software reverse
engineering, Different Maintenance models, Basic issue in any reuse program, reuse approach.
[6]

Text Books:
4. Pressman Rogers, Software Engineering: A Practitioner's Approach, Sixth edition.
5. Somerville Ian, Software Engineering, Addison Wesley, 8th Edition.
Reference Books:
3. James FPeters and Pedryez Witold, Software Engineering An Engineering Approach,
Wiley Student Edition.
4. Kassem , Software Engineering, Cengage Learning.
Instructions for paper setter:
The syllabus has been divided into three equal units. The paper setter is required to set Ten
questions in all, three questions from each unit and a compulsory question consisting of five sub
parts and based on the whole syllabus. The candidate will be required to attempt six questions
including the compulsory question number no 1 and not more than two questions from each unit.

Version 1.1, Page 79 of 155

Computer Science & Engineering

2012-13

CHANDIGARH UNIVERSITY, GHARUAN


Simulation and Modeling (CST-303)
L T P Credit
3 - - 3
Total Hours: 48
Course Objectives:

To have a strong foundation on concept of simulation, and modeling.


To understand the techniques of random number generations.
To understand the techniques of testing randomness.
To design simulation models for various case studies like inventory, traffic
flow networks, etc.
To practice on simulation tools and acquire knowledge on building simulation systems
UNIT I

Introduction: Systems, modeling, general systems theory, Concept of simulation, Simulation as


a decision making tool, types of simulation.

[8]

Random Numbers: Pseudo random numbers, methods of generating random variables, discrete
and continuous distributions, testing of random numbers.
[8]
UNIT II
Design Of Simulation Experiments: Problem formulation, data collection and reduction, time
flow mechanism, key variables, logic flow chart, starting condition, run size, experimental
design consideration, output analysis and interpretation validation.
[10]
Simulation Languages: Comparison and selection of simulation languages, study of anyone
simulation language.

[7]

Version 1.1, Page 80 of 155

Computer Science & Engineering

2012-13

UNIT III
Case Studies: Development of simulation models using simulation language studied for systems
like queuing systems, Production systems, Inventory systems, maintenance and replacement
systems and Investment analysis.

[15]

Text Books:
1.Seila Andrew F."Applied Simulation Modeling, Cengage Learning.
2. Geoffrey Gordon, System Simulation, 2nd Edition, Prentice Hall, India.
3. Narsingh Deo, System Simulation with Digital Computer, Prentice Hall, India.
Reference Books:
1. Jerry Banks and John S.Carson, Barry L. Nelson, David M.Nicol, Discrete Event System
Simulation, 3rd Edition, Prentice Hall, India.
2. Shannon, R.E. Systems simulation, The art and science, Prentice Hall.
3. Thomas J. Schriber, Simulation using GPSS, John Wiley.
Instructions for paper setter:
The syllabus has been divided into three equal units. The paper setter is required to set Ten
questions in all, three questions from each unit and a compulsory question consisting of five sub
parts and based on the whole syllabus. The candidate will be required to attempt six questions
including the compulsory question number no 1 and not more than two questions from each unit.

Version 1.1, Page 81 of 155

Computer Science & Engineering

2012-13

CHANDIGARH UNIVERSITY, GHARUAN


Relational Data Base Management Systems (CST-304)
L T P Credit
3 1 -

3.5

Total Hours: 48
Course Objectives:

To have good understanding of database system concepts and design databases for
different applications.
To learn how to use a DBMS and RDBMS.
To implement and understand different types of DDL, DML and DCL statements.
To understand transaction concepts related to databases and recovery/backup techniques
required for the proper storage of data.
UNIT-I

Overview of Databases: Database concepts, DBMS, Data Base System Architecture (Three
Level ANSI-SPARC Architecture), Advantages and Disadvantages of DBMS, Data
Independence, DBA and Responsibilities of DBA, Relational Data Structure, Keys, Relations,
Attributes, Schema and Instances, Referential integrity, Entity integrity.
[6]
Data Models: Relational Model, Network Model, Hierarchical Model, ER Model: Design,
issues, Mapping constraints, ER diagram, Comparison of Models.
[4]
Relational Algebra & Relational Calculus: Introduction, Syntax, Semantics, Additional
operators, Grouping and Ungrouping, Relational comparisons, Tuple Calculus, Domain
Calculus, Calculus Vs Algebra, Computational capabilities.
[6]
UNIT-II
Functional dependencies and Normalization: Functional dependencies, Decomposition, Full
Functional Dependency (FFD), Transitive Dependency (TD), Join Dependency (JD), Multivalued Dependency (MVD), Normal Forms (1NF, 2NF, 3NF, BCNF), De-normalization. [8]
Database Security: Introduction, Threats, Counter Measures.

[2]

Control Structures: Introduction to conditional control, Iterative control and sequential control
statements, Cursors, Views.
[6]

Version 1.1, Page 82 of 155

Computer Science & Engineering

2012-13

UNIT-III
Package, Procedures and Triggers: Parts of procedures, Parameter modes, Advantages of
procedures, Syntax for creating triggers, Types of triggers, package specification and package
body, developing a package, Bodiless package, Advantages of packages.
[6]
Transaction Management and Concurrency Control: Introduction to Transaction Processing,
Properties of Transactions, Serializability and Recoverability, Need for Concurrency Control,
Locking Techniques, Time Stamping Methods, Optimistic Techniques and Granularity of Data
items.
[7]
Database Recovery of database: Introduction, Need for Recovery, Types of errors, Recovery
Techniques.
[3]
Text Books:
1. RamezElmasri and Shamkant B. Navathe, Fundamentals of Database System, The
Benjamin / Cummings Publishing Co.
2. Korth and Silberschatz Abraham, Database System Concepts, McGraw Hall.
3. Pratt, DBMS, Cengage Learning.

Reference Books:
1. C.J.Date, An Introduction to Database Systems, Addison Wesley.
2. Thomas M. Connolly, Carolyn & E. Begg, Database Systems: A Practical Approach to
Design, Implementation and Management, 5/E, University of Paisley, Addison-Wesley.
3. Rob, Database Principal Fundamental Design, Cengage Learning.
Instructions for paper setter:
The syllabus has been divided into three equal units. The paper setter is required to set Ten
questions in all, three questions from each unit and a compulsory question consisting of five sub
parts and based on the whole syllabus. The candidate will be required to attempt six questions
including the compulsory question number no 1 and not more than two questions from each unit.

Version 1.1, Page 83 of 155

Computer Science & Engineering

2012-13

CHANDIGARH UNIVERSITY, GHARUAN


Wireless Networks (CST-305)
L T P Credit
3 - - 3
Total Hours: 48
Course Objectives:
To familiarize with evolution, deployment and implementation of wireless networks
To critically examine existing and emerging wireless networks technologies.
To learn and analyze various IEEE standards for wireless telecommunications.
UNIT I

Introduction: History & evolution of wireless communication, Examples of wireless


communication, IEEE standards for wireless. , Overview of Existing Network Infrastructure,
Review of Seven- Layer OSI Model, Wireless Network Applications: Wireless Markets, Future
Wireless Networks.
[5]
Evolution and Deployment of Cellular Telephone Systems: Different Generation of Wireless
Cellular Networks, 1G Cellular Systems,2G Cellular Systems, 2.5G Cellular Systems, 3G
Cellular Systems, 4G Cellular Systems and Beyond, Wireless Standards Organizations.
[6]
Common Cellular System Components: Common Cellular Network Components, Hardware
and Software Views of the Cellular Network, 3G Cellular System Components, Cellular
Component Identification, Call Establishment.
[5]
UNIT-II
.Wireless Network Architecture and Operation: The Cellular Concept, Cell Fundamentals,
Capacity Expansion Techniques, Cellular Backhaul Networks, Mobility Management, Radio
Resources and Power Management, Wireless Network Security.
[6]

Version 1.1, Page 84 of 155

Computer Science & Engineering

2012-13

GSM and CDMA Technology: Introduction to GSM, TDMA and CDMA, GSM Network and
System Architecture, GSM Channel
[4]
Wireless Modulation Techniques And Hardware: Transmission Characteristics of Wireline
and Fiber Systems, Air Interface, Wireless Coding Techniques, Digital Modulation Techniques,
Ultra-Wide Band Radio Technology, GSM System Hardware, CDMA System Hardware
[6]
UNIT-III
Wireless LAN/IEEE 802.11x: Introduction to WLAN, Evolution, Design Issues, Layer
Operation, wireless LAN security, Competing wireless technologies, typical WLAN hardware
[5]
Wireless PANs : WPAN IEEE 802.15x Technologies, Wireless PAN Application and
Architecture, Bluetooth Link Controller Basics, Operational States, IEEE 802.15.1 Protocols,
Evolution of IEEE 802.15 Standards.
[6]
Broadband Wireless MANs: Introduction, IEEE 802.16 Wireless MANs, MAC Layers
Physical Layer, Common System Operations, Introduction to Emerging Wireless Technologies
[5]
Text Books:
1. Mullet, Wireless Telecommunication Systems & Networks, Cengage learning.
2. Theodre S. Rappaport, Wireless communication: Principles & Practices, Pearson.
Reference Books:
1. Behrouz A Forouzan , Data Communications & Networking , TMH.
2. Stallings William, Wireless Communication and Networks, Pearson Education Ltd.

Instructions for paper setter:


The syllabus has been divided into three equal units. The paper setter is required to set Ten
questions in all, three questions from each unit and a compulsory question consisting of five sub
parts and based on the whole syllabus. The candidate will be required to attempt six questions
including the compulsory question number no 1 and not more than two questions from each unit.

Version 1.1, Page 85 of 155

Computer Science & Engineering

2012-13

CHANDIGARH UNIVERSITY, GHARUAN


Simulation and Modeling Lab (CSP-306)
L T P Credit
-- 2

Course Objectives:

To learn use of MATLAB simulator with various exercises


To implement Real time applications using MatLab simulator.
UNIT I

1. Write a statement to evaluate each of common mathematical expressions like Square,


square root, Sine, cosine functions.
2. Write a statement that converts temperature in Fahrenheit, f, to Celsius, c
3. Write a program to create a vector containing the rst n Fibonacci numbers.
4. Use the Matlab function is prime to discover which of the rst 40 Fibonacci numbers are
prime.
UNIT II
5. Calculate the day of the week when you were born using Calendar function.
6. Generate an m-by-n matrix with random entries between 0 and 1 using Matlab function
rand(m,n)
7. Write code for Performing Vector-matrix multiplication.
8. Write code for performing arithmetic operations on Matrices.
UNIT III
9. Using geometry, trigonometry and arithmetic with complex numbers, arrange the four
pieces to form the capital T shape.
10. Write code to design Tic Tac Toe game.
11. Write statements to implement Sudoku Game.

Version 1.1, Page 86 of 155

Computer Science & Engineering

2012-13

CHANDIGARH UNIVERSITY, GHARUAN


Software Engineering Lab (CSP-307)
L T P Credits
-

- 4 2

Course Objectives:

To study and draw different level DFD and charts.


To study and design models using UML modeling objects

UNIT I
1. To draw a different level DFD.
2. To draw a ER diagram.
3. To draw a case diagrams.

UNIT II
4. To draw a sequence diagrams.
5. To draw a class diagrams.
6. To draw collaboration diagrams.

UNIT III
7. To draw Gantt chart and network diagram.
8. To draw a structured chat.

Version 1.1, Page 87 of 155

Computer Science & Engineering

2012-13

CHANDIGARH UNIVERSITY, GHARUAN


Relational Database Management Systems Lab (CSP-308)
L T P Credits
- - 4 2

Course Objectives:

To enable students to retrieve and update data from relational databases.


To implement programs using procedural language structure.
To have good understanding of implementation and use of cursors, procedures,
packages, triggers etc.
UNIT-I

1. To implement different types of DDL, DML, and DCL queries.


2. To explore SELECT clause using where, order by, between, like, group by, having etc.
UNIT-II
3. Introduction and implementation of programs using
a. Block Structure and Variables
b. To write programs using control structures of
i. If-else statements.
c. To write programs using loops like
i. For
ii. Do-while
iii. while
d. Cursors
e. Views
UNIT-III
4. Introduction and implementation of programs of
a. Procedures
b. Packages
c. Triggers

Version 1.1, Page 88 of 155

Computer Science & Engineering

2012-13

CHANDIGARH UNIVERSITY
GHARUAN

Scheme & Syllabus of B.E.


Computer Science &Engineering [CSE]
6th Semester

Version 1.1, Page 89 of 155

Computer Science & Engineering

2012-13

CHANDIGARH UNIVERSITY GHARUAN


Theory of Computation (CST-321)
L T P Credit
3 1 -

3.5

Total Hours: 48
Course Objectives:

To understand the concept of formal languages and their relation with finite automata.
To study and design different finite automata.
To study context free grammars and ambiguity related issues.
To gain familiarization with Push- Down Automata and Turing Machines.
To explore relationship between different classes of formal languages.
UNIT -I

Introduction: Basic Terminology: Alphabet, Formal Language and operations on formal


languages, Examples of formal languages.
[4]
Finite automata : Concept of Basic Machines, Properties and Limitations of Finite State
Machines,
Deterministic
Finite
Automata(DFA),Non-Deterministic
Finite
Automata(NFA),Equivalence of DFA and NDFA , Non-Deterministic Finite automata with Transitions.
[7]
Regular expression: Regular Languages and Regular Expressions, Kleens Theorem. Ardens
Method.
[5]
UNIT II
Properties of Regular sets: The Pumping Lemma for Regular sets, Application of the Pumping
Lemma, Closure Properties of Regular Sets, Myhill- Nerode Theorem and Minimization of
Finite Automata, Minimization Algorithm.
[6]
Finite Automata with output: Moore and Mealy Machines. Equivalence of Moore and Mealy
Machines.
[4]

Version 1.1, Page 90 of 155

Computer Science & Engineering

2012-13

Context Free Grammars: Examples and Definitions, Derivation trees and ambiguity, An
Unambiguous CFG for Algebraic Expressions. Regular Grammar, Simplified forms and Normal
forms: Removal of useless symbols and unit production, Removal of -moves, Chomsky
Normal Form (CNF), Griebach Normal Form (GNF).
[7]
UNIT-III
Pushdown Automata: Introduction and Definition of Push-Down Automaton, Applications of
Push Down Automata.
[4]
Turing Machines: Definitions and Examples, Deterministic and Non- Deterministic Turing
Machines, Unsolvable Problems: A Non-recursive Language and an Unsolvable Problem, PCP
Problem and MPCP Problem.
[6]
More General Languages and Grammars: Recursively Enumerable and Recursive Languages,
Unrestricted grammars, Context sensitive Language and grammar. Relation between languages
of classes, Chomsky hierarchies of grammars.
[5]
Text Books:
1.

Martin J.C., Introduction to Languages and Theory of Computation, Tata McGrawHill Publising Company Limited, 3rd Edition.
2. Hopcroft J.E. and Ullman J.D., Introduction to Automata Theory Languages and
Computation, Narosa Publications.
Reference Books:
1. Sipser, Theory Of Computation, Cengage Learning.
2. Daniel I.A. Cohen, Introduction to computer Theory, John Wiley.
Instructions for paper setter:
The syllabus has been divided into three equal units. The paper setter is required to set Ten
questions in all, three questions from each unit and a compulsory question consisting of five sub
parts and based on the whole syllabus. The candidate will be required to attempt six questions
including the compulsory question number no 1 and not more than two questions from each unit.

Version 1.1, Page 91 of 155

Computer Science & Engineering

2012-13

CHANDIGARH UNIVERSITY, GHARUAN


Software Project Management (CST-322)
L T P Credit
3 - -

Total Hours: 48
Course Objectives:

To study software planning and scheduling methods.


To detail various software auditing and testing techniques.
To learn about Risk analysis and management.
To study software quality concepts and standards.
UNIT-I

Introduction to Project Management: The characteristics of software projects, Objectives of


project management: time, cost and quality, Basics of Project Management, Stakeholders, Stages
of Project, The Feasibility Study, Cost-benefit Analysis, Planning, Project Execution, Project and
Product Life Cycles, Project Management Knowledge areas, Project Management Tools &
Techniques, Project success factors, role of project manager.
[5]
Project Management & Planning: System view of project management,
Understanding organizations, stakeholders management, project phases & project life
cycles. Why planning is necessary, Iterative steps for planning, Project Plan documentation
methods, Software Requirement Specification.
[4]
Measurement and Control: Measurements for project monitoring, what and when to measure,
Plan versus Control, managing the plan, The Deadline Effect. Reviews, feedback and reporting
mechanisms, revisiting the plan.
[4]
Project Scope Management: Scope Planning & Scope management plans, Function point
calculation, Scope definitions & project scope statement, Work Breakdown Structure (WBS),
WBS dictionary, scope verification, scope control.
[4]

Version 1.1, Page 92 of 155

Computer Science & Engineering

2012-13

UNIT-II
Time Management: Project time management, activities sequencing, network diagrams, activity
recourse estimation, activity duration estimation, schedule development, Gantt Charts, Critical
path method, Programme evaluation & review technique (PERT) and CPM, concept of slack
time, schedule control.
[4]
Project Cost management: Basis principles of cost management, Cost estimating, type of cost
estimate, cost estimate tools & techniques, COCOMO, Putnam/ SLIM model Estimating by
Analogy, cost budgeting, cost control, earned value management, project portfolio management.
[5]
Project Quality Management: Quality Planning, quality Assurance, Quality control, Tool &
techniques for quality control, Pareto Analysis, Six Sigma, CMM, ISO
Standards, Juran Methodology.
[3]
Project
Human
Resource
Management:
Human
resource
planning,
project organizational charts, responsibility assignment metrics, acquiring project team, resource
assignment, resource loading, resource leveling, Different team structures developing project
teams.
[4]

UNIT-III
Project Communication Management: Communication Planning, Performance reporting,
managing stakeholders, improving project communication.
[3]
Project risk management: Risk Management planning, common sources of risk, risk
identification, risk register, qualitative risk analysis, using probability impact matrixes,
expert judgement, qualitative risk analysis, decision trees & expected monetary value,
simulation, sensitivity analysis, risk response planning, risk monitoring & control.
[6]
Project procurement management: Procurement management plans, contract statement of
work, planning contracts, requesting seller responses, selecting sellers, administrating the
contract, closing the contract.
[3]

Version 1.1, Page 93 of 155

Computer Science & Engineering

2012-13

Software Configuration Management: Why versions exist, why retain versions, SCI, Releases
vs. version. Change Control and Management.
[3]
Text Books:
1. Mohapatra, Software Project Management, Cengage Learning.
2. SchwalbeKathy ; Information Technology Project Management fourth edition,
Thomson Course Technology.
3. Hughes Bob and Cotterell Mike , Software Project Management, Third Edition, Tata
McGraw-Hill.
References:
1.Jalote Pankaj , Software Project Management in Practice, Pearson Education.
2. S.A. Kelkar, Software Project Management, A Concise Study, Revised Edition, PrenticeHall India.
Instructions for paper setter:
The syllabus has been divided into three equal units. The paper setter is required to set Ten
questions in all, three questions from each unit and a compulsory question consisting of five sub
parts and based on the whole syllabus. The candidate will be required to attempt six questions
including the compulsory question number no 1 and not more than two questions from each unit.

Version 1.1, Page 94 of 155

Computer Science & Engineering

2012-13

CHANDIGARH UNIVERSITY, GHARUAN


Computer Graphics (CST-323)
L T P Credits
3 1

0 3.5

Total Hours: 48
Course Objectives:

To understand growing importance of graphics in computer field.


To gain familiarity with basic algorithms and techniques of computer graphics.
To prepare students to design graphics systems and application programs
UNIT- I

Introduction: Origins of Computer Graphics, Interactive Graphics display working, Scan


conversion; Raster and Random scan conversion. Point plotting techniques: Coordinate systems,
Incremental methods, Line drawing algorithms: Simple DDA, Symmetrical DDA, Bresenhams
algorithm. Midpoint circle drawing algorithm, Circle generators.
[8]
Line Drawing Displays: Display devices and Controllers, CRT, Inherent memory devices,
Storage tube display, Refresh line drawing displays.
[3]
2-D Transformations:
Transformation principles, Homogeneous coordinate systems,
Concatenations, Matrix representations of transformations.
[5]
UNIT-II
Clipping and Windowing: Point clipping, Line clipping algorithms: Cohen Sutherland
algorithm, Midpoint subdivision algorithm. Polygon clipping, Viewing transformations,
Windowing transformations.
[6]
Graphics Packages: Ground rules for graphics software design, Functional domains, Graphic
primitives, Windowing functions, miscellaneous functions, Display code generator.
[4]
Interactive Graphics: Graphical input devices: Pointing and Positioning devices, Mouse,
Tablets, light pen, 3-D Input devices, Comparators. Graphical input techniques: Positioning
Version 1.1, Page 95 of 155

Computer Science & Engineering

2012-13

techniques, Pointing and Selection, Inking and Painting, On-line character recognition.
[6]
UNIT-III
Solid Area Scan Conversion: Geometric representation of areas, Scan converting polygons,
Priority, The Y-X algorithm, Properties of scan conversion algorithms.
[4]
3-D Graphics: Curves and Surfaces: Parametric functions, Bezier methods and B-Spline
methods. Three dimensional transformations, Perspective transformations, Perspective depth.
[6]
Hidden Surface Elimination: Basic approaches, Depth Buffer algorithm, Scan line coherence
algorithms, Area coherence algorithms, Priority algorithms.
[6]
Text Books:
1. Newman, William M., Sproull, Robert F., Principles of Interactive Computer
Graphics, Tata McGraw Hill Company, 2nd Edition.
2. Hearn, D., Baker M. P. ,Computer Graphics, Pearson education.
3. Xiang Z., Plastock R., Computer Graphics, Schaums outlines, Tata Mcgraw Hill
Companies.
Reference Books:
1. Harrington, S., Computer Graphics: A Programming Approach, Tata McGraw Hill.
2. Roggers, D.F., Procedural Elements for Computer Graphics, Tata McGraw Hill.

Instructions for paper setter:


The syllabus has been divided into three equal units. The paper setter is required to set Ten
questions in all, three questions from each unit and a compulsory question consisting of five sub
parts and based on the whole syllabus. The candidate will be required to attempt six questions
including the compulsory question number no 1 and not more than two questions from each unit.

Version 1.1, Page 96 of 155

Computer Science & Engineering

2012-13

CHANDIGARH UNIVERSITY, GHARUAN


Engineering Economics & Principles of Management (HUT-324)
L T P Credits
3 - - 3
Total Hours: 48
Course Objectives:

To co-relate students knowledge in management concepts with engineering situations.


To lay a foundation for further studies in business management.
UNIT-I

Engineering Economics: Introduction to engineering economics, nature, scope & importance of


economics in engineering.
[4]
Fundamentals of Demand: Determinants of demand, Law of Demand and its Exceptions,
elasticity of demand-price , income & cross elasticity, Objectives of demand forecasting, steps in
demand forecasting & methods of demand forecasting.
[6]
Break Even Analysis: Meaning of break even analysis, assumptions of breakeven analysis,
equation method & graphical representation to find breakeven point, advantages & limitations of
break even analysis, Economic Order Quantity.
[7]
UNIT-II
Economic Analysis Of Investment: Meaning of economic analysis of investment or capital
budgeting, process of capital budgeting ,factors affecting capital investment decisions,
techniques used in economic analysis of investment; payback period method, rate of return
method, net present value method, internal rate of return method, profitability index method.
[6]
Depreciation: Concept of depreciation in industry, causes of depreciation, types of depreciation
& methods of collecting depreciation.
[4]

Version 1.1, Page 97 of 155

Computer Science & Engineering

2012-13

Introduction to Management: Definition, Process, Functions, Skills and Traits of Effective


Managers. Evolution of Management thoughts Contribution of F.W. Taylor, Henry Fayol,
Elton Mayo, and Hawthorne studies. Management Approaches - System approach, Contingency
approach, MBO, TQM, Six Sigma
[6]
UNIT-III
Planning & Organizing: Meaning & process of planning, types of plans, Importance of
planning in industry, process & significance of organizing, formal & informal organization,
principles of organizing, span of management
[4]
Staffing,: Manpower planning, Recruitment & Selection, Training & overview of Performance
Appraisal, Career Planning & Development.
[6]
Directing & Controlling Factors affecting motivation, financial & non-financial motivators,
benefits of motivation, Maslow & Herzberg theory of motivation, meaning & process of
controlling, importance of controlling in an in industry.
[5]
Text Books:
1 Koontz, O'Donnell, Weigh rich: Essentials of Management, Tata McgrawHill , New
Delhi.
2 Dwivedi, D.N., Principles of economics, Vikas Publishers, New Delhi.
Reference Books:
1 Daft, New Era Of Management, Cengage Learning.
2 Ghuman Karminder and K Aswathappa, Management Concepts, Practice and Cases,
Tata McGraw Hill, New Delhi.
Instructions for paper setter:
The syllabus has been divided into three equal units. The paper setter is required to set Ten
questions in all, three questions from each unit and a compulsory question consisting of five sub
parts and based on the whole syllabus. The candidate will be required to attempt six questions
including the compulsory question number no 1 and not more than two questions from each unit.

Version 1.1, Page 98 of 155

Computer Science & Engineering

2012-13

CHANDIGARH UNIVERSITY, GHARUAN


Computer Graphics Lab (CSP-325)
L T P Credits
-

- 4 2

Course Objectives:

To study line, circle using different algorithm in graphics.


To experience the various clipping algorithms.
To study different curves using graphics.
UNIT-I

1. To draw a line using Simple DDA, Symmetrical DDA and Bresenhams Algorithm for
positive line slope.
2. To draw a line using Simple DDA, Symmetrical DDA and Bresenhams Algorithm for
negative line slope.
3. To draw a line, triangle and circle using functions of graphics.h header file.
4. To display simple shapes (Like hut, star, car etc.) using graphics primitives
5. To perform translation, scaling and rotation transformations on a given triangle.
6. To rotate a given triangle clockwise and anticlockwise about a given point.
UNIT-II
7. To perform reflection of a point about a line y= mx+c.
8. To draw a circle with a given center and radius using midpoint circle algorithm.
9. To draw a circle with a given center and radius using circle generator algorithm.
10. To display 4-bit region code for end points of a line and check whether line is completely
on the screen or off the screen.
11. To clip a line intersecting at one point with given window using Cohen Sutherland Line
Clipping algorithm.
12. To clip a line intersecting at Two or more points with given window using Cohen
Sutherland Line Clipping algorithm.
UNIT-III
13. To display the result of window to viewport transformation.
14. To calculate and display blending functions for Bezier Curves.
15. To draw a Bezier curve passing through four control points.
Version 1.1, Page 99 of 155

Computer Science & Engineering

2012-13

16. To calculate and display blending functions for B-Spline Curves


17. To draw a B-Spline curve.
18. To read and display an image of given size in BMP format.
Note: Above programs should be implemented using C/C++.

Version 1.1, Page 100 of 155

Computer Science & Engineering

2012-13

CHANDIGARH UNIVERSITY, GHARUAN


Software Project Management Lab (CSP-326)
L

P Credits

2 1

Course Objectives:

To learn Software Quality Control Techniques


To optimize Software Testing.
To understand verification & validation techniques.

Note: Students are required to design and develop a Project / CASE STUDY following all the
Phases of Software Development Life Cycle.

Version 1.1, Page 101 of 155

Computer Science & Engineering

2012-13

CHANDIGARH UNIVERSITY, GHARUAN


Elective 1 - Software Testing and Quality Assurance (CST-331)
L T P Credits
310

3.5

Total Hours: 48

Course Objectives:

To understand the different methods and techniques of software testing and quality
assurance
To learn tracking of bugs in the software
To plan and design various test cases and to use different test tools
To develop error free and quality software.
UNIT I

Fundamentals and Testing types: First, second and later cycles of testing. Objectives and
limits of testing, Overview of S/W development stages, Planning and Design stages and testing
during these stages. Glass box code, Regression and Black box testing, Software errors,
Categories of software error.
[7]
Reporting and analyzing bugs: Problem reports, Content and Characteristics of Problem
Report, analysis and Tactics for analyzing a reproducible bug. Making a bug reproducible [5]

Problem Tracking System: Objective of Problem Tracking System, tasks of the system,
Problem trackingoverview, users of the tracking system, mechanics of the database
[4]
UNIT II
Test Case Design: Characteristics of a good test, equivalence classes and boundary values,
visible state transitions, Race conditions and other time dependencies, load testing. Error
guessing, Function equivalence testing, Regression Testing, General issues in configuration
testing, printer testing.
[8]
Version 1.1, Page 102 of 155

Computer Science & Engineering

2012-13

Testing Tools and Test Planning: Fundamental tools, Automated acceptance and regression
tests, standards, Translucent box testing Overall objective of the test plan: product or tool?
Detailed objective, type of test, strategy for developing components of test planning documents,
components of test planning documents, documenting test materials
[7]
UNIT III
Software Quality Assurance Concepts and Standards : Concepts of software quality, quality
attributes, software quality control and software quality assurance, Quality Concepts, Quality
Control, Quality Assurance, SQA Activities, Software Reviews, Formal Technical Reviews,
Review Guidelines, Software Reliability, Software Safety, Quality Assurance Standards, ISO
9000, ISO 9001:2000, ISO 9126 Quality Factors, CMM, TQM, Six Sigma, SPICE, Software
Quality Assurance Metrics.
[8]
Quality related issues: S/W Development tradeoffs and models, Quality-related costs, The
development time line, Product design, alpha, Pre-beta, Beta, User Interface freeze, Pre-final,
Final integrity testing, Project post-mortems, Legal consequences of defective software,
Managing and role of a testing group, independent test agencies
[9]
Text Books:
1. CemKaner, Jack Falk, HungQuoc Nguyen, Testing Computer Software, Wiley, (Second
Edition).
2. William E. Perry, Effective Methods for Software Testing, John Wiley & Sons.
3. Boris Beizer,Software Testing Techniques, Second Edition, Dreamtech.
Reference Books:
1. Rex Black, Managing the Testing Process: Practical Tools and Techniques for
Managing Hardware and Software Testing .
2. Daniel Galin, Software Quality Assurance from Theory to Implementation, Pearson
Education.
Instructions for paper setter:
The syllabus has been divided into three equal units. The paper setter is required to set Ten
questions in all, three questions from each unit and a compulsory question consisting of five sub
parts and based on the whole syllabus. The candidate will be required to attempt six questions
including the compulsory question number no 1 and not more than two questions from each unit.

Version 1.1, Page 103 of 155

Computer Science & Engineering

2012-13

CHANDIGARH UNIVERSITY, GHARUAN


Elective 1 - Linux Programming (CST-332)
L T P CREDITS
3 10

3.5

Total Lectures: 48
Course Objectives:

To define the basic concepts of Linux and shell programming.


To learn System administration issues and commands
To understand Shell structure and commands.
To discuss Linux file system and file commands
UNIT I

Installation and Hardware configuration: Creating an Installation Diskette, Booting Linux


Installation Program, Partitioning Hard Drive(s), Setting up Swap Space Choosing Partitions to
Format Booting with LILO, Multi-boot with Other Operating Systems.
[8]
Getting started: Basic concepts of Linux, their features and advantages, Architecture of Linux,
Files, directories, subdirectories, and processes, Filters and little languages: grep, cut, paste, tr,
sort, shift, vi, sed, awk.
[8]
UNIT II
Introduction to Linux Files: Rules for creating files, Linux Files system, File printing,
searching files using grep, change permission to set files and change owner of the files. Process,
Listening with ps, killing with kill, PID, UID, GID, Signals, nice, renice.
[8]
General Administration issues: root account, Creating user in Linux, Changing password,
deleting user, disabling user account, Linux Password & Shadow File Formats System Shutdown
and Restart creating groups, Custom Configuration and Administration Issues, Simple
commands.
[8]

Version 1.1, Page 104 of 155

Computer Science & Engineering

2012-13

UNIT III
Introduction to Shell and editors: Definition, Types of Shell, Feature and benefits of Shell. I/O
redirection and Piping, pipes, filters, Introduction to various text editor, various Vi editing
modes, scrolling, yank and paste, put and delete, set commands, Comparison of Emacs Editor, vi
Editor, Pico Editor.
[8]

Shell programming: Environmental & user defined variables, Argument Processing, Shells
interpretation at prompt, Arithmetic expression evaluation, Control Structure Redirection,
Background process & priorities of process, Conditional Execution, Parameter & quote
substitution.
[8]

Text Books:
1. Ellen Siever, Robert Love and Arnold Robbins, Linux in Nutshell, Fifth Edition, Oreilly
Media.
2. Kurt Wall, Mark Watson, Mark Whitis, Linux Programming, Third Edition, SAMS
Techmedia.
3. Mark Sobell, Practical Guide to Linux Programming, Pearson Education. Unix Shell
Programming, Kochan and Wood, Sams.
Reference Books:
1. Understanding Unix/Linux Programming, Molay, Prentice Hall.
2. MachteltGarrels, Introduction to Linux-A Hands on Guide, Addison Wisley.
3. J.Purcell, Linux Complete Command Reference, Red Hat Software, McGraw-Hill.
4. Haviland and Salama,Unix System Programming, Addison Wesley.
5.Gray, Interprocess Communications in Unix, Prentice Hall.
Instructions for paper setter:
The syllabus has been divided into three equal units. The paper setter is required to set Ten
questions in all, three questions from each unit and a compulsory question consisting of five sub
parts and based on the whole syllabus. The candidate will be required to attempt six questions
including the compulsory question number no 1 and not more than two questions from each unit.

Version 1.1, Page 105 of 155

Computer Science & Engineering

2012-13

CHANDIGARH UNIVERSITY, GHARUAN


Elective 1: Object Oriented Software Engineering (CST-333)
L T P CREDITS
3 1 0 3.5
Total Lectures: 48
Course Objectives:

To learn working knowledge of the underlying foundations of object-oriented design and


analysis.
To analyze problems and develop conceptual models.
To study various modeling diagrams.
UNIT-I

Requirement Elicitation: Introduction to Object Oriented Methodology, Overview of


Requirements Elicitation, Requirements Model-Action & Use cases, Requirements Elicitation
Activities, Managing Requirements Elicitation.
[8]
Modeling with UML: Static and dynamic models, Need of modeling, UML diagrams: Class
diagram, interaction diagram, collaboration diagram, sequence diagram, statechart diagram,
activity diagram, implementation diagram.
[8]
UNIT -II
Architecture: Introduction, System development is model building, model architecture,
requirements model, analysis model, the design model, the implementation model, test model.
[8]
Analysis: Introduction, the requirements model, the analysis model .
[8]

UNIT-III
Construction: Introduction, the design model, block design, working with construction.

[8]

Version 1.1, Page 106 of 155

Computer Science & Engineering

2012-13

Testing: Introduction, on testing, unit testing, integration testing, system testing, the testing
process.
[8]
Text Books:
1. BoochGrady , Object-Oriented Analysis and Design with Applications, Addison-Wesley.
2. JacabsonIvar , The Unified Software Development Process, Prentice Hall.
Reference Books:
1. Martin, Object-oriented analysis and design, Prentice Hall.
2. Booch Grady, Object oriented design with applications, Benjamin/Cummings.
3. Richard C. Lee, William M. Tepfenhard, UML and C++, A Practical guide to objectoriented Development, Pearson Education.
4. Stephen R. Scach, Classical & Object Oriented Software Engineering with UML and Java,
McGraw Hill.
.
Instructions for paper setter.
The syllabus has been divided into three equal units. The paper setter is required to set Ten
questions in all, three questions from each unit and a compulsory question consisting of five sub
parts and based on the whole syllabus. The candidate will be required to attempt six questions
including the compulsory question number no 1 and not more than two questions from each unit.

Version 1.1, Page 107 of 155

Computer Science & Engineering

2012-13

CHANDIGARH UNIVERSITY, GHARUAN


Elective 1: Enterprise Integration (CST-334)
L T P Credits
3 1 - 3.5
Total Hours: 48
Course Objective:

To understand complexity of enterprise applications


To differentiate between Java platforms J2SE, J2ME, and J2EE
To understand J2EE architecture and components

Unit-I
J2EE: Introduction to J2EE, Building J2EE Applications, JDBC, Servlets and WebApplications,
Java Server Pages and Model/View/Controller, J2EE Web Services Overview, Introduction to
EJB, Session EJBs, Entity EJBs, JMS and message drivenBeans, Transactions and Security,
Application Servers (Case Study of any one of IBMWebsphere, BEA Weblogic, JBoss).
[16]
Unit-II
Hibernate: Principles of Object Relational Mapping, Hibernate configuration, HQLmaking
objects persistent, Hibernate semantics, Session management, flushing, concurrency and
Hibernate, Optimistic and Pessimistic Locking, Object mapping Mapping simple properties,
Single and multi valued associations, Bi-directional associations, Indexed collections, Using
Hibernate Template, Querying, Session management, Transaction integration and demarcation.
[16]
Unit-III
Spring: Introduction of Spring Framework: Spring Architecture, Spring Framework definition,
Spring & MVC, Factory Pattern, BeanFactory, Spring Context definition, Inversion of Control
(IoC), Spring AOP, Application Context and BeanFactory, SpringORM, Mapping API for JDO,
Hibernate, Hibernate Mapping, JDO Mapping, iBATIS,Spring Abstract Transaction layer,
Employing Spring transaction, Using EJB declarative transactions, Integration process,
integrating Spring MVC in web application, MVC inweb application, MVC Framework. [11]

Version 1.1, Page 108 of 155

Computer Science & Engineering

2012-13

Web Services: Introduction to XML, Service-Oriented Architectures SOAP, SOAPmessage


structure, handling errors WSDL, UDDI, Java Web Service implementationsJAX-RPC, Web
service clients in Java, Introduction to Ajax.
[5]

Text Books:
1. Jim Farley, William Crawford, Java Enterprise in a Nutshell,OReilly and Associates.
2. Brett McLaughlin, Java and XML, OReilly, 2nd Edition.
3. PradhanAnubhav, NanjappaSatheesha B., Nallasamy Senthil K, Esakimuthu Veerakumar
Raising Enterprise Applications: A Software Engineering Perspective, Willey India.

Reference Books:
1. Elliott Rusty Harold and W. Scott Means, XML in a Nutshell,OReilly.
2. James Cooper, Java Design Patterson: A Tutorial, Addison Wesley.
3. GovindSesadri, Enterprise java Computing: Application and Architectures,Cambridge
University Publications.

Instructions for paper setter.


The syllabus has been divided into three equal units. The paper setter is required to set Ten
questions in all, three questions from each unit and a compulsory question consisting of five sub
parts and based on the whole syllabus. The candidate will be required to attempt six questions
including the compulsory question number no 1 and not more than two questions from each unit.

Version 1.1, Page 109 of 155

Computer Science & Engineering

2012-13

CHANDIGARH UNIVERSITY, GHARUAN


Elective 1-Advanced Programming (CST-335)
L T P Credits
3 1 - 3.5
Total Hours: 48
Course Objectives:

To understand characteristics of good programming languages.


To understand how a program is shaped by the language used to express it.
To gain familiarization with elementary and structured data types, sequence control, data
control and storage management concepts in programming languages.
Unit-I

Introduction: Programming languages and natural languages, A brief history of programming


languages, Characteristics of a good programming language, Programming language translators,
compiler & interpreters
[6]
Syntax & Semantics: Introduction, general problem of describing syntax, formal method of
describing syntax, attribute grammar dynamic semantic.
[5]
Elementary data types Data objects, variable & constants, data types, Specification &
implementation of elementary data types, Declarations , type checking & type conversions,
Assignment & initialization, Numeric data types, enumerations, Booleans & characters.
[5]
Unit-II
Structured Data Types: Structured data object and data types, specification and implementation
of structured data types, declarations and type checking for data structures, vector and arrays,
records, character strings, variable sized data structures, pointers and programmer-constructed
data objects, sets, files.
[6]
Subprogram And Programmer-Defined Data Types: Evolution of the data type concept,
Abstraction, encapsulation, and information hiding, subprogram, type definitions, abstract data
types, over loaded subprograms, generic subprograms.
[4]

Version 1.1, Page 110 of 155

Computer Science & Engineering

2012-13

Sequence Control: Implicit and explicit sequence control, sequence control within expression,
sequence control between statements, subprogram sequence control, recursive subprogram,
exceptions and exception handlers, Co-routines, scheduled subprograms, tasks and concurrent
execution, Concurrency subprogram level concurrency, synchronization through semaphores,
monitors & message passing
[6]
Unit-III
Data Control: Names & referencing environment, static & dynamic scope, block structure,
Local data & local referencing environment, Shared data: dynamic & static scope. Parameter &
parameter transmission schemes.
[5]
Storage Management: Major run time elements requiring storage, programmer and system
controlled storage management & phases, Static storage management, Stack based storage
management, Heap storage management: variable & fixed size elements.
[6]
Programming Languages: Introduction to procedural, non-procedural, structured, logical,
functional and object oriented programming languages Java/C++, Concepts of Thread,
Comparison of C & C++ programming languages.
[5]
Text Books:
1. Pratt T.W., Programming languages Design & implementation, Prentice Hall Pub, New
Delhi, 1996.
2. Sabesta R.W., Concepts of Programming Languages, Addision Wesley, 9th edition.
3. Horowitz E., Fundamentals of Programming languages Galgotia publications (Springer
Verlag).
Reference Books:
1. Ghezzi C., Programming languages concepts, 1989, Wiley Publications.
2. Tucker A. and Noonan R., Programming Languages Principles and Paradigms, 2002,
T.M.H.
3. Meyers Scott,Effective C++ , e-book.
Instructions for paper setter.
The syllabus has been divided into three equal units. The paper setter is required to set Ten
questions in all, three questions from each unit and a compulsory question consisting of five sub
parts and based on the whole syllabus. The candidate will be required to attempt six questions
including the compulsory question number no 1 and not more than two questions from each unit.
Version 1.1, Page 111 of 155

Computer Science & Engineering

2012-13

CHANDIGARH UNIVERSITY, GHARUAN


Elective 1: Software Testing and Quality Assurance Lab (CSP-334)
L T P Credits
-- 2 1
Course Objectives:

To learn use of testing automation tool- Rational Functional Tester.


To study difference between manual & automation testing.
To implement test cases on classics Application.
UNIT I

1. To implement test cases on classics application to become familiar with the sample application.
2. To record a simple script using the sample application for getting started with IBM rational
functional tester.
3. To set up regular expressions for dynamic values (pattern based recognition technique).
4. To play back scripts, call another script from an existing one and view results setting up the
preferences.
UNIT II
5.To select the type of Test Log Output (HTML, TXT, Test log in Test Manager) and insert delays
in the script.
6.To insert Timers in the script and user defined log entries.
7.To create custom classes and functions (Helper classes).
8.To import user defined packages and classes.
9.To create, use, display and modify a test object map.
UNIT III
10. To control Object-matching sensitivity and set up pattern based object recognition.
11. To run the Regression tests and import data from CSV files.
12. To create data pools and connect them to scripts.
13. To record troubleshooting and tips.
14. To record scripts to test HTML applications.

Version 1.1, Page 112 of 155

Computer Science & Engineering

2012-13

CHANDIGARH UNIVERSITY, GHARUAN


Elective 1: Linux Programming Lab (CSP-335)
L T P Credits
- - 2 1
Course Objectives:

To work with different editors.


To administer the Linux System
To hand on practice on shell programming.
UNIT I
1.
2.
3.
4.
5.

Login to a Linux system using secure shell.


Define and understand absolute verses relative path names using commands.
Run basic commands from the shell prompt.
Get help for known commands.
Define the purpose of the shell using basic commands.
UNIT II

Create, change and remove directories.


Use file name substitution at the command line.
Define and use in a command line redirection and piping
Use standard in, standard out and standard error on a command line
10. Use the vi editor using various commands
6.
7.
8.
9.

UNIT III
11. Create regular expressions and know when and how to use them.
12. Change owner, group and permissions at the command line
13. Create a shell script and execute it.
14. Create system variables and know how and when to use them in a shell script.
15. Use of command arguments in a shell script.
16. Use looping and decision statements in a shell script
17. Allow a shell script to prompt the user and get information from the command line.

Version 1.1, Page 113 of 155

Computer Science & Engineering

2012-13

CHANDIGARH UNIVERSITY, GHARUAN


Elective 1: Object Oriented Software Engineering Lab (CSP-336)
L T P Credits
- - 2 1

Course Objectives:

Get familiar with UML.


Learn a number of CASE tools and use them in a project within a team work
environment.
UNIT-I

1. To draw a use case diagrams using Rational Software Architect.


2. To draw a sequence diagrams using Rational Software Architect.
3. To draw a class diagrams using Rational Software Architect.
UNIT II
4. To draw collaboration diagrams using Rational Software Architect.
5. To draw a activity diagrams using Rational Software Architect.
6. To draw a interaction diagrams using Rational Software Architect.

UNIT-III

7. To draw a state transition diagrams using Rational Software Architect.


8. To draw a component diagrams using Rational Software Architect.
9. To draw a deployment diagrams using Rational Software Architect.

Version 1.1, Page 114 of 155

Computer Science & Engineering

2012-13

CHANDIGARH UNIVERSITY, GHARUAN


Elective 1: Enterprise Integration Lab (CSP-337)
L T P Credits
- - 2 1
Course Objectives:

To study the concepts, techniques, and system standards relevant to system-level and
data-level integration
To explore the pragmatics of enterprise integration using Rational Software Architect,
Rational Team Concert, Rational Application Developer
To develop the art of preparing and delivering fluid, concise, and effective talks and
presentations
UNIT I

1. To study and evaluate Enterprise Integration Architecture using Eclipse/ Rational


Application Developer
2. To study the Agile Development using Rational Team Concert
3. Examine the extreme programming and pair programming
4. Evaluate and study Rapid development strategies using Rational Team Concert
UNIT II
5. To explore UML and design patterns
6. Evaluate Enterprise Integration using CASE development methodologies and tools
7. To handle Software deployment and configuration management
8. Evaluate Software maintenance using Agile Concepts
UNIT III
9. To examine Software reuse ability using UML
10. To explore Functionalities of Enterprise Information Systems
11. To manage Performance evaluation of Enterprise Information Systems using IDE.

Version 1.1, Page 115 of 155

Computer Science & Engineering

2012-13

CHANDIGARH UNIVERSITY, GHARUAN


Elective 1: Advanced Programming Lab (CSP-338)
L T P Credits
- - 2 1
Unit-I
1. Read two integers from standard input and prints the result of dividing first number by second.
Test the above program with a zero input and print the output:
i. When catch statement is not used.
ii. When a try-catch block is used (the catch clause should print a message to the user and
ask him to supply a new number and repeat the code inside try.
2. Read a sequence of words and store the values in a vector. Process vector string and change
each word to upper-case. Print the transferred elements eight words to a line.
3. Copy the contents of one file to another. The file names should also be entered from command
line and the program should generate an exception if the target file name already exists.
Unit-II
4. Define a function template to count the number of occurrences of a given value in a vector and
test the program by passing a vector of double, int and strings.
5. Write a program to reverse the contents of a container using
i. Two ordinary (non-reverse) iterators.
ii. One forward and one reverse iterator.
6. Define a function template by using Template Method Pattern that takes a list of file names on
the command-line. It opens each file except last file for reading and opens last file for writing.
The framework will process each input file using an undetermined policy and write the output to
the last file. Use inheritance to customize this framework to create separate applications:i. To convert all letters in each file to lowercase
ii. To search the files for words given in first file.
7. Create a function which returns the sum of all elements in a vector and use the returned value
to compute the average.
Version 1.1, Page 116 of 155

Computer Science & Engineering

2012-13

Unit-III
8. Read a string from the standard input into a dynamically allocated character array that handles
varying size inputs. Test the program by giving it a string of data that is longer than the array size
allocated by the user.
9. Define an employee class that contains an employee name and a unique employee ID. Give
the class a default constructor and a constructor that takes a string representing the employees
name. Each constructor should generate a unique ID by incrementing a static data member. Also
define copy control members that are needed by employee class.
10. Design a generic class which checks the bounds of an array. The class should dynamically
allocate memory but generally does not de-allocates it. Fix this memory leak by writing a
destructor.
11. Design a class in which the copy constructor will make a deep copy of the copy constructor.
Shallow copies are also made by the assignment operator by default. Overload the assignment
operator to make a deep copy.
Note: Students are required to develop a Project using design patterns as well as the advanced
programming concepts learned during the course.

Version 1.1, Page 117 of 155

Computer Science & Engineering

2012-13

CHANDIGARH UNIVERSITY
GHARUAN

Scheme & Syllabus of B.E.


Computer Science &Engineering [CSE]
7th Semester

Version 1.1, Page 118 of 155

Computer Science & Engineering

2012-13

CHANDIGARH UNIVERSITY, GHARUAN


SYSTEM SOFTWARE (CST-401)
L T P Credits
3 - -

Total Hours: 48
Course Objectives:

To understand the relationship between system software and machine architecture.


To know the design and implementation of assemblers.
To know the design and implementation of linkers and loaders.
To have an understanding of macro-processors.
UNIT-I

Machine Architecture: Introduction, System Software and Machine Architecture, Simplified


Instructional Computer (SIC) - SIC Machine Architecture, SIC/XE Machine Architecture, SIC
Programming Examples.
[6]
Assemblers: Basic Assembler Function - A Simple SIC Assembler, Assembler Algorithm and
Data Structures, Machine Dependent Assembler Features - Instruction Formats & Addressing
Modes, Program Relocation. Machine Independent Assembler Features Literals, SymbolDefinition Statements, Expression, Program Blocks, Control Sections and Programming
Linking, Assembler Design Operations - One-Pass Assembler, Multi-Pass Assembler,
Implementation Examples - MASM Assembler.
[12]

UNIT-II
Loaders and Linkers: Basic Loader Functions - Design of an Absolute Loader, A Simple
Bootstrap Loader, Machine- Dependent Loader Features Relocation, Program Linking,
Algorithm and Data Structures for a Linking Loader; Machine-Independent Loader Features
Automatic Library Search, Loader Options, Loader Design Options - Linkage Editor, Dynamic
Linkage, Bootstrap Loaders, Implementation Examples - MS-DOS Linker.
[10]
Editors And Debugging Systems: Text Editors - Overview of Editing Process, User Interface,
Editor Structure, Interactive Debugging Systems - Debugging Functions and Capabilities,
Relationship With Other Parts Of The System, User-Interface Criteria.
[6]
Version 1.1, Page 119 of 155

Computer Science & Engineering

2012-13

UNIT-III
Macro Processor: Basic Macro Processor Functions - Macro Definitions and Expansion, Macro
Processor Algorithm and Data Structures, Machine-Independent Macro Processor Features
Concatenation of Macro Parameters, Generation of Unique Labels, Conditional Macro
Expansion, Keyword Macro Parameters, Macro Processor Design Options Recursive Macro
Expansion, General- Purpose Macro Processors, Macro Processing Within Language Translators,
Implementation Examples - MASM Macro Processor, ANSI C Macro Processor.
[10]
Compilers: Basic Compilers Functions- Grammars, Lexical Analysis, Syntactic Analysis, Code
Generation. Machine Dependent Compiler Features- Intermediate Form of the Program, Machine
dependent code Optimization. Machine Independent Compiler Features- Structured variables,
Machine Independent code Optimization. Compiler Design Options- Division into passes,
Interpreters, P-code Compilers, Compiler-Compilers.
[10]
Text Books:
1. Leland.L.Beck: System Software, 3rd Edition, Addison-Wesley, 1997.
Reference Books:
1. D.M.Dhamdhere: System Programming and Operating Systems, 2nd Edition,
Tata McGraw - Hill, 1999.
Instructions for paper setter.
The syllabus has been divided into three equal units. The paper setter is required to set Ten
questions in all, three questions from each unit and a compulsory question consisting of five sub
parts and based on the whole syllabus. The candidate will be required to attempt six questions
including the compulsory question number no 1 and not more than two questions from each unit.

Version 1.1, Page 120 of 155

Computer Science & Engineering

2012-13

CHANDIGARH UNIVERSITY, GHARUAN


ARTIFICIAL INTELLIGENCE (CST-403)
L T P Credits
3 - - 3
Total Hours: 48
COURSE OBJECTIVES:

To study the concepts of Artificial Intelligence


Methods of solving problems using Artificial Intelligence
Introduce the concepts of Expert Systems and machine learning.
UNIT-I

Introduction and Overview: Introduction, Importance of AI and Applications of AI.[3]


Problem Solving Techniques: Problem state spaces, problem characteristics, production
system, Search space control: Uninformed search- Depth first search, Breadth first search, Depth
first search with iterative deepening, Heuristic search Simple Hill Climbing, Steepest ascent
Hill Climbing, A* algorithm, AO* algorithm, Minimax search procedure for game playing,
Alpha beta cutoffs.
[9]
UNIT-II
Knowledge Representation: Propositional and predicate logic, resolution in predicate logic,
question answering, theorem proving. Semantic networks, Frames and scripts, conceptual
graphs, conceptual dependencies.
[6]
Knowledge acquisition: Types of learning, General learning models, learning Automata,
Intelligent Editors, Learning by Induction.
[6]
UNIT-III
Introduction to: Expert Systems, Pattern recognition, Natural Language Processing,
Evolutionary algorithm, Fuzzy logic, Neural Networks.
[6]

Version 1.1, Page 121 of 155

Computer Science & Engineering

2012-13

Languages for AI Problem Solving: Introduction to Prolog- syntax and data structures,
representing objects and relationships, built in predicates. Introduction to LISP- basic and
intermediate LISP programming.
[8]
Machine Learning: Strategic explanations Why, Why not and how explanations. Learning
Machine learning, adaptive learning. - Typical expert systems MYCIN, PIP, INTERNIST,
DART, XOON, Expert systems shells.
[8]
TEXT BOOKS:
1. Rich E., Artificial Intelligence, Tata McGraw Hills.
2. George F. Luger, Artificial Intelligence: Structures and Strategies for Complex Problem
Solving, Pearson Education Asia.
REFERENCE BOOKS:
1.
2.
3.
4.

D.W.Patterson, Introduction to AI and Expert Systems, PHI.


N.J.Nilsson, Principles of Artificial Intelligence, Kaufmann,1980
Saroj Kaushik,Logic and Prolog Programming, New Age International Publications.
PH.Winston, Artificial Intelligence, Addison Wesley.

Instructions for paper setter.


The syllabus has been divided into three equal units. The paper setter is required to set Ten
questions in all, three questions from each unit and a compulsory question consisting of five sub
parts and based on the whole syllabus. The candidate will be required to attempt six questions
including the compulsory question number no 1 and not more than two questions from each unit.

Version 1.1, Page 122 of 155

Computer Science & Engineering

2012-13

CHANDIGARH UNIVERSITY, GHARUAN


SECURITY AND CRYPTOGRAPHY (CST-404)
L T P Credits
3 1 - 3.5
Total Hours: 48
COURSE OBJECTIVES:

To study the concepts of Security


To understand methods for securing a system.
UNIT-I

Introduction: Terminologies, Architecture, Security - Attacks, Services and Mechanism.


Symmetric Cryptography: Classical techniques, Block Ciphers DES, Triple DES, AES;
Stream Ciphers RC4.
UNIT-II
Asymmetric Cryptography: Public key, RSA, Diffie Hellman.
Data Integrity: Hash functions - SHA-1, HMAC; Digital signatures.
Key Management & Distribution: Kerberos.
UNIT-III
Network Security: SSL, TLS, HTTPS, SSH, PGP, IPsec.
Information Security: IDS, Viruses & Worms, and Attacks & Firewalls.
TEXT BOOKS:
1. William Stallings, Cryptography and Network Security, Printice Hall.
2. Alfred J. Meneze, Handbook of Applied Cryptography, CRC Press.
REFERENCE BOOKS:
1.

Roberta Bragg, Network Security - The Complete Reference, McGraw Hill.

Version 1.1, Page 123 of 155

Computer Science & Engineering

2012-13

Instructions for paper setter.


The syllabus has been divided into three equal units. The paper setter is required to set Ten
questions in all, three questions from each unit and a compulsory question consisting of five sub
parts and based on the whole syllabus. The candidate will be required to attempt six questions
including the compulsory question number no 1 and not more than two questions from each unit.

Version 1.1, Page 124 of 155

Computer Science & Engineering

2012-13

CHANDIGARH UNIVERSITY, GHARUAN


COMPILER DESIGN (CST-405)
L T P Credits
3 1 -

3.5

Total Hours: 48

COURSE OBJECTIVES:

Understand the key concepts and tasks of compiler designing and phases of
compilation.
Understand the relation of various phases of compiler with formal languges and
implementation with basic examples.

UNIT-I
Introduction: Assemblers, linkers, loaders, compilers and translators, the structure of compiler,
different states in the construction of a compiler, Finite state machines and regular expressions.
[6]
Lexical analyzer: Design of Lexical analyzer, lexical-analyzer generator, LEX-compiler,
Formal grammars and their application to syntax analysis, BNF, notation, ambiguity. Context
free grammars, derivation and parse trees, capabilities of CFG. [8]
UNIT-II
Basic Parsing Techniques: Parsers, Shift reduce parsing, operator precedence parsing, top down
parsing, predictive parsers ,LR parsers, the canonical Collection of LR(0) items, constructing
SLR parsing tables, constructing Canonical LR parsing tables, Constructing LALR parsing
tables, implementation of LR parsing tables. [10]
Syntax-directed Translation: Syntax-directed Translation schemes, Intermediate code, postfix
notation, Parse trees & syntax trees, three address code, quadruple & triples, translation of
assignment statements. Data structure for symbols tables. [8]

Version 1.1, Page 125 of 155

Computer Science & Engineering

2012-13

UNIT-III
Run time storage Administration: Implementation of a simple stack allocation scheme,
implementation of block structured languages, storage allocation in block structured
languages.[4]
Error Detection and Recovery : Error, Lexical-phase errors, syntactic-phase errors, semantic
errors. [4]
Code Optimization: The Principle sources of optimization, loop optimization, the DAG
representation of basic blocks. [4]
Code Generation: Object programs, problems in code generation, code generation from DAGs,
peephole optimization. [4]

Text Books:
1. Aho A.V. and ullaman J.D.Principles of Compiler Design, Pearson Publication
2. Aho A.V. and ullaman J.D.Principles of Compiler Design, Narosa Publishing House
3. Donovan, j, System Programming, TMH
Reference Books:
1. D.M. Dhamdhere: Compiler Construction- Principles and practice Mc Milan India
2. David Grics : Compiler Construction for digital computer
Instructions for paper setter

The syllabus has been divided into three equal units. The paper setter is required to set Ten
questions in all, three questions from each unit and a compulsory question consisting of five sub
parts and based on the whole syllabus. The candidate will be required to attempt six questions
including the compulsory question number no 1 and not more than two questions from each unit.

Version 1.1, Page 126 of 155

Computer Science & Engineering

2012-13

CHANDIGARH UNIVERSITY, GHARUAN


ARTIFIAL INTELLIGENCE LAB (CSP-405)
L T P Credits
- - 2 1
1. Programming in C/C++/java
2. Programs for Search algorithms- Depth first, breadth first, best first, hill climbing.
3. Implementation of games: 8-puzzle, Tic-tac-toe.
4. Programs for Towers of Hanoi using AI.
5. Designing expert system using logic in prolog.

Version 1.1, Page 127 of 155

Computer Science & Engineering

2012-13

CHANDIGARH UNIVERSITY, GHARUAN


Open Elective - Cyber Laws and Security (CSO-441)

P Credits

- 3

Total Hours: 48
Course Objectives:

To understand the major concepts of Cyber Security and Forensics


To learn how to avoid becoming victims of cyber crimes.
UNIT-I

Introduction to cyber crime: Introduction to Cybercrime and information security,


Classifications of Cybercrimes: E-Mail Spoofing, Spamming, Cyber defamation, Internet Time
Theft, Salami Attack/Salami Technique, Data Diddling, Forgery, Web Jacking, Newsgroup
Spam/Crimes Emanating from Usenet Newsgroup, Industrial Spying/Industrial Espionage,
Hacking, Online Frauds, Pornographic Offenses , Software Piracy, Computer Sabotage, E-Mail
Bombing/Mail Bombs, Usenet Newsgroup as the Source of Cybercrimes , Computer Network
Intrusions, Password Sniffing, Credit Card Frauds, Identity Theft.
[14]
UNIT II
Cyber offences: Categories of cybercrime, Planning of attacks, Cyber stalking, Types of
Stalkers, Real life incident of cyber stalking, Cybercaf, Botnets, Attack vectors, Zero day
attack, Proliferation of wireless devices, Credit card frauds, Security challenges posed by mobile
devices, Attacks on mobile phones.
[9]
Methods Used in Cybercrime: Proxy Servers, Password Cracking, Online and Offline attacks,
Types of Viruses, Protection methods against viruses, Phishing, Methods of Phishing, Identify
theft, Personally identifiable Information (PII).
[8]
UNIT- III
Cyber Law: Need of Cyber Laws, Advantages of Cyber Laws, The Indian IT Act, Challenges to
Indian Law and Cybercrime Scenario in India, Cyber Forensics, Need of Cyber Forensics,
Online Scams:
Scam No. 1 Foreign Country Visit Bait
Version 1.1, Page 128 of 155

Computer Science & Engineering

2012-13

Scam No. 2 Lottery Scam


Scam No. 3 Fake Job Offer Scam

[10]

Cyber security: Roles and Responsibilities of IT Security Organization, Career in cyber


security, Assurance and Compliance Security Audit, Types of Assurance and Compliance,
Network Security, Computer Forensics, Cyber security Certifications.
[7]

Text Books:
1. Godbole, Information Systems Security, Willey.
2. Farrera, Cyber Law, Cengage Learning.
3. Merkov, Breithaupt, Information Security, Pearson Education.

Reference Books:
1. Yadav, Foundations of Information Technology, New Age, Delhi.
2. Sood, Cyber Laws Simplified, McGraw Hill.
3. Furnell, Computer Insecurity, Springer.
Instructions for Paper Setter:
The syllabus has been divided into three equal units. The paper setter is required to set Ten
questions in all, three questions from each unit and a compulsory question consisting of five sub
parts and based on the whole syllabus. The candidate will be required to attempt six questions
including the compulsory question number no 1 and not more than two questions from each unit.

Version 1.1, Page 129 of 155

Computer Science & Engineering

2012-13

CHANDIGARH UNIVERSITY, GHARUAN


Open Elective: Software Engineering Methodologies (CSO-442)
L T
3 1

P Credits
- 3

Total Hours: 48
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.
Unit-I

Introduction- Introduction to Software Engineering, Software Components, Software


Characteristics, Software Crisis, software engineering processes.
[6]
Software Development Life Cycle (SDLC) Models- Water Fall Model, Prototype Model,
Spiral Model, Evolutionary Development Models, Iterative Enhancement Models.
[5]
Software Requirement Specifications (SRS)-Requirement Engineering Process: Elicitation,
Analysis, Documentation, Review and Management of User Needs, Feasibility Study, SRS
Document, IEEE Standards for SRS.
[5]
Unit-II
Software Design- Basic Concept of Software Design, Architectural Design, Low Level Design:
Modularization, Design Structure Charts, Pseudo Codes, Flow Charts, Coupling and Cohesion
Measures. Design Strategies- Function Oriented Design, Object Oriented Design, Top-Down and
Bottom-Up Design.
[7]
Software Measurement and Metrics- Various Size Oriented Measures, Function Point (FP)
Based Measures, Cyclomatic Complexity Measures: Control Flow Graphs.
[5]
Software Quality Assurance (SQA): Verification and Validation, SQA Plans, Software Quality
Frameworks, ISO 9000 Models, SEI-CMM Model.
[4]
Unit-III
Software Testing: Testing levels, Verification and Validation, Unit testing, System testing
Integration testing, Validation Testing, Black box and white box testing.
[7]

Version 1.1, Page 130 of 155

Computer Science & Engineering

2012-13

Software Maintenance and Software Project Management- Software as an Evolutionary


entity Need for Maintenance, Categories of Maintenance: Preventive, Corrective and Perfective
Maintenance, Cost of Maintenance. Software Re-Engineering, Reverse Engineering. Software
Configuration Management Activities, an Overview of CASE Tools. Estimation of Various
Parameters such as cost, efforts, Schedule/Duration, Constructive Cost Models (COCOMO),
Software Risk Analysis and Management.
[9]
Text Books:
1. Pressman Rogers, Software Engineering: A Practitioner's Approach, Sixth edition.
2. Somerville Ian, Software Engineering, Addison Wesley, 8th Edition.
Reference Books:
1. James F Peters and Pedryez Witold, Software Engineering An Engineering Approach,
Wiley Student Edition.
2. Rajib Mall, Fundamentals of Software Engineering, PHI Publication.
Instructions for Paper Setter:
The syllabus has been divided into three equal units. The paper setter is required to set Ten
questions in all, three questions from each unit and a compulsory question consisting of five sub
parts and based on the whole syllabus. The candidate will be required to attempt six questions
including the compulsory question number no 1 and not more than two questions from each unit.

Version 1.1, Page 131 of 155

Computer Science & Engineering

2012-13

CHANDIGARH UNIVERSITY, GHARUAN


Open Elective: E-Banking & Commerce (CSO-443)
L T P Credits
3 1 - 3
Total Hours: 48
Course Objectives:

To study and learn about Electronic Banking & its applications.


To study and learn about E-commerce & its applications.
To understand the E-banking & commerce security.
UNIT I

Electronic Banking- Traditional Banking Vs E-Banking, Facets of E-Banking, E-Banking


transactions, truncated cheque and Electronic cheque, Models for E-banking, complete
centralized solution- features & CCS-Cluster approach, Advantages of E-Banking, Constraints in
E-Banking.
[8]
Online Banking- Introduction, concept and meaning, the electronic delivery channels, need for
computerization, Automatic Teller Machine(ATM), Electronic Fund Transfer(EFT) & its uses,
computerization in clearing houses, Tele-banking, Banking on home computers, Electronic
Money Transfer & its uses.
[8]
UNIT II
Types of E-Banking: Telephone Banking, Computerized Home Banking, Computerized
Corporate Banking, On-Line Banking, Types of Cards: Debit Cards, Credit Cards and Smart
Cards.
[7]
E-Banking Security- Introduction need for security, Security concepts-Privacy, Survey.
Findings on security-Attacks, Cyber crimes, Reasons for Privacy, Tampering, Encryption
Meaning-The encryption process - Cryptogram-Cryptanalyst-cryptography, Types of Cipher
systems, Data Encryption Standard (DES).
[9]

Version 1.1, Page 132 of 155

Computer Science & Engineering

2012-13

Unit-III
Fundamentals of E-commerce- definition, features, need & essential requirements, Parties to Ecommerce transactions, environment, E-commerce & trade Cycle, Internet concepts- Private
network, Public network (VPN), Intranet & its applications, Extranet
[6]
Business Strategy in an Electronic Age -Value Chain-Competitive Advantage-Business
strategies
[5]
E-commerce Types- Inter-organizational transaction, Purchasing online, After sales onlineinternet trading relationship-B2B, EDI & its impact on Business- B2C, Intra-organizational Ecommerce, Supply chain management.
[5]
Text Books:
1. Efrain Turbans, Jar Lee, David King and Michael H. Chung, E-Commerce: A Managerial
Perspective, Pearson Education, Delhi, 2003.
2. Whiteley David E-commerce: Strategy- Technologies and Applications- Tata McGraw
Hill- New Delhi- New York.
Reference Books:
1. C.S. Rayudu, E-Business, Himalaya Publishing House.
2. Chhabra, T.N., Suri, R.K. and Verma, Sanjiv, E-Commerce: New Vistas for Business,
Dhanpat Rai & Co. (P) Ltd. Delhi, 2004-05.
Instructions for Paper Setter:
The syllabus has been divided into three equal units. The paper setter is required to set Ten
questions in all, three questions from each unit and a compulsory question consisting of five sub
parts and based on the whole syllabus. The candidate will be required to attempt six questions
including the compulsory question number no 1 and not more than two questions from each unit.

Version 1.1, Page 133 of 155

Computer Science & Engineering

2012-13

CHANDIGARH UNIVERSITY, GHARUAN


Open Elective: Enterprise Resource Planning (CSO-444)
L

P Credits

- 3

Total Hours: 48
Course Objectives:
To understand the importance of Enterprise-wide systems to business operations
To understand basic concepts, tools and techniques of Enterprise Resource Planning
To understand the business model and implementing ERP
To learn to use commercial ERP packages
UNIT - I
ERP Introduction- Benefits, Origin, Evolution and Structure: Conceptual Model of ERP,
Evolution of ERP, Structure of ERP, ERP and Functional Areas. Model: Dynamic and process.
[6]
ERP and Technology- Business Process Reengineering, Data ware Housing, Data Mining,
Online Analytic Processing(OLAP), Product Life Cycle Management(PLM),LAP, Supply chain
Management.
[5]
ERP Implementation: Implementation Challenges , Strategies , Life Cycle , Pre
implementation Tasks ,Requirements Definition , Methodologies , Package selection , Project
Teams ,Process Definitions , Vendors and Consultants , Data Migration , Project management
, Post Implementation Activities.
[6]
UNIT - II
ERP Marketplace and Marketplace Dynamics- Market Overview, Marketplace Dynamics,
Changing ERP Market.
[7]
ERP Functional Modules- Introduction, Functional Modules of ERP Software, Integration of
ERP, Inventory Control Supply Chain Management and Customer Relationship Applications
.
[8]

Version 1.1, Page 134 of 155

Computer Science & Engineering

2012-13

UNIT III
ERP & E-Commerce, Future Directives- in ERP, ERP and Internet, Critical success and
failure factors, Integrating ERP into organizational culture.
[8]
Using ERP Tool- ERP System Package SAP, People Soft, BAAN and Oracle as a case study
[8]
Text Books:
1. Vinod Kumar Garg and N.K.Venkita Krishnan, Enterprise Resource Planning-Concepts
and Practice, Prentice Hall of India.
2. Antonio Fernandz, The SAP R/3 Handbook, Tata McGraw Hill.
Reference Books:
1.
2.
3.

Brady, Monk, Wagner, Concepts in Enterprise Resource Planning, Thomson Asia.


Alexis Leon, ERP DEMYSTIFIED, Tata McGraw Hill, Second Edition, 2008.
Mary Sumner, Enterprise Resource Planning, Pearson Education, 2007.

Instructions for paper setter:


The syllabus has been divided into three equal units. The paper setter is required to set Ten
questions in all, three questions from each unit and a compulsory question consisting of five sub
parts and based on the whole syllabus. The candidate will be required to attempt six questions
including the compulsory question number no 1 and not more than two questions from each unit.

Version 1.1, Page 135 of 155

Computer Science & Engineering

2012-13

CHANDIGARH UNIVERSITY
GHARUAN

Scheme & Syllabus of B.E.


Computer Science &Engineering [CSE]
8th Semester

Version 1.1, Page 136 of 155

Computer Science & Engineering

2012-13

CHANDIGARH UNIVERSITY, GHARUAN


Digital Image Processing (CST-421)
L T P Credit
3

- 1

3.5

Total Hours: 48
Course objectives:

To understand the basic concepts of image processing.


To enhance knowledge about fundamental steps in image processing.
To apply different image processing concepts to solve research problems.
UNIT I

Introduction: - Basic concept and origin, Examples of fields that use Digital Image Processing,
Fundamental steps in Digital Image Processing, Components of Image Processing System. [6]
Digital Image Fundamentals:- Image Sensing and acquisition, digital image representation,
Image Sampling and Quantization, Some basic relationships between pixels.
[7]
Image Enhancement: - Introduction, Enhancement in spatial domain: Some basic gray level
transformations, Histogram processing, Basics of spatial filtering, Smoothing and sharpening
spatial filters. Enhancement in frequency domain: Fourier transform and filtering in frequency
domain, smoothing and sharpening frequency domain filters.
[6]
UNIT-II
Image Restoration:- Introduction, a model of the image degradation/ Restoration process.

[5]

Color Image Processing:- Color fundamentals, Color Models, Color Transformation.


[4]
Image Compression:- Redundancy and types of redundancy, Image compression models, Error
free compression, Lossy compression.
[6]

Version 1.1, Page 137 of 155

Computer Science & Engineering

2012-13

UNIT-III
Morphological Image Processing: - Introduction, Dilation and erosion, Opening and closing,
Some basic morphological algorithms.
[5]
Image Segmentation and Representation:- Introduction, Detection of discontinuities: point
detection, Line detection, edge detection. Edge linking and boundary detection, Thresholding,
region based segmentation. Boundary representation, Boundary and Regional Descriptors,
Relational Descriptors.
[8]
Text Books:
1. Gonzalez,R. C., Woods R. E. Digital Image Processing, Pearson Prentice Hall.
2. Jain, Kasturi and Schunk, Machine Vision, Tata McGraw Hill.
3. Gonzalez, R. C., Woods R. E., Eddins, S. L., Digital Image Processing using
MATLAB, Pearson Prentice Hall.
Reference Books:
1. Sonka, Hlavac and Boyle, Image-processing, Analysis and Machine Vision, Cengage
Learning.
2. Low,Introductory Computer Vision and Image Processing,Tata McGraw Hill.
Instructions for paper setter
The syllabus has been divided into three equal units. The paper setter is required to set Ten
questions in all, three questions from each unit and a compulsory question consisting of five sub
parts and based on the whole syllabus. The candidate will be required to attempt six questions
including the compulsory question number no 1 and not more than two questions from each unit.

Version 1.1, Page 138 of 155

Computer Science & Engineering

2012-13

CHANDIGARH UNIVERSITY, GHARUAN


Business Intelligence & Analysis (CST-422)
L T P Credits
3

- - 3

Total Hours: 48

COURSE OBJECTIVES:

Understand the key concepts, theories, and tasks of data mining and knowledge discovery
in databases (KDD).
Understand the main strengths and limitations of commonly used data mining algorithms
and how to apply them to (Engineering) applications.
UNIT-I

Data warehousing: introduction , operational data stores , ETL , Data warehouses, design
guideleines for data warehouse implementation ,data warehouse metadata; OLAP,introduction
,characteristics , multidimensional view and data cube , data cube operations.[10]
Data mining , introduction , association rules mining , basics , nave algorithm , apriori
algorithm , direct hashing and pruning(DHP) , Dynamic Itemset counting(DIC) , Mining
frequent pattern without candidate generation(FP,growth), performance evaluation of algorithms
, software for association rule mining.
[16]
UNIT-II
Classification introduction , decision tree , tree induction algorithm split algorithm based on
information theory , split algorithm based on Gini index; nave bayes method; estimating
predictive accuracy of classification method; classification software.
[10]
UNIT-III
Cluster analysis , introduction , partitional methods , hierrarchical methods , density,based
methods , dealing with large databases ,cluster software.
[8]
Introduction to Web data mining and search engines.

[4]

Version 1.1, Page 139 of 155

Computer Science & Engineering

2012-13

Text Books:
1. G.K.Gupta, Introduction to Data Mining with case studies, PHI publication.
2. VikramPudi, P.Radhakrishana, Data Mining, Oxford University press
Reference Books:
1. Pieter adriaans, dolfzantinge, Data mining, Pearson education press.
2. Paulrajpooniah, Data Warehousing Fundamentals, A,willeyinterscience Publication.
Instructions for paper setter
The syllabus has been divided into three equal units. The paper setter is required to set Ten
questions in all, three questions from each unit and a compulsory question consisting of five sub
parts and based on the whole syllabus. The candidate will be required to attempt six questions
including the compulsory question number no 1 and not more than two questions from each unit.

Version 1.1, Page 140 of 155

Computer Science & Engineering

2012-13

CHANDIGARH UNIVERSITY, GHARUAN


SOFT COMPUTING (CST-423)
L T P Credits
3 1 -

3.5

Total Hours: 48
Course Objectives:
To familiarize with soft computing concepts.
To introduce the ideas of Neural networks, fuzzy logic and use of heuristics based on
human experience.
To introduce the concepts of Genetic algorithm and its applications to soft computing
using some applications.
Unit I
Artificial Neural Network Introduction Fundamental concept Evolution of Neural Networks
Basic Models of Artificial Neural Networks Important Terminologies of ANNs
McCulloch-Pitts Neuron Linear Separability Hebb Network. Supervised Learning Network:
Perceptron Networks Adaline Multiple Adaptive Linear Neurons Back-Propagation
Network Radial Basis Function Network.
[10]
Associative Memory Networks: Training Algorithms for Pattern Association Autoassociative
Memory Network Heteroassociative Memory Network Bidirectional Associative Memory
Hopfield Networks Iterative Autoassociative Memory Networks Temporal
AssociativeMemory Network. Unsupervised Learning Networks: Fixed weight Competitive Nets
Kohonen Self-Organizing Feature Maps Learning Vector Quantization Counter propagation
Networks Adaptive Resonance Theory Networks Special Networks.
[10]
Unit II
Fuzzy Set Theory: Introduction to Classical Sets and Fuzzy sets Classical Relations and
Fuzzy Relations Tolerance and Equivalence Relations Non interactive Fuzzy sets
Membership Functions: Fuzzification Methods of Membership Value Assignments
Defuzzification Lambda-Cutsfor Fuzzy sets and Fuzzy Relations Defuzzification Methods.

Version 1.1, Page 141 of 155

Computer Science & Engineering

2012-13

[6]
Fuzzy Arithmetic and Fuzzy Measures: Fuzzy Rule Base and Approximate Reasoning: Truth
values and Tables in Fuzzy logic Fuzzy Propositions Formation of Rules Decomposition
and Aggregation of rules Fuzzy Reasoning Fuzzy Inference Systems (FIS) Fuzzy Decision
Making Fuzzy Logic Control Systems.
[8]
Unit III
Genetic Algorithm: Introduction Basic Operators and Terminologies in GAs Traditional
Algorithm vs. Genetic Algorithm Simple GA General Genetic Algorithm The Scheme
Theorem Classification of Genetic Algorithm Holland Classifier Systems Genetic
Programming.
[8]
Applications of Soft Computing: A Fusion Approach of Multispectral Images with SAR Image
for Flood Area Analysis Optimization of Travelling Salesman Problem using Genetic
Algorithm Approach.
[6]
Text Books:

1. S. Rajasckaran, G.A. VijyalakshmiPai, Neural Network, Fuzzy Logic and Genetic


Algorithms Synthesis and Applications, Prentice Hall India (2003).
2. David E. Goldberg, Genetic Algorithms in Search, Optimization & Machine Learning,
Addison Wesley (1989).
Reference Books:
1. Freeman, Skapura, Neural Networks: Algorithms, Applications and Programming
Techniques, Addison Wesley (1991).
2. G.J. Klir, B. Yuan, Fuzzy Sets & Fuzzy Logic: Theory and Application, Prentice Hall of
India (1997).
Instructions for paper setter
The syllabus has been divided into three equal units. The paper setter is required to set Ten
questions in all, three questions from each unit and a compulsory question consisting of five sub
parts and based on the whole syllabus. The candidate will be required to attempt six questions
including the compulsory question number no 1 and not more than two questions from each unit.

Version 1.1, Page 142 of 155

Computer Science & Engineering

2012-13

CHANDIGARH UNIVERSITY, GHARUAN


Digital Image Processing Lab (CSP-424)
L T P Credits
-

To apply different Image Processing concepts using MATLAB.

Version 1.1, Page 143 of 155

Computer Science & Engineering

2012-13

CHANDIGARH UNIVERSITY, GHARUAN


Soft Computing Lab (CSP-425)
L T P Credit
- - 2

1) a) Write a Matlab program (m.file) to calculate union, intersection, complement and


difference of two fuzzy sets.
b) Write a Matlab program (m.file) to calculate the Demorgans Law.
2) Find whether the given matrix is (a) reflexive (b) tolerance and (c) transitivity matrix or not.
R=
11000
11001
00100
00010
01001
by writing an M-file.
3) Find whether the given matrix is symmetry or not
R=
1 0.5 0.3 0.6 0
0.5 1 0.7 0.5 0.9
0.3 0.7 1 0.6 0
0.6 0.5 0.6 1 0.5
0 0.9 0 0.5 1
by a
Matlab program.
Version 1.1, Page 144 of 155

Computer Science & Engineering

2012-13

4) Find the fuzzy relation between two vectors R and S


R=
0.7

0.5

0.8

0.4

S=
0.9

0.6

0.2

0.1

0.7

0.5

Using maxproduct and max-min method by a Matlab program


5) (a)Use Matlab command line commands to display the Gaussian membership function.
Given x = 010 with increment of 0.1 and Gaussian function is defined between 0.5 and 5.
(b) Use Matlab command line commands to display the triangular membership function.
Given x = 010 with increment of 0.2 triangular membership function is defined between [3 4 5]
6) Illustrate different types of generalized bell membership functions using Matlab program
(7) Using Matlab program find the crisp lambda cut set relations for = 0.2, the fuzzy matrix is
given by
R=
0.2

0.7

0.8

0.9

0.5

0.1

0.8

0.6

0.

0.4

0.3

Version 1.1, Page 145 of 155

Computer Science & Engineering

2012-13

CHANDIGARH UNIVERSITY, GHARUAN


ELECTIVE II EMBEDDED SYSTEMS (CST-431)
L T P Credits
3 - - 3
Total Hours: 48
COURSE OBJECTIVES:

To understand the concept of embedded systems.


To use the basic programming languages in embedded systems.
UNIT-I

Introduction To Embedded Systems: Embedded systems, Characteristics of embedded systems


I/O, Embedded systems/real time systems. Embedded system software architecture, simple
control loop, interrupts control system, co-operating multitasking, pre-emptive multitasking.
[6]
Timing Characteristics of Embedded Systems: Hard, soft and firm systems, Performance
analysis of embedded systems: software timing characterization and analysis methods.
[4]
Real Time Operating Systems: Real-time and non-real time applications. Classification of
Real-Time Task scheduling algorithms, Event-driven scheduler- Simple priority-based, Rate
Monotonic Analysis, Earliest Deadline First, The simplest of Task assignment and scheduling,
priority scheduling, characteristics of tasks, task assignment and multi-tasking.[8]
UNIT-II
Memory Management And Synchronization For Embedded Software: Semaphores, uses of
semaphores, mutual exclusion, deadlock, starvation and lockouts, priority assignment, inversion,
event flags and signals, inter task communication and resource sharing, synchronization,
interrupt handlers.
[7]
Software Engineering Issues In The Embedded Systems: Domain analysis, Software element
analysis, requirement analysis, Specification, Software architecture, Software analysis design,
implementation, testing, validation, verification and debugging of embedded systems. Iterative
process development, Agile software development process, Introduction to Use Cases.
[8]

Version 1.1, Page 146 of 155

Computer Science & Engineering

2012-13

UNIT-III
Programming languages for embedded systems: Desirable characteristics of programming
languages for embedded systems, low-level versus high-level languages, main language
implementation issues: control, typing, exception handling, modularity and multi-threading.
Major programming languages for embedded systems: Assembly, C/C++, Ada and Java,
Overview of PMC, Effiel, Forth.and overview of Real time databases.
[8]
Compilation Techniques For Embedded Software: code generation, re-target ability, code
optimization.
[4]
Examples of Embedded And Real-Time Software Systems.

[4]

TEXT BOOKS:
1.
2.

Gomaa, Software Design Methods for Concurrent and Real-Time systems, AddisonWesley, 1993.
Raj Kamal, Embedded Systems Architecture, Programming and Design, Tata Mcgraw
Hill, New Delhi.

REFERENCE BOOKS:
1.
2.

S. Allworth, Introduction to real-time Software design, Springer-Verlag, 1984.


C.M. Krishna, K.Shin, Real-time Systems, Tata Mc-Graw Hill, 1997.

Instructions for paper setter.


The syllabus has been divided into three equal units. The paper setter is required to set Ten
questions in all, three questions from each unit and a compulsory question consisting of five sub
parts and based on the whole syllabus. The candidate will be required to attempt six questions
including the compulsory question number no 1 and not more than two questions from each unit.

Version 1.1, Page 147 of 155

Computer Science & Engineering

2012-13

CHANDIGARH UNIVERSITY, GHARUAN


ELECTIVE-II ADVANCED DBMS (CST-432)
L T P Credits
3 - - 3
Total Hours: 48
COURSE OBJECTIVES:

To gain knowledge about the different database systems.


To review existing database concepts
To understand advanced databases like parallel, distributed, object oriented etc.
To gain familiarization with backup and recovery technique.
UNIT-I

Distributed DBMS Concepts and design: Introduction, functions and architecture of a


DDBMS, distributed relational database design, Transparencies in a DDBMS, Dates Twelve
rules for a DDBMS.
[7]
Distributed DBMS Advanced concepts: Distributed transaction management, distributed
concurrency control, distributed deadlock management, distributed database recovery,
Distributed query optimization.
[8]
UNIT-II
Object-Oriented DBMS: Introduction, advanced database applications, weakness of RDBMS,
storing objects in a relational database, next-generation database systems.
[6]
Concepts and design: OODBMS perspectives, persistence, issues in OODBMS, advantages and
disadvantages of OODBMS, Object-oriented database design.
[6]
Object relational DBMS: Introduction, third generation database manifestos, SQL8, Object
oriented extensions in Oracle, Comparison of ORDBMS and OODBMS.
[6]

Version 1.1, Page 148 of 155

Computer Science & Engineering

2012-13

UNIT-III
Data Warehousing Concepts, OLAP and Data mining: Evolution of data warehousing, data
warehousing concepts, ETL, Data Warehouse Design benefits and problems of data
warehousing, comparison of OLTP systems and data warehousing, On-Line Analytical
Processing, Introduction to data mining.
[8]
Physical Database Design and Performance: Physical database design process, designing field,
designing physical record and de-normalization, designing physical files -file organizations,
clustering files, using and selecting indexes.
[7]
TEXT BOOKS:
1. Thomas Connolly, Carolyn Begg, Database systems, 3rd edition, Pearson Education.
2. G.K Gupta, Introduction to Data Mining with Case Studies, PHI.
REFERENCE BOOKS:
1.
2.
3.
4.

H. F. Korth& A. Silverschatz, Database Concepts, Tata Mcgraw Hill.


Hoffer, prescott, Mcfadden, Modern Database Management, Pearson education.
Elmasri, Navathe, Fundamentals of Database systems, 4thed, Pearson education.
C. J. Date, An Introduction to Database Systems, 7th edition, Pearson education.
5. C.S.R. Prabhu, Object-oriented Database Systems, Eastern Economy Edition.
Instructions for paper setter.
The syllabus has been divided into three equal units. The paper setter is required to set Ten
questions in all, three questions from each unit and a compulsory question consisting of five sub
parts and based on the whole syllabus. The candidate will be required to attempt six questions
including the compulsory question number no 1 and not more than two questions from each unit.

Version 1.1, Page 149 of 155

Computer Science & Engineering

2012-13

CHANDIGARH UNIVERSITY, GHARUAN


ELECTIVE-II MOBILE APPLICATION DEVELOPMENT (CST-433)
L T P Credits
3 - - 3
Total Hours: 48
COURSE OBJECTIVES:

To learn about android development.


To gain knowledge about how to develop apps.
UNIT-I

Introduction: Introduction to Mobile Computing, Introduction to Android Development


Environment.
[2]
Factors in Developing Mobile Applications: Mobile Software Engineering, Frameworks and
Tools, Generic UI Development, Android User.
[4]
More on UIs: VUIs and Mobile Apps, Text-to-Speech Techniques, Designing the Right UI,
Multichannel and Multimodial UIs.
[4]
Intents and Services: Android Intents and Services, Characteristics of Mobile Applications,
Successful Mobile Development.
[4]
UNIT-II
Storing and Retrieving Data: Synchronization and Replication of Mobile Data, Getting the
Model Right, Android Storing and Retrieving Data, Working with a Content Provider,
Communications Via.
[6]
Network and the Web: State Machine, Correct Communications Model, Android Networking
and Web.
[3]
Telephony: Deciding Scope of an App, Wireless Connectivity and Mobile Apps, Android
Telephony.
[3]
Notifications and Alarms: Performance, Performance and Memory Management, Android
Notifications and Alarms.
[4]
Version 1.1, Page 150 of 155

Computer Science & Engineering

2012-13

UNIT-III
Graphics: Performance and Multithreading, Graphics and UI Performance, Android Graphics
and Multimedia: Mobile Agents and Peer-to-Peer Architecture, Android Multimedia.
[6]
Location: Mobility and Location Based Services, Android.
[3]
Security and Hacking: Active Transactions, More on Security, Hacking Android.
[3]
Platforms and Additional Issues: Development Process, Architecture, Design, Technology
Selection, Mobile App Development Hurdles, Testing.
[6]
TEXT BOOKS:
1. William Stallings, Cryptography and Network Security, Printice Hall.
2. Alfred J. Meneze, Handbook of Applied Cryptography, CRC Press.
REFERENCE BOOKS:
1. Roberta Bragg, Network Security - The Complete Reference, McGraw Hill.

Instructions for paper setter.


The syllabus has been divided into three equal units. The paper setter is required to set Ten
questions in all, three questions from each unit and a compulsory question consisting of five sub
parts and based on the whole syllabus. The candidate will be required to attempt six questions
including the compulsory question number no 1 and not more than two questions from each unit.

Version 1.1, Page 151 of 155

Computer Science & Engineering

2012-13

CHANDIGARH UNIVERSITY, GHARUAN


ELECTIVE-II BIOINFORMATICS (CST-434)
L T P Credits
3 - - 3
Total Hours: 48
COURSE OBJECTIVES:

To study the different coding techniques and standards


To know about the different biological network of resources available
To learn how to analyze DNA and Protein sequences
To learn and understand the multiple sequence analysis techniques
To understand protein classification and Structure prediction
UNIT-I

INTRODUCTION: Definition , Overview- Major databases in Bio Informatics- Molecular


biology Central Dogma- Data retrieval tools Data mining of Databases Gene Analysis
Prokaryotic and Eukaryotic Genomes Sequence Assembly Gene mapping Physical maps
cloning ORF amino acids DNA, RNA sequences Genetic code.
[9]
DNA and PROTEIN SEQUENCES: DNA: working with single DNA sequence : removing
vector sequences- verifying restriction maps PCR design GC content counting words
internal repeats protein coding regions OR Fing Genome scan Protein: predicting properties
primary structure analysis transmembrane segments PROSITE patterns interpreting
scanprosite results- finding domains CD server results pfscan results.
[11]
UNIT-II
ALIGNMENT OF PAIR OF SEQUENCES: Terminology Global and Local alignment
Dot matrix dynamic programming using scoring matrices PAM matrices BLOSUM.
Working with FASTA Algorithm output E-values Histogram. Working with BLAST
algorithm output services gapped BLAST- PSIBLAST comparison of FASTA and
BLAST.
[10]
MULTIPLE SEQUENCE ALIGNMENT: Criteria for Multiple sequence alignment
applications choosing the right sequences; FASTA, ClustalW, TCoffee methods interpreting
multiple sequence alignment getting in right format converting formats using Jalview
preparing for publications. [8]

Version 1.1, Page 152 of 155

Computer Science & Engineering

2012-13

UNIT-III
PROTEIN CLASSIFICATION & STRUCTURE PREDICTION: Structure of amino acids
primary structure secondary structure folds and motifs alpha and beta helix structure
based protein classification protein structure Data bases folding problem PROPSEARCH
primary structure analysis and prediction secondary structure analysis and prediction motifs
profiles patterns and fingerprints.
[10]
TEXT BOOKS:
1. S.C Rostogi ,Mendiratta, P.Rasogi, BioInformatics: methods and applications,second
edition, PHI 2006.
2. Jean Mickel Clavere & Cadrienotredom Bio Informatics A beginners guide Wiley
DreamTech, 2003.
REFERENCE BOOKS:
1. T.K. Attwood and D.J Perry Smith, Introduction to Bio Informatics, Pearson Education, 1st
Edition, 2001.
2. Dan E.Krane, Michael L.Raymer, fundamental concepts of BioInformatics, Pearson
Education,
2004.
Instructions for paper setter.
The syllabus has been divided into three equal units. The paper setter is required to set Ten
questions in all, three questions from each unit and a compulsory question consisting of five sub
parts and based on the whole syllabus. The candidate will be required to attempt six questions
including the compulsory question number no 1 and not more than two questions from each unit.

Version 1.1, Page 153 of 155

Computer Science & Engineering

2012-13

CHANDIGARH UNIVERSITY, GHARUAN


ELECTIVE-II CLOUD COMPUTING (CST-435)
L T P Credits
3 - - 3
Total Hours: 48
COURSE OBJECTIVES:

To gain familiarity with the concepts of cloud.


To learn how to implement cloud.
To learn about virtualization concepts.
UNIT-I

Evolution of Computing Paradigms: Overview of Existing Hosting Platforms, Grid


Computing, Utility Computing, Autonomic Computing, Dynamic Datacenter Alliance, Hosting /
Outsourcing, Introduction to Cloud Computing, Workload Patterns for the Cloud, Big Data, IT
as a Service, Technology Behind Cloud Computing.
[6]
Introduction: Essentials Benefits Why Cloud? Business and IT Perspective Cloud and
Virtualization Cloud Services Requirements Cloud and Dynamic Infrastructure Cloud
Computing Characteristics Cloud Adoption.
[4]
Cloud Models: Introduction Cloud Characteristics Measured Service Cloud Models
Security in a Public Cloud Public versus Private Clouds Cloud Infrastructure Self Service
[4]
UNIT-II
Cloud as a Service: Introduction Gamut of Cloud Solutions Principal Technologies Cloud
Strategy Cloud Design and Implementation using SOA Conceptual Cloud Model Cloud
Service Defined.
[4]
Cloud Solutions: Introduction Cloud Ecosystem Cloud Business Process Management
Cloud Service Management Cloud Stack Computing on Demand (CoD) Cloud sourcing.
[4]
Cloud Offerings: Introduction Information Storage, Retrieval, Archive and Protection Cloud
Analytics Testing under Cloud Information Security Virtual Desktop Infrastructure Storage
Cloud.
[4]
Version 1.1, Page 154 of 155

Computer Science & Engineering

2012-13

Cloud Management: Introduction Resiliency Provisioning Asset Management Cloud


Governance High Availability and Disaster Recovery Charging Models, Usage Reporting,
Billing and Metering.
[4]
UNIT-III
Cloud Virtualization Technology: Introduction Virtualization Defined Virtualization
Benefits Server Virtualization Virtualization for x86 Architecture Hypervisor Management
Software Logical Partitioning (LPAR) VIO Server Virtual Infrastructure Requirements.
[6]
Deep Dive: Cloud Virtualization Introduction Storage virtualization Storage Area Networks
Network-Attached storage Cloud Server Virtualization Virtualized Data Center.
[4]
Cloud and SOA: Introduction SOA Journey to Infrastructure SOA and Cloud SOA Defined
SOA and IaaS SOA-based Cloud Infrastructure Steps SOA Business and IT Services.
[4]
Cloud Infrastructure Benchmarking: Introduction OLTP Benchmark Business Intelligence
Benchmark e-Business Benchmark ISV Benchmarks Cloud Performance Data Collection
and Performance Monitoring Commands Benchmark Tools.
[4]
TEXT BOOKS:
1. Raj Kumar Buyya, James Broberg, Andrezei M.Goscinski, Cloud Computing: Principles
and paradigms, 2011
2. Michael Miller, Cloud Computing, 2008.
REFERENCE BOOKS:
1. Judith Hurwitz, Robin Bllor, Marcia Kaufman, Fern Halper, Cloud Computing for
dummies, 2009.
Instructions for paper setter.
The syllabus has been divided into three equal units. The paper setter is required to set Ten
questions in all, three questions from each unit and a compulsory question consisting of five sub
parts and based on the whole syllabus. The candidate will be required to attempt six questions
including the compulsory question number no 1 and not more than two questions from each unit.

Version 1.1, Page 155 of 155