Chandigarh University, Gharuan

CALCULUS & VECTOR SPACES L T P C

Scheme
Version Applicable to branches 3 2 0 5
2019-20 (CSE/IT/EE/ECE/CSE Hons)
(1st semester)
Course Prerequisite: Knowledge of Mathematics up to Total hours =45
Code: senior secondary level.
SMT-122 Objectives

 The objective of this course is to familiarize the prospective engineers with techniques in
calculus, multivariate analysis and linear algebra.
 It aims to equip the students with standard concepts and tools at an intermediate to
advanced level that will serve them well towards solving more advanced level of
mathematics and applications that they would find useful in their respective disciplines.
Course Outcome
Students will be able to understand
1 The concept of partial derivatives and its application in real life situations
The concept of Matrices and its application of analysis to Engineering
2 problems.
3 The concept of vector spaces in a comprehensive manner.

Content of the Syllabus

Unit-I
Calculus: Partial Differentiation, Euler’s Theorem, Composite functions, Jacobian.Taylors and
Maclaurine Series for one and two variables. Multiple Integrals, Change of order and Change of
Variable. Area and volume using double and triple integrals. [15H]

Unit-II
Calculus: Indeterminate forms and L'Hospital's rule
Matrices: Matrices, vectors: addition and scalar multiplication, matrix multiplication; Linear
systems of equations, linear Independence, Rank of a matrix, Gauss elimination and Gauss-Jordan
elimination. Eigen values, eigenvectors, symmetric, skew-symmetric and orthogonal Matrices
[15H]

Unit-III
Vector spaces : Vector Space, linear dependence of vectors, Basis, dimension; Linear
transformations (maps), range and kernel of a linear map, rank and nullity, Inverse of a linear
transformation, rank- nullity theorem(Without Proof) , composition of linear maps, Matrix associated
with a linear map. Inner product spaces, Gram-Schmidt orthogonalization. [15H]

TEXT BOOKS:
1. E. Kreyszig , Advanced Engineering Mathematics, John Wiley,10th Ed.2011.,New Delhi
2. H.K. Dass., Higher Engineering Mathematics, S Chand Publishers, 3 rd revised edition, 2014.
3. B.S.Grewal, Higher Engineering Mathematics, Khanna Publishers, 42th ed.2013, New Delhi.

Date of Issue: Approved by

Reference Material:

1. R.K. Jain, and S.R.K. lyengar, Advanced Engineering Mathematics, 3rd Edition, Narosa
Publishing House, 2004, New Delhi.
2. B.V. Ramana Advanced Engineering Mathematics, McGraw Hill, July 2006, New Delhi.
3. B. Thomas and , R.L., Finney ,Calculus and Analytic Geometry, Pearson Education, 11th Edition..
4. N.P. Bali and Manish Goyal, A text book of Engineering Mathematics, Laxmi Publications,
Reprint, 2008.

Course PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12

CO1 3 2 0 2 1 1 1 0 0 2 1 2
CALCULUS SMT
CO2 3 2 2 3 3 1 1 1 2 1 0 2
& VECTOR -122
SPACES CO3 3 2 2 2 3 1 0 0 0 1 0 3

Date of Issue: Approved by

 Chandigarh University, Gharuan
Scheme Biology for Engineers L T P C
Version
Apply to Programs: CSE/IT, EE/ECE 3 1 0 4
Prerequisite: - NIL Total hours 45
Version Internal = 40 External=60
2019-20
Objectives
 This subject is designed to impart fundamental knowledge on emerging fields of
Subject sciences like bioinformatics.
Code  It is designed to impart knowledge that how to apply different softwares in research.
SZT-172
Subject Outcome
CO1 To develop the firm foundation in science principles and higher level of understanding in each of
the biology sub-discipline.
CO2 To excel in career as researcher in both traditional and emerging fields of science .
CO3 Understand ethical principles and responsibilities for science practices in society.
CO4 To learn the new areas of biology for contemporary research with interdisciplinary approach

Content of the Syllabus

Unit-I [15 L]

Basic Cell Biology

Introduction: Living Organisms, Cells and Cell theory, Cell Structure and Function, Genetic
information, protein synthesis, and protein structure, Cell growth, Cell Division, and differentiation.
[9 ]

Biochemistry and Molecular aspects of life

Gene regulation, aging, apoptosis, stem cell Biology and Tissue engineering [6]

Unit-II [15 L]

Uses of Biology in Engineering

Biosensors -Chemoreceptors, hot and cold receptors, baro receptors, sensors for smell,
sound, vision, osmolality and taste. Transducers for the measurement of ions and dissolved
gases. Ion exchange membrane electrodes - Measurement of pH - Glass pH electrodes. [9]

Recording Electrodes – Electrode-tissue interface, polarization, skin contact impedance,

motion artifacts, Silver-Silver Chloride electrodes, Electrodes for ECG, Electrodes for EEG,
Electrodes of EMG, Electrical conductivity of electrode jellies and creams, microelectrodes,
Needle electrodes [6]

Date of Issue: Approved by

 Unit-III [15 L]

Transducers-classification, selecting of transducers, circuit based on transduction,

temperature transducers-Displacement transducers-pressure transducer-catheter tip
transducers. Photoelectric transducers-flow transducers-piezoelectric transducers and their
applications. [5]
Medical Instrumentation and Techniques- Electrocardiogram (ECG),
Electroencephalogram (EEG), Electro Myogram (EMG), Physics of Ultrasound-Ultrasound
instrumentation- Doppler, Magnetic Resonance Imaging- principles of MRI-pulsequence-
image acquisition and reconstruction technique. [5]

Bioinformatics
Introductory Bioinformatics, BLAST,SWISS Prot, FASTA, Data mining. [5]
Suggested Readings/ Books:

Books Recommended:
Text books:
1. C.V.Powar, Cell Biology
2. Leshie Cromwell, Fred.J. Weibell and Erich.A.Pfeiffer. 2003. Biomedical instrumentation
and measurements. 2nd edition, PHI.
3. John G. Webster 1998. Medical Instrumentation: Applications and Design, 3 rd edition,
Jon Wiley and Sons, New York.
4. Fundamental concepts of bioinformatics. Dan E. Krane, Michael L. Raymer
5. Bioinformatics Methods and applications. S.C Rastogi P Rastogi
Reference Books
1. Jeremy M. Berg, John L. Tymoczko and Lubert Stryer. 2006. “Biochemistry,” 6th Ed.
W.H. Freeman and Co. Ltd.
2. Robert Weaver. 2012 “Molecular Biology,” 5th Edition, MCGraw-Hill.
3. Jon Cooper , 2004. “Biosensors A Practical Approach” Bellwether Books.
4. Martin Alexander, 1994 “Biodegradation and Bioremediation,” Academic Press.
5. Kenneth Murphy, 2011. “Janeway's Immunobiology,” 8th edition, Garland Science.
6. Eric R. Kandel, James H. Schwartz, Thomas M. J. 2012. “Principles of Neural
Science, 5th Edition, McGraw-Hill.
7. S. Thyaga Rajan, N. Selvamurugan, M. P. Rajesh, R. A. Nazeer, Richard W.
Thilagaraj, S. Barathi, and M. K. Jaganathan. 2012 “Biology for Engineers,” Tata
McGraw-Hill, New Delhi.

Date of Issue: Approved by

 Course to Program outcome Relationship

CO/P PO1 PO1

Course PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO12
O 0 1

CO1 1 2 2 1 2 0 1 2 3 3 2 2

CO2 2 2 3 3 3 1 1 2 1 2 1 1
BIOLOGY SZT
FOR -
ENGINEERS 172
CO3 1 1 1 1 1 1 3 3 1 1 1 1

CO4 1 3 1 1 3 1 3 3 1 1 1 1

Date of Issue: Approved by

 Chandigarh University

SubjectCode: Digital Electronics L T P C

ECT-155 TotalContactHours:45Hours
3 0 0 3
Applicable to which branch (CSE &IT)
Marks-100 Batch 2019-2023
Internal-40 External-60
Course Objectives
1. To understand Merits of digitization.
2. To enable you to understand common forms of number representation in digital
electronic circuits and to be able to convert between different representations
3. To Impart Knowledge about various digital circuits and designing of systems
Unit Course Outcomes

Unit-I Merits of digital systems, various number systems and their applications.

Unit-II Combinational and Sequential Digital Designing and solution to basic digital
problems.
Unit-III Designing of sequential circuits and introduction to memory logic design

UNIT -1 15 Hours
Introduction: Why Digital is needed, Merits and Demerits, Difference between Analog and
Digital Electronics. [1 hr]

Number System: Introduction, Binary, Octal and Hexadecimal number system. Signed and
unsigned number; Binary operations: Addition, Subtraction, Multiplication and division;
Subtractions using 1's and 2's compliment, BCD code and gray code. [6 hrs]

Logic gates and Minimization: OR, AND, NOT, NOR, NAND, EX-OR, Basic theorem of
Boolean Algebra, sum of products and product of sums, canonical form, Simplifications
using K-map (4 variable) [8 hrs]

UNIT -2 15 Hours

Combinational Circuits
Introduction to Combinational circuit design, half adder, full adder, BCD Adder, Half
Subtractor, Full Subtractor, Multiplexer, Demultiplexer, encoder, decoder and magnitude
comparator. [7 hrs]
Sequential Circuits
Introduction, latch & flip flop (SR, JK, D and T), race around condition, conversion of flip
flops [8 hrs]

UNIT-3 15 Hours
Designing of Sequential Circuits: Counters: synchronous and asynchronous counters [9 hrs]
Shift Registers: Types ,Circuit Diagram, Timming waveforms. [4 hrs]
Semiconductor Memories : [2 hrs]
Introduction, Classification: RAM, ROM, PROM, EPROM, EEPROM.

Date of Issue: Approved by

 TEXT BOOKS :
1. Mano,Morris, Digital Design, Prentice Hall of India.
2. Malvino, Digital principle and applications, Tata Mc Graw Hill .
3. Floyd & Jain, Digital Fundamentals, Pearson.

REFERENCE BOOKS:
1. Fletcher, An Engg. Approach to digital design, Prentice Hall of India.

PO/C PO PO PO PO PO PO PO PO PO PO1 PO1 PO1

Course O 1 2 3 4 5 6 7 8 9 0 1 2

CO1 1 1 0 2 0 0 0 2 0 0 0 0

Digital
ECT
Electroni CO2 3 2 0 3 2 1 2 2 1 1 0 1
-155
cs

CO3 3 3 3 3 2 1 1 3 2 3 0 3

Date of Issue: Approved by

 Chandigarh University, Gharuan (CSE/IT)

Scheme COMPUTER PROGRAMMING L T P C

Version
Applicable to branches
2019-20 (CSE/IT/EE/ECE) (1st Semester) 0 2 0 2

Course Prerequisite: Basic knowledge of Computer

and Mathematics Total hours = 30
Code:
UCT-145 Internal = 40 External=60
Course Objectives

 The course aims to provide exposure to problem-solving through programming.

 To raise the programming skills of students via logic building capability.
 With knowledge of C programming language, students would be able to model real
world problems.

Course Outcome

After studying this course student will be able to

CO1 Identify situations where computational methods would be useful.

Approach the programming tasks using techniques learnt and write

CO2
pseudo-code.
Choose the right data representation formats based on the requirements
CO3
of the problem.
Use the comparisons and limitations of the various programming
CO4
constructs and choose the right one for the task.

Content of the Syllabus

Unit-I [10L]

Introduction to computer and programming: Introduction, Block diagram and functions

of various components of computer, Flow charts and Algorithms.
[4]
Fundamentals of C: Features of C language, structure of C Program, comments, header
files, data types, constants and variables, operators, expressions, evaluation of expressions,
type conversion, precedence and associatively.
[3]
Decision Control structure in C: Decision making statements, nesting of decision control
structures, break, goto statement.
[3]

Date of Issue: Approved by

 Unit-II [10L]
Loop Control structure in C: Looping statements, nested loop, use of break and continue.
[3]
Array & String: Concepts of array, one and two dimensional arrays, declaration and
initialization of arrays, searching and sorting, string handling, string storage.
[4]
Functions: Concepts of library functions, Built-in-string functions, user defined functions,
prototypes, definition of function, parameters types, parameter passing, calling a function,
recursive function, Macros, Pre-processing.
[3]

Unit-III [10L]
Pointers: Basics of pointers, pointer to pointer, pointer and array, pointer to array, array of
pointers, functions returning a pointer, storage classes.
[4]
Structure: Basics of structure, structure members, structure vs. union, accessing structure
members, nested structures, array of structures, structure and functions, structures and
pointers. [3]
Dynamic memory allocation: Introduction to Dynamic memory allocation, malloc, calloc,
realloc. [3]

Text & Reference Books:

1. Programming in ANSI C by E. Balaguruswamy, Tata McGraw Hill.
2. Programming in C Ansi standard, by Yashwant Kanetkar, BPB Publications.
3. Programming with C (Schaum's Outline Series) by Byron Gottfried Jitender Chhabra, Tata
McGraw Hill.
4. The C Programming Language by Brian W. Kernighan, Dennis Ritchie, Pearson education.

Course to Program outcome Relationship

CO/P PO PO PO PO PO PO PO PO PO PO PO PO
Course
O 1 2 3 4 5 6 7 8 9 10 11 12

CO1 4 2 2 2 4 3 1 3 2 1 1 2

COMPUTER UC CO2 3 3 3 2 2 3 1 1 2 2 1 2
PROGRAMM T-
ING 145 CO3 3 3 2 3 3 3 1 4 1 4 1 2

CO4 4 3 2 2 4 2 1 4 2 2 2 4

Date of Issue: Approved by

 Chandigarh University, Gharuan (CSE/IT)
Innovations & Inventions in Computer
Scheme Science & Engineering/ Information L T P C
Version
Technology
2019-20
Applicable to CSE/IT (1st/2nd Semester) 0 2 0 2
Course Prerequisite: NA Total hours = 30
Code:
Internal = 40
CST-156
External=60
Course Objectives
 To understand concept of innovation, its importance and the evolution of various
things in the field of C.S.E/I.T.

 To analyze the upcoming technological trends.

 To understand how to safeguard innovation and write a research/review paper.

Course Outcome

After studying this course student will be able to

Analyze the importance, classification, need, and various innovations

CO1
that took place in the field of CSE/IT.
Analyze various methods to protect innovation and inventions, the
CO2 procedure to implement the innovation, and write a research/review
paper.
Study the basics of networking and learn the evolution of internet and the
CO3
emerging technology “Internet of things”.
Study various emerging technology trends in the field of CSE/IT and
CO4
write a case study.

Content of the Syllabus

Unit-I [10L]

Introduction and Classification [4]

Introduction to Innovation, Inventions and Discovery, Classification of innovation:
Based On Category - Product Innovation, Process Innovation, Service Innovation, Marketing
Innovation, Organizational Innovation, and Based on Overall Global Needs - Technological
Innovation, Social Innovation, and based on the Degree of Novelty - Incremental
Innovations, Radical Innovations, Systemic / Systematic Innovations, SCAMPER techniques
of innovation, need of innovation.
Major evolutions related to computers [3]
Evolution of operating systems, Evolution of Computer generations, Evolution of mobile
networks, Evolution of programming languages, Evolution of display devices, Evolution of
storage devices.

Date of Issue: Approved by

Intellectual Property Rights [3]
Introduction to methods of protection (Patent, Copyright, Trademark, Trade Secrets), and
detailed discussion on them, How to write a research/review paper.

Unit-II [10L]

New Product Development [2]

Concept building, idea generation, product screening, concept testing, market survey,
prototyping, test marketing, Commercialization
Introduction to networking [4]
Introduction and types of network, various networking devices (switch, hub, router, modem),
network topologies, difference between internet and intranet, case study on internet.
Internet of Things & Cyber Security [4]
Introduction and key features of IOT, Case study of any IOT system, Introduction to cyber
security, goals of cyber security (CIA model), and challenges face in cyber security

Unit-III [10L]

Emerging Trends in the field of Computer Science:

Cloud Computing: Introduction, Characteristics, Service Models, Benefits, application [1.5]
Big Data: Introduction, characteristics, V’s of Big Data, Tools & Techniques,
applications[1.5]
Machine Learning & Deep Learning: Introduction, characteristics, Learning Process,
Categories, application areas [3]
Digital Marketing: Introduction to digital marketing techniques: Search engine optimization,
search engine crawlers etc and its importance [2]
Case study: Emerging trends and innovation in computer science [2]

Text & Reference Books:

1. Innovations - by Navi Radjou, Jaideep Prabhu & Simone Ahuja, Random
Business/Random House India 2012.
2. The Little Black Book of Innovation: How It Works, How to Do It? - Scott D. Anthony,
Harvard Business School Press - 2011.
3. Textbook of Emerging Trends in Information Technology – 2011- Ravi P Patki
4. Emerging trends in information technology- Mrs. Sonal Abhyankar
5. Intellectual Property Rights 1st edition - Neeraj Pandey , Khushdeep, Dharni

Course to Program outcome Relationship

CO/P PO PO PO PO PO PO PO PO PO PO1 PO1 PO1

Course
O 1 2 3 4 5 6 7 8 9 0 1 2

CO1 3 1 0 0 0 1 0 0 1 0 0 0
Innovatio
ns and
CST
CO2 3 3 3 2 3 3 1 1 0 0 2 1
Invention
-156
s in CO3 3 1 0 0 1 0 0 1 1 0 0 0
CSE/IT
CO4 3 3 2 2 2 2 2 1 1 1 3 1

Date of Issue: Approved by

 Chandigarh University, Gharuan (CSE/IT)
Digital Electronics Lab L T P C
Total Contact Hours: 30 0 0 2 1
ECP-156
Applicable to CSE &IT: Batch
2019-2023`
Marks
Internal (60) External (40)
Course Objective
1. To implement truth tables using basic gates.
2. To design various Digital circuits using basic logic gates.
3. To prepare students to perform the analysis and design of various digital
electronic circuits.

Course Outcome
The ability to understand, analyze and design various combinational and
1
sequential circuits.
2 To develop skill to design and build digital circuits.
To understand and examine the structure of various number systems and
3.
its application in digital design.

List of Experiments:
1. To familiarize and study the truth tables of various ICs 7400, 7402, 7404,
7408 and 7432, 7436.

2. To design and implement the Boolean expression using universal NAND

and NOR gates.

3. (a) To design and verify the truth table of Half Adder using gates.
(b) To design and verify the truth table of Full Adder using gates.

4. (a) To design and verify the truth table of Half Subtractor using gates.
(b) To design and verify the truth table of Full Subtractor using gates.

5. To design and implement the 4:1 Multiplexer using gates.

6. To design and implement the 1:4 Demultiplexer using gates.

7. To design and implement the Binary Code to BCD converter.

Date of Issue: Approved by

 8. To design and implement the 2-bit Magnitude Comparator.
9. (a) To verify the truth tables of Flip Flops 7476 (J-K) and 7474 (D)
(b) To design and implement the S-R flip flop using NAND / NOR gates.

10. To design and implement the Shift Register using D Flip Flops, for
various modes: SISO, SIPO, PISO, PIPO.

11. To design and implement the 4-bit Asynchronous Counters using J-K Flip
Flops.

ECP-156 Digital Electronics Lab

Department Teaching
Academic unit 2
the Subject

PO/CO PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12

CO1 1 0 0 1 0 0 2 2 0 0 0 1

CO2 3 3 2 2 2 1 1 2 0 0 1 2

CO3 3 3 3 3 2 1 2 3 1 3 0 3

Date of Issue: Approved by

 Chandigarh University, Gharuan (CSE/IT)

Scheme COMPUTER PROGRAMMING L T P C

Version
2019-20 Applicable to CSE/IT/EE/ECE 1st Semester
0 0 4 2
Course Prerequisite: Basic knowledge of Computer
and Mathematics Total hours = 60
Code:
UCP-145 Internal = 60 External=40
Course Objectives

 The course aims to provide exposure to problem-solving through programming.

 To raise the programming skills of students via logic building capability.
 With knowledge of C programming language, students would be able to model real
world problems.

Course Outcome

After studying this course student will be able to

CO1 Identify situations where computational methods would be useful.

Approach the programming tasks using techniques learnt and write

CO2
pseudo-code.

Choose the right data representation formats based on the requirements

CO3
of the problem.

Use the comparisons and limitations of the various programming

CO4
constructs and choose the right one for the task.

Date of Issue: Approved by

 List of Practical’s

Practical Sub
Aim
# part
Unit-I
Write a program that reads two nos. from key board and gives their
1
addition, subtraction, multiplication, division and modulo.
1 The distance between two cities (In KM) is input through key board. Write
2 a program to convert and print this distance in meters, feet, inches &
centimeters.
3 WAP which implements the working of all Bit-wise operators.
4 WAP to find largest out of three numbers by using ternary operator.
2
WAP to check whether entered year is leap or not.
5
Note: For century year, check number by 400 instead 4.
6 WAP to Find out the Roots of a Quadratic Equation.
WAP to print grade of a student based on marks of 5 subjects entered by
7
user.
Write a menu driven program that allow the user to perform any one of the
3 following operations based on the input given by user
a. check number is even or odd
8 b. check number is positive or negative
c. printing square of the number
d. printing square root of the number
Unit-II
WAP to find sum of all integers greater than 100 & less than 200 and are
9
divisible by 5.
𝑥 𝑥2 𝑥3
4
10 Write a C program to evaluate 𝑒 𝑥 = 1 + 1! + + + ⋯,
2! 3!
Write a program to print series of arm-strong numbers from m to n. m, n
11 will be input by user. Armstrong are those numbers where number= sum of
cubes of digits.
12 Write a program to search an element from an array.
5 Write a program to perform various matrix operations Addition,
13
Subtraction, Multiplication, Transpose using switch-case statement.
Write a program to illustrate various string inbuilt functions (strrev,
14
strcmp, strlen, strcpy, strcat…)
6
Write user defined functions for all the inbuilt functions of the above
15
Program.
Illustrate the concept of call by value vs. call by reference by taking
16
example of swapping of two numbers.
7
Write a recursive function for computing factorial of a number. Write main
17
to test its functioning.

Date of Issue: Approved by

 Unit-III
WAP to read an array of elements and print the same in the reverse order
18
along with their addresses
8
Write a function code that is returning pointer to the larger value out of two
19
passed values.
Define a structure type, personal, that would contain person name, date of
joining and salary. Using this structure, write a program to read this
20
information for one person from the key board and print the same on the
9 screen.
What will the difference if above program is going to be implemented through
21 union. Implement the same program through union and differentiate the output
as well as memory allocation.
WAP to store a character string in block of memory space created by malloc
10 22
and then modify the same to store a large string.

Course to Program outcome Relationship

CO/P PO PO PO PO PO PO PO PO PO PO PO PO
Course
O 1 2 3 4 5 6 7 8 9 10 11 12

CO1 3 1 1 1 3 2 0 2 1 0 0 1

COMPUTER UC CO2 2 2 2 1 1 2 1 1 2 1 1 1
PROGRAMM P-
ING LAB 145 CO3 2 2 1 2 2 2 0 3 1 3 1 2

CO4 3 2 1 1 3 1 0 3 2 1 1 3

Date of Issue: Approved by

 Chandigarh University, Gharuan (CSE/IT)

Scheme Workshop Practice L T P C

Version
Applicable to BE 1st Year
2019-20 0 0 4 2

Course Prerequisite: NA Total hours = 60

Code: Internal = 60
MEP-160 External=40

List of Practical’s

Practica
Name of the Shop Aim
l#

1 To Make a Mortise Part of Mortise & Tenon Joint

Carpentry Shop
To Make Tenon Part of Mortise & Tenon Joint and
2
assemble both to form a Mortise & Tenon joint assembly.
To Make a Godown Circuit Wiring or a House Circuit
3 E & E Shop Wiring.
4 To make & test a Full Wave Rectifier.

5
Fitting Shop To make a 'T' part of Square Fitting Job.
To make a 'U' part of Square Fitting Job and to assemble
6
the both.
7 Sheet Metal To make different types of Sheet Metal Joints.

8
Shop To make a rectangular tray of Sheet Metal or to make a
Funnel from Sheet Metal
To make a job on Centre Lathe involving operations:
9 Facing, Plain Turning, Shoulder Turning & Step Turning
Turning Shop etc.
To make a job on Centre Lathe involving all the above
10 operations & Taper Turning operation using Compound
Rest.
To make a Butt joint weldment by Manual Metal Arc
11
Welding Shop Welding.
To make a Lap joint weldment by Manual Metal Arc
12
Welding.

Date of Issue: Approved by

Chandigarh University, Gharuan
Scheme L T P C
Version DISCRETE MATHEMATICS 3 1 0 4
2019
Course Applicable to CSE/IT/ CSE (Hons.) (Semester- Total hours =45
Code- 2nd )
SMT-174 branchInternal
: (Batch
= 402017 Regular, LEET 2018)
External=60

Objectives
To Impart analytical ability in solving mathematical problems as applied to the
respective branch of Engineering

Course Outcome
Some fundamental mathematical concepts and terminology related to various
types of relations, functions, recursive relations and generating functions.To use
1
and analyze recursive definitions, To learn about the basic counting principle and
solution of the problems relating to Graphs, Trees and fundamental circuit.
To learn about the various algebraic structures like binary/homomorphism/
2
isomomorphism/ auto orphism etc.

Study the different types of graphs as well as the tree & paths and difference between
3
them such as binary/spanning/minimal spanning/ traversal trees.

Content of the Syllabus

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, Min sets & Max sets,
Cartesian product
Relations and functions: Binary relations, types of relations, equivalence relations and
partitions, partial order relations, mathematical induction, principles of inclusion &
exclusion, functions and its types, composition of function and relations, inverse relations
and functions, pigeonhole principle.
Propositional calculus: Basic operations: AND (˄) OR (˅), NOT (-) Truth value of a
compound statements, propositions, tautologies, contradictions.
[15 H]

UNIT-II
Recursion and recurrence relations: Sequence, partial fractions. Recurrence relations
with constant coefficients, homogeneous and particular solutions, solutions of recurrence
relation using generating functions.

Algebraic structures: Definition, elementary properties of algebraic structures, semigroup

Date of Issue: Approved by

monoid, group, homomorphism, isomorphism and automorphism, congruence relations,
subgroups, normal subgroups, cosets, Lagrange's theorem, cyclic groups.
[
15 H]

UNIT-III
Combinatorial Mathematics: Techniques of counting, rule of sum, rule of product
permutations and combinations.
Graph Theory : Introduction to graphs, directed and undirected graphs, homomorphic and
isomorphic graphs, sub graphs multi graphs and weighted graphs, paths and circuits,
shortest path in weighted graphs, Eulerian paths and circuits, Hamiltonian paths and
circuits, planer graphs Euler's formula, chromatic numbers (Colouring problems).
Trees: Introduction to trees, difference between graphs and a tree rooted trees, path length
in trees, spanning trees & cut-sets, minimum spanning trees, binary trees and its traversal.
[15 H]

Text Books:
1. C.L. Liu “Elements of Discrete Mathematics". McGraw Hill, 3rd Edition.
2. Santha,"Discrete Mathematics with Graph Theory, Cengage Learning, 1st Edition.
3. G. Ronald, Knuth, Donald and Patashik, Oren, " concrete Mathematics: A
Foundation for Computer Science ", Addison-Wesley.

Reference Material:
1. B. Kolaman, and R.C. Busby, “Discrete Mathematical Structures” ,PHI, 1st Edition.
2. Gersting, L. Judith “Mathematical Structures for computer Science”, Computer Science
Press.
3. Doerr and Levasseur, “ Applied Discerte Structure for Computer Science”.
4. Tembley & Manohar , “Discrete Mathematical Structures with Applications to Computers”
, Mc Graw Hill.
5. K.H. Rosen, “ Discrete Mathematics and its applications ” Mc-Grew hill.
6. N Ch SN Lyengar. V.M. Chandrasekaran, , “Discrete Mathematics”.

PO PO PO PO PO PO PO PO PO PO PO PO
Courses
1 2 3 4 5 6 7 8 9 10 11 12
CO
3 2 1 2 1 1 1 1 1 2 0 2
1
DISCRETE
SMT- CO
MATHEMA 3 2 2 3 3 1 2 1 2 2 0 2
174 2
TICS
CO
3 2 2 2 3 2 1 1 0 2 0 3
3

Date of Issue: Approved by

 Chandigarh University, Gharuan (CSE/IT)

Object Oriented Programming Using C++ L T P C

Scheme
Version Applicable to (CSE/IT/EE/ECE) (2nd Semester)
2019-20 0 2 0 2

Prerequisite: Basic knowledge of Computer

Course
and Mathematics Total hours = 30
Code:
CST-157 Internal = 40 External=60
Course Objectives

 To enable the students to understand and various stages and constructs of C++
programming language and relate them to engineering programming problems.
 To improve their ability to analyze and address variety of problems in programming
domains.
Course Outcome

After studying this course student will be able to

It will provide the environment that allows students to understand object-
CO1 oriented programming Concepts.
Studentswilldemonstratebasicexperimentalskillsfordifferentiatingbetwee
CO2 nobjectorientedand procedural programming paradigms and the
advantages of object-oriented programs.
Ability to demonstrate their coding skill on complex programming
CO3 concepts and use it for generating solutions for engineering and
mathematical problems.
Students will develop skills to understand the application of classes,
objects, constructors,
CO4 Destructors, inheritance, operator overloading and polymorphism,
pointers, virtual functions, templates, exception handling, file operations
and handling.

Date of Issue: Approved by

 Content of the Syllabus

Unit-I [10L]
Fundamentals of C++: Features of object-oriented programming, Difference between object
oriented and procedure-oriented programming, Difference between structure and class, Data
types. Input and output streams (cin, cout), introduction to namespace. [3]

Classes and Objects: Specifying a class, creating objects, accessing class members, defining
a member function inside and outside class, access specifiers, inline function, static data
members & member functions. Objects as function arguments, friend function, returning
objects to functions. [4]

Constructors and Destructors: Need for constructors, types of constructors: default,

parameterized, copy constructor, order of execution of constructors, destructors and their
need. [3]

Unit-II [10L]
Inheritance: Defining derived class, modes of inheritance, types of inheritance, ambiguity in
inheritance, virtual base class, Function overriding, Member Classes: Nesting of Classes.
[4]

Polymorphism: Introduction & types of polymorphism, Function overloading, operator

overloading, rules for overloading operators, overloading of unary & binary operators,
Constructor Overloading. [3]

Exception Handling: Try, Throw, Catch, Throwing an Exception, Catching an Exception.

[2]

Unit-III [10L]
Pointers, Virtual Functions: Declaring & initializing pointers, pointer to objects, this
pointer, pointer to derived classes, static and dynamic binding. [4]
Dynamic memory allocation: Dynamic memory allocation using new and delete operator.
[2]
Files: Introduction to File streams, Hierarchy of file stream classes, File operations, File I/O,
File opening Modes, Reading/Writing of files, Random-access to files. [4]

Text books:
1. E Balagurusamy., “Object Oriented Programming in C++”, Tata McGraw-Hill.
2. Robert Lafore, “Object Oriented Programming in C++”, Waite Group, December 1998.

Date of Issue: Approved by

Reference Books:
1. Herbert Schildt , “C++- The Complete Reference”, Tata McGraw-Hill 2003, New Delhi.
2. Bjarne Stroustrup: “The C++ Programming Language” (4th Edition). Addison-Wesley.
May 2013.
3. Ravichandran , “Programming with C++”,Tata McGraw-Hill Education, 2001.
4. Joyce M. Farrell,” Object Oriented Programming Using C++”, Learning, January 1998.
5. Programming Languages: Design and Implementation (4th Edition), by Terrence W.
Pratt, Marvin V. Zelkowitz, Pearson, 2000.
6. Programming Language Pragmatics, Third Edition, by Michael L. Scott, Morgan
Kaufmann, 2009.

Course to Program outcome Relationship

CO/P PO PO PO PO PO PO PO PO PO PO1 PO1 PO1

Course
O 1 2 3 4 5 6 7 8 9 0 1 2

CO1 3 3 3 1 3 1 1 3 2 1 0 3
Object
Oriented CS CO2 3 2 2 1 3 2 1 3 3 1 1 2
Programm T-
ing Using 157 CO3 2 2 2 1 2 2 1 3 2 3 1 2
C++ CO4 3 2 2 2 3 1 2 3 2 1 1 3

Date of Issue: Approved by

 Chandigarh University, Gharuan (CSE/IT)

Object Oriented Programming Using

L T P C
Scheme C++ Lab
Version Applicable to branches
2019-20 (CSE/IT/EE/ECE) (1st Semester)
0 0 4 2

Prerequisite: Basic knowledge of Computer

Course
Programming Total hours = 60
Code:
CSP-157 Internal = 60 External=40
Course Objectives

 To enable the students to understand and various stages and constructs of C++
programming language and relate them to engineering programming problems.
 To improve their ability to analyze and address variety of problems in programming
domains.

Course Outcome

After studying this course student will be able to

It will provide the environment that allows students to understand object-
CO1 oriented programming Concepts.
Students will demonstrate basic experimental skills for differentiating
CO2 between object-oriented and procedural programming paradigms and
the advantages of object-oriented programs.
Ability to demonstrate their coding skill on complex programming
CO3 concepts and use it for generating solutions for engineering and
mathematical problems.
Students will develop skills to understand the application of classes,
objects, constructors, destructors, inheritance, operator overloading and
CO4 polymorphism, pointers, virtual functions, templates, exception handling,
file operations and handling.

Date of Issue: Approved by

 List of experiments

Practical Sub
Aim
# part
Unit-I
WAP to find the area of a triangle using Heron’s Formula when three sides
i
of the triangle are input by user.
1 A person walks x km toward east and turns to the right. Then he moves y
ii km.WAP to find the distance between starting and final point. Values of x
and y are input by user.
Program to generate the Fibonacci series up to user specified limit. Write
i
all the missing terms (e.g. 4, 6, 7, 9, 10, 11, 12, 14, 15…) also at the end.
2
WAP to input a matrix of dimension 4x4. If base address is 1000. Find the
ii
address of given element of the matrix.
Create a class called employee that contains a name (an object of class
string) and an employee number (type long). Include a member function
called get data() to get data from the user, and another function called put
i data() to display the data. Assume the name has no embedded blanks.
3
Write a main() program to exercise this class. It should create an array of
type employee, and then invite the user to input data for up to 100
employees. Finally, it should print out the data for all the employees.
ii WAP to add two complex numbers using class and objects.
WAP to add two objects of type time using constructor and destructor in
i
4 the format 11:59:59.
ii WAP to find area of rectangle using parametrized constructor.
Unit-II
i WAP to explain all Inheritance types.
WAP to illustrate ambiguity in multiple inheritance and resolve using
ii
5 scope resolution operator.
iii WAP to resolve the diamond ambiguity using virtual base class.
WAP to calculate and display cube of an integer and decimal number
i
using function overloading.
Program to demonstrate the unary operator overloading for operator ++.
Make a class test. Create a default constructor to initialize the variable.
ii
Make a member function for operator ++ with definition to decrement the
value of variable.
6 Create a class that imitates part of the functionality of the basic data type
int. Call the class Int(note different spelling). The only data in this class is
an int variable. Include member functions to initialize an Int to 0, to
initialize it to an int value, to display it (it looks just like an int), and use
iii
operator overloading to add two Int values. Write a program that exercises
this class by creating two initialized and one uninitialized Int values,
adding these two initialized values and placing the response in the
uninitialized value, and then displaying this result.
i WAP to perform exception handling for Divide by zero Exception.
7
ii WAP to handle various exception handlings.

Date of Issue: Approved by

 Unit-III
Write a program that reads a group of numbers from the user and places them in
i an array of type float. Once the numbers are stored in the array, the program
8 should average them and print the result. Use pointer notation wherever possible.
ii WAP to implement function overriding using virtual functions.
9 i Program to understand the concept of new and delete operator.
Write a program to store the information of about 5 students in a file and read the
i
10 contents and print them on screen.
ii WAP to demonstrate tellg() and tellp() functions.

Course to Program outcome Relationship

CO/P PO PO PO PO PO PO PO PO PO PO1 PO1 PO1

Course
O 1 2 3 4 5 6 7 8 9 0 1 2

CO1 3 3 3 1 3 1 1 3 2 1 0 3
Object
Oriented CS CO2 3 2 2 1 3 2 1 3 3 1 1 2
Programm P-
ing Using 157 CO3 2 2 2 1 2 2 1 3 2 3 1 2
C++ Lab CO4 3 2 2 2 3 1 2 3 2 1 1 3

Date of Issue: Approved by