SCHEME OF STUDY

&SYLLABI
BE CSE
Batch 2017 – 2018
3rd Semester
 3rd Semester

Subject Subje
S.No Subject Name Code ct L T P INT EXT Total Cr.
Type
Introduction to UCT-242
1 Management & HSM 2 0 0 40 60 100 2
Leadership
TDT-202
2 Aptitude DC 0 2 0 40 60 100 1
Computer Organization CST-203
3 ES 3 0 0 40 60 100 3
and Architecture
CST-231
4 Data structures DC 3 0 0 40 60 100 3
SMT-221
4 Discrete Mathematics BS 3 1 0 40 60 100 4

CST-220
6 Software Engineering DC 3 0 0 40 60 100 3

Software Engineering CSP-207

7 DC 0 0 2 60 40 100 1
Lab
8 Java Programming Lab CSY-208 MNG 0 0 4 60 40 100 2
CSP-232
9 Data structures Lab DC 0 0 4 60 40 100 2

Life Skills and UCY-296

10 MNG 0 1 0 0 0 0 0.5
Mentoring-2
11 Engineering SMY-222
MNG 3 1 0 40 60 100 4
Mathematics (LEET)
Institutional/Summer CSY-210
12 MNG 0 0 0 60 40 100 2
Training*
 Chandigarh University, Gharuan
Introduction to Management
Subject Code L T P C
&Leadership
UCT-242 Total Contact Hours : 30Hours
2 0 0 2
CSE 2nd Year
Marks-100
Internal-40 External-60
Course Objectives
 To learn the basics of management and study its principles and functions.
 To study concept of operational aspects of management and management ethics.
 To understand concept of Leadership and its theories.
Unit Course Outcomes
Student will be able to appreciate & implement the concept of management in
I
their personal & professional life.
Student will learn about operational aspects of management and management
II
ethics.
Students will study the concept of leadership and its theories and apply the
III
concepts in their professions.

Contents of the Syllabus

UNIT- I

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

Concepts of Management, The history and streams of management, the general and technical
environment in management and the business strategy
Strategic Management: Introduction to strategic management: The strategies, process, vision,
mission and goal setting. External and Internal analysis.

UNIT-II

Leadership Foundation And Theories: - Introduction to Leadership styles, Great Man

theory, Trait theory, Behavioral Theory, Contingency, Transformational and Transactional
leadership theory,
Group Dynamics and Teams; Leadership in Complex group and Organization: Being in
Communities, Renewing group organization and communities, Understanding the change and
strategies for change.
MBTI- Myers Brigg Type Indicator.

UNIT-III
Organizing People, Project and Process: Leading Teams, Managing Human Resource
Systems, Managing Individual and Diverse Systems

Control: Function of control, Cycle of Control and Control in the process of organizing.

Text Books:
1. Management Theory and Practice: Gerald A Cole, Cengage Learning EMEA Higher
Education
2. Management Theory and Practice, Chandan, J.S, Vikas Publications, 1987
3. Management Theory, Sheldrake John, Published Intl Thomson Business Pre 1966
4. Introduction to Leadership: Concepts and Practice, Northouse.G.Peter, Sage Publications.
5. Reframing Organizations: Artistry, Choice and Leadership, Bolman. G. Lee
 Chandigarh University, Gharuan

Computer Organization and

L T P C
Architecture
Subject Code
Total Contact Hours : 45 Hours
CST-203/ITT-203
Common to all Specializations of 3 0 0 3
CSE/IT 2nd Year

Marks-100

Internal-40 External-60

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 Course Outcomes

Understand the operation of electronic logic elements

I. Understand the organization of a computer system in terms of its main components
Understand different processor architectures
Understand input/output mechanisms
II.
Understand the various parts of a system memory hierarchy
Have practical experience of prototyping digital circuits
III.
Be able to interface digital circuits to microprocessor systems

Contents of the Syllabus

UNIT-I [15h]

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

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

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

Classification, Handler’s Classification, concept of pipelining, Instruction Pipeline,
Arithmetic Pipeline.
Multiprocessors- Characteristics of multiprocessors, Uniform and non-uniform memory
access multi processors, various interconnection networks.
Text Books:
1. Carpinelli J.D,” Computer systems organization &Architecture”, Fourth Edition,
Addison Wesley.
2. Patterson and Hennessy, “Computer Architecture” , Fifth Edition Morgaon Kauffman.

