Documente Academic
Documente Profesional
Documente Cultură
&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
UNIT- I
UNIT-II
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
Marks-100
Internal-40 External-60
Course Objectives
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]
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.
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
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.
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.
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.
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”.
Subjectoutcome
Subject a b c d e f g h i j k
Outcome
Subject √ √
mapping √
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
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
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
design and employ appropriate data structures for solving computing problems
II.
possess the knowledge of various existing algorithms
UNIT-I [15h]
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]
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
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.
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.
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
Marks-100
Internal-40 External-60
Course Objectives
Unit-I [15h]
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.
Software design: Design process and concepts, Effective Modular design, the design model,
Design documentation, Approaches to Software design.
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.
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
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.
Weight age per unit = 20 marks (excluding over attempt weight age)
Marks-100
Internal-60 External-40
Course Objectives
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
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++.
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.
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
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.
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
UNIT-II
10. Write a program to insert values in a table at run time using JDBC.
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
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
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:
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.
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
Weightageperunit=20marks(excluding overattemptweightage)
1.QuestionPaperwillconsistoftenquestions.
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