Department of Computer Science & Engineering

SCHEME
BE CSE
Batch 2017 – 2021

Scheme Applicable to BE CSE Batch 2017 onwards

 Department of Computer Science & Engineering

6th Semester

S.N Subject Subjec Tot

Subject Name L T P S INT EXT Cr.
o Code t Type al
Theory of
1 CST-352 DC 3 0 0 - 40 60 100 3
Computation
Engineering
2 Encapsulation/Technic CSP-356 DC 0 0 2 - 40 60 100 1
al Training
Project Based
3 CST-358 DC 0 2 0 - 40 60 100 2
Learning in Java
Project Based
4 CSP-359 DC 0 0 4 - 60 40 100 2
Learning in Java Lab

5 Professional Elective-I CS*-3** DE 3 0 0 - 40 60 100 3

Professional Elective-I
6 CS*-3** DE 0 0 2 - 60 40 100 1
Lab
Network Operating
7 CST-365 DC 3 0 0 - 40 60 100 3
System
Institute Open
8 CSN-3** IOE 3 0 0 - 40 60 100 3
Elective-I

9 Project CSR-355 PR 0 0 1 5 60 40 100 3

Total 12 2 9 5 21

MNG (For TPP Students)

S.N Subject Subject Tot

Subject Name L T P INT EXT Cr.
o Code Type S al
1 Soft Skills TDY-351 MNG 0 0 2 60 - 40 100 1

2 Aptitude TDY-352 MNG 0 2 0 40 - 60 100 2

Scheme Applicable to BE CSE Batch 2017 onwards

 Department of Computer Science & Engineering

MNG (For Non-TPP Students)

Subject Subject Subject

S.No L T P INT EXT Total Cr.
Name Code Type S
Software CSY-360 -
1 Project MNG 3 0 0 40 60 100 3
Management
TDY-354 3
2 IELTS MNG 0 3 0 - 40 60 100
TDY-355 MNG 3
3 SSC 0 3 0 - 40 60 100
TDY-356 MNG 3
4 GRE 0 3 0 - 40 60 100
TDY-357 MNG 3
5 IAS 0 3 0 - 40 60 100
TDY-358 MNG 3
6 GMAT 0 3 0 - 40 60 100
TDY-359 MNG 3
7 CAT 0 3 0 - 40 60 100
TDY-360 MNG 3
8 GATE 0 3 0 - 40 60 100
TDY-361 MNG 3
9 CDS 0 3 0 - 40 60 100
TDY-362 MNG 3
10 SSB 0 0 6 - 40 60 100

Scheme Applicable to BE CSE Batch 2017 onwards

 Department of Computer Science & Engineering

Professional Electives*
Computational Intelligence
Subject
Subject Name
Code
CSA-361 Soft Computing
Elective I
CSA-362 Soft Computing Lab
CSA-4** Machine Learning
Elective II
CSA-4** Data Analytics
CSA-4** Computer Vision
Elective III
CSA-4** Augmented Reality & Virtual Reality
CSA-4** BlockChain Technology
Elective IV CSA-4** Robotic Process Automation
CSA-4** Devops

Professional Electives*
Cyber Security
Subject
Subject Name
Code
CSB-363 Information Security
Elective I
CSB-364 Information Security Lab
Elective CSB-4** Web Service Security
II CSB-4** Cyber Security
Elective CSB-4** Securing Windows and Linux
III CSB-4** Secured Network Protocols
CSB-4** Cryptography
Elective
CSB-4** Software Defined Networks
IV
CSB-4** Privacy Management

Scheme Applicable to BE CSE Batch 2017 onwards

 Department of Computer Science & Engineering

List of Institute Open Electives

Elective No. Subject Name

I Computer Architecture and Organization

II Data Structure
III Operating System
IV Database Management System
V Computer Network
VI Software Engineering

Scheme Applicable to BE CSE Batch 2017 onwards

 Department of Computer Science & Engineering

CHANDIGARH UNIVERSITY, GHARUAN

Subject Theory of Computation L T P C

Code Total Contact Hours : 45Hours
3 0 0 3
(CST-352) Common to all Specializations of CSE 3rd Year

Prerequisite: Knowing importance of system programs

Marks-100

Internal-40 External-60

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

Classify machines by their power to recognize languages,

I

II Employ finite state machines to solve problems in computing

III Comprehend the hierarchy of problems arising in the computer sciences

UNIT –I

Introduction: Basic Terminology: Alphabet, Formal Language and operations on formal languages,
Examples of formal languages.

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.

Regular expression: Regular Languages and Regular Expressions, Kleen’s Theorem. Arden’s
Method.

Scheme Applicable to BE CSE Batch 2017 onwards

 Department of Computer Science & Engineering

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.

Finite Automata with output: Moore and Mealy Machines. Equivalence of Moore and Mealy
Machines.

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).

UNIT –III

Context sensitive Language: Context sensitive Language and grammar, Relation between
languages of classes