Reference Books:
1. J.P. Hayes, “Computer Architecture and Organization”, Third Edition.
2. Mano, M., “Computer System Architecture”, Third Edition, Prentice Hall.
3. Stallings, W., “Computer Organization and Architecture”, Eighth Edition, Pearson
Education.

Course Code- Computer Organization and Architecture

CST-203/ITT-203

Department
Teaching the Department of Computer Science and Engineering
Subject

Program Outcome a b c d E f g h i j

Mapping of Course
outcome with I,II,III
Program outcome

Category BS ES PD PC PE OE Project/Training
 X

Approval Date of meeting of the Board of Studies

Instructions for the paper-setter

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

Maximum Marks = 60 Time: 3 Hrs

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.

Name of the Subject Computer Organization Subject Code CST-203/ITT-203

and Architecture

It is certified That syllabus is free from spelling, grammatical or any duplicacy. Course outcomes have
been mapped with Program outcome
S. No. name Designation signature
1
2 Asso. Dean
 ChandigarhUniversity,Gharuan
Scheme L T P C
Version DISCRETEMATHEMATICS 3 1 0 4
2017
Subject Applicableto CSE/IT/ CSE (Hons.) Total hours =45
Code- (Semester-3rd)
SMT-221 branch : (Batch 2017Regular, LEET2018)
Objectives
ToImpart analyticalability in solvingmathematical problemsasappliedtothe
respectivebranchof Engineering

SubjectOutcome
1 Somefundamentalmathematicalconcepts andterminologyrelated tovarious
types ofrelations,functions, recursiverelations andgeneratingfunctions.To use
andanalyzerecursivedefinitions,Tolearnabout thebasic countingprincipleand
solutionof theproblemsrelatingto Graphs,Trees and fundamentalcircuit.

2 Tolearnabout thevarious algebraicstructures like binary/homomorphism/

isomomorphism/auto orphismetc.
3 Study thedifferenttypesofgraphs aswellasthe tree&paths anddifferencebetween
themsuchasbinary/spanning/minimal spanning/ traversal trees.

The content of the Syllabus

UNIT-I
SetTheory:Introductiontoset theory, set operations, algebraof sets,combination ofsets,
duality,finiteandinfinitesets,classesofsets,powersets,Minsets&Maxsets,Cartesian product
Relationsandfunctions:Binaryrelations,types ofrelations, equivalencerelationsand
partitions,partialorderrelations,mathematical induction,principlesofinclusion&exclusion,
functionsandits types, compositionoffunction andrelations,inverserelationsand functions,
pigeonholeprinciple.
Propositional calculus: Basic operations:AND (˄)OR (˅), NOT(-) Truthvalueofa
compound statements, propositions, tautologies,contradictions.
[15H]

UNIT-II
Recursion andrecurrence relations:Sequence, partialfractions. Recurrencerelations
with constantcoefficients,homogeneous andparticularsolutions, solutions of
recurrencerelation usinggeneratingfunctions.
Algebraicstructures:Definition,elementarypropertiesof algebraic structures, semigroup
monoid,group,homomorphism,isomorphismandautomorphism,congruencerelations,
subgroups,normalsubgroups, cosets, Lagrange'stheorem,cyclic groups.
[15 H]
 UNIT-III
Combinatorial Mathematics:Techniquesofcounting,ruleofsum,ruleof product
permutationsandcombinations.
GraphTheory:Introduction tographs,directed andundirectedgraphs,homomorphic and
isomorphicgraphs,subgraphsmultigraphsandweightedgraphs,pathsandcircuits,shortest
pathinweightedgraphs,Eulerianpathsandcircuits,Hamiltonianpathsandcircuits,planer
graphsEuler'sformula, chromatic numbers(Colouringproblems).
Trees:Introductiontotrees,differencebetweengraphsandatreerootedtrees,pathlengthin
trees,spanningtrees&cut-sets, minimumspanning trees,binarytreesanditstraversal.
[15H]

