CSE Scheme & Syllabus for 3rd Semester

1
S.NO
SUBJECT
CODE
CST201
CST202
3
4
5
6
CST203
CST204
CST205
CSP206
7
8
CSP207
9
10
CSP209
11
CSP208
HUP301
SCHEME (2013-2014) B.E .CSE

3RD SEMESTER
SUBJECT NAME
Hours Per
Week
ANALOG AND DIGITAL
ELECTRONICS
COMPUTER ORGANIZATION &
ARCHITECTURE
DATA STRUCTURES
DISCRETE MATHEMATICS
OBJECT ORIENTED
PROGRAMMING
ANALOG AND DIGITAL
ELECTRONICS LAB
DATA STRUCTURES LAB
OBJECT ORIENTED
PROGRAMMING LAB
SEMINAR
PROFESSIONAL
COMMUNICATION SKILLS LAB
INSTITUTIONAL PRACTICAL
TRAINING
TOTAL
Marks
Credits
INT
EXT Total
40
60
100
3.5
40
60
100
3
3
40
40
60
60
100
100
3
3.5
40
60
100
60
40
100
60
40
100
60
40
100
100
100
60
40
100
15
18
540 460
1000
27
4TH SEMESTER
S.NO
SUBJECT
CODE
SUBJECT NAME
NUMERICAL & STATISTICAL

TECHNIQUES
MICRO PROCESSORS &
INTERFACING
DIGITAL COMMUNICATION &
COMPUTER NETWORK
Hours Per
Week
Marks
Credits
INT
EXT Total
40
60
100
3.5
40
60
100
3.5
40
60
100
CST221
CST222
CST223
CST224
OPERATING SYSTEM
40
60
100
CST225
WEB TECHNOLOGIES
40
60
100
CSP226
60
40
100
CSP227
60
40
100
CSP228
WEB TECHNOLOGIES LAB
60
40
100
CSP229
SEMINAR
100
100
10
HUP 402
APTITUDE SKILLS
15
14
900
23
MICRO PROCESSORS &

INTERFACING LAB
NETWORK & OPERATING SYSTEM
LAB
TOTAL
480 420
Note: Students will undergo 6 weeks vocational training after 4th semester. Students are
required to submit one minor project.
5TH SEMESTER
S.NO
SUBJECT
CODE
CST301
2
3
4
CST302
CST303
5
6
7
8
CST305
CSP306
CSP307
9
10
CSP309
CSP310
HUP502
11
12
CST304
CSP308
SUBJECT NAME
DESIGN AND ANALYSIS OF

ALGORITHMS
SOFTWARE ENGINEERING
SIMULATION AND MODELING
RELATIONAL DATABASE
MANAGEMENT SYSTEMS
WIRELESS NETWORKS
SIMULATION AND MODELING LAB
SOFTWARE ENGINEERING LAB
RELATIONAL DATABASE
MANAGEMENT SYSTEMS LAB
VOCATIONAL TRAINING
SEMINAR
PROGRAMMING APTITUDE
INDUSTRIAL TRAINING I
TOTAL
Hours Per
Week
Marks
Credits
INT
EXT Total
40
60
100
3.5
3
3
1
-
40
40
60
60
100
100
3.5
3
40
60
100
3.5
3
-
2
4
40
60
60
60
40
40
100
100
100
3
1
2
60
40
100
15
2
2
4
18
60 40
100
60 40
600 500
100
100
100
1100
2
1
1
4
29.5
6TH SEMESTER
S.NO
SUBJECT
CODE
SUBJECT NAME
Hours Per
Week
Marks
Credits
INT
EXT Total
CST321
THEORY OF COMPUTATION
40
60
100
3.5
CST322
SOFTWARE PROJECT
MANAGEMENT
40
60
100
CST323
COMPUTER GRAPHICS
40
60
100
3.5
HUT324
ENGINEERING ECONOMICS &