Pushdown Automata: Introduction and Definition of Push-Down Automaton, Applications of Push

Down Automata.

Turing Machines: Definitions and Examples, Deterministic and Non- Deterministic Turing
Machines, Unsolvable Problems: A Non-recursive Language and an Unsolvable Problem, PCP
Problem and MPCP Problem.

More General Languages and Grammars: Recursively Enumerable and Recursive Languages,
Unrestricted grammars, Chomsky hierarchies of grammars.

Text Books:

1. Martin J.C., “Introduction to Languages and Theory of Computation”, Tata McGraw-Hill 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.

Scheme Applicable to BE CSE Batch 2017 onwards

 Department of Computer Science & Engineering

CST-352 Theory of Computation

Department
Department of Computer Science and Engineering
Teaching the Subject

Program Outcome PO PO PO PO PO PO PO PO PO PO PO1 PO

1 2 3 4 5 6 7 8 9 10 1 12
CO1 1 - 1 1 2 - 1 1 1 2 1 1

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

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

TOTAL 5 3 6 4 6 2 5 3 4 4 3 7

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

*Note: The content given in syllabus is 100% matched with the GATE 2020 syllabus

Scheme Applicable to BE CSE Batch 2017 onwards

 Department of Computer Science & Engineering

CHANDIGARH UNIVERSITY, GHARUAN

Network Operating Systems L T P C

Subject
Code Total Contact Hours : 45Hours
3 0 0 3
(CST-365) Common to all Specializations of CSE 3rd Year

Prerequisite: Computer network and operating system

Marks-100

Internal-40 External-60

Course Objectives

Course Objective:

This course is indented for students to experience on the technologies included in the
Network Operating System.

Gain in depth knowledge of windows server 2008

Unit Course Outcomes

 To study data communication concepts.

I
 To understand Logical Address and IP Addressing

 To understand DNS architecture

II  To study Installation and configuration of Netmon.

 To understand Install Active Directory Domains Services in Windows 2008 R2

III
 To study Active Directory Administration concepts

Contents of the Syllabus

UNIT –I [15h]

Introduction of Computer Networks: Reference Model: OSI Reference Model, TCP/IP reference
model, Core protocols of TCP/IP,IP routing,IP routers,Routing Tables.

Scheme Applicable to BE CSE Batch 2017 onwards

 Department of Computer Science & Engineering

Introduction to DNS:DNS Architecture, Understanding the DNS Domain Namespace,DNS domain

name hierarchy, DNS and Internet domains,DNS delegation

Introduction to DHCP: Introduction to DHCP,DHCP Architecture, Benefits to DHCP,DHCP

Terminologies and DHCP Server Responsibility.

Introduction to RPC: Introduction to RPC, RPC Dependencies and Interaction,RPC

Architecture,RPC Component and RPC Processes and Interaction.

Introduction to Microsoft Network Monitoring Tool: Introduction to netmon tool, Installation and
configuration of Netmon.

Unit-II [15h]

Introduction to operating System:Introduction to operating system,Types of operating

System:Mainframe,Desktop,Multiprocessor,Distributed,Clustered,Multiprogramming,Real
time,Embedded and Time Sharing

Operating System Components: Process Management Component, Memory Management

component,i/o Management component,File Management component,Protection System,and
Networking management component.

Comparison of Microsoft OS (Desktop, Server and Client), Hardware Requirement for

OS(Desktop,Server and client ),Workgroups and Domains.

Installing windows server 2008: Plan for a server roles and installing windows server core,configure
server core,Add and configure server roles,add backup feature and migrate roles from previous
versions of windows server.

Configuring Windows Server 2008: Windows server registry,Control Panel,Delegate

administration,Add and removes feature in window server, intial configuration taskes, server
manager console,server manager wizards and windows power shell.

Unit-III [15h]

Hyper-V: Introducing Hyper-V, Virtual Machines

Introducing to Active Directory:role of an AD DS Server,features in AD DS,Common

Terminologies and Active Directory Concepts,Active Directory Schema,Active Directory
Objects,Active Directory Concepts,Active Directory Data structure and storage architecture,Active
Directory Structure and storage components,DNS support for active directory,active directory DNS
support components

Scheme Applicable to BE CSE Batch 2017 onwards

 Department of Computer Science & Engineering

Install Active Directory Domains Services in Windows 2008 R2: Installing a new forest by using the
graphical user interface (GUI), Understanding active directory domain.Servicex functional Levels.

Active Directory Administration: Active Directory Users and Computers.Managing organizational

units using Active Directory Users and Computers, Managing Trusts using Active directory domains
and trusts and managing forest trusts using active directory domains and trusts snap-in.

Text Books:

1. Data communication &Networking, Frozen Tata McGraw Hill Publication computer

2. Data & computer communications, stalling PHI new Delhi
Reference Books:
1. Capture Netwotk traffic---http://support.microsoft.com/kb/812953
2. About Network Monitor---http://support.microsoft.com/kb/294818
3. Traces--http://support.microsoft.com/kb/169292