TextBooks:
1.C.L. Liu“Elementsof DiscreteMathematics". McGraw Hill,3rdEdition.
2.Santha,"DiscreteMathematics withGraphTheory, CengageLearning,1st Edition.
3.G. Ronald,Knuth,DonaldandPatashik,Oren," concreteMathematics:AFoundation
forComputer Science",Addison-Wesley.

Reference Material:
1.B. Kolaman,and R.C. Busby,“DiscreteMathematicalStructures”,PHI, 1stEdition.
2.Gersting, L. Judith“MathematicalStructuresfor computerScience”,ComputerSciencePress.
3.DoerrandLevasseur,“AppliedDiscerteStructureforComputerScience”.
4.Tembley&Manohar,“DiscreteMathematicalStructures with Applications toComputers”,Mc
GrawHill.
5.K.H. Rosen,“DiscreteMathematics anditsapplications” Mc-Grew hill.
6.NChSNLyengar. V.M.Chandrasekaran,,“DiscreteMathematics”.

The Students outcomes are:

a) An ability to apply knowledge of mathematics, and engineering.

b) An ability to design and conduct experiments, as well as to analyze and interpret data.
c) An ability to design a system, component or process to meet desired needs within realistic
constraints such as economic, environmental, social, political, ethical, health and safety,
manufacturability, and sustainability.
d) An ability to function on multidisciplinary teams.
e) An ability to identify, formulates, and solves engineering problems.
f) An understanding of professional and ethical responsibility.
g) An ability to communication effectively.
h) The board education necessary to understand the impact of engineering solutions in global,
economic, environmental, and societal context.
i) Recognition of the need for, and an ability to engage in life-long learning.
j) Knowledge of contemporary issues.
k) An ability to use the techniques skills, and modern engineering tools necessary for
engineering practice

Subjectoutcome
Subject a b c d e f g h i j k
Outcome
Subject √ √
mapping √

Unit I,II,III I,II,III I,II,III

Mapping
UC B/F DC DE UO MNG
√
Category HONS PROJECT BW PRACTICAL TRAINING SEMINAR

Department MATHEMATICS
Subject
Code: SMT-
DISCRETEMATHEMATICS ( SEMESTER 3RD)
221
Teaching–LearningProcess
Open- Project- Open- Beyondthe
ended type Lab ended curriculum
Teaching aids Deliverymode
problem/ activity Work lab
Numerical work
Video, Online Theory/ Numerical/
Ppt. lecture Description Designed
etc problem

40% 60% 10%

Instructionsfor the paper-setter:

Please gothroughthese instructionsthoroughlyandfollowthe same pattern whilesettingthe
paperas the studentshave beenpreparedaccordingtothis format.

Maximum Marks=60 Time:3 Hours

Weightageperunit=20marks(excluding overattemptweightage)
1.QuestionPaperwillconsistoftenquestions.
2.SectionAof questionpaperiscompulsory, containingfiveparts each of2 markscovering
thewholesyllabus(total10marks)
3.SectionB,C,Dcontains9 questionsin total,3from each UnitI,II,III respectively.Attempt any
five questionfromSectionB,C,Dtaking at leastone questionfromeach section but notmore than
two questions fromSection- B,C,D.(Total50marks).

Name of the
Subject
DISCRETEMATHEMATICS Subject Code SMT-221

It is certified That syllabus is free from spelling, grammatical or any duplicacy. Course
outcomes have been mapped with Program outcome

S. No. Name Designation signature

1 Mr. Amarjeet Arora Asstt. Prof

2 Mr. Rajveer Singh Subject

Coordinator

3 Dr. S.S. Chauhan HOD

 Chandigarh University, Gharuan

Data Structures L T P C
Subject Code Total Contact Hours : 45Hours
CST-231/ITT-231 3 0 0 3
Common to all Specializations of CSE/
2nd Year

Marks-100

Internal-40 External-60

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 Course Outcomes

Understand the properties of various data structures.

I.
identify the strengths and weaknesses of different data structures

design and employ appropriate data structures for solving computing problems
II.
possess the knowledge of various existing algorithms

analyze and compare the efficiency of algorithms

III.
possess the ability to design efficient algorithms for solving computing problems

Contents of the Syllabus

UNIT-I [15h]

Introduction: Concept of data and information, Introduction to Data Structures, Types of

