NETAJI SUBHAS UNIVERSITY OF TECHNOLOGY

A STATE UNIVERSITY

UNDER DELHI ACT 06 OF 2018, GOVT. OF NCT OF DELHI

Azad Hind Fauj Marg, Sector-3, Dwarka, New Delhi-110078

SCHEME OF COURSES AND EXAMINATION

FOR
BACHELOR OF TECHNOLOGY
COMPUTER SCIENCE & ENGINEERING
(ARTIFICIAL INTELLIGENCE)

(Effective from the Session: 2019-2020)

APPROVED BY
The Senate in its II to VII meetings
The Board of Management in its meeting held on
August 14, 2019

1 | SCHEME OF COURSES AND EXAMINATION: B.Tech. CSE . (Artificial Intelligence), NSUT MAIN CAMPUS
Contents
1. INTRODUCTION ..................................................................................... 4
2. CURRICULUM STRUCTURE................................................................. 4
2.1 EVALUATION AND ASSESSMENT ........................................................... 5
2.2 SEMESTER WISE COURSE/CREDIT DISTRIBUTION............................... 8
2.3 COURSE CODE NOMENCLATURE ........................................................... 9
2.3.1 COURSE/DEPARTMENT/SPECIALIZATION/BRANCH CODING . .......... 9
2.3.2 B.TECH COURSE CODE NOMENCLATURE ...................................... 10
OTHER CORE AND ELECTIVE COURSES ............................................. 10
2.3.3 MOOCS (NPTEL BASED) FOUNDATION ELECTIVE COURSES AND
OPEN ELECTIVE COURSES: .................................................................... 10
2.3.4 STUDENT ROLL NUMBER NOMENCLATURE: .................................. 11
3 SEMESTER WISE COURSE ALLOCATION ................................................ 11
3.1 COURSE ALLOCATION FOR SEMESTER I ............................................ 11
3.2 COURSE ALLOCATION FOR SEMESTER II ........................................... 12
3.2 COURSE ALLOCATION FOR SEMESTER III .......................................... 13
3.3 COURSE ALLOCATION FOR SEMESTER IV .......................................... 14
4. SYLLABUS OF COURSES........................................................................... 15
4.1 SYLLABUS OF FOUNDATION COMPULSORY COURSES......................... 15
4.2 FOUNDATION ELECTIVE COURSES ..................................................... 28
4.2.1 LIST OF FOUNDATION ELECTIVES ................................................ 28
4.2.2 SYLLABI OF FOUNDATION ELECTIVES .......................................... 30
4.3 PROGRAM CORE COURSES ................................................................. 46
4.3.1 LIST OF PROGRAM CORE COURSES .............................................. 46
4.3.2 SYLLABI OF PROGRAM CORE COURSES : II SEMESTER ................ 47
4.3.3 SYLLABI OF PROGRAM CORE COURSES : III SEMESTER .............. 53
5. M.A. Mazidi et. al. “The 8051 Microcontroller and Embedded Systems:
Using Assembly and C” Pearson Publishers. .................................................. 67
4.3.4 SYLLABI OF PROGRAM CORE COURSES : IV SEMESTER ............... 68
1. An Introduction to Probability Theory and Its Applications, Vol. 1 (Wiley
Series in Probability and Statistics) by W. Feller, 1968 ................................. 78
4.3.5 SYLLABI OF PROGRAM CORE COURSES : V SEMESTER ................ 79
4.3.6 SYLLABI OF PROGRAM CORE COURSES : VI SEMESTER ............... 79
4.4 DEPARTMENT ELECTIVE COURSES .................................................... 79
4.4.1 LIST OF DEPARTMENT ELECTIVES ............................................... 79
4.4.2 SYLLABI OF DEPARTMENT ELECTIVES COURSES : V SEMESTER . 79
4.4.3 SYLLABI OF DEPARTMENT ELECTIVES COURSES : VI SEMESTER 79

2 | SCHEME OF COURSES AND EXAMINATION: B.Tech. CSE . (Artificial Intelligence), NSUT MAIN CAMPUS
 4.4.4 SYLLABI OF DEPARTMENT ELECTIVES COURSES : VII & VIII
SEMESTERS ........................................................................................... 79
4.5 OPEN ELECTIVE COURSES .................................................................. 79
4.5.1 LIST OF OPEN ELECTIVES ............................................................ 79
4.5.2 SYLLABI OF OPEN ELECTIVE COURSES : SCIENCES ..................... 79
4.5.3 SYLLABI OF OPEN ELECTIVE COURSES : HUMANITIES & SOCIAL
SCIENCES .............................................................................................. 79
4.5.4 SYLLABI OF OPEN ELECTIVE COURSES : MANAGEMENT .............. 79

3 | SCHEME OF COURSES AND EXAMINATION: B.Tech. CSE . (Artificial Intelligence), NSUT MAIN CAMPUS
1. INTRODUCTION
NSUT has embarked on its journey towards excellence in academics
through the introduction of a novel system of learning that is being
followed in many reputed universities globally. The Choice Based Credit
System (CBCS) has been proposed by University Grants Commission
(UGC) on recommendations of the National Knowledge Commission, to
improve the quality of higher education in India. NSUT proposes to adopt
CBCS for its Bachelor of Technology courses

CBCS is the mother of student centric educational reforms. A student is

provided with an academically rich, highly flexible learning system blended
with abundant provision for skill practice and activity orientation that
he/she could learn in depth without sacrificing his/her creativity. A
student can exercise the option to decide his/her own pace of learning-
slow, normal or accelerated plan and sequence his/her choice of paper,
learn to face challenges through term work/ project work and may venture
out to acquire extra knowledge/ proficiency through add- on facilities. The
great advantage of CBCS is that the learning process is made continuous
and the evaluation process is not only made continuous but also made
learner-centric and is designed to recognize the capability and talent of a
student.

2. CURRICULUM STRUCTURE
B.Tech. programme of the University shall be based upon CBCS and shall
have well defined Programme Educational Objectives (PEOs). All the
courses shall have well-defined Course Outcomes (COs).Courses shall be
of three kinds: Core, Elective and Foundation.

a. Core Course (CC): This is a course which is to be compulsorily studied

by a student as a core requirement to complete the requirements of the
B.Tech. programme.
b. Elective Course: This is a course which can be chosen from a pool of
elective courses. It is intended to support the discipline of study by

4 | SCHEME OF COURSES AND EXAMINATION: B.Tech. CSE . (Artificial Intelligence), NSUT MAIN CAMPUS
 providing an expanded scope, enabling exposure to another
discipline/domain and nurturing a student’s proficiency and skill. An
elective may be of the following types:
i. Discipline Centric Elective (ED): It is an elective course that adds
proficiency to the students in the discipline.
ii. Generic Elective (EG): It is an elective course taken from other
engineering subjects and enhances the generic proficiency and
interdisciplinary perspective of students.
iii. Open Elective (EO): It is an elective course taken from a common pool
of non-engineering disciplines that broadens the perspective of an
engineering student. These electives shall comprise two groups: Open
electives of the Humanities, Social Sciences and Management group
and Open electives of the Sciences group.
c. Foundation Course: A Foundation course leads to knowledge
enhancement and provides value-based training. Foundation courses
may be of two kinds:
i. Compulsory Foundation (FC): It is based upon the content that leads
to fundamental knowledge enhancement in Sciences, Humanities,
Social Sciences and Basic engineering. They are mandatory for all
disciplines.
ii. Elective Foundation (FE): It can be taken from among a common pool
of foundation courses which aim at value-based education. They may
provide hands-on training to improve competencies, skills or provide
education on human, societal, environmental and national values.
These shall be mandatory, non-credit courses, which do not carry
any credits but a student has to pass in order to be eligible for award
of degree.

2.1 EVALUATION AND ASSESSMENT

The performance of a student in a semester shall be evaluated through

continuous class assessment, MSE and ESE. Both the MSE and ESE shall
be University examinations and will be conducted as notified by the CoE of

5 | SCHEME OF COURSES AND EXAMINATION: B.Tech. CSE . (Artificial Intelligence), NSUT MAIN CAMPUS
the University. The marks for continuous assessment (Sessional marks) shall
be awarded at the end of the semester. The continuous assessment shall be
based on class tests, assignments/tutorials, quizzes/viva-voce and
attendance etc. The MSE/ESE shall comprise of written papers, practicals
and viva-voce, inspection of certified course work in classes and laboratories,
project work, design reports or by means of any combination of these
methods.

The weightage of each of these modes of evaluation for the different types of
courses shall be as per Table 1. Further, the mechanism for continuous
assessment shall be as per Table 2.

Table-1: Evaluation Scheme

S. Type of Continu Mid- End- Continu End-
N Course ous Semester Semester ous Semester
o. Assessm Examina Examina Assessm Examina
ent tion tion ent tion (ES)
(CA) (MSE) (ESE) (CA) Practical
Theory Theory Theory Practical
1 FE courses Continuous Assessment only (100 marks)

2 CC/FC/ED/E 25 25 50 Nil Nil

G/EO
Theory with
Tutorial
3 CC/FC/ED/ 15 15 40 15 15
EG/EO
Theory with
Practical
4 Project I and Nil Nil Nil 40 60
Project II
5 Training Nil Nil Nil 40 60
6 Work shop 30 -- 20 30 20
based Course
7 Audit - - - - -
Courses*
*The distribution of marks of practical and/or theory components for Audit
courses shall be determined by the respective Departments.

Table 2: Continuous Assessment

6 | SCHEME OF COURSES AND EXAMINATION: B.Tech. CSE . (Artificial Intelligence), NSUT MAIN CAMPUS
 S. Type of Course Continuous Assessment (CA)
No.
1 CC/FC/ED/EG/EO Two class tests, Assignments, Teachers’
assessment (quizzes, viva-voce, attendance)
Theory with
Tutorial
CC/FC/ED/EG/EO One class test, One Lab test,
Theory with Assignments/Projects, Teachers’ assessment
Practical
2 FE courses *** Two class tests, Assignments, Teachers’
assessment

3 Project I /II Mid-Semester Presentation, Report,

Supervisor’s Assessment

4 Training As specified by the Department

5 Audit Courses As specified by the Department

*** Foundation Elective Courses are value-based courses which may enhance
the proficiency /skill. These electives could be communication skills, Spoken
English, soft skills, Business and Management courses, entrepreneurship
development, Knowledge of an additional Foreign Language, Personality
Development through sports, music, theatre, dance, etc.

The University provides to the students a pool of Foundation elective courses

which may be offered by the following departments of the University:
i) Department of Humanities
ii)Department of Management
iii)Department of Personality Development

Note for Undergraduate students--

i)An Undergraduate student will have the liberty to choose any three
foundation elective course to study from the given list.
ii) He/She can take only one foundation elective course in an ongoing
semester.
iii) The study and clearing of foundation elective course is to be done by
the end of 2nd year (fourth semester).
iv) For getting a Degree, it is mandatory to clear the entire three chosen
foundation elective course.
v) Foundation elective courses are auditable course and there is no credits
awarded to the students.
Note for Course Teacher--
The evaluation of the student is done through continuous assessment.

7 | SCHEME OF COURSES AND EXAMINATION: B.Tech. CSE . (Artificial Intelligence), NSUT MAIN CAMPUS
[Subject having Theory only] --The course teacher evaluate through TWO
class tests (25 marks each), ONE Assignment/Project (40 marks) and internal
evaluation [one such component is attendance] (10 marks).
[Subject having Theory and Practical]—Here, a course teacher evaluate for
theory part through TWO class test (20 marks each) and internal evaluation
[one such component is attendance] (10 marks). Similarly, for practical part
ONE practical test (40 marks) and internal evaluation [one such component
is attendance] (10 marks)
[Subject having Practical only]—The course teacher takes TWO practical test
(45 marks each) and internal evaluation [one such component is attendance]
(10 marks)

2.2 SEMESTER WISE COURSE/CREDIT DISTRIBUTION

Table 3 :
Types of courses as per NSUT
Semest Nomenclature Courses/cred Credit
er FE F C E ED/EG/E Trainin its s
(NON- C C D O/ EO- g
CREDI Sciences Project
T) / EO-SS & etc.
Mgmt
I 01 0 0 0 00 00 06 courses
5 0 0 20 credits
II 00 0 0 0 00 00 06 courses
3 3 0 24 credits 84
III 01 0 0 0 00 00 06 courses credit
0 5 0 20 credits s
IV 01 0 0 0 00 00 06 courses
0 5 0 20 credits
V 00 0 0 -- -- 00 04 –07
0 4 courses
16-28 credits
VI 00 0 0 -- - 00 04 –07 86
0 4 courses credit
16-28 credits s
VII 00 0 0 -- -- 06 00 – 05
0 0 courses
06-26 credits
VIII 00 0 0 -- -- 08 00 – 05
0 0 courses
08-28 credits
TOTAL CREDITS 170
• ED : At least 4 courses (16 credits)
• EO- Sciences : At least 1 courses (04 credits)
• EO-SS & Mgmt : At least 2 courses (08 credits)
•

8 | SCHEME OF COURSES AND EXAMINATION: B.Tech. CSE . (Artificial Intelligence), NSUT MAIN CAMPUS
2.3 COURSE CODE NOMENCLATURE
The courses of various B.Tech programmes shall be assigned a course code as per
the following nomenclature

2.3.1 COURSE/DEPARTMENT/SPECIALIZATION/BRANCH CODING .

The courses of various B.Tech programmes shall be assigned a course code as per
the defined nomenclature (Given later). This nomenclature shall use
course/department/specialization/branch coding which are defined as given below.
TABLE 4: COURSE/DEPARTMENT CODES

Course Category Code FC

Foundation Core
XX FE
Foundation Elective
EO
Open Elective
BT
Bio Technology
CH
Chemistry
CP
Computer Engineering, East Campus
CS
Computer Science & Engineering
CW
Civil Engg, West Campus
EE
Electrical Engineering
EC
Electronics & Communication Engineering
Electronics & Communication Engineering,
Name of Department EP
East Campus
Code HS Humanities
YY
IC Instrumentation & Control Engineering
IT Information Technology
IW Information Technology, West Campus
ME Mechanical Engineering
MG Management
MP Manufacturing Process & Automation
MT Mathematics
MW Mechanical Engineering, West Campus
PD* Personality Development
PH Physics
Note : Second Alphabet P indicates East Campus, and W indicates West Campus

TABLE 5 : B.TECH SPECIALIZATION/BRANCH CODES

BT Bio Technology
CA Computer Science & Engineering with Artificial Intelligence
Computer Science and Engineering (Big Data Analytics)
CB
(CSDA)(NSUT EAST CAMPUS)
CD Computer Science and Engineering (Data Science) (CSDS)
CE Civil Engineering (CE)(NSUT WEST CAMPUS)
ZZ CG Geoinformatics (GI)(NSUT WEST CAMPUS)
CI Computer Science and Engineering (IOT) (CIOT)(EAST CAMPUS)
CM Mathematics & Computing
CO Computer Science & Engineering, Main Campus
Electronics and Communication Engineering (Artificial Intelligence
EA
and Machine Learning) (ECAM) (NSUT EAST CAMPUS)
EC Electronics & Communication Engineering

9 | SCHEME OF COURSES AND EXAMINATION: B.Tech. CSE . (Artificial Intelligence), NSUT MAIN CAMPUS
 EI Electronics & Communication Engineering (Internet of Things)
EE Electrical Engineering
IC Instrumentation & Control Engineering
Information Technology (Internet of Things) (IIOT)(NSUT WEST
II
CAMPUS)
IN Information Technology (Network security)
IT Information Technology
ME Mechanical Engineering
MP Manufacturing Process & Automation
Mechanical Engineering (Electric Vehicles) (MEEV)(NSUT WEST
MV
CAMPUS)

2.3.2 B.TECH COURSE CODE NOMENCLATURE

FOUNDATION CORE AND ELECTIVE COURSES AND OPEN ELECTIVE
COURSES:
Course Offering Department Code Course No.
Category
X X Y Y 0 * *
** can take numeric values only
XX and YY maybe chosen as given in Tables 1,2:
*PD offers FE courses like music, dance, yoga, sports, NSS, etc. A BOS for FE
courses of PD nature (like Music, Dance, Yoga, NSS, etc), has be constituted
with Dean Academics as the chairperson.
OTHER CORE AND ELECTIVE COURSES:
Program Code Offering Department Course Category Course No.
Code
Z Z Y Y C/E * *
** can take numeric only;
C for Core and E for Elective (Discipline Centric);
YY and ZZ maybe chosen as given in Tables 1,2.

2.3.3 MOOCS (NPTEL BASED) FOUNDATION ELECTIVE COURSES AND

OPEN ELECTIVE COURSES:
Course Offering Department UG/PG Course No.
Category (NPTEL) Code
X X F F G * *
** can take numeric only;

XX Course Category Code FE Foundation Elective

EO Open Elective

10 | SCHEME OF COURSES AND EXAMINATION: B.Tech. CSE . (Artificial Intelligence), NSUT MAIN CAMPUS
 Humanities & Social
NH
Sciences
FF Name of Offering Department Code NM Management
for NPTEL NP Personality Development
NS Sciences
G UG/PG 0 B.Tech
I M.Tech

2.3.4 STUDENT ROLL NUMBER NOMENCLATURE:

Students shall be assigned roll numbers as given below.
1. B.Tech:
Year of Admission U ZZ (FROM TABLE 2) 4 DIGIT NUMBER

3 SEMESTER WISE COURSE ALLOCATION

3.1 COURSE ALLOCATION FOR SEMESTER I

Refer to the separate manual on Equivalent courses and scheme of courses with
pre-requites if you want to find the linked courses and pre_requisites for opting for
EG courses.

B.Tech - Computer Science & Engineering (Artificial Intelligence) SEMESTER I