PRINCIPLES OF MANAGEMENT
40
60
100
ELECTIVE I
40
60
100
3.5
5
6
CSP325
COMPUTER GRAPHICS LAB
60
40
100
CSP326
SOFTWARE PROJECT
MANAGEMENT LAB
60
40
100
ELECTIVE- I LAB
60
40
100
8
9
CSP327
SEMINAR
100
100
10
HUP601
VERBAL ABILITY & SOFT SKILLS
15
11
900
22.5
TOTAL
480 420
th
Note: Students will undergo 6 weeks vocational training after 6 semester. Students are
required to submit one project.
ELECTIVE I
S.NO. SUBJECT CODE
CST331 and
1
2
3
4
5
CSP334
CST332 and
CSP335
CST333 and
CSP336
CST334 and
CSP 337
CST335 and
CSP338
SUBJECT NAME
SOFTWARE TESTING & QUALITY ASSURANCE AND SOFTWARE TESTING &
QUALITY ASSURANCE LAB
LINUX PROGRAMMING AND LINUX PROGRAMMING LAB
OBJECT ORIENTED SOFTWARE ENGINEERING AND OBJECT ORIENTED
SOFTWARE ENGINEERING LAB
ENTERPRISE INTEGRATION AND ENTERPRISE INTEGRATION LAB
ADVANCED PROGRAMMING AND ADVANCED PROGRAMMING LAB
7TH SEMESTER
S.NO SUBJECT
CODE
SUBJECT NAME
Hours Per
Week
Marks
Credits
INT
EXT Total
CST401
SYSTEM SOFTWARE
40
60
100
CST402
DIGITAL SIGNAL
PROCESSING
40
60
100
3.5
CST403
ARTIFICIAL INTELLIGENCE
40
60
100
CST404
SECURITY &
CRYPTOGRAPHY
40
60
100
3.5
ELECTIVE-II
ARTIFICIAL INTELLIGENCE
LAB
40
60
100
60
40
100
4
5
6
CSP405
CSP406
MINOR PROJECT LAB
60
40
100
CSP407
VOCATIONAL TRAINING
60
40
100
CSP408
SEMINAR
100
100
INDUSTRIAL TRAINING - II
60
40
100
15
16
540 460
1000
30
10
TOTAL
ELECTIVE II
S.NO. SUBJECT CODE
SUBJECT NAME
1
CST411
EMBEDDED SYSTEMS
2
CST412
ADVANCED DBMS
3
CST413
MOBILE APPLICATION DEVELOPMENT
4
CST414
BIOINFORMATICS
5
CST415
CLOUD COMPUTING
6
CST416
BIG DATA
8TH SEMESTER
S.NO SUBJECT
CODE
SUBJECT NAME
Hours Per
Week
Marks
Credits
INT
EXT Total
CST421
DIGITAL IMAGE PROCESSING
40
60
100
3.5
CST422
BUSINESS INTELLIGENCE &

ANALYSIS
40
60
100
CST423
SOFT COMPUTING
40
60
100
3.5
ELECTIVE-III
DIGITAL IMAGE PROCESSING
LAB
40
60
100
60
40
100
4
5
CSP424
CSP425
SOFT COMPUTING LAB
60
40
100
CSP426
MAJOR PROJECT LAB
60
40
100
CSP427
SEMINAR
100
100
12
14
440 360
800
22
TOTAL
S.NO. SUBJECT CODE

CST431
1
ELECTIVE-III
SUBJECT NAME
HUMAN RESOURCE MANAGEMENT
CST432
TOTAL QUALITY MANAGEMENT
CST433
ORGANISATIONAL BEHAVIOUR
CST434
MANAGEMENT INFORMATION SYSTEM
CST435
CYBER LAWS & INTELLECTUAL PROPERTY RIGHTS
CHANDIGARH UNIVERSITY
GHARUAN
Scheme & Syllabus of B.E.

Computer Science & Engineering [CSE]
3rd Semester
CHANDIGARH UNIVERSITY, GHARUAN

Analog And Digital Electronics (CST201)
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, demultiplexer, encoders, decoders, adders, subtracters
and code converters, BCD to 7 segment display. A/D and D/A convertors.
[8]
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. Malvino L., Digital Principle and Applications ,Tata Mc Graw Hill.
2. Ghoshal, Digital Electronic , Cengage Learning.
3. Boylestad ,R., Electronics Devices and Circuit Theory ,Pearson Publication.
Reference Books:
1. Halkias, Millman , Electronic Devices and Circuit, Tata Mc Graw 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.
10

Computer Organization and Architecture (CST202)
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]
11
UNIT-III
Introduction to Parallel Processing- Parallellism in uniprocessor system, Flynns
Classification, Handlers Classification, concept of pipelining, Instruction Pipeline, Arithmetic
Pipeline.
[8]
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.
12

Data Structures (CST203)
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]
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.
14

Discrete Mathematics (CST204)
L T P Credits
3 13.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 more 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]
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]
15
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, Mc Graw Hill.
5. Rosen K. H , Discrete Mathematics and its applications, Mc-Graw hill.
6. Lyengar, N Ch SN, Chandrasekaran, VM, Discrete Mathematics.
16

Object Oriented Programming (CST205)
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
specifiers, 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]
Operator Overloading and Type Conevrsions: 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]
17
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.

18

Analog And Digital Electronics Lab (CSP206)
L T P Credits
- - 2 1
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.
19