Subject Code

(CST-365) Network Operating Systems

Department Teaching
Department of Computer Science and Engineering
the Subject

PO-CO mapping PO PO
PO3 PO4
PO
PO6 PO7
PO PO PO1 PO1 PO1
1 2 5 8 9 0 1 2
CO1 3 1 1 1 2 1 1 1 1 1 1 2

CO2 1 2 2 1 1 1 1 1 1 1 1 2

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

BS ES PD PC PE OE Project

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

Scheme Applicable to BE CSE Batch 2017 onwards

 Department of Computer Science & Engineering

Chandigarh University, Gharuan

SOFT COMPUTING L T P C

Subject Code Total Contact Hours : 45Hours

CSA-361 3 0 0 3
Prerequisite:
Knowledge of basic concepts of Fuzzy logic
and genetic algorithms

Marks-100

Internal-40 External-60

Course Objectives

To understand soft computing concepts , techniques and Fuzzy System

To study the concepts of neural networks

To understand GA and Particle Swarm Optimization Technique

Unit Course Outcome

I Get the knowledge of Basics of Soft Computing and Fuzzy Logic

II To analyze various ANN architectures

Understand the Genetic Algorithms and basic concept of Swarm intelligence.

III Understand hybrid nature of Soft Computing techniques to real world problems by
extending the capabilities of existing technologies in more effective and efficient
manner

UNIT-I

Introduction to Soft Computing, Soft Computing vs. Hard Computing, Characteristics of soft
Computing.
Introduction to Fuzzy Logic, Fuzzy Sets and Membership functions, Operations on Fuzzy sets ,
Fuzzy Relations, Rules, Propositions Implications and Inferences, Defuzzification Techniques:
Lambda-cut method, weighted average method, Maxima method, Centroid method.

Scheme Applicable to BE CSE Batch 2017 onwards

 Department of Computer Science & Engineering

UNIT-II

Artificial Neural Network Introduction, Fundamental concept, Biological neuron and its working,
Evolution of Neural Networks, Basic Models of Artificial Neural Networks, Important
Terminologies of ANNs, Activation Functions, Architecture: Single layer feed forward architecture,
Multilayer feed forward architecture, McCulloch-Pitts Neuron, Supervised Learning vs.
Unsupervised Learning, Supervised Learning Networks: Back-Propagation Network, Unsupervised
Learning Networks: Hebb Network.

Associative Memory Networks: Training Algorithms for Pattern Association, Autoassociative

Memory Network, Heteroassociative Memory Network, Hopfield Networks, Iterative
Autoassociative Memory Networks, Temporal Associative Memory Network.

UNIT-III

Genetic Algorithm: Introduction, Terminologies in Gas, Traditional Algorithm vs. Genetic

Algorithm, Simple GA, General Genetic Algorithm, Basic GA framework and different GA
architectures, GA Operators: Encoding, Crossover, Selection, Mutation. Particle Swarm
optimization.

Case Study: To implement FIS Editor. Use Fuzzy toolbox to model tip value that is given after a
dinner based on quality answers.

Text Books:
1. S.N. Shivanandam, Principle of soft computing, Wiley. ISBN13: 9788126527410 (2011)
2. Jyh-Shing Roger Jang, Chuen-Tsai Sun, Eiji Mizutani, “Neuro-Fuzzy and Soft Computing”,
PrenticeHall of India, 2003.
3. George J. Klir and Bo Yuan, “Fuzzy Sets and Fuzzy Logic-Theory and Applications”, Prentice Hall,
1995.
Reference Material
4. James A. Freeman and David M. Skapura, “Neural Networks Algorithms, Applications, and
Programming Techniques”, Pearson Edn., 2003.
5. Mitchell Melanie, “An Introduction to Genetic Algorithm”, Prentice Hall, 1998.
6. David E. Goldberg, Genetic Algorithms in Search, Optimization & Machine Learning, Addison
Wesley, 1997.

Instructions for the paper-setter

Scheme Applicable to BE CSE Batch 2017 onwards

 Department of Computer Science & Engineering

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.

PO- PO PO PO PO PO PO PO PO PO PO1 PO1 PO1

Subject CO 1 2 3 4 5 6 7 8 9 0 1 2
Soft CO1 3 1 1 2 3 2 2 1 1 1 1 3
CSA
Computin CO2 2 2 2 2 2 3 1 1 2 1 1 2
-361
g CO3 1 2 1 1 2 2 2 1 2 1 1 2
TOTA
L 6 5 4 5 7 7 5 3 5 3 3 7

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

Scheme Applicable to BE CSE Batch 2017 onwards

 Department of Computer Science & Engineering

Chandigarh University, Gharuan

Soft Computing Lab L T P C

Subject Code Total Contact Hours : 30Hours 0 0 2 1

CSA-362
Prerequisite:
Knowledge of basic computer science principles and skills, at a level sufficient
to write a reasonably non-trivial computer program.
Marks-100