Evaluation Scheme
(Percentage
AICTE
Course Typ Cre
weights) Offerin COURS
Course L T P dits Practic E
Code e Theory g Dept.
al TYPE
C M E C E
A S S A S
Mathematic BASIC
FCMT001 FC 3 1 0 4 25 25 50 - - Maths SCIEN
s-I CES
FCCS002 Computer ENGG
1 CSE/ SCIEN
/FCHS00 FC Programmi 3 0 2 4 15 15 40 15
5 CES/
IT
5 ng /English HUSS
Electronics
ECE/ ENGG
and 1
FCEC003 FC 3 0 2 4 15 15 40 15
5 ICE SCIEN
Electrical CES
/EE
Engineering
Physics/En
PHYSI
FCPH004 vironment BASIC
1 CS/
/ FC Science and 3 0 2 4 15 15 40 15 SCIEN
5 CHEMI CES
FCCH008 Green
STRY
Chemistry
Basics of ENGG
FCME006 MPAE/
FC Mechanical 4 0 0 4 25 25 50 - - SCIEN
ME CES
Engg.
Elective MAND
FEXXxxx NI ATORY
FE Foundation - - - - - - - - - COURS
2* L
E

11 | SCHEME OF COURSES AND EXAMINATION: B.Tech. CSE . (Artificial Intelligence), NSUT MAIN CAMPUS
 28
contac
t 20
hours
2*
1: One week induction program as per AICTE norms. Classes for I semester will
commence one week later.
2*: The course codes, LTP distribution and Evaluation Scheme for Foundation
Electives are given in Table 3 (list under preparation). The actual weekly load
depends upon the Foundation Elective Course.

Students of the Departments of Group I shall be offered courses as follows:

1. Semester I : Computer Programming, Physics
2. Semester II : English, Environment Science and Green
Chemistry
Students of the Departments of Group II shall be offered courses as follows:
1. Semester I : English, Environment Science and Green
Chemistry
2. Semester II : Computer Programming, Physics

3.2 COURSE ALLOCATION FOR SEMESTER II

B.Tech. Computer Science & Engineering (Artificial Intelligence) SEMESTER II

Evaluation Scheme
(Percentage weights) AICTE
Offeri
Course Ty Credit COURS
Course L T P Theory Practical ng
No. pe s E
Dept.
C M E C E TYPE
A S S A S
FCHS00
English ENGG
5 F /Computer 1 4 1 1 CSE/ SCIENC
3 0 2 4 15
/FCCS0 C Programmin 5 0 5 5 IT ES/
02 HUSS
g
Mathematics BASIC
FCMT00 F 2 5
-II 3 1 0 4 25 - - MATH SCIENC
7 C 5 0
ES
S
Environment CHE
FCCH00 Science and MIST BASIC
8/ F 1 4 1 1
FCPH00 Green 3 0 2 4 15 RY/ SCIENC
C 5 0 5 5
ES
4 Chem./ PHYS
Physics ICS
CACSC01 CC Discrete 3 1 0 4 25 25 50 - - PROGRA
CSE
Structures M CORE/
CACSC02 CC Data Structures 3 0 2 4 15 15 40 15 15 CSE ENGG
CAECC03 CC Digital Logic 3 0 2 4 15 15 40 15 15 SCIENCE
ECE
Design S
24
24
2*
2*: The actual weekly load depends upon the Core Courses offered by the
Department

12 | SCHEME OF COURSES AND EXAMINATION: B.Tech. CSE . (Artificial Intelligence), NSUT MAIN CAMPUS
 3.2 COURSE ALLOCATION FOR SEMESTER III

B.Tech. Computer Science & Engineering (Artificial Intelligence) SEMESTER III

Evaluation Scheme
(Percentage weights)
Offeri AICTE
Course Ty Cred Practic
Course L T P Theory ng COURSE
No. pe its al
Dept. TYPE
C M E C E
A S S A S
CACSC Web 1 1 4 1 1 PROGRA
CC 3 0 2 4 CSE
04 Technology 5 5 0 5 5 M CORE
Database
CACSC 1 1 4 1 1 PROGRA
CC Managemen 3 0 2 4 CSE
05 5 5 0 5 5 M CORE
t Systems
Design and
CACSC 1 1 4 1 1 PROGRA
CC Analysis of 3 0 2 4 CSE
06 5 5 0 5 5 M CORE
Algorithms
Computer
Architectur
CACSC 2 2 5 PROGRA
CC e and 3 1 0 4 - - CSE
07 5 5 0 M CORE
Organizatio
n
Microproce
CAECC ssor and 1 1 4 1 1 ENGG
CC 3 0 2 4 ECE
08 Microcontro 5 5 0 5 5 SCIENCES
llers
FE** FE Elective - - - NIL - - - - - - MANDAT
*02 Foundation ORY
* COURSE
20* 20
*: The actual weekly load depends upon the Core Courses defined by the Department

13 | SCHEME OF COURSES AND EXAMINATION: B.Tech. CSE . (Artificial Intelligence), NSUT MAIN CAMPUS
 3.3 COURSE ALLOCATION FOR SEMESTER IV

B.Tech. Computer Science & Engineering (Artificial Intelligence) SEMESTER IV

Evaluation
Scheme
(Percentage AICTE
Course weights) Offering
Type Course L T P Credits COURSE
No. Dept.
Theory Practical TYPE

CA MS ES CA ES

CACSC09 CC Operating Systems 302 4 15 15 40 15 15 PROGRAM

CSE
CORE
Theory of Automata & PROGRAM
CACSC10 CC 310 4 25 25 50 CSE
Formal languages CORE
CACSC11 CC Artificial Intelligence PROGRAM
302 4 15 15 40 15 15 CSE
CORE
CAECC12 ENGG
CC Data Communication 3 0 2 4 15 15 40 15 15 ECE
SCIENCES
Probability and BASIC
CAMTC13 CC 310 4 25 25 50 MATHS
Stochastic Processes SCIENCES
FExxx03* FE Elective Foundation -- - NIL - - - - - MANDATORY
-
COURSE
28
20
2*
2*: The actual weekly load depends upon the elective chosen by the student under FE.

14 | SCHEME OF COURSES AND EXAMINATION: B.Tech. CSE . (Artificial Intelligence), NSUT MAIN CAMPUS
4. SYLLABUS OF COURSES
4.1 SYLLABUS OF FOUNDATION COMPULSORY COURSES
Course No. Title of the Course Course Pre-requisite
Structure
FCMT001 Mathematics - I 3L - 1T - 0P None
COURSE OUTCOMES (COs):
1. Analyze and test Infinite Series and its convergence,
2. Successive differentiation and expansion of the function,
3. Curvature and Radius of Curvature in different coordinate systems,
4. Applications of definite integral,
5. Consistency of system of equations, Eigenvalue and Eigenvector.
PO PO 1 PO PO PO PO PO PO PO PO PO PO11 PO12
2 3 4 5 6 7 8 9 10

CO

CO 3 2 2 2 2 - - - - - - -
1

CO 3 2 2 2 2 - - - - - - -
2

CO 3 2 2 2 2 - - - - - - -
3

CO 3 2 2 2 2 - - - - - - -
4

CO 3 2 2 2 2 - - - - - - -
5

COURSE CONTENT:

UNIT-I
Infinite Series: Tests for convergence of series: p-series (with proof),
Comparison of ratios, Ratio, Integral, Raabe’s, Logarithmic and Cauchy’s
nth root (all tests without proofs), Alternating series, Absolute convergence,
Conditional convergence. Function of Single

UNIT-II
Variable: Hyperbolic functions, inverse hyperbolic function, successive
differentiation, Leibniz theorem, Taylor’s and Maclaurin’s theorems (without
remainder terms).

UNIT-III
Curvature: Polar Curves, Differential coefficients of length of arc, Cartesian,
polar and parametric forms, pedal equation, Angle between tangent and
radius vector, Curvature and Radius of Curvature in Cartesian, polar and
pedal forms.

15 | SCHEME OF COURSES AND EXAMINATION: B.Tech. CSE . (Artificial Intelligence), NSUT MAIN CAMPUS
UNIT-IV
Applications of definite integral: Asymptotes (in Cartesian), elementary
knowledge of curve tracing, area, length, surface area and volume of
revolution (in Cartesian, parametric and polar co-ordinates).

UNIT-V
Matrices: Elementary row transformation, Rank of matrix, consistency and
inconsistency of system of simultaneous equations, solution of non-
homogeneous and homogeneous equations, Eigenvalue and Eigenvector,
Characteristic equation, Cayley-Hamilton theorem. Modal matrix
SUGGESTED READINGS:
1. Calculus and Analytic Geometry by G.B. Thomas (Pearson Education)
2. Advanced Engineering Mathematics by Erwin Kreyszig (Wiley
Publication)
3. Advanced Engineering Mathematics by Michael Greenberg (Pearson
Education)
4. Advanced Engineering Mathematics by R. K. Jain and S.R.K. Iyenger
(Narosa
Publication)
5. Higher Engineering Mathematics by B. S. Grewal (Khanna Publication)

Course No. Title of the Course Pre-requisite

Course Structure
FCCS002 Computer 3L - 0T - 2P None
Programming
COURSE OUTCOMES (COs):
1. To understand the basic terminology and program structures used
in computer programming to solve real world problems.
2. To understand the need for continuing to learn new languages to
solve complex problems in different domains.
3. To learn the process of representing problems and writing, compiling
and debugging programs.
4. To develop programming skills in using different types of data,
decision structures, loops functions, pointers, data files and
dynamic memory allocation/de-allocation.
5. To be able to code using Procedural and Object-Oriented languages.
PO PO 1 PO 2 PO 3 PO 4 PO 5 PO 6 PO 7 PO 8 PO 9 PO 10 PO11 PO12

CO

CO 1 3 2 2 2 2 - - - - - - -

CO 2 3 2 2 2 2 - - - - - - -

CO 3 3 2 2 2 2 - - - - - - -

16 | SCHEME OF COURSES AND EXAMINATION: B.Tech. CSE . (Artificial Intelligence), NSUT MAIN CAMPUS
CO 4 3 2 2 2 2 - - - - - - -

CO 5 3 2 2 2 2 - - - - - - -

COURSE CONTENT:
UNIT-I
Basics of C: Basic features of C Language like Identifier, Keywords, Variable,
data types, Operators and Expression, basic screen and keyboard I/O,
Control Statements, iteration, nested loops, Enumerated data types, bitwise
operators, C Preprocessor statements. [6
hours]

UNIT-II
Arrays and Pointers: One and multidimensional dimensional arrays, strings
arrays, operations on strings, Array and Pointers, Pointer to Pointer, other
aspect of pointers, User Defined Data Types: Structures, Unions.
[6 hours]

UNIT-III
Functions: Concept of modular programming, Using functions, Scope of
data, Recursive functions, Pointers and functions, Command line
arguments.
Files: Types of files, working with files, usage of file management functions.
[6
hours]

UNIT-IV
Overview of Object Oriented Programming: Python Programming, Concepts
and Terminology. Data Types and Collection Data Types: Identifiers and
keyword, Integral types floating point types, operations and formatting,
Sequence types, Tuples, named Tuples, lists, set Types, sets, frozen sets,
mapping types, Dictionaries, Iterating and Copying collections iterators and
interactable operations and functions copying collection.

Central Structures and Functions: Conditional branching, looping,

Exception handling catching and raising exceptions, custom exceptions
custom functions, Names and Docstrings, Argument and Parameter
unpacking, Accessing variables in Global scope, lambda functions.
[9 hours]

UNIT-V

17 | SCHEME OF COURSES AND EXAMINATION: B.Tech. CSE . (Artificial Intelligence), NSUT MAIN CAMPUS
Modules and Packages: Packages, custom modules, overview of python’s
standard library, string handling, mathematics and Numbers, Times and
dates, File formats, Data persistence.
File Handling: Writing and Reading binary data, raw binary data,
compression, parsing text files, Random Access binary files, generic binary
record file class.
[9
hours]
Guidelines for practical work:
Programs based on concepts of above languages.
SUGGESTED READINGS:
1. B. W. Kernighan and D.M. Ritchie, “The C programming language”,
Prentice Hall.
2. Herbert Schildt and Tata McGraw Hill, “The Complete Reference”.
3. O Reilly Learning Python
4. Programming in Python 3: A Complete Introduction to the Python
Language Pearson by Mark Summerfield

Course Type Title of the Credi Course Pre-

Course ts Structur Requisite
e
FCEC003 ELECTRONI 4 3-0-2 None
CS AND
ELECTRICA
L
ENGINEERI
NG
Course Outcomes:
1. To understand the basics of AC and DC circuits, transformers along with
DC generator and motor
2. To analyze series-parallel RLC circuits and
3. To implement basic circuits using diodes, BJTs and op-amps as circuit
elements
4. To get familiarized with OP-AMP and its applications
5. To develop circuits using basic electrical and electronic components

18 | SCHEME OF COURSES AND EXAMINATION: B.Tech. CSE . (Artificial Intelligence), NSUT MAIN CAMPUS
PO PO PO PO PO PO PO PO PO PO PO PO11 PO12
1 2 3 4 5 6 7 8 9 10

CO
CO 1 3 2 2 2 2 - - - - - - -

CO 2 3 2 2 2 2 - - - - - - -

CO 3 3 2 2 2 2 - - - - - - -

CO 4 3 2 2 2 2 - - - - - - -

CO 5 3 2 2 2 2 - - - - - - -

COURSE CONTENT
Unit-I
Electric Circuits: Basic Circuit Elements, Nodal and Loop Analysis,
Superposition, Thevenin’s Theorem & Norton’s Theorem and Maximum
Power Transfer Theorem;
Unit-II
Steady-state analysis of AC circuits: Sinusoidal and phasor representation
of Voltage and current, single phase AC circuit, behavior of R, L and C

Combination of R, L and C in series and parallel, Resonance; Introduction

to three-phase circuits, Star-Delta Transformation
Unit-III
Transformers: Principle of operation and construction of single-phase
transformer, Introduction to DC Motor.
Electronics Devices and Circuits: Junction Diode, Applications: rectifiers,
clipping and clamping circuits, LEDs;
Unit-IV
Bipolar-junction Transistor: Physical operation, operating point, load-line,
Self-bias circuit, single-stage CE amplifier configuration

Ideal op-amp, inverting, non-inverting and unity gain amplifiers, integrator,

differentiator, summer/subtractor.
Unit-V
Digital circuits- Boolean Algebra, logic gates, K-Maps upto 4-variables,
Combinational circuits: Adders and subtractors.
Flip-Flops: SR, JK, D, T and their characteristic tables. Introduction to
Sensors, Introduction to Embedded Computers.
List of experiments for Electrical and Electronics Engineering
1. Verification of Maximum Power Transfer theorem
2. Verification of Thevenin’s and Norton’s theorems
3. Study of resonance in series RLC and parallel RLC circuits
4. Analysis of step-up and step-down transformer

19 | SCHEME OF COURSES AND EXAMINATION: B.Tech. CSE . (Artificial Intelligence), NSUT MAIN CAMPUS
 5. Implement of series RC circuit as differentiator and integrator. Also
perform their analysis as low pass and high pass filters
6. Implementation of clipping and clamping circuits
7. Implementation of half-wave and full wave rectifier circuits
8. Application of LEDs in electronic circuits
9. Implementation of CE amplifying configuration. Plot gain vs frequency
graph
10. Implementation of Adders and subtractors.
11. Implementation of JK and Toggle flip-flops. Subsequently implement
3-bit asynchronous up-counter.
12. Measurement of power in single phase circuits using three voltmeter
and three ammeter method.
13. Experiments with common sensors
14. Experiment with embedded computers
Suggested Reading:
1. M.E. Van Valkenburg, “Network Analysis” Pearson publishers, 3rd
Edition
2. Boylestad and Nashelsky, “Electronic Devices and Circuit Theory”
Pearson publishers, 10th Edition
3. Edward Hughes, “Electrical and Electronic technology”, Pearson
publishers, 10th Edition
4. Malvino and Leach, ” Digital Principles and Applications”, TMH
publishers, 8th Edition

Course No. Title of the Course Course Structure Pre-Requisite

FCPH004 Physics 3L-0T-2P None
COURSE OUTCOMESS (CO):
1. Knowing important concepts and phenomena linked to relativity
2. The concept of waves and oscillations are useful for doing analytical and
numerical calculations for measurements, observations and
gravitational wave communications.
3. The course is helpful to the students in understanding various optical
wave phenomena which are required for optical & electromagnetic wave
communications and in optical devices.
4. To develop the basic understanding of laser for gaining advance
knowledge in the field of optical communication and opto-electronics.
5. The Concepts of Optical Fiber for modern developments in physics
which are helpful in designing and developing new devices used in
optical communications, medicine, environment, Industries and related
physics.

20 | SCHEME OF COURSES AND EXAMINATION: B.Tech. CSE . (Artificial Intelligence), NSUT MAIN CAMPUS
PO PO PO PO PO PO PO PO PO PO PO PO PO
CO 1 2 3 4 5 6 7 8 9 10 11 12
CO 3 2 2 2 2 1 - - - - - -
1
CO 3 2 2 2 2 1 - - - - - -
2
CO 3 2 2 2 2 1 - - - - - -
3
CO 3 2 2 2 2 1 - - - - - -
4
CO 3 2 2 2 2 1 3 - - - - -
5
COURSE CONTENT:

UNIT-I
Relativity: Special Relativity, Lorentz Transformations, Velocity addition,
Time dilation, Length Contraction, Variation of mass with velocity, Mass
and energy, Relativistic momentum and relativistic energy, General theory
of relativity, Einstein’s theory of Gravitation, Gravitational waves, Gravity
and Light.

UNIT-II
Oscillations and Waves: Damped and forced oscillations, Sharpness of
resonance, Q-factor, Application in resonance, Acoustic waves, Pressure
wave equations, Intensity pressure relation, Acoustic impedance, Reflection
and transmission of acoustic waves, Impedance matching; Ultrasonics and
its applications.

UNIT-III
Optics: Interference: Interference due to thin films, Newton’s rings, and
determination of the wavelength of sodium light, Interference due to wedge
shaped film. Diffraction: Fraunhofer diffraction due to single slit and N Slits,
Plane transmission grating, Rayleigh criterion of resolution, Resolving
power of a grating, Polarization: Polarization in light, Birefringence, Nicol
prism, Quarter and half wave plates, Production and analysis of plane,
Circularly and elliptically polarized light, Optical rotation, specific rotation,
Polarimeter.

UNIT-IV
Lasers: Absorption and emission of radiation, Main features of a laser,
Spatial and temporal coherence, Einstein Coefficients, condition for light
amplification, Basic requirement for Laser, Population Inversion - Threshold
Condition, Line shape function, Optical Resonators, Three level and four
level systems. Classification of Lasers: Solid State Laser-Ruby laser and Gas
Laser- He-Ne laser (Principle, Construction and working), Optical properties
of semiconductor, Semiconductor laser (Principle, Construction and
working), Applications of lasers in the field of medicine, Industry,
Environment and Communication.

21 | SCHEME OF COURSES AND EXAMINATION: B.Tech. CSE . (Artificial Intelligence), NSUT MAIN CAMPUS
UNIT-V
Fibre Optics: Need for fiber Optic Communication, Physical nature of
Optical fiber, Theory of Light propagation in optical fiber, Acceptance angle
and numerical aperture, Step index and graded index fibers, Single mode
and multimode fibers, Losses in optical fiber, Optical Fiber cables and
bundles, Dispersion in optical fibers: Intermodal and Intramodal dispersion.

List of Experiments:
1. To determine the value of “g” by Bar Pendulum and find the radius of
gyration.
2. To determine the wavelength of He-Ne laser.
3. To find the numerical aperture and angle of acceptance of optical fiber.
4. To find the resolving power of a telescope.
5. To find the wavelength of sodium light by Newton’s ring.
6. To find the wavelength of sodium light by Biprism.
7. To find the wavelength of Mercury green line by diffraction grating using
spectrometer.
8. To find the focal length of combination of two lenses by Nodal slide
assembly and verify the formula.
9. To find the specific rotation of canesugar by polarimeter.
10. To find the dispersive power of prism material using spectrometer.
Text Books:
T1 Arthur Beiser, Shobhit Mahajan, `` Concepts of Modern Physics,’’ Mc-
Graw Hill
T2 D S Mathur, ``Mechanics,’’ S Chand & co.
T3 N. Subramaniam and Brij Lal, ``A Text Book of Optics,’’ S Chand &Co.
T4 A K Jha “A Text Book of Applied Physics, Volume-1” I.K. International
Publishing House.
T5 Indu Prakash, ``A Text Book of Practical Physics, Volume-1,’’ Kitab Mahal
Publication.
Reference:
R1 Serwey, Moses, Moyer, ``Modern Physics,’’ Cengage Learning
R2 Jenkins and White, ``Fundamentals of Optics,’’ McGraw Hill
R3 Ajay Ghatak “Optics” McGraw Hill

SYLLABUS OF CORE ENGLISH

Course No. Title of the Course Course Prerequisite

Structure

FCHS 005 Core English 3L 0T 2P None

22 | SCHEME OF COURSES AND EXAMINATION: B.Tech. CSE . (Artificial Intelligence), NSUT MAIN CAMPUS
Course Outcomes

CO 1: Acquire competence in Basic English grammar. Grammatical accuracy,

avoiding inappropriacy and using language naturally and confidently
CO 2: Improve in the four integral skills of language and to be able to use language
as a tool for effective communication
CO 3: Enable the learner to express and be understood by others with clarity and
precision, in both written and spoken forms, minimizing ambiguity and verbosity.
CO 4: Understand creative use of language through translation, articles and
paragraph writing.
CO 5: Reading: Encouraging the habit of reading for different purposes and to
analyse, paraphrase and read critically.
CO 6: Develop competence in formal Standard English pronunciation and usage
CO 7: Build confidence to use a standard spoken form of English to face job
interviews, and workplace interactive situations besides enabling the learner to
pursue advanced professional courses.

COs. Theory Hours Lab

1. 1. Vocabulary 4 Lab Activity No 1: Phonetics:

Enhancement CO 1 Sounds Used in English Language
CO 6
1.1 Using a standard
dictionary- word spellings,
meanings, usage,
pronunciation, making Lab Activity No 2: Reading from
sentences newspapers/magazines/blogs to
build up a repertoire of words CO
1.2 Word collocations 5

1.3 Commonly misused words,

verbal reasoning

1.4 One word substitutions

1.5 Abbreviations & foreign

phrases

2. 2. Remedial & Applied 6 Lab Activity No 3: Introducing

Grammar CO1 & CO 2 Oneself: Breaking the Ice CO 5

2.1 Tenses & Voice

2.2 Subject-Verb Agreement

23 | SCHEME OF COURSES AND EXAMINATION: B.Tech. CSE . (Artificial Intelligence), NSUT MAIN CAMPUS
 2.3Narration,Interrogative
structures and Question tags
Lab Activity No 4: Situational &
2.4 Prepositions, Pronouns and Spontaneous English(tense,
Adverbs registers) through Role Play CO 7

2.5 Redundancy

2.6 Idiomatic use of language Lab Activity No 5: Question

Formation & Mock Press
2.7 Identification of errors and Conference CO 5
editing

3. 3 Techniques of Good 10 Lab Activity No 6: Blog

Writing CO 5 & CO 2 & 3 Writing/Creating a Newsletter

3.1Writing self assessment Lab Activity No 7: Script writing &

tasks enacting for a street play

3.2 Precis writing and note- CO 6

making.

3.3 Paragraph and Essay

writing.

3.4 Article writing and

summarizing

4. 4. Business Communication: 10 Lab Activity No

CO 4 & CO 3 7: Communication at
Workplace. Develop
4.1 Formal and Informal Letter negotiating skills by using
writing appropriate language of courtesy

4.2 Statement of Purpose Lab Activity No 8: Recording

individual efforts and holding
4.3 Job application & CV paired interactions and Group
(summary statement of Discussions
academic & professional
profiles) Lab Activity No 9: Preparing and
practising for Interviews.
4.4Power point presentations
through relevant slides. CO 7

24 | SCHEME OF COURSES AND EXAMINATION: B.Tech. CSE . (Artificial Intelligence), NSUT MAIN CAMPUS
 5. 5.Written Comprehension CO 10 Lab Activity No 10:)Introduction
3&4 to Podcast and Understanding
Audio texts
5.1 The ability to write after
listening to and reading select Lab Activity No 11: Declamation
speeches, news bulletins, and/or speeches
presentations and answering
questions based on what has
been heard.
Lab Activity No 12: Reading, GD
5.2 Reading the given texts to and presentation based on listed
skim, scan, infer and answer texts
comprehension questions.
CO 7
5.3 Reading texts like case
studies and project reports for
critical assessment.

5.4 Book Review

Course No Title of the Course Course Pre-Requisite

Structure
FCME006 Basics of Mechanical L-T-P: 4-0-0 None
Engineering
COURSE OUTCOMES (COs)
After completion of this course, the students are expected to be able to
demonstrate the following knowledge, skills and attitudes:
1. To know force, its nature and applications.
2. To know the basic principles of civil and mechanical structures.
3. To understand the fundamentals of thermodynamics and fluid
mechanics.
4. To know the working principles of IC Engines.
5. To understand the importance of different engineering materials.
6. To understand the different manufacturing processes and machining
operations.
7. To know the use of Automation in manufacturing.

25 | SCHEME OF COURSES AND EXAMINATION: B.Tech. CSE . (Artificial Intelligence), NSUT MAIN CAMPUS
PO PO 1 PO PO PO PO PO PO PO PO PO PO11 PO12
CO 2 3 4 5 6 7 8 9 10
CO 1 3 2 2 1 1 - - - - - - -

CO 2 3 2 2 1 1 - - - - - - -

CO 3 3 2 2 2 2 1 - - - - - -

CO 4 3 2 2 2 2 1 - - - - - -

CO 5 3 2 2 2 2 1 - - - - - -

CO 6 3 2 2 2 2 1 - - - - - -

CO 7 3 2 2 2 2 1 - - - - - -

COURSE CONTENT
Group A
Unit-I
Introduction to Engineering Mechanics: Rigid and Elastic bodies, Force and
its type, Law of parallelogram of forces, Triangle law of forces, Polygon law
of forces, Lami’s theorem, Laws of motion, Moment, Couple, Varignon’s
theorem, Conditions of equilibrium, Concept of free body diagram,
Coulomb’s friction, Plane trusses, Analysis of trusses, Numerical problems.
(6 Hours)

Unit-II
Introduction to Strength of Materials: Simple stresses and strains, Direct,
shear, and volumetric stresses and strains, Hooke’s law, Tension test,
Elastic constants, Poisson’s ratio, Factor of safety, Introduction to beam,
Types of beams, Types of loads, Shear force and bending moment diagrams
(SFD and BMD) for Simple and Cantilever beams under various loading
conditions, Numerical problems. (6 Hours)

Unit-III
Introduction to Manufacturing Engineering: Classification and use of
engineering materials, Basic principles and applications of methods of
manufacturing such as casting, forming and joining; Working principles
and applications of machining operations such as Turning, Thread cutting,
Milling, Shaping, Grinding, etc., Use of automation in manufacturing.
(6 Hours)
Group B
Unit-IV
Introduction to Thermodynamics: Thermodynamic system, Cycle, Path,
Thermodynamic properties, Extensive and intensive properties,
Thermodynamic equilibrium, Reversible and irreversible processes,
isochoric, Isothermal, Isobaric, Isentropic and Polytropic processes, First

26 | SCHEME OF COURSES AND EXAMINATION: B.Tech. CSE . (Artificial Intelligence), NSUT MAIN CAMPUS
law of thermodynamics applied to a cycle and process, Kelvin-Planck and
Clausius statements of Second law of thermodynamics, Carnot cycle,
Entropy, Clausius inequality, Internal combustion (IC) engines, IC
engines terminology, Spark ignition (SI) and Compression ignition (CI)
engines, Two and four stroke engines, Air standard cycles such as Otto,
Diesel, Dual and Brayton cycles, Numerical problems.
(12 Hours)

Unit-V
Introduction to Fluid Mechanics: Properties of a fluid, Density, Specific
volume, Specific weight, Specific gravity, Kinetic and Kinematic viscosity,
Pascal’s law and its applications, Laminar and turbulent flow, Use of
continuity equation and Bernoulli’s equation, Numerical problems.
(6 Hours)
SUGGESTED READINGS
1. Engineering Mechanics- Beer and Johnston, Pearson
2. Strength of Materials- D.K. Singh, CRC Press
3. Engineering Thermodynamics- Nag, McGraw-Hill
4. Fluid Mechanics- Cengel, McGraw-Hill
5. Fundamentals of Manufacturing Engineering- D.K. Singh, CRC Press

Course No. Title of the Course Course Structure Pre-Requisite

FCMT007 Mathematics II 3L-1T-0P None

COURSE OUTCOMES (CO)

1. Ordinary Differential Equations,
2. Partial Derivatives, Maxima and Minima for functions of two or more
variables,
3. Evaluation of double and triple integral,
4. Concept of Numerical Methods and its Applications,
5. Concept of Probability and Statistics and its Applications.

COURSE CONTENT:

UNIT-I Ordinary Differential Equations:

Second & higher order linear differential equation with constant coefficients,
general solution of homogenous and non-homogenous equations, Euler-
Cauchy equation, Series solution by Frobenius method.

UNIT-II Function of Several Variables:

Partial Derivatives, Euler’s Theorem, Total differentiations, Change of Variables,
Jacobian and its basic properties, Taylor’s theorem, Maxima and Minima for
functions of two or more variables, Lagrange’s method of undetermined multipliers.

27 | SCHEME OF COURSES AND EXAMINATION: B.Tech. CSE . (Artificial Intelligence), NSUT MAIN CAMPUS
UNIT-III Multiple Integrals:
Evaluation of double integral (in Cartesian and polar co-ordinates), change of order
of integration, change of variables. Triple integral (in Cartesian) and its
applications. Gamma and beta function.

UNIT-IV Numerical Methods:

Solution of system of linear equations using Gauss elimination method, LU
decomposition method Gauss Seidel iteration method, Solution of polynomial
and Transcendental equations by Newton-Raphson method, Numerical
Integration by trapezoidal rule and Simpson’s 1/3 and 3/8 rule, Numerical
Solutions of first order ordinary differential equations: Euler’s method, Runge-
Kutta method of fourth order.

UNIT-V Probability and Statistics:

Conditional probability, Random Variables, Probability distribution functions-
binomial, Poisson, exponential, uniform and normal distributions; Correlation,
rank correlation and regression analysis; Sampling Theorem.
Recommended Books:
1. Calculus and Analytic Geometry by G.B. Thomas (Pearson Education)
2. Advanced Engineering Mathematics by Erwin Kreyszig (Wiley Publication)
3. Advanced Engineering Mathematics by Michael Greenberg (Pearson
Education)
4. Advanced Engineering Mathematics by R. K. Jain and S.R.K. Iyenger
(Narosa Publication)
5. Higher Engineering Mathematics by B. S. Grewal (Khanna Publication)
6. Probability and Statistics for Engineers by Anthony J. Hayter (Cengage
Learning)
7. Numerical Methods for Scientific and Engg. Computations by M. K. Jain, S.
R. K. Iyenger and R. K. Jain, ( Wiley Eastern Ltd.)

4.2 FOUNDATION ELECTIVE COURSES

4.2.1 LIST OF FOUNDATION ELECTIVES

Table 3: FOUNDATION ELECTIVES

Code Name of LTP Evaluation Scheme Pre-
Foundation Allocatio Theory Practical Requisite
Elective n s
L T P CA M E CA E
S S S
FEPD001 Sports-I 0 0 4 - - - 10 - None
0
FEPD002 Sports-II 0 0 4 - - - 10 - FE001
0
FEPD003 NSS 0 0 4 - - - 10 - None
0

28 | SCHEME OF COURSES AND EXAMINATION: B.Tech. CSE . (Artificial Intelligence), NSUT MAIN CAMPUS
FEPD004 NCC 0 0 4 - - - 10 - None
0
FEMG00 Corporate 2 0 0 10 - - - - None
5 Social 0
Responsibilit
y
FEPD006 Music 0 0 4 - - - 10 - None
0
FEHS007 Basic of 2 0 0 10 - - - - None
social 0
sciences
FEHS008 Spoken Skills 0 0 4 - - - 10 - None
in English 0
FEMG00 Financial 2 0 0 10 - - - - None
9 Literacy 0
FEHS010 Introduction 2 0 0 10 - - - - None
to Ethics 0
FEHS011 Stress 1 0 2 50 - - 50 - None
Management
FEHS012 Organization 2 0 0 10 - - - - None
al Behavior 0
FEPD013 Theatre 0 0 4 - - - 10 - None
0
FEPD014 Dance 0 0 4 - - - 10 - None
0
FEPD015 Yoga 0 0 4 - - - 10 - None
0
FEPD016 Digital Film 0 0 4 - - - 10 - None
Making 0
FEPD017 Workshop 0 0 4 - - - 10 - None
(Electrical 0
and
Mechanical)
FEHS018 Ethical 2 0 0 10 - - - - None
Decision 0
Making

29 | SCHEME OF COURSES AND EXAMINATION: B.Tech. CSE . (Artificial Intelligence), NSUT MAIN CAMPUS
 4.2.2 SYLLABI OF FOUNDATION ELECTIVES

Course No. Title of the Course Course Structure Pre-Requisite

FEPD001 Sports-I 0L-0T-4P None
COURSE OUTCOMES (CO):
To evolve a higher education system that is suitability blended with provision for
knowledge values and skill practice where every student learns in without
sacrificing his/her creativity.
COURSE CONTENT: (Any 2 out Of 5 Components)

A. INTRODUCTION TO PHYSICAL EDUCATION IN THE CONTEMPORARY

CONTEXT (Any Two)
1. Learn and demonstrate the technique of Suryanamaskar.
2. Develop Physical Fitness through Calisthenics / Aerobics / Circuit-Training /
Weight-Training and demonstrate the chosen activity.
3. Select any one game available in the college and learn different techniques
involved in its play

B. CORE PHYSICAL EDUCATION-: FITNESS, WELLNESS AND NUTRITION (Any

Two)
1. Measurement of Fitness Components – Leg-raise for Minimal Strength
(Muscular Strength); Sit-ups Muscular Endurance); Harvard Step Test, Run and
Walk Test (Cardiovascular Endurance); Sit and Reach Test (Flexibility)
2. Measuring height, weight, waist circumference and hip circumference,
Calculation of BMI (Body Mass Index) and Waist-Hip Ratio
3. Engage in at least one wellness programme and write a report on it.

C. CORE PHYSICAL EDUCATION-: POSTURE, ATHLETIC CARE AND FIRST AID

(Any Two)
1. Demonstrate Stretching and Strengthening Exercises for Kyphosis, Scoliosis,
Lordosis, Knock Knees, Bow Legs, Flat Foot, Back Pain and Neck Pain
2. Illustration and Demonstration of Active and Passive Exercises
3. Asanas with Therapeutic Value (Any five asanas): Karnapeedasana, Padmasana,
Dhanurasana, Sarvangasana, Paschimottanasana, Chakrasana, Halasana,
Matsyasana, Ardhmatsyendrasana, Usthrasana, Mayurasana, Shirshasana,
Vajrasana.
4. Practice P.R.I.C.E. in First Aid.

D. SPORTS ADMINISTRATION & MANAGEMENT (Any Two)

1. Demonstration of Supervision activities in Sports Management.
2. Demonstration of skills of Management.
3. Demonstration of fixtures of various kinds in sports competitions.
4. Demonstration of technical and non-technical purchase procedure.
E. Adventure Sports and Leadership Training

SUGGESTED READINGS:
1. Graham, G., ``Teaching Children Physical Education: Becoming a Master
Teacher. Human Kinetics,’’ Champaign, Illinois, USA.
2. Corbin, C. B., G. J. Welk, W. R Corbin, K. A. Welk, ``Concepts of Physical Fitness:
Active Lifestyle for Wellness,’’ McGraw Hill, New York, USA.
3. Anspaugh, D.J., G. Ezell and K.N. Goodman, `` Teaching Today Health,’’ Mosby
Publishers

30 | SCHEME OF COURSES AND EXAMINATION: B.Tech. CSE . (Artificial Intelligence), NSUT MAIN CAMPUS
4. Beotra, Alka, ``Drug Education Handbook on Drug Abuse in Sports,’’ Applied
Nutrition Sciences, Mumbai.
5. Ammon,R., Southall , R.M. and Blair, D.A., ``Sports Facility Management, ‘’West
Virginia, USA: Fitness Information Technology Publishers

Course No. Title of the Course Course Structure Pre-Requisite

FEPD002 Sports-II 0L-0T-4P FE001
COURSE OUTCOMES (CO):
To evolve a higher education system that is suitability blended with provision for
knowledge values and skill practice where every student learns in without
sacrificing his/her creativity.
COURSE CONTENT:
(Any 3 out Of 5 Components)
A. Sports for all (Any Two)
1. To participate in any intramural Tournaments (one team game and one
Individual Game) of choice.
2. To participate/ attend at least 15 hours in Fitness training at Field or at
Gymnasium.
3. Participate in at least one track and one field event on Annual Sports day.
4. To participate in Inter College Tournament

B. Skill Enhancement Courses ( any one out of three)

1. Wellness and Fitness
2. Holistic personality Development
3. Sports Journalism
4. Mass demonstration Activities

C. MEDIA AND CAREERS IN PHYSICAL EDUCATION (Any Two)

1. Organize an event / intramural / tournament in your college.
2. Prepare a News Report of an observed Sports competition.
3. Create a presentation on any topic from Physical Education using an audio-
visual aid.
4. Demonstrate Warming-up / Conditioning / Cooling-down exercises.

D. MANAGEMENT OF AEROBICS & GROUP TRAINING (Any Two)

1. Measurement of Fitness Components – Leg-raise for Minimal Strength
(Muscular Strength); Sit-ups (Muscular Endurance); Harvard Step Test or Run and
Walk Test (Cardiovascular Endurance); Sit and Reach Test (Flexibility)
2. Measurement of Pulse Rate / Heart Rate at Radial Artery and Carotid Artery,
Calculation of Target Heart Rate
3. Developing a 5-10 minute routine of aerobics with appropriate music for each
component of health related physical fitness

E. SPORTS INDUSTRY & MARKETING (Any Two)

1. Identify an issue or a trend in the sports industry: o Players in professional or
college sports o Ownership
2. Marketing Plan: Environmental Factors and Product Plan Draft, Paper
bibliography/works cited.
3. Sponsorship proposal
4. Developing a budget plan for an event

31 | SCHEME OF COURSES AND EXAMINATION: B.Tech. CSE . (Artificial Intelligence), NSUT MAIN CAMPUS
5. Athlete branding

SUGGESTED READINGS:
1. Covey, S. , `` 7 Habits of Highly Effective People, ‘’ Covey Publications, USA
2. Magill, R.A., `` Motor Learning and Control: Concepts and Applications,’’
McGraw Hill Publication.
3. Masteralexis, L.P., C. Barr and M. Humms, ``Principles and Practices of Sport
Management,’’ Jones and Bartlett Publisher
4. Bishop, J.G., ``Fitness through Aerobics,’’ Benjamin Cummings USA.
5. Brown K.M., `` Physical Activity and Health: An Interactive Approach,’’ Jones
and Bartlett Publisher
6. Cornwell. T.B, `` Sponsorship in marketing: Effective communications through
sports, arts and events, ‘’ Routledge Publishers
7. DeGarris, L., ``Sports Marketing: A Practical Approach,’’ Routledge Publishers,
USA

Course Title of the Course Course Pre-Requisite

No. Structure
FEPD003 National Service 0L-0T-4P None
Scheme (NSS)
COURSE OUTCOMES (CO):
1. Develop among them a sense of social and civic responsibility;
2. Utilize their knowledge in finding practical solution to individual and
community problems;
3. Identify the needs and problems of the community and involve them in
problem solving process;
4. Utilize their knowledge in finding practical solution to individual and
community problems;
5. Develop capacity to meet emergencies and natural disasters
COURSE CONTENT:
Unit-I
Introduction to NSS: Orientation and structure of NSS, History of Social
Reforms in Modern India: Brahmo Samaj, Arya Samaj, Satya Shodhak
Samaj: Principles and Functions

Unit-II
Regular activities: Distribution of working hours- association between
issues and programs- community project- urban rural activities,
association- modes of activity evaluation

Unit-III
concept of society- development of Indian society: Features- Division of
labors and cast system in India; Features of Indian constitution; Provisions
related to social integrity and development

Unit – IV
N.S.S. Regular Activities
A) College campus activities
B) N.S.S.activities in Urban and Rural areas

32 | SCHEME OF COURSES AND EXAMINATION: B.Tech. CSE . (Artificial Intelligence), NSUT MAIN CAMPUS
C) Role of Non-Government Organisation (NGO) in social Reforms
i) Red Cross
ii) Rotary

SUGGESTED READINGS:
1. National Service Scheme Manual, Govt. of India
2. Training Programme on National Programme scheme, TISS.
3. Orientation Courses for N.S.S. programme officers, TISS.
4. Ram Ahuja, ``Social Problems in India,” Rawat Publication.
5. History of Social Reforms in Maharashtra, Ed. J. Y. Bhosale, S. U.
Kolhapur

Course Title of the Course Course Pre-Requisite

No. Structure
FEPD004 National Cadet 0L-0T-4P None
Corps (NCC)
COURSE OUTCOMES (CO):
1. Develop among them a sense of social and civic responsibility;
2. Utilize their knowledge in finding practical solution to individual and
community problems;
3. Identify the needs and problems of the community and involve them in
problem solving process;
4. Utilize their knowledge in finding practical solution to individual and
community problems;
5. Develop capacity to meet emergencies and natural disasters;
COURSE CONTENT:

UNIT I:
Introduction to NCC, National Integration & Awareness: Religions,
Culture, Traditions and Customs of India, National Integration: Importance
and Necessity, Freedom Struggle.

UNIT II:
Adventure Training: – Obstacle course, Slithering, Trekking, Cycling, Rock
Climbing, Para Sailing, gliding, Scuba Diving- methods and use.

UNIT III:
Environment Awareness and Conservation: Natural Resources –
Conservation and Management. Water Conservation and Rainwater
Harvesting

UNIT IV:
Personality Development and Leadership: Introduction to Personality
Development, Factors Influencing /Shaping Personality: Physical, Social,

33 | SCHEME OF COURSES AND EXAMINATION: B.Tech. CSE . (Artificial Intelligence), NSUT MAIN CAMPUS
Physiological, Philosophical and Psychological, Self-Awareness Know
yourself/ Insight, Change Your Mind Set, Communication Skills: Group
Discussion / Lecturettes (Public Speaking), Leadership Traits, Types of
Leadership

SUGGESTED READINGS:
1. Bhogle Anita & Bhogle Harsha, ``The Winning way, Learning from
sports for managers,’’ Westland Publications
2. Sharma Robin, `` The leader had no title, ‘’ Simon and Schuster Ltd.

Course Title of the Course Course Pre-

No. Structure Requisite
FEMG005 Corporate social 2L-0T-0P None
responsibilities
COURSE OUTCOMES (CO):
1. The course will help students to understand corporate and emerging
social responsibility for the corporate in reference to India and global
situation
2. The course will support students to prepare themselves to work with
corporate understanding collective aspiration of the society, individual and
corporate social responsibility.

COURSE CONTENT:

UNIT I: Corporate social responsibility in Indian context and International:

CSR – Definition, concepts, Approaches of CSR, overview of corporate social
responsibility and corporate social accountability, SR Tools, National and
International CSR activities, corporate philanthropy, drivers of CSR,
difference between corporate governance, corporate philanthropy and CSR

UNIT II: Business ethics and corporate social responsibility: Concept of

business ethics – meaning, Importance and factors influencing business
ethics. Corporate Governance – meaning, significance, principles and
dimensions. Ethical decision – making in different culture, consumer
protection, environment protection, gender issues in multiculturalism,
ethics and corruption, ethics and safety. Business benefits of CSR

UNIT III: Legislative measures of CSR: Corporate, labor, stake holders,

Environmental and pollution. Social Accounting, Social Auditing, SA: 8000
and Corporate Social Reporting.

34 | SCHEME OF COURSES AND EXAMINATION: B.Tech. CSE . (Artificial Intelligence), NSUT MAIN CAMPUS
SUGGESTED READINGS:
1. Harsh Srivastava,`` The business of social responsibility,’’ books for
change
2. CV. Baxi and Ajit Prasad,`` Corporate social responsibility – concepts and
cases,” Excel Books
3. Dr. M. Mahmoudi,`` Global strategic management,” Deep & Deep
Publications Pvt. Ltd.
4. S K. Bhatia,`` International Human resource management – Global
perspective,” Deep & Deep Publications Pvt. Ltd.
5. J.P. Sharma, ``Governance, Ethics and Social responsibility of business,
‘’ Ane books Ltd.
6. Kotler Philip and Lee Nancy, `` Corporate social responsibility; doing the
most good for your company,’’ John Wiley
7. Simpson, Justine and Taylor, John R, `` Corporate Governance Ethics
and and CSR,’’ Kogan Page Publishers

Course Title of the Course Course Structure Pre-

No. Requisite
FEPD006 Music 0L-0T-4P None
COURSE OUTCOMES (CO):
The student will be familiarized with the basic terms used in Indian classical
music. Also it familiarizes with the life history of some dignitaries in the field
of music. This course also throws some light on the ancient music and its
origins in India.

COURSE CONTENT:

Unit 1: Study of the following terms: - Mela (Thãt), ÃshrayRãga, Rãga,

Lakshana, Shruti, Alankar, Gamak, Vadi-SamvãdiAnuvãdi-Vivãdi,
VakraSwara, Varjit-Swara.

Unit 2: Biographies & contributions of the following: - Jaidev,

MansinghTomar, Abdul Karim Khan, Tyagaraja, Pt. Bhatkhande, Pt. Ravi
Shankar

Unit 3: Study of following Rãgas&TãlaRãga- Yaman, Jaunpuri, Khamaj.

Tãla- Ektãl, Jhaptãl

Unit 4: Genaral discussion and definition of the following: -

a. Khyãl, MaseetKhani – Razakhani gat, Dhrupad, Tarana, Meend, Soot,
Murki, Kan, Khatka, Krintan, Harmony, Melody.
b. Writing of Bhatkhande Swarlipi Paddhati.
c. Writing of Tãlasand Compositions in Notation.

35 | SCHEME OF COURSES AND EXAMINATION: B.Tech. CSE . (Artificial Intelligence), NSUT MAIN CAMPUS
d. Detailed study of Rãgas (Rãga- Bihag, Malkauns, Vrindavani Sarang) and
comparative study of Rãgas.
e. Essay, Shastriya Sangeet (Classical Music) & SugamSangeet( Light Music
)

Unit 5: Vedic Music – Samvedic Sangeet, Swara, Vadya, Bhakti, Vikãr.

General study of Natyashastra, SangeetRatnakar.

SUGGESTED READINGS:
1. Vasant and Laxmi Narayan Garg,`` Sangeet Visharad,” Sangeet Karyalay
2. Sarat Chandra Pranjpayee and Chowbhamda ,``
BhartiyaSangeetkaItihas,” Surbharti Prakashan
3. Bharat Muni,`` NatyaShastra,”
4. Sharangdeva ,`` SangeetRatnakar,”
5. Sharad Chandra Pranjpayee ,`` Sangeet Bodh,”
6. Thakur Jaidev Singh ,`` Indian Music,” Sangeet research academy
7. V. N. Bhatkhande,`` Mallika Part II & III,” KramikPustak.
8. V. N. Patwardhan,`` RaagVigyan,”
9. RaginiTrivedi,`` Ragvibodha Mishrabani, Vol. I & II,’’

Course Title of the Course Course Structure Pre-

No. Requisite
FEHS007 Basics of Social 2L-0T-0P None
Sciences
COURSE OUTCOMES (CO):
Social science is a major category of academic disciplines, concerned with
society and the relationships among individuals within a society. It in turn
has many branches, each of which is considered a "social science".
COURSE CONTENT:

Unit I: Economics, political science, human geography, demography and

sociology.

Unit II: Humanities, anthropology, archaeology, jurisprudence, psychology,

history, and linguistic.

Unit III: Political science, economics, sociology, international politics and

scientific methodology.

36 | SCHEME OF COURSES AND EXAMINATION: B.Tech. CSE . (Artificial Intelligence), NSUT MAIN CAMPUS
SUGGESTED READINGS:
1. A.C. Kapoor, “Principles of Political Science,’’ S. Chand Publications
2. A.K. Sharma, “Issues in Social Demography,’’ Mittal Publications
3. Kathy S. Stolley, “The Basics of Sociology,’’ Greenwood Press.
4. Paul M. Muchinsky ,“Psychology Applied to Work,’’ Thomson Learning
Inc

Course Title of the Course Course Pre-

No. Structure Requisite
FEHS008 Spoken Skills in English 0L-0T-4P None
COURSE OUTCOMES (CO):
1. This course will focus on oral & presentation skills of students with
practice sessions in the language lab.
2. This course will develop confidence building in oral skills of learners.
3. It will seek to encourage the day to day conversations/dialogues and
communicative needs of learners with ample practice in the lab.
4. The theory class will boost practice in ample language exercises to
encourage oral skills.
5. This will also involve practice sessions in interview skills, group
discussions & pair work.
6. Basics of communication process, Barriers to Oral Communication
7. Elevator pitches - Practicals
COURSE CONTENT:
• Practice on listening and reading comprehension
• Language lab practice for group discussion and interviews
• Definition and discussion on communication & the barriers in
communication with practical training to use language as a tool for
sharing, discussing, handling and convincing others.

SUGGESTED READINGS:
Everyday English I & II Cambridge University Press/Foundation books

Course Title of the Course Course Structure Pre-

No. Requisite
FEMG009 Financial Literacy 2L-0T-0P None
COURSE OUTCOMES (CO):
1. To provide in-depth knowledge of the banking and Principles of
Investment, financial planning.
2. Help students in understanding stocks, sell strategy, mutual fund
options, investing in education, planning for the future, purchasing your
first home, taxes and tax planning, life insurance options, health insurance,
property insurance, estate planning, and keeping money in perspective.

37 | SCHEME OF COURSES AND EXAMINATION: B.Tech. CSE . (Artificial Intelligence), NSUT MAIN CAMPUS
COURSE CONTENT:

UNIT I: Banking- Definition, Role of Bank in growth of saving and

Investment, Types of banks , Services offered by banks, Deposits and Loans,
Types of A/c, Opening a bank A/c, How to Transact with banks, KYC norms,
(A/c opening form, Address Proof), How to read bank statement, Banking
products and services, Calculating Interests – Saving, FD, Simple and
Compound Interest, Power of compounding Loans, Types of loans, taking a
home loan, Definition of EMI, Calculation of EMI, Post office-Account and
transactions, Basic of foreign Exchange, Importance and Use of Foreign
Exchange, Regulator Role of RBI, mutual funds.

UNIT II: Investment: Principles of Investment – Safety, Liquidity and

Return, Investment plans, Hybrid plans-Ulip, SIP and VIP of mutual funds,
index funds

UNIT III: Financial Planning- Meaning, Household financial health

checkup, Important life stages, Medical and other Emergencies, ; Insurance,
Meaning, Need and Wants, Loss protection, Life, non-life and health,
Benefits of Insurance, Term plans, Social obligations Budgeting, Buying a
house, Plan a vacation, Retirement planning, Price of procrastination,
Market and financial instruments, Primary market, Secondary market,
Financial Statement analysis,

UNIT IV: Scams, Fraud Schemes-Insider trading, Money laundering;

Consumer protection and redressal mechanism, Rights of Consumers,
Applicable to financial services, Filing a complaint, Complain to entity
concerned, Regulators, Arbitration, Consumer courts, Govt. Websites-(PG
Portals), Investor Associations, Taxes, Meaning, Need of Taxes, Types of
taxes, How taxes impact income, Income, wealth and gift tax, Service tax,
STT, Stamp Duty, Tax planning v/s tax evasion, Tax rates, Tax free bonds,
Tax saving investment

SUGGESTED READINGS:
1. Braunstein, Sandra, and Carolyn Welch, `` Financial literacy: An overview
of practice, research, and policy," Fed. Res. Bull.
2. Cole, Shawn A., and Gauri Kartini Shastry,`` Smart money: The effect of
education, cognitive ability, and financial literacy on financial market
participation,” Harvard Business School, 2009.
3. Study material of NSE.
4. Gitman, joehnk and Billingsley, ``Personal financial planning,’’ Cengage
Learning
5. Madura Jeff,`` Personal finance student edition,’’ Prentice Hall PTR.

Course Title of the Course Course Pre-

No. Structure Requisite
FEHS010 Introduction to Ethics 2L-0T-0P None

38 | SCHEME OF COURSES AND EXAMINATION: B.Tech. CSE . (Artificial Intelligence), NSUT MAIN CAMPUS
COURSE OBJECTIVES (CO):
1. It is aimed to comprehend right from wrong, to act upon something
tricky with a deliberative analysis.
Course Outcomes:
2. Helps in addressing issues with a moral reasoning and analysis.
COURSE CONTENT:
1. Fundamentals of Ethics
2. Issues in Moral Philosophy
3. Theories of Justice and their Applications
4. Ethical Decision Making
5. Applied Ethics
6. Media Ethics
7. Environmental Ethics
8. Technology & Ethics
9. Feminism

SUGGESTED READINGS:

Course No. Title of the Course Course Pre-

Structure Requisite
FEHS011 Stress Management 1L-0T-2P None
COURSE OBJECTIVES (CO):
The objective of this course to help the students to understand the nature
of stress, sources of stress and to identify the symptoms of stress through
first unit. Second Unit aims to teach the students to learn certain skills and
the strategies required for effectively managing the stress and ability to cope
up from the stressful situations.
COURSE OUTCOMES (CO):
1. To understand the nature, sources of stress and consequences of stress
2. To overcome from the constraints in managing stress
3. To develop the motivation to adopt different technology
COURSE CONTENT:
UNIT I: Stress (GAS Model), Learning about sources of stress and its
symptoms: Nature of stress- various sources of stress environmental, social
(including social media), physiological and psychological; Symptoms of
stress - emotional response, physiological & behavioral; relationship
between stress and performance, relationship between stress and health

UNIT II: Learning to manage stress effectively: Methods - yoga, meditation,

Vipassana,
relaxation techniques, clarifying problem, alternate actions, support
(Problem focused) emotion focused constructive approach, Indian Case
Studies

Practical: (50 marks)

39 | SCHEME OF COURSES AND EXAMINATION: B.Tech. CSE . (Artificial Intelligence), NSUT MAIN CAMPUS
Any two practical’s based on Unit I and II

SUGGESTED READINGS:
1. DiMatteo, M.R. & Martin, L.R.(2002). Health psychology. New Delhi:
Pearson. Neiten, W. & Lloyd, M.A (2007). Psychology applied to
Modern life. Thomson Detmar Learning .
2. Taylor, S.E. (2006). Health psychology, 6th Edition. New Delhi: Tata
McGraw Hill

Course No. Title of the Course Course Pre-Requisite

Structure
FEHS012 Organizational 2L-0T-0PNone
Behavior
COURSE OUTCOMES (CO):
1. The course aims at providing a comprehensive understanding of
organization (structure and culture) and its functioning, at the levels of the
individual, group and organization as a whole.
2. To acquaint the students with employee motivation and work attitudes
and its relationship with performance and productivity.
3. To help students gain insights into the concept of organization change in
the context of ever changing business environment and provide them with
various tools of organizational development.
4. To provide students an overview of organizational dynamics in the light
of power, politics and stress.
COURSE CONTENT:

Unit 1: Understanding Organizational Behavior: Defining organization and

Organizational Behavior (OB), OB Model; the Organizational structure;
Common Organizational Designs; New Design Options

Unit 2: Employee Attitudes and Motivation: Job Satisfaction; Organizational

Commitment; Organizational Citizenship behavior; Positive Organizational
Behavior (POB):
Theories of Work motivation: Content theory (Maslow, Herzberg), Process
theory (Vroom’s Expectancy Theory, Equity Theory), Contemporary theories
(Goal Setting theory and Self-Regulation theory)

Unit 3: Dynamics of Organizational Behavior: Organizational culture; Power

and Politics: Influence, sexual harassment, organizational politics, Causes
& Consequences of stress at the workplace:

Unit 4: Organizational change and development: concept of organizational

change, model of organizational change (one model), organizational
development: concepts, models (one model), techniques of organizational
development

Unit 5: Organizational behavior in startups

40 | SCHEME OF COURSES AND EXAMINATION: B.Tech. CSE . (Artificial Intelligence), NSUT MAIN CAMPUS
SUGGESTED READINGS:
1 Aamodt, M. G. (2016). Industrial/Organizational psychology: An applied
approach. Boston: Cengage Learning.
2 Luthans, F. (2011). Organizational behaviour:An evidence based
approach,12th Edition. McGraw Hill
3 Muchinsky, P.(2007). Psychology applied to work: An introduction to
Industrial and Organizational Psychology. NC: Hypergraphic Press.
4 Pareek, U. &Khanna,S.(2012,Third edition). Understanding
Organizational Behaviour. Oxford: Oxford University Press.
5 Pareek, U., & Gupta, R. K. (2010).Organizational behaviour. New Delhi:
Tata McGraw Hill.
6 Robbins, S.P., Judge T.A. and Sanghi, S.(2009) Essentials of
Organizational Behaviour,10th edition. Pearson Education , India.
7 Schultz, D & Schultz, S (2013).Psychology and Work Today. Pearson
Education, India.

Course Title of the Course Course Structure Pre-

No. Requisite
FEPD013 Theatre 0L-0T-4P None
COURSE OUTCOMES (CO):
Our goal is to nurture artist-scholars who are well read in dramatic
literature, who understand the social and historical contexts of that
literature, who appreciate contemporary performance and dance, who think
critically, who master discipline-specific skills, and who make compelling
artistic choices on stage.
COURSE CONTENT:
Unit 1: Concept of Acting in Indian Classical theatre. Western styles of
theatre acting.

Unit 2: Basics of the following: Acting in Grotowski’s Poor Theatre, Folk

Theatre of India

Unit 3: Acting for Camera –Knowledge of camera frames and movement

within the confines of a frame, blocking, difference between theatre and
Camera acting, Concentration.

Unit 4: Acting consistently for different takes, acting scenes out of order,
Auditions, acting exercises. Art of Dubbing.

SUGGESTED READINGS:
1. Boleslavsky, Richard,`` Acting: the First Six Lessons,” New York Theatre
Arts.
2. Hagen, Uta,`` Respect for Acting,” Macmillan Press.
3. Hodge, Alison,`` Twentieth Century Actor Training,” London and New
York.
4. Routledge ,Stanislavski, Konstantin,`` An Actor’s Work: A Student’s
Diary,” Trans. and ed. Jean

41 | SCHEME OF COURSES AND EXAMINATION: B.Tech. CSE . (Artificial Intelligence), NSUT MAIN CAMPUS
5. Jeremiah Comey ,`` The Art of Film Acting,” Focal Press .
6. Philips B Zarrilli,`` Acting (Re) Considered,” Routeledge .
7. Cathy Hassey,`` Acting for Film,” Allworth Press 9. Singh. Y,`` Indian
Sociology social conditioning and emerging concerns,” Vistaar publication.

Course Title of the Course Course Structure Pre-

No. Requisite
FEPD014 Dance 0L-0T-4P None
COURSE OUTCOMES (CO):
This course will provide the student with the fundamentals necessary for
advanced dance skills. Further, this course will develop student
appreciation of dance as an art form and lifetime activity. Designed to
familiarize students with technique, the student will also study vocabulary,
different forms of dance, issues in dance and the history pertaining to the
world of dance. The student will develop kinesthetic awareness, movement
memory, creative abilities and aesthetic appreciation of various dance
forms. The enhancement and the development and maintenance of physical
fitness, self-confidence, self-discipline and independence with the body by
providing informal showings during class are the goals expected to be
achieved. Each student should leave this class having been encouraged,
esteemed, and take with them a new appreciation of dance.

COURSE CONTENT:
- Basic workout
- Introduction to Hip Hop and B-Boying with a simple choreography
- Exercise like: Rolling, jumping, moving shoulders. Footwork, Floor steps,
Beat knowledge.
- Freestyle combination along with House dance style.
- Expressions class: Body expressions, Face expressions.
- Introduction of Contemporary Dance. Basic exercise of Contemporary
Dance. Exercise for flexibility, Floor steps, Spinning and Balancing.
- Introduction to Jazz. Basic exercise and proper routine practice.

SUGGESTED READINGS:

1. Jonathan Burrows, ``A Choreographer's Handbook,’’ Routledge

2. Jacqueline M. Smith-Autard, ``Dance Composition: A Practical Guide to
Creative Success in Dance Making,’’ Routledge

Course Title of the Course Course Structure Pre-

No. Requisite
FEPD015 Yoga 0L-0T-4P None
COURSE OUTCOMES (CO):
Students will learn about the importance of yoga in their lives. They will be
exposed various types of yoga, their health benefits.

42 | SCHEME OF COURSES AND EXAMINATION: B.Tech. CSE . (Artificial Intelligence), NSUT MAIN CAMPUS
COURSE CONTENT:

UNIT-I
Origin of Yoga & its brief development, Meaning of Yoga & its importance,
Yoga as a Science of Art (Yoga Philosophy),Meaning of meditation and its
types and principles.

UNIT- II
Classification of Yoga/Types of Yoga, Hatha Yoga , Raja Yoga, Laya Yoga,
Bhakti Yoga, Gyan Yoga, Karma Yoga, Asthang Yoga.

UNIT –III
Principles of Yogic Practices, Meaning of Asana, its types and principles,
Meaning of Pranayama, its types and principles, Meaning of Kriya its types
and principles.

UNIT -IV
Yogic therapies and modern concept of Yoga, Naturopathy, Hydrotherapy,
Electrotherapy, Messotherapy, Acupressure, acupuncture, Meaning and
importance of prayer, Psychology of mantras, Different mudras during
prayers

SUGGESTED READINGS:

1. William Broad,`` The Science of Yoga: The Risks and the Rewards,” Simon
and Schuster
2. Swami Vishnu Devananda,`` The Complete Illustrated Book of Yoga,”
Harmony

Course Title of the Course Course Pre-

No. Structure Requisite
FEPD016 Digital Film Making 0L-0T-4P None
COURSE OUTCOMES (CO):
Students will learn about various technicalities involved in digital film
making. They will also expose to history of cinema, preproduction etc.
COURSE CONTENT:

Unit 1 – History of Cinema, Research & Script

Early Cinema, Development of Classical Indian & Hollywood Cinema,
History of Global Film including European Film (1930-present), Origin of
Classical narrative cinema-Soundless film, Exploration of film and analysis
of the three-part beginning, middle and end of story, Research(Finding and
Collecting materials and facts related to your story. Where and How to find
the materials related to your story. Things to consider before sketching
down your story), Script (Scriptwriting Process and its various phases),
Film Grammar for Scriptwriting.

Unit 2 – Pre‐Production

43 | SCHEME OF COURSES AND EXAMINATION: B.Tech. CSE . (Artificial Intelligence), NSUT MAIN CAMPUS
Digital Video Cinematography: Introduction to Digital Video
Cinematography
Cinematography, Interactivity and emotions through Cinematography,
Building blocks, Compositions, Lenses and Cameras, Types of lenses: Zoom
Lens, Prime Lens, Types of Cameras: HD Cameras, Basics of Film Camera,
Difference between, Film Camera and Digital Camera, DSLR and HDSLR
Cameras, Lighting, Psychology of light, Visual Environment, Directional
Effect of Light, Lighting design process, Three-point lighting, High-Key
lighting, Low Key lighting, Construction of a Shot, Color, Contrast, Deep
Focus, Shallow Focus, Depth of Filed, Exposure, Racking focus, Frame
Rate, Telephoto shot, Zoom shot.

Unit 3- Digital Video Editing

Effective Editing, Principles of Video Editing, Non-Linear Editing (NLE)
Concept, The Three-Point Edit, Non‐Linear Editing (NLE) Techniques,
Working in the Timeline, Transitions, Key framing, Applying Filters,
Ingesting.

Unit-4Advanced Editing Techniques

NLE Compositing, Color Correction & Color Grading, Working on Audio,
Titling

SUGGESTED READINGS:
1. Mark Brindle and Chris Jones, `` The Digital Filmmaking Handbook,”
Quercus

Course Title of the Course Course Pre-

No. Structure Requisite
FEPD017 Workshop (Electrical and 2L-0T-0P None
Mechanical)
COURSE OUTCOMES (CO):
1. Student will be able to make various joints in the given object with the
available work material.
2. The students will be able to understand various wiring connections
COURSE CONTENT:

Mechanical Workshop Experiments

1. Blacksmith
2. Carpentry
3. Fitting
4. Foundry
5. Welding

Electrical workshop Experiments

1. Study & Performance Of Different Types Of Wire Joints
2. Study And Performance Of Staircase Wiring
3. Study And Performance Of Series And Parallel Connection Of Flourescent
Tube Light

44 | SCHEME OF COURSES AND EXAMINATION: B.Tech. CSE . (Artificial Intelligence), NSUT MAIN CAMPUS
4. Study And Performance Of Godown Wiring
5. Series And Parallel Connection Of Bulbs And Power Sockets By Single
Switch And Multi Switches.

SUGGESTED READINGS:
1. Hajra Choudhury, Hazra Choudhary and Nirjhar Roy, ``Elements of
Workshop Technology, vol. I, ‘’ Media promoters and Publishers Pvt. Ltd.
2. W A J Chapman, Workshop Technology,`` Part -1, 1st South Asian
Edition,’’ Viva Book Pvt Ltd.
3. P.N. Rao, ``Manufacturing Technology, Vol.1,’’ Tata McGraw Hill
4. Kaushish J.P., `` Manufacturing Processes, ‘’ Prentice Hall

Course Title of the Course Course Structure Pre-

No. Requisite
FEHS018 Ethical Decision Making 2L-0T-0P None
COURSE OUTCOMES (CO):

COURSE CONTENT:
UNIT I: ETHICAL CONCEPTS AND ETHICAL APPROACHES
1. Values, Dilemma and Choices
2. Responsibility, Justice & Fairness
3. Respect for self and others
UNIT II: ETHICAL DECISION PROCESS
1. Ethical codes and tests
2. Steps to ethical decision-making
3. Case studies and Situational role plays

SUGGESTED READINGS:
• Blanchard, K., & Peale, N.V. (1988) The Power of Ethical
Management, New York: William Morrow and Co. pp. 20-24.
http://www.blanchardbowleslibrary.com/books/powerofethicalman
agement.htm
• Brown, M. (1996) The Quest for Moral Foundations: An Introduction
to Ethics Georgetown University Press
• Davis, M. (1999) Ethics and The University, New York: Routledge.
• Heller, R. (1998) Making Decisions, New York: DK.
• Josephson, M. S. (2002) Making Ethical Decisions, Josephson
Institute of Ethics.
• Kardasz, F. (2008) Ethics Training For Law Enforcement: Practices
and Trends, VDM, Verlag Dr. M.ller.
• Nosich, G. M. (2002) Learning to Think Things Through: A Guide to
Critical Thinking, Prentice Hall.

45 | SCHEME OF COURSES AND EXAMINATION: B.Tech. CSE . (Artificial Intelligence), NSUT MAIN CAMPUS
4.3 PROGRAM CORE COURSES

4.3.1 LIST OF PROGRAM CORE COURSES

SEM. Code Name of LTP Evaluation Scheme Syllabus
Core Course Allocation Theory Practical page
L T P CA MS ES CA(P) ES(P) Nos
II CACSC01 Discrete 3 1 0 25 25 50 - - 47
Structures
CACSC02 Data Structures 3 0 2 15 15 40 15 15 48
CAECC03 Digital Logic 3 0 2 15 15 40 15 15 50
Design
III Web 53
CACSC04 3 0 2 15 15 40 15 15
Technology
Database 56
CACSC05 Management 3 0 2 15 15 40 15 15
Systems
Design and 60
CACSC06 Analysis of 3 0 2 15 15 40 15 15
Algorithms
Computer 63
Architecture
CACSC07 3 1 0 25 25 50 - -
and
Organization
Microprocessor 65
CAECC08 and 3 0 2 15 15 40 15 15
Microcontrollers
IV Operating
CACSC09 3 0 2 15 15 40 15 15 68
Systems
Theory of
Automata &
CACSC10 3 1 0 25 25 50 70
Formal
languages
Artificial
CACSC11 72
Intelligence 3 0 2 15 15 40 15 15
Data
CAECC12 3 0 2 15 15 40 15 15 74
Communication
probability and
CAMTC13 stochastic 3 1 0 25 25 50 76
processes

46 | SCHEME OF COURSES AND EXAMINATION: B.Tech. CSE . (Artificial Intelligence), NSUT MAIN CAMPUS
 4.3.2 SYLLABI OF PROGRAM CORE COURSES : II SEMESTER

SEMESTER II B. TECH. COMPUTER SCIENCS & ENGINEERING (ARTIFICIAL

INTELLIGENCE)

Course Code Pre-

Type Subject L T P Credits CA MS ES CA ES requi
sites
Discrete 3 1 0 None
CACSC01 CC 4 25 25 50 - -
Structures

COURSE OUTCOMES
1. To be able to analyze and compute time and space complexity of
various computing problems.
2. To be able to design algorithms for solving various problems using the
concepts of discrete mathematics.
3. To apply the concepts and algorithms learnt in developing large scale
applications and modify them.
4. Get a grasp of the practical problems and their relation with discrete
structures.
5. Implement practical problems using the discrete structures approach.
COURSE CONTENT
UNIT-I

Logic: Mathematical Logic, Propositions, Truth Tables, and Logical

inferences, Methods of Proof, Propositional Logic, Logical Inference,
First order logic, applications, Predicates and quantifiers.
Set Theory, Relations and Functions: Elements of Set Theory, Primitives of set
theory, binary Relation and its Representation, type of Binary Relations,
Equivalence relations and partitions. Functions, Types of functions, Inverses and
composition of Functions.
UNIT-II
Counting: Counting and analysis of algorithms, Principles of inclusion-exclusion,
Pigeon hole principle, Permutations, Combinations.
Mathematical induction: proof by induction, Recursion, Characteristic
Polynomial, Recurrence relation, generating functions, Asymptotic
behavior of algorithms.
UNIT-III
Posets, Lattices and Group Theory: Posets, Hasse Diagram, Lattices: Definition,
Properties of lattices – Bounded, Complemented, Modular and Complete lattice,
Boolean Algebra, Groups & rings.
Number Theory: Infinity and Natural numbers, Integers, Divisibility and
Euclidean algorithm, Prime numbers, Congruence, Modular arithmetic, Euler
function.
UNIT-IV
Graphs: Graph isomorphism, Paths and Cycles, Graph coloring, Critical

47 | SCHEME OF COURSES AND EXAMINATION: B.Tech. CSE . (Artificial Intelligence), NSUT MAIN CAMPUS
 Path, Eulerian paths and circuits, Hamiltonian paths and circuits, Bipartite
Graphs, Digraphs, Multigraphs.
UNIT-V
Probability: Overview of probability theory, Discrete distributions.
SUGGESTED READINGS
1. Keneth H. Rosen, “Discrete Mathematics and Its Applications”, TMH.
2. C.L. Liu, “Elements of Discrete Mathematics”, TMH.
3. Kolman, Busby & Ross, “Discrete Mathematical Structures”, PHI.
4. NarsinghDeo, “Graph Theory With Application to Engineering and
Computer Science”,PHI.
5. Charles S. Grimmstead, J. Laurie Snell “Introduction to Probability”.
Kai Lai Chung, “A Course in probability theory”.
6. J.P.Tremblay & R. Manohar, “Discrete Mathematical Structure with
Applications to Computer Science” Mc.Graw Hill.

Course Pre-
Type Subject L T P Credits CA MS ES CA ES requisites
Code
Data 3 0 2 None
CACSC02 CC 4 15 15 40 15 15
Structures

COURSE OUTCOMES
1. Candidate will be able to choose the appropriate data structure for a
specified problem and determine the same in different scenarios of real
world problems.
2. Become familiar with writing recursive methods and reducing larger
problems recursively in smaller problems with applications to practical
problems.
3. Be able to understand the abstract properties of various data structures
such as stacks, queues, lists, trees and graphs and apply the same to
real life problems of sorting, searching, and traversals for skill
enhancement in problem solving.
4. Be able to implement various data structures in more than one manner
5. Understand the advantages and disadvantages of the different implementations
by using efficient representation of problems.
COURSE CONTENT
UNIT-I
Introduction: Basic Terminology: Elementary Data Organization, Data
Structure Operations, Algorithms Complexity and Time-Space Trade off.
Arrays: Array Definition and Analysis, Representation of Linear Arrays in

48 | SCHEME OF COURSES AND EXAMINATION: B.Tech. CSE . (Artificial Intelligence), NSUT MAIN CAMPUS
 Memory, Traversing, Insertion And Deletion in Array, Single Dimensional Arrays,
Two Dimensional Arrays, Bubble Sorting, Selection Sorting, Linear Search,
Binary Search, Multidimensional Arrays, Function Associated with Arrays,
Character String in C, Character String Operations, Arrays as parameters,
Implementing One Dimensional Array.

UNIT-II

Stacks and Queues: Introduction to Operations Associated with Stacks Push &
Pop, Array representation of stacks, Operation associated with stacks: Create,
Add, Delete, Application of stacks recursion polish expression and their
compilation conversion of infix expression to prefix and postfix expression,
Tower of Hanoi problem, Representation of Queues, Operations of queues:
Create, Add, Delete, Front, Empty, Priority Queues and Heaps, Dequeue.

UNIT-III

Recursion: Recursive thinking, Recursive Definition of Mathematical

Formulae, Recursive Array Search, Recursive Data Structure, Problem Solving
With Recursion, Back Tracking
Linked Lists:More operations on linked list, polynomial addition, Header nodes,
doubly linked list, generalized list, circular linked lists.

UNIT-IV

Trees:Trees – mathematical properties, Binary Search Trees and their

representation, expression evaluation, Complete Binary trees, Extended binary
trees, Traversing binary trees, Searching, Insertion and Deletion in binary
search trees, Complexity of searching algorithm, Path length, Huffman’s
algorithm, General trees, AVL trees, Threaded trees, B trees, Trie data structure
UNIT-V

Sorting: Insertion Sort, Quick sort, two-way Merge sort, Heap sort,
sorting on different keys, External sorting.
Graphs: Sequential representation of graphs, Adjacency matrices, Search and
Traversal of graphs: Depth first, breadth first, topological sort.
Outline of Practical Work:
- Programs based on sorting and searching, implementing stacks, queues ,
simple calculator using postfix expression, command line calculator changing
infix to postfix, implementation of linked lists - a simple editor program,
traversal of binary trees , binary search tree creation, insertion, deletion,
traversal sorting. AVL tree creation and rotations, Traversal of graphs using
BFS and DFS , implementation of topological sorting. Templates and
Containers Survey of new data structures.

Suggestive List of Experiments

1. Write a program to find the mean and the median of the numbers stored in an
array.

49 | SCHEME OF COURSES AND EXAMINATION: B.Tech. CSE . (Artificial Intelligence), NSUT MAIN CAMPUS
2. Write a program to insert one element in an array and delete an element from an
array.
3. Write a program to search for a number in an array.
4. Write a program to sort an array.
5. Write a program to merge two sorted arrays.
6. Write a program to store the marks obtained by 10 students in 5 courses in a two-
dimensional array.
7. Write a program to implement a linked list.
8. Write a program to insert a node in a linked list and delete a node from a linked
list.
9. Write a program to print the elements of a linked list in reverse order without
disturbing the linked list.
10. Write a program to reverse a linked list.
11. Write a program to add two polynomials using linked lists.
12. Write a program to implement a doubly-linked list.
13. Write a program to implement a stack using an array.
14. Write a program to implement a stack using a linked list.
15. Write a program to implement a queue using an array.
16. Write a program to implement a queue using a linked list.
17. Write a program to implement a circular queue using an array.
18. Write a program to implement a priority queue using a linked list.
19. Write a program to implement a double-ended queue using a linked list.
20. Write a program to construct a binary tree and display its preorder, inorder and
postorder traversals.
21. Write a program to construct a binary search tree.
22. Write a program to construct a graph.
23. Write a program to calculate the distance between two vertices in a graph.
24. Write a program to calculate the distances between every pairs of vertices in a
graph.
25. Write a program to construct a minimal spanning tree of a graph.

References and Text Books:

1. Nell B Dale,“C++ data structures”,ISBN-10: 1449646751, 5-th edition.
2. Freetextbooks.com. Algorithms and data structures.
Available :http://www.freetechbooks.com/algorithms-and-data-
structures- f11.html
3. Robert Lafore,“Data structures in Java”.
4. Data Structures – Horowitz Sahani PHI
5. Data Structures – Lipshutz TMH

Course Pre-
Type Subject L T P Credits CA MS ES CA ES requisit
Code
es
Digital 3 0
CAECC03 CC 2 15 15 40 15 15 15 None
Logic
Design

50 | SCHEME OF COURSES AND EXAMINATION: B.Tech. CSE . (Artificial Intelligence), NSUT MAIN CAMPUS
COURSE OUTCOMES
1. To get familiarized with number systems, codes, logic gates and Boolean
algebra
2. To understand fundamental concepts of VHDL modelling for basic digital
circuits
3. To understand the basic characteristics of various logic families
4. To analyze and understand the design process associated with sequential
circuits
5. To develop basic understanding of programmable logic devices

COURSE CONTENT
UNIT-I

Introduction to Digital Systems, Number Systems and Codes: Binary, octal and
hexadecimal number systems, Number-Base Conversions, Complements of
Numbers, Signed numbers, Fixed and floating point numbers, Binary
Arithmetic, Binary Codes: BCD, Gray, Excess-3, ASCII, Error detection and
correction codes - parity check codes and Hamming code.
Logic gates, Boolean Algebra and logic minimization: Basic logic operation,
Logic gates and Truth tables, Positive and Negative Logic, Boolean Algebra:
Basic postulates and fundamental theorems, SOP and POS forms, Min terms,
Max terms, Canonical Form, Gate level Minimization: K-map and Quine-
McCluskey tabular methods, NAND/NOR implementations

UNIT-II

Design Concepts using Hardware Description Language: VHDL Programming

Structure, Model, Test Bench, Simulation Tool.
Combinational Logic Modules, their applications and VHDL Modeling:
Decoders, encoders, multiplexers, demultiplexers, Parity circuits,
Comparators, Code Converters, Arithmetic modules- adders, subtractors, BCD
Adder, ALU and multipliers, Implementing boolean function with multiplexers
/ decoders

UNIT-III

Introduction to different logic families: Operational characteristics of BJT and

MOSFET as switch, Structure and operations of TTL and CMOS gates, Electrical
characteristics of logic gates – logic levels and noise margins, fan-out,
propagation delay, transition time, power consumption and power-delay
product etc.

UNIT-IV

51 | SCHEME OF COURSES AND EXAMINATION: B.Tech. CSE . (Artificial Intelligence), NSUT MAIN CAMPUS
Sequential Logic systems and VHDL Modeling: Basic sequential circuits-
latches and flip-flops: RS-latch, SR-flip flop, D-latch, D flip-flop, JK flip-flop, T
flip-flop, Setup-time, HOLD Time, Propagation delay, Timing hazards and
races, Characteristic Equations.
Sequential logic modules, their applications and VHDL Modeling: shift register:
Bidirectional, Universal and Ring Counter; counters: Ripple, Up/Down, Mod N,
BCD Counters etc.

UNIT-V

State machines: Definition, Classification: Mealy, Moore; Analysis and design

of state machines using D flip-flops and JK flip-flops etc.
Memory: Read-only memory, Read/Write memory - SRAM and DRAM, EPROM,
EEPROM, USB Flash drive, Testing and testability of logic circuits,
Programmable Logic Devices: PROM, PLA, PAL, Basics of CPLD, FPGA etc.

Text Books:
1. M. Morris Mano and Michael D. Ciletti,"Digital Design", 5th Edition,
Pearson
2. Charles Roth and Larry Kinney, “Fundamentals of Logic Design,”
Cengage Learning, 7th Edition.
References:
1. Stephen Brown and Zvonko Vranesic, "Fundamentals of Digital Logic with
VHDL Design", 3rd Edition, McGraw-Hill
2. R.J. Tocci., N.S.Widmer, G.L. Moss, “Digital Systems, Principles and
Applications”,11th Edition, Pearson Education
3. Mohammed Ferdjallah,"Introduction to Digital Systems: Modeling,
Synthesis, and Simulation Using VHDL", Wiley.
DIGITAL LOGIC DESIGN LAB

LIST OF EXPERIMENTS

(1) Verify the truth table of AND, OR, NOT, NAND, NOR, X-OR, X-NOR
gates
(2) Implement all the above mentioned gates by using NAND gates and
NOR gates only.
(3) Design and Implement Half-adder, Full-adder, Half-subtractor,

52 | SCHEME OF COURSES AND EXAMINATION: B.Tech. CSE . (Artificial Intelligence), NSUT MAIN CAMPUS
 Full-subtractor using logic gates.
(4) Design a 4 bit parallel adder and subtractor using IC. Further using
the same IC implement BCD to excess-3 code convertor.
(5) Design a 4 bit magnitude comparator using IC. Also implement 2 bit
magnitude comparator using gates only.
(6) Design and implement a full adder circuit using DECODER and gates.
Also implement the same by using complimentary output decoder.
(7) Design the following Flip-flop using NAND/NOR gates
(i) S-R FF
(ii) D FF
(iii) J-K FF
(iv) T FF
(8) Design and implement a MOD 6 synchronous UP counter using T FF.
(9) Design a 2 bit UP/DOWN counter using J-K FF
(10) Implementation of full adder
(11) Implementation of 4X1 MUX
(12) Conversion of BCD to Excess-3 code
(13) Implement 3X8 decoder
(14) Implement 2 bit by 2 bit magnitude comparator

4.3.3 SYLLABI OF PROGRAM CORE COURSES : III SEMESTER

SYLLABI III SEMESTER B. Tech. (CSAI)

B.Tech. Computer Science & Engineering(Artificial Intelligence)-SEMESTER III

Course Pre-
Type Subject L T P Credits CA MS ES CA ES requisites
Code

Web
3 0 2 4 15 15 40 15 15
CACSC04 CC Technology
CACSC02

53 | SCHEME OF COURSES AND EXAMINATION: B.Tech. CSE . (Artificial Intelligence), NSUT MAIN CAMPUS
 COURSE OUTCOMES
1. To understand the development and transition of the web.
2. To Learn creating the web pages and apply the styles
3. To learn the web programming for simple day to day work.
4. To learn fetching the object using latest technologies and using them to process
information
5. To write a full-fledged web based application and deploy it.

COURSE CONTENT

UNIT-1

Introduction , Web Browser , Web 2.0

Introduction , W3C,Web 2.0 , Personal, Distributed and Client/Server Computing , Browser Portability , Software
Technologies , Web Resources, Customizing Browser Setting ,Searching the Internet, Keeping Track of Your
Favorite Sites, File Transfer Protocol (FTP),Online Help, Web Resources, Web 2.0?, Search, Content Networks ,
User-Generated Content, Blogging, Social Networking, Social Media, Tagging , Social Bookmarking , Software
Development , Rich Internet Applications (RIAs), Web Services, Mashups, Widgets and Gadgets, Location-Based
Services, XML, RSS, Atom, JOSN and VolP, Web 2.0 Monetization Models, Web 2.0 Business Models, Future of
the Web , Where to GO for more Web 2.0 Information ,

XHTML , Cascading Style Sheets(CSS)

Introduction , Editing XHTML, First XHTML Example, W3CXHTML Validation Service, Headings, Linking ,
Images, Special Characters and Horizontal Rules , Lists, Tables, Forms, Internal Linking , Meta Elements, Inline
Styles, Embedded Style Sheers, Conflicting Style, Linking External Style sheers, Positioning Elements,
Backgrounds, Element Dimensions, Box Model and Text Flow, Media Types, Building a CSS Drop-Down Menu,
User Style Sheets, CSS 3, Web Resources

UNIT-2

JavaScript: Introduction to Scripting

Introduction , Simple Program: Displaying a Line of Text in a Web Page , Modifying Our First Program , Obtaining
User Input with Prompt Dialogs, Dynamic Welcome Page, Adding Integers, Memory Concepts, Arithmetic,
Decision Making: Equality and Relational Operators, Web Resources,

JavaScript: Control Statements

Introduction, Algorithms, Pseudo code, Control Structures, i f Selection Statement, i f …else selection
Statement, Formulating Algorithms: Counter-Controlled Repetition , Formulating Algorithms: Sentinel-Controlled
Repetition, Formulating Algorithms: Nested Control Statements, Assignment Operators, Increment and
Decrement Operators, Essentials of Counter-Controlled Repetition , For Repetition Statement , Examples Using

54 | SCHEME OF COURSES AND EXAMINATION: B.Tech. CSE . (Artificial Intelligence), NSUT MAIN CAMPUS
the for Statement, Switch Multiple-Selection Statement , do….while Repetition Statement , break and
continue Statements, Labeled break and Continue Statements, Logical Operators, Summary of Structures
Programming , Web Resources

JavaScript: Functions

Introduction , Program Modules in JavaScript, Programmer-Definitions Functions, Function Defamations ,

Random Number Generation, Example: Game of Chance, Another Example: Random Image Generation ,
JavaScript Global Functions, Recursion , Recursion vs. Iteration ,

JavaScript: Arrays

Introduction, Arrays, Declaring and Allocating Arrays, Examples Using Arrays, Random Image Generator Using
Arrays, References and Reference Parameters, Passing Arrays to Functions, Sorting Arrays, Searching Arrays:
Linear Search and Binary Search, Multidimensional Arrays, Building an Online Quiz, Introduction to Object
Technology, Math Object, String Object, Fundamentals of Characters and Strings, Methods of the string Object ,
Character-Processing Methods, Searching Methods, Splitting Steins and Obtaining Substrings, XHTML Markup
Methods, Date Object, Boolean and Number Objects

Document object Model (DOM):Objects and Collections, introduction , Modeling a Document: DOM Nodes and
Trees , Traversing and Modifying a DOM Tree, DOM Collections, Dynamic Styles, Summary of the DOM Objects
and Collection, Web Resources , JavaScript: Events, Introduction, Registering Event Handlers, Event onload ,
Event onmousemove, the event Object and this , Rollovers with onmouseover and onmouseout, From Processing
with onfoucus and onblur, More Form Processing with onsubmit and onreset , Event Building , More Events

UNIT-3

XML and RSS

Introduction, XML Basics, Structuring Data, ZXML Namespaces, Document Type Definitions (DTDs), W3CXML
Schema Documents, XML Vocabularies, MathMLTM, Other Markup Languages, Extensible Stylesheet Language
and XSL Transformations, Document Object Model (DOM), RSS,

Ajax- Enabled Rich Internet Applications

Introduction, Traditional Web Application vs. Ajax Applications, Rich Internet Applications (RIAs) with Ajax,
History of Ajax, “Raw” Ajax Example Using the XMLHttpRequest Object, Using XML and
the DOM, Creating a Full-Scale Ajax-Enabled Application, Dojo Toolkit

UNIT-4

IIS and Apache: introduction, architecture, client – server side scripting, requesting
documents.
Database: Introduction, RDBMS, SQL – simple queries, ADO.NET object model, Java DB/
Apache Derby

55 | SCHEME OF COURSES AND EXAMINATION: B.Tech. CSE . (Artificial Intelligence), NSUT MAIN CAMPUS
PHP: introduction, basics, form processing and business logic, connecting to a database,
using cookies.
Ruby on Rails: Intro, Ruby, Rails Framework, scripting

UNIT-5

ASP.NET and ASP.NET Ajax: introduction, creating and running a simple web form
example, relationship, generating XHTML code, web controls, sessions tracking.

JavaServer Faces Web Applications:

Java Web technologies, creating and running a simple application in Netbeans, examining
a JSP file, event processing life cycle, JSF components, Text vs. graphics components,
validation, session cookies, web services

Guidelines for Project work:

Exercises based on these technologies
REFERENCE BOOKS

1. Deitel and Deitel: Internet and Worldwide Web programming, Pearson

2. Frank Barbier: Reactive Internet programming, ACM Books
3. Tara Calishain: Google hacks, O’Reilly Media
4. Sergei Dunaev Advanced Internet Programming, IT Master

B.Tech. Computer Science & Engineering (Artificial Intelligence)-

SEMESTER III

Course Pre-
Code requisites
Type Subject L T P Credits CA MS ES CA ES

Database CACSC02
Management 3 0 2 4 15 15 40 15 15
CACSC05 CC Systems

56 | SCHEME OF COURSES AND EXAMINATION: B.Tech. CSE . (Artificial Intelligence), NSUT MAIN CAMPUS
COURSE OUTCOMES

At the end of the course students will be able to

CO1: understand fundamentals of database management systems.

CO 2: design database models and learn database languages to write queries to

extract information from databases.

CO 3: Identify database anomalies and improve the design of database

management system

CO 4: understand transaction management and concurrency control.

CO 5: understand storage organization and database recovery.

COURSE CONTENT

UNIT 1

Introduction: Database management system Characteristics of the Database,

Database Systems and Architecture, Data Models, Schemes & Instances, DBMS
Architecture & Data Independence, Database administrator & Database Users,
Database Languages & Interfaces, DDL, DML, DCL, Overview Relational Data Base
Management Systems

UNIT 2

Data Modeling: Data modeling using The Entity-Relationship Model – Entities,

Attributes and Relationships, Cardinality of Relationships, Strong and Weak Entity
Sets, Generalization, Specialization, and Aggregation, Translating your ER Model
into Relational Model, Relationships of higher degree.

UNIT 3
Relational Model, Languages & Systems: Relational Data Model concepts, Relational
Model Constraints, integrity constraints ,Keys domain constraints, referential
integrity, assertions triggers, foreign key
Relational Algebra and calculus, SQL. Database security.

Relational Data Base Design: Functional Dependencies & Normalization for

Relational Databases, Functional Dependencies, Normal Forms Based on Primary
Keys, (1NF, 2NF, 3NF & BCNF), Lossless Join and Dependency Preserving
Decomposition, Functional dependencies and its closure, covers and equivalence.

57 | SCHEME OF COURSES AND EXAMINATION: B.Tech. CSE . (Artificial Intelligence), NSUT MAIN CAMPUS
 UNIT 4

Transaction Management: Transaction Concept and State, Implementation of

Atomicity and Durability, Concurrent Executions, Serializability: Testing of
serializability, Serializability of schedules, conflict & view serializable schedule.

Concurrency Control Techniques: Lock-Based Protocols, Timestamp-based Protocols,

validation based protocol. Deadlock Handling

UNIT 5

Recovery System

Recoverability: Failure Classification, Storage Structure, Recovery and Atomicity,

Log-based Recovery, Shadow Paging, Recovery with Concurrent Transactions

Storage organization : Indexing, Hashing ,file storage.

List of Experiments:

Following is only a suggestive list of experiments. For better coverage faculty may increase the list
of experiments.

Q 1: Consider the following relational schema

SAILORS (sid, sname, rating, date_of_birth)

BOATS (bid, bname, color)

RESERVES (sid, bid, date, time slot)

Write the following queries in SQL and relational algebra

a) Find sailors who’ve reserved at least one boat

b) Find names of sailors who’ve reserved a red or a green boat in the month of March.
c) Find names of sailors who’ve reserved a red and a green boat
d) Find sid of sailors who have not reserved a boat after Jan 2018.

58 | SCHEME OF COURSES AND EXAMINATION: B.Tech. CSE . (Artificial Intelligence), NSUT MAIN CAMPUS
 e) Find sailors whose rating is greater than that of all the sailors named “John”
f) Find sailors who’ve reserved all boats
g) Find name and age of the oldest sailor(s)
h) Find the age of the youngest sailor for each rating with at least 2 such sailors

Q2. Consider the following relational schema:

CUSTOMER (cust_num, cust_lname , cust_fname, cust_balance);

PRODUCT (prod_num, prod_name, price)

INVOICE (inv_num, prod_num, cust_num, inv_date ,unit_sold, inv_amount);

Write SQL queries and relational algebraic expression for the following

a) Find the names of the customer who have purchased no item. Set default value of Cust_balance as 0 for
such customers.
b) Write the trigger to update the CUST_BALANCE in the CUSTOMER table when a new invoice record
is entered for the customer.
c) Find the customers who have purchased more than three units of a product on a day.
d) Write a query to illustrate Left Outer, Right Outer and Full Outer Join.
e) Count number of products sold on each date.
f) As soon as customer balance becomes greater than Rs. 100,000, copy the customer_num in new table
called ”GOLD_CUSTOMER”
g) Add a new attribute CUST_DOB in customer table

Q 3: Consider the following relational schema

DEPARTMENT(Department_ID, Name, Location_ID)

JOB (Job_ID , Function )

EMPLOYEE (Employee_ID, name, DOB, Job_ID , Manager_ID, Hire_Date, Salary,

department_id)

Answer the following queries using SQL and relational algebra:

a) Write a query to count number of employees who joined in March 2015

b) Display the Nth highest salary drawing employee details.
c) Find the budget (total salary) of each department.
d) Find the department with maximum budget.
e) Create a view to show number of employees working in Delhi and update it automatically when the
database is modified.
f) Write a trigger to ensure that no employee of age less than 25 can be inserted in the database.

59 | SCHEME OF COURSES AND EXAMINATION: B.Tech. CSE . (Artificial Intelligence), NSUT MAIN CAMPUS
 Q4: PROJECT
Students are required to develop a DBMS for the applications assigned to them. Following items are
required to be submitted for the project

a) Problem Statement
b) ER model/ Relational Model
c) Integrity Constraints implemented
d) Suitable Queries to create and manage database

Note: Students have to make sure that they have defined proper integrity constraints to ensure
consistency of database used in assignments as well as project.

SUGGESTED READINGS:

Text book:

1. Korth ,Silbertz, Sudarshan, ”Data base concepts”, McGraw-Hill, 2013

Reference books

1.Elmasri, Navathe, “Fundamentals of Database systems”, Addison Wesley, 2010

2.Date C.J., ”An Introduction to Database systems”, Addison-Wesley Longman,

Inc.,2004

B.Tech. Computer Science & Engineering-SEMESTER III

Course Evaluation Scheme

Type Subject L T P Credits
Code
(Percentage
weights)
Pre-
requisites
Theory Practical

CA MS ES CA ES

Design CACSC02
and
CACSC06 CC 3 0 2 4 15 15 40 15 15
Analysi
s of
Algorit
hms

60 | SCHEME OF COURSES AND EXAMINATION: B.Tech. CSE . (Artificial Intelligence), NSUT MAIN CAMPUS
 COURSE OUTCOMES

1. To be able to analyze the asymptotic performance of algorithms.

2. To be able to write rigorous correctness proofs for algorithms.
3. Ably demonstrate a familiarity with major algorithms and data
structures.
4. To be able to apply important algorithmic design paradigms and
methods of analysis.
5. To be able to synthesize efficient algorithms in common
engineering design situations.

CONTENTS

UNIT I

Design and Analysis of Algorithms Asymptotic notations and their significance,

introduction to RAM model of computation, complexity analysis of algorithms, worst
case and average case. Basic introduction to algorithmic paradigms like divide and
conquer, recursion, greedy, etc.

UNIT II

Searching: binary search trees, balanced binary search trees, AVL trees and red-black
trees, B-trees, skip lists, hashing Priority queues, heaps, Interval trees, tries. Order
statistics. Sorting: comparison based sorting - quick sort, heap sort, merge sort: worst
and average case analysis. Decision tree model and (worst case) lower bound on
sorting. Sorting in linear time - radix sort, bucket sort, counting sort, etc. String
matching.

UNIT III

Graph Algorithms: BFS, DFS, connected components, topological sort, minimum

spanning trees, shortest paths - single source and all pairs.Models of computation:
RAM model and its logarithmic cost. Formal introduction to algorithmic paradigms:
divide and conquer, recursion, dynamic programming, greedy, branch and bound, etc.
Advanced data structures: Fibonacci heap, union-find, splay trees. Amortized
complexity analysis

UNIT IV

61 | SCHEME OF COURSES AND EXAMINATION: B.Tech. CSE . (Artificial Intelligence), NSUT MAIN CAMPUS
Randomized algorithms: Randomized algorithms to be introduced a bit early, i.e.,
before NP-completeness to highlight randomization as an algorithmic technique.
Application areas: Geometric algorithms: convex hulls, nearest neighbor, Voronoi
diagram, etc. Algebraic and number-theoretic algorithms: FFT, primality testing, etc.

UNIT V

Graph algorithms: network flows, matching, etc. Optimization techniques: linear

programming Reducibility between problems and NP-completeness: discussion of
different NP-complete problems like satisfiability, clique, vertex cover, independent
set, Hamiltonian cycle, TSP, knapsack, set cover, bin packing, etc. Backtracking,
branch and bound, Approximation algorithms: Constant ratio approximation
algorithms.

REFERENCE BOOKS

1. E. Horowitz, S. Sahni, and S. Rajsekaran, “Funadmentals of Computer

Algorithms,” Galotia Publication
2. T .H . Cormen, C .E .Leiserson, R .L .Rivest “Introduction to Algorithms”, PHI.
3. Sedgewich, Algorithms in C, Galgotia
4. Berman. Paul, “Algorithms, Cengage Learning”.
5. Richard Neopolitan, Kumar SS Naimipour, “Foundations of Algorithms”

62 | SCHEME OF COURSES AND EXAMINATION: B.Tech. CSE . (Artificial Intelligence), NSUT MAIN CAMPUS
 B.Tech. Computer Science & Engineering (Artificial
Intelligence)-SEMESTER III

Course Pre-
Type Subject L T P Credits CA MS ES CA ES requisite
Code
s

Computer
Architecture
CACSC07 CC 4 25 25 50 - -
and 3 1 0 CACSC02
Organization

COURSE OUTCOMES
1. To understand the architecture of modern processors and organization of its
components, and relationship between hardware and software in digital
machines.
2. To design instructions and corresponding logic circuits for a simple CPU with its
essential components such as ALU, a register file, memory and input-output.
3. To understand the organization of computer systems
4. To understand the computation standards and using them in writing algorithms
5. To appreciate the evolving technology that governs the evolution of modern
computers and continue to keep abreast of state-of-art in computing technology
COURSE CONTENT
UNIT-1
Overview of computer organization: Characteristics of a general purpose computer,
The stored program concept, von Neumann architecture, Harvard architecture,
Programmer’s model - the Instruction set architecture (ISA), ISA design and
performance criteria, Basic computer organization with CPU, memory and IO
subsystems, Interconnect busses, Evolution of CISC and RISC based processors
and their merging.
UNIT-2

Instruction Set Architectures: Machine instruction, Machine cycle and Instruction

cycles, Instruction Set: memory and non-memory reference instructions, instruction
categories: data movement, data manipulation, program control and machine
control instructions, CISC types addressing modes and instruction formats, RISC
type addressing modes and instruction formats.
UNIT-3

Central Processing Unit: Specification of a simple CPU using RTL, Design of the data
path

63 | SCHEME OF COURSES AND EXAMINATION: B.Tech. CSE . (Artificial Intelligence), NSUT MAIN CAMPUS
for the simple CPU, Designing the hardwired control path for the simple CPU,
Performance analysis of the simple CPU, Enhancement of the ISA for the simple CPU
and design
extensions, Characteristics of RISC CPU design: ISA characteristics, pipelining, data
and instruction caches, Practical case studies in CISC type and RISC type CPU
designs.
UNIT-4

Microprogrammed Control Unit: Control memory system, Microinstruction-

sequencing, conditional branch, mapping and subroutines, direct, horizontal and
vertical microcoding, micro-instruction format and symbolic representation,
design of micro-control unit for a simple CPU, applications of microprogramming

Memory organization: Memory hierarchy, Cache organization: Direct, associative

and Set associative cache, Auxiliary memory organization, RAID organizations
Input output organization: IO interfacing, Asynchronous data transfer,
Programmed IO, Interrupt driven IO, Priority schemes, Direct Memory Access,
Serial communication techniques

UNIT-5

Computer arithmetic: Design of Binary addition and subtraction units,

Algorithms for multiplication and division and their implementation, Floating
point arithmetic, etc.
Pipelined architecture: Basic concepts of pipelining, Speedup and throughput,
Minimum Average Latency, Instruction pipeline.
GPU architecture: Hardware Basics, Execution Model, GPU instruction set
architecture, NVIDIA GPU instruction set architecture

Guidelines for Project work:

- Exercises using assembly-level programming and debugging to illustrate the

working of instructions in the ISA of a CISC based /RISC based processor. These
exercises should illustrate the status of various registers, flags, counters and
pointers after data movement, data manipulation, program control, and stack
operations.
- Semester-long group project on the design and simulation /hardware
emulation of a simple processor.

64 | SCHEME OF COURSES AND EXAMINATION: B.Tech. CSE . (Artificial Intelligence), NSUT MAIN CAMPUS
REFERENCE BOOKS

1. William stallings, “Computer Organization and Architectue, PHI” 2. M. Morris Mano,

2. M. Morris Mano, “Computer System Architecture” , PHI
3. J.D. Carpinelli, “Computer Systems Organization and Architecture,” Pearson
Education
4. Heuring and Jordan, Pearson Education, “Computer Systems Design and
Architecture”
5. Tor M. Aamodt, Wilson Wai Lun Fung, Timothy G. Rogers General-Purpose Graphics
Processor Architectures

B.Tech. Computer Science & Engineering (Artificial

Intelligence)-SEMESTER III

Course Type Subject L T P Credits CA MS ES CA ES Pre-requisites

Code

Microproce 3 0 2 CAECC03
CAECC08 CC 4 15 15 40 15 15
ssors and
Microcontr
ollers

65 | SCHEME OF COURSES AND EXAMINATION: B.Tech. CSE . (Artificial Intelligence), NSUT MAIN CAMPUS
COURSE OUTCOMES

1. Acquire knowledge of architecture and programming of microprocessors.

2. Understand the salient features of the x86 architecture.
3. Acquire hands-on knowledge of interfacing microprocessors with peripherals.
4. Understand the architecture and working of microcontrollers and their utility.
5. Acquire introductory knowledge about high-end microprocessors and
microcontrollers.

COURSE CONTENT

Unit 1 - Intel 8085 microprocessor: Basic concepts of microprocessor,

microcomputer, microcontroller. Architecture (pins, signals, buses, register set),
addressing modes, instruction set (instruction format, opcode, mnemonic),
subroutines, timing diagrams and t-states of different instructions, programming,
recursive programs, vectored and non-vectored interrupts and interrupt handling
of 8085.

Unit 2 - Intel 8086 microprocessor: Architecture (pins, bus interface unit,

execution unit, register set, pipelining), memory addressing, segmentation,
instruction set (data transfer, arithmetic, logic, string, long and short control
transfer and processor control), timing diagrams, operating modes, programming,
assemblers, address-objects, parameter passing to subroutines, hardware and
software interrupts and interrupt handling of 8086.

Unit 3 - Interfacing of microprocessors: Interfacing a microprocessor with RAM

and ROM chips, address allocation and decoding techniques. Interfacing with LED,
LCD, ADC, DAC, toggle switch and keypad. Memory-mapped i/o. Interfacing with
8255 programmable peripheral interface (architecture, ports, i/o modes and BSR
mode). Basic architecture and features of 8254 programmable timer, 8257
programmable DMA controller, 8259 programmable interrupt controller, 8279
programmable keyboard and display controller and 8087 math coprocessor.

Unit 4 - Microcontrollers: 8051 microcontroller: architecture, i/o ports, memory

organization, addressing modes, instruction set, simple programs. Introduction to
IoT: basic architecture, sensing and actuating, application domains.

Unit 5 - High-end microprocessors and microcontrollers: Important features of 32-

bit processors, RISC and Pentium. Implementation of memory management
schemes like segmentation, paging and virtual memory at the hardware level.
Introduction to Arduino: basic architecture, hardware and software, simple
programs.

Guidelines for practical work:

1. Write an assembly program to generate the numbers of the Fibonacci series.

2. Write an assembly program to clear all flags without using any data transfer
instruction.

66 | SCHEME OF COURSES AND EXAMINATION: B.Tech. CSE . (Artificial Intelligence), NSUT MAIN CAMPUS
3. Write an assembly program to search for a number in a list.
4. Write an assembly program to sort a list.
5. Write an assembly program to copy a list from one part of the memory to
another.
6. Write an assembly program to multiply two numbers using successive
additions.
7. Write an assembly program to calculate the square root of a number.
8. Write an assembly program to calculate the factorial of a number using
recursion.
9. Write a self-replicating assembly program.
10. Interface 8255 with a microprocessor and use all its modes.
11. Interface 8254 with a microprocessor and use it to generate differ types of
clock signals.
12. Interface 8259 with a microprocessor and use all its features.
13. Interface 8257 with a microprocessor and write a program to control a keypad
and a LED display.
14. Design digital systems with Arduino and simple sensors and actuators.

SUGGESTED READINGS

1. Ramesh S. Gaonkar, “Microprocessor Architecture, Programming, and

Applications with the 8085” Prentice Hall.

2. D. V. Hall, “Microprocessor and Interfacing Programming & Hardware” TMH –

2nd Edition.

3. S. P. Morse, “8086 Primer: An Introduction to Its Architecture, System Design

and Programming” Hayden Book Co.

4. S. Monk, “Programming Arduino: Getting Started with Sketches”, 2nd Edition,

McGraw-Hill.

5. M.A. Mazidi et. al. “The 8051 Microcontroller and Embedded Systems: Using
Assembly and C” Pearson Publishers.

67 | SCHEME OF COURSES AND EXAMINATION: B.Tech. CSE . (Artificial Intelligence), NSUT MAIN CAMPUS
4.3.4 SYLLABI OF PROGRAM CORE COURSES : IV SEMESTER

SYLLABI B. TECH. Computer Science & Engineering (Artificial Intelligence) IV

SEMESTER

Course Type Subject L T P Credits TC TM TE PC PES Pre-requisites

Code A S S A
Operating 3 0 2 Design and
CACSC09 CC 4 15 15 40 15 15
Systems Analysis of
Algorithms
COURSE OUTCOMES
1. Understand the function, structure, history of an operating system and the
design issues associated with an operating system.
2. Understand the concept of multithreading, process management concepts
including scheduling, synchronization and deadlocks.
3. Learn the memory management concepts including virtual memory.
4. Comprehend file system interface and implementation and disk management.
5. Be familiar with protection and security mechanisms.

COURSE CONTENT
Unit 1
Overview: Operating systems – structure, operations, components, types, services,
user interfaces. System calls, system programs, system boot.
Process management: Processes – concept, scheduling, operations on processes,
interprocess communications. IPC Methods, pipes, popen, pclose functions, Co-
Processes, FIFOs, Message Queues, Shared Memory, Stream pipes, Threads – single-
and multi-threaded processes.

Unit 2
CPU scheduling – criteria, algorithms, multiple-processor scheduling.
Process synchronization – critical-section problem, semaphores, classic
synchronization problems, monitors.

Unit 3

Deadlocks – characterization, deadlock prevention, deadlock avoidance, deadlock

68 | SCHEME OF COURSES AND EXAMINATION: B.Tech. CSE, NSUT MAIN CAMPUS

 detection, prevention, avoidance, recovery from deadlock.
Memory management: Objective and functions, Simple monitor resident program,
overlays- swapping, Main memory – memory allocation schemes, paging,
segmentation. Virtual memory concept– demand paging, page interrupt fault, page
replacement algorithms, segmentation – simple, multilevel, segmentation with
paging, frame allocation, thrashing.

Unit 4
Storage management: File system – files and directories, structure and
implementation of file systems, mounting and unmounting, storage allocation
methods, free-space management. Disk – structure, scheduling, management.

Unit 5
I/o management: i/o hardware, i/o interface, kernel i/o subsystem.
Protection and security: Access matrix, security threats.
Case studies of latest operating systems.

Practical List

Implement these programs in C/C++ using Linux/Unix environment operating system. Maintain hard copy
of the same for final assessment.
1. Process creation and termination for operating system (fork, wait, signal, exit
etc.).
2. Threads.
3. CPU scheduling algorithms: FCFS, SJF, Round Robin, Preemptive Priority
Scheduling.
4. Inter process communication.
5. Critical Section problem.
6. Producer – Consumer problem using bounded and unbounded buffer.
7. Reader Writers problem, Dining Philosophers problem using semaphores.
8. Banker’s algorithm.
9. Page replacement algorithms: LRU, LRU-Approximation, FIFO, Optimal.
10. File operation system calls (open, read, close, append etc.)
11. Disk scheduling algorithms: FCFS, SSTF, SCAN, CSCAN, LOOK, CLOOK.

Text Book:
1. Silberschatz, A., Galvin, P. B., and Gagne, G. 2009. “Operating System
Principles (8th ed.)”, Wiley.
Reference Book:
1. Stallings, W. 2014. “Operating Systems: Internals and Design Principles (8th
ed.)”, Pearson.

69 | SCHEME OF COURSES AND EXAMINATION: B.Tech. CSE, NSUT MAIN CAMPUS

 2. Tanenbaum, A. S. 2007. “Modern Operating Systems (3rd ed.)”, Pearson.
3. UNIX System Programming Using C++,by Terrence Chan: Prentice Hall India,
1999.
4. Advanced Programming in UNIX Environment, by W. Richard Stevens: 2nd Ed,
Pearson Education, 2005.
5. Operating Systems – William Stallings, Pearson Education Asia (2002)
6. Operating Systems - Nutt, Pearson Education Asia (2003)

B.Tech. Computer Science & Engineering (Artificial Intelligence) SEMESTER IV

Course No. Type Subject L T P Credits CA MS ES CA ES Pre-requisites

CC Theory of
Discrete
Automata
Structures
& Formal 3 1 0
CACSC10 4 25 25 50 Computer
language
s Programmin
g

COURSE OUTCOMES

1. Students will be able to demonstrate knowledge of basic mathematical models

of computation and relate them to the formal languages.
2. Acquire knowledge of Regular Languages, FA, CFG, Push Down Automata and
Turing recognizable languages
3. Be able to get a broad overview of the theoretical foundations of computer
science
4. Be able to think analytically and intuitively for problem solving situations in
related areas of theory of computer science
5. Students will understand the limitations of computers and learn examples of
unsolvable problems.

COURSE CONTENT
UNIT I
Finite Automata: Deterministic FA, Non deterministic FA, Regular
expressions, Finite Automaton with €- moves, Regular Expression, Regular
Languages and Kleene’s theorem– Conversion of NFA to DFA, Equivalence of
finite Automaton and regular expressions, Arden’s Theorem. Myhill Nerode

70 | SCHEME OF COURSES AND EXAMINATION: B.Tech. CSE, NSUT MAIN CAMPUS

 Theorem, Minimization of DFA, Pumping Lemma for Regular sets, Problems
based on Pumping Lemma.
UNIT II

Context Free Grammar: Grammar, Types of Grammar, Context Free Grammars

and Languages, Derivations, Ambiguity, Relationship between derivation and
derivation trees, Simplification of CFG, Elimination of Useless symbols - Unit
productions - Null productions, Chomsky normal form (CNF), Greibach Normal
form (GNF), Problems related to CNF and GNF.
UNIT III

Pushdown Automata: Moves, Instantaneous descriptions, Deterministic

pushdown automata, Equivalence of Pushdown automata and CFL, pumping
lemma for CFL, problems based on pumping Lemma.
UNIT IV

Turing Machine: Definitions of Turing machines, Computable languages and

functions, Techniques for Turing machine construction, Multi head and Multi
tape Turing Machines, The Halting problem, Partial Solvability, Problems about
Turing machine- Chomsky hierarchy of languages.

UNIT V

Difficult problems: Unsolvable Problems and Computable Functions, Primitive

recursive functions, Recursive and recursively enumerable languages, Universal
Turing machine, Measuring and classifying complexity - Tractable and Intractable
problems,

SUGGESTED READINGS
1. Hopcroft J.E., Motwani R. and Ullman J.D, “Introduction to Automata Theory,
Languages and Computations”, Second Edition, Pearson Education.
2. John C Martin, “Introduction to Languages and the Theory of Computation”,
Third Edition, Tata McGraw Hill Publishing Company, New Delhi
3. Marvin L. Minsky “Computation: Finite and Infinite” – Prentice Hall, 1967
4. Michael Sipser “Introduction to the Theory of Computation” , Third Edition,
2012 Cengage Learning
5. Peter Lenz – An Introduction to Formal languages and Automata – 3rd Edition
Narosa, 2003
6. Thomas A. Sukamp – An introduction to the theory of computer science
languages and machines – 3rd edition, Pearson Education, 2007.
7. G E Reevsz “Introduction to Formal Languages” TMH, 2000

71 | SCHEME OF COURSES AND EXAMINATION: B.Tech. CSE, NSUT MAIN CAMPUS

 B.Tech. Computer Science & Engineering (Artificial Intelligence) SEMESTER IV

Course No. Type Subject L T P Credits CA MS ES CA ES Pre-requisites

CC Artificial 3 0 2 None
CACSC11 4 15 15 40 15 15
Intelligence
COURSE OUTCOMES

1. Distinguish between a conventional system and an intelligent system

2. Explain Artificial Intelligence concept and its applications
3. Represent knowledge using various different techniques
4. Use the appropriate searching techniques and reasoning methods in achieving
desired goals.
5. Understand the future of AI and ethical implications of developments in AI

72 | SCHEME OF COURSES AND EXAMINATION: B.Tech. CSE, NSUT MAIN CAMPUS

 COURSE CONTENT

UNIT 1:

Fundamentals of AI
Introduction
What Is AI, The Foundations of Artificial Intelligence, The History of Artificial
Intelligence, The State of the Art, Risks and Benefits of AI
Intelligent Agents
Agents and Environments, Good Behavior: The Concept of Rationality, The Nature
of Environments, The Structure of Agents

UNIT 2:

Problem-solving -I
Solving Problems by Searching
Problem-Solving Agents, Example Problems, Search Algorithms, Uninformed
Search Strategies, Informed (Heuristic) Search Strategies, Heuristic Functions
Search in Complex Environments

Local Search and Optimization Problems, Local Search in Continuous Spaces,

Search with Nondeterministic Actions, Search in Partially Observable Environments,
Online Search Agents and Unknown Environments

UNIT 3:

Problem-solving -II
Adversarial Search and Games
Game Theory, Optimal Decisions in Games, Heuristic Alpha--Beta Tree Search,
Limitations of Game Search Algorithms
Constraint Satisfaction Problems
Defining Constraint Satisfaction Problems, Constraint Propagation: Inference in
CSPs, Backtracking Search for CSPs, Local Search for CSPs, The Structure of
Problems

UNIT 4:

Knowledge, reasoning and representation

Logical Agents
Knowledge-Based Agents, The Wumpus World, Logic, Propositional Logic: A Very
Simple Logic, Propositional Theorem Proving, Effective Propositional Model
Checking, Agents Based on Propositional Logic
First-Order Logic
Syntax and Semantics of First-Order Logic, Using First-Order Logic, Knowledge
Engineering in First-Order Logic
Inference in First-Order Logic
Propositional vs. First-Order Inference , Unification and First-Order Inference,
Forward Chaining, Backward Chaining, Resolution
Knowledge Representation
Ontological Engineering, Categories and Objects, Events, Mental Objects and
Modal Logic, Reasoning Systems for Categories, Reasoning with Default
Information

73 | SCHEME OF COURSES AND EXAMINATION: B.Tech. CSE, NSUT MAIN CAMPUS

SUGGESTED READINGS
1. R . S. Pressman, Bruce R. Maxim “Software Engineering – A practitioner’s approach”, McGraw Hill
Int. Edition, Eight Edition, 2019
2. Sommerville, “Software Engineering”, 10th Edition, Pearson, 2017
3. Sangeeta Sabharwal, “Software Engineering: Principles and Techniques”, Second Edition, Published
by New Age International Publishers, 2020
4. Rajib Mall, “Fundamentals of Software Engineering” , PHI learning Pvt Ltd, 2018

Course Type Subject L T P Credits CA MS ES CA ES Pre-

Code requisites
Data 3 0 2 None
CAECC12 CC 4 15 15 40 15 15
Commun
ication
COURSE OUTCOMES
1. To introduce students about different digital modulation schemes.
2. To introduce the students the functions of different layers of
networking.
3. To introduce various types of access control methods.
4. To make students to get familiarized with different protocols and
network components.
5. To introduce the students about basic queuing models
COURSE CONTENT
UNIT-I

Digital Communication: Sampling theorem (Instantaneous Sampling, Natural Sampling and

Flat Top Sampling), PAM, PPM, PWM, Quantization noise, PCM, Binary Modulation: ASK,
PSK, FSK, MSK, DPSK, QPSK and their probability of error calculation.

UNIT-II

Data Communications: Review of Error Detection and Correction codes. Need of line coding,
Line coding scheme: Unipolar, Polar, Bipolar and Multilevel Encoding, Network and Protocol
Architecture, Reference Model ISO-OSI, TCP/IP-Overview, topology, DTE-DCE interface,
interface standards, modems, cable modem, transmission media. Switching: Circuit switching
(space-division, time division and space-time division), packet switching (virtual circuit and
Datagram approach), message switching,

UNIT-III

Data Link Layer: Data Link Control and Protocols: Flow and Error Control, Stop-and-wait
ARQ. Sliding window protocol, Go-Back-N ARQ, Selective Repeat ARQ, HDLC, Point-to –
Point Access: PPP Point –to- Point Protocol, PPP Stack, IEEE standard 802.3 & 802.11 for

74 | SCHEME OF COURSES AND EXAMINATION: B.Tech. CSE, NSUT MAIN CAMPUS

 LANS, high speed LANs, Token ring, Token Bus, FDDI based LAN, Network Devices-
repeaters, hubs, switches bridges.

UNIT-IV

Medium Access Sub layer: Channel allocation problem, multiple access protocols (ALOHA,
CSMA and CSMA/CD)

Network Layer: Design issues, Routing algorithms, Congestion control algorithms,

Host to Host Delivery: Internetworking
UNIT-V

Queuing Theory: Finite Markov Chain –Discrete and continuous time Markov
chains, Classification of states, Limiting distribution, Birth and death process,
Poisson process, Steady state and transient distributions, Simple Markovian
queuing models (M/M/1, M/M/1/N).

List of Experiments
1. Introduction to MATLAB
a. Matrix computation.
b. To Plot Sine Wave of frequency 200 Hz.
c. To plot a pulse of width 10.
d. Plot the spectrum (Amplitude and phase) 0f the pulse generated in 3.
2. Uniform random number and plot its density function. Find its mean and
variance.
3. Generate Gaussian distributed random number and plot its density function.
Find its mean and variance.
4. Compute the Signal to quantization Noise ratio of Uniform Quantization. Plot
SNQR versus Quantization levels.
5. Compute the Signal to quantization Noise ratio of Non-Uniform Quantization.
Plot SNQR versus Quantization levels.
6. Study of passband digital communication technique BPSK. Calculate the BER
of BPSK modulated signal.
7. Given is a linear block code with the generator matrix G
1100101
a. G = 0 1111001110011
a. Calculate the number of valid code words N and the code rate RC. Specify
the complete Code set C.
b. Determine the generator matrix G′ of the appropriate systematic (separable)
code C’.
c. Determine the syndrome table for single error.
8. To generate a M/M/1 Queue having infinite buffer space with parameters (λ, μ)
and plot the average delay per packet vs λ/μ.
9. To generate a M/M/1 Queue having finite buffer space with parameters (λ, μ)
and plot blocking probability with respect to variation with buffer space.
10. To simulate STOP and WAIT protocol using M/M/1 queuing system and
plot average delay per packet vs λ/μ.
11. To simulate SLIDING WINDOW protocol and evaluate its performance

75 | SCHEME OF COURSES AND EXAMINATION: B.Tech. CSE, NSUT MAIN CAMPUS

 with variation of window size.
12. Observe and measure the performance of TOKEN BUS MAC Layer
protocols by changing the network load, distance between the nodes.
13. Observe and measure the performance of ALOHA protocol by changing
the network load, distance between the nodes.
14. Observe and measure the performance of CSMA protocols by changing
the network load, distance between the nodes.
15. Observe and measure the performance of CSMA/CD protocols by
changing the network load, distance between the nodes.

Text Book:

1. A. S. Tannenbum, D. Wetherall, “Computer Networks”, Prentice Hall, Pearson, 5 th

Ed [T2] Behrouz A. Forouzan, “Data Communications and Networking”, Tata McGraw-
Hill, 4th Ed

Reference:

1. Fred Halsall, “Computer Networks”, Addison – Wesley Pub. Co. 1996.

2. Larry L, Peterson and Bruce S. Davie, “Computer Networks: A system Approach”, Elsevier,
4 th Ed
3. Tomasi, “Introduction To Data Communications & Networking”, Pearson 7th impression
2011
4. William Stallings, “Data and Computer Communications”, Prentice Hall, Imprint of
Pearson, 9 th Ed.
5. Zheng , “Network for Computer Scientists & Engineers”, Oxford University Press
6. Data Communications and Networking: White, Cengage Learning

Course No. Title of the Course Pre-Requisite

Course Structure

CAMTC13 Probability and 3L-1T-0P None

Stochastic
Processes

COURSE OUTCOMES (CO)

1. To understand the detailed concept of probability and applications.
2. To know about Continuous Frequency distribution.
3. To know about MGF and Method of Least square.
4. To understand the concept of large samples.
5. To understand sampling theory for small samples and inference.

76 | SCHEME OF COURSES AND EXAMINATION: B.Tech. CSE, NSUT MAIN CAMPUS

COURSE CONTENT:

UNIT-1

Probability: Mathematical and Statistical definitions and problems, Marginal

probability, Random variables, discrete and continuous random variables, Mathematical
Expectation, Moments, Central moments, Kurtosis.

UNIT-2

Important Theoretical Distributions: Review of continuous and discrete probability

distributions, Negative binomial distribution, Fitting of standard distributions, Fitting of
Normal distribution by method of areas and method of ordinates, Hypergeometric
distributions, Multinomial distribution, Rectangular distribution, Beta distribution of
first and second kind, Gamma distribution, Cauchy’s distribution, Geometrical
probability, Tchebycheff's and Markov's inequalities.

UNIT-3

MGF and Method of Least Square: Change of origin and scale in MGF, moment
generating functions of standard distributions (Poisson, Binomial, Exponential, Uniform,
Normal, Gamma, chi square), Cumulants, characteristic function, Weak law of large
numbers, Central limit theorem. Method of least squares: Fitting of straight lines,
parabola and exponential curves.

UNIT-4

Simple sampling of attributes: Large samples, mean and S. D. in simple sampling of

attributes, Test of significance for large samples, Standard error, Type I and II errors,
Null hypothesis, Confidence limits, Chi-square distribution, Degree of freedom, Level of
significance, Test of goodness of fit, Test of independence, Coefficient of contingency,
Yate's correction for continuity.

UNIT-5

Sampling of variables and Inference: Small samples, t-distribution, test of significance of

the mean of random sample from normal population, F-distribution, Relationship
between t, F and chi square distributions, Inference: Point estimation, interval
estimation, properties of good estimator, Maximum likelihood parameter.
Recommended Books:

77 | SCHEME OF COURSES AND EXAMINATION: B.Tech. CSE, NSUT MAIN CAMPUS

1. An Introduction to Probability Theory and Its Applications, Vol. 1
(Wiley Series in Probability and Statistics) by W. Feller, 1968
2. Advanced Engineering Mathematics by Erwin Kreyszig (Wiley Publication), 2020
3. Probability & Statistics- SOS by Spiegel, McGraw Hill, 2010
4. Probability and Statistics for Engineers by Anthony J. Hayter (Cengage Learning), 2013
5. Mathematical Statistics, Krishna Prakashan Media by J. K. Goyal and J. N. Sharma, 2014

78 | SCHEME OF COURSES AND EXAMINATION: B.Tech. CSE, NSUT MAIN CAMPUS

4.3.5 SYLLABI OF PROGRAM CORE COURSES : V SEMESTER

4.3.6 SYLLABI OF PROGRAM CORE COURSES : VI SEMESTER

4.4 DEPARTMENT ELECTIVE COURSES

4.4.1 LIST OF DEPARTMENT ELECTIVES

4.4.2 SYLLABI OF DEPARTMENT ELECTIVES COURSES : V SEMESTER

4.4.3 SYLLABI OF DEPARTMENT ELECTIVES COURSES : VI SEMESTER

4.4.4 SYLLABI OF DEPARTMENT ELECTIVES COURSES : VII & VIII SEMESTERS

4.5 OPEN ELECTIVE COURSES

4.5.1 LIST OF OPEN ELECTIVES

4.5.2 SYLLABI OF OPEN ELECTIVE COURSES : SCIENCES

4.5.3 SYLLABI OF OPEN ELECTIVE COURSES : HUMANITIES & SOCIAL SCIENCES

4.5.4 SYLLABI OF OPEN ELECTIVE COURSES : MANAGEMENT

79 | SCHEME OF COURSES AND EXAMINATION: B.Tech. CSE, NSUT MAIN CAMPUS