0% found this document useful (0 votes)

10 views

B.tech CSE Syllabus

syllabus

Uploaded by

studywithoutphone

Available Formats

Download as PDF, TXT or read online on Scribd

0% found this document useful (0 votes)

10 views

B.tech CSE Syllabus

syllabus

Uploaded by

studywithoutphone

Available Formats

Download as PDF, TXT or read online on Scribd

You are on page 1/ 105

1

FACULTY OF ENGINEERING & TECHNOLOGY

SYLLABUS
FOR

Programme Code: 1703

B.TECH. COMPUTER SCIENCE & ENGINEERING

(Credit Based Evaluation and Grading System)
(SEMESTER: I to VIII)

Batch from year 2023 to 2027

Program Outcomes:

 The graduates are able to design, implement and evaluate a computer oriented system,

process and program to meet their needs as well as IT industry requirements

 The graduates are able to apply knowledge of computation and mathematical approaches

according to their desire outcomes

 The graduates are able to understand their professional responsibilities and having ability to

make judgments in cyber and other security activities based on social and ethical principles

 The graduates are able to work efficiently in a team as a team member or team leader both in

technical as well as management activities appropriate to the course

 The graduates are able to handle the various responsibilities like as legal, cyber security,

professional and common social issues

 The graduates are able to interconnect as well as communicate effectively with a range of

audiences

 The graduates are able to apply the course based computer engineering approach and its

techniques to design software for its adaptation in multi-disciplinary environments.

 The graduates are able to opt and learn from swayam and other online learning platforms to

enhance their online learning abilities

GURU NANAK DEV UNIVERSITY

AMRITSAR
Note: (i) Copy rights are reserved.
Nobody is allowed to print it in any form.
Defaulters will be prosecuted.

(ii) Subject to change in the syllabi at any time.

Please visit the University website time to time.
3

CSA1: B.TECH. (COMPUTER SCIENCE & ENGINEERING)SEMESTER SYSTEM

(Credit Based Evaluation and Grading System)
SEMESTER –I

S. No. Course Code Course Title L T P Credits

1. CEL120 Engineering Mechanics 3 1 0 4

Engineering Graphics & Drafting Using
2. MEL121 3 0 1 4
AutoCAD
3 MTL101 Mathematics-I 3 1 0 4
4. PHL183 Physics 3 0 1 4
5. MEL110 Introduction to Engg. Materials 3 0 0 3
6. Elective-I 2 0 0 2
List of Electives–I:
1. PBL121 Punjabi (Compulsory) –I OR 2 0 0
Punjab History & Culture
2. *HSL101 2 0 0 2
(1450-1716) OR
3. PBL122 mu`FlI pMjwbI 2 0 0
Total Credits: 17 2 2 21

SEMESTER –II

S. No. Course Code Course Title L T P Credits

1. CYL197 Engineering Chemistry 3 0 1 4

2. MTL102 Mathematics-II 3 1 0 4
Basic Electrical &Electronics
3. ECL119 4 0 1 5
Engineering
Fundamentals of IT & Programming
4. CSL126 2 1 1 4
using Python
5. ENL101 Communicative English 2 0 0 2
6. Elective-II 2 0 0 2
7. MEP 102 Manufacturing Practices 0 0 1 1
List of Electives–II:
PBL131 Punjabi (Compulsory)-II OR 2 0 0
Punjab History & Culture
2. *HSL102 2 0 0 2
(1717-1947) OR
3. PBL132 mu`FlI pMjwbI 2 0 0
Total Credits: 16 2 4 22

Note: * Special Paper in lieu of Punjabi Compulsory, For those students who are not
domicile of Punjab
4

CSA1: B.TECH. (COMPUTER SCIENCE & ENGINEERING)SEMESTER SYSTEM

(Credit Based Evaluation and Grading System)

SEMESTER –III

S. No. Course Code Course Title L T P Credits

1. CSL231 Data Structures & Programming 3 1 0 4
Methodology
2. CSL233 Programming in C++ 2 1 1 4
3. ECL291 Digital Circuits & Logic Design 3 0 1 4
4. Written & Oral Technical 2 1 1 4
ENL201 Communication
5. #ESL220 Environmental Studies - 2 0 0 2
Interdisciplinary
Course(Compulsory)
6. #SOA- 101 Drug Abuse: Problem, Management 2 0 0 2
and Prevention -Interdisciplinary
Course(Compulsory)
7. CSP 234 0 0 4 4
Mini Project
Total 10 3 7 20

# Credits will not be included in SGPA.

SEMESTER –IV

S. No. Course Code Course Title L T P Credits

1. CSL240 Operating System 2 1 1 4
2. CSL241 Data Communication 3 0 1 4
3. CSL243 System Programming 3 1 0 4
4. CSL244 Discrete Structures 3 1 0 4
5. CSL245 Computer Architecture 3 1 0 4
6. #PSL-055 Human Rights and Constitutional Duties 2 0 0 2
(Compulsory)
Total 14 4 2 20

# Credits will not be included in SGPA.

CSA1: B.TECH. (COMPUTER SCIENCE & ENGINEERING)SEMESTER SYSTEM

(Credit Based Evaluation and Grading System)

SEMESTER –V

S. No. Course Code Course Title L T P Credits

1. CSL330 System Analysis And Design 3 1 0 4
2. Relational Database Management 3 0 1 4
CSL332 Systems
3. CSL333 Design & Analysis of Algorithm 3 1 0 4
4. CSL351 Formal Languages & Automata 3 1 0 4
Theory
5. CSL336 Programming in ASP.Net 3 0 1 4
6. Interdisciplinary Course-I 4 0 0 4
Total 19 3 2 24

SEMESTER –VI

S. No. Course Code Course Title L T P Credits

1. CSL342 Object Oriented Analysis & Design 3 1 0 4
2. CSL344 Object Oriented Programming using 2 1 1 4
JAVA
3. CSL350 Software Engineering and Testing 3 0 1 4
4. Elective–I 3 1 0 4
(for code see Dept. Elective–I list)
5. CSL347 Real Time Systems 4 0 0 4
Total 15 3 2 20
Electives–I
1. CSL345 Natural Language Processing 3 1 0 4
2. CSL346 System Hardware Design 3 1 0 4
3. CSL348 Operation Research 3 1 0 4
4. CSL349 Language Processor 3 1 0 4
6

CSA1: B.TECH. (COMPUTER SCIENCE & ENGINEERING)SEMESTER SYSTEM

(Credit Based Evaluation and Grading System)

SEMESTER –VII

S. No. Course Code Course Title L T P Credits

1. CSL479 Computer Graphics 3 0 1 4
2. CSL474 Cloud Computing 2 1 1 4
3. CSL477 Artificial Intelligence 4 0 0 4
4. CSL478 Machine Learning 3 0 1 4
5. Departmental Elective–II 3 1 0 4
Total 16 1 3 20
List of Departmental Electives–II:
1. CSL472 Internet Protocol 3 1 0 4
2. CSL473 Advanced Microprocessors 3 1 0 4
3. CSL476 Robotics 3 1 0 4

SEMESTER –VIII

S. No. Course Code Course Title L T P Credits

1. CSD480 Industrial Training Cum Projects 0 0 40 40
Total 40
7

CSA1: B.TECH. (COMPUTER SCIENCE & ENGINEERING) SEMESTER– I

(Credit Based Evaluation and Grading System)

Course Name : Engineering Mechanics

Course Code : CEL-120
Credits (L-T-P) : 4 (3-1-0)
Total Marks : 100
Mid Semester Examination : 30% weightage
End Semester Examination : 70% weightage

Internal Marks: 30 External Marks: 70

Course Objectives:
 To understand distributed force systems, centroid/ centre of gravity and method of finding
centroids of composite figures and bodies.
 To understand moment of inertia and method of finding moment of inertia of areas and bodies.
 To understand dynamics of a particle.
 To understand the kinetics of rigid bodies and simple problems.
Total No. of Lectures –36

Lecture wise breakup Number

of
Lectures
Note: Eight questions are to be set by selecting two questions from each section. Each question is
divided in subsections (not exceeding 4). The candidates are required to attempt five questions by
selecting one question from each section and the fifth question can be attempted from any section.
All questions carry equal marks.
SECTION - A
Introduction: Force system, dimensions and units in mechanics, laws of mechanics, 9
vector algebra, addition and subtraction of forces, cross and dot products of vectors,
moment of a force about a point and axis, couple and couple moment, transfer of a
force to a parallel position, resultant of a force system using vector method,
1
Problems involving vector application. Equilibrium: Static and dynamic
equilibrium, static in determinacy, general equations of equilibrium, Varingnon’s
theorem, Lami’s theorem, equilibrium of bodies under a force system, Problems.

SECTION - B
Truss and Frames: Truss, classification of truss, assumptions in truss analysis, 9
perfect truss, analysis of perfect plane truss using method of joints and method of
sections, Problems. Centroid, Centre of mass and Centre of gravity, Determination
2
of centroid, centre of mass and centre of gravity by integration method of regular
and composite figures and solid objects, Problems.

SECTION - C
8

Moment of Inertia: Area moment of inertia, mass moment of inertia, parallel axis 9
and perpendicular axis theorems, radius of gyration, polar moment of inertia,
3
product of inertia, principle axis, problem based on composite figures and solid
objects. Kinematics: Concept of rigid body, velocity and acceleration, relative
velocity, translation and rotation of rigid bodies, equations of motion for
translation and rotation, problems.
SECTION - D
Particle Dynamics: Energy methods and momentum methods, Newton’s laws, work 9
energy equation for a system of particles, linear and angular momentum equations,
projectile motion, problem. Shear Force and Bending Moment Diagram for
4 statically determinant beams Classification of beams, types of loads, shear force and
bending moment calculation and their graphical presentation, point of inflection,
problem.

Course Outcomes:
1 Basic understanding of laws and principles of mechanics.

2 Ability to analyse and solve simple problems of mechanics.

3 An understanding of assumptions and limitations of approaches used.

Suggested / Reference Books:

1 Engineering Mechanics – Irving H. Shames, PHI Publication.
2 Engineering Mechanics – U.C.Jindal, Galgotia Publication.
3 Mechanics–Berkeley Physics Course, Vol–I (Second Edition): C. Kittel, W.D. Knight, M.A.
Ruderman, C.A. Helmholtz and R.J. Moyer–Tata McGraw Hill Publishing Company Ltd., New
Delhi.
9

CSA1: B.TECH. (COMPUTER SCIENCE & ENGINEERING) SEMESTER– I

(Credit Based Evaluation and Grading System)

Course Name : Engineering Graphics & Drafting Using AutoCAD

Course Code : MEL-121
Credits (L-T-P) : 4 (3-0-1)
Total Marks : 100
Mid Semester Examination : 30% weightage
End Semester Examination : 70% weightage

Internal Marks: 30 External Marks: 70

Course Objectives:
At the end of this course, the student should be able to understand the
1. Increase ability to communicate with people
2. Learn to sketch and take field dimensions.
3. Learn to take data and transform it into graphic drawings.
4. Learn basic CAD skills.
5. Learn basic engineering drawing formats
6. Prepare the student for future Engineering positions
Total No. of Lectures – 48

Lecture wise breakup Number

of
Lectures
Note: Eight questions are to be set by selecting two questions from each section. Each question is
divided in subsections (not exceeding 4). The candidates are required to attempt five questions by
selecting one question from each section and the fifth question can be attempted from any section.
All questions carry equal marks.
SECTION - A
Introduction: Instruments used, Lettering, Types of Lines used, Scales, Types of
Projections in use, Dimensioning of Figures, etc.; Orthographic Projections of
Points, Lines & Lamina
1 6
Lab Work: Introduction to AutoCAD, Practice of 2D commands, Exercises related
to the theory contents of this section.
SECTION - B
Projection of Solids: Section of Solids & its Projections; Interpenetration of Solids
& Curve of Interpenetration; Development of Surfaces.
2 6
Lab Work: Familiarity with 3D commands, Exercises related to the theory contents
of this section.

SECTION - C
Isometric Drawing & Isometric Projection, Orthographic Projection

3 6
Lab Work: Lab Exercises related to the theory contents of this section.
10

CSA1: B.TECH. (COMPUTER SCIENCE & ENGINEERING) SEMESTER– I

(Credit Based Evaluation and Grading System)

SECTION - D
Free-Hand sketching of Engineering Components, Advance 3D Commands: Solving
Problems using AutoCAD.
4 6
Lab Work: Lab Exercises related to the theory contents of this section.

Course Outcomes:
Student’s ability to hand letter will improve.
1
Student’s ability to perform basic sketching techniques will improve.
2

3 Students will be able to draw orthographic projections and sections.

4 Student’s ability to use architectural and engineering scales will increase.

5 Students ability to produce engineered drawings will improve

6 Student’s ability to convert sketches to engineered drawings will increase.

7 Students will become familiar with office practice and standards.

8 Students will become familiar with two and three dimensional drawings.

9 Students will develop good communication skills and team work.

Suggested / Reference Books:

1 Engineering Drawing, N. D. Bhatt
2 Engineering Graphics with AutoCAD, James D. Bethune
3 Engineering Drawing & Graphics, K. Venugopal
4 Engineering Drawing PS Gill
5 Engineering Drawing, M. B. Shah & B. C. Rana
Engineering Drawing Author: M. B. Shah & B. C. Rana
11

CSA1: B.TECH. (COMPUTER SCIENCE & ENGINEERING) SEMESTER– I

(Credit Based Evaluation and Grading System)

Course Name : Mathematics-I

Course Code : MTL-101
Credits (L-T-P) : 4 (3-1-0)
Total Marks : 100
Mid Semester Examination : 30% weightage
End Semester Examination : 70% weightage

Internal Marks: 30 External Marks: 70

Course Objectives:

The aim of the course is to introduce the important topics of mathematics to future engineers which
they would find useful in their respective engineering branches. This course would act as foundation
for the students with basic as well as advanced concepts for familiarizing them with the use of
mathematics to the real life and problems associated with their respective disciplines.

Total No. of Lectures – 44

SECTION - A
Matrices: Introduction to matrices, Inverse and rank of a matrix, ranknullity
theorem; Symmetric, skew-symmetric and orthogonal matrices, Hermitian and
1 skew-Hermitian matrices, Unitary matrix, Determinants; System of linear equations; 10
Eigenvalues and eigenvectors; Diagonalization of matrices; Cayley-Hamilton
Theorem.
SECTION - B
Infinite Series: Convergence and divergence of infinite series, Geometric series
test, Positive term series, p-series test, [Comparison test, D’ Alembert’s ratio test,
Cauchy’s root test, Integral test, Raabe’s test, Logarithmic test, Gauss’s test] 10
2
(without proofs), Alternating series and Leibnitz’s rule, Power series, Radius and
interval of convergence.
SECTION - C
Differential Calculus: Partial Derivatives, Euler’s theorem on homogeneous
functions, Maclaurin’s and Taylor’s expansions of single and two variables,
3 Maxima and minima of functions of several variables, Lagrangian method of
12
multipliers, Multiple integrals and their use in obtaining surface areas and volumes
of solids.
12

SECTION - D
Vector Calculus: Scalar and Vector point functions, Differentiation of vectors,
Gradient of a scalar field, Divergence and Curl of a vector field, Line integral of a
4 vector field, Surface integral of vector field, Volume integral of a scalar field, 12
Green’s theorem, stokes theorem, Gauss divergence theorem (without proofs) and
their applications.

Course Outcomes:
Students will be able to calculate rank of matrix, characteristic equation & characteristic roots &
1 use the applicability of Caylay Hamilton Theorem to find inverse of matrix which is very
important in many engineering application.

2 It will equipped the students in determining whether the given function can be approximated
with the power series.

3 Students will learn the various applications of mathematics using vector calculus techniques.

Suggested / Reference Books:

1 Louis A. Pipes: Applied Mathematics for Engineers and Physicists, McGraw Hill Book Company.
2 Kreyszig: Engineering Mathematics, Wiley Eastern Ltd.
3 B.S. Grewal: Higher Engineering Mathematics, Khanna Publisher, New Delhi.
13

CSA1: B.TECH. (COMPUTER SCIENCE & ENGINEERING) SEMESTER– I

(Credit Based Evaluation and Grading System)

Course Name : Physics

Course Code : PHL-183
Credits (L-T-P) : 4 (3-0-1)
Total Marks : 100
Mid Semester Examination : 30% weightage
End Semester Examination : 70% weightage

Internal Marks: 30 External Marks: 70

Course Objectives:
 To make the students aware about Electromagnetic wave fundamentals.
 To make students aware about quantum physics phenomena.
Total No. of Lectures – 48

Number
Lecture wise breakup of
Lectures
Note: Eight questions are to be set by selecting two questions from each section. Each question is
divided in subsections (not exceeding 4). The candidates are required to attempt five questions by
selecting one question from each section and the fifth question can be attempted from any section.
All questions carry equal marks.
SECTION - A
Electric and magnetic fields in a medium, Susceptibility and Conductivity,
1 Maxwell’s equations, Boundary conditions; EM wave equation, Plane wave 9
solutions.
SECTION - B
Polarization of the EM waves, Pointing vector and intensity of the EM wave; Wave
packet, Phase and Group velocities; Reflection and refraction of EM waves at a
9
dielectric interface; Brewster angle; Total internal reflection at a dielectric interface;
2
EM waves in a conducting medium and plasma.
SECTION - C
Wave-particle duality, de-Broglie waves; Quantum mechanical operators;
Schroedinger equation, Wave function, Statistical interpretation, Superposition
3 9
Principle, Continuity equation for probability density; Stationary states, Bound
states.
SECTION - D
Free-particle solution, 1-D infinite potential well, Expectation values and
4 uncertainty relations; 1-D finite potential well, Quantum mechanical tunneling and 9
alpha- decay, Kronig-Penny model and emergence of bands
14

CSA1: B.TECH. (COMPUTER SCIENCE & ENGINEERING) SEMESTER– I

(Credit Based Evaluation and Grading System)

Course Outcomes:
This will enable the students to learn physical concepts associated with electromagnetic
1
radiation and devices.
Student will understand quantum mechanical aspects of physics.
2

Suggested / Reference Books:

1 Concepts of Modern Physics. Arthur Beiser, (Tata McGraw-Hill, Sixth Edition 2003).
2 Lasers & Nonlinear optics. B.B. Laud (New Delhi, India: Wiley Eastern 1991).
15

CSA1: B.TECH. (COMPUTER SCIENCE & ENGINEERING) SEMESTER– I

(Credit Based Evaluation and Grading System)

Course Name : Introduction to Engineering Materials

Course Code : MEL110
Credits (L-T-P) : 3 (3-0-0)
Total Marks : 100
Mid Semester Examination : 30% weightage
End Semester Examination : 70% weightage