Internal-60 External-40

Course Objectives

To formulate machine learning problems corresponding to different applications.

To understand a range of machine learning algorithms along with their strengths and
weaknesses.
To understand the basic theory underlying machine learning.
To apply machine learning algorithms to solve problems of moderate complexity.

Unit Course Outcome

I  To introduce students to the basic concepts and techniques of soft computing and
fuzzy set theory
II  To develop concepts of ANN.

III  To gain info about genetic theory

List of Experiments

UNIT-I

1. To perform Union, Intersection and Complement operations.

2. To implement De-Morgan’s Law.

UNIT-II

3. Generate ANDNOT function using McCulloch-Pitts neural net.

4. Generate XOR function using McCulloch-Pitts neural net.

Scheme Applicable to BE CSE Batch 2017 onwards

 Department of Computer Science & Engineering

5. Hebb Net to classify two dimensional input patterns in bipolar with given targets.

6. Perceptron net for an AND function with bipolar inputs and targets.

7. To calculate the weights for given patterns using hetero-associative neural net.

8. To store vector in an auto-associative net. Find weight matrix & test the net with input

9. To store the vector, find the weight matrix with no self-connection. Test this using a discrete
Hopfield net.

UNIT-III

10. To plot various membership functions.

Course Code- CSA-362 Soft Computing Lab

Department Teaching
Department of Computer Science and Engineering
the 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

Scheme Applicable to BE CSE Batch 2017 onwards

 Department of Computer Science & Engineering

Subject Introduction to Information Security L T P C

Code Total Contact Hours : 45Hours
3 0 0 3
CSB-363 th
Common to all Specializations of CSE is 4 Year

Prerequisite: Studied computer networks

Marks-100

Internal-40 External-60

Course Objectives

To familiarize the students with the basic concepts of services, attacks with its models and
concepts of encryption.
To conceptualize digital signature and different encryption algorithm.
To state the various authentication protocols and their requirements.
To elucidate an applications of security and their effects on security standards.
To comprehend IP security and their methods.
Unit
After studying this subject, the students will be able to:
Conceptualize the various forms of attacks, execute cipher models, and solve the
I problem based on different security models and encryption. Also, the students will be
able to apply number theory and encryption algorithms.
Apply authentication protocols that are used to develop digital signatures and perform
II
authentication for software security standards.
III Implement IP security with SSL and TLS.

UNIT-I

Introduction & Number Theory: Services, Mechanisms and attacks-the OSI security architecture-Network
security model-Classical Encryption techniques (Symmetric cipher model, substitution techniques,
transposition techniques, steganography).FINITE FIELDS AND NUMBER THEORY: Groups, Rings,
Fields-Modular arithmetic-Euclid‟s algorithm-Finite fields- Polynomial Arithmetic –Prime numbers-
Fermat‟s and Euler‟s theorem-Testing for primality -The Chinese remainder theorem- Discrete alogarithms.

Block Ciphers : Data Encryption Standard-Block cipher principles-block cipher modes of operation-
Advanced Encryption Standard (AES)-Triple DES-Blowfish-RC5 algorithm.

Scheme Applicable to BE CSE Batch 2017 onwards

 Department of Computer Science & Engineering

UNIT II

Public key cryptography: Principles of public key cryptosystems-The RSA algorithm-Key management –
Diffie Hellman Key exchange

Hash Functions And Digital Signatures: Authentication requirement – Authentication function – MAC –
Hash function – Security of hash function and MAC – MD5–SHA512–HMAC – CMAC – Digital signature
and authentication protocols – DSS – EI Gamal – Schnorr.

UNIT III

Security Practice & System Security: Authentication applications – Kerberos – Authentication services –
Internet Firewalls for Trusted System: Roles of Firewalls – Firewall related terminology- Types of Firewalls –
Firewall designs –Intruder – Intrusion detection system – Virus and related threats.

E-mail Security: Security Services for E-mail-attacks possible through E-mail – establishing keys privacy-
authentication of the source-Message Integrity-Non-repudiation-Pretty Good Privacy-S/MIME.

IPSecurity and Web Security: Overview of IPsec – IP and IPv6-Authentication Header-Encapsulation

Security Payload (ESP)- SSL Architecture and its layers.

Text Books:

1. William Stallings, Cryptography and Network Security, 6th Edition, Pearson Education, March
2013.
2. Charlie Kaufman, Radia Perlman and Mike Speciner, “Network Security”, Prentice Hall of India,
2002.

Reference Books:
1. Behrouz A. Ferouzan, “Cryptography & Network Security”, Tata McGraw Hill.
2. Man Young Rhee, “Internet Security: Cryptographic Principles”, “Algorithms and Protocols”,
Wiley Publications.
3. Charles Pfleeger, “Security in Computing”, 4th Edition, Prentice Hall of India.
4. Ulysess Black, “Internet Security Protocols”, Pearson Education Asia.
5. Charlie Kaufman and Radia Perlman, Mike Speciner, “Network Security, Second Edition, Private
Communication in Public World”, PHI.