Data Structures Lab (CSP207)
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
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.
20
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.
21

Object Oriented Programming Lab (CSP208)
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.
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.
22
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.
23
GHARUAN

4th Semester
24

Numerical and Statistical Techniques - (CST221)
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 Bashforth.
[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]
Sampling and Testing of Hypothesis: Sampling methods. student t-test, Chi-square , F-test
and curve fitting. Correlation and regression analysis.
[8]
25
Text Books:
1. Kreyszig , E., Advanced Engineering Mathematics, John wiley.
2. Grewal, B.S., Higher Engineering Mathematics, Khanna Publishers. New Delhi.
3. Bali, N. P., A Text Book on Engineering Mathematics, Luxmi Pub., New Delhi.
4. 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.

26

Microprocessors and Interfacing (CST222)
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
Architecture, Block Diagram and working of 8251
[4]
[3]
[3]
[3]
[3]
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.
27
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.

28

Digital Communication & Computer Network (CST223)
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]
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]
29
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.

30

Operating System (CST224)
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]
File Management File Concepts, Access Methods, Directory Structure, Allocation Methods,
Free Space Management.
[5]
31
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. Madnick , Stuart E., Donovan, John J. Operating System, McGraw Hill.
2. Stalling,William, Operating Systems, Pearson Education, Fifth Edition.
32

Web Technologies (CST225)
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]
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]
33
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.
34

Microprocessors & Interfacing Lab (CSP226)
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.
35

Network & Operating System Lab (CSP227)
L T P Credit
- - 4 2
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
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.
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.
36

Web technologies Lab (CSP228)
L T P Credit
- - 4 2
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.
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.
37
GHARUAN

5th Semester
38

Design and Analysis of Algorithms (CST301)
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
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]
39
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.
40

Software Engineering (CST302)
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]
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]
41
Quality management: Software quality, Software reliability, Software reviews, Formal

technical reviews, Statistical SQA, Software reliability, The ISO 9000 coding standards, SQA
plan, SEI CMM.
[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:
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. Kassem , Software Engineering,Cengage Learning.
42

Simulation and Modeling (CST303)
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 aquire 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]
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]
43
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.
44

Relational Data Base Management Systems (CST304)
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), Denormalization. [8]
Database Security: Introduction, Threats, Counter Measures.
[2]
Control Structures: Introduction to conditional control, Iterative control and sequential control
statements, Cursors, Views.
[6]
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]
45
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. Ramez Elmasri 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.
46

Wireless Networks (CST305)
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]
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]
47
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.

48

Simulation and Modeling Lab (CSP306)
L T P Credit
- - 2 1
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,

squareroot, 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 isprime 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.
49

Software Engineering Lab (CSP307)
-
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 a collaboration diagrams .
UNIT III
7. To draw Gantt chart and network diagram.
8. To draw a structured chat
L T P Credits
- 4
2
50

Relational Database Management Systems Lab (CSP308)
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, 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
51
GHARUAN

6th Semester
52
CHANDIGARH UNIVERSITY GHARUAN

Theory of Computation (CST321)
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]
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]
53
Turing Machines: Definitions and Examples, Deterministic and Non- Deterministic Turing
Machines, Unsolvable Problems: A Nonrecursive 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.
54

Software Project Management (CST322)
L T P Credit
3 - - 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]
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]
55
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 levelling, 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]
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. Schwalbe Kathy ; 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.
.
56

Computer Graphics (CST323)
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
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]
57
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.
58

Engineering economics & Principles of Management (HUT324)
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; pay back 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]
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]
59
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 Mcgraw Hill , 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.

60

Computer Graphics Lab (CSP325)
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.
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++.
61

Software Project Management Lab (CSP326)
L
P Credits
2
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.
62

Elective 1 - Software Testing and Quality Assurance (CST331)
L T P Credits
3 1 0 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 tracking overview, 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]
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
63
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. Cem Kaner, Jack Falk,Hung Quoc 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.
64

Elective 1 - Linux Programming (CST332)
L T P CREDITS
3 1 0 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]
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]
65
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. Machtelt Garrels, Introduction to Linux-A Hands on Guide, Addison Wisley.
3. J.Purcell, Linux Complete Command Reference, Red Hat Software, Mcgrawhill.
4. Haviland and Salama ,Unix System Programming, Addison Wesley.
5. Gray, Interprocess Communications in Unix, Prentice Hall.
66

Elective 1: Object Oriented Software Engineering (CST333)
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]
Modelling 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]
Testing: Introduction, on testing, unit testing, integration testing, system testing, the testing
process.
[8]
Text Books:
1. Booch Grady , Object-Oriented Analysis and Design with Applications, Addison-Wesley .
2. Jacabson Ivar , 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.
67
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.
.
.
68