data structure: Linear and non-linear data structures, operations on Data Structures,
Algorithm complexity, Time-space trade off, asymptotic notations.
Arrays: Basic terminology, Linear arrays and their representation, Traversing Linear Array,
Insertion & Deletion in arrays, searching – linear search, binary search, sorting – insertion
sort , selection sort , bubble sort , merging arrays & merge sort , complexity analysis of each
algorithm, Multi-dimensional arrays and their representation, Pointers; Pointer Arrays,
Records; Record structure, representation of records in Memory, Parallel Arrays, sparse
matrices and their storage.

UNIT-II [15h]
Linked List: Linear linked list, Representation of Linked Lists in Memory, Traversing a
linked list, searching a linked list, insertion in & deletion from linked list, Header Linked
List, doubly linked list, Operations on doubly linked list, complexity analysis of each
algorithm, Application of linked lists.
Stacks: Basic terminology, Sequential and linked representations, Operations on stacks:
PUSH & POP, Application of stacks: Parenthesis matching, evaluation of postfix
expressions, conversion from infix to postfix representation, Quick Sort and its complexity
analysis. Meaning and importance of recursion, principles of recursion & implementation of
recursive procedure
Queues: Linear queue, Sequential and linked representation of Linear queue, Circular queue,
Operations on queue, Deques, Priority queue.
UNIT-III [15h]

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

Path Matrix), traversing a graph, Operations on Graph.
Trees: Basic terminology, Binary Trees, Representation of Binary Trees in Memory,
traversing Binary Trees, Traversal Algorithms using stacks, Header Nodes; Threads, Binary
Search trees, Searching, Inserting & Deleting in Binary Search Trees, AVL Search trees, B
Trees, Heap & Heap Sort.
Hashing & File Organization: Hash Table, Hash Functions, Collision Resolution Strategies,
Hash Table Implementation. Concepts of files, Organization of records into Blocks, File
organization: Sequential, Relative, Index Sequential, Inverted File.
Text Books:
1. Lipschutz, Seymour, “Data Structures”, Schaum's Outline Series, Tata McGraw Hill.
2. Gilberg/Forouzan,” Data Structure with C ,Cengage Learning.
3. Augenstein,Moshe J , Tanenbaum, Aaron M, “Data Structures using C and C++”,
Prentice Hall of India.

Reference books:
1. Goodrich, Michael T., Tamassia, Roberto, and Mount, David M., “Data Structures
and Algorithms in C++”, Wiley Student Edition.
2. Aho, Alfred V., Ullman, Jeffrey D., Hopcroft ,John E. “Data Structures and
Algorithms”, Addison Wesley.
 Course Code
Data Structures
CST-231/ITT-231

Department
Teaching the Department of Computer Science and Engineering
Subject

Program Outcome a b c d E f g h i j

Mapping of Course
outcome with I,II,III
Program outcome

BS ES PD PC PE OE Project/Training
Category
X

Approval Date of meeting of the Board of Studies

Instructions for the paper-setter

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

Maximum Marks = 60 Time: 3 Hrs

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.

Name of the Subject Data Structures Subject Code

It is certified That syllabus is free from spelling, grammatical or any duplicacy. Course outcomes have
been mapped with Program outcome
S. No. Name Designation signature
1
2
 CHANDIGARH UNIVERSITY, GHARUAN

Software Engineering L T P C
Subject Code
Total Contact Hours : 45Hours
CST-
Common to all Specializations of CSE 2nd 3 0 0 3
220//ITT-220
Year

Prerequisite: Studied Project Basics in Institutional Training

Marks-100

Internal-40 External-60

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 Course Outcomes

 Selection and implementation of different software development process

models
I
 Extracting and analyzing software requirements specifications for different
projects

 Defining the basic concepts and importance of Software project management

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

 Analyzing software risks and risk management strategies

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

Contents of the Syllabus

Unit-I [15h]

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

and Product, Software development life cycle, Different life cycle models (waterfall,
Iterative waterfall, Prototype, Evolutionary and Spiral model), Agile software development
and Their characteristics.
Software requirement: Requirement Analysis, Analysis principle, Software prototyping
Specification, Data modeling, Functional modeling and information flow,
behavioralmodeling, Mechanics of structural modeling, Data dictionary.

Function and Object oriented design: Structured analysis, Data flow diagrams, Basic
object orientation concepts, Unified modeling language, Unified modeling language, Use
case model, Class diagrams, Interaction diagrams, Activity diagrams, State chart diagrams.

UNIT –II [15h]

Software design: Design process and concepts, Effective Modular design, the design model,
Design documentation, Approaches to Software design.

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

COCOMO Model, Project scheduling, Risk analysis and management, Software quality and
management, Staffing, software configuration management.

User interface Design: Characteristics of good user interface design, Command language
user interface, Menu based, Direct manipulation interfaces, Fundamentals of command based
user interface.

UNIT-III [15h]

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

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

technical reviews, Statistical SQA, Software reliability, The ISO 9000 coding standards, SQA
plan, SEICMM.

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

engineering, Different Maintenance models, Basic issue in any reuse program, reuse
approach

Text & Reference Books:

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

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

Department
Department of CSE
Teaching the Subject

a b c d E f g h i j k
Program Outcome

Mapping of Course
outcome with
Program outcome

Project/
BS ES PD PC PE OE
Category Training

Approval Date of meeting of the Board of Studies……..

Instructions for the Paper-Setter

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

Maximum Marks = 60 Time: 3

Hrs

Weight age per unit = 20 marks (excluding over attempt weight age)

1. Question Paper will consist of ten questions.

2. Section A of question paper is compulsory, containing five parts each of 2 marks covering
the whole syllabus (short answer type- total 10 marks)
3. Set three questions from each unit I, II and III. Students will attempt 5 questions selecting
at least one question from sections B, C & D. Each question carries 10 marks. Questions of
Section B will be from unit I, Questions of Section C from unit II and Questions of section D
from unit III.4. In the question paper, distribution of the questions should be by considering
30 % numerical part and 70 % conceptual.

Name of the Subject Software Subject Code

Engineering
It is certified That syllabus is free from spelling, grammatical or any duplicacy. Course outcomes have
been mapped with Program outcome
S. No. name Designation signature
1
2
 CHANDIGARH UNIVERSITY, GHARUAN

Software Engineering Lab L T P C

Subject Code Total Contact Hours : 45Hours

CSP- Common to all Specializations of CSE 2nd 0 0 2 1

207/ITP-207 Year

Prerequisite: Basic Knowledge of project management

Marks-100

Internal-60 External-40

Course Objectives

 To understand the various phases of software development.

 To learn various user interface designs.
 To understand the various testing techniques.

Unit Course Outcomes

 To study and draw different level DFD and charts.

I-III
 To study and design models using UML modeling objects

List of Experiments

Unit-I

1) Draft a project plan for the any of the project, student submitted in previous semester.
2) Development of SRS document, Design document for the selected project.
3) To draw a different level DFD.
Unit-II
4) To draw a ER diagram.
5) To draw a case diagrams.
6) To draw a sequence diagrams.
7) To draw a class diagrams.
Unit-III
8) To draw collaboration diagrams.
9) To draw Gantt chart and network diagram.
10) To draw a structured chat
CSP-207/ITP-207 Software Engineering Lab

Department
Department of CSE
Teaching the Subject

A b c d E f g h i j k
Program Outcome

Mapping of Course
outcome with
Program outcome

Project/
BS ES PD PC PE OE
Category Training

Approval Date of meeting of the Board of Studies……..

Name of the Subject Software Engineering Subject Code

Lab
It is certified That syllabus is free from spelling, grammatical or any duplicacy. Course outcomes have
been mapped with Program outcome
S. No. name Designation signature
1
2
 CHANDIGARH UNIVERSITY, GHARUAN

Data Structures Lab L T P C

Total Contact Hours : 45Hours
Subject Code Common to all Specializations of CSE 0 0 4 2
nd
CSP-232/ITP-232 2 Year
Prerequisite: Studied C/C++ in previous semesters

Marks-100
Internal-60 External-40
Course Objectives
 To implement various data structure and operations on them using C++.
 To implement various sorting and searching algorithms using C++.

Unit Course Outcomes

Designing and applying appropriate data structure using simple algorithms for
I.
modeling and solving given computing problems.

Understand and implement the both array based and linked-list based data
II.
structures, including singly, doubly, and circular linked-lists.

III. Understand and implement the Stack data structure and stack operations.

List of Experiments
UNIT-I

1. Write a menu driven program that implement following operations (using separate
functions) on a linear array:
a) Insert a new element at end as well as at a given position
b) Delete an element from a given whose value is given or whose position is given
c) To find the location of a given element
d) To display the elements of the linear array
2. Program to demonstrate the use of linear search to search a given element in an array.
3. Program to demonstrate the use of binary search to search a given element in a sorted array
in Ascending order.
4. Program to sort an array of integers in ascending order using bubble sort.
5. Program to sort an array of integers in ascending order using selection sort.
6. Program to sort an array of integers in ascending order using insertion sort.
7. Program to sort an array of integers in ascending order using merge sort.

UNIT-II

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

CSP-232/ITP-232 Data Structures Lab

Department
Teaching the Department of Computer Science and Engineering
Subject

Program Outcome a b c D E f g h i j

Mapping of Course
outcome with I,II,III
Program outcome

BS ES PD PC PE OE Project/Training
Category
X

Approval Date of meeting of the Board of Studies

Name of the Subject Data Structures Lab Subject Code

It is certified That syllabus is free from spelling, grammatical or any duplicacy. Course outcomes have
been mapped with Program outcome
S. No. name Designation signature
1 Asstt. Prof
2 HOD
 CHANDIGARH UNIVERSITY, GHARUAN

Java Programming Lab L T P C

Total Contact Hours : 45Hours
Subject Code Common to all Specializations of CSE 0 0 4 2
CSY-208/ITY-208 2nd Year
Prerequisite: Studied C/C++ in previous semesters

Marks-100
Internal-60 External-40
Course Objectives
 To implement programs in java.
 To enable students to retrieve and update data from relational databases using JDBC.

Unit Course Outcomes

The students will learn to write, compiling & execute basic java program.

I. The student will learn the use of data types & variables, decision control structures:
if, nested if etc.

II. The student will learn the use loop control structures: do, while, for etc.

III. The student will be able to create classes and objects and use them in their program.

List of Experiments

UNIT-I

1. Write a program to study different types of constructors in java

2. Write a program to create classes and use of different types of methods.

3. Program to learn different types of inheritance in java.

4. Write program to study access modifiers in java using packages.

UNIT-II

5. Write program to differentiate between method overloading and method overriding.

6. Create an interface and design a class to implement an interface.

7. Write a program to read and write data to a file.

 UNIT-III

8. Write a program to read and write an object to file.

9. Write a program to handle an exception using try, catch and throw.

10. Write a program to insert values in a table at run time using JDBC.

CSY-208/ITY-208 Java Programming Lab

Department
Teaching the Department of Computer Science and Engineering
Subject

Program Outcome a b c D E f g h i j

Mapping of Course
outcome with I,II,III
Program outcome

BS ES PD PC PE OE Project/Training
Category
X

Approval Date of meeting of the Board of Studies

Name of the Subject Java Programming Lab Subject Code

It is certified That syllabus is free from spelling, grammatical or any duplicacy. Course outcomes have
been mapped with Program outcome
S. No. name Designation signature
1 Asstt. Prof
2 HOD
 Chandigarh University, Gharuan

ENGINEERING MATHEMATICS L T P C
Total contact hours : 60 3 1 0 MNG
Common to all
Applicable to which branch: All branches
SMY-222 branches of
of Engineering LEET -2018
Engineering LEET
(Mandatory Non Graded Course )
(3rd semester)
Prerequisite: Knowledge of mathematics
up to senior secondary level.
Marks
Internal (40) External (60)
PURPOSE
To impart analytical ability in solving mathematical problems as applied to the respective
branches of Engineering
Unit INSTRUCTIONAL OBJECTIVES
To have knowledge in linear algebra and infinite series.
1.
To improve their ability of computation in matrices and complex nos.
To familiarize students with partial differentiation.
2.
To enable the students to apply the notions practically.
3. To have knowledgeMultiple Integral And Vector Calculus

UNIT-I

BASIC ALGEBRA

Matrices: Rank of matrix; elementary operations; reduction to normal form; consistency and
solution of homogenous and non homogeneous simultaneous equations
Complex Numbers: De-Moivre’s theorem, applications of De-Moivre’stheorem ;
Exponential function; logarithmic function ; circular function
Infinite Series: Convergence and divergence of series; tests of convergence (without
proofs), comparison test; ratio test and Gauss test; convergence and absolute
convergence of alternating series.
[15 H]
UNIT-II

ORDINARY DIFFERENTIAL EQUATIONS & PARTIAL DIFFERENTIATION

Partial Differentiation: Review of basic differentiation, Definition of Partial Differentiation,

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

Differential equations: Ordinary Differential Equation, Exact differential equations,

Variable Separable method to solve ODE .[15 H]

UNIT-III
MULTIPLE INTEGRAL AND VECTOR CALCULUS

Double and Triple Integration: Review of basic of integration, Double and triple
Integration;

Vector Calculus : Scalar and vector fields; differentiation and integration of vectors ; vector
differential operators: del, gradient, divergence, curl , properties; Statement of Gauss, Green
and Stoke's theorem. [15 H]

TEXT BOOKS

Grewal, B.S., Higher Engineering Mathematics, Khanna Publishers, New Delhi, 42th ed.2013

REFERENCE MATERIAL:

1. Kreyszig , E., Advanced Engineering Mathematics, John Wiley,10th Ed.2011.

2. Ray Wylie, C., Advanced Engineering Mathematics, 6th ed., McGraw Hill.

3. Jain, R.K. and lyengar, S.R.K., Advanced Engineering Mathematics, 3rd Edition.

Narosa Publishing House, New Delhi,2004.

4. Ramana , B.V Advanced Engineering Mathematics, McGraw Hill, July 2006.

The Students outcomes are:

l) An ability to apply knowledge of mathematics, and engineering.

m) An ability to design and conduct experiments, as well as to analyze and interpret data.
n) An ability to design a system, component or process to meet desired needs within realistic
constraints such as economic, environmental, social, political, ethical, health and safety,
manufacturability, and sustainability.
o) An ability to function on multidisciplinary teams.
p) An ability to identify, formulates, and solves engineering problems.
q) An understanding of professional and ethical responsibility.
r) An ability to communication effectively.
s) The board education necessary to understand the impact of engineering solutions in global,
economic, environmental, and societal context.
t) Recognition of the need for, and an ability to engage in life-long learning.
u) Knowledge of contemporary issues.
v) An ability to use the techniques skills, and modern engineering tools necessary for
engineering practice

SMY-222 ENGINEERING MATHEMATICS

 Department
Teaching the Department of Mathematics
Subject
Program Outcome a b c d e f g h i j k


Mapping of Course 
outcome with  
Program outcome

BS ES PD PC PE OE Project/Training
Category

Approval Date of meeting of the Board of Studies

Teaching–LearningProcess

Open- Project- LabW Open- Beyondthe

ork
ended type ended curriculum
Teaching aids problem/ activity lab Deliverymode
Video, Online Numerical work Theory/ Numerical/

Ppt. lecture Description Designed

etc 40% problem
60% 10%


Instructionsfor the paper-setter:

Please gothroughthese instructionsthoroughlyandfollowthe same pattern

whilesettingthe paperas the studentshave beenpreparedaccordingtothis format.
 Maximum Marks=60 Time:3 Hours

Weightageperunit=20marks(excluding overattemptweightage)

1.QuestionPaperwillconsistoftenquestions.

2.SectionAof questionpaperiscompulsory, containingfivepartseach of2marks coveringthe whole

syllabus (total10marks)

3.SectionB, C, Dcontains9 questionsin total,3from each UnitI, II, IIIrespectively.

AttemptanyfivequestionsfromSectionB, C, Dtaking at leastonequestionfrom each

sectionbutnotmore thantwo questions fromSection-B, C, D.(Total50 marks).

ENGINEERING
Name of the Subject Subject Code SMY-222
MATHEMATICS

It is certified That syllabus is free from spelling, grammatical or any duplicacy. Course outcomes have
been mapped with Program outcome

S. No. Name Designation Signature

1 Mr. Ravi Kant Asstt. Prof

2 Mr. ParveenTyagi Subject Coordinator

3 Dr. S.S. Chauhan HOD