Scheme Applicable to BE CSE Batch 2017 onwards

 Department of Computer Science & Engineering

CHANDIGARH UNIVERSITY, GHARUAN

Information Security Lab L T P C

Subject Code
Total Contact Hours : 10 Hours
(CSB-364) 0 0 2 0
CSE 3rd Year

Prerequisite: Studied Encryption Techniques

Marks-100

Internal-60 External-40

Course Objectives

To generate encrypted text using different techniques.

To understand the cipher-text in order to provide more security to data.
To understand the concepts of Digital Signature and its implementation.

Unit Course Outcomes

Ability to implement the concepts of Encryption techniques using C,C++ and

I Java

Able to implement the concepts of cipher text using various algorithms

II

Ability to create digital signatures

III

List of Experiments

UNIT-I

1. Perform the practical of Caesar Cipher.

2. Perform the practical of Substitution cipher.

3. Perform the practical of Hill Cipher.

4. Perform the practical of Playfair algorithm

UNIT-II

Scheme Applicable to BE CSE Batch 2017 onwards

 Department of Computer Science & Engineering

5. Perform the practical of Diffie hellman key exchange algorithm.

6. Perform the practical of RSA algorithm.

7. Perform the practical of MD5

UNIT-III

8. Perform the practical of SHA1.

9. Perform the practical to generate digital certificate.

10. Perform the practical of digital signature on text.

Scheme Applicable to BE CSE Batch 2017 onwards

 Department of Computer Science & Engineering

CHANDIGARH UNIVERSITY, GHARUAN

Subject Project Based Learning in JAVA L T P C

Code Total Contact Hours : 30Hours

0 2 0 2
(CST-358) rd
Common to all Specializations of CSE 3 Year

Prerequisite: Knowing Programming Language Java

Marks-100

Internal-40 External-60

Course Objectives

 Programming in the Java programming language.

 Knowledge of object-oriented paradigm in the Java programming language.

 The use of Java in a variety of technologies and on different platforms.

 Understand the server side programming.

Unit Course Outcomes

I  To gain knowledge of the structure and use the Java programming language for
various technologies
II  Annotations and Databases usage in project development

III  Web Based Java Application Development

Unit-I

Scheme Applicable to BE CSE Batch 2017 onwards

 Department of Computer Science & Engineering

Java Fundamentals: Introduction to Java. Difference between C++ and Java.Keywords, Tokens, Data
types. Use of public, private and protected.

OOPS using Java: Use of class and method in Java. Inheritance, Abstraction, Polymorphism,
Encapsulation and data privacy. Difference between method overloading and method overriding.

Exception Handing: Introduction to Exceptions. Difference between error and exception. Use of try,
catch and throw. Difference between throw and throws. Types of Exceptions, Exception handling in
Java.

Unit-II

Collection Framework: Use of Collections in Java. ArrayList, LinkedList, HashMap, TreeMap,

HashSet in Java.. Multithreading in Java. Thread Synchronization. Thread Priority, Thread
LifeCycle.

Wrapper Classes, I/O Streams and Annotations: Use of wrapper classes in Java- Integer, Character,
Long, Boolean. Autoboxing and Unboxing. Byte stream, Character stream, Object serialization,
cloning. System defined annotations, Custom annotations, application of annotations, Testing using
JUnit.

JDBC: Database connectivity, Types of Drivers for connection, Connection Example. CRUD
operations using Database, Configuring various types of drivers for Java Database Connectivity,
MVC Model for project development, Sequence, Dual table , Date type management in Java.

Unit-III

Servlets and JSP: Servlet Lifecycle, Generic Servlet, Http Servlet, Linking Servlet to HTML,
HttpServlet Request and Response, Servlet with JDBC, Configuring project using servlet, Servlet
Config and Servlet Mapping JSP declaration, JSP directives, JSP Scriptlets, JSP include tag, JSP
page tag, JSTL.

XML and Web Services: Structure of XML, Elements of XML 1.0, 2.0, DTDs, XML parser, DOM
parser, Web services using REST and HTTP, Creating webservices for database access via remote
servers

Scheme Applicable to BE CSE Batch 2017 onwards

 Department of Computer Science & Engineering

Text books:

1. Herbert Schildt, Java : The Complete Reference, 9th Edition, Oracle Press.

2. Gary Cornell, Core Java Volume II Advanced Features, 8th Edition, Pearson Education.

3. Jim Keogh, J2ee : Complete Reference, 1st Edition, Tata McGraw Hill.

Reference books:

1. James Gosling, Ken Arnold and David Holmes, Java Programming Langauge, 5th Edition, Pearson
Education.
2. Gary Cornell, Core Java Volume I, 3rd Edition, Pearson Education.
Project Based Learning in Java
CST-358
Department Teaching
Department of CSE
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.

Scheme Applicable to BE CSE Batch 2017 onwards

 Department of Computer Science & Engineering

