Department of Computer Science and Engineering

Syllabus

(2016 Batch)

CSE and LEET

 BATCH 2016 B.E. CSE
4th SEMESTER/2nd year

Hours Per
Marks
SUBJECT Week Credi
S.NO SUBJECT NAME
CODE Tota ts
L T P INT EXT
l
1 TDP-251 Soft Skills 2 0 0 1 60 40 100 0.5

2 CST-253 Discrete Mathematics 3 1 0 40 60 100 3.5

Micro Processors &
3 CST-255 3 0 0 40 60 100 3
Interfacing
Relational Database
4 CST-256 3 0 0 40 60 100 3
Management Systems
Micro Processors &
5 CSP-257 0 0 2 60 40 100 1
Interfacing Lab
Relational Database
6 CSP-259 0 0 4 60 40 100 2
Management Systems Lab
7 CSR-260 Project 0 0 1 60 40 100 2

8 CSP-261 Programming Practice 0 0 2 60 40 100 1

9 CST-267 Python Programming 3 1 0 40 60 100 3.5

10 CSP-268 Python Programming Lab 0 0 3 60 40 100 1.5

Total 12 2 13 21
Mandatory Non-Graded Courses:

Hours Per
Marks
Week
S.NO SUBJECT CODE SUBJECT NAME Credits
IN EX Tota
L T P
T T l
1 System Programming
CSY-269 4 0 0 40 60 100 4
 CHANDIGARH UNIVERSITY, GHARUAN

Name of the subject : SOFT SKILLS 2 L T P C

Total Contact Hours : 24
Subject Code 0 0 2 1
Applicable to which branch
TDP 251
Prerequisite: Soft Skills 1

Marks
Internal 60 External 40
Course Objective
To Impart soft skills practical knowledge to prepare the students for placements and make them industry
ready.
Unit Course Outcome
To enhance the team management and effective decision making skills of the students.
1.

To build a positive attitude among students and enhance their personal grooming to suit the
2. corporate standards

To improve the telephonic etiquettes of students and build their negotiation skills. To help them
3. choose the right career and prepare accordingly.

Content of the Syllabus

Unit-I

LECTURE TUTORIAL
NO. TOPIC ACTIVITY S.NO ACTIVITY NAME
Discussion, videos and
1 Lateral thinking & Mind mapping 1 mind mapping game
Role plays : Application
2 Decision making & Problem solving 2 and simulation games
case study discussion &
3 Team building 3 Team games
Group presentations and
4 Effective Communication skills 4 Role Plays

Unit-II

5 Attitude/positive attitude 5 SWOT Analysis & self

 assessment questionnaire
6 Grooming & Dress code 6 Videos and discussion
Discussion and case
7 Induction to work culture 7
study
Brainstorming and
8 Brainstorming 8 creating groups for idea
generation

Unit-III

Discussion & videos,

9 Telephone and e-mail etiquette 9 typing professional emails
10 Career guidance 10 Discussion and feed back
11 The art of negotiation 11 Role play
case studies, Discussion
12 Body Language basics 12 and Videos

Text Books & Reference Material –

1. Dale Carnegie How to Win Friends and Influence People 1995 Levine & Crom

2. Stephen R. Covey The 7 Habits of Highly Effective People: Powerful Lessons in Personal
Change 2004

3. Simon & Schuster UK Ltd. 222 Gray’s Inn Road London

Course Code TDP 251 Soft Skill 2

Department Teaching
Training Department
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
The student’s outcomes are:
 An ability to apply to apply knowledge of mathematics and engineering.
 An ability to design and conduct experiments, as well as to analyze and interpret data.
 An ability to design a system, component or process to meet desired needs without
realistic constraints such as economic, environmental, social, political, ethical, health &
safety, manufacturability and sustainability.
 An ability to function on multidisciplinary teams.
 An ability to identify formulates and solves engineering problems.
 An understanding of professional and ethical responsibility.
 An ability to communication effectively.
 The board education necessary to understand the impact of engineering solutions in
global, economic, environmental and societal context.
 Recognition of the need for, and an ability to engage in life-long learning.
 Knowledge of contemporary issues.
 An ability to use the techniques skills, and modern engineering tools necessary for
engineering practice.
 Chandigarh University, Gharuan

Discrete Mathematics L T P C
Subject Code Total Contact Hours : 45Hours
CST-253 Common to all Specializations of CSE 2nd 3 1 0 3.5
Year

Marks-100

Internal-40 External-60

Course Objectives

 Identify and apply basic concepts of set theory, arithmetic, logic, proof techniques, binary
relations, graphs and trees
 Apply the knowledge and skills obtained to investigate and solve a variety of discrete
mathematical problems

Unit Course Outcome

some fundamental mathematical concepts and terminology;

I.
how to use and analyze recursive definitions;
II. how to count some different types of discrete structures;
Techniques for constructing mathematical proofs, illustrated by discrete
III.
mathematics examples.

Contents of the Syllabus

UNIT-I [15h]

Set Theory: Introduction to set theory, set operations, algebra of sets, combination of sets,
duality, finite and infinite sets, classes of sets, power sets, multi sets, Cartesian product

Relations and functions: Binary relations, types of relations, equivalence relations and
partitions, partial order relations, mathematical induction, principles of inclusion & exclusion,
functions and its types, composition of function and relations, inverse relations and functions
pigeonhole principle.
Propositional calculus: Basic operations: AND (˄) OR (˅), NOT (-) Truth value of a compound
statements, propositions, tautologies, contradictions.
UNIT-II [15h]
Recursion and recurrence relations: Sequence, partial fractions linear recurrence relations with
constant coefficients, homogeneous and particular solutions, solutions of recurrence relation
using generating functions.
Algebraic structures: Definition, elementary properties of algebraic structures, semigroup
monoid, group, homomorphism, isomorphism and automorpbism, congruence relations,
subgroups, normal subgroups, cosets, Lagrange's theorem, cyclic groups, rings, integral domains
and fields.

UNIT-III [15h]

Combinatorial Mathematics: Techniques of counting, rule of sum, rule of product

permutations and combinations.

Graph Theory : Introduction to graphs, directed and undirected graphs, homomorphic and
isomorphic graphs, sub graphs multi graphs and weighted graphs, paths and circuits, shortest
path in weighted graphs, eulerian paths and circuits, Hamiltonian paths and circuits, planer
graphs Euler's formula, chromatic
numbers (coloring problems).
Trees: Introduction to trees , difference between graphs and a tree rooted trees, path length in
trees, spanning trees & cut-sets, minimum spanning trees, binary trees and its traversal.

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

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

Department
Department of Applied Sciences
Teaching the Subject

Program Outcome a b c d e f g h i J

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

BS ES PD PC PE OE Project/Training
Category

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.
 CHANDIGARH UNIVERSITY, GHARUAN

Microprocessors and Interfacing L T P C

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

Prerequisite: Studied Computer Architecture & Basics of Computers in Previous

semesters

Marks-100

Internal-40 External-60

Course Objectives

 To understand the architecture, components, flags and instruction set of 8085 and 8086.
 To design interfacing circuits using 8085 and 8086.
 To gain familiarity with 8255(PPI), 8253(Programmable interval timer), 8259 ( PIC),
8237(DMA) and advanced microprocessor chips.

Unit Course Outcome

 Identify the basic element and functions of microprocessor.

I  Describe the architecture of microprocessor and its peripheral devices.

 Demonstrate fundamental understanding on the operation between the

II microprocessor and its interfacing devices.

 Apply the programming techniques in developing the assembly language

III program for microprocessor application.

Contents of the Syllabus

Unit-I [15h]

Introduction: Review of Hardwired Logic v/s Flexible Logic, Tri State Logic. Introduction to
microprocessor, Difference between microprocessor and microcomputer, Basic components of a
microprocessor, system bus: address, data and control buses.

8085 microprocessor: Architecture, pin diagram, flags, addressing modes, instruction set and
assembly language programming, timing diagrams, interrupt structure of 8085.
Memory Interfacing: Interfacing memory- Interfacing SRAM, DRAM, EPROM etc.

Unit-II [15h]

Interfacing devices:

Architecture, Block Diagram, Control words, Modes and working of 8255.

Architecture, Block Diagram and working of8251
Architecture, Block Diagram and working of 8253
Architecture, Block Diagram and working of 8259
Architecture, Block Diagram and working of 8237

Unit-III [15h]

8086 Microprocessor: Architecture, block diagram and pin diagram of 8086, operating modes
of 8086, details of sub-blocks such as EU, BIU; memory segmentation and physical address
computations, program relocation, addressing modes.

Advanced microprocessors: Introduction to 80186, 80286, 80386, 80486, Pentium

microprocessors.

Text Books:

1. Gaonkar, Ramesh S., “Microprocessor Architecture, Programming & Applications with

8085”, Wiley Eastern Ltd.
2. Ayala, “The 8086 Microprocessor: Programming & Interfacing the PC” , Cengage
Learning.
3. Bhurchandi, K.M, Ray, A.K, “Advanced microprocessors and peripherals”, TMH.

Reference Books:

1. Brey, “The Intel Microprocessors 8086- Pentium processor”, PHI.

2. Triebel and Singh, Avtar, “The 8088 & 8086 Microprocessors-Programming,
interfacing, Hardware & Applications”, PHI
3. Liu, Yu-Chang &Gibson, Glenn A, “Microcomputer systems: The 8086/8088 Family:
architecture, Programming & Design”, PHI.
4. Antonakos, James L., “The Pentium processor”, Pearson.
CST-255 Microprocessors and Interfacing

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.

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.
 Chandigarh University, Gharuan

Relational Database Management

L T P C
Systems
Subject Code
Total Contact Hours : 45Hours
CST-256
Common to all Specializations of CSE 2nd 3 0 0 3
Year

Marks-100

Internal-40 External-60

Course Objectives

 To have good understanding of database system concepts and design databases for
different applications.
 To learn how to use a DBMS and RDBMS.
 To implement and understand different types of DDL, DML and DCL statements.
 To understand transaction concepts related to databases and recovery/backup techniques
required for the proper storage of data.

Unit Course Outcomes

Be familiar with a commercial relational database system (Oracle) by writing SQL

using the system.
I.
Be familiar with the relational database theory, and be able to write relational algebra
expressions for queries

Be familiar with basic database storage structures and access techniques: file and page
II. organizations, indexing methods including B‐tree, and hashing.

III. Be familiar with the basic issues of transaction processing and concurrency control.

Contents of the Syllabus

UNIT-I [15h]

Overview of Databases: Database concepts, DBMS, Data Base System Architecture (Three
Level ANSI-SPARC Architecture), Advantages and Disadvantages of DBMS, Data
Independence, DBA and Responsibilities of DBA, Relational Data Structure, Keys, Relations,
Attributes, Schema and Instances, Referential integrity, Entity integrity.
Data Models: Relational Model, Network Model, Hierarchical Model, ER Model: Design,
issues, Mapping constraints, ER diagram, Comparison of Models.

Relational Algebra & Relational Calculus: Introduction, Syntax, Semantics, Additional

operators, Grouping and Ungrouping, Relational comparisons, Tuple Calculus, Domain
Calculus, Calculus Vs Algebra, Computational capabilities.

UNIT-II [15h]

Functional dependencies and Normalization: Functional dependencies, Decomposition, Full

Functional Dependency (FFD), Transitive Dependency (TD), Join Dependency (JD), Multi-
valued Dependency (MVD), Normal Forms (1NF, 2NF, 3NF, BCNF), De-normalization.

Database Security: Introduction, Threats, Counter Measures.

Control Structures: Introduction to conditional control, Iterative control and sequential control
statements, Cursors, Views.

UNIT-III [15h]

Package, Procedures and Triggers: Parts of procedures, Parameter modes, Advantages of

procedures, Syntax for creating triggers, Types of triggers, package specification and package
body, developing a package, Bodiless package, Advantages of packages.

Transaction Management and Concurrency Control: Introduction to Transaction Processing,

Properties of Transactions, Serializability and Recoverability, Need for Concurrency Control,
Locking Techniques, Time Stamping Methods, Optimistic Techniques and Granularity of Data
items.

Database Recovery of database: Introduction, Need for Recovery, Types of errors, Recovery
Techniques.

Text Books:

1. Ramez Elmasri and Shamkant B. Navathe, “Fundamentals of Database System”, The

Benjamin / Cummings Publishing Co.
2. Korth and Silberschatz Abraham, “Database System Concepts”, McGraw Hall.
3. Pratt,” DBMS”, Cengage Learning.

Reference Books:

1. C.J.Date, “An Introduction to Database Systems”, Addison Wesley.

2. Thomas M. Connolly, Carolyn & E. Begg, “Database Systems: A Practical Approach to
Design, Implementation and Management”, 5/E, University of Paisley, Addison-Wesley.
3. Rob,” Database Principal Fundamental Design, Cengage Learning.
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.

Course Code-CST-
Relational Database Management Systems
256

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

 CHANDIGARH UNIVERSITY, GHARUAN

Microprocessors & Interfacing Lab L T P C

Subject Code
Total Contact Hours : 45Hours
(CSP-257) 0 0 2 1
Common to all Specializations of CSE 3rd Year

Prerequisite: Studied Computer Architecture & Basics of Computers

Marks-100

Internal-60 External-40

Course Objectives

 To get familiarization with 8085 kit and simulator.

 To implement basic programs using 8085 kit/simulator.

Unit Course Outcomes

 learn how the hardware and software components of a microprocessor-

based system work together to implement system-level features;
I  learn both hardware and software aspects of integrating digital devices
(such as memory and I/O interfaces) into microprocessor-based systems;

 learn the operating principles of, and gain hands-on experience with,
common microprocessor peripherals such as UARTs, timers, and analog-
II
to-digital and digital-to-analog converters;

 Get practical experience in applied digital logic design and assembly-

III language programming.

List of Experiments

UNIT-I
1. To study 8085-microprocessor trainer kit.
2. Addition of two 8-bit numbers; sum 8 bits
3. Addition of two 16 bit number; sum 16- bits.
4. Subtraction of two 8-bit numbers; result 8 bits.
5. Subtraction of two-16 bit numbers; sum 16 bits.

UNIT-II
 6. Find one’s complement of an 8-bit number.
7. Find one’s complement of a 16-bit number.
8. Find two’s complement of a 8-bit number.
9. Find two’s complement of a 16- bit number.
10. Shift an 8 -bit number to left by 1- bit.
11. Shift an 8-bit number to left by 2-bits.
12. Shift a 16 -bit number to left by 1- bit.
13. Shift a 16-bit number to left by 2- bits.
UNIT-III

14. Mask of least significant 4 bits of an 8-bit number.

15. Mask of most significant 4 bits of an 8-bit number.
16. Find the smaller out of two numbers.
17. Find the smaller number in a data array
18. Find the larger out of two numbers.
19. Find the largest number from data array.

CSP257 Microprocessors & Interfacing 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

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

 CHANDIGARH UNIVERSITY, GHARUAN

Relational Database Management

L T P C
Systems Lab
Subject Code Total Contact Hours : 45Hours
(CSP-259) Common to all Specializations of CSE 0 0 4 2
2nd Year
Prerequisite: Studied C/C++ in previous semesters

Marks-100
Internal-60 External-40
Course Objectives
 To enable students to retrieve and update data from relational databases.
 To implement programs using procedural language structure.
 To have good understanding of implementation and use of cursors, procedures,
packages, triggers etc.

Unit Course Outcomes

Brief knowledge about SQL Fundamentals.
I.
Unary & Binary table operations.

II. Able to handle with different Data Base languages.

III. Table View, Log & Triggers.

List of Experiments

UNIT-I

1. To implement different types of DDL, DML, DCL queries.

2. To explore “SELECT” clause using where, order by, between, like, group by, having etc.

UNIT-II

3. Introduction and implementation of programs using

a. Block Structure and Variables
b. To write programs using control structures of
i. If-else statements.
c. To write programs using loops like
i. For
 ii. Do-while
iii. while
d. Cursors
e. Views
UNIT-III

4. Introduction and implementation of programs of

a. Procedures
b. Packages
c. Triggers

CSP-259 Relational Database Management Systems Lab

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

 Chandigarh University, Gharuan

Scheme PROGRAMMING PRACTICE L T P C

Version Common to all Specializations of CSE 2 nd
Year 0 0 2 1.0

Subject Code Prerequisite Total hours = 45 Hours

CSP-261 Objectives
To understand the concepts of object oriented and concurrent programming paradigms
and develop these skills using C/C++ Programming

To be able to solve logical real life based problems

Subject Outcome
Unit -1 Increase the capacity to express programming concepts and choose among alternative
ways to express things
Be able in principle to program in an imperative (or procedural), an object-oriented, a
functional, and a logical programming language
Unit -2 Be able in principle to design a new programming language.
Unit -3 Improve the background for choosing appropriate programming languages for certain
classes of programming problems.
Unit -1
1. In a car racing video game, the car is an object. You can drive the car, turn the car, or stop the car when
needed but you need to drive long. You will get money according to the Km you have travelled. For
example if you have travelled 123 km then the product of the km (ie 1*2*3 = 6) would be the amount you
win. Write a program to find the product of the digits in the given input number.
2. The Owner of a block visited the Layout and found that he has some plot numbers of his own and some are
odd numbers and some are even numbers. He is maintaining the details in a file in the system. For the
password protection our owner has followed one formula. He calculated the sum of his even numbers plot
and sum of odd numbers plot and found the average of those two and he used that average as his password
for the details file. Find the password that our owner has arrived.
3. Sergey has made N measurements. Now, he wants to know the average value of the measurements made. In
order to make the average value a better representative of the measurements, before calculating the average,
he wants first to remove the highest K and the lowest K measurements. After that, he will calculate the
average value among the remaining N - 2K measurements. Write a program to help Sergey to find the
average value he will get after these manipulations?
4. Every day, Mike goes to his job by a bus, where he buys a ticket. On the ticket, there is a letter-code that
can be represented as a string of upper-case Latin letters. Mike believes that the day will be successful in
case exactly two consecutive different letters in the code are in alphabetic order. Otherwise, he believes that
the day will be unlucky. You are given a ticket code. Write a program to determine, whether the day will be
successful for Mike or not. Print "YES" or "NO".
 Unit -2
5. Given an array consisting of N integers, you have to do the following operation K times.
Find out the sum of all the elements in the array. Denote it by S. Insert an integer in the array strictly greater
than S. Hence, size of the array will increase by one. Thus, at the end of the K operations, the array will
have N + K elements. Since this number can be very large, write a program to tell whether it will be odd or
even.
6. Little Error is a huge movie fan. He likes watching different kinds of movies: from drama movies to
comedy movies, from teen movies to horror movies. He is planning to visit cinema this weekend, but he's not
sure which movie he should watch.

There are n movies to watch during this weekend. Each movie can be characterized by two
integers Li and Ri, denoting the length and the rating of the corresponding movie. Egor wants to
watch exactly one movie with the maximal value of Li × Ri. If there are several such movies, he would pick
a one with the maximal Ri among them. If there is still a tie, he would pick the one with the minimal index
among them.Write a program to help Egor to pick a movie to watch during this weekend.
7. Write a program to find middle of linked list using any two variables.

8. Pooja would like to withdraw X $US from an ATM. The cash machine will only accept the transaction
if X is a multiple of 5, and Pooja's account balance has enough cash to perform the withdrawal transaction
(including bank charges). For each successful withdrawal the bank charges 0.50 $US. Calculate Pooja's
account balance after an attempted transaction.

Unit -3
9. You are given a string. Write a program to determine whether number of occurrences of some character
in the string is equal to the sum of the numbers of occurrences of other characters in the string.
10. If Give an integer N. write a program to obtain the sum of the first and last digit of this number.
11. The citizens of Byteland regularly play a game. They have blocks each denoting some integer from 0 to
9. These are arranged together in a random manner without seeing to form different numbers keeping in
mind that the first block is never a 0. Once they form a number they read in the reverse order to check if
the number and its reverse is the same. If both are same then the player wins. We call such
numbers palindrome. Ash happens to see this game and wants to simulate the same in the computer. As
the first step he wants to take an input from the user and check if the number is palindrome and declare if
the user wins or not
12. In a game show everybody got one coupon with some code. Write a program to generate a code with
only even numbers in that coupon. E.g. Sample Input 1:4352 Sample Output 1: 42
 CSP-261 Programming Practice
Department
Department of Computer Science and Engineering
Teaching the 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

 CHANDIGARH UNIVERSITY, GHARUAN

Project L T P C

Subject Code
Common to all Specializations of CSE 2nd 0 0 0 2
(CSR-260)
Year
Prerequisite: Studied C/C++ in previous semesters

Marks-100
Internal-60 External-40
Course Objectives
 The objective of the project is to enable the students to work on a project of latest
topic / research area / industrial applications preferably using the tool or language
learnt in previous or current semester. Each student shall have a guide who is a
faculty member.

 An ability to design a system, component or process to meet desired needs without

realistic constraints such as economic, environmental, social, political, ethical, health &
safety, manufacturability and sustainability.
 An ability to function on multidisciplinary teams.
 An ability to identify formulates and solves engineering problems.
 An understanding of professional and ethical responsibility.
 An ability to communication effectively.
 The board education necessary to understand the impact of engineering solutions in
global, economic, environmental and societal context.
 Recognition of the need for, and an ability to engage in life-long learning.
 Knowledge of contemporary issues.
 An ability to use the techniques skills, and modern engineering tools necessary for
engineering practice.
 Chandigarh University, Gharuan

SYSTEM PROGRAMMING L T P C
Subject Code Total Contact Hours : 45Hours
CSY-269 Common to all Specializations of CSE 2nd 4 0 0 4
Year

Marks-100

Internal-40 External-60

Course Objectives

 Design, write, and test moderately complicated low-level programs using a systems
programming language.
 Proficiently use a preprocessor to implement code that is portable between different
computing platforms.
 Implement routines that read and write structured binary fies such as word processing
documents, index systems, or serialized hierarchical data

Unit Course Outcomes

To understand the execution process of HLL programs.

I.
To understand the working of scanners and parsers
II. To understand the basic design of various system software.
III. To implement various system software.

Contents of the Syllabus

UNIT-I [15h]

Editors: Line editor, Full screen editor and multi window editor. Case study MS-Word, DOS
Editor and vi editor.

Assemblers: First pass and second pass of assembler and their algorithms. Assemblers for CISC
Machines: case study x85 & x86 machines.
.
UNIT-II [15h]

Compilers: Introduction to various translators, Various phases of compiler, Introduction to

Grammars and finite automata, Bootstrapping for compilers, Lexical Analysis and syntax
analysis, Intermediate Code Generation, Code optimization techniques, Code generation, Case
study :LEXX and YACC, Design of a compiler in C++ as Prototype.

Debuggers: Introduction to various debugging techniques, Case Study: - Debugging in Turbo

C++ IDE.
UNIT-III [15h]

Linkers and Loaders: Concept of linking, Case study of Linker in x86 machines, loading of various loading
schemes.

Operating System: Booting techniques and sub-routines, Design of kernel and various management for OS,
Design of Shell and other utilities.
Text Books:
1. Donovan J.J., Systems Programming, New York, Mc-Graw Hill, 1972.
2. Dhamdhere, D.M., Introduction to Systems Software, Tata Mc-Graw Hill 1996.

3.
Reference Books:
1. Aho A.V. and J.D. Ullman Principles of compiler Design Addison Wesley/ Narosa
1985.

Course Code-
SYSTEM PROGRAMMING
CSY-269

Department
Department of Computer Science and Engineering
Teaching the Subject

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

Mapping of Course
outcome with Program I,II,III
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.
 Chandigarh University, Gharuan

4th Semester (2nd Year)

Name of subject: Python Programming -Theory L T P C
Apply to Programs: UIE (B.E. CSE & IT ) 3 1 3 3.5

Objectives
Subject  To understand the concepts of object oriented and develop these skills
Code
using Python Programming.
CST-267
 To be able to work on projects using File Handling.

Subject Outcome
1  Knowledge of the structure and model of the Python
programming language

2  Use the Java programming language for various programming

technologies (understanding

3  Develop software in the Java programming language,

(application)

Unit I
Introduction to Python Programming: History of Python, Installing Python, Executing Python
Programs, Internal Working of Python, Python Implementations.

Basics of Python Programming: Python Character Set, Token, Python Core Data Type, print()
function, Assigning Value to Variable, input() function, eval() function, Formatting Number and
Strings, Operators and Expressions.

Decision Statements: Boolean Type, Boolean Operators, Using Number and Strings with
Boolean Operators, Decision Making Statements and Conditional Expressions

Loop Control Statements: While loop, range() Function, For Loop, Nested Loops, Break
Statement, Continue Statement.

Functions: Syntax and Basics of a Function, Use of a function, Parameters and Arguments,
Local and Global Scope Scope of a Variable, return statement and Recursive Functions.

Unit II
Strings: str class, Inbuilt functions for String, index[] operator, traversal of String, String
operators, String Operations.
Lists and Dictionaries: Creating Lists, Basic list operators, Slicing, Inbuilt functions for Lists,
List operator, List Methods, Splitting, Need of Dictionary, Creating a Dictionary , Adding and
Replacing Values, Retrieving Values ; Deleting Items and Traversing Dictionaries.

Tuples and Sets: Creating Tuples; Tuple () Function, Inbuilt Functions for Tuples, Indexing
and Slicing; Operations on Tuples; Traverse Tuples from a List, Set operators; Set class.

Searching and Sorting: Sequential Search, Binary Search, Bubble Sort, Selection Sort,
Insertion Sort, Quick Sort and Merge Sort.

Unit III
Object-Oriented Programming: Classes and objects, methods, Operator Overloading,
Inheritance, super () and Method Overriding.

File Handling: Need of File Handling, Reading/Writing Text and Numbers to/from a File;
Directories on a disk.

Text Books:

Ashok Namdev Kamthane, Programming and Problem Solving with Python, Mc Graw Hill
Education Publication, ISBN(13):978-93-87067-57-8.

Reference Books:

1. Introduction to Programming Using Python Author by Y. Daniel Liang, Pearson

2. Python Programming Using Problem Solving Approach by Reema Thareja, Oxford

Publications

3. Core Python Programming by Dr. R. Nageswara Rao, DreamTech Publications

4. Allen B. Downey, Think Python, O’Reilly Media

5. Kenneth A. Lambert, The Fundamentals of Python: First Programs, 2011, Cengage

Learning,

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.

Course Code-CST-
Python Programming
267

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

 CHANDIGARH UNIVERSITY, GHARUAN

Python Programming - Lab L T P C

Total Contact Hours : 45Hours
Subject Code
CSP-268/ITP-268 Common to all Specializations of CSE 2nd 0 0 3 1.5
Year

Marks-100
Internal-60 External-40
Course Objectives
 To understand the concepts of object oriented and develop these skills using Python
Programming.
 To be able to work on projects using File Handling.
Unit Course Outcomes
I. Knowledge of the structure and model of the Python programming language

Use the Java programming language for various programming technologies

II.

III. Develop software in the Java programming language, (application) .

List of Experiments

UNIT I

1. Writing python programs in various modes and printing and assigning values assigned to the
variables.

2. Program to demonstrate the use of if, if-else, while, for, break and continue
3. Program to demonstrate the use o functions and passing different types of arguments to
functions.

UNIT II

4. Program to demonstrate the various kind of operations that can be applied to the string.
5. Program to demonstrate creation and accessing of lists and apply different kinds of operations
on them.
6. Program to demonstrate creation and accessing of dictionary and apply different kinds of
operations on them.
7. Program to demonstrate creation and accessing of tuples and apply different kinds of
operations on them.
8. Program to implement various kinds of searching and sorting algorithms

UNIT III

9. Program to implement concepts of Object Oriented Programming such as classes, inheritance

and polymorphism.
10. Program to demonstrate read and write data to the file in various modes.