Elective 1: Enterprise Integration (CST334)
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 Web
Applications, Java Server Pages and Model/View/Controller, J2EE Web Services Overview,
Introduction to EJB, Session EJBs, Entity EJBs, JMS and message driven Beans, Transactions
and Security, Application Servers (Case Study of any one of IBM Websphere, BEA Weblogic,
JBoss).
[16]
Unit-II
Hibernate: Principles of Object Relational Mapping, Hibernate configuration, HQL making
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, Spring ORM, 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 in web application, MVC Framework. [11]
Web Services: Introduction to XML, Service-Oriented Architectures SOAP, SOAP message
structure, handling errors WSDL, UDDI, Java Web Service implementations JAX-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. Pradhan Anubhav, Nanjappa Satheesha B., Nallasamy Senthil K, Esakimuthu Veerakumar
Raising Enterprise Applications: A Software Engineering Perspective, Willey India.
69
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.Govind Sesadri, Enterprise java Computing: Application and Architectures, Cambridge
University Publications.

70

Elective 1-Advanced Programming (CS335)
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]
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]
71
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.
72

Elective 1: Software Quality and Testing Techniques Lab (CSP334)
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 TestManager) 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.
73

Elective 1: Linux Programming Lab (CSP335)
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.
1.
2.
3.
4.
5.
UNIT I
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.
74

Elective 1: Object Oriented Software Engineering Lab (CSP336)
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.
75

Elective 1: Enterprise Integration Lab (CSP337)
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.
76

Elective 1: Advanced Programming Lab (CSP338)
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.
4. Create a function which returns the sum of all elements in a vector and use the returned value
to compute the average.
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.
77
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.
78

CSE Scheme & Syllabus for 3rd Semester

Uploaded by

Document Information

Original Description:

Original Title

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

CSE Scheme & Syllabus for 3rd Semester

Uploaded by

Copyright:

Available Formats

1

SCHEME (2013-2014) B.E .CSE

NUMERICAL & STATISTICAL

WEB TECHNOLOGIES LAB

MICRO PROCESSORS &

DESIGN AND ANALYSIS OF

ENGINEERING ECONOMICS &

COMPUTER GRAPHICS LAB

VERBAL ABILITY & SOFT SKILLS

MINOR PROJECT LAB

DIGITAL IMAGE PROCESSING

BUSINESS INTELLIGENCE &

SOFT COMPUTING LAB

MAJOR PROJECT LAB

S.NO. SUBJECT CODE

TOTAL QUALITY MANAGEMENT

MANAGEMENT INFORMATION SYSTEM

CYBER LAWS & INTELLECTUAL PROPERTY RIGHTS

Scheme & Syllabus of B.E.

CHANDIGARH UNIVERSITY, GHARUAN

Instructions for paper setter.

CHANDIGARH UNIVERSITY, GHARUAN

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.

CHANDIGARH UNIVERSITY, GHARUAN

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

To apply different data structures for modeling real world problems.

Graphs: Graph Theory terminology, sequential representation of graphs (adjacency matrix,

CHANDIGARH UNIVERSITY, GHARUAN

CHANDIGARH UNIVERSITY, GHARUAN

To understand object oriented programming concepts.

Introduction: Differences between object oriented and procedure oriented programming.

Instructions for paper setter.

CHANDIGARH UNIVERSITY, GHARUAN

CHANDIGARH UNIVERSITY, GHARUAN

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

CHANDIGARH UNIVERSITY, GHARUAN

Scheme & Syllabus of B.E.

CHANDIGARH UNIVERSITY, GHARUAN

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

Numerical solution of Ordinary Differential Equations: Introduction, Solution of

Instructions for paper setter.

CHANDIGARH UNIVERSITY, GHARUAN

80286, 80386, 80486. Pentium

3. Bhurchandi, K.M , Ray, A.K , Advanced microprocessors and peripherals, TMH.

Instructions for paper setter.

CHANDIGARH UNIVERSITY, GHARUAN

Instructions for paper setter.

CHANDIGARH UNIVERSITY, GHARUAN

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

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

CHANDIGARH UNIVERSITY, GHARUAN

To design and format web pages using HTML and CSS.

CHANDIGARH UNIVERSITY, GHARUAN

To get familiarization with 8085 kit and simulator.

To study 8085-microprocessor trainer kit.

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

CHANDIGARH UNIVERSITY, GHARUAN

CHANDIGARH UNIVERSITY, GHARUAN

Scheme & Syllabus of B.E.

CHANDIGARH UNIVERSITY, GHARUAN