Maximum Marks = 60 Time: 3 Hrs

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

CHANDIGARH UNIVERSITY, GHARUAN

Project Based Learning in Java Lab L T P C

Subject Code
Total Contact Hours : 60 Hours
(CSP-359) 0 0 4 2
Common to all Specializations of CSE 3rd Year

Prerequisite: Studied Programming Language

Marks-100

Internal-60 External-40

Course Objectives

To generate analytical and conceptual ability related to fundamentals of Java.

To understand the concepts of Web application development.
To understand the concepts of Fundamentals of I/O , Database Connectivity.

Unit Course Outcomes

Ability to implement the concepts of Core Java

I
Implement of the OOPS concepts using Eclipse Environment
Able to implement the concepts of Collections and able to access database through
II
Java program, using Java Data Base Connectivity (JDBC)
III Ability to create dynamic web pages, using Servlets and JSP

List of Experiments

UNIT-I

1. Create a application to save the employee information using arrays.

2. Design and implement a simple inventory control system for a small video rental store.
3. Create a application to calculate interest for FDs, RDs based on certain conditions using
inheritance.

Scheme Applicable to BE CSE Batch 2017 onwards

 Department of Computer Science & Engineering

UNIT-II

4. Create a program to set view of Keys from Java Hash table.

5. Create a program to show the usage of Sets of Collection interface.
6. Write a Program to perform the basic operations like insert, delete, display and search in list.
List contains String object items where these operations are to be performed.
7. Create a menu based Java application with the following options.1.Add an
Employee2.Display All3.Exit If option 1 is selected, the application should gather details of
the employee like employee name, employee id, designation and salary and store it in a file.
If option 2 is selected, the application should display all the employee details. If option 3 is
selected the application should exit.

UNIT-III

8. Create a palindrome creator application for making a longest possible palindrome out of
given input string.

9. Create a Servlet/ application with a facility to print any message on web browser.

10. Create JSP application for addition, multiplication and division.

CSP-359 Project Based Learning in Java Lab

Department Teaching
Department of CSE
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

Scheme Applicable to BE CSE Batch 2017 onwards

 Department of Computer Science & Engineering

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

Chandigarh University, Gharuan

SOFTWARE PROJECT
L T P C
Subject Code MANAGEMENT

CSY-360 Total Contact Hours : 45Hours

Common to all Specializations of CSE 3rd 3 0 0 3

Year

Marks-100

Internal-40 External-60

Course Objectives

Introduces the concepts and methods required for the construction of large software systems.
Gain knowledge on the principles and techniques of software project management.
Provides an understanding of both theoretical and methodological issues involved in software
engineering project management.
Course Outcomes

To implement modelling, communication, construction and deployment practices in

I. software development.
II. To estimate project costs and perform cost-benefit evaluation among projects.
III. To apply schedule and cost control techniques for project monitoring.

UNIT-I

SOFTWARE PROJECT EVALUATION AND PROJECT PLANNING -Importance of Software

Project Management, Activities Methodologies, Categorization of Software Projects, Setting
objectives, Management Principles, Management Control , Project portfolio Management, Cost-
benefit evaluation technology ,Risk evaluation, Strategic program Management, Stepwise Project
Planning, Software process and Process Models, Choice of Process models, mental delivery, Rapid

Scheme Applicable to BE CSE Batch 2017 onwards

 Department of Computer Science & Engineering

Application development, Agile methods, Extreme Programming, SCRUM, Managing interactive

processes.

UNIT-II

SOFTWARE PROJECT LIFE CYCLE AND EFFORT ESTIMATION -– Basics of Software

estimation ,Effort and Cost estimation techniques, COSMIC Full function points, COCOMO II A
Parametric Productivity Model, Staffing Pattern, Objectives of Activity planning, Project schedules,
Activities, Sequencing and scheduling , Network Planning models, Forward Pass & Backward Pass
techniques, Critical path (CRM) method, Risk identification, Assessment, Monitoring, PERT
technique , Monte Carlo simulation, Resource Allocation , Creation of critical patterns, Cost
schedules.

UNIT-III

SOFTWARE PROJECT MANAGEMENT AND CONTROL - Framework for Management and

control, Collection of data Project termination, Visualizing progress, Cost monitoring, Earned Value
Analysis, Project tracking, Change control, Software Configuration Management, Managing
contracts, Contract Management ,Staffing, Managing people, Organizational behavior, Best methods
of staff selection, Motivation, The Oldham-Hackman job characteristic model, Ethical and
Programmed concerns, Working in teams, Decision making ,Team structures, Virtual teams,
Communications genres, Communication plans.

TEXT BOOK:

1. Bob Hughes, Mike Cotterell and Rajib Mall: Software Project Management – Fifth Edition, Tata McGraw
Hill, New Delhi, 2012.

REFERENCES:

1. Robert K. Wysocki “Effective Software Project Management” – Wiley Publication,2011.