Internal Marks: 30 External Marks: 70

Course Objectives:
At the end of this course, the student should be able to understand the:
1. To review physics and chemistry in the context of materials science & engineering.
2. To describe the different types of bonding in solids, and the physical outcomes of these
differences.
3. Give an introduction to metals, ceramics, polymers, and electronic materials in the context of a
molecular level understanding of bonding.
4. Give an introduction to the relation between processing, structure, and physical properties.
5. Give the beginning student an appreciation of recent developments in materials science &
engineering within the framework of this class.

Total No. of Lectures – 47

SECTION - A
Introduction: Historical perspective, scope of materials science and engineering.
1 Atomic structure and interatomic bonding. Lattices, basic idea of symmetry. 9

SECTION – B
Lattice structure: Bravais lattices, unit cells, crystal structures, crystal planes and
directions,co-ordinationnumber.Singlecrystals,polycrystalline,non-crystalline,nano-
crystallinematerials.Imperfections in solids: point defects, line defects, surfaced 9
2
effects.
SECTION - C
Solid solutions: phases, phase diagrams. Diffusion phenomenon, phase
9
transformations. Strengthening mechanisms.
3 CSA1: B.TECH. (COMPUTER SCIENCE & ENGINEERING)SEMESTER SYSTEM
(Credit Based Evaluation and Grading System)
16

SECTION - D
Classification of materials: properties of materials. Structure, properties and
4 applications of different metals and alloys, ceramics, composites and polymers. 9

Course Outcomes:
Given a type of material, be able to qualitatively describe the bonding scheme and its general
1
physical properties, as well as possible applications.
2 Given a type of bond, be able to describe its physical origin, as well as strength.

3 Be able to qualitatively derive a material's Young's modulus from a potential energy curve.
Given the structure of a metal, be able to describe resultant elastic properties in terms of its 1D and
4
2D defects.
5 Be able to do simple diffusion problems.

Suggested / Reference Books:

1 MaterialsScienceandEngineeringbyW.D.CallisterJr.(JohnWiley&SonsInc.,EighthEdition).

MaterialsScienceandEngineering:AFirstCoursebyV.Raghvan(Prentice-HallofIndiaPvt.Ltd.).
2
17

CSA1: B.TECH. (COMPUTER SCIENCE & ENGINEERING) SEMESTER– I

(Credit Based Evaluation and Grading System)

Course Name : Punjabi Compulsory-I

Course Code : PBL-121
Credits (L-T-P) : 2 (2-0-0)
Total Marks : 100
Mid Semester Examination : 30% weightage
End Semester Examination : 70% weightage

Internal Marks: 30 External Marks: 70

Course Objectives:
At the end of this course, the student should be able to understand the Punjabi Language.

Total No. of Lectures –24

Lecture wise breakup Number

of
Lectures
Note: Eight questions are to be set by selecting two questions from each section. Each question is
divided in subsections (not exceeding 4). The candidates are required to attempt five questions by
selecting one question from each section and the fifth question can be attempted from any section.
All questions carry equal marks.
SECTION - A
I. d' ozr(;zgkHjofizdof;zxfY`b', gqhswf;zx ;or'Xhnk) 6
r[o{ BkBe d/t :{Bhtof;Nh, nzfwqs;oftu' j/m fby/ eth L
(T) GkJhthof;zx
1 (n) XBhokwukfsqe
(J) gq'H g{oBf;zx
(eth dkihtB, eftsk-;ko, ftFk-t;s{, ekft-ebk)
II. r[ow[yhn"oE'rokch dh i[rs (g?sh, w[jkoBh, fpzdh, fN`gh s/ n`Xe)l
ftFokwfuzBQ, Fpdi'V (F[X-nF[X)
SECTION - B
I. d' ozr(;zgkHjofizdof;zxfY`b', gqhswf;zx ;or'Xhnk) 6

r[o{ BkBe d/t :{Bhtof;Nh, nzfwqs;oftu' j/m fby/ eth L

2
(T) fco'}dhBFoc

(n) gq'Hw'jBf;zx

(eth dkihtB, eftsk-;ko, ftFk-t;s{, ekft-ebk)

II. b/y ouBk (ihtBh-goe, ;wkie ns/ ubzsftfFnK T[`s/) L 10 b/y fbytkT[D/

(ebk; ftu ns/ xo bJhnfGnk;)

SECTION - C
18

I. d' ozr(;zgkHjofizdof;zxfY`b', gqhswf;zx ;or'Xhnk) 6

3 r[o{ BkBe d/t :{Bhtof;Nh, nzfwqs;oftu' j/m fby/ eth L

(T) Bzdbkb B{og[oh
(n) nfwqskgqhsw
(J) vkHjfoGiBf;zx
(eth dkihtB, eftsk-;ko, ftFk-t;s{, ekft-ebk)
II. F[`X, nF[`X L fd`s/ g?oQ/ ftu' nF[`X FpdK ~ F[`X eoBk
(15 g?foQnK d/ F[`X nF[`X nfGnk; eotkT[D/)

SECTION - D
I. d' ozr(;zgkHjofizdof;zxfY`b', gqhswf;zx ;or'Xhnk) 6
r[o{ BkBe d/t :{Bhtof;Nh, nzfwqs;oftu' j/m fby/ eth L
(T) fFt e[wkopNkbth
4 (n) ;[oihsgkso
(eth dkihtB, eftsk-;ko, ftFk-t;s{, ekft-ebk)
II. n]pkohfJFfsjko L fB`ih, d\soh s/ ;wkiershftXhnKBkb ;zpzXs
19

CSA1: B.TECH. (COMPUTER SCIENCE & ENGINEERING) SEMESTER– I

(Credit Based Evaluation and Grading System)

Course Name : Punjab History & Culture (1450-1716)

Course Code : HSL-101
Credits (L-T-P) : 2 (2-0-0)
Total Marks : 100
Mid Semester Examination : 30% weightage
End Semester Examination : 70% weightage

Internal Marks: 30 External Marks: 70

Course Objectives:
At the end of this course, the student should be able to understand the history and culture of
Punjab.
Total No. of Lectures –24
Lecture wise breakup Number
of
Lectures
Note: Eight questions are to be set by selecting two questions from each section. Each question is
divided in subsections (not exceeding 4). The candidates are required to attempt five questions by
selecting one question from each section and the fifth question can be attempted from any section.
All questions carry equal marks.
SECTION - A
1. Land and the People. 6
1
2. Bhakti Movement
SECTION - B
3. Life and Teaching of Guru Nanak Dev. 6

4. Contribution of Guru AngadDev, Guru ArjunDev, Guru Amar Das and

2
Guru Ram Das.
SECTION - C
5. Guru Hargobind. 6

3 6. Martyrdom of Guru TegBahadur

SECTION - D
7. Guru Gobind Singh and the Khalsa. 6
4
8. Banda Singh Bahadur: Conquests and Execution.

Course Outcomes:
To understand the teachings of sikh gurus.
1
Contribution of sikh gurus.
2
20

Suggested / Reference Books:

1 Kirpal Singh (Ed.), History and Culture of the Punjab, Part-ii, Punjabi University,

Patiala, 1990.

2 Fauja Singh (Ed.), History of Punjab, Vol, III Punjabi University, Patiala, 1987.
3 J.S. Grewal, The Sikhs of the Punjab, Cup, Cambridge, 1991.
4 Khushwant Singh, A History of the Sikhs, Vol. I, OUP, New Delhi, 1990.
21

CSA1: B.TECH. (COMPUTER SCIENCE & ENGINEERING) SEMESTER– I

(Credit Based Evaluation and Grading System)

Course Name : Mudhli Punjabi

Course Code : PBL-122
Credits (L-T-P) : 2 (2-0-0)
Total Marks : 100
Mid Semester Examination : 30% weightage
End Semester Examination : 70% weightage

Internal Marks: 30 External Marks: 70

Course Objectives:
At the end of this course, the student should be able to understand the Basic Punjabi.

Total No. of Lectures –24

Lecture wise breakup Number

brkyo (fpzdh, fN`gh, n`Xe) LSECTION

gSkD s/- tos'
B
gzikphFpdpDso L w[`YbhikD-gSkD 6

;kXkoBFpd, ;z:[esFpd, fwFosFpd

2
w{b Fpd, nr/so ns/ fgS/so

SECTION - C
F[`X nF[`X L fd`s/ g?oQ/ ftu' nF[`X Fpd ~ F[`X eoBk. 6

3 ;wkBkoEe s/ fto'XkoEeFpd

SECTION - D
hPqydys~qidnWdynW, bwrHWmhIinAWdynW, ru~qWdynwm, 6
4 iekqoNsOq~kigxqISbdWiv~c[

Course Outcomes:
To understand basic words of Punjabi.
1
Learn to write Punjabi.
2
22

3 Learn to read Punjabi.

CSA1: B.TECH. (COMPUTER SCIENCE & ENGINEERING) SEMESTER– II

(Credit Based Evaluation and Grading System)

Course Name : Engineering Chemistry

Course Code : CYL-197
Credits (L-T-P) : 4 (3-0-1)
Total Marks : 100
Mid Semester Examination : 30% weightage
End Semester Examination : 70% weightage

Internal Marks: 30 External Marks: 70

Course Objectives:
At the end of this course, the student should be able to understand the water quality requirement for
human consumption, different treatment process for municipal water treatment, application of glass,
ceramics, composites, magnetic materials, Role of refractories for synthesis of high performance
materials. Polymer, rubber and silicone material uses in daily life. Introduction to electrochemistry.
Application of CNT and graphene in electronics industry.
Total No. of Lectures –45

Lecture wise breakup Number

of
lectures
Note: Eight questions are to be set by selecting two questions from each section. Each
question is divided in subsections (not exceeding 4). The candidates are required to
attempt five questions by selecting one question from each section and the fifth
question can be attempted from any section. All questions carry equal marks.
SECTION - A
Water hardness: Common impurities of water, Hardness: Introduction, EDTA
1 method for determination of hardness, degree of hardness. Numerical based on 3
hardness and EDTA method.
Water hardness related problems: Boiler troubles, their causes, disadvantages and
2 prevention: Formation of solids (scale and sludge), carry over (priming and 2
foaming), corrosion and caustic embrittlement.
Water treatment techniques: Introduction, water purification techniques, steps
3 involved in purification of water, sedimentation, coagulation, filtration and 2
sterilization, chlorination.
Softening of water: Lime-Soda method, Zeolite method, Deionization/Demin-
4 eralization methods. Numerical problems based on Lime-Soda and Zeolite softening 2
methods.
SECTION - B
Glasses, Ceramics, Composites Glassy state, glass formers and modifiers, types of
5 glasses, manufacturing, applications. Ceramic structures, types of ceramics and their 3
properties. Composites; types, properties and applications.
Magnetic Materials: Introduction, types of magnetic material, hard and soft ferrites,
6 3
magnetic properties and applications.
Refractories: Definition, classification, properties, requisites of good refractory,
7 manufacturing of refractory, silica and fire clay refractory and their uses. Seger's 3
(Pyrometric) Cone Test and RUL Test.
24

SECTION - C
Polymers: Introduction, classification and constituents of polymers, polymer
structure and properties, glass transition temperature (T g), melting point (Tm),
structure-property relations (general), synthesis, properties and application of
3
8 commercial polymers (Bakelite, Polyethylene, Polypropylene, Polystyrene,
Polycarbonate, Polytetra fluoroethylene, Polyester and Nylon)

Polymer processing methods: Introduction, compounding, moulding (Injection,

Compression, Blow film and Extrusion). Application of polymers such as contact
9 3
lenses, bulletproof vest, etc.

Rubber: Introduction, natural rubber, vulcanization, different types of rubber,

10 synthesis of rubbers viz. Buna-S, Buna-N, Buty1 and neoprene rubbers, properties 3
and application.
SECTION - D
Silicone based compounds: Introduction, properties, preparation of silicones,
12 cross-linked silicones, silicon fluids or oils, silicon elastomers and their applications. 2

Electrochemistry: Introduction, Strong, moderate and weak electrolytes, degree of

ionization, factors affecting degree of ionization, Arrhenius theory of ionization,
specific conductance, molar conductance, Faraday’s Law of electrolysis, Chemical 4
13 cells, distinguish between electrolytic and galvanic cell, reversible and irreversible
cells with examples. Standard electrode (reduction) potential of half-cells.
Applications of electrochemistry in daily life.
Nanomaterial: Introduction, properties, general methods of preparation. Applications
14 of fullerenes, CNTs and graphene. 3

List of Practical’s:
Determination of total hardness of Water.
1
Determination of temporary and permanent hardness of water.
2

3 To determine the strength of sodium carbonate in given sample of washing soda.

4 To determine the strength of sodium carbonate and sodium hydroxide in caustic soda solution.

5 To determine the strength of acetic acid in vinegar

6 Find the strength of KMnO4 solution with oxalic acid

7 Find the strength of KMnO4 solution with Mohr’s salt.

8 To determine the number of water molecules in Mohr’s salt by titration method.

9 Determination of relative viscosity of a given liquid with respect to water by viscometer.

10 Determination of surface tension of a given liquid by drop number method by stalagmometer

11 To determine the strength of strong and weak acid conductometry

12 To determine the critical micelle concentration of a soap (sodium laurate) by surfacetension

measurements.

Course Outcomes:
1 Develop new methods to produce soft water for industrial use and potable water at low cost.

Replace metals with polymer in different application areas.

3 Develop low cost and new methods for synthesis of Nano materials.

4 Apply their knowledge for development of new application of electrochemistry.

5 Demonstrate the knowledge of polymer materials for advance engineering applications.

Suggested / Reference Books:

1 Engineering Chemistry by P.C. Jain & Monica Jain DhanpatRai Publishers, NewDelhi.2014.
2 Physical Chemistry by A. Peter and J.de. Paula 10th Edition Oxford University Press, 2014.
3 Inorganic Polymers by P.B. Saxena, Discovery Publishing House, 2007.
4 Ferrite materials by V.R.K. Murthy & B. Viswanathan, SpringerVerlag, Berlin, 1990
5 Advanced practical physical chemistry by J.B Yadav by Krishna’s educational publishers.

E-learning resource: https://nptel.ac.in/courses.php

CSA1: B.TECH. (COMPUTER SCIENCE & ENGINEERING) SEMESTER– II

(Credit Based Evaluation and Grading System)

Course Name : Mathematics-II

Course Code : MTL-102
Credits (L-T-P) : 4 (3-1-0)
Total Marks : 100
Mid Semester Examination : 30% weightage
End Semester Examination : 70% weightage

Internal Marks: 30 External Marks: 70

Course Objectives:

The goal of the course is to introduce the theory of differential equations along with their
applications in modeling the engineering system. The course also introduces complex
analysis and its uses to study Fourier transform and series. The students will also be
apprised with Laplace and Fourier transforms as a toll for analysis/ processing of signals
and solution of differential and integral equations.
Total No. of Lectures –36

Number
Lecture wise breakup of
Lectures
Note: Eight questions are to be set by selecting two questions from each section. Each question is
divided in subsections (not exceeding 4). The candidates are required to attempt five questions by
selecting one question from each section and the fifth question can be attempted from any section.
All questions carry equal marks.
systems.
SECTION - A
Differential Equations: Exact differential Equation, Higher order linear Differential 9
1
equations, ODE’s with constant coefficients.
SECTION - B
Laplace Transforms: Laplace transforms, Properties of Laplace transforms, Laplace 9
transform of derivatives and differentiation theorem, Integration theorem, Laplace
transform of Integrals, Inverse Laplace transform, Formulas for obtaining inverse
2
Laplace transforms, Convolution theorem, The second shifting property.
SECTION - C
Fourier Series and Fourier Transform: Fourier series expansion, Fourier series for 9
even and odd functions, half range series, harmonic functions, Modulation theorem,
3
Shifting properties, convolution theorems, sine and cosine transforms, Fourier
transform of derivatives and integrals, inverse Fourier transform, applications to
PDE’s & ODE’s .
27

SECTION - D
Complex Analysis: De Moivre’s theorem with applications, Analytic functions, 9
Cauchy – Riemann equations, Laplace equation, Cauchy’s integral theorem,
4 Cauchy’s integral formula (without proofs), Taylor series and Laurent series(without
proofs), Residues and their application in evaluating real improper integrals

Course Outcomes:
It will help the students in the study of engineering system by modeling it with ordinary and
1
partial differential equations.
With Laplace transform, mathematical models involving differential equations can be simplified
2
and studied by solving algebraic equations.
In engineering, sound, signal, etc can be represented by mathematical functions, Fourier
3
transforms/ series enable the engineers in simplications of the study of these functions.

Suggested / Reference Books:

1 Louis A. Pipes: Applied Mathematics for Engineers and Physicists, McGraw Hill Book
2 Company.
Kreyszig: Engineering Mathematics, Wiley Eastern Ltd.
3 B.S. Grewal: Higher Engineering Mathematics, Khanna Publisher, New Delhi.
28

CSA1: B.TECH. (COMPUTER SCIENCE & ENGINEERING) SEMESTER– II

(Credit Based Evaluation and Grading System)

Course Name : Basic Electrical & Electronics Engineering

Course Code : ECL-119
Credits (L-T-P) : 5 (4-0-1)
Total Marks : 100
Mid Semester Examination : 30% weightage
End Semester Examination : 70% weightage

Internal Marks: 30 External Marks: 70

Course Objectives:
This course is aimed to introduce important initial understanding of electrical and electronics
engineering to the 1st year students, this will act as the foundation for the advanced electronics courses.
The aim of this course is to familiarize the students to the basics of electricity, electrical machines and
the basics of electronic devices. so that they can use this knowledge in relevant applications.
Total No. of Lectures –48

Electrical Machinery: Transformer, its working principle, types of transformers

and their applications, performance losses, efficiency and voltage regulation, open
circuit and short circuit tests on transformer, auto transformers.
SECTION – B
Circuit Analysis: A brief review of DC and single phase AC circuits. , Star-delta
load transformation, concept of balanced and unbalanced three phase circuits,
measurement of power and power factor in three phase balanced circuits.
2 12
Semiconductors: Introduction to semiconductors, Intrinsic Semiconductor, n-type
and p-type semiconductors, Effect of Doping, Fermi levels, Charge flow in
semiconductors.
29

SECTION – C
PN junction diode: Theory of PN junction diode, depletion layer, barrier potential,
Volt-Ampere Characteristics, Current Components, Storage Capacitance and
3
transition capacitance, Junction diode switching times, Zener diode, LED,
Photodiode, Varactor diode, Schottky diode 12

Bipolar Junction Transistors: Junction Transistor, Current components, transistor

as an amplifier, CB, CE and CC configurations and characteristics.
SECTION – D
Fundamentals of DC & AC Motors: Working principle, construction, types &
characteristics of DC motor, Working principle of Single-Phase & Three-Phase
Induction motor, Three phase synchronous motor.

4 Control and Protection: Control mechanism, principle and applications of 12

protection devices: Fuses, MCB, LCB, relays. Need& types of earthing and
grounding, Cables, Construction of LT & HT cables.

Practical’s
1 Study of VI characteristics of PN junction
2 Study of Half wave, full wave & Bridge rectifiers.

3 Study of simple capacitive, T & II filters.

4 Study of zener as a voltage regulator

5 Study of transistor characteristics in CC, CB and CE configuration

6 To study the performance characteristic of clipper circuit
7 To study the performance characteristic of clamper circuit

Course Outcomes: After study of this subject the student will become

1 Familiar with the electricity production, distribution and the use of control/protection devices.

2 Able to understand the working and applications of electrical machines.

3 Able to understand the basics of semiconductor devices and their applications.

4 Familiar to the concept of rectification and filtration circuits.

5 Able to analyze the basic DC and AC circuits and to solve related circuit problems.
30

Suggested / Reference Books:

1 Principles of Electrical Engineering by Gupta BR; S. Chand and Company, New Delhi.
2 Electrical Technology by Hughes Edward; The English Language Book Society and
Longmans.
3 Electrical Machines by Bhattacharya SK; Tata McGraw Hill, Delhi.
4 Group Limited, London
Basic Electrical Engineering by T.K. Naggarkar& Ms. Sakhija Seventh Edition 2008, Oxford
University Press.
5 Electronic Devices and Circuit Theory, Boylestad R.L. VIII Edition, Pearson Education, 2008.
6 Electronic Fundamentals & Application, J.D. Ryder, PHI, 2006.
7 Experiments in Electrical Engineering by Bhatnagar US; Asia Publishing House, Bombay.
31

CSA1: B.TECH. (COMPUTER SCIENCE & ENGINEERING) SEMESTER– II

(Credit Based Evaluation and Grading System)

Course Name : Fundamentals of Information Technology and Programming

using Python
Course Code : CSL 126
Credits (L-T-P) : 4 (2-1-1)
Total Marks : 100
Mid Semester Examination : 30% weightage
End Semester Examination : 70% weightage

Internal Marks: 30 External Marks: 70

Course Objectives:
At the end of this course, the student should be able to understand the basics of computer as well as
programming. The students are able to write programs. This course introduces computer programming
using the Python programming language. Emphasis is placed on common algorithms and
programming principles utilizing the standard library with Python.
Total No. of Lectures –40

Lecture wise breakup Number

SECTION - B
Algorithm and Flowchart, Introduction to Python and Setting up the Python 10
development environment, Basic syntax, interactive shell, editing, saving, and
running a script, Concept of data types, Random number, Real numbers,
2 immutable variables, Python console Input / Output. Arithmetic operators and
expressions, Conditions, Comparison operators, Logical Operators, Is and In
operators, Control statements: if-else, Nested If-Else, Loops (for, while)

SECTION - C
Built in function and modules in python, user defined functions, passing 10
parameters, arguments and return values; formal vs actual arguments, Recursion,
3 lists, Common List operations
SECTION - D
32

String Handling, Unicode strings, Strings Manipulation:-compare strings, 10

concatenation of strings, Slicing strings in python, converting strings to numbers
and vice versa. Strings and text files; manipulating files and directories, os and
4 sys modules; text files: reading/writing text and numbers from/to a file; creating
and reading a formatted file (csv or tab-separated).

Course Outcomes:
Implement a given algorithm as a computer program in python language with the understanding
1
of hardware components and memory utilization.
Able to use standard programming constructs: repetition, selection, functions, composition,
2 modules and different data types
Adapt and combine standard algorithms to solve a given problem (includes numerical as well as
3 non-numerical algorithms) and to debug the program written in python language

Suggested / Reference Books:

1 Computers Today by Sanders.
2 Fundamentals of Computers TTTI Publication.
3 Learning Python by Mark Lutz, 5th edition
4 Python cookbook, by David Beazley , 3rd Edition
5 Python Essential Reference, by David Beazley , 4th edition
6. Python in a Nutshell, by Alex Mortelli, 2nd Edition.
7 Python programming: An Introduction to computer science, by John Zelle, 2nd Edition.

1.
33

CSA1: B.TECH. (COMPUTER SCIENCE & ENGINEERING) SEMESTER– II

(Credit Based Evaluation and Grading System)

Course Name : Communicative English

Course Code : ENL-101
Credits (L-T-P) : 2 (2-0-0)
Total Marks : 100
Mid Semester Examination : 30% weightage
End Semester Examination : 70% weightage

Internal Marks: 30 External Marks: 70

Course Objectives:
To introduce students to the skills and strategies of reading and writing by identifying organizational
patterns, spotting classification systems and understanding associations between ideas. This course will
prepare students to read a variety of texts and also to communicate more effectively through writing. The
course will also pay special attention to vocabulary building.
Total No. of Lectures – 24

SECTION – C
Section 1 from Making Connections 6
3
SECTION – D
Section 2 from Making Connections 6
4
Course Outcomes:
By the end of this course, the reading skills of students improve and their proficiency level
1 increases. They are also able to comprehend complex ideas.
The students become more proficient in written communication and are able to use a variety of
2 words for diverse requirements.
34

Suggested / Reference Books:

1 A Strategic Approach to Academic Reading by Kenneth J. Pakenham, Second Edition.
2 The Written Word by Vandana R. Singh
35

CSA1: B.TECH. (COMPUTER SCIENCE & ENGINEERING) SEMESTER– II

(Credit Based Evaluation and Grading System)

Course Name : Manufacturing Practices

Course Code : MEP-102
Credits (L-T-P) : 1 (0-0-1)
Total Marks : 100
Mid Semester Examination : 30% weightage
End Semester Examination : 70% weightage

Internal Marks: 30 External Marks: 70

Course Objectives:
At the end of this course, the student should be able to understand the
1. Understand applications of hand tools and power tools.
2. Understand the operations of machine tools.
3. Select the appropriate tools required for specific operation.
4. Comprehend the safety measures required to be taken while using the tools.

Total No. of Practicals – 24

Number
of
Lecture wise breakup
Practicals

SECTION - A
Carpentry Shop:

(a) Study of tools & operations and carpentry joints.

1 (b) Simple exercise using jackplane. 3
(c) To prepare half-lap corner joint, mortise & tennon joints.
(d) Simple exercise on wood working lathe.

Fitting (Bench Working) Shop:

(a) Study of tools & operations

2 (b) Simple exercises involving fitting work. 3
(c) Make perfect male-female joint.
(d) Simple exercises involving drilling / tapping / dieing.
SECTION - B
Black Smithy Shop:

(a) Study of tools & operations

3 3
(b) Simple exercises based on black smithy operations such as upsetting,
drawing down, punching, bending, fullering & swaging.
36

Welding Shop:

(a) Study of tools & operations of Gas welding & Arc welding.
4 (b) Simple butt and Lap welded joints. 3
(c) Oxy-acetylene flame cutting.

SECTION - C
Sheet-metal Shop:

5 (a) Study of tools & operations.

(b) Making Funnel complete with soldering. 3
(c) Fabrication of tool-box, tray, electric panel box etc.

Machine Shop:

(a) Study of Single point cutting tool, machine tools and operations.
6 (b) Plane turning. 3
(c) Step turning.
(d) Taper turning.
(e) Threading. SECTION - D
Foundry Shop:

(a) Study of tools & operations

7 (b) Pattern making. 3
(c) Mould making with the use of a core.
(d) Casting
Electrical and Electronics Shop: Study of tools & operations
8 3

Course Outcomes:
1 To acquire skills in basic engineering practice, measuring skills and practical skills in the trades.
2 To provides the knowledge of job materials in various shops.
3 To identify the hand tools and instruments.
To provides the knowledge of core technical subjects for making and working ofany type of
4 project.
Understand modern manufacturing operations, including their capabilities, limitations, and how
5 to design economically.
Gain insight into how designers influence manufacturing schedule and cost, and cost of
6 different components.
Learn how to analyze products and be able to improve their manufacturability and make the
7
cost effectively.

Suggested / Reference Books:

1 Lab Manual to be provided by Department of Mechanical Engineering
2 Work shop technology by Hajraand Chaudhary
3 Work shop technology by Chapmen
37

CSA1: B.TECH. (COMPUTER SCIENCE & ENGINEERING) SEMESTER– II

(Credit Based Evaluation and Grading System)

Course Name : Punjabi Compulsory-II

Course Code : PBL-131
Credits (L-T-P) : 2 (2-0-0)
Total Marks : 100
Mid Semester Examination : 30% weightage
End Semester Examination : 70% weightage

Internal Marks: 30 External Marks: 70

Course Objectives:
At the end of this course, the student should be able to understand the

Total No. of Lectures –24

Lecture wise breakup Number

r[o{ BkBe d/t :{Bhtof;Nh, nzfwqs;oftu' j/m fby/ ejkDheko L

(T) BkBef;zx L G{nk
(n) r[ow[y f;zx w[;kfco L pkrh dh Xh
1
(J) ;zsf;zx ;/y' L g/wh d/ fBnkD/
(ejkDhekodkihtB, ejkDh ;ko, ftFk-t;s{, ejkDhebk)
II. gzikphFpdpDso L Xks{$w{b, tX/so (nr/so, fgS/so, ftT[sgs
ns/ o[gKsoh), ;wk;.
SECTION - B
I. d' ozr(;zgkHjofizdof;zxfY`b', gqhswf;zx ;or'Xhnk) 6

r[o{ BkBe d/t :{Bhtof;Nh, nzfwqs;oftu' j/m fby/ ejkDheko L

2 (T) ;[ikBf;zx L pkrKdkokyk
(n) eoskof;zx d[`rb L s? eh dodBknkfJnk
(ejkDhekodkihtB, ejkDh ;ko, ftFk-t;s{, ejkDhebk)
II. g?oQkouBk L ebk; ftu 10 ftfFnK (;fGnkuko, Xkowe ns/
okiBhse) *s/ g?oQkouBk d/ nfGnk;
eotkT[D/.

SECTION - C
38

I. d' ozr(;zgkHjofizdof;zxfY`b', gqhswf;zx ;or'Xhnk) 6

3 r[o{ BkBe d/t :{Bhtof;Nh, nzfwqs;oftu' j/m fby/ ejkDheko L

(T) e[btzsf;zxftoe L Xosh j/mbkp"bd
(n) Bts/i f;zx L d{ihtko i/p e`NhrJh
(J) gq/w gqekF L b`Swh
(ejkDhekodkihtB, ejkDh ;ko, ftFk-t;s{, ejkDhebk)
II. w[jkto/ s/ nykD (nykD s/ w[jktoke'Fftu) 200 w[jktfonK ns/ 100
nykDK ~ tkeKftutosDd/ nfGnk; eotkT[D/ (ebk; ftu s/ xo bJh).
SECTION - D
I. d' ozr(;zgkHjofizdof;zxfY`b', gqhswf;zx ;or'Xhnk) 6

r[o{ BkBe d/t :{Bhtof;Nh, nzfwqs;oftu' j/m fby/ ejkDheko L

(T) nihse"o L p[`s fFeB
4 (n) dbhge"ofNtkDk L p`; ezveNo
(ejkDhekodkihtB, ejkDh ;ko, ftFk-t;s{, ejkDhebk)
II. FpdFq/DhnK L BKt, gVBKt, ftF/FD, fefonk, fefonkftF/FD,
;zpzXe
39

CSA1: B.TECH. (COMPUTER SCIENCE & ENGINEERING) SEMESTER– II

(Credit Based Evaluation and Grading System)

Course Name : Punjab History & Culture (1717-1947)

Course Code : HSL-102
Credits (L-T-P) : 2 (2-0-0)
Total Marks : 100
Mid Semester Examination : 30% weightage
End Semester Examination : 70% weightage

Internal Marks: 30 External Marks: 70

Course Objectives:
At the end of this course, the student should be able to understand the

Total No. of Lectures –24

Lecture wise breakup Number

3 6. Socio-Religious Reform Movements.

SECTION - D
7. Role of Punjab in the Freedom Struggle. 6
4
8. Fairs and Festivals.

Suggested / Reference Books:

1 Kirpal Singh (Ed.), History and Culture of the Punjab, Part-II, Punjabi University,

2 Patiala,Singh
Fauja 1990.(Ed.), History of Punjab, Vol, III, Punjabi University, Patiala, 1987.
3 J.S. Grewal, The Sikhs of the Punjab, Cup, Cambridge, 1991.
4 Khushwant Singh, A History of the Sikhs, Vol. I, OUP, New Delhi, 1990.
40

CSA1: B.TECH. (COMPUTER SCIENCE & ENGINEERING) SEMESTER– II

(Credit Based Evaluation and Grading System)

Course Name : Mudhli Punjabi

Course Code : PBL-132
Credits (L-T-P) : 2 (2-0-0)
Total Marks : 100
Mid Semester Examination : 30% weightage
End Semester Examination : 70% weightage

Internal Marks: 30 External Marks: 70

Course Objectives:
At the end of this course, the student should be able to understand the

Total No. of Lectures –24

Lecture wise breakup Number

SECTION - C
gzikphtke^pDso 6

3 ;kXkoB^tke (gSkD ns/ tos'A)

;z:[es^tke (gSkD ns/ tos'A)

fwPos^tke (gSkD ns/ tos'A) SECTION - D

g?oQkouBk 6
4
;zy/g ouBk
41

CSA1: B.TECH. (COMPUTER SCIENCE & ENGINEERING) SEMESTER– III

(Credit Based Evaluation and Grading System)

Course Name : DATA STRUCTURES & PROGRAMMING

METHODOLOGY
Course Code : CSL 231
Credits (L-T-P) : 4 (3-1-0)
Total Marks : 100
Mid Semester Examination : 30% weightage
End Semester Examination : 70% weightage

Internal Marks: 30 External Marks: 70

Course Objectives:
At the end of this course, the student should be able to understand the basics of algorithms as well as
data structures. The students are able to write algorithms. Students will learn some of the design
principles for writing efficient and optimized algorithm.

Total No. of Lectures –40

Lecture wise breakup Number

SECTION – B
Stacks: Introduction, operations, Arithmetic expression, Polish notations, 10
2 Transforming infix to postfix, Quick sort, Recursion concept, Tower of Hanoi.
Queues: Define Queues, Operations, Dequeues, Priority Queues.

SECTION – C
String Processing: Introduction, Basic terminology, Storing strings, String 10
operations, Word processing.
3 Linked List: Representation in memory, Traversing, Searching, Insertion,
deletion, Header Linked List, Two ways List: operations.
42

SECTION – D
Trees: Binary trees, Representation in memory, Traversing, Traversal algorithms 10
using stacks, Binary Search trees: Searching, Inserting and Deleting. Heap and
4 Heap sort.
Graphs: Graph Theory Terminology, Sequential Representation, Warshall’s
Algorithm, Linked Representation, Traversing a graph, Hashing.

Course Outcomes:
Comprehend concepts related to write algorithms/pseudo code.
1
Design programs involving decision control statements, loop control statements, case control
2 structures, arrays, strings, stacks, queues using array and linked list , tree structure
implementation using pointers, use of dynamics memory allocation
Comprehend the concepts of linear and Non-Linear data structures
3

Suggested / Reference Books:

1 Seymour Lipschutz : Theory and Problems of Data Structures, Schaum’s Outline Series
2 Aho A. V. J. E. Hopcroft, J.D. Ullman; Data Structures and Algorithms, Addison–Wesley,
3 Baase, S Computer Algorithms; Introduction to Design and Analysis, Addison – Wesley,
1983.
4 Berztiss, A. T.: Data Structures, Theory and practice: 2nd ed., Academic Press, 1977.
1978
5 Collins, W.J. Data Structures, An Object–Oriented Approach, Addison – Wesley, 1992.
6. Goodman, S.E., S.T.Hedetniemi: Introduction to the Design and Analysis of Algorithms,
7. Horowitz, E.S. Sahni: Algorithms: Design and Analysis, Computer Science Press, 1977.
8. McGraw Hill,
Kunth, D.E. The1977.
Art of Computer Programming. Vols. 1–3, Addison – Wesley, 1973
9. .
Kurse, R.L. Data Structures and Program Design, 2nd Ed., Prentice Hall, 1987.
10. Lorin, H.: Sorting and Sort Systems, Addison – Wesley, 1975.
2.
11. Standish, T.A.: Data Structure Techniques, Addison – Wesley, 1980.
12. Tremblay, J.P., P.G. Sorenson: An Introduction to Data Structures with Applications, McGraw
Hill, 1976.
13. Wirth, N.: Algorithms + Data Structures = Programs, Prentice Hall, 1976
43

CSA1: B.TECH. (COMPUTER SCIENCE & ENGINEERING) SEMESTER– III

(Credit Based Evaluation and Grading System)

Course Name : PROGRAMMING IN C++

Course Code : CSL 126
Credits (L-T-P) : 2-1-1
Total Marks : 100
Mid Semester Examination : 30% weightage
End Semester Examination : 70% weightage

Internal Marks: 30 External Marks: 70

Course Objectives:
At the end of this course, the student should be able to understand the difference between structures as
well as object oriented programming. The students are able to write the programs in C++ and also able
to use the various data types to solve the data structure problems. Emphasis is placed on the dynamic
memory allocation in C++ and the storage of data on external drives.
Total No. of Lectures –40

Lecture wise breakup Number

of
Lectures
Note: Eight questions are to be set by selecting two questions from each section. Each question is
divided in subsections (not exceeding 4). The candidates are required to attempt five questions by
selecting one question from each section and the fifth question can be attempted from any section.
All questions carry equal marks.
SECTION - A
Difference between C, C++ and VC++., Classes and Objects; Access 10
Specifiers, , Brief introduction to data types, operators and control statements
1 in C++. Advanced preprocessor statements, Features of C++, I/O statements in
C++, Manipulators, Arrays and Strings.
SECTION - B
Function Overloading, Inline Functions, Friend Functions and Friend Class. 10
2 Constructors & Destructors: Types of Constructors.

SECTION - C
Inheritance, Types of Inheritance, Ambiguity in Inheritance. Polymorphism: 10

3 Virtual Functions, Pure virtual Functions, Operator Overloading.

SECTION - D
Pointers, Array of pointers. Dynamic memory allocation in C++.File handling 10
4 in C++, Templates and Exception Handling.
44

PROGRAMMING LANGUAGES LAB:

Students should be asked to write programs in C++ using different statements, Libraries and
Functions, Designing Unique Manipulators for the development of program in all areas of data
structures covered in the course. Emphasis should be given on development of recursive as well
as non-recursive algorithms involving arrays, string handling, stacks and queues, linked list
trees and graphs. Use of pointers for dynamic memory allocation

Suggested Books

1 Object Oriented programming in C++ - Robert Lafore

2 Programming ANSI and TURBO C++ - Kamdhane

3 Let Us C++ - YashwantKanetkar

4 The C++ Programming Language - BjarneStroustrup

Course Outcomes:
Implementation of both the static and dynamic programming used un various application of
1
computers
Understanding of low level programming approach and its implementation
2

Implementation of data structure using C++

3
45

CSA1: B.TECH. (COMPUTER SCIENCE & ENGINEERING) SEMESTER–III

(Credit Based Evaluation and Grading System)

Course Name : DIGITAL CIRCUITS AND LOGIC DESIGN

Course Code : ECL-291
Credits (L-T-P) : 4 (3-0-1)
Total Marks : 100
Mid Semester Examination : 30% weightage
End Semester Examination : 70% weightage

Internal Marks: 30 External Marks: 70

Course Objectives:
This course is aimed to introduce important initial understanding of digital electronics electrical and
electronics engineering to the 1st year students, this will act as the foundation for the advanced
electronics courses. The aim of this course is to familiarize the students to the basics of electricity,
electrical machines and the basics of electronic devices. so that they can use this knowledge in relevant
applications. Total No. of Lectures –40

SECTION – B
Minimization of logic functions. Sum of Products (SOP), Product of
Sums (POS), minterm, maxterm. Digital Circuit Technologies: RTL /
2 DTL / DCTL / TTL / MOS / CMOS / ECL, analysis of basic circuits in 10
these families. Comparison of logic families.

SECTION – C
Combinational circuit design, Adder, Subtractor, Encoder, Decoder,
Multiplexer, Demultiplexer.
3 10
Sequential circuits: flip–flops, counters, shift registers, State diagram for
sequential circuits.
46

SECTION – D
A/D and D/A conversion techniques. Memory system – RAM, ROM,
EPROM, EEPROM, PLDs, PAL, PLA, PGAs. Introduction to VLSI 10
4 Design.

Practical’s
1 Realization of selected circuits using TTL and MOS components.
2 Familiarization with CAD design tools.

3 Design exercises using EPLDs and FPGAs.

4 Compare two six bit numbers and display the larger number on seven segment display.

5 Design a mod – 7 counter. Generate a pulse for every 1 ms.

6 Use 2 to 1 Mux and implement 4 to 1 Mux.
7 Pattern recognizer.
8 4 bit ALU.
9 Serial to parallel shifter and parallel to serial shifter.
10 Priority resolver.
11 Binary to gray code converter.
12 Traffic light controller.
13 Pattern Generator.

Course Outcomes: After study of this subject the student will become

1 Familiar with the electricity production, distribution and the use of control/protection devices.

2 Able to understand the working and applications of electrical machines.

3 Able to understand the basics of semiconductor devices and their applications.

4 Familiar to the concept of rectification and filtration circuits.

5 Able to analyze the basic DC and AC circuits and to solve related circuit problems.

Suggested / Reference Books:

1 Morris Mano, Digital Design– Prentice Hall of India Pvt. Ltd., New Delhi, 1992.
2 Jesse H.Jenkins, Designing with FPGAs and CPLDs, PTR Prentice Hall, Englewood Cliffs, New
Jersy, 1994.
3 H.Taub& D. Schilling, Digital Integrated Electronics. McGraw Hill, 1977.
47

4 Douglas L. Perry, VHDL, McGraw Hill, Inc. 2nd Edition, 1993.

5 Mead and L. Conway, Introduction to VLSI Systems, Addition Wesley, 1979.

CSA1: B.TECH. (COMPUTER SCIENCE & ENGINEERING) SEMESTER– III

(Credit Based Evaluation and Grading System)

Course Name : WRITTEN & ORAL TECHNICAL

COMMUNICATION (Communication Skills for
Course Code : Scientists
ENL–201 and Engineers)
Credits (L-T-P) : 4 (2-1-1)
Total Marks : 100
Mid Semester Examination : 30% weightage
End Semester Examination : 70% weightage

Internal Marks: 30 External Marks: 70

Course Objectives:
At the end of this course, the student should be able to understand the basics of technical report
writing as well as able to give presentation. Students are able to prepare their resume and presentation.

Total No. of Lectures –40

Lecture wise breakup Number

SECTION - B
Slide preparation and oral presentation principles 10
2 Written presentation of technical material

SECTION - C
Preparation of Bibliography 10

3 Basics of Official Correspondence

SECTION - D
Preparation of bio–data

Prepare and present Seminars

Practical’s
Students should be asked to prepare Technical Presentation on the emerging areas of Information
Technology and present the same to the group of Students.

Course Outcomes:
1 Technical Report Writing

2 Know about the preparation of technical presentation and the way to deliver the seminar

3 Enhance the technical writing skills

Writing of resume and preparation for interviews

Suggested / Reference Books:

th
1 The Chicago Manual of Style, 13 Edition, Prentice Hall of India 1989
2 Gowers Ernest, “The Complete Plan in Words” Penguin, 1973.
3 Menzel D.H., Jones H.M., Boyd, LG., “Writing a Technical Paper”, McGraw Hill, 1961.
rd
4 Strunk, W., & White E.B., “The Elements of Style:, 3 Edition, McMillan, 1979.
5 Turbian K.L., “A Manual for Writers of Term Papers, Thesis and Dissertations” Univ. of
6. IEEE Transactions on “Written
Chicago Press, 1973. and Oral Communication” has many papers.
50

CSA1: B.TECH. (COMPUTER SCIENCE & ENGINEERING) SEMESTER– III

(Credit Based Evaluation and Grading System)

Course Name : Mini Project

Course Code : CSP 234
Credits (L-T-P) : 4 (0-0-4)
Total Marks : 100

Course Objectives:
At the end of this course, the student should be able to understand the Design / Fabrication /
Implementation work under the guidance of faculty member. The students have an exposure to work in a
group and to understand the working of IT industry.

Guidelines
A candidate should work on the Mini Project in the Campus under the guidance of their guide

Examination Credits
Final Project Final Project Report & Viva Voce of 4 credits 4
Report

The evaluation shall be done as per the common ordinances for courses
Credit Based Evaluation and Grading System.
51

CSA1: B.TECH. (COMPUTER SCIENCE & ENGINEERING) SEMESTER – IV

(Credit Based Evaluation and Grading System)

Course Name : Operating System

Course Code : CSL 240

Credits (L-T-P) : 4 (2-1-1)
Total Marks : 100
Mid Semester Examination : 30% weightage
End Semester Examination : 70% weightage

Internal Marks: 30 External Marks: 70

Course Objectives:
At the end of this course, the student should be able to understand the basics of operating systems as
well as its various types. The students are able to write programs in C/C++ languages. This course
introduces operating systems using the Windows/Linux/DOS. Emphasis is placed on common
algorithms and programming principles utilizing the standard library with TurboC3.
Total No. of Lectures –40

Lecture wise breakup Number

SECTION - B

Resource allocation graph, Deadlocks: Deadlock Avoidance and Deadlock 10

Handling
2
Process Synchronisation: Race Condition, Critical Section, Semaphores,
Classical problems of synchronization, Monitors
SECTION - C
52

Memory Management: External fragmentation, Internal fragmentation, 10

Compaction, Paging, Segmentation, Virtual memory, Demand paging.
3 Device Management: Dedicated devices, shared devices, virtual devices,
channels, I/O traffic controller, I/O scheduler, I/O Device handlers.
SECTION - D
Disk Scheduling: FCFS, SSTF, SCAN, C–SCAN, N–Stop Scan 10

4 Introduction to Multiprocessor and Distributed Operating Systems

Case Studies: Windows 8x/XP/2000, UNIX, LINUX to be discussed briefly.

Course Outcomes:
1 Implement the different scheduling algorithms.

2 Implement the Banker's algorithm.

3 Implement the different memory management techniques ((First Fit, Best Fit, Worst Fit).
Implement the different disk management techniques (FCFS, SSTF, LOOK, SCAN, C-LOOK,
4
C-SCAN).

Suggested / Reference Books:

1 Peter B. Galvin, A. Silberchatz: Operating System Concepts, Addison Wesley, 6thEdi., 2003.
2 A.S. Tenenbaum: Operating System: Design and Implementation PHI, 1989.
3 Madnick and Donovan: Operating System, McGraw Hill, 1973.
4 P.B. Henson: Operating System Principles, Prentice Hall, 1973.
5 P.B. Henson: Architecture of concurrent programs, Prentice Hall, 1977.
6. A.C. Shaw: Logic Design of operating System, Prentice Hall, 1974.
7 3. M.J. Bach: Design of UNIX Operating system, PHI, 1986.
53

CSA1: B.TECH. (COMPUTER SCIENCE & ENGINEERING) SEMESTER – IV

(Credit Based Evaluation and Grading System)

Course Name : DATA COMMUNICATION

Course Code : CSL–241
Credits (L-T-P) : 4 (3-0-1)
Total Marks : 100
Mid Semester Examination : 30% weightage
End Semester Examination : 70% weightage

Internal Marks: 30 External Marks: 70

Course Objectives:
This course is designed to enlighten the students with the Data Communication. The students are able
to learn about LAN Standards and network devices. The various routing algorithms are highlighted.
This course introduces concept of cryptography and data compression.

Total No. of Lectures –40

Lecture wise breakup Number

SECTION - A
OSI Reference Model, Concepts of layer, protocols, layer interfaces; TCP/IP 10
Model. Network topologies, LAN, MAN, WAN.

Transmission Media: Twisted pair, coaxial cables, fibre–optics cables.

1
Wireless Transmission: Electromagnetic spectrum, Radio transmission,
Microwave Transmission, Infrared, and Millimeter Waves, Lightwave
Transmission.
SECTION - B
Error Detection and correction, sliding window protocols, Multiple Access 10
protocols: ALOHA, CSMA/CD

2 LAN standards: Ethernet, Wireless LAN Standards , Bluetooth Architecture

Repeaters, Hubs, Bridges, Switches, Routers, Gateways

SECTION - C
Virtual Circuits and datagrams, Routing Algorithms, Congestion Control 10

3 Algorithms. Internetworking. Elements of Transport Protocol

SECTION - D
Fundamental of Data Compression Techniques and Cryptography. 10

4 Domain Name System, Electronic Mail, FTP, Worldwide web (WWW), IPv4,
IPv6

Course Outcomes:
Students have hands on practice for preparing cross cable & straight cable using various
1 communication media.

Students have in depth knowledge of simulating and implementing various routing algorithms.
2

Students have comprehensive awareness of various servers (DHCP, Proxy and FTP)
3

Students thoroughly learn about the networking using various topologies.

Suggested / Reference Books:

1 Tannanbaum, A.S. : Computer Networks, Prentice Hall, 1992 2nd Ed.

2 Tannanbaum, A.S. : Computer Networks, Prentice Hall, 1992 3rd Ed.

3 Stallings, William : Local Networks : An introduction Macmillan Publishing Co.
4 Stallings, William : Data & Computer Communication Macmillan Publishing Co.
5 Black : Data Networks (PHI) 1988.

Practical’s
Students should be asked to prepare the LAN Cables, Implementation of Structure Cabling, and
Configuration of switches, router, and other network devices. Writing Program in C++ to
implement various networking algorithms.

CSA1: B.TECH. (COMPUTER SCIENCE & ENGINEERING) SEMESTER – IV

(Credit Based Evaluation and Grading System)

Course Name : Discrete Structures

Course Code : CSL 244
Credits (L-T-P) : 4 (3-1-0)
Total Marks : 100
Mid Semester : 30% weightage
Examination
End Semester : 70% weightage
Examination

Internal Marks: 30 External Marks: 70

Course Objectives:
At the end of this course, the student should be able to understand the basics of Discrete
Structures. The students are able to understand the Groups, Rings, Graph, Lattices and
Boolean algebra, Recurrence Relations and Generating Functions.

Total No. of Lectures –40

Lecture wise breakup Number

SECTION – A
Groups and Rings: Groups, monoids, and Submonoids, Semigroup, 10
Subgroups and Cosets. Congruence relations in semigroups. Morphisms.
1 Normalsubgroups. Cyclic groups, permutation groups, dihedral groups, Rings,
subrings, morphism of rings, ideals and quotient rings.

SECTION – B
56

Graph Theory: Graphs and Multigraphs, Subgraphs, Isomorphic and 10

Homomorphic Graphs, Paths, Connectivity, Bridges of Konigsberg,
Traversable Multigraphs, Labeled and Weighted Graphs, Complete, regular and
Bipartite Graphs, Tree graphs, Planar Graphs, Graph Colorings, Representing
Graphs in Computer Memory. Directed Graphs: Sequential Representation of
2 Directed Graphs, Warshall’s Algorithm, Shortest Paths, Linked Representation
of Directed Graphs, Rooted Trees, Graph Algorithms, Depth–first and
Breadth–first searches, Directed Cycle–Free Graphs, Topological Sort, Pruning
Algorithm for Shortest Path. Binary Trees: Complete and Extended trees,
Representing trees in memory, Traversing trees, Search trees, Heaps, path
Lengths, Huffman’s Algorithm.
SECTION – C
Lattices and Boolean algebra: Partially ordered sets, lattices and its 10
properties, lattices as algebraic systems, sub–lattices, direct products,
Homomorphism, some special lattices (complete, complemented, distributive
3 lattices). Boolean algebra as lattices, Boolean identities, sub–algebra, Boolean
forms and their equivalence, sum of product, product of some canonical forms.
SECTION – D
Recurrence Relations and Generating Functions: Polynomial expressions, 10
4 telescopic form, recursion theorem, closed form expression, generating function,
solution of recurrence relation using generating function

Course Outcomes:
1 Understand the basics of Discrete Structures.
Understand the concepts of Groups, Rings, Graph, Lattices and Boolean algebra,
2
Recurrence Relations and Generating Functions.

Suggested / Reference Books:

1 Trambley, J.P. and Manohar,R: Discrete Mathematical Structures with Applications to
Computer Science.
2 Liu C.L.: Elements of Discrete Mathematics.
3 Alan Doerr and Kenneth Levasseur: Applied Discrete Structures for Computer Science
4 NarsinghDeo: Graph Theory.
5 Lipschutz, S. and Lipson, M.: Discrete Mathematics (Schaum’s outlines series).
57

CSA1: B.TECH. (COMPUTER SCIENCE & ENGINEERING) SEMESTER – IV

(Credit Based Evaluation and Grading System)

Course Name : System Programming

Course Code : CSL 243
Credits (L-T-P) : 4 (3-1-0)
Total Marks : 100
Mid Semester Examination : 30% weightage
End Semester Examination : 70% weightage

Internal Marks: 30 External Marks: 70

Course Objectives:
This course is introduced to enlighten the students about various system software, their roles and
working, their design and implementation algorithms. The main software focussed are assemblers,
compilers, loaders and linkers, Macro-processors, editors and debuggers.
Total No. of Lectures –40

Lecture wise breakup Number

SECTION - A
Introduction: Foundations of System Programming, General Machine 10
Structure, Simplified Machine Architecture & its components, System software
& its components.
1 Assemblers: Low Level Languages, Basics of an assembly language,
instructions & Basic elements, Types of Statements & format, Assembler & its
design, Pass structure of assemblers, Design of two pass assembler.
SECTION - B
Macro Processors: Introduction, Macro definition & expansion, Arguments in 10
Macros, Concatenation of Macro Parameters, Generation of unique labels,
2 Conditional Macro Expansion, Nested macros, Macros Defining Macros,
Macro processor Design, Two pass & single pass macro processor,
implementation within an assembler.
SECTION - C
Loaders& Linkers: Introduction, Basic Loader Functions, Loader Schemes, 10
Design of an absolute Loader, Relocating Loaders, Design of a linking loader,
3 Linkage Editors & its functions, Dynamic Linking, Bootstrap Loader.
58

SECTION - D
Introduction to Compilers: Introduction, Compiler Design & its Phases, 10
Lexical analysis, Parsing, storage Management, Intermediate code generation,
Code Optimization & Generation, interpreters, Incremental compilers, Cross &
4 P-code compilers.

Editors & Debuggers: Introduction to a text editor & its types, Interactive
debugging systems

Course Outcomes:
1 The students should be able to understand the execution process of HLL programs.

2 Increase students’ awareness about the working of scanners and parsers

3 Students understand the basic design and implementation of various system software.

Suggested / Reference Books:

1 Barron D.W., Assemblers and Loaders, 2/e New York, Elsevier, 1972.
2 Beck L.L., Systems Software: An Introduction to Systems Programming, Addison–
3 Wesley, 1985.
Calingaret, P, Assemblers, Compilers and Program Translation Rockville, MD, Computer
4 Science Press,
Donovan 1979 Programming, New York, McGraw Hill, 1972.
J.J., Systems
5 Groslinc G.W., Assembly and Assemblers, The Motorola 68000 Family, Prentice Hall,
Englewood Cliffs, 1988.
59

CSA1: B.TECH. (COMPUTER SCIENCE & ENGINEERING) SEMESTER – IV

(Credit Based Evaluation and Grading System)

Course Name : Computer Architecture

Course Code : CSL 245

Credits (L-T-P) : 4 (3-1-0)
Total Marks : 100
Mid Semester Examination : 30% weightage
End Semester Examination : 70% weightage

Internal Marks: 30 External Marks: 70

Course Objectives:
At the end of this course, the student should be able to understand the basics of computer Architecture.
The subject explores how machines are designed, built, and operate. The students will get familiar
with CPU Architecture, Programming & controlling the basic computer. Emphasis is placed on
memory organization and I/O Organization.
Total No. of Lectures –40

Lecture wise breakup Number

SECTION - A
Basic computer Organisation and design: Register Transfer language & 10
operations, various Arithmetic, Logic & Shift microoperations instructions, codes,
1
computer registers, instructions, timing & control, instruction cycle, design of a
complete basic computer & it’s working.
SECTION - B
Programming & controlling the basic computer: Machine & Assembly Language, 10
hardwired & Microprogrammed control, Design of a control unit.
2 CPU Architecture: General register & stack organization, instruction formats and
addressing modes, ALU & Control unit architecture.

SECTION - C
60

Memory Organisation: Memory hierarchy, main, auxiliary, cache 10

memory, virtual memory paging and segmentation.

I/O Organization: Peripheral Devices, input-output interface, Modes of

3
data transfer programmed & interrupt initiated I/O, DMA, I/O Processors.

SECTION - D
Parallel & Multiprocessing Environment: Introduction to parallel 10
processing, pipelining, RISC Architecture, vector & array processing,
4
Multiprocessing concepts, memory & resource sharing, interprocessor
communication & synchronization.

Course Outcomes:
1 Students got detailed information of registers, operations, instructions.

Students got in depth knowledge of different types of memories along with concept of paging and
2 segmentation
The course will conclude with a look at the recent switch from sequential processing to parallel
3
processing by looking at the parallel computing models and their programming implications.

Suggested / Reference Books:

1 Morris Mano: Computer System Architecture, PHI
2 Hayes J.P.: Computer Architecture &Organisation, McGraw Hill.
3 Stone: Introduction to Computer Architecture: Galgotia.
4 Tanenbaum: Structured Computer Organisation, PHI.
61

CSA1: B.TECH. (COMPUTER SCIENCE & ENGINEERING) SEMESTER– V

(Credit Based Evaluation and Grading System)

Course Name : System Analysis & Design

Course Code : CSL-330

Credits (L-T-P) : 4(3-1-0)
Total Marks : 100
Mid Semester Examination : 30% weightage
End Semester Examination : 70% weightage

Internal Marks: 30 External Marks: 70

Course Objectives:
At the end of this course, the student should be able to understand the concepts of different types of
system involved and how to create the project report during the six months training. This course
introduces the analysis and design methodologies which is feasible, cost effective and risk manageable
along with security measures for any software project. Case studies are the key aspects covered during
every phase of software.
Total No. of Lectures –40

Lecture wise breakup Number

SECTION - B
System planning and initial investigation, information gathering tools, 10
2 Feasibility Study and its importance , Cost Benefit Analysis.

SECTION - C
Introduction, Methodology, Tools for structured design- Data Flow Diagrams, 10
Flowcharts, Structure Charts, Decision Tree, Decision Table, Structured
English, Data Dictionary.
3 Test Plan, Activity network for system testing. Implementation &Maintenance,
Documentation Tools used in SDLC.
62

SECTION - D
Introduction, Threats to System, Control Measures, Disaster Recovery, Audit 10
Trails, Risk Management
4 Case Studies: Library Management System, University Management System,
Health Care Management System

Course Outcomes:
Concept of Management Information System, Decision Support System , Role of Analyst using
1
different case study is involved
Able to create own documentation or report after completing any project/ training
2

Different design methodologies such as Data Flow Diagram, Decision Tree, Table and many
3 more use to show the implementation into more impressive way.

Suggested / Reference Books:

1 “Elements of System Analysis” – Marvin Gore and John W. Stubbe, 2003.
2 “System Analysis and Design” – Thapliyal M.P., 2002.
3 “Modern Systems Analysis & Design” – Hoffer, George and Valacich, 2001.
4 “SSAD: System Software Analysis and Design” – Mehta Subhash and Bangia
5 “Understanding Dynamic System: Approaches to Modelling, Analysis and Design”
Ramesh,1998.
6. “System Analysis and Design” – Perry Edwards, 1993.
Dorny C. Nelson, 1993.
7 “Systems Analysis and Design” – Elias M. Awad, 1993.
8. “Analysis
1.
and Design of Information Systems” – James A. Senn, 1989.
63

CSA1: B.TECH. (COMPUTER SCIENCE & ENGINEERING) SEMESTER– V

(Credit Based Evaluation and Grading System)

Course Name : RELATIONAL DATABASE MANAGEMENT SYSTEMS

Course Code : CSL–332

Credits (L-T-P) : 4 (3-0-1)
Total Marks : 100
Mid Semester Examination : 30% weightage
End Semester Examination : 70% weightage

Internal Marks: 30 External Marks: 70

Course Objectives:
This course is designed to enlighten the students about the database concepts and its practical
implementation using MySQL or Oracle . The students are able to implement SQL Commands, SQL
queries and PL/SQL concepts using MYSQL or Oracle. This course introduces implementation using
MySQL Workbench and MYSQL Server. Emphasis is placed on the advanced database concepts and
SQL queries utilizing the MYSQL.
Total No. of Lectures –40

Lecture wise breakup Number

of
Lectures
Note: Eight questions are to be set by selecting two questions from each section. Each question is
divided in subsections (not exceeding 4). The candidates are required to attempt five questions by
selecting one question from each section and the fifth question can be attempted from any section.
All questions carry equal marks.
SECTION - A
Introductory Concepts: Database, Database Management System (DBMS), 10
Advantages and Disadvantages of DBMS, Database System Structure, DBA
and responsibilities of DBA.
1 Three level ANSI–SPARC Architecture Schemas, Mapping, instances and
Database Independence, Entity–Relationship Model, Relational Data Model,
Keys, Integrity Constraints, Relational Algebra, Relational Calculus.

SECTION - B
SQL: Introduction, Data Definition Language (DDL), Data Manipulation 10
Language (DML),Data Control Language (DCL) statements, Views, Sub–
2 queries, Access Rights, Indexes

Normalization: Purpose of Normalization, 1NF, 2NF, 3NF, BCNF.

SECTION – C
Query Optimization: Introduction of Query Processing, Heuristic Approach to 10
Query Optimization, Cost Estimation, Pipelining.

Advanced SQL: Introduction, Comparison of SQL, PL-SQL, T-SQL and

3
NoSQL, Creating Stored Procedures and Functions, User-defined functions
with parameters, Triggers, Cursor Management

SECTION - D
Transaction Management and Concurrency Control : Introduction to 10
Transaction Processing, Properties of Transactions, Serializability and
Recoverability, Need for Concurrency Control, Locking Techniques, Time
4 stamping Methods, Optimistic Techniques and Granularity of Data items.

Database Recovery of database: Introduction, Need for Recovery,

Transactions and Recovery, Recovery Facilities, Recovery Techniques.

Database
Course Security: Introduction, Threats, Counter Measures
Outcomes:
Students will get the enormous knowledge about the various concepts of databases such as
1 Architecture of Database System, Data Models, Relational Algebra and Relational Calculus.

Learn and apply MYSQL on the database concepts using different SQL Commands
2

Implement advanced SQL concepts using MYSQL or Oracle

Students will get the vast knowledge about the Transaction Management and Concurrency
4. Control and Database Recovery and Security concepts

Suggested / Reference Books:

1 Ivan Bayross, “SQL/PLSQL: The Programming Language of Oracle, 3 rdRevised Edition,
2 Elmarsi & Navathe, “Fundamentals of Database Systems” 4thEdition, 2004.
2006.
3 th th
C.J.Date
1. C.J.Date
“Introduction
“Introduction
to database
to database
system”,system”,
8 Edition,
8 Edition,
GalgotiaGalgotia
Publications,
Publications,
2004. 2004.
4 Connolly &Begg “Database Systems – A practical approach to design, Implementation and
rd
Management, 3 Edition, Pearson Education India, 2003.
5 th
Silberschatz, Korth, Sudershan “Database System Concepts” 4 Edition, McGraw
6 HillEducation,
Microsoft SQL2002
Server 2012 Step by Step, Microsoft Press, Patric LeBlanc
65

CSA1: B.TECH. (COMPUTER SCIENCE & ENGINEERING) SEMESTER– V

(Credit Based Evaluation and Grading System)

Course Name : DESIGN AND ANALYSIS OF ALGORITHM

Course Code : CSL-333
Credits (L-T-P) : 4 (3-1-0)
Total Marks : 100
Mid Semester Examination : 30% weightage
End Semester Examination : 70% weightage

Internal Marks: 30 External Marks: 70

Course Objectives:
The objective of the course is to teach techniques for effective problem solving in computing. It
covers good principles of algorithm design, elementary analysis of algorithms, and advanced data
structures.

Total No. of Lectures –40

SECTION - A
Introduction: Concept of Algorithm, Algorithm Specification, Performance
1
Analysis (Time and space complexities), Asymptotic Notations.
10
Divide and conquer: General Method, Binary Search, Finding the
Maximum and Minimum, Quick Sort, Selection of pivot element.
SECTION - B
Greedy Method: General Method, Knapsack Problem, Minimum Cost
Spanning Trees (Prim’s Algorithm, Kruskal’s Algorithm) and Single-Source
2
Shortest Path.
10
Dynamic Programming: General Method, Multistage Graphs, All Pairs
Shortest Paths, Single -Source Shortest Paths, Optimal Binary Search Tress,
0/1 Knapsack and Travelling Salesman Problem.
SECTION - C
Backtracking: General Method, 8-Queens Problem, Graph Coloring,
Subset-Sum Problem.
10
3 Branch-and-Bound: General Method, Travelling Salesman Problem,
Knapsack Problem, Assignment Problem
SECTION - D
66

Hard Problems: Basic Concepts, Nondeterministic Algorithms, Classes NP

– Hard and NP – Complete, NP–Hard Graph Problems (CNDP, DHC, TSP
and AOG).
4 10
Approximation Algorithms: Introduction, Absolute Approximation (Planer
Graph Coloring and NP–Hard Absolute Approximations), ε –
Approximations (Scheduling Independent Tasks and Bin Packing).
Course Outcomes:
Analyze the complexity of algorithms, to provide justification for the selection, and to
1
implement the algorithm in a particular context.
Apply various algorithmic design paradigms such as greedy, dynamic, backtracking etc.
2
to solve common engineering problems.
3 Identify basic properties of graphs and apply their algorithms to solve real life problems.
Demonstrate the application of algorithms and selection of appropriate data structures
4
under several categories such as string matching, randomized algorithms and genetic
algorithms.
Suggested / Reference Books:
1 Aho , Hopcroft and Ullman “The Design and Analysis of Computer Algorithms”, 2003.
2 Horowitz, S. Sahni, Sanguthevar Rajasekaran “Fundamentals of Computer Algorithms”,
2003.
3 R.G.Droomy, “How to Solve it by Computer”, Third Printing, 1989.
4 K. Mehlhorn, “Data Structures and Algorithms”, Vols. 1 and 2, Springer Verlag, 1984.
5 Python Essential Reference, by David Beazley , 4th edition
6. Purdom, Jr. and C. A. Brown, The Analysis of Algorithms, Holt Rinechart and Winston,
1985.
7 .D. E. Kunth, The Art of Computer Programming, Vols .I and 3, 1968, 1975.
1.
67

CSA1: B.TECH. (COMPUTER SCIENCE & ENGINEERING) SEMESTER– V

(Credit Based Evaluation and Grading System)

Course Name : Formal Languages & Automata Theory

Course Code : CSL 351
Credits (L-T-P) : 4 (3-1-0)
Total Marks : 100
Mid Semester Examination : 30% weightage
End Semester Examination : 70% weightage

Internal Marks: 30 External Marks: 70

Course Objectives:
At the end of this course, the student should be able to understand the basics and foundations of
computing systems, their mathematical representation using automata and their languages. The
students should also able to understand ambiguity problems and its solution. This course also
introduces furtherextensions and applications of formal languages by introducing advance topics.

Total No. of Lectures –40

SECTION - A
Operations on Languages: Automata and their Languages, The Equivalence
of the Automata, Minimization of Automata and the appropriate grammars. 10
1
Moore and Mealy Machines. Linear Grammars and regular Languages.
Regular Expressions Context Sensitive Languages.
SECTION - B
Unrestricted Languages: Context Free Languages: Derivation Graph and
2 Normal forms: The Chomsky & Griebach Normal Forms. The Kuroda Normal 10
Form. The Dyck Language.
SECTION - C
Closure properties of Language Classes, One sided Context Sensitive
Grammars;
3 Finite Pushdown Automata, 2-push down Automata and Turing Machines 10
Syntax Analysis: Ambiguity and the formal power Series, Formal Properties
of LL(k) and L.R.(k) Grammars.

SECTION - D
68

Derivation Languages: Rewriting Systems, Algebraic properties, Canonical

Derivations, Context Sensitivity.
4 10
Cellular Automata: Formal Language aspects, Algebraic Properties
Universality & Complexity Variants.

Course Outcomes:
Knowledge: Acquire a full understanding and frame of mind of Automata Theory as the basis of
all computer science languages design - Have a clear understanding of the Automata theory
1
concepts such as RE's, DFA's, NFA's, Turing machines, Grammar, halting problem, computability
and complexity.
Cognitive skills (thinking and analysis)
 Be able to design FAs, NFAs, Grammars, languages modelling, small compilers basics
2
 Be able to design sample automata
 Be able to minimize FA's and Grammars of Context Free Languages.
Professional Skill
3  Perceive the power and limitation of a computer
 Solve the problems using formal language
4 Attitude- Develop a view on the importance of computational theory.

Suggested / Reference Books:

1. K.L.P. Mishra, Theory of Computer Science: Automata, Languages and Computation, Prentice
Hall India Learning Private Limited (2006).
2. Jeffrey Ullman and John Hopcroft, Introduction to Automata Theory, Languages, and
Computation, 3e, Pearson Education India (2008).
3. Peter Linz, An Introduction to Formal Languages and Automata, 6/e, Jones & Bartlett (2016).
4. John Martin, Introduction to Languages and the Theory of Computation, McGraw-Hill Higher
Education (2007).
5. G.E. Reevsz, Introduction to Formal Languages, McGraw Hill, 1983.
6. M.H. Harrison, Formal Language Theory Wesley 1978.
7. Wolfman Theory and Applications of Cellular Automata, World Scientific, Singapore, 1986.
69

B.TECH. (COMPUTER SCIENCE & ENGINEERING) SEMESTER– V

(Credit Based Evaluation and Grading System)

Course Name : Programming in ASP.NET

Course Code : CSL–336

Credits (L-T-P) : 4 (2-1-1)
Total Marks : 100
Mid Semester Examination : 30% weightage
End Semester Examination : 70% weightage

Internal Marks: 30 External Marks: 70

Course Objectives:
This course is designed to enlighten the students about the .NET framework and its programming
concepts. The students are able to write programs using .NET framework. This course introduces
computer programming using the .NET framework and SQL Server database. Emphasis is placed on
the programming principles utilizing the .NET framework and SQL Server database.

Total No. of Lectures –40

Lecture wise breakup Number

Introduction to ASP.NET and .NET Framework,

ASP.NET Page Structure: Directives, Code Declaration Blocks, Code Render
Blocks, ASP.NET Server Controls, Server-side Comments, Literal Text and
HTML Tags,View State. ASP Programming Languages.
C# Programming Basics
1
Programming Basics: Control Events and Subroutines, Page Events, Variables
and Variable Declaration, Arrays, Functions, Operators, Conditional Logic,
Loops
Object Oriented Programming Concepts: Objects and Classes: Properties,
Methods, Classes, Constructors, Scope, Events, Understanding Inheritance,
Namespaces , Using Code-behind Files
70

SECTION - B
Building Web Applications 10

Components of Visual Studio IDE, Features of Visual Studio IDE and Code
Editor: IntelliSense, Browser Link, Themes, Debuggers, Executing the Project
using built-in Web Server or IIS
Constructing ASP.NET Web Pages
Web Forms, Using the HTML Server Controls.
Web Server Controls: Standard Web Server Controls, List Controls, Advanced
2
Controls
Creating a Web User Control, Master Pages, Using Cascading Style Sheets
(CSS), Types of Style Sheets and Selectors
Core Web Application Features: Working with User Sessions, Using the
Cache Object, Using Cookies
Steps in Developing a Web Application using an example such as Shopping
Cart Application: Using Themes, Skins, and Styles, Using the Master Page.

SECTION - C
Using the Validation Controls 10

Introducing the ASP.NET Validation Controls, Enforcing Validation on the

Server, Required Field Validator, Compare Validator, Range Validator,
Validation Summary, Regular Expression Validator, Custom Validator,
Validation Groups
ADO.NET
Introducing ADO.NET, Importing the SqlClient Namespace, Defining the
Database Connection, Preparing the Command, Executing the Command,
3
Setting up Database Authentication, Reading the Data, Using Parameters with
Queries, Checking errors in data handling code,
Using the Data-bound and Data-aware Controls: Repeater Control, Grid
View, Formatting Data Controls, Using Stored Procedures.
Working with Data Sets and Data Tables: Binding DataSets to Controls,
Implementing Paging, Implementing Sorting, Filtering Data, Updating a
Database from a Modified DataSet.
71

SECTION - D
Working with Files and Email 10

Writing and Reading Text Files, Setting Up Security, Writing Content to a Text
File, Reading Content from a Text File, Accessing Directories and Directory
Information, Working with Directory and File Paths, Uploading Files, Sending
Email with ASP.NET, Sending a Test Email.
4
Web Application Security
Concept of Authentication and Authorization, Types of Authentication in
.NET, Configuring web.config file, Login Controls, Cookie-based
authentication Process, CAS (Code Access Security), Role based Security

Course Outcomes:
Students will get the enormous knowledge about the various concepts of .NET framework such
1 as websites, web applications, web forms, files, security using various tools and techniques

Learn and apply SQL Server database concepts like database, tables, queries, stored procedures
2 etc.

Implement and integrate .NET Framework with SQL Server database.

Suggested / Reference Books:

1 Walther, Active Server Pages 2.0 Unleashed, BPB Publications.
2 Stephen Walther, ASP.NET 4 UNLEASHED, Pearson Education.
3 Matthew Macdonald, Asp.Net: The Complete Reference, Mcgraw Hill Education.
4 Jason N. Gaylord, Christian Wenz, Pranav Rastogi, Todd Miranda, Scott Hanselman:
5 Professional ASP.NET 4.5 in C# and VB, Wrox Publications.
6. ImarSpaanjaars: Beginning ASP.NET 4.5: in C# and VB, John Wiley.
7 2. Walther, Active Server Pages 2.0 Unleashed, BPB Publications.
72

CSA1: B.TECH. (COMPUTER SCIENCE & ENGINEERING) SEMESTER– VI

(Credit Based Evaluation and Grading System)

Course Name : OBJECT ORIENTED ANALYSIS AND DESIGN

Course Code : CSL-342

Credits (L-T-P) : 4(3-1-0)
Total Marks : 100
Mid Semester Examination : 30% weightage
End Semester Examination : 70% weightage

Internal Marks: 30 External Marks: 70

Course Objectives:
At the end of this course, the student should be able to understand the concepts of creating different
types of diagrams involved in analysis and design methodologies. This course introduces the
techniques used to design different programming languages. The implementation strategies using
various programming languages and database back-end are introduced.

Total No. of Lectures –40

Lecture wise breakup Number

SECTION - A
Introduction to Object Oriented concepts, comparison of object oriented vs 10
Procedural software development techniques. Advantages of Object Oriented
1 Methodology. Modeling as a Design technique, Object modeling technique.

SECTION - B
Object & Classes, Links & Associations, Generalization & Inheritance, 10
Aggregation, Abstract Classes, example of an Object Model.
2 Events and States, Operations, Nested State Diagrams, Concurrency, example
of the Dynamic Model.
SECTION - C
Functional Models, Data Flow Diagrams, Specifying Operations & Constraints, 10
example of a Functional Model.
Overview of Analysis, Problem Statement, example of Analysis Process using
3 Object, Dynamic & Functional Modeling on an example system. Overview of
System Design, Object Design, Design Optimization.
73

SECTION - D
Implementation of the design using a Programming Language or a Database 10
System. Comparison of Object Oriented vs Non Object Oriented Languages.
4

Course Outcomes:
1 Front-end and Back-end programming language design using 12 different diagrams are discussed.

2 Able to design any kind of software project in more impressive way.

3 Documentation is more interactive and conceptually easy to present

Suggested / Reference Books:

1 “Object Oriented Modeling& Design” by James Rambaugh, Michael Balaha (PHI , EEE)
2 “Object Oriented Software Construction” Hertfordshire PHI International 1988.
3 “Object Oriented Programming” Brad J.Cox Addison Wessley,1986.
74

CSA1: B.TECH. (COMPUTER SCIENCE & ENGINEERING) SEMESTER– VI

(Credit Based Evaluation and Grading System)

Course Name : OBJECT ORIENTED PROGRAMMING USING JAVA

Course Code : CSL 344

Credits (L-T-P) : 4 (2-1-1)
Total Marks : 100
Mid Semester Examination : 30% weightage
End Semester Examination : 70% weightage

Internal Marks: 30 External Marks: 70

Course Objectives:
At the end of this course, the student should be able to understand the basics of object oriented
programming. The students are able to write programs. This course introduces computer programming
using the Java programming language. Emphasis is laid on common algorithms and programming
principles utilizing the standard library with Java.
Total No. of Lectures –40

Lecture wise breakup Number

of
Lectures
Note: Eight questions are to be set by selecting two questions from each section. Each question is
divided in subsections (not exceeding 4). The candidates are required to attempt five questions by
selecting one question from each section and the fifth question can be attempted from any section.
All questions carry equal marks.
SECTION - A
Introduction to Java: Importance of JAVA to Internet, Features of JAVA, Data 10
Types, Variables, Arrays, Operators and Control Structures Statements. Classes
1 and Inheritance: Class Fundamentals, Declaring objects, introducing methods,
constructors, this keyword, Overloading constructors, Recursion, Nested and Inner
classes, Creating Multilevel hierarchy, Method Overriding, Abstract Classes.
SECTION - B
Packages and Interface: Packages, Access Protection, Importing Packages, 10
Interfaces, Defining, Implementing, Applying Interfaces, Extending Interfaces.
2 Exception Handling: Fundamentals, Exception Types, uncaught exceptions, try
and catch.
SECTION - C
75

Multithreaded Programming: The Java Thread Model, Thread Priorities, 10

Synchronization, Interthread communication, Suspending Resuming and Stopping
Threads. Socket Programming: Networking in Java, server and client
communication using socket in Java, Working with Server and Client Socket
3 Connection,

Event Handling: The Delegation Event Model, Event Classes, Event Listener
Interfaces

SECTION – D
AWT: Window Fundamentals, Working with Frame Windows, Graphics, Color 10
and Fonts. Servlets: Life Cycle of a Servlet, The Servlet API, Reading Servlet
Parameters, Handling HTTP Requests and Responses, Cookies & Session
4 Tracking. JDBC: Database Programming, Connecting to the Database, Creating
a SQL Query, Getting the Results, Updating Database Data.

Course Outcomes:
Write, compile and debug programs in Java, use different data types, operators and I/O function
1
in a computer program.
Comprehend the concepts of classes, objects and apply basics of object oriented programming,
2 polymorphism and inheritance.
Implement various data structures using Java language.
3
Demonstrate use of multithreaded programming, exception handling, event handling, abstract
4 window toolkit, servlets and JDBC.

Suggested / Reference Books:

1 The Complete Reference–JAVA 2 by Patrick Naughton & Herbert Schildt TMH Publications,
2007.
2 Balagurusamy: Programming in JAVA, Tata McGraw Hill, 2004.
3 The Java Tutorial Continued by Compione, Walrath, Huml SUN JAVA Tutorial Team. Addison
Wessley, 2007.
4 The Java Handbook by Patrick Naughton, Michael Morrison Publisher: Osborne/McGraw- Hill
5 Horstmann, “Computing Concepts with Java 2 Essentials”, John Wiley
6. Bert Bates,Kathy Sierra ,”HeadFirst Java”, O’Reilly Media
76

CSA1: B.TECH. (COMPUTER SCIENCE & ENGINEERING) SEMESTER– VI

(Credit Based Evaluation and Grading System)

Course Name : SOFTWARE ENGINEERING AND TESTING

Course Code : CSL–350

Credits (L-T-P) : 4 (3-0-1)
Total Marks : 100
Mid Semester Examination : 30% weightage
End Semester Examination : 70% weightage

Internal Marks: 30 External Marks: 70

Course Objectives:
This course is designed to enlighten the students about the Software Engineering Concepts and its
practical implementation using Selenium tool .The students are able to do practical experiments on
Software Designing and Software Project Management. This course introduces Software Testing
Strategies and building and running test cases using Selenium tool.

Total No. of Lectures –40

Lecture wise breakup Number

SECTION - A
Introduction to S/W Engineering - Principles of Software Engineering, 10
Software Development
Life Cycle, Software Project Management: Management Activities, Project
Planning, Project Scheduling, Risk Management. Software Design: Principles,
1 Methodologies, Design specifications, Verification and validation
Software Product metrics- Object-oriented design metrics, operation-oriented
metrics and interface design metrics-metrics for source coding, metrics for
testing, metrics for maintenance

SECTION - B
77

Introduction to S/W Testing – Fundamentals of testing process, broad 10

categories of testing –General principles of testing – Major Software Testing
Techniques- White-box testing, basis path testing: flow graph notation,
2
cyclomatic complexity; Control structure testing: condition testing, data-flow
testing, loop testing ; Black Box testing : Graph based testing methods-BVA

SECTION – C
Software Testing Strategies – Approach-verification and validation; Strategic 10
issues; testing conventional software – Unit testing, Integration testing,
Validation testing, System testing; Debugging process, strategies, correcting
3 error - The Testing Phases - Test strategy and Test plan – Test strategy
template - Test plan template – Requirement traceability –Test scenario – Test
Case.
.
SECTION - D
Test Estimation techniques: Approaches of Test effort estimation, Delphi 10
Technique, Analogy based estimation, Software size based estimation, Test
case enumeration based estimation, Task (Activity) based Test estimation,
Testing size based estimation, Sizing a Testing project, Merits and demerits of
4 various Test Estimation techniques.

Test Automation Tool: Introduction to Selenium Tool, Selenium IDE,

Selenium Remote control, Selenium Grid.

Course Outcomes:
Students will get the enormous knowledge about the various concepts of Software Engineering
such as Software Development Life Cycle, Software Project Management, Risk Management,
1
Verification and Validation, Software Metrics.

Students are able to do the practical experiments on Software Designing and Software
2
Project Management.
Students will get the vast knowledge about the Software testing and strategies, Debugging
3 process and Software Testing Life Cycle
Students are able to do the practical work with Selenium tool- Building & Running Test
4
Cases, Selenium Commands – “Selenese” - Script Syntax

Suggested / Reference Books:

1 Pressman, R., Software Engineering, McGraw Hill, 2005(6e).
2 2. Humphrey,
Humphrey, W.,W., Managing
Managing Software
Software Process,
Process, Pearson
Pearson Education
Education Asia,
Asia, 1998.
1998.
3. Crosby, P.B., Quality is Free: The Art of Making Quality Certain, Mass Market, 1992.
4. Senn, J.A., Software Analysis and Design, McGraw Hill, 1989
5. Software Testing Foundations - Andreas Spillner, Tilo Linz, Hans Schäfer
6. Software Estimation Best practices, Tools & Techniques – Murali Chemuturi
7. www.seleniumhq.org
78

3 Crosby, P.B., Quality is Free: The Art of Making Quality Certain, Mass Market, 1992.
4 Senn, J.A., Software Analysis and Design, McGraw Hill, 1989.

5 Software Testing Foundations - Andreas Spillner, Tilo Linz, Hans Schäfer.

6 Software Estimation Best practices, Tools & Techniques – Murali Chemuturi

CSA1: B.TECH. (COMPUTER SCIENCE & ENGINEERING) SEMESTER – VI

(Credit Based Evaluation and Grading System)

Course Name : REAL TIME SYSTEMS

Course Code : CSL 347
Credits (L-T-P) : 4 (3-1-0)
Total Marks : 100
Mid Semester Examination : 30% weightage
End Semester Examination : 70% weightage

Internal Marks: 30 External Marks: 70

Course Objectives:
This course is designed to enlighten the students about the basics of real time systems and real time
programming. Further, emphasis is placed on various methodologies and algorithms used for scheduling
in RTOS. Students will get familiarity with various architectural requirements and reliability issues for
RTS design.
Total No. of Lectures –40

Lecture wise breakup Number

SECTION - A
Introduction to Real–time systems: Issues of Real–time Systems, tasks & Task parameters, 10
Real–time Systems components Soft and hard real time system, periodic and aperiodic tasks.
Specification of time constraints.

Need for task scheduling: Issues and scheduling methodologies. Priority based scheduler, value
1 based scheduler & Pre–emptive scheduling multiprocessor environment. Deterministic
scheduling, Hardware Schedulers. [25%]
79

SECTION - B
Real time Operating Systems: A case study of generalized Executive for 10
multiprocessors(GEM). Programming using Real time OS Constructors. Microprocessor based
Real time scheduler.

Real Time Languages: Case study of a language having facilities for time and task
2 Management, Euclid and Ada for real time programming.

SECTION - C

Architectural requirements of Real Time Systems: Tightly coupled systems, hierarchical 10

systems, arbitration schemes, Reliability issues, HW/SW faults, diagnosis, functional testing etc.
3 Fault tolerant architectures: TMR systems.

SECTION - D
Real Time Knowledge based systems: Integration of real time and knowledge based systems. 10
4 Neural networks and fuzzy logic in real time systems.

Course Outcomes:
Students have got detailed understanding of design issues of real time systems, its components and
1 time constraints

2 Students have in depth knowledge of working of scheduling algorithms and RTOS

Students have comprehensive awareness about programming of real time systems in ADA and
3
case studies of intergration of RTS, KBS and fuzzy logic

Suggested / Reference Books:

1 Levi S.T. and Aggarwal A.K. Real Time System Design, McGraw Hill International
Edition, 1990.
2 Stankovic J.A. and Ramamritham K., Hard Real Time Systems, IEEE Press, 1988.
.
80

CSA1: B.TECH. (COMPUTER SCIENCE & ENGINEERING) SEMESTER – VI (ELECTIVES)

(Credit Based Evaluation and Grading System)

Course Name : NATURAL LANGUAGE PROCESSING

Course Code : CSL-345

Credits (L-T-P) : 4(3-1-0)
Total Marks : 100
Mid Semester Examination : 30% weightage
End Semester Examination : 70% weightage

Internal Marks: 30 External Marks: 70

Course Objectives:
At the end of this course, the student should be able to understand the concepts of Artificial
Intelligence, Semantics and applications involved. The components and knowledge based
representation is the core part of this subject. The baseline of this course is the combination of
different languages such as Data Structure, Automata, Knowledge based covered using different
application.
Total No. of Lectures –40

Lecture wise breakup Number

SECTION - A
Introduction to the methods and techniques of Natural Processing – semantics, 10
1 pragmatics, Applications of Natural Language Processing.

SECTION - B
Lexicography, syntax, Semantics, pragmatics: word level representation of 10
natural languages prosody & natural languages.
2 Chomsky Hierarchy, Left Associative Grammars, Ambiguous Grammars.
Resolution of Ambiguities.
SECTION - C
81

Semantic Network Logic and inference. Pragmatics, Graph Models and 10

Optimization. Prolog for natural semantic.
Recognition and parsing of natural language structures: ATN &
3 RTN, General techniques of parsing: CKY, Earley & Tomita’s Algorithm.

SECTION - D
Machine translation; User Interfaces, Natural languages Querying Tutoring and 10
Authoring Systems. Speech Recognition Commercial use of NLP.
4

Course Outcomes:
1 Concepts of combination of various courses are understood

2 Working of several application areas are implemented

3 Advance concepts of Machine to Speech Recognition is involved

Suggested / Reference Books:

1 J. Allen, Natural Language understanding, Benjamin/Cunnings, 1987.
2 G. Gazder, Natural Language Processing in Prolog, Addison Wesley, 1989.
3 MdijArbib & Kfaury, Introduction to Formal Language Theory, Springer Verlag, 1988.
82

CSA1: B.TECH. (COMPUTER SCIENCE & ENGINEERING) SEMESTER – VI (ELECTIVES)

(Credit Based Evaluation and Grading System)

Course Name : SYSTEM HARDWARE DESIGN

Course Code : CSL 346
Credits (L-T-P) : 4 (3-1-0)
Total Marks : 100
Mid Semester Examination : 30% weightage
End Semester Examination : 70% weightage

Internal Marks: 30 External Marks: 70

Course Objectives:
To provide students an exposure to analysis and design techniques used in digital system
hardware design.

Total No. of Lectures –40

SECTION - A

1
CMOS Technology: Logic levels. Noise Margin, Power dissipation, Supply
10
currents, Speed delays, Interconnect analysis.
SECTION - B
Power/ Ground/ Droop/ Bounce, Coupling analysis, Transmission line
2 10
effects /cross talk, Power/ground distribution.
SECTION - C
Signal distribution, Logic Design \ Random logic \ programmable logic,
3 10
Microcontrollers.
83

SECTION - D

4
Memory subsystem design, Noise tolerant design, Worst case timing,
10
Thermal issues in design, Real life system design examples.

Course Outcomes:
1 Recognize issues to be addressed in a combined hardware and software system design.
2 Draw the schematic diagram of an electronic circuit and design its PCB layout.
3 Apply hands-on experience in electronic circuit implementation and its testing.

Suggested / Reference Books:

1. K.L.P. Mishra, Theory of Computer Science: Automata, Languages and Computation, Prentice Hall
India Learning Private Limited (2006).
2. Jeffrey Ullman and John Hopcroft, Introduction to Automata Theory, Languages, and
Computation, 3e, Pearson Education India (2008).
3. Peter Linz, An Introduction to Formal Languages and Automata, 6/e, Jones & Bartlett (2016).
4. John Martin, Introduction to Languages and the Theory of Computation, McGraw-Hill Higher
Education (2007).
5. G.E. Reevsz, Introduction to Formal Languages, McGraw Hill, 1983.
6. M.H. Harrison, Formal Language Theory Wesley 1978.
7. Wolfman Theory and Applications of Cellular Automata, World Scientific, Singapore, 1986.
84

CSA1: B.TECH. (COMPUTER SCIENCE & ENGINEERING) SEMESTER – VI (ELECTIVES)

(Credit Based Evaluation and Grading System)

Course Name :
OPERATION RESEARCH (ELECTIVE – I)
Course Code : CSL 348
Credits (L-T-P) : 4 (3-1-0)
Total Marks : 100
Mid Semester Examination : 30% weightage
End Semester Examination : 70% weightage

Internal Marks: 30 External Marks: 70

Course Objectives:
This module aims to introduce students to use quantitative methods and techniques for effective
decisions–making; model formulation and applications that are used in solving business decision
problems. The module cover topics that include: linear programming, Transportation,
Assignment, and CPM/ MSPT techniques. Analytic techniques and computer packages will be
used to solve problems facing business managers in decision environments.
Total No. of Lectures –40

Lecture wise breakup Number

SECTION - A
85

Introduction to OR modeling approach and various real life situations. 10

Linear programming problems & Applications, Various components of LP
problem formulation. Solving Linear Programming problem using simultaneous
1 equations and graphical Method Simplex method & extensions:

SECTION - B
Sensitivity analysis. 10
Duality theory.
Revised Simplex.
Dual Simplex.
Transportation and Assignment Problems.
2

SECTION - C

Network Analysis including PERT–CPM. 10

Concepts of network.
The shortest path.
Minimum spanning tree problem.
3 Maximum flow problem.
Minimum cost flow problems.
The network simplex method.
Project planning & control with PERT & CPM.
SECTION - D
Integer programming concepts, formulation solution and applications. 10

Dynamic programming concepts, formulation, solution and application.

Game Theory.
4
Queuing Theory & Applications.
Linear Goal Programming methods and applications.
Simulation.

Course Outcomes:
Knowledge and understanding - Be able to understand the characteristics of different
1 types of decision-making environments and the appropriate decision making approaches
and tools to be used in each type.
86

Cognitive skills (thinking and analysis) - Be able to build and solve Transportation
2
Models and Assignment Models.
Communication skills (personal and academic) - Be able to design new simple models,
3 like: CPM, MSPT to improve decision –making and develop critical thinking and
objective analysis of decision problems.
Practical and subject specific skills (Transferable Skills) - Be able to implement
4 practical cases, by using TORA, WinQSB

Suggested / Reference Books:

1 F.S. Hillier & G.J. Lieberman, Introduction to OR, McGraw Hill Int. Series 1995.

2 A Ravindran, Introduction to OR. John Wiley & Sons, 1993.

3 R. Kapoor, Computer Assisted Decision Models, Tata McGraw Hill 1991.
87

CSA1: B.TECH. (COMPUTER SCIENCE & ENGINEERING) SEMESTER– VI (ELECTIVES)

(Credit Based Evaluation and Grading System)

CSL–349: LANGUAGE PROCESSOR (ELECTIVE – I)

CREDITS
L T P
3 1 0
Note: Eight questions are to be set by selecting two questions from each section. Each question
is divided in subsections (not exceeding 4). The candidates are required to attempt five questions
by selecting one question from each section and the fifth question can be attempted from any
section. All questions carry equal marks.

Course Name : LANGUAGE PROCESSOR (ELECTIVE – I)

Course Code : CSL 349
Credits (L-T-P) : 4 (3-1-0)
Total Marks : 100
Mid Semester Examination : 30% weightage
End Semester Examination : 70% weightage

Internal Marks: 30 External Marks: 70

Course Objectives:
At the end of this course on Language processor, the student should be able to understand the
influence of Programming languages and architectures on the efficiency of language translation.

Total No. of Lectures –40

Lecture wise breakup Number

SECTION - A
Overview of the translation process 10
Lexical analysis: hand coding and automatic generation of lexical analyzers.
1 Parsing theory: Top down and bottom up parsing algorithms. Automatic
generation of parsers.

SECTION - B
88

Error Recovery: Error detection & recovery. Ad–hoc and systematic 10

methods.
Symbol table management.
2 Run time memory management: Static memory allocation and stack based
memory allocation
schemes.
SECTION - C
Intermediate code generation: Different intermediate forms. Syntax directed 10
translation mechanisms and attributed definition.
3 Code generation: Machine model, order of evaluation, register allocation and
code selection.

SECTION - D
Code optimization: Global data flow analysis. A few selected optimizations like 10

4 command sub expression removal, loop invariant code motion, strength reduction
etc.

Course Outcomes:
Students are able to work with parser and its programming techniques
1

Students got in depth knowledge of implementing various programs by allocating memory

2
dynamically in different aspects

3 Students qill able to understand the optimization of code as well the reeducation of code.

Suggested / Reference Books:

1 Aho, Ravi Sethi, J.D. Ullman, Compilers tools and techniques, Addison–Wesley, 1987.
2 Dhamdhere, Compiler Construction – Principles and Practice Macmillan, India 1981
3 Tremblay J.P. and Sorenson, P.G., The Theory and Practice of Compiler Writing, McGraw
4 Hill,
Waite1984.
W.N. and Goos G., Compiler Construction Springer Verlag
89

CSA1: B.TECH. (COMPUTER SCIENCE & ENGINEERING) SEMESTER– VII

(Credit Based Evaluation and Grading System)

Course Name : Computer Graphics

Course Code : CSL 479

Credits (L-T-P) : 4 (3-0-1)
Total Marks : 100
Mid Semester Examination : 30% weightage
End Semester Examination : 70% weightage

Internal Marks: 30 External Marks: 70

Course Objectives:
The goal of this course is to provide an introduction to the theory and practice of computer graphics.
The course will assume a good background in programming in C++. Students must be familiar with
the theory and use of coordinate geometry and of linear algebra such as matrix multiplication.

Total No. of Lectures –40

Lecture wise breakup Number

SECTION - A
Overview of Computer Graphics: Applications of Computer Graphics, 10
Raster–Scan displays, Random–Scan displays, Color CRT Monitors, Flat–
Panel Displays; Video Controller, Display Processor, Common Graphic Input
1 and Output devices, Graphic File Formats.
Output Primitives: DDA, Bresenham Line Algorithm; Midpoint Circle
drawing algorithms; Midpoint Ellipse Algorithm; Flood and Boundary Filling
SECTION - B
Two Dimensional Geometric Transformation: Translation, Rotation, 10
Scaling, Reflection; Matrix representations; Composite transformations.
Two Dimensional Viewing: Viewing coordinate reference frame; Window
2
to Viewport coordinate transformation, Point Clipping; Cohen–Sutherland
and Liang–Barskey Algorithms for line clipping; Sutherland–Hodgeman
algorithm for polygon clipping.
SECTION - C
90

Three Dimensional Transformations & Viewing: Translation, Rotation, 10

Scaling, Reflection and composite transformations. Parallel and Perspective
3 Projections, Viewing Transformation: View Plan, View Volumes and
Clipping.

SECTION - D
Color Models: Properties of Light, Intuitive Color Concepts, concepts of 10
chromaticity, RGB Color Model, CMY Color Model, HLS and HSV Color
Models, Conversion between RGB and CMY color Models, Conversion
between HSV and RGB color models, Color Selection and Applications.
4
Introduction to Animation Graphics: Design of Animation sequences,
General Computer Animation functions, Raster Animation & Computer
Animation languages.

Practical’s
1 To work with output primitives available in the graphic library of Borland‘s C++ IDE.

i. WAP to draw different geometric structure using given output primitives.

ii. WAP to show the light coming from one source of light in a dark room.

iii. WAP to draw 2D car and move on the road OR to show the landing and
take-off of the airplane.

iv. WAP to show a moving 2D cartoon in rainy season.

2 Implement DDA line generating algorithm.

3 Implement Bresenham’s line generating algorithm.
4 Implement Mid-point circle- generating algorithm.

5 WAP to draw a building with filled patterns using output primitives/DDA/Bresenham’s

6 WAP of color filling the polygon using Boundary fill and Flood fill algorithm.
algorithm.
7 Write a function to create a translation matrix for three successive translations and show its
8 Program of line clipping
use in a graphics program.using Cohen-Sutherland algorithm
9 .Implement general computer animation functions
NOTE: Above said exercises can be implemented in C/C++ programming Language.
Program to implement 3D projections

.
91

Course Outcomes:
Students are able to work with output primitives available in the graphic library of Borland‘s
1
C++ IDE.
Students got in depth knowledge of implementing various line generating, Circle drawing ellipse
2
algorithms.
Students adapt and combine 3D projection and computer animation functions to implement the
3
programs.

Suggested / Reference Books:

nd
1 D. Hearn and M.P. Baker, Computer Graphics: C version, 2 Edition, PHI, 2004.
nd
2 D.F. Rogers, Procedural Elements for Computer Graphics, 2 Edition, Addison Wasley,
3 2004. nd
D.F. Rogers, Mathematical Elements for Graphics, 2 Edition., McGraw Hill, 2004.
nd
4 J.D. Foley et al, Computer Graphics, Principles and Practices, 2 Edition, Addison Wasley,
2004.
5 Roy A. Plastock, Gordon Kalley, Computer Graphics, Schaum’s Outline Series, 1986.
92

CSA1: B.TECH. (COMPUTER SCIENCE AND ENGINEERING) Semester–VII

(Under Credit Based Continuous Evaluation System

Course Name : Cloud Computing

Course Code : CSL 474

Credits (L-T-P) : 4 (2-1-1)
Total Marks : 100
Mid Semester Examination : 30% weightage
End Semester Examination : 70% weightage

Internal Marks: 30 External Marks: 70

Course Objectives:
At the end of this course, the student should be able to understand the basics and foundations of cloud
computing platforms. The students should also able to understand advancements in the cloud
computing systems. This course also introduces further extensions to cloud computing platforms by
introducing advance topics in cloud.

Total No. of Lectures –40

Lecture wise breakup Number

SECTION - A
Introduction: Definition, Vision, Reference Model, Classification of Cloud Services, 10
Cloud Deployment Models, Benefits, Limitations, Terminology, Open Challenges.
1 Historical Development: Distributed Systems, Grid Computing, Utility Computing,
Service Oriented Computing, Web 2.0, Web Services Standards-SOAP, WSDL,
UDDI.
SECTION - B
Virtualization: Definition, Type of Virtualization, Benefits, Limitations, 10
Virtualization and Cloud, Virtual Appliance.
2 Cloud Migration: The laws of cloudonomics, Measuring cloud computing costs,
Seven step model of migration into the cloud, Migration Risks and Mitigation
SECTION - C
QoS and Service Level Agreement (SLA): QoS Metrics, Types of SLA, SLA 10
Components, Life Cycle of SLA, Phases of SLA Management.
3 Cloud Security: Securing Data, Establishing Identity-user centric, open-identity
systems, Information Cards.
93

SECTION - D
Programming Models in Cloud: Introduction to Thread Programming, Task 10
Programming and Map–Reduce Programming.
4 Advance Topics in Cloud: Energy Efficiency in cloud, Market Oriented Cloud
Computing, Federated Cloud Computing, Mobile Cloud Computing, Fog computing,
Big Data Analytics.

Course Outcomes:
To understand the basic building blocks and evolution of cloud computing as well as aspects of
1
cloud security.

2 Able to implement virtualization by creating different types of virtual machines on physical hosts.

To understand and write programs using Thread Programming, Task Programming and Map–
3 Reduce Programming.
nguage
4 To understand the advancements in the cloud computing platforms.

Suggested / Reference Books:

Textbooks:
8. Rajkumar Buyya, Christian Vecchiola, and Thamarai Selvi, Mastering Cloud Computing: Foundation
and Application Programming, Tata McGraw Hill, ISBN–13: 978–1–25–902995–0, New Delhi, India,
Feb 2013.

Reference Books:
1. Barrie Sosinsky, Cloud Computing Bible, Wiley India Pvt. Ltd, ISBN–13: 978–8–12–
6529803, New Delhi, India, 2011.
2. Rajkumar Buyya, James Broberg, Andrzej Goscinski, Cloud Computing: Principles and Paradigms,
Wiley India Pvt. Ltd, ISBN–13: 978–-81-265-4125-6, New Delhi, India, 2011.
3. Dr. Saurabh Kumar, Cloud Computing: Insights Into New–Era Infrastructure, Wiley India
Pvt.Ltd, ISBN–13: 978–8–12–6528837, New Delhi, India, 2011.
4. Fern Halper, Hurwitz, Robin Bloor, Marcia Kaufman, Cloud Computing For Dummies,
WileyIndia Pvt. Ltd, ISBN–13: 978–0–47–0597422, New Delhi, India, 2011.
3.
94

CSA1: B.TECH. (COMPUTER SCIENCE & ENGINEERING) SEMESTER– VII

(Credit Based Evaluation and Grading System)

Course Name : Artificial Intelligence

Course Code : CSL 477

Credits (L-T-P) : 4 (4-0-0)
Total Marks : 100
Mid Semester Examination : 30% weightage
End Semester Examination : 70% weightage

Internal Marks: 30 External Marks: 70

Course Objectives:
At the end of this course, the student should be able to understand the basics of smart systems as well
as Artificial Intelligence.

Total No. of Lectures –45

Lecture wise breakup Number

SECTION - A
Introduction: Definition, Foundations, Current AI systems. Intelligent Agents: 12
Agents and environment, Rationality, PEAS, Nature of Environment, Different
types of agents. Searching: Agent design, Toy Problems, Searching, Tree Search
and Graph Search, Uninformed Search, Breadth First Search, Depth First Search,
Depth-Limited Search, Iterative Deepening, Iterative Lengthening, Bidirectional
Search, Sensor less problems, Contingency problems.
1
Informed Search: Informed/Heuristic Search, Heuristic Search, A* Search,
Memory bounded heuristic search, heuristic functions, local search and
optimization, hill-climbing, simulated annealing, local beam search, online
search, online depth first search.

SECTION - B
95

Introduction to knowledge-based intelligent systems: Intelligent machines, 12

Journey from 'dark ages' to knowledge-based systems, Introduction to
Expert Systems. Logic and Inferences: Propositional Logic, First Order
Logic (FOL), Resolution method for FOL, Forward and Backward
chaining.
Constraint Satisfaction Problems: Constraint Satisfaction Problems,
2
Backtracking, Minimum Remaining Values heuristic, Most Constraint
Variable heuristic, Least Con-straining Value heuristic, Forward
Checking, Constraint Propagation, local search, problem decomposition.
Adversarial Search: Games, optimal decisions in games, minimax
algorithm, multiplayer games, alpha-beta pruning, evaluation functions,
cutting o search, expectiminimax algorithm, dice/card games.
SECTION - C
Planning: The planning problem, language specification and PDDL, 11
examples of planning problems, forward search, backward search,
heuristics, partial order planning, planning graphs, heuristics from
planning graphs, Graphplan algorithm. Uncertainty: Uncertainty,
probability basics, axioms of probability, inference using full joint
distributions, independence.
3 Knowledge Representation (KR): Approaches to KR: Relational
knowledge, Procedural knowledge and knowledge represented as logic;
Semantic Nets, Ex-tended Semantic Networks, Frames. Rule-based Expert
systems: Structure of rule based expert system, Conflict resolution,
Uncertainty Management, Advantages & disadvantages of rule-based
expert systems.
SECTION - D
Probabilistic Reasoning: Representation, Bayesian Networks, Construction 10
of Bayesian Networks, Conditional Independence, Bayesian Networks with
continuous variables. Making Simple Decisions: Beliefs, Desires and
Uncertainty, Utility Theory, Utility Functions, Multi- attribute Utility
4 Functions, Decision Networks, Value of Information. Making Complex
Decisions: Stochastic Problems, Value Iteration, Policy Iteration, Game
Theory.
Frame-based Expert systems: Inheritance in frame-based expert systems,
Methods and Continued demons, Interactions of frames and rules.
96

Course Outcomes:
Able to understand the different searching algorithms ( Breadth First Search, Depth First Search
1
etc.)

2 Able to understand different AI systems.

Suggested / Reference Books:

1 S. Russell and P. Norvig, Artificial Intelligence, Pearson.
2 Dan W. Patterson, Introduction to Artificial Intelligence and Expert Systems, Pearson.
3 M. Negnevitsky, Artificial Intelligence: A Guide to Intelligent Systems, Addison Wesl
4 D. Khemani, A first course in Artificial Intelligence, McGraw Hill Education (India) Pvt. Ltd.
5 S. Kaushik, Artificial Intelligence, CENGAGE Learning.
6. I. Bratko, Prolog Programming for Artificial Intelligence, Pearson.
7 4. Clocksin, W.F. and Mellish, C.S., Programming in Prolog 2nd Edition, Springer - Verlag, 1984.
97

CSA1: B.TECH. (COMPUTER ENGINEERING) SEMESTER– VII

(Credit Based Evaluation and Grading System)

Course Name : Machine Learning

Course Code : CSL-478
Credits (L-T-P) : 4 (3-0-1)
Total Marks : 100
Mid Semester Examination : 30% weightage
End Semester Examination : 70% weightage

Internal Marks: 30 External Marks: 70

Course Objectives:
Introduce fundamentals of Machine Learning for real time problem solving
Provide thorough understanding of different kinds of machine learning algorithms and its
mathematical concepts in order to get deep insights in the area of data analytics. Understanding of
deep learning and reinforcement learning models to further enhance problem solving capabilities
in different areas of research. To have understanding of performance measures for evaluating the
performance of deep learning algorithms

Total No. of Lectures –40

Lecture wise breakup Number

SECTION - A
Introduction: Introduction to Machine learning, Application areas, types: 10
supervised learning, unsupervised learning, semi-supervised and reinforcement
learning.
1
Supervised Learning algorithms: Naïve Bayes, Decision Tree, KNN, SVM,
Bayesian Network , MultiLayer perceptron or back propogation neural
network, linear regression, logistic regression.

SECTION - B
98

Unsupervised Learning Algorithms: K-means Clustering, Hierarchical 10

clustering

Ensemble Machine Learning models: Ensemble Machine Learning

2 techniques such as Bagging, Boosting and Voting.

Model Selection : Metrics, Feature Selection, Principal Component Analysis,

Confusion Matrix ,Overfitting,Underfitting,Bias-Variance Tradeoff.

SECTION - C
Deep Learning: Basics of Deep learning, Why deep learning, Difference 10
between machine learning and deep learning ,Classification of DL approaches.
3 Types : Recursive Neural Networks(RvNNs), Convolutional Neural Network,
Recurrent Neural Network: LSTM.

SECTION - D
Reinforcement Learning: Introduction, Markov decision process (MDP), 10
Bellman equations, Value iteration and policy iteration, Q-learning, Value
4
function approximation, Policy search, Reinforce, POMDPs, Temporal
Difference Learning.

Course Outcomes:
The students will be able to solve various real time problems related to image classification,
1 signal processing and classification, marketing, finance, healthcare and other engineering
problems in the field of data analytics.
The theoretical understanding of machine learning and deep learning algorithms and its
2 implementation in Python make the students familiar with its deep insights and enable them
to further enhance their problem-solving capability.

Suggested / Reference Books:

1 Zurada, J.M., Introduction to Artificial Neural Network System, Jaico Publication (2006).
2 Sivanandam S.N., Principles of Soft computing, Wiley India.
3 Ethem Alpaydin, Introduction to Machine Learning, Third Edition, Prentice Hall of India.
4 Yegnanarayana, B., Artificial Neural Networks, Prentice-Hall of India Private Limited
5 Petterson,
(2008). D.W., Introduction to Artificial Intelligence and Expert Systems, Prentice Hall
6. Anuradha Srinivasaraghavan, Vincy Joseph, Machine Learning, Wiley India.
of India (2007).
7 Dr. S Lovelyn Rose, Dr. L Ashok Kumar, Dr. D Karthika Renuka, Deep Learning using
Python, Wiley India.
99

CSA1: B.TECH. (COMPUTER SCIENCE & ENGINEERING) SEMESTER– VII

(Credit Based Evaluation and Grading System)

Course Name :
INTERNET PROTOCOL(ELECTIVE II)
Course Code : CSL 472
Credits (L-T-P) : 4 (3-1-0)
Total Marks : 100
Mid Semester Examination : 30% weightage
End Semester Examination : 70% weightage

Internal Marks: 30 External Marks: 70

Course Objectives:
This course is designed to enlighten the students about the basics of internet and the internet protocols,
implementation of protocols in the real life using the TCP/IP model. Further, emphasis is placed on
various IP Addressing Schemes, Virtual network and security. Students will get familiarity with
networking and internetworking devices.
Total No. of Lectures –40

Lecture wise breakup Number

SECTION - A
Introduction & Overview: The need for Internet, The TCP/IP Internet, 10
Internet services, history & scope, protocol standardization.
1 Review of underlying Technologies: LAN, WAN, MAN, Archnet &
Ethernet topology, Token Ring, ARPANET, PROnet technology.
SECTION - B
Internetworking concepts and architectural model, Application level Internet 10
connection, Interconnection through IP Gateways, Users View.
Internet Address: Universal Identifiers, Three Primary classes of IP
2 Addresses, network &Broadcasting Addresses, Address Conventions,
Addressing Authority, Mapping Internet Addresses to physical Addresses,
Determining Internet Address at startup (RARP).

SECTION - C
Internet as virtual Network, Detailed concept of Routers & Bridges. Protocols 10
Layering, Difference between X.25 and Internet layering.
3
100

SECTION - D
Gate to Gate Protocol (GGP), Exterior Gateway Protocol (EGP). Managing 10
4 Internet, reliable transactions & Security on Internet.

Course Outcomes:
1 Students have got detailed understanding of internet and internet services.
2 Students have in depth knowledge of Classless Addressing Schemes (IPv4)
3 Students have comprehensive awareness about routing protocols like GGP and EGP.

Suggested / Reference Books:

1 Internet working with TCP/IP Vol. - I
2 Principal Protocols & Architecture Comer & Stevens.
101

CSA1: B.TECH. (COMPUTER SCIENCE & ENGINEERING) SEMESTER– VII

(Credit Based Evaluation and Grading System)

Course Name : ADVANCED MICROPROCESSORS (ELECTIVE II)

Course Code : CSL 473
Credits (L-T-P) : 4 (3-1-0)
Total Marks : 100
Mid Semester Examination : 30% weightage
End Semester Examination : 70% weightage

Internal Marks: 30 External Marks: 70

Course Objectives:
This course is designed to enlighten the students about the advancement in microprocessor operation.
The students are able to know about the current microprocessor its working and the functioning of 8,16
and 32 bit microprocessor with their internal working.

Total No. of Lectures –40

Lecture wise breakup Number

SECTION - A
Review of 8 bit microprocessor and support components. 10

1 Selected Case Studies of 16 bit microprocessors and

support
SECTION - B
Contents. RISC Architectures and Case Studies : RISC Vs 10

2 CISC.
Selected Case Studies of 32/64 bit microprocessors and support

SECTION - C
Power PC 601 Alpha 21064, Pentium super space, Transputer Architectures 10

3 and Case Studies: High Performance Embedded Microcontrollers, Case

Studies. SECTION - D
102

403 GA Development Systems and support. Selected Applications. 10

Course Outcomes:
1 Students have got detailed understanding of past and present microprocessors
2 Students have in depth knowledge of working of microprocessor and microcontroller
3 Students have comprehensive awareness about the CISC and RISC architectures

Suggested / Reference Books:

1 J.T. Cain, Selected reprints on microprocessors and microcomputers, IEEE Computer Society
2 Rafiquzzaman,
Press., 1984. Microprocessors & Micro Computers Development Systems, Harper Row, 1984.

3 Rafiquzzaman, Microprocessors & Micro Computers - Based System Design, Universal Book
Stall, New Delhi, 1990.
4 1. INMOS Ltd., Transputer Development System, Prentice Hall, 1988.
5 INMOS Ltd. Communicating Process Architecture, Prentice hall, 1988.
6 Wunnava V. Subbarao, 16/32 Bit Microprocessors 68000/68010/68020, Software, Hardware &
Design Applications, Macmillan Publishing Company, 1991.
7 Kenneth Hintz, Daniel Tabak, Microcontrollers : Architecture, Implementation & Programming
McGraw Hill Inc., 1992.

8 Data Books By Intel, Motorola, etc.

9 Daniel Tabak, Advanced Microprocessors, McGraw Hill Inc., 1995.
10 Andrew m. Veronis, Survey of Advanced Micro Processors, van Nostrand Reinhold,
1991. McGraw Hill Inc., 1992.
11 Daniel Tabak, RISC Systems, John Willey & Sons, 1990
12 The Power PC Architecture: A Specification for a New family of RISC Processors,
Edited by Cathy May, Ed Silha, Rick Simpson, hank Warren, Morgan Kaufmann
nd
Publishers, Inc., San Francisco, California, 2 Edition (May 1994)
13
PowerPC 403GA Embedded Controller User’s Manual. PowerPC Tools - Development
14 Tools For PowerPC Microprocessor (Nov. 1993).PowerPC 601 RISC Microprocessor
User’s Manual - 1993.
103

SA1: B.TECH. (COMPUTER SCIENCE & ENGINEERING) SEMESTER– VII

(Credit Based Evaluation and Grading System)

Course Name : ROBOTICS (ELECTIVE - II)

Course Code : CSL 476
Credits (L-T-P) : 4 (3-1-0)
Total Marks : 100
Mid Semester Examination : 30% weightage
End Semester Examination : 70% weightage

Internal Marks: 30 External Marks: 70

Course Objectives:
At the end of this course, the student should be able to understand the basics working and principals of
robots. The students should also able to understand advancements in the robotics and the use of various
sensors, motion control as well as to handle the robot with handheld devices.

Total No. of Lectures –40

Lecture wise breakup Number

of
Lectures

Note: Eight questions are to be set by selecting two questions from each section. Each question is
divided in subsections (not exceeding 4). The candidates are required to attempt five questions by
selecting one question from each section and the fifth question can be attempted from any section.
All questions carry equal marks.

SECTION - A
Introduction to Robotics, Introduction to Manipulators & Mobile Robots, 10
Classification of Robots, Robot Applications. Industrial application
1 environment and work cells, feeders and Orienting devices.
Robot Anatomy, Robot and Effectors, Transmission and actuators, with special
reference to servomotors.
SECTION - B
Robot Arm Kinematics, World, Tool and Joint coordinators, DH 10
2 transformation and Inverse Kinematics. Fundamentals of Closed loop control,
PWM amplifiers, PID control.

SECTION - C
104

Robotics Sensors : Range, Proximity, Touch, Force & Torque Sensing, Uses 10
of sensors in Robotics. Studies.
Machine Vision : Introduction to machine Vision, The sensing and digitizing
3 function in Machine Vision, Image Processing and analysis, Training and
Vision system, Robotics Application. Low & High Level vision.
SECTION - D
Robot Programming & Languages & Environment: Different methods, 10
Features of various programming methods, Case study, Robot Task Planning. :
concept, Different Methods, Robots learning.
4 Mobile Robot: Introduction, Obstacle Representation, Motion Planning in
fixed, Changing structured, Unstructured environment based on different
requirements.

Course Outcomes:
1 Students have got the depth knowledge of robotics
2 Students are able to design the robots and the programing for to handle the robots
3 Students have comprehensive awareness about the different methods and models used for robotics.

Suggested / Reference Books:

1 S. SitharamaIyengar, Alberto Elefes, Autonomous Mobile Robots, Perception, mapping &
Navigation, IEEE Computer Society Press.

2 Andrew C. Straugard, Robotics & AI, Prentice Hall, Inc.

3 K.S. Fu, RC Gonzalez, CSG Lee, Robotics Control, Sensing, Vision and Intelligence,
McGraw Hill, International Edition, 1987.
4 Klafter D. Richard, Chmielewski T. A. and Negin Michael “Robotic Engineering”, Prentice
Hall of India Ltd., 1993.

5 M.P. Groover, M. Weins, R.N. Nagel, N.C. Odrey, Industrial Robotics, McGraw Hill, 1986.

6
Various Research papers in area of Robotics
105

CSA1: B.TECH. (COMPUTER SCIENCE & ENGINEERING) SEMESTER– VIII

(Credit Based Evaluation and Grading System)

Course Name : Industrial Training-cum-Projects

Course Code : CSD 480
Credits (L-T-P) : 40 (0-0-40)
Total Marks : 100

Course Objectives:
At the end of this course, the student should be able to understand the working of IT industry as well to
work in a research group. The students should also able to publish research papers those who are opting
research projects. The students have an exposure to work in the IT industry.

Guidelines
A candidate should work on the Project in the IT Industry or in Research organization for 5 months
and 6-8 hours on each working day.

Examination Credits
Ist synopsis (containing mainly literature survey corresponding to the problem 10
taken up for the project work and line of attack to solve the
problem) within one month of joining the training is to be
submitted and will be evaluated for 10 credits.

IInd (containing essentially the progress of work in comparative details) 10

synopsis within three months of joining the training is to be evaluated will
be evaluated for 10 credits.

Final Report Final Project Report & Viva Voce of 20 credits 20

The evaluation shall be done as per the common ordinances for courses
Credit Based Evaluation and Grading System.

RCCR
No ratings yet
RCCR
154 pages
Syllabus
No ratings yet
Syllabus
98 pages
2022-20231005BC4561
No ratings yet
2022-20231005BC4561
111 pages
Syllabus
No ratings yet
Syllabus
111 pages
Btech Computer Science and Engg Cbegs 2019-20
No ratings yet
Btech Computer Science and Engg Cbegs 2019-20
90 pages
Gndu Syllabus Ce 2021-2024
No ratings yet
Gndu Syllabus Ce 2021-2024
134 pages
2023 20241005BC4421
No ratings yet
2023 20241005BC4421
157 pages
Syllabus
No ratings yet
Syllabus
123 pages
Btech Civil Engineering I To Viii
No ratings yet
Btech Civil Engineering I To Viii
88 pages
Syllabus SY Electronics and Telecommunication PDF
No ratings yet
Syllabus SY Electronics and Telecommunication PDF
29 pages
R2023-CSE-Curriculum_and_Syllabus
No ratings yet
R2023-CSE-Curriculum_and_Syllabus
90 pages
Mca 5 Yrs and 6 Months Ic Sem I To X Cbegs 2019-20 (GNDU Amritsar)
No ratings yet
Mca 5 Yrs and 6 Months Ic Sem I To X Cbegs 2019-20 (GNDU Amritsar)
95 pages
Anna University, Chennai Non-Autonomous Affiliated Colleges Regulations 2021 Choice Based Credit System B.E. Computer and Communication Engineering
No ratings yet
Anna University, Chennai Non-Autonomous Affiliated Colleges Regulations 2021 Choice Based Credit System B.E. Computer and Communication Engineering
42 pages
Anna University, Chennai Non-Autonomous Affiliated Colleges Regulations 2021 Choice Based Credit System B.E. Computer Science and Engineering
100% (1)
Anna University, Chennai Non-Autonomous Affiliated Colleges Regulations 2021 Choice Based Credit System B.E. Computer Science and Engineering
42 pages
CSE Curriculum 2020
No ratings yet
CSE Curriculum 2020
207 pages
2018 2022 Computer Science and System Engineering
No ratings yet
2018 2022 Computer Science and System Engineering
123 pages
BTech Mechanical Engineering Syllabus
No ratings yet
BTech Mechanical Engineering Syllabus
190 pages
Syllabus 2021
No ratings yet
Syllabus 2021
43 pages
2018 2022 Computer Science Engeering
No ratings yet
2018 2022 Computer Science Engeering
125 pages
Btech Computer Science and Engg Semester I To Vi Semester Vii and Viii Old Sys Cbcegs
No ratings yet
Btech Computer Science and Engg Semester I To Vi Semester Vii and Viii Old Sys Cbcegs
132 pages
2018 2022 Information Technology
No ratings yet
2018 2022 Information Technology
121 pages
Cse R2021
No ratings yet
Cse R2021
83 pages
SIGNALS-AND-SYSTEMS-COURSE-FILE-2022-23
No ratings yet
SIGNALS-AND-SYSTEMS-COURSE-FILE-2022-23
54 pages
B.Tech IT 2022 Curriculum for Website
No ratings yet
B.Tech IT 2022 Curriculum for Website
105 pages
Elememts of Computer Science Engineering 1
No ratings yet
Elememts of Computer Science Engineering 1
49 pages
Syllabus Mechanical NIT Calicut
No ratings yet
Syllabus Mechanical NIT Calicut
146 pages
B E Mechatronics
No ratings yet
B E Mechatronics
79 pages
SYLLABUS - 2022R - CYBER
No ratings yet
SYLLABUS - 2022R - CYBER
218 pages
Plan of Study Msc. Computer Science For The Session Fall 2017
No ratings yet
Plan of Study Msc. Computer Science For The Session Fall 2017
19 pages
B e Ece
No ratings yet
B e Ece
41 pages
B e Ece
No ratings yet
B e Ece
41 pages
M.Tech CSE - BA SyllabusBook2019 20 - AsOn2022Jan
No ratings yet
M.Tech CSE - BA SyllabusBook2019 20 - AsOn2022Jan
246 pages
Electronics and Computer Science Engineering
No ratings yet
Electronics and Computer Science Engineering
147 pages
5002_IT_R2024
No ratings yet
5002_IT_R2024
56 pages
School of Engineering: September 2021
No ratings yet
School of Engineering: September 2021
226 pages
20230809102644.detailed Syllabus For Computer Science and Engineering
No ratings yet
20230809102644.detailed Syllabus For Computer Science and Engineering
120 pages
Final Btech CSE Full Syllabus New Draft
No ratings yet
Final Btech CSE Full Syllabus New Draft
243 pages
Bca 2021 24
No ratings yet
Bca 2021 24
580 pages
AIDS Syllabus 2021 L
No ratings yet
AIDS Syllabus 2021 L
87 pages
BTech-ME Curriculum-Syllabi 2018
No ratings yet
BTech-ME Curriculum-Syllabi 2018
113 pages
B.E. Eie
No ratings yet
B.E. Eie
48 pages
DSD-COURSE-FILE-II-1-AY-2022-23
No ratings yet
DSD-COURSE-FILE-II-1-AY-2022-23
56 pages
Syllabus Sy Revision 19 23 Updated 14 Oct 2020 POs
No ratings yet
Syllabus Sy Revision 19 23 Updated 14 Oct 2020 POs
45 pages
1. B.Tech. CSE 180 - Scheme and Syllabus - 2021-22 onwards
No ratings yet
1. B.Tech. CSE 180 - Scheme and Syllabus - 2021-22 onwards
144 pages
Untitled
No ratings yet
Untitled
44 pages
Final B.Tech - CSE AWS Syllabus
No ratings yet
Final B.Tech - CSE AWS Syllabus
89 pages
B.E. CSE-Curriculum & Syllabus
No ratings yet
B.E. CSE-Curriculum & Syllabus
296 pages
2023-onwards-eced-btech-syllabus-date-2024-01-20_88358b52-e6dd-49ce-8979-688b6bf8f7e1_0
No ratings yet
2023-onwards-eced-btech-syllabus-date-2024-01-20_88358b52-e6dd-49ce-8979-688b6bf8f7e1_0
123 pages
BASIC-ELECTRICAL-ENGINEERING-
No ratings yet
BASIC-ELECTRICAL-ENGINEERING-
53 pages
4 VII and VIII Semester - BTech. Manufacturing Science and Engineering Wef 2023-24 - 11 Aug 23 (2) (
No ratings yet
4 VII and VIII Semester - BTech. Manufacturing Science and Engineering Wef 2023-24 - 11 Aug 23 (2) (
43 pages
Ece 2024 1
No ratings yet
Ece 2024 1
149 pages
SEMESTER new curriculum
No ratings yet
SEMESTER new curriculum
44 pages
B.E. Ice
No ratings yet
B.E. Ice
47 pages
Anna University, Chennai Non-Autonomous Affiliated Colleges Regulations 2021 Choice Based Credit System B.E. Computer Science and Engineering
No ratings yet
Anna University, Chennai Non-Autonomous Affiliated Colleges Regulations 2021 Choice Based Credit System B.E. Computer Science and Engineering
86 pages
PROGRAMMING-FOR-PROBLEM-SOLVING
No ratings yet
PROGRAMMING-FOR-PROBLEM-SOLVING
48 pages
B e Ete
No ratings yet
B e Ete
42 pages
STUCOR_Syllabus_CSE2021
No ratings yet
STUCOR_Syllabus_CSE2021
132 pages
BTech ME Curriculum Syllabi 2018
No ratings yet
BTech ME Curriculum Syllabi 2018
115 pages
B E Mechatronics
No ratings yet
B E Mechatronics
46 pages
B.tech - IT R2018 Curriculum Syllabi
No ratings yet
B.tech - IT R2018 Curriculum Syllabi
121 pages
Practical TTL Logic Gates: 74LS Integrated Circuits in Action
From Everand
Practical TTL Logic Gates: 74LS Integrated Circuits in Action
GURUPRASAD N H
No ratings yet
LAVAGNINI Et Al., 2021
No ratings yet
LAVAGNINI Et Al., 2021
7 pages
Dry-Stacked Masonry - Present Scenario: Upadhyay Tejas J
No ratings yet
Dry-Stacked Masonry - Present Scenario: Upadhyay Tejas J
9 pages
Forces in Body
No ratings yet
Forces in Body
20 pages
the-magnetic-mind-TRADE
No ratings yet
the-magnetic-mind-TRADE
174 pages
Quick Fire Questions
No ratings yet
Quick Fire Questions
2 pages
Managing Pipeline Dents
No ratings yet
Managing Pipeline Dents
34 pages
Grade 8 - Science - Q3 - Week 5-6 - SET 20 - Atom
No ratings yet
Grade 8 - Science - Q3 - Week 5-6 - SET 20 - Atom
28 pages
Contribution and Implications On Society
No ratings yet
Contribution and Implications On Society
3 pages
draft tt 4-2
No ratings yet
draft tt 4-2
66 pages
Oblique
No ratings yet
Oblique
1 page
Cansat2019 2806 PDR v01
No ratings yet
Cansat2019 2806 PDR v01
157 pages
Wedge Calculation
No ratings yet
Wedge Calculation
6 pages
Two Marks - Questions & Answers
No ratings yet
Two Marks - Questions & Answers
21 pages
(Ebook) Rotatory Knee Instability: An Evidence Based Approach by Volker Musahl, Jón Karlsson, Ryosuke Kuroda, Stefano Zaffagnini (eds.) ISBN 9783319320694, 9783319320700, 9783319811888, 3319320696, 331932070X, 3319811886 All Chapters Instant Download
100% (8)
(Ebook) Rotatory Knee Instability: An Evidence Based Approach by Volker Musahl, Jón Karlsson, Ryosuke Kuroda, Stefano Zaffagnini (eds.) ISBN 9783319320694, 9783319320700, 9783319811888, 3319320696, 331932070X, 3319811886 All Chapters Instant Download
65 pages
NS - Project GRD 8 - Term 3 - 2024
No ratings yet
NS - Project GRD 8 - Term 3 - 2024
5 pages
Atterberg Limit Lab 1
No ratings yet
Atterberg Limit Lab 1
6 pages
Chaos Suppression Using Active Control For Fractional Order Induction Motor System With Uncertain Load
No ratings yet
Chaos Suppression Using Active Control For Fractional Order Induction Motor System With Uncertain Load
6 pages
Donacarbo S Chopped en
No ratings yet
Donacarbo S Chopped en
1 page
The Strain-Smoothed MITC3+ Shell Element in Nonlinear Analysis
No ratings yet
The Strain-Smoothed MITC3+ Shell Element in Nonlinear Analysis
18 pages
Probability Concepts and Random Variable - SMTA1402: Unit - I
No ratings yet
Probability Concepts and Random Variable - SMTA1402: Unit - I
105 pages
2ND Sem Diploma Class-B
No ratings yet
2ND Sem Diploma Class-B
1 page
Finite Line Relief Well System Design For Dams and Levees
No ratings yet
Finite Line Relief Well System Design For Dams and Levees
22 pages
Learning Activity Sheets in Science7 - No.3
100% (1)
Learning Activity Sheets in Science7 - No.3
7 pages
Aidann Gia Bacolodan - Lab Six
No ratings yet
Aidann Gia Bacolodan - Lab Six
6 pages
Fatigue Life Estimation Using Goodman Diagram: International Journal of Aerospace and Mechanical Engineering
No ratings yet
Fatigue Life Estimation Using Goodman Diagram: International Journal of Aerospace and Mechanical Engineering
11 pages
AAO CR3 - Clinical Accomodation Problems (Autosaved)
No ratings yet
AAO CR3 - Clinical Accomodation Problems (Autosaved)
17 pages
Resolution Numerical Methods of The Chapra Book With Python PDF
No ratings yet
Resolution Numerical Methods of The Chapra Book With Python PDF
160 pages
Muslim Scientists
No ratings yet
Muslim Scientists
3 pages
Planner+NBTS+2 0
No ratings yet
Planner+NBTS+2 0
1 page