2. Walker Royce: “Software Project Management”- Addison-Wesley, 1998.

3. Gopalaswamy Ramesh, “Managing Global Software Projects” – McGraw Hill Education (India),
Fourteenth Reprint 2013.

CSY-360 SOFTWARE PROJECT MANAGEMENT

Department Teaching
Department of Computer Science and Engineering
the Subject

Scheme Applicable to BE CSE Batch 2017 onwards

 Department of Computer Science & Engineering

PO PO PO PO PO1 PO1
Program Outcome PO1 PO2 PO3 PO6 PO7 PO12
4 5 8 9 0 1

CO1 3 3 1 3 1 3 3 2 3 1 2 3
Mapping of CO2 3 1 3 2 1 2 3 2 1 1 1 3
Course outcome
with Program
outcome CO3 2 2 3 2 3 3 2 3 2 2 3 2

Total 8 6 6 7 5 8 8 7 6 4 6 8

MNG
Category

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

Scheme Applicable to BE CSE Batch 2017 onwards

 Department of Computer Science & Engineering

Chandigarh University, Gharuan

Computer Organization and

L T P C
Subject Code Architecture

CSN-351 Total Contact Hours : 45Hours

3 0 0 3
Institute open elective

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

Familiarization with the theory and architecture of central processing unit along with
I understanding of instruction set. Also to interpret the architecture and functionality of
central processing unit.
Analyze different processor architectures and exemplify in a better way memory and
II input/output mechanisms

Learn the concepts of parallel processing, pipelining and interprocessor communication.

III Also to analyze the working of multiprocessor

Scheme Applicable to BE CSE Batch 2017 onwards

 Department of Computer Science & Engineering

Contents of the Syllabus

UNIT-I

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

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, IOP
UNIT-III

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.

Scheme Applicable to BE CSE Batch 2017 onwards

 Department of Computer Science & Engineering

Course
Code-
Computer Organization and Architecture
CSN-351

Departmen
t Teaching Department of Computer Science and Engineering
the Subject

P P011 PO12
Program PO PO PO PO PO PO PO1
PO4 O PO7
Outcome 1 2 3 6 8 9 0
5
CO1 3 1 1 1 2 1 2 1 1 1 1 1

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

CO3 2 1 1 2 1 1 2 1 1 1 1 1

Project/Trainin
BS ES PD PC PE OE IOE
Category g

Approval Date of meeting of the Board of Studies

Instructions for the paper-setter

Scheme Applicable to BE CSE Batch 2017 onwards

 Department of Computer Science & Engineering

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.

Engineering Encapsulation/Technical
L T P C
Subject Code Training

CSP-356 Total Contact Hours :30Hours

0 0 2 1

Marks-100

Internal-60 External-40

Course Objectives

Problems to be solved for Technical Training using on-line platforms

Topic Subdomain Task

Name
Data https://www.hackerrank.com/challenges/arrays-ds/problem
Structures
https://www.hackerrank.com/challenges/2d-array/problem
https://www.hackerrank.com/challenges/dynamic-array/problem
https://www.hackerrank.com/challenges/array-left-rotation/problem
https://www.hackerearth.com/fr/practice/data-structures/arrays/multi-
dimensional/practice-problems/algorithm/add-alternate-elements-of-

Scheme Applicable to BE CSE Batch 2017 onwards

 Department of Computer Science & Engineering

2-dimensional-array/

https://www.hackerrank.com/challenges/equal-stacks/problem
https://www.hackerrank.com/challenges/maximum-element/problem
Arrays,
Stacks & https://www.hackerearth.com/fr/practice/data-
Queues structures/queues/basics-of-queues/practice-problems/algorithm/disk-
tower-b7cc7a50/
https://www.hackerrank.com/challenges/queue-using-two-
stacks/problem
https://www.hackerrank.com/challenges/print-the-elements-of-a-
linked-list/problem
https://www.hackerrank.com/challenges/insert-a-node-at-the-tail-of-
a-linked-list/problem
https://www.hackerrank.com/challenges/compare-two-linked-
lists/problem
https://www.hackerrank.com/challenges/reverse-a-linked-list/problem
https://www.hackerrank.com/challenges/insert-a-node-into-a-sorted-
Linked List doubly-linked-list/problem
https://www.hackerrank.com/challenges/reverse-a-doubly-linked-
list/problem
https://www.hackerrank.com/challenges/insertionsort1/problem
https://www.hackerrank.com/challenges/insertionsort2/problem
https://www.hackerrank.com/challenges/quicksort1/problem
https://www.hackerearth.com/practice/algorithms/sorting/bubble-
sort/practice-problems/algorithm/min-max-difference/
https://www.hackerearth.com/practice/algorithms/sorting/selection-
sort/practice-problems/algorithm/old-keypad-in-a-foreign-land-24/
https://www.hackerearth.com/practice/algorithms/searching/linear-
search/practice-problems/
https://www.hackerearth.com/practice/algorithms/searching/binary-
Sorting & search/practice-problems/
Searching
https://www.hackerrank.com/challenges/countingsort1/problem
https://www.hackerrank.com/challenges/countingsort2/problem
Graphs https://www.hackerrank.com/challenges/bfsshortreach/problem
https://www.hackerearth.com/practice/algorithms/graphs/breadth-
first-search/practice-problems/algorithm/monk-and-the-islands/
https://www.hackerearth.com/practice/algorithms/graphs/depth-first-
search/practice-problems/algorithm/anupam-graph/

Scheme Applicable to BE CSE Batch 2017 onwards

 Department of Computer Science & Engineering

https://www.hackerrank.com/challenges/kruskalmstrsub/problem
https://www.hackerrank.com/challenges/primsmstsub/problem
https://www.hackerrank.com/challenges/dijkstrashortreach/problem
https://www.hackerrank.com/challenges/minimum-mst-
graph/problem
https://www.hackerrank.com/challenges/clique/problem
https://www.hackerrank.com/challenges/crab-graphs/problem
https://www.hackerrank.com/challenges/the-quickest-way-
up/problem
https://www.hackerrank.com/challenges/tree-preorder-
traversal/problem
https://www.hackerrank.com/challenges/tree-postorder-
traversal/problem
https://www.hackerrank.com/challenges/tree-inorder-
traversal/problem
https://www.hackerrank.com/challenges/tree-height-of-a-binary-
tree/problem
https://www.hackerrank.com/challenges/tree-level-order-
traversal/problem
Trees
https://www.hackerrank.com/challenges/binary-search-tree-
insertion/problem
https://www.hackerrank.com/challenges/binary-search-tree-lowest-
common-ancestor/problem
https://www.hackerrank.com/challenges/self-balancing-tree/problem
https://www.hackerrank.com/contests/hourrank-
19/challenges/maximal-tree-diameter/problem
https://www.hackerrank.com/contests/101hack33/challenges/longest-
path
Algorithms https://www.hackerearth.com/practice/algorithms/string-
algorithm/string-searching/practice-problems/algorithm/string-4-
d1093b86/
https://www.hackerearth.com/practice/algorithms/string-
algorithm/string-searching/practice-problems/algorithm/palindrome-
String string-22/
Algorithms
https://www.hackerearth.com/practice/algorithms/string-
algorithm/basics-of-string-manipulation/practice-
problems/algorithm/palindrome-124/
https://www.hackerearth.com/practice/algorithms/string-
algorithm/basics-of-string-manipulation/practice-
problems/algorithm/conversion-11/
https://www.hackerearth.com/practice/algorithms/string-
Scheme Applicable to BE CSE Batch 2017 onwards
 Department of Computer Science & Engineering

algorithm/basics-of-string-manipulation/practice-
problems/algorithm/print-first-occurence/
https://www.hackerrank.com/challenges/camelcase/problem
https://www.hackerrank.com/challenges/strong-password/problem
https://www.hackerrank.com/challenges/dynamic-programming-
classics-the-longest-common-subsequence/problem
https://www.hackerrank.com/challenges/unbounded-
knapsack/problem
https://www.hackerrank.com/challenges/longest-increasing-
subsequent/problem
https://www.hackerrank.com/challenges/travel-around-the-
world/problem
https://www.hackerrank.com/challenges/extremum-
permutations/problem
Dynamic
Programming https://www.hackerrank.com/challenges/coin-change/problem
https://www.hackerearth.com/practice/algorithms/dynamic-
programming/introduction-to-dynamic-programming-1/practice-
problems/algorithm/win-the-game/
https://www.hackerrank.com/challenges/sherlock-and-cost/problem
https://www.hackerrank.com/contests/srin-aadc03/challenges/classic-
01-knapsack
https://www.hackerrank.com/contests/bitsg-ai-lab-
Branch and 2/challenges/travelling-salesman-problem
Bound
https://www.hackerrank.com/challenges/assignment/problem
https://www.hackerearth.com/practice/basic-
programming/recursion/recursion-and-backtracking/practice-
problems/algorithm/n-queensrecursion-tutorial/
https://www.hackerrank.com/challenges/subset-sum/problem
https://www.hackerrank.com/challenges/queens-on-board/problem
https://www.hackerearth.com/practice/basic-
programming/recursion/recursion-and-backtracking/practice-
Backtracking problems/algorithm/biggest-forest-700592dd/
https://www.hackerearth.com/practice/basic-
programming/recursion/recursion-and-backtracking/practice-
problems/algorithm/simran-and-stairs/
https://www.hackerearth.com/practice/basic-
programming/recursion/recursion-and-backtracking/practice-
problems/algorithm/a-tryst-with-chess/
https://www.hackerearth.com/practice/basic-
programming/recursion/recursion-and-backtracking/practice-
problems/algorithm/hack-the-money/

Scheme Applicable to BE CSE Batch 2017 onwards

 Department of Computer Science & Engineering

Scheme Applicable to BE CSE Batch 2017 onwards