Syllabus

Scanned by CamScanner
School of Engineering & Technology J AIN UNIVERSITY
Global Campus
Decla re d as Dee me d -to -be Unive rs ity u/s 3 o f the UG C Ac t 1956
Jakkasandra Post, Kanakapura Taluk, Ramanagara
District - Pin Code: 562 112
Problem Solving through Programming
Subject code: 18ESCS01 Total hours: 45

Credits: 3 Hours/week: 4
L-T-P: 2-1-0
Module – 1
INTRODUCTION (8 Hours)
Generation and Classification of Computers- Basic Organization of a Computer –Number
System – Binary – Decimal – Conversion – Problems. Need for logical analysis and thinking–
Algorithm – Pseudo code – Flow Chart
Module – 2
C PROGRAMMING BASICS (10 Hours)
Problem formulation – Problem Solving - Introduction to ‘ C’ programming –fundamentals –
structure of a ‘C’ program – compilation and linking processes – Constants, Variables – Data
Types – Expressions using operators in ‘C’ – Managing Input and Output operations – Decision
Making and Branching – Looping statements – solving simple scientific and statistical problems.
Module – 3
ARRAYS AND STRINGS (9 Hours)
Arrays – Initialization – Declaration – One dimensional and Two dimensional arrays. String-
String operations – String Arrays. Simple programs- sorting- searching – matrix operations.
Module – 4
FUNCTIONS AND POINTERS (9 Hours)
Function – definition of function – Declaration of function – Pass by value – Pass by reference –
Recursion – Pointers - Definition – Initialization – Pointers arithmetic – Pointers and arrays-
Example Problems.
Module – 5
STRUCTURES AND UNIONS (9 Hours)
Introduction – Need for structure data type – structure definition – Structure declaration –
Structure within a structure - Union - Programs using structures and Unions – Storage classes,
Pre-processor directives.
TEXTBOOKS:
1. Pradip Dey, Manas Ghosh, “Fundamentals of Computing and Programming in C”, First
Edition, Oxford University Press, 2009
2. Ashok N. Kamthane, “Computer programming”, Pearson Education, 2007.
3. Yashavant P. Kanetkar. “ Let Us C”, BPB Publications, 2011.
REFERENCES:
1. Kernighan,B.W and Ritchie,D.M, “The C Programming language”, Second Edition, Pearson
Education, 2006
2. Byron S Gottfried, “Programming with C”, Schaum’s Outlines, Second Edition, Tata
McGraw-Hill, 2006.
3. R.G. Dromey, “How to Solve it by Computer”, Pearson Education, Fourth Reprint, 2007
Course Outcomes: At the end of the course, the student will be able to:
CO-1 Understand the components of computing systems, Develop algorithms for mathematical
and scientific problems
CO-2 Choose data types and structures to solve mathematical and scientific problem
CO-3 Develop modular programs using control structures
CO-4 Write programs to solve real world problems using programming features
Mathemati
cs-
II
Cal
cul
us,
Lapl
aceTransf
ormsandCompl exVar
iabl
es
(
Commont oall
)
Syll
abus(2018onwards)
SubjectCode:
18BS2MA01 Semest
er : 2
Hours/week:4 Tot
alHours:45+15
Credit
s :
4 L-
T-P :
3:1:
0
I
A :
30 SEE :
70
CourseLearningObject
ives(CLO)
Theobj ecti
veofthiscour
seistomakest udents
 Fami l
iari
zetheprospecti
veengineerswit
ht echniquesi
ncalcul
us,multi
var
iat
eint
egr
ati
on,
Laplacetransfor
msanddi ff
erent
iat
ionandintegrati
onofcomplexvar
iabl
e
 Toequi
pthestudentstodealwi
thadvancedl
evelofmat
hemat
icsandappl
i
cat
ionst
hat
woul
dbeessent
ialf
orthei
rdi
sci
pli
nes.
Module1:Mul
tiv
ariabl
eCal
cul
us(
Int
egr
ati
on)
: (
10
l
ect
ures+3Tut
ori
als)
Multi
pleInt
egr
ati
on:Doublei
ntegr
als,changeofor derofintegr
ati
on,Changeofv
ari
abl
es,Tr
ipl
e
i
ntegral
s,Appl
i
cati
ons:ar
easandvolumes, or
thogonalcur
vil
inearcoor
dinat
es
Module2:VectorI
ntegr
ati
on: (
8
l
ect
ures+3Tutori
als)
Lineint
egr
als,
sur
facei
ntegr
als,
vol
umei
ntegr
als,
Probl
emsonGr
een,
GaussandSt
okest
heor
em
(wit
houtpr
oof)
Module3:Laplacetransf
ormsandI
nver
seLapl
acet
ransf
orm: (
10
l
ect
ures+3Tutorial
s)
Defini
ti
on,Lapl
acetr
ansf
ormsofel
ementar
yfuncti
ons,pr
opert
iesofLaplacetr
ansf
orms(wit
hout
proof).
Laplacetr
ansformsofperi
odi
cfunct
ions(wi
thoutproof
),Heavisi
defuncti
onandDi r
ac’
sDelta
functi
on.
I
nver
se Lapl
ace t ransf
orms:Defini
ti
on,t
ransforms of standardf uncti
ons and proper
ti
es.
Conv
olut
ion theorem (wit
houtproof)and evaluati
on ofinverse Laplace tr
ansfor
ms using
Conv
olut
iontheorem.Solut
ionofor
dinar
ydi
ff
erential
equati
onsusingLaplacetransf
orms.
Module4:Compl
exVari
abl
e–Di
ff
erent
iat
ion: (
8
l
ect
ures+3Tut
ori
als)
Compl ex Dif
fer
ent
iat
ion,Cauchy-
Riemann equat
ions i
n Cartesi
an and Pol
arf or
m,anal
yti
c
funct
ions,harmoni
cfunct
ions,
const
ruct
ionofanal
yti
cfunct
ionsandthei
rpr
opert
ies.
Conf
ormalmappi
ngs ,Bi
l
inear
/Mobi
us t
ransf
ormat
ions and t
hei
r
pr
oper
ti
es.
Module5:Compl
exVari
abl
e–I
ntegr
ati
on: (
9
l
ect
ures+3Tut
ori
als)
Cont
ourint
egrals,Cauchytheorem (
wit
houtpr
oof
),CauchyI
ntegr
alf
ormul
a(wi
thoutpr
oof
),
Tayl
or’
sser
ies,
Laurent’
sser
ies.
Zer
osofanal
yti
cfunct
ions,
singul
ari
ti
es,
Resi
dues,
CauchyResi
duet
heor
em (
wit
houtpr
oof
),
Assi
gnment: Solut
ionofthesyst
em ofl
i
nearandnon-
li
neardi
ff
erent
ial
equat
ionsand
gr
aphi
cal
analysi
susingMATLAB
NOTE : Noquest
ionswi
l
lbeaskedf
rom sel
f-
studyandassi
gnmentsect
ioni
nthe
exam
TEXTBOOKS
1.B.
S.Gr
ewal
;Hi
gherEngi
neer
ingMat
hemat
ics,
KhannaPubl
i
sher
s,41stEdi
ti
on,
2011.
2.BVRamana;
HigherEngi
neer
ingMat
hemat
i 10thRepr
cs, intEdi
ti
on,
2010.
REFERENCES
1.DennisGZil
l&MichaelRCul
l
en;Adv
ancedEngi
neer
ingMat
hemat
ics,
SecondEdi
ti
on;Jones&
Barl
ettPubl
i
sher
s;2000.
2.Er
winKr
eysz
ig;
Adv
ancedEngi
neer
ingMat
hemat
i 9th Edi
cs, ti
on,
2012.
Cour
seOut
comes:
Att
heendoft
hecour
sest
udent
swi
l
lbeabl
etol
ear
n:
CO1 : Appl
ymul
ti
plei
ntegr
alst
ofi
ndar
ea,
sur
facear
eaandv
olume
CO2 : Ev
aluat
eli
ne,
sur
faceandv
olumei
ntegr
alsofv
ect
orf
iel
ds
CO3 : Appl
yLapl
aceTr
ansf
ormst
osol
veor
dinar
ydi
ff
erent
ial
equat
ions
CO4 : Under
standt
hedi
ff
erent
iat
ionandi
ntegr
ati
onofcompl
exv
aluedf
unct
ions.
ENGLISH
Course Outline
Subject Code:18HSS01 Total Hours: 45

Credits : 03 L: T: P - 2:0:1
Course Objectives
1) The student will acquire basic proficiency in English by improving their LSRW
(Listening, Speaking, Reading& Writing) skills.
Unit 1:Vocabulary
1.1 Acquaintance with prefixes and suffixes from foreign languages in English to form
derivatives.
1.2. Synonyms, antonyms, and standard abbreviations.
1.3. Phonetic transcriptions.
Unit 2: Basic Writing Skills

2.1 Sentence Structures
2.2 Use of phrases and clauses in sentences
2.3 Importance of proper punctuation
2.4 Creating coherence
2.5 Organizing principles of paragraphs in document
2.6 Techniques for writing precisely
Unit 3:
Identifying Common Errors in Writing
3.1 Subject-verb agreement
3.2 Noun-pronoun agreement
3.3 Misplaced modifiers
3.4 Articles
3.5 Prepositions
3.6 Redundancies
Unit 4: Listening Comprehension

4.1 Pre-listening
4.2Active listening
4.3 Note taking
4.4 Answering short answer questions
Unit 5: Reading comprehension & Oral Communication

5.1 Note making
5.2 Summarizing
5.3 Reading aloud
5.4 Pronunciation, Intonation, Stress and Rhythm
5.5 Common Everyday Situations: Conversations and Dialogues
5.6 Communication at Workplace
5.7 Interview
5.8 Formal Presentations
Reference Books:(i) Practical English Usage. Michael Swan. OUP. 1995.

(ii) Remedial English Grammar. F.T. Wood. Macmillan.2007
(iii)On Writing Well. William Zinsser. Harper Resource Book. 2001
(iv)Study Writing. Liz Hamp-Lyons and Ben Heasly. Cambridge University Press. 2006.
(v) Communication Skills. Sanjay Kumar and PushpLata. Oxford University Press. 2011.
(vi)Exercises in Spoken English. Parts. I-III. CIEFL, Hyderabad. Oxford University Press
PROGRAM OUTCOMES AND PROGRAM SPECIFIC OUTCOMES
Apply knowledge of mathematics, science and mechanical engineering
PO 1
fundamentals to solve complex problems.
Analyze, identify, formulate and solve complex industrial and engineering
PO 2
problems.
Design and develop solutions for complex mechanical engineering problems to
PO 3 meet specific needs satisfying cultural, societal, environmental, public health and
safety constraints.
Design and conduct experiments using modern computational concepts and tools
PO 4
to meet societal needs.
Create, select and apply modern techniques and tools to predict and model
PO 5
complex engineering processes.
Assess societal, health, safety, legal and cultural issues and the consequent
PO 6
responsibilities relevant to the mechanical engineering.
Understand the impact of engineering in environment and possess knowledge
PO 7
about need for sustainable development.
PO 8 Apply ethics in profession and commit to responsibilities.
Perform effectively as an individual, as a member or leader of a team to achieve a
PO 9
common goal.
Communicate effectively by designing, documenting, presenting and writing
PO 10
reports.
PO 11 Demonstrate, understand and manage projects in a multidisciplinary environment
Pursue higher studies and be involved in cutting edge research and engage in
PO 12
continuing professional development.
Graduate will be able to acquire core Mechanical Engineering knowledge and able
PSO 1 to solve industrial as well as societal problems with ethical and environmental
consciousness.
Graduate will be able to build the nation, by imparting technological concepts and
PSO 2
tools on emerging fields through the Managerial and entrepreneurs skills.
Knowledge level Attainment level Comments

0 3 High
1 2 Moderate
2 1 Low
3 0 Need to improve
At the end of the program the student will be able to:
Subject Code 18HSS01 Semester Knowledge

Subject Name ENGLISH Level
Course Outcome
CO1 Execute their writing skills with proper understanding of grammar and syntax L3
Implement their public speaking skills with correct pronunciation and

CO2 L3
practicing situational conversations
CO3 Define written comprehension
CO4 Acquire their listening comprehension skills by practicing active listening L3
Mapping of Program out come with course outcome based on Knowledge Level
Subject Code 18HSS01 Semester I

Subject Name ENGLISH
CO PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12
CO1 3 - 1 - - - - - 3 3 - -
CO2 3 - 2 - - - - 1 3 3 - -
CO3 3 - 3 - - - - 1 1 3 - -
CO4 3 - 2 - - - - - 3 3 - -
Course code: 18ESCEE02 Category: Engineering Science Course
Course title : Basic Electrical Engineering (Theory & Lab.)
Semester –I
[L : 3; T:1; P : 0 (4 credits)]
Detailed contents:
Module 1 : DC Circuits (10 hours)
Electrical circuit elements (R, L and C), voltage and current sources, Kirchhoff’s current and
voltage laws, analysis of simple circuits with dc excitation. Time-domain analysis of first-order
RL and RC circuits.
Module 2: AC Circuits (10 hours)
Representation of sinusoidal waveforms, peak and rms values, phasor representation, real power,
reactive power, apparent power, power factor. Analysis of single-phase ac circuits consisting of R,
L, C, RL, RC, RLC combinations (series and parallel), resonance. Three-phase balanced circuits,
voltage and current relations in star and delta connections.
Module 3: Transformers (9 hours)
Magnetic materials , BH characteristics, ideal and practical transformer, equivalent circuit, losses
in transformers, regulation and efficiency. Auto-transformer and three-phase transformer
connections. (Qualitative Approach)
Module 4: Electrical Machines (9 hours)
Generation of rotating magnetic fields, Construction and working of a three-phase induction

motor, Significance of torque-slip characteristic. Loss components and efficiency, starting and
speed control of induction motor. Single-phase induction motor. Construction, working, torque-
speed characteristics and speed control of separately excited dc motor. Construction and working
of synchronous generators. (Qualitative Approach)
Module 5: Electrical Installations (7 hours)
Components of LT Switchgear: Switch Fuse Unit (SFU), MCB, ELCB, MCCB, Types of Wires
and Cables, Earthing. Types of Batteries, Important Characteristics for Batteries. Elementary
calculations for energy consumption, power factor improvement and battery backup.
Suggested Text / Reference Books
(i) D. P. Kothari and I. J. Nagrath, “Basic Electrical Engineering”, Tata McGraw Hill,
2010.
(ii) D. C. Kulshreshtha, “Basic Electrical Engineering”, McGraw Hill, 2009.
(iii) L. S. Bobrow, “Fundamentals of Electrical Engineering”, Oxford University Press,
2011.
(iv) E. Hughes, “Electrical and Electronics Technology”, Pearson, 2010.
(v) V. D. Toro, “Electrical Engineering Fundamentals”, Prentice Hall India, 1989.
Course Outcomes
• To understand and analyze basic electric and magnetic circuits
• To study the working principles of transformers and rotating electrical machines
• To introduce the components of low voltage electrical installations

Subject Lesson Plan
Subject : 18ESCEE02 - BASICS OF ELECTRICAL ENGINEERING
Syllabus No. Of
Topic - Break Up
Unit Sessions
Module 01 DC Circuits 10
01 Electrical circuit elements (R, L and C circuits 2.00
02 voltage and current sources 1.00
03 Kirchhoff’s current law 1.00
05 Analysis of simple circuits with dc excitation 1.00
06 Time-domain analysis of first-order RL circuits 1.00
07 Time-domain analysis of first-order RC circuits 1.00
08 Tutorials 2.00
Module 02 AC Circuits 10
01 Introduction to AC circuits, Representation of sinusoidal waveforms 1.00
02 Average value, Peak value, Rms value and form factor 1.00
03 Phasor representation, real power, reactive power 1.00
04 Apparent power, power factor 1.00
05 Analysis of Ac series circuits 1.00
06 Analysis of Ac parallel circuits 1.00
07 Resonance in series and parallel circuits 1.00
08 Analysis of three phase balance circuits 1.00
09 voltage and current relations in star connection 1.00
10 voltage and current relations in delta connection 1.00
11 Tutorials 1.00
Module 03 Transformers 9
01 Magnetic materials used in transformers 1.00
Page 1 of 3 Printed on : 06/08/2018 10:21:17

Subject Lesson Plan
Syllabus No. Of
Topic - Break Up
Unit Sessions
02 Study of BH characteristics 1.00
03 Self and mutual inductance, Numerical problems 1.00
04 Concept and construction of Ideal and practical transformer 1.00
05 Equivalent circuit of a single phase transformer 1.00
Losses in transformers, Regulation and efficiency of a single phase

06 1.00
transformer
07 Auto-transformer 1.00
08 Three-phase transformer connections 1.00
09 Tutorials 1.00
Module 04 Electrical Machines 10
01 Introduction to Induction motors, Generation of rotating magnetic fields 1.00
02 Construction and working of a three-phase induction motor 1.00
03 Significance of torque-slip characteristic 1.00
04 Loss components and efficiency 1.00
05 Starting of three phase induction motors 1.00
06 Speed control of 3 phase induction motor 1.00
07 Single-phase induction motor. Construction, working 1.00
08 Torque-speed characteristics 1.00
09 Speed control of separately excited dc motor 1.00
10 Construction and working of synchronous generators 1.00
Module 05 Electrical Installations 7
01 Types of switches, two way and three way connections 1.00
02 Components of LT Switchgear 1.00

Subject Lesson Plan
Syllabus No. Of
Topic - Break Up
Unit Sessions
03 Switch Fuse Unit (SFU), MCB, ELCB,MCCB 1.00
04 Types of Wires and Cables, Earthing 1.00
05 Types of Batteries, Important Characteristics for Batteries 1.00
06 Elementary calculations for energy consumption 1.00
07 Power factor improvement and battery backup 1.00

Sociology & Elements of Indian History
SYLLABUS (2018 onwards)

Hours/week: 3:1:0 Total Hours: 45
Credits: 3
Course Code: 18HSSC02
Course Learning Objectives (CLO)
The students will able to:

● Understand the nature of society and the social structure they live in
and be able to analyze social changes happening around them.
● Assess individuals’ role as an engineer in the society and play as a key
actor of social change.
● Engage with contemporary social issues and able to make an informed
opinions about them.
● Understand various historical stages and important processes India as
a society has undergonepractical oriented skills.
UNIT-I: Introduction to History (9 hrs)

Introduction to History:, History Sources – Archaeology, Epigraphy, Numismatics & Archival
Research, Methods used in History – History & Historiography, Indian History & per iodization,
Evolution of Urbanization process, Ancient Indian culture, Modern Indian Culture, Status of
women in Ancient India.
UNIT-II: Introduction to Sociology (9 hrs)

Introduction to Sociology – Organizations, Institutions, Culture, Social Stratification (Caste,
Class, Gender & Power) Sociology as a Science, Social Development, Different Social System,
Relation between human being and society, Status & Role, Norms and Values, Impact of
Science and Technology on Society.
UNIT-III: Feudalism and Colonialism (9hrs)
Feudalism and Colonialism, Entry of British in India, British Expansion and consolidation,
Significant events, personalities and issues during the Indian freedom Struggle., Issues and
Concerns in post-colonial India, reorganization in the country, Economic development and
political change after independence, Industrialization after Independence.
UNIT-IV: Social Problems in India (9hrs)
Social Problems in India, Social Change and Development, Rural development, Social Groups &
Processes, types of Groups- Primary& Secondary, Formal-Informal, In group – Out group
Industrial Revolution, Impact (Positive and Negative) of Industrial revolution on Urban Society
UNIT-V: Sociological Perspectives (9hrs)
Sociological Perspectives of Karl Marx, Max Weber, Emile Durkheim, Social Mobility, types of
mobility, sources and causes of mobility, Education and social change, Impact of Religion on
Society.
Reference books:
1. Ahuja, Ram (2001): Indian Social System,New Delhi: Rawat Publication. Ahuja, Ram
(2003):
2. Society in India, New Delhi: Rawat Publication. Bottomore, T.B. (1972)
3. Sociology: A Guide to Problems and Literature, Bombay: George Allen and Unwin
(India).
4. Fulcher& Scott (2003: Sociology, New York: Anthony (2005):
5. Sociology, Polity Press. Desai, A.R. (2005),
6. Social Background of Indian Nationalism,
7. India After Gandhi, Pan Macmillan Thapur, Romila (2002),
8. Early Penguin Sharma R.S. (1965),
9. Indian Feudalism, Macmillan
Course Outcomes:
At the end of the course the student should be able to:
• Understand the fundamental concepts of Sociology and History

• Apply the concepts of sociology in engineering domain
• Identify and analyze the theoretical concepts and reflect on them in
contemporary social life
Data Structures using C Lab
Subject Code : 18CSI301L

Credits : 01 L-T-P:0-0-2
List of Experiments:
1. Demonstrating Pointers Usage

a) Printing Memory Addresses: Write C program to demonstrate the use of
pointers by printing memory address 2.
b) Writing a Swap Function: Write a C program to swap two numbers using
pointers concept
c) Allocating and Freeing Memory: Write a C program to demonstrate the use of
allocating a memory and freeing
d) Memory Leaks and Other Problems: Write a C program to demonstrate the
memory leaks when pointers are not used properly.
2. Demonstrate Strings, User defined data types and Files in C

a) Reading and Writing Strings: Write a C program to demonstrate the input and
output operations on strings
b) String operations / Manipulations: Write a C program to demonstrate the
operations on strings – by writing user defined string functions.
c) Enumerations, Structures and Union: Write a C program to demonstrate
Enumerations, Structures and Union data types. Write a program for following
using recursive methods.
d) File operations: Write a C program to demonstrate the input and output
operations on files
3. Demonstrate the technique of recursion in C

a) Recursion – Write recursive function for i) Sum of natural numbers ii) Factorial
of a given number iii) Fibonacci sequence
4. Stack ADT Implement Stack using Arrays
5. Queue ADT Implement Queue using Arrays
6. Singly Linked List Write a C Program to perform following operations on Singly

Linked List ADT: i. Create ii. Insert iii. Delete iv. Display
7. Doubly Linked List Write a C Program to perform following operations on Doubly

8. Circular Linked List Write a C Program to perform following operations on Circular
9. Implement Stack using List
10. Implement Queue using List
11. Implement Binary Search Tree – using List
12. i)Implement a simple heap ii) Implement Priority Queue using heap
Digital Electronics
Subject Code : 18CS3SP03 Total Contact Hours: 45

Credits : 03 L-T-P:3-0-0
Prerequisite: Knowledge on basics of Electrical&Electronics is strongly recommended.
Course Objectives:
 Students understand the concepts and terminology of digital electronics.

 The course will introduce the student with fundamental concept of digital techniques
 To acquire the basic knowledge of digital logic levels and application of knowledge to
understand digital electronics circuits.
 To prepare students to perform the analysis and design of various digital circuits
 To develop skill to build, and troubleshoot digital circuits.
Unit: I
(9 Hours)
Binary Codes and Boolean algebra
Signals: Analog and Digital, Binary Number System. Addition, Subtraction, Multiplication,
Division of binary numbers, Subtraction using 2’s complement method. Binary codes:
weighted and non-weighted codes, self-complementary
Codes, BCD, Excesses-3, Gray codes, Alphanumeric codes, ASCII Codes.

Boolean algebra: Boolean Laws and Expression using Logic Gates, Realization of different
gates using Universal gates,De- Morgan’s Theorem, Duality Theorems.
Unit: II
(9 Hours)
Boolean Function minimization Techniques
Standard forms: SOP, POS, Simplification of Switching function & representation
(Maxterm&Minterm), Boolean expression & representation using logic gates, Propagation
delay in logic gate. Karnaugh map: K-map, mapping and minimization of SOP and POS
expression, Don’t care condition, conversion from SOP to POS and POS to SOP form using
K-map, Minimization of multiple output circuits,
Unit III:
(9 Hours)
Combinational Circuits Design
Adder & Subtractor(Half and Full), Parallel Binary adder, BCD Adder, Binary multipliers,
Code Converters, parity bit generator, Comparators, Decoder, BCD to 7-segment Decoder,
Encoders, Priority Encoders, Multiplexers, De- Multiplexers.
Unit IV:
(9 Hours)
Sequential Circuits Elements
Introductionto Sequential Circuit, Flip-flop and Latch: SR latch, JK flip-flop, Master Slave
JK Flip-flop, T flip-flop, D flip-flop and latch, Master-slave RS flip-flop, Master-slave JK
flip-flop, asynchronous inputs.
Unit V:
(9 Hours)
Shift Registers and Counters
Shift registers: buffer register, controlled buffer register. Data transmission in shift resistor
SISO, SIPO, PISO, PIPO, Bidirectional shift register, universal shift registers. Counter:
Classification, Ripple or asynchronous counter, Effect of propagation delay in ripple
counters, up-down counter, Design of Mod-n counter, synchronous counter, Ring counter,
Johnson counter.
Course Outcomes:
At the end of the course, students will be able:
 Understand number systems and its arithmetic operations and Illustrate Use of
Boolean algebra.
 Formulate and apply Karnaugh Map to reduce Boolean expressions and logic
circuits to their simplest forms.
 To understand the working of combinational and sequential circuits with
characteristic equation and truth table.
 Design of combinational and sequential circuits to interface logic families and
remembering concept of memory technology.
Text Books:
1. “R.P. Jain, “Modern digital Electronics”, Tata McGraw Hill, 4th edition, 2009.
2. Douglas Perry, “VHDL”, Tata McGraw Hill, 4th edition, 2002.
3. W.H. Gothmann, “Digital Electronics- An introduction to theory and practice”, PHI,
2nd edition, 2006. 2012.
References Books:
1. D.V. Hall, “Digital Circuits and Systems”, Tata McGraw Hill, 1989
2. Charles Roth, “Digital System Design using VHDL”, Tata McGraw Hill 2nd edition
Data Structures using C
Subject Code : 18CSI301 Total Contact Hours: 45

Credits: 03 L-T-P: 3-0-0
Prerequisite: Knowledge on Basic Programming using C and Problem Solving Skills.
Course Objectives:
 Explain fundamentals of data structures and their applications essential for

programming/problem solving
 Analyze Linear Data Structures: Stack, Queues, Lists
 Analyze Non-Linear Data Structures: Trees, Graphs
 Analyze and Evaluate the sorting & searching algorithms
 Assess appropriate data structure during program development/Problem Solving
Unit I: (9 Hours)
Introduction: Data Structures, Classifications (Primitive &Non Primitive), Data structure
Operations, Review of Arrays, Structures, Self-Referential Structures, and Unions. Pointers
and Dynamic Memory Allocation Functions: Representation of Linear Arrays in Memory,
Dynamically allocated arrays, Multidimensional Arrays, Polynomials and Sparse Matrices.
Strings: Basic Terminology, Storing, Operations and Pattern Matching algorithms. Sorting
and Searching: Insertion Sort, Radix sort, Address Calculation Sort, C Programming
Examples.
Unit II: (10 hours)

Stacks and Queues Stacks: Definition, Stack Operations, Array Representation of Stacks,
Stacks using Dynamic Arrays, Stack Applications: Polish notation, Infix to postfix
conversion, evaluation of postfix expression, Recursion - Factorial, GCD, Fibonacci
Sequence, Tower of Hanoi, Ackerman's function. Queues: Definition, Array Representation,
Queue Operations, Circular Queues, Circular queues using Dynamic arrays, Dequeues,
Priority Queues, A Mazing Problem. C Programming.
Unit III: (10 hours)

Linked Lists: Definition, Representation of linked lists in Memory, Memory allocation;
Garbage Collection. Linked list operations: Traversing, Searching, Insertion, and Deletion.
Doubly Linked lists, Circular linked lists, and header linked lists. Linked Stacks and Queues.
Applications of Linked lists – Polynomials, Sparse matrix representation.Hashing: Hash
Table organizations, Hashing Functions, Static and Dynamic Hashing. C Programming.
Unit IV: (8 hours)

Trees: Terminology, Binary Trees, Properties of Binary trees, Array and linked
Representation of Binary Trees, Binary Tree Traversals - Inorder, postorder, preorder;
Additional Binary tree operations. Threaded binary trees, Binary Search Trees – Definition,
Insertion, Deletion, Traversal, Searching, Application of Trees-Evaluation of Expression, C
Programming.
Unit V: (8 hours)
Graphs: Definitions, Terminologies, Types of Graphs, Matrix and Adjacency List
Representation Of Graphs, Elementary Graph operations. Minimal Spanning Tree: Prim’s
algorithm, Kruskal’s Algorithm.Traversal methods: Breadth First Search and Depth First
Search. Applications of Graph. Files and Their Organization: Data Hierarchy, File
Attributes, Text Files and Binary Files, Basic File Operations, File Organizations and
Indexing.
Course Outcomes:
At the end of the course, students will be able to:
 Acquire knowledge of
- Various types of data structures, operations and algorithms.
- Sorting and searching operations.
- File structures.
 Analyze the performance of – Stack, Queue, Lists, Trees, Graphs, Searching and
Sorting techniques.
 Implement all the applications of Data structures in a high-level language.
 Design and apply appropriate data structures for solving computing problems.
Text Books:
1. Weiss, Data Structures and Algorithm Analysis in C, IV Edition, Pearson Education,
2014
2. Lipschutz: Schaum’s outline series Data structures Tata McGraw-Hill
Reference Books:
1. Kamthane: Introduction to Data Structures in C. Pearson Education 2005.
2. Hanumanthappa M., Practical approach to Data Structures, Laxmi Publications, Fire
Wall media 2006
3. Langsam, AusensteinMaoshe & M. Tanenbaum Aaron Data Structures using C and
C++ Pearson Education.
4. Robert Kruse Data Structures and program designing using ‘C’, Trembley and
Sorenson Data Structures
Economics for Engineers

Credits: 3
Course Code: 18HSS03
The students will able:
● To demonstrate the knowledge of the fundamental and technical concepts of economics.
 To identify and use economics terminologies in oral and written communications.

 To make decisions wisely using cost-benefit analysis.
 To demonstrate a sense of responsibility and a capacity for service.
 To recognize when change is appropriate, to adapt to change as it occurs, and to take the lead in
creating change as the country’s economic environment changes.
UNIT – I : Basic Principles and Methodology of Economics:(10hrs)
Nature and Scope of Economics- Basic Economic Problems: Scarcity and choices, Resource allocation,
Marginal analysis, Production possibility curve, Externalities, Welfare Economics. Basics of
microeconomics - Demand and Supply Analysis, equilibrium, elasticity; Markets – Perfect competition,
Monopoly, Monopolistic, Oligopoly, Basics of macroeconomics - the circular flow models, National
income analysis (GDP/GNP/NI/Disposable Income, Green GDP), and inflation trade cycles.
UNIT-II: Public Sector Economics (7hrs)
Public economics, Role of Public and private sectors in economic development, Public Expenditure and
Public Debt, Monetary and Fiscal Policy Tools & their impact on the economy
UNIT-III:Monetary Economics. (7hrs)

Components of Monetary and Financial System, Capital and Debt Markets, Central Bank, Commercial
Banks & their functions, Price Indices (WPI/CPI), Direct and Indirect Taxes. Budget,
UNIT-IV: Elements of Business and forms of organizations (10hrs)
Theory of the Firm: production and production function -Cost & Cost Control Techniques
- Types of Costs, opportunity costs, Budgets, Break even Analysis, Capital Budgeting,
Application of Linear Programming, Investment Analysis – NPV, ROI, IRR, Payback
Period, Depreciation, Time value of money. Business Forecasting – Elementary
techniques. Statements – Cash flow, Financial. Case Study Method
UNIT-V: (a) Indian economy: Brief overview of post-independence period (11hrs)
5 year plans. Industrial policy in India; Recent trends in Indian industrial growth; MNCs and transfer of
technology; Liberalization and privatization; Regional industrial growth in India; Post reform Growth,
Structure of productive activity.
(b) Employment, Migration and Urbanization
Migration and Urbanization,Labour Market and Employment–Informal, Organized, Unorganized, Public,
Private.
Reference books:
1. Mankiw Gregory N.(2002), Principles of Economics, Thompson Asia

2. V. Mote, S. Paul, G. Gupta(2004), Managerial Economics, Tata McGraw Hill
3. Misra, S.K. and Puri (2009), Indian Economy, Himalaya
4. PareekSaroj (2003), Textbook of Business Economics, Sunrise Publishers
5. Ahluwalia, I.J. (1985), Industrial Growth in India, Oxford University Press, New Delhi
Course Outcomes:
1. To identify and explain economic concepts and theories related to the behavior of economic agents,
markets, industry and firm structures, legal institutions, social norms, and government policies.
2. To demonstrate an awareness of the role in the global economics environment.

3. To integrate theoretical knowledge with quantitative and qualitative evidence in order to
explain past economic events and to formulate predictions on future ones.
4. To evaluate the consequences of economic activities and institutions for individual and social
welfare.
5. To apply the basic theories of economics in critical thinking and problem solving.
ENERGY STUDIES
COURSE OUTLINE
Subject Code: 18MCC02 Total Hours: 45

Credits: Hours per week: 03
Prerequisite:
Knowledge of energy and different energy sources
Course Objective:
 To understand global and national energy scenario.
 To understand energy policies of different countries.
 To learn knowledge of energy conservation, energy management and energy
audit.
 To know operating principles of energy generation technologies and their
importance to meet energy demand.
Unit - 1 8 hours
Introduction to Energy Sources
General introduction, energy consumption as a measure of prosperity, world energy
futures, energy sources and their availability, renewable energy sources – Solar, Wind,
Geothermal, Ocean Thermal Energy Conversion, Biomass, economic aspects of
renewable energy sources, future prospects of renewable energy sources.
Unit - 2 10 hours
Global Energy Scenario
Role of energy in economic development and social transformation, Overall energy
demand, availability and consumption, Depletion of energy sources and its impact on
economy, Utilization pattern in the past, present and also future prediction, Sector wise
energy consumption.
Unit - 3 8 hours
Energy Policy
Energy policy issues at global level, national level and state level, Energy conservation
act 2001, Electricity act 2003, Energy pricing and its impact on global variations.
International energy policies of G-8, G-20, OPEC and European union countries.
Unit - 4 12 hours
Energy Conservation & Storage
Introduction, principles of energy conservation, energy conservation planning, energy
conservation in residential and commercial sector, energy conservation measures in
some of the major enterprises, maintenance and energy conservation, Energy storage
systems- Mechanical energy storage i) Pumped hydroelectric storage ii) compressed air
iii) Flywheel- Electric storage: Lead acid battery; super capacitor
Unit - 5 7 hours
Energy Management & Audit
Objectives of energy management, need and scope of energy audit, methodology, types
of energy audit, material and energy balance, energy auditing instruments, maintenance
and audit
Course Outcomes:
CO1: Students will have knowledge of energy scenario and its importance of the society.
CO2: Students can understand and suggest few energy management and energy
conservation techniques in daily life.
CO3: Students will aware of energy policies.
CO4: Students can get the enraging technologies importance in today’s energy scenario.
TEXT BOOKS:
1. Jose Goldenberg, Thomas Johanson and Reddy, A.K.N., Energy for Sustainable Worls,
Wiley Eastern, 2005.
2. Charles E. Brown, World Energy Resources, Springer Publication, New York, 2002.
3. Culp, A.W., Principles of Energy Conversion, McGraw Hill New York, 2004.
4. Energy Conservation and Audit- Suresh kumar soni and Manoj Nair, Satya prakashan
Tech India publications, second edition, 2012
REFERENCE Books:
1. Non-Conventional Energy Sources- G D rai, Khanna publications, fifth edition, 2011.
Scheme of Continuous Internal Evaluation (CIE):-

CIE consists of three tests each for a maximum of 45 marks. The performance of two
best out of three tests is considered and is scaled for a maximum of 20 marks, 5 marks
will be given based on class attendance and 5 marks will be given based on MCQ. Total
internal marks will be 30 marks.
Scheme of Semester End Examination (SEE):-
The question paper consists of one question from unit 1 and one question from unit 2 , Unit 3,
4 and 5 will be given with two questions of internal choice each for a maximum of 14 marks
with two to three sub divisions. The students are required to answer five full questions (1 & 2
Compulsory, 3, 4,5 internal choice).
MATHEMATICS FOR COMPUTER
Course Name
SCIENCE
Subject Code 18BS3CS02
No of Credits 04
L-T-P 3-1-0
Total No of Modules 05
Total Contact Hours 60

Module I:Fundamentals
Sets and subsets
Operations on sets
Sequences.
Logic: Propositions and Logical Operations
Conditional statements
Methods of proof
Mathematical Induction.
 Pigeonhole Principle
 Recurrence relations
 Relations and Digraphs
 Product sets and partitions,
Module II:
 Paths in relations and digraphs
 Properties of relations
 Equivalence relations Counting
 Operations on relations: transitive closure
and Warshall’s algorithm.
 Partially ordered sets, lattices,
 Derangements
 Rook polynomials
Module III: Graph Theory-I
Definitions and Examples
Sub graphs, Complements, and Graph Isomorphism,
Vertex Degree
Euler Trails and Circuits,
Hamilton Paths and Cycles
Graph Colouring and Chromatic Polynomials
Bipartite graphs
Planar graphs
Euler’s formula
Trees and their basic properties
Optimization and Matching
 Correlation-Karl Pearson’s
 Co-efficient of correlation-
problems
 Regression analysis - lines of
Module IV: regression–problem.
Statistical
 Curve fitting by the method of
least squares- fitting the curves of
the form [𝑦 = 𝑎𝑥 + 𝑏,𝑦 = 𝑎𝑥 2 +
methods 𝑏𝑥 + 𝑐 and 𝑦 = 𝑎𝑒 𝑏𝑥 ].
 Basic concepts of probability
and  Axiomatic and frequency
Probability
definition of probability
 Addition and multiplication law
of probability,
 Conditional probability
 Baye’s Theorem (without proofs).
Module V: Random Variables
Random variables, types of random variables
Probability function and cumulative distribution function,
Discrete probability distributions (Binomial and Poisson)
Continuous probability distributions (Exponential and Normal).
Concept of Joint Probability-Joint probability distribution
Discrete and Independent random variables
Expectation
Covariance
Correlation coefficient.
Text Books:
1. Discrete and Combinatorial Mathematics, Ralph P Grimaldi, 5th
Edition. Pearson Education.
2. Fundamentals of Mathematical Statistics by Kapoor &Gupta:Sultan
Chand and Sons.
Reference Books:
1. Discrete Mathematical Structures, Kolman, Busby &Ross : 5th

Edition, 2006.
2. Discrete Mathematics for Computer Science, Gary Haggard &
John SchlipfCengage, Thomson 2006.
3. Higher Engineering Mathematics, B.V.Ramana, 26th Reprint
Edition McGraw Hill Education (India) Private Limited, 2016
Course Outcomes
Solve logical reasoning to verify the correctness of the logical
Solve statements and Perform set operations to describe the
languages.
Apply the concepts of relations, partially ordered sets and

Apply lattices in relational data bases and data structures.
Analyze the concepts of graphs to understand Mathematical

Analyze structures and techniques in computer applications.
Understand Understand and apply the foundations of probabilistic and

statistical analysis mostly used in various applications in
and apply engineering and computer sciences.
Apply the concept of random variables, Distributions and its

Apply properties to analyze the statistical data.
Object Oriented Programming Using Java
1. Demonstrate Constructor Overloading and Method Overloading in JAVA.
2. Implement Inner Classes and demonstrate its access protection.
3. Implement the following:
i) An abstract class "Shape" with the following properties: an instance variable
shapeName of type String, an abstract method area (), a toString() method
that returns the name of the shape.
ii) Create a subclass named "Sphere" which has radius and its area given by the
formula 4*PI*r^2.
iii) Create a subclass named "Rectangle" which has length and width and its
area is length times width.
iv) Create a subclass named "Triangle" which has base and height and its area
is ½*base*height.
v) Create another class which displays the calculated area.
4. Perform the following operations:
i) Check the length and capacity of String and StringBuffer objects
ii) Reverse the contents of a string given on console and convert the resultant
string in Upper Case.
iii) Input a string from the console and append it to above resultant string.
iv) Extract the substring from resultant string.
5. Create the following:
i) A class "Account" with minimum balance 1000rs, deposit() method to
deposit amount, withdraw() method to withdraw amount and also throws
LessBalanceException if an account holder tries to withdraw money which
makes the balance less than 1000rs.
ii) A class "LessBalanceException" which returns the statement that says
"withdraw amount ( __ rs) is not valid".
iii) A class which creates 2 accounts through which both deposit and withdraw
operations are performed. Appropriate action has to be taken for
LessBalanceException.
6. Implement Linear Queue using user defined exception handling (also use 'throw' and
‘throws’ keyword)
7. Implement the concept of Producer Consumer using synchronized threads.
8. Create the following:
i) Create an Interface for ‘Stack’ operations.
ii) A class that implements the Stack interface and create a fixed length stack.
iii) A class that implements the Stack interface and create a dynamic length
stack.
iv) A class that uses the above stacks through interface reference and does the
stack operations that demonstrates the runtime binding
9. Develop the following:
i) Create a package named "Calculator".
ii) Create some classes in the package representing some common operations
like addition, subtraction, multiplication and division.
iii) Import and compile these classes in other program.
10. Create an enumeration DayofWeek with seven values SUNDAY through
SATURDAY. Add a method isWorkday() to the DayofWeek class that returns true if
the value on which it is called is MONDAY through FRIDAY.
11. Using File I/O streams, write a program to demonstrate file operations.
12. Write a Swing Application which uses:
i) JTabbed Pane
ii) Each Tab should use JPanel, which includes any one component given
below in each Panel
i. ComboBox / List / Tree / Radiobutton
Object Oriented Programming using JAVA
Subject Code : Total Contact Hours: 45

Credits : 03 L-T-P: 3-0-0
Prerequisite: Knowledge on problem solving skills and programming constructs.
Course Objectives:
 This course aims at imparting expertise in development of Object Oriented Concepts

using JAVA JDK.
 As part of the course, students will implement GUI applications using JAVA swings
and create custom packages and interfaces.
Unit I: (9 hours)
Introduction to Object Oriented Programming: Basic components of Object Oriented
programming: Classes, Objects, Abstraction, Inheritance, Polymorphism, Encapsulation,
Advantages of Object oriented programming over Procedural oriented programming.
Getting started with JAVA: Evolution and Features of Java, First Java program, Edit-
Compile-Run cycle, Java environment, Keywords, Identifiers, Literals, Data types, Operators,
Type Casting.
Program Control Statements: Selection statements: if, switch; Iteration statements: for,
while, do-while; Jump statements: break, continue, and return.
Arrays: Declaration, Creation and Initialization: One-dimensional arrays, Multidimensional
Arrays and Variable length arrays, processing arrays.
Unit II : (9 hours)
Defining your own classes, Objects and Methods: Class Fundamentals, How Objects are
Created, Reference Variables and Assignment, Methods, Returning from a Method, Returning
Value, Using Parameters, Constructors, Parameterized Constructors, new operator,
Overloading Methods and Constructors, controlling access to class members, Call-By-Value
and Call-By-Reference, Returning Objects, Recursion, static keyword, Introducing Nested and
Inner Classes, Garbage Collection and Finalizers, this Keyword.
Inheritance, Polymorphism, Abstraction: Inheritance Basics, Member Access and
Inheritance, Constructors and Inheritance, Using super to Call Superclass constructors, Using
super to Access Superclass Members, Creating a Multilevel Hierarchy, When are Constructors
Executed, Superclass References and Subclass Objects, Method Overriding, Overridden
Methods support polymorphism, why Overridden Methods, Using Abstract Classes, Using
final, The Object Class.
Unit III: (9 hours)

String Handling: Mutable and Immutable Strings, String class, String Constructors,
Operations on strings, StringBuffer class, StringBuffer constructors, Operations on
StringBuffer, Programming examples.
Exception Handling: The Exception Hierarchy, Exception Handling Fundamentals, The
Consequences of an Uncaught Exception, using Multiple catch clauses, Catching subclass
Exceptions, try blocks can be nested, Throwing an Exception, using finally, using throws
clause.
Unit IV: (9 hours)

Interfaces: Interface Fundamentals, Creating an Interface, Implementing an Interface, Using
Interface References, Implementing Multiple Interfaces, Constants in Interfaces, Interfaces can
be extended, Nested Interfaces.
Packages: Package Fundamentals, Packages and Member Access, Importing Packages, Static
Import.
Multithreaded Programming: Multithreading fundamentals, Creating threads using Thread
Class and Runnable Interface, Creating Multiple Threads, Determining When a Thread Ends,
Thread Priorities, Synchronization, using Synchronization Methods, The Synchronized
Statement, Thread Communication using notify(), wait() and notify All(), suspending,
Resuming and stopping Threads.
Unit V: (9 hours)
Enumerations, Auto boxing and Annotations: Enumerations, Java Enumeration are class
types, The Values () and Value of () Methods, Constructors, methods, instance variables and
enumerations, Auto boxing, Annotations (metadata)
Generics: Generics Fundamentals Bounded Types, Generic Methods, Generic Constructors,
And Some Generic Restrictions.
Streams: I/O streams, Stream Classes: Byte streams, Character streams, using stream I/O,
serialization.
Swing Fundamentals: The origin and design philosophy of swing, components and
containers, layout managers, simple swing Example, event handling, exploring Swing
Controls.
Course Outcomes:
 Implement Object Oriented Programming concepts.
 Design a GUI using Java programs and Applets.
 Develop Multithreaded Applications.
 Creating Custom Packages and Interfaces.
Text Books:
1. JAVA fundamentals, a comprehensive introduction by Herbert Schildt, Dale

Skrien. Tata McGraw Hill Edition.
2. Object Oriented Programming and Java by Danny Poo, Derek Kiong, Swarnalatha
Ashok, Springer
Reference Books:
1. O’Reilly Head First JAVA, 2nd Edition by Kathy Sierra and Bert Bates.
2. Core and Advanced JAVA, Black Book, DreamTech Press
3. JAVA 6 programming, Black Book, KoGenT, Dreamtech
Business Communication and Presentation Skills
Subject Code : 18HSS04 Total Contact Hours : 45

Credits : 03 L-T-P : 3-0-0
Prerequisite: Knowledge on basics of Soft skills
Course Objectives:
 Apply appropriate communication skills across settings, purposes, and audiences.

 Demonstrate knowledge of communication theory and application.
 Practice critical thinking to develop innovative and well-founded perspectives related to the
students' emphases.
 Build and maintain healthy and effective relationships.
 Use technology to communicate effectively in various settings and contexts.
 Demonstrate appropriate and professional ethical behaviour
Part A
Unit I: (9 hours)
Principles of Effective written communication
7 C’s of Business communication: Clarity, Completeness, Conciseness, Consideration, Courtesy,
Correctness, and Concreteness and Practice sessions for business writing
Technology enabled Business communication
Telephone & Voice mail, Fax, Voice conference & Video Conference
Unit II: (7 hours)

Letter writing
Nature & functions of Letter, Structure & Planning, and Types of Letter: Leave letter, Claim letter,
Sales letter, Cover Letter, Application Letter.
Persuasive Writing: AIDA
Unit III (11 hours)

Email & Memo writing
Importance of Email & Memo writing in the business world, Format of Email & Memo, Structure of
Email & Memo,
Precise Writing & Report Writing
What is precise Writing? Techniques of Precise writing, Qualities of a good precise.
Different types of Report – sales report, Annual report, Technical report, Components of a good
report. How to write a short report.
Unit IV (9 hours)
Resume writing
Components of a good resume, different formats of resume, Individual Summary Writing.
Conducting Effective Meetings
Different Types of meetings: Business meetings, Review meetings, Preparation for the meeting –
Writing Agenda, Venue & other arrangements, MOM
Unit V (9 hours)
Presentation Skills
Planning & developing effective Presentation, Do’s & don’ts of a good presentation, use of Effective
visual aids in a presentation.
Course Outcomes
At the end of the course, Students will be able to:
1. Overcome common obstacles in public speaking.

2. Demonstrate critical and innovative thinking.
3. Display complete in oral, written and visualization.
4. Understand the importance of research in developing your topic.
5. Use resources to gather information effectively.
Text Books:
1. Matthukutty M Monippally, Business Communication Strategies, Tata McGraw-Hill.
2. Chaturvedi P.D. et al, Business Communication; Concepts, Cases, & Applications, Pearson
Education.
Reference Books:
1. Lesiicar and Flatley, Basic Business Communication, Tata McGraw-Hill.

2. Courtan L. Bovee et al., Business Communication Today, Pearson Education.
3. Meenakshi Raman & Prakash Singh, Business communication, Oxford University Press.
4. R. C Sharma & Krishna Mohan, Business correspondence & Report writing, McGraw Hill India.
5. Shirley Taylor, Communication for Business, Pearson Education.
Computer Organization and Architecture
Subject Code : 18CS4SP06 Total Contact Hours : 45

Credits : 03 L-T-P : 3-0-0
Prerequisite: Fundamentals of Computer, Digital Electronics
Course Objectives:
 To conceptualize the basics of organizational and architectural issues of a digital computer.

 To analyze performance issues in processor and memory design of a digital computer.
 To understand various data transfer techniques in digital computer.
 To analyze processor performance improvement using instruction level parallelism
Unit I: (6 Hours)
Basic Structure of Computers
Computer Types, Functional units, Basic operational concepts, Bus Structures, Software,
Performance, Multiprocessors and multi computers, Data Representation- Fixed Point
Representation, Floating – Point Representation,
Unit II: (11 Hours)

Register Transfer and Operations
Register Transfer language, Register Transfer, Bus and memory transfers, Arithmetic ,logic, shift
operations, Arithmetic logic shift unit, Instruction codes, Computer Registers, Computer instructions,
Instruction cycle. Memory instruction, Reference Instructions - Input – Output and Interrupt,
STACK organization, Instruction formats, Addressing modes, DATA Transfer and manipulation,
Program control, Reduced Instruction Set Computer.
Unit III: (11 Hours)

Micro Programmed Control
Control memory, Address sequencing, microprogram example, design of control unit, hard wired
control, Microprogrammed control, Addition and subtraction, multiplication Algorithms, Division
Algorithms, Floating – point Arithmetic operations, Decimal Arithmetic operations.
Unit IV: (11 Hours)

Memory & I/O Organizations
Basic concepts, semiconductor RAM memories, Read-only memories, Cache memories,
considerations, Virtual memories, secondary storage
Peripheral Devices, Input-Output Interface, Asynchronous data transfer Modes of Transfer, Priority
Interrupt, Direct memory Access, Input –Output Processor (IOP), Serial communication,
Introduction to peripheral component, Introduction to standard serial communication protocols like
RS232
Unit V: (6 Hours)
Case Study
1. Wombat 1 CPU and JVM using CPUSim.
*CPUSim is a freeware tool for simulation of Computer system
2. Pentium 4- Instruction cycle, Pipelining, Memory System
3. Athlon – General Architecture, Generations, Instruction set (3DNow), CPU Cache
There can be THREE Case studies. Two on commercial processors and one on
understanding/designing simple machine using simulation tool.
Course Outcomes:
 Understand basic structure of computer and instruction sets.
 Perform computer arithmetic operations.
 Write control signals for any operations.
 Understand the concept of cache mapping techniques
 Conceptualize the I/O and organization and its registers.
Text Books:
1. Computer Organization – Carl Hamacher, Zvonks Vranesic, SafeaZaky, Vth Edition,

McGraw Hill.
2. Computer Systems Architecture – M.Moris Mano, IIIrd Edition, Pearson/PHI.
Reference Books:
1. Computer Organization and Architecture – William Stallings Sixth Edition, Pearson/PHI
2. Structured Computer Organization – Andrew S. Tanenbaum, 4th Edition, PHI/Pearson.
3. Fundamentals of Computer Organization and Design, -Sivaraama Dandamudi, Springer

Int. Edition.
4. Computer Architecture a quantitative approach, John L.Hennessy and David A. Patterson,

Fourth Edition, Elsevier
Design and Analysis of Algorithms
Subject Code : 18CSI401 Total Contact Hours : 45

Credits : 03 L-T-P : 3-0-0
Prerequisite:
1. Problem Solving Skills
2. Data Structures
3. Formal Languages and Automata Theory
Course Objectives:
1. Reinforce basic design concepts (e.g., pseudocode, specifications, top-down design)
2. Familiarity with an assortment of important algorithms
3. Understand and analyze efficient algorithms for various applications.
4. Synthesize efficient algorithms in common engineering design situations.
UNIT: 1 Introduction to Algorithms and Elementary Data Structures 10Hrs
What is an Algorithm? Algorithm Specification, Performance Analysis: Space complexity, Time

complexity. Asymptotic Notations: Big-Oh notation (O), Omega notation (Ω), Theta notation (Θ).
Introduction to Randomized algorithms. Stacks and queues, trees, Dictionaries: Binary search tree,
AVL tree, Cost amortization. Priority queue, sets and disjoint set union, graphs
UNIT : 2 Basic Traversal, Search Techniques and Divide and Conquer 09Hrs
Techniques for binary trees, techniques for graphs: breadth first search and traversal, depth first
search and traversal, connected components and spanning trees, biconnected components and DFS.
General method of divide and conquer, Binary search, Finding the maximum and minimum, Merge
sort, Quick sort Strassen’s matrix multiplication. Advantages and Disadvantages of divide and
conquer.
UNIT : 3 Greedy Method 08Hrs
General method, Knapsack Problem, Job sequencing with deadlines, minimum cost spanning trees:
Prim's Algorithm, Kruskal's Algorithm. single source shortest paths.
UNIT : 4 Dynamic Programming 09Hrs
General method, Multistage Graphs, Single source shortest paths: Dijkstra's Algorithm, All Pairs
Shortest Paths: Floyd's Algorithm, Optimal Binary Search Trees, Knapsack problem, Bellman-Ford
Algorithm, Travelling Sales Person problem.
UNIT : 5 Backtracking, Branch and Bound 09Hrs

General method of backtracking, N-Queens problem, Sum of subsets problem, Graph coloring,
Hamiltonian cycles, Knapsack problem.
General method of Branch and Bound, 0/1 Knapsack problem: LC Branch and Bound solution, FIFO
Branch and Bound solution, Travelling Sales Person problem, NP-Hard and NP-Complete problems:
Basic concepts.
Text Books:
1. Fundamentals of computer Algorithms, Ellis Horowitz, SatrajSahni and Rajasekaran, 2nd

Edition, 2014, Universities Press
2. Introduction to the Design and Analysis of Algorithms, Anany Levitin: 2nd Edition, 2009.
Pearson.
Reference Books:
1. Introduction to Algorithms, Thomas H. Cormen, Charles E. Leiserson, Ronal L. Rivest,

Clifford Stein, 3rd Edition, PHI
2. Design and Analysis of Algorithms, S. Sridhar, Oxford (Higher Education)
Course Outcomes
1. Analyze the asymptotic performance of algorithms
2. Explain the basics of various mathematical concept of searching and traversing techniques.
3. Understand how the choice of data structures and the algorithm design methods impact the
performance of programs
4. Apply the Concept of Dynamic programming method to solve the real-world problems.
5. Apply important algorithmic design paradigms and methods of analysis
6. Devise an algorithm using appropriate design strategies for problem solving
PROGRAMME: B. Tech (Honors) Computer Science (Software Engineering)
SEMESTER – V
Teaching-Learning & Evaluation Plan
Course Information:
Course Code: 18CSI401L Course Title: Design and Analysis of Algorithms Lab
Credits Units: 02 Contact Hours: 30 L-T-P: 0-0-4
CA: UE Weightage - 100:00 Pass Marks (CA & UE) - 40 Aggregate Pass Marks:40%
UE Question Paper Marks: NA Special Examination Fees: NA Pre-requisite (if any): NA
Course Facilitator (s): Prof. Narasimhayya B E
Programme Outcomes (POs) and Programme Specific Outcomes (PSOs)
At the end of the programme, students will be able to
PO 1 Apply the knowledge of mathematics, science, engineering fundamentals, and an engineering

specialization to the solution of complex engineering problems.
PO 2 Identify, formulate, review research literature, and analyze complex engineering problems
reaching substantiated conclusions using first principles of mathematics, natural sciences, and
engineering sciences.
PO 3 Design solutions for complex engineering problems and design system components or
processes that meet the specified needs with appropriate consideration for the public health
and safety, and the cultural, societal, and environmental considerations.
PO 4 Use research-based knowledge and research methods including design of experiments,
analysis and interpretation of data, and synthesis of the information to provide valid
conclusions.
PO 5 Create, select, and apply appropriate techniques, resources, and modern engineering and IT
tools including prediction and modeling to complex engineering activities with an
understanding of the limitations.
PO 6 Apply reasoning informed by the contextual knowledge to assess societal, health, safety, legal
and cultural issues and the consequent responsibilities relevant to the professional
engineering practice.
PO 7 Understand the impact of the professional engineering solutions in societal and environmental
contexts, and demonstrate the knowledge of, and need for sustainable development.
PO 8 Apply ethical principles and commit to professional ethics and responsibilities and norms of
the engineering practice.
PO 9 Function effectively as an individual, and as a member or leader in diverse teams, and in
multidisciplinary settings.
PO 10 Communicate effectively on complex engineering activities with the engineering community
and with society at large, such as, being able to comprehend and write effective reports and
design documentation, make effective presentations, and give and receive clear instructions.
PO11 Demonstrate knowledge and understanding of the engineering and management principles
and apply these to one’s own work, as a member and leader in a team, to manage projects
and in multidisciplinary environments.
PO12 Recognize the need for, and have the preparation and ability to engage in independent and
life-long learning in the broadest context of technological change.
PSO 01 Ability to analyze the requirements, design, develop software programs. Also evaluate and
recognize potential risks and provide creative solutions.
PSO 02 Ability to apply their skills in the field of agile software development, Project management,
Quality and cost management, DevOps, cultivating skills through higher studies and
entrepreneurship.
Course Objectives:
The objective of this course is to
 To introduce students to web technologies such as HTML, CSS, XML, PHP teach them to create
static and simple dynamic web pages or applications using these technologies
 Understand web application deployment and software architectures.
 Students will learn basic web application design, development and testing skills.
 On completion of this course the learner should be able to design and implement a variety of basic
web applications.
Course Outcomes:
At the end of the course, students will be able to
Sl. Course Description Bloom’s Taxonomy

No. Outcome Level
1. CO 1 Demonstrate a web page design using basic HTML tags. Applying(3)
2. CO2 Illustrate the use of table, form and frame tags. Applying (3)
3. CO 3 Use CSS for beautiful representation of HTML data. Applying(3)
4. CO 4 Employ JavaScript to make responsive web pages. Applying (3)
5. CO 5 Demonstrate local storage using JavaScript Object. Applying(3)
6. CO 6 Illustrate the use of XML, CSS and JS Applying(3)
CO-PO/PSO Mapping:
PO 1 PO 2 PO 3 PO 4 PO 5 PO 6 PO 7 PO 8 PO 9 PO10 PO11 PO12 PSO 1 PSO2

CO 1 3 2 2 1 1 1 1 2 3
CO 2 3 3 2 2 2 1 1 2 3
CO 3 3 3 3 2 3 1 1 2 3
CO 4 3 3 3 2 3 1 1 2 3
CO 5 3 3 3 2 3 1 1 2 3
CO 6 3 3 3 2 3 1 1 2 3
TOATL 18 17 16 11 15 6 6 12 18
List of Experiments Hours

1. Design a simple web page with head, body and footer, with heading tags,
image tag
2. Design a web site for book information, home page should contain books list,
when particular book is clicked, information of the books should display in the
next page.
3. Design a page to display the product information such as name, brand, price
and etc with table tag.
4. Design a web site for book information using frames, home page should
contain two parts, left part should contain books list, and right part should
contain book information.
5. Design a web page to capture the user information such as name, gender,
mobile number, mail id, city, state, and country using form elements.
6. Design a web page with nice formatting like background image, text colors
LABS and border for text using external CSS. 30
7. Design a web page to perform mathematical calculations such as addition,
subtraction, multiplication, and division using form elements and Java Script.
8. Design a web page to capture the user information such as name, gender,
mobile number, mail id, city, state, and country using form elements and
display them into other pages using Java Script.
9. Design a web page to display timer in the left side of the web page using
Java Script.
10. Design a web page to capture the student details such as student number,
name, age, marks using Java Script Object.
11. Design a web page to read data from an XML file and display the data in
tabular format, take the data as employee information.
12. Design a web site for online purchase using CSS, JS and XML, web site
should contain the following web pages.
Session-Wise Plan:
Module Session Experiment Readings and Pedagogy/ CO Mode of

References Activity Planned Delivery
1–3 Design a simple Hands-on 01 Briefing,
LABS web page with Session : demo of the
head, body and experiment
footer, with Understanding
heading tags, how to use HTML
image tag tags in web page
4– 5 Design a web site design.
for book
information, home
page should
contain books list,
when particular
book is clicked,
information of the
books should
display in the next
page.
6– 8 Design a page to 02 Briefing,

display the product Hands-on demo,
information such as Session : experiment
name, brand, price
1. Fundamentals of
and etc with table Using tables,
computer Algorithms
tag. frames and forms
by Ellis Horowitz,
for web page
9 – 11 Design a web site SatrajSahni andnd designing.
for book Rajasekaran, 2
information using Edition, 2008,
frames, home page University Press.
should contain two
parts, left part 2. Introduction to the
should contain Design and Analysis
books list, and right of Algorithms, byrd
part should contain Anany Levitin, 3
book information. Edition, 2012,
Pearson Education.
12–14 Design a web page
to capture the user
information such as
name, gender,
mobile number,
mail id, city, state,
and country using
form elements.
15-17 Design a web page Hands-on 03 Briefing,

with nice formatting Session : demo,
like background experiment
image, text colors Presenting HTML
and border for text data in meaningful
using external manner using
CSS. CSS
CA1
18-20 Design a web page Hands-on 04
to perform Session :
mathematical Understanding the
calculations such usage of
as addition, JavaScript in
subtraction, making responsive
multiplication, and web pages
division using form
elements and Java
Script.
21-22 Design a web page Briefing,
to capture the user demo,
information such as experiment
name, gender,
mobile number,
mail id, city, state,
and country using
form elements and
display them into
other pages using
Java Script.
23-24 Design a web page 1. Practical Web Briefing,

to display timer in Design for demo,
the left side of the Absolute experiment
web page using Beginners,
Java Script. Adrian W.
West. Apress
25-26 Design a web page 2016 Hands-on 05 Briefing,
to capture the 2. Introducing Session : demo,
student details Web experiment
such as student Development, Working with
number, name, Jorg Krause. JavaScript Object.
age, marks using Apress 2017.
Java Script Object. 3. HTML & CSS:
The Complete
27-28 Design a web page Reference, Hands-on 06 Briefing,
to read data from Thomas Session : demo,
an XML file and Powell. experiment
display the data in McGraw Hill,
tabular format, take Fifth Edition, Usage of XML,
the data as 2010 CSS and JS
employee 4. Creating a
information. Website: The
Missing
Manual, 3rd
Edition,
29-30 Design a web site 06 Briefing,
Mathew
for online purchase demo,
Macdonald.
using CSS, JS and experiment
O’Reilly
XML, web site
5. Web
should contain the
Technologies -
following web
HTML,
pages.
JavaScript,
Home page PHP, Java,
JSP,
Login page ASP.NET,
XML and Ajax
Signup page Black, Kogen
Learning
Product details Systems
page (Dreamtech
Press), 5th
Edition 2009.
CA – II
Assessment Scheme: CA: UE - 100:0
Sl. Assessment Formative/ Frequency Weightage CO

No. Instrument Summative (%)
1. Continuous Assessment Formative Continuous 70 CO1 to CO6
2. Semester End Test Summative 1 30 CO1 to CO6
Total 100
Database Management Systems

Credits : 03 L-T-P : 3-0-0
Prerequisite: Knowledge on basics of Computers, Programming Languages, Storage Concepts
Course Objectives:
 Master the basics of SQL and construct queries using SQL

 Be familiar with a commercial relational database system (Oracle) by writing SQL using the
system
 Be familiar with the relational database theory, and be able to write relational algebra expressions
for queries.
 Master sound design principles for logical design of databases, including the E‐R method and
normalization approach
Unit I: (7 Hours)
Database System Concepts and Architecture
Introduction of Database, DBMS, Characteristics of database approach, Advantages of DBMS,
Data models, schemas, Three schema architecture - The external level, the conceptual level and The
internal level. Data Independence, Database languages and Interfaces, Roles of Database
Administrator,
Unit II: (10 Hours)

Data Models
Introduction to Data Models (Hierarchical, Network and Relation), Client/Server Architecture,
Introduction to Distributed Database, Classification of DBMS.
ER Modeling and Introduction to RDBMS
Entity type, Entity sets, Attributes and keys. The ER Model, ER Diagram & Database design with
the ER Model, Introduction, Relational Model -Concepts, Characteristics.
Unit III: (8 Hours)

Relational Operations and Normalization
Relational operations (Insert, delete, update, select, project, rename, union, intersection, minus, Join,
division), Transactions and ER mapping (Examples). Normalization of RDBMS (1NF, 2NF, 3NF
and 4NF) and inference rules.
Unit IV: (11 Hours)

SQL
Introduction to Unit. DBMS v/s RDBMS, Introduction to SQL, Data types, Constraints, Commands
in SQL (Create table, Drop command, Alter command), queries in SQL, Statements in SQL (Insert,
delete and update), Features of SQL, Manipulation of data, Tables in SQL
Approaches to database programming, with function calls, Embedded SQL using CURSORs,
Dynamic SQL, SQL commands in Java, Retrieving multiple triples using Iterators
Unit V : (9 Hours)
PL/SQL
Advantages of PL/SQL and features of PL/SQL - blocks structure, error handling, input and output
designing, variables and constant, data abstraction, control structures and subprogram Fundamentals
of PL/SQL - character sets, lexical, delimiters, identifiers, declarations, scope and visibility, Static
and dynamic and static SQL, Implicit and explicit locking.
Course Outcomes:
 Write queries using SQL.

 Use commercial relational database system (Oracle).
 Write relational algebra expressions for queries.
 Design logical databases using the normalization approach
Text Books:
1. S. Sudarshan, Henry F. Korth, Abraham Silberschatz, Database System Concepts, Edition 6,

McGraw Hill Publications, 2010
2. Ivan Bayross, “SQL, PL/SQL”, Bpb Publications” .
3. Elmasri and Navathe, “Fundamentals of Database Systems, Seventh Edition, 2016, Pearson.
Reference Books:
1. Steven Feuerstein, “PL/SQL”,bestpractisesBpb Publications”

2. Liebschuty, “The Oracle Cook Book”, BPB Publication
3. Michael Abbey, Michael J.Corey, “Oracle A Beginners Guide”. TMH Publication
4. Kevin Loney, “Oracle Complete Reference”, Bpb Publications”.
Principles of Operating Systems

Credits : 02 L-T-P : 2-0-0
Prerequisite: Knowledge on basics of ICT
Course Objectives:
 To understand the concepts of Design techniques, process management, and processor
scheduling;
 To learn the resource management problems and solutions using deadlocks, memory
management, secondary memory management, file management;
 To gain the knowledge of I/O systems, and protection in Unix systems.
 Gain knowledge of basic UNIX/Linux commands from the command line (from a terminal
window);
 Organize and manage their files within the UNIX file system
Unit I: (7 Hours)
Operating System Concepts: Operating System Classification- Simple Monitor, Multi

Programming, Time Sharing, Real Time Systems, Multiprocessor Systems, Batch Processing,
Simple User, Multi User, Operating System Functions and Characteristics.
Process Management: Process Overview, Process States, Process State Transitions, Process Control
Block, Operations on Processes, Suspend and Resume, Interrupt Processing, Scheduling Algorithms,
Multiple Processor Scheduling.
Unit II: (7 Hours)
Deadlock: Deadlock Problem, Deadlock, Deadlock Characterization, Necessary Conditions,

Deadlock Prevention, Deadlock Avoidance, Deadlock Detection, Recovery from Deadlock.
Memory Management: Partition, Paging, Segmentation, Types Of Memory Management Scheme,
Bare Machine, Resident Monitor, Swapping, Multiple Partition, Virtual Memory, Demand Paging.
Unit III: (6 Hours)

File Management: File Types, Operation On Files, File Support, Access Methods, Sequential
Access, Direct Access, Index, Allocation Method (Free Space Management, Contiguous, Linked,
Indexed), Directory System Single-Level, Two-Level, Tree-Structured, File Protection.
Unit IV: (4 Hours)

Vi Editor: Introduction to Text Processing, Command & edit Mode, Invoking vi, deleting &
inserting Line, Deleting & Replacing Character, Searching for Strings, Yanking, Running Shell
Command Macros, Set Window, Set Auto Indent, Set No. Communicating with Other Users: who,
mail, wall, send, mesg.
.
Unit V: (6 Hours)
Shell programming-I: Introduction – Need for Scripts – Creating and Calling the Script – The
Shebang – Different ways of running a script - Using variables in Script – Reading Input – Integer
Variables – Arithmetic Expressions – Read-only variables –
Exporting variables – Arrays - Control Statements : If, Then, Else, While and Until, Classic For,
Break and Continue, Case – Handling Script Parameters : Shift, Getopts – Shell Functions –
Handling Conditional expression patterns and Regular expressions in scripts.
Course Outcomes:
1. Master the features of the operating system functions, structures, and design issues
associated with operating systems.
2. Handle the various process management issues including scheduling, synchronization,
deadlocks and multithreading.
3. Apply the concepts of memory management including virtual memory; resource sharing
among the users; and Process scheduling techniques to solve the real world problems.
4. Solve the problems related to file system interface and implementation, disk management
and protect the system.
5. Use UNIX tools using features such as filters, pipes, redirection, and regular expressions
Customize their UNIX working environment
Text Books:
1. James L. Peterson And Abraham Silberschatz, “Operating System Concepts”, Addison
Wesley Publishing Company.
2. H.M.Deitel, “Operating Systems”, Addison Wesley Publishing Company.
Reference Books:
1. M.G. Venkatesh Murthy: UNIX & Shell Programming, Pearson Education.
2. Richard Blum , Christine Bresnahan : Linux Command Line and Shell Scripting Bible, 2
ndEdition , Wiley,2014.
3. A. Silberschatz, P.B. Galvin and G. Gagne, “Operating System Concepts, (6th or Newer
Edition) Wiley.
Principles of Operating Systems Lab
Subject Code : 18CS4SP05L Total Contact Hours : 15
Credits : 01 L-T-P : 0-0-2
List of Programs:
1. Execute 15 basic commands of UNIX.
2. Basics of functionality and modes of VI Editor.

3. Write a program that accepts user name and reports if user is logged in.
4. Write a program which displays the following menu and executes the option selected by user:
1. ls 2. pwd 3. ls –l 4. ps –fe
5. Write a program to print 10 9 8 7 6 5 4 3 2 1 .
6. Write a program that replaces all “*.txt” file names with “*.txt.old” in the current.
7. Write a program that echoes itself to stdout, but backwards.
8. Write a program that takes a filename as input and checks if it is executable, if not make it
executable.
9. Write a program to take string as command line argument and reverse it.
10. 1. Create a data file called employee in the format given below:
a. EmpCode Character
b. EmpName Character
c. Grade Character
d. Years of experience Numeric
e. Basic Pay Numeric
$vi employee
A001 ARJUN E1 01 12000.00
A006 Anand E1 01 12450.00
A010 Rajesh E2 03 14500.00
A002 Mohan E2 02 13000.00
A005 John E2 01 14500.00
A009 Denial Smith E2 04 17500.00
A004 Williams E1 01 12000.00
Perform the following functions on the file:
a. Sort the file on EmpCode.
b.Sort the file on
(i) Decreasing order of basic pay
(ii) Increasing order of years of experience.
c. Display the number of employees whose details are included in the file.
d. Display all records with ‘smith’ a part of employee name.
e. Display all records with EmpName starting with ‘B’.
f. Display the records on Employees whose grade is E2 and have work experience of 2 to 5 years.
g. Store in ‘file 1’ the names of all employees whose basic pay is between 10000 and 15000.
h. Display records of all employees who are not in grade E2

Software Engineering
Subject Code : 18CS4SE01 Total Contact Hours : 45

Credits : 03 L-T-P : 3-0-0
Prerequisite: Knowledge of Basic Computers
Course Objectives:
 Be successful professionals in the field with solid fundamental knowledge of software

engineering
 Utilize and exhibit strong communication and interpersonal skills, as well as
professional and ethical principles when functioning as members and leaders of multi-
disciplinary teams
 Apply their foundations in software engineering to adapt to readily changing
environments using the appropriate theory, principles and processes.
Unit I: (8 Hours)
Software Product and Process
Introduction – S/W Engineering Paradigm – Verification – Validation – Life Cycle Models –
System Engineering – Computer Based System – Business Process Engineering, Overview –
Product Engineering Overview.
Unit II: (10 Hours)

Software Requirements
Functional and Non-Functional – Software Document – Requirement Engineering Process –
Feasibility Studies – Software Prototyping – Prototyping in the Software Process – Data –
Functional and Behavioral Models – Structured Analysis and Data Dictionary.
Unit III: (9 Hours)
Analysis, Design Concepts and Principles
Systems Engineering - Analysis Concepts - Design Process And Concepts – Modular Design
– Design Heuristic – Architectural Design – Data Design – User Interface Design – Real
Time Software Design – System Design – Real Time Executives – Data Acquisition System
– Monitoring And Control System.
Unit IV: (9 Hours)

Testing
Taxonomy of Software Testing – Types Of S/W Test – Black Box Testing – Testing
Boundary Conditions – Structural Testing – Test Coverage Criteria Based On Data Flow
Mechanisms – Regression Testing – Unit Testing – Integration Testing – Validation Testing
– System Testing And Debugging – Software Implementation Techniques
Unit V : (9 Hours)
Software Project Management
Measures And Measurements – ZIPF’s Law – Software Cost Estimation – Function Point
Models – COCOMO Model – Delphi Method – Scheduling – Earned Value Analysis – Error
Tracking – Software Configuration Management – Program Evolution Dynamics – Software
Maintenance – Project Planning – Project Scheduling– Risk Management – CASE Tools
Course Outcomes:
 Apply the software engineering lifecycle models by demonstrating competence in

communication, planning, analysis, design, construction, and deployment of software
 An ability to work in one or more significant application domains
 Work as an individual and as part of a multidisciplinary team to develop and deliver
quality software
 Demonstrate an understanding of and apply current theories, models, and techniques
that provide a basis for the software lifecycle
 Demonstrate an ability to use the techniques and tools necessary for engineering
practice
Text Books:
1. Ian Sommerville, “Software engineering”, Seventh Edition, Pearson Education Asia,
2007
2. Roger S. Pressman, “Software Engineering – A practitioner’s Approach”, Sixth
Edition, McGraw-Hill International Edition, 2005
Reference Books:
1. Steve McConnell, “Code Complete”, 2nd Edition, Microsoft Press, 2004
2. IEEE Standards on Software Engineering.
3. Ghezzi, Software Engineering, PHI
SOFT COMPUTING (18DS8DE61)
ELECTIVE GROUP : IV CREDITS: 03

SEMESTER : 07 L:T:P – 3:0:0
IA/UE : 30/70 CONTACT HRS/WEEK :
03
Course Objectives:
1. To explain soft computing based solutions for real-world and engineering problems.
2. To demonstrate soft computing based solutions for real-world and engineering problems.
3. To illustrate fuzzy systems, fuzzy logic and its applications for real world problems.
Course Outcomes:
CO1 Recognize the extensions from intelligent systems to soft computing through knowledge
representation.
CO2 Illustrate fuzzy concepts, fuzzification, defuzzification and Fuzzy Inference Systems for
real life problems.
CO3 Simplify the working of various types of Neural Networks and applications
CO4 Demonstrate the biological and nature inspired evolutionary algorithms
CO5 Examine the implementation of neuro, fuzzy and genetic concepts using open sourced
tools.
CO6 Discriminate different bio-inspired techniques such as swarm intelligence, ant-colony
optimization, etc.
CO-PO MAPPING
Course Outcomes – Program Outcome Mapping ( H/M/L : 3/2/1)

PO1. PO2. PO3. PO4. PO5. PO6. PO7. PO8. PO9. PO10.PO11.PO12.PSO1.PSO2.
CO1. 2 2 2 1 1 1 1 2 2 2
CO2. 2 2 2 2 1 1 2 2 2 2
CO3. 2 2 2 1 1 1 2 2 2 1
CO4. 2 2 2 3 1 1 2 2 3 3
CO5. 3 2 3 3 1 1 2 2 3 3
CO6. 3 3 3 3 2 1 2 2 3 3
UNIT – I [9 HOURS]
Introduction - What is soft computing? Differences between soft computing and hard computing, Soft
Computing constituents, Methods in soft computing, Applications of Soft Computing. Introduction to
Genetic Algorithms- Introduction to Genetic Algorithms (GA), Representation, Operators in GA, Fitness
function, population, building block hypothesis and schema theorem; Genetic algorithms operators-
methods of selection, crossover and mutation, simple GA(SGA), other types of GA, generation gap, steady
state GA, Applications of GA.
UNIT – II [9 HOURS]
Neural Networks- Concept, biological neural system, Evolution of neural network, McCulloch-Pitts neuron
model, activation functions, feedforward networks, feedback networks, learning rules – Hebbian, Delta,
Perceptron learning and Windrow-Hoff, winner-take-all.
UNIT – III [9 HOURS]

Supervised learning- Perceptron learning, single l layer/multilayer perceptron, linear separability, hidden
layers, back propagation algorithm, Radial Basis Function network; Unsupervised learning - Kohonen,
SOM, Counter-propagation, ART, Reinforcement learning, adaptive resonance architecture, applications
of neural networks to pattern recognition systems such as character recognition, face recognition,
application of neural networks in image processing.
UNIT- IV [9 HOURS]
Fuzzy systems - Basic definition and terminology, set-theoretic operations, Fuzzy Sets, Operations on
Fuzzy Sets, Fuzzy Relations, Membership Functions, Fuzzy Rules & Fuzzy Reasoning, Fuzzy Inference
Systems, Fuzzy Expert Systems, Fuzzy Decision Making; Neuro-fuzzy modeling- Adaptive Neuro-Fuzzy
Inference Systems, Coactive Neuro-Fuzzy Modeling, Classification and Regression Trees, Data Clustering
Algorithms, Rule-base Structure Identification and Neuro-Fuzzy Control , Applications of neuro-fuzzy
modeling.
UNIT- V [9 HOURS]
Swarm Intelligence- What is swarm intelligence? Various animal behavior which have been used as
examples, ant colony optimization, swarm intelligence in bees, flocks of birds, shoals of fish, ant-based
routing, particle swarm optimization.
TEXT BOOKS
1. S N. Sivanandam, S. N. Deepa, “Principles of Soft Computing”, Second Edition, Wiley India(2011).
2. James A. Freeman and David M. Skapura, “Neural Networks Algorithms, Applications, and
Programming Techniques”, Pearson Edn., 2003.
REFERENCES
1. J.S.R.Jang, C.T. Sun and E.Mizutani, “Neuro-Fuzzy and Soft Computing”, PHI / Pearson Education,
(2015).
2. Laurene Fausett, “Fundamentals of Neural Networks”, Pearson, (2004).
3. Timothy J Ross “Fuzzy Logic with Engineering Applications”, 3rd Edition, Wiley, (2010).
4. Bart Kosko, “Neural Networks and Fuzzy Systems”, PHI, (2004).
5. Randy l.Haupt, “Practical Genetic Algorithms”, Wiley Interscience (2004).

POLLUTION CONTROL AND MANAGEMENT
Course code: 18MTOE09 Total Contact Hours : 45
Credits:03 Hours per week : 03
Prerequisite : Nil
Course Learning Objectives:
After learning the course the students should be able to:
1. To impart students with knowledge cause, effect and remedies of pollution.
2. To train the students on developing practical, efficient and cost effective solutions
on problems and challenges on environmental sciences and engineering.
3. To inculcate among students sensitivity towards social and corporate
responsibilities.
UNIT – I 7 hours
WATER POLLUTION AND CONTROL
Industrial scenario in India– Industrial activity and Environment - Uses of Water by

industry – Sources and types of industrial wastewater – Nature and Origin of
Pollutants - Industrial wastewater and environmental impacts – Regulatory
requirements for treatment of industrial wastewater - Industrial wastewater
monitoring and sampling
UNIT – II 10 hours
INDUSTRIAL WASTEWATER TREATMENT
Quality requirements for Wastewater reuse, Flow and Load Equalization – Solids
Separation – Removal of Fats, Oil and Grease- Neutralization – Removal of Inorganic
Constituents – Precipitation, Heavy metal removal, Nitrogen and Phosphorous
removal, Ion exchange, Adsorption, Membrane Filtration, Electrodialysis and
Evaporation – Removal of Organic Constituents – Biological treatment Processes -
Chemical Oxidation Processes - Advanced Oxidation processes
UNIT – III 10 hours

AIR POLLUTION AND CONTROL
Introduction – Type of Air Pollution – Source of Air Pollution – Effect of Air Pollution –
Control of Air Pollution – Cause, Effect and Control of Global Warming and Green
House Effect – Acid Rain and its Effect – Remedies of Acid Rain – Ozone Layer and
Its Depletion – Cause, Effect and Solutions for Ozone layer Depletion
UNIT–IV 9 hours
PREVENTIVE ENVIRONMENTAL MANAGEMENT
Pollution control Vs Pollution Prevention - Opportunities and Barriers – Cleaner

production and Clean technology, Waste management Hierarchy - Source reduction
techniques – Periodic Waste Minimization Assessments – Evaluation of Pollution
Prevention Options – Cost benefit analysis – Pay-back period – Implementing and
Promoting Pollution Prevention Programs in Industries.
CASE STUDIES: waste treatment flow sheet for Textiles – Tanneries – Pulp and
paper – metal finishing – Oil Refining – Pharmaceuticals – Sugar and Distilleries.
UNIT–V 9 hours
ENVIRONMENTAL MANAGEMENT SYSTEM
EMAS, ISO 14000 - EMS as per ISO 14001– benefits and barriers of EMS – Concept
of continual improvement and pollution prevention - environmental policy–
environmental aspect and impact analysis – environmental management programs –
structure and responsibility – training awareness and competence- documentation
and document control – operational control – monitoring and measurement. Audit -
Roles and qualifications of auditors - Environmental performance indicators and their
evaluation - compliance audits – waste audits and waste minimization planning –
Due diligence audit.
Course Outcomes:
On completion of the course the student will be able to
CO1 Develop environmental scientists and engineers and sensitize
them towards environmental issues.
CO2 Design suitable technologies for the treatment of wastewater.

CO3 Employ suitable air pollution prevention options for various
gaseous and particulate pollutants to Industries
CO4 Organize pollution prevention assessment team and implement
waste minimization options
CO5 Develop, Implement, maintain and Audit Environmental
Management systems for Organisations
CO6 Select appropriate pollution control options for various industries
Text Book
T1 Industrial wastewater management, treatment & disposal, Water Environment Federation
Alexandria Virginia, Third Edition, 2008.
T2 Lawrance K.Wang, Yung . Tse Hung, Howard H.Lo and Constantine Yapijakis, “ handlook
of Industrial and Hazardous waste Treatment”, Second Edition, 2004.
T3 Nelson Leonard Nemerow, “Industrial waste Treatment - contemporary practice and vision
for the future”, Elsevier, Singapore, 2007.
Reference Book
R1 Christopher Sheldon and Mark Yoxon, “Installing Environmental management Systems – a
step by step guide” Earthscan Publications Ltd, London, 1999.
R2 ISO 14001/14004: Environmental management systems – Requirements and Guidelines –
International Organisation for Standardisation, 2004
R3 ISO 19011: 2002, “Guidelines for quality and/or Environmental Management System auditing,
Bureau of Indian Standards, New Delhi, 2002.
PROGRAMME: B.Tech (AUTOMOBILE ENGINEERING)
SEMESTER – V
Teaching-Learning & Evaluation Plan
Course Information:
Course Code: 18AUDE752 Course Title: Automotive safety

Credits Units: 03 Contact Hours: 45 L-T-P: 3-0-0
CA: UE Weightage - 30:70 Pass Marks (CA & UE) - 0 & 40% Aggregate Pass Marks:40%
UE Question Paper Marks: 70 Special Examination Fees: NA Pre-requisite (if any):
Course Facilitator (s): Vinod G M
Programme Outcomes (POs) and Programme Specific Outcomes (PSOs)
At the end of the programme, students will be able to
PO 1 Apply the knowledge of mathematics, science, engineering fundamentals, and an engineering

specialization to the solution of complex engineering problems.
PO 2 Identify, formulate, review research literature, and analyze complex engineering problems
reaching substantiated conclusions using first principles of mathematics, natural sciences, and
engineering sciences.
PO 3 Design solutions for complex engineering problems and design system components or processes
that meet the specified needs with appropriate consideration for the public health and safety, and
the cultural, societal, and environmental considerations.
PO 4 Use research-based knowledge and research methods including design of experiments, analysis
and interpretation of data, and synthesis of the information to provide valid conclusions.
PO 5 Create, select, and apply appropriate techniques, resources, and modern engineering and IT
tools including prediction and modeling to complex engineering activities with an understanding
of the limitations.
PO 6 Apply reasoning informed by the contextual knowledge to assess societal, health, safety, legal
and cultural issues and the consequent responsibilities relevant to the professional engineering
practice.
PO 7 Understand the impact of the professional engineering solutions in societal and environmental
contexts, and demonstrate the knowledge of, and need for sustainable development.
PO 8 Apply ethical principles and commit to professional ethics and responsibilities and norms of the
engineering practice.
PO 9 Function effectively as an individual, and as a member or leader in diverse teams, and in
multidisciplinary settings.
PO 10 Communicate effectively on complex engineering activities with the engineering community and
with society at large, such as, being able to comprehend and write effective reports and design
documentation, make effective presentations, and give and receive clear instructions.
PO11 Demonstrate knowledge and understanding of the engineering and management principles and
apply these to one’s own work, as a member and leader in a team, to manage projects and in
multidisciplinary environments.
PO12 Recognize the need for, and have the preparation and ability to engage inindependent and life-
long learning in the broadest context of technological change.
PSO 01 Apply knowledge of design, thermal, materials and manufacturing to solve complex problems in
automobile engineering and allied areas.
PSO 02 Create and implement new ideas on product/process design and development with the help of
modern CAD/CAM/CAE tools while ensuring best engineering practices.
Course Objectives:
• At the end, the students will have good exposure to automotive safety aspects including the
understanding of the various safety equipment’s.
Course Outcomes:
At the end of the course, students will be able to
Sl. Course Description Bloom’s Taxonomy

No. Outcome Level
Understand the various systems that enhances vehicle safety, passenger Understanding (2)
1. CO 1 comfort, recent technologies in
automobile field etc.,
2. CO 2 Identity the various types of safety systems and its concepts Applying (3)
3. CO 3 Evaluate the safety equipment’s and its functions Evaluate (5)
4. CO 4 Prediction of collision warning and its avoidance. Analyzing (4)
5. CO 5 Design the automotive body for safety and comfort Create (6)
Knowledge on comfort and convenience systems in automotive Apply (3)
6. CO 6
vehicle
CO-PO/PSO Mapping:
PO PO PO PO PO PO PO PO PO PO PO PO PSO PSO
01 02 03 04 05 06 07 08 09 10 11 12 1 2
CO01 3 2 2 1 - - - - - - - - 2 -
CO02 3 1 1 - - - - - - - - - 3 2
CO03 3 2 1 1 - - - - - - - - 3 -
CO04 3 2 1 - - - - - - - - - 2 2
CO05 3 3 3 - - - - - - - - - 2 3
CO06 3 1 1 - - - - - - - - - 2 -
Total 18 11 9 2 - - - - - - - - 14 7
Course Contents:
Module Details Contact

Hours
I INTRODUCTION 09
Design of the body for safety, energy equation, engine location, deceleration of
vehicle inside passenger compartment, deceleration on impact with stationary and
movable obstacle, concept of crumble zone, safety sandwich construction.
II SAFETY CONCEPTS 09
Active safety: driving safety, conditional safety, perceptibility safety, operating
safety, passive safety: exterior safety, interior safety, deformation behaviour of
vehicle body, and speed and acceleration characteristics of passenger compartment
on impact.
II SAFETY EQUIPMENTS 09
Seat belt, regulations, automatic seat belt tightener system, collapsible steering
column, tiltable steering wheel, air bags, electronic system for activating air bags,
bumper design for safety.
IV COLLISION WARNING AND AVOIDANCE 09
Collision warning system, causes of rear end collision, frontal object detection, rear
vehicle object detection system, object detection system with braking system
interactions.
V COMFORT AND CONVENIENCE SYSTEM 09
Steering and mirror adjustment, central locking system , Garage door opening
system, tyre pressure control system, rain sensor system, environment information
system
Session-Wise Plan:
Pedagogy/
Mode of
Module Session Topic Readings and References Activity CO
Delivery
Planned
1-2 Design of the 1. Powloski. J., “Vehicle Body Explanations
body for safety Engineering”, Business books with Online
limited, London, 1969. Examples Synchronous
2. Ronald.K.Jurgen, PPT and
“Automotive Electronics Discussion
Handbook”, Second Edition,
McGraw-Hill Inc., 1999.
https://nptel.ac.in/courses/107/103/1
07103084/
1
Asynchronous
– Online
NPTEL
3-5 energy equation, 1. Bosch, “Automotive Explanations Online
engine location, Handbook”, 8th Edition, with practical Synchronous
SAE publication, 2011. Examples PPT and
2. Powloski. J., “Vehicle Body Discussion
Engineering”, Business
books limited, London, 1969.
1
1 https://nptel.ac.in/courses/107/103/1 1
07103084/
Asynchronous
– Online
NPTEL
5-7 deceleration of 1. Powloski. J., “Vehicle Body Asynchronous
vehicle inside Engineering”, Business – Online
passenger books limited, London, 1969. LinkedIn
compartment, 2. Ronald.K.Jurgen,
Deceleration on “Automotive Electronics
impact with Handbook”, Second Edition, 1
stationary and McGraw-Hill Inc., 1999.
movable obstacle https://nptel.ac.in/content/storage2/c
ourses/108103009/download/M2.pd
f
7-9 Concept of 1. Powloski. J., “Vehicle Body Explanations Online

crumble zone, Engineering”, Business with practical Synchronous
safety sandwich books limited, London, 1969. Examples PPT and
1 Discussion
construction. 2. Ronald.K.Jurgen,
“Automotive Electronics
https://nptel.ac.in/content/storage2/c
ourses/108103009/download/M2.pd Asynchronous
f – Online
NPTEL
09-11 Active safety: 1. Powloski. J., “Vehicle Body Online
2 driving safety, Engineering”, Business Explanations Synchronous
conditional safety, books limited, London, 1969. with practical PPT and
2. Ronald.K.Jurgen, Examples Discussion
1
https://nptel.ac.in/courses/107/106
/107106088/
https://onlinecourses.nptel.ac.in/n
oc20_de06/preview Asynchronous
– Online
NPTEL
11-13 perceptibility 1. Powloski. J., “Vehicle Body Hands on Online
safety, operating Engineering”, Business training, Synchronous
safety, books limited, London, Explanations PPT and
1969. with practical Discussion
2. Ronald.K.Jurgen, Examples
Handbook”, Second
Edition, McGraw-Hill Inc.,
1999.
07106088/ 2
https://onlinecourses.nptel.ac.in/noc
20_de06/preview
Asynchronous
– Online
NPTEL
13-15 passive safety: Explanations Online
exterior safety, 1. Powloski. J., “Vehicle Body with practical Synchronous
interior safety Engineering”, Business Examples PPT and
books limited, London, 1969. Discussion
2. Ronald.K.Jurgen,
Handbook”, Second Edition, 2
07106088/ Asynchronous
https://onlinecourses.nptel.ac.in/noc – Online
20_de06/preview NPTEL
15-18 deformation 1. Bosch, “Automotive Explanations Online
behaviour of Handbook”, 8th Edition, with practical Synchronous
vehicle body, SAE publication, 2011. Examples PPT and
speed and 2. Powloski. J., “Vehicle Body Discussion
acceleration Engineering”, Business
characteristics of books limited, London, 1969.
passenger 3. Ronald.K.Jurgen,
3
Compartment on “Automotive Electronics
impact. Handbook”, Second Edition,
McGraw-Hill Inc., 1999. Asynchronous
– Online
https://nptel.ac.in/content/storage2/c NPTEL
ourses/105106049/pdf-
assignments/main.pdf
18- Seat belt, Explanations Online
19 regulations, 1. Bosch, “Automotive with practical Synchronous
Handbook”, 8th Edition, Examples PPT and
SAE publication, 2011. Discussion
2. Powloski. J., “Vehicle Body
12105125/ 4
Asynchronous
3 – Online
NPTEL
19-21 automatic seat belt 1. Bosch, “Automotive Explanations Online
tightener system, Handbook”, 8th Edition, with practical Synchronous
collapsible SAE publication, 2011. Examples PPT and
steering column 2. Powloski. J., “Vehicle Body Discussion
4
3. Ronald.K.Jurgen,
Handbook”, Second Edition, Asynchronous
McGraw-Hill Inc., 1999. – Online
https://nptel.ac.in/courses/112/105/1 NPTEL
12105125/
21-23 tiltable steering 1. Bosch, “Automotive Asynchronous
wheel, air Handbook”, 8th Edition, – Online
bags, SAE publication, 2011. LinkedIn
3. Ronald.K.Jurgen,
3
12102015/
23-24 Electronic system 1. Bosch, “Automotive Explanations Online

for activating air Handbook”, 8th Edition, with practical Synchronous
bags, SAE publication, 2011. Examples PPT and
2. Ronald.K.Jurgen, Discussion
3
07106088/
Asynchronous
– Online
NPTEL
24-25 Bumper design for 1. Bosch, “Automotive Explanations Online
safety. Handbook”, 8th Edition, with practical Synchronous
SAE publication, 2011. Examples PPT and
2. Powloski. J., “Vehicle Body Discussion
3. Ronald.K.Jurgen,
3
McGraw-Hill Inc., 1999. Asynchronous
– Online
https://onlinecourses.nptel.ac.in/noc NPTEL
21_de02/preview
27-29 Collision warning Explanations Online
system, causes of 1. Bosch, “Automotive with practical Synchronous
rear end collision, Handbook”, 8th Edition, Examples PPT and
SAE publication, 2011. Discussion
3. Ronald.K.Jurgen,
4
ourses/105101008/downloads/cete_
48.pdf
Asynchronous
4 Online-
NPTEL
29-32 frontal object Explanations Online
detection, rear 1. Powloski. J., “Vehicle Body with practical Synchronous
vehicle object Engineering”, Business Examples PPT and
detection system, books limited, London, 1969. Discussion
2. Ronald.K.Jurgen,
4 McGraw-Hill Inc., 1999. 4
Asynchronous
https://nptel.ac.in/content/storage2/c Online-
ourses/105101008/downloads/cete_ NPTEL
48.pdf
32-36 Object detection Explanations Online
system with 1. Powloski. J., “Vehicle Body with practical Synchronous
braking system Engineering”, Business Examples PPT and
interactions. books limited, London, 1969. Discussion
2. Ronald.K.Jurgen,
4
https://nptel.ac.in/content/storage2/c Asynchronous
ourses/105101008/downloads/cete_ Online-
48.pdf NPTEL
36-38 Steering
U and Explanations Online
mirror
5 adjustment, 1. Bosch, “Automotive with practical Synchronous
central
n locking Handbook”, 8th Edition, Examples with PPT and
system
i , SAE publication, 2011. case studies Discussion
t 2. Ronald.K.Jurgen,
0 “Automotive Electronics
5
5 Handbook”, Second Edition,
4 McGraw-Hill Inc., 1999.
ourses/108103009/download/M3.pd Asynchronous
f Online-
NPTEL
38-40 Garage door Asynchronous

opening system, 1. Powloski. J., “Vehicle Body Online
Engineering”, Business LinkedIn
2. Ronald.K.Jurgen,
5
ourses/108103009/download/M3.pd
f
40-43 tyre pressure Explanations Online
control system, 1. Bosch, “Automotive with practical Synchronous
rain sensor Handbook”, 8th Edition, Examples PPT and
system, SAE publication, 2011. Discussion
2. Ronald.K.Jurgen,
5
ourses/105101008/downloads/cete_
48.pdf Asynchronous
Online-
NPTEL
43-45 environment Explanations Online
information 1. Powloski. J., “Vehicle Body with practical Synchronous
system Engineering”, Business Examples PPT and
books limited, London, 1969. Discussion
ourses/105108073/module1/lecture1 6
.pdf
Asynchronous
Online-
NPTEL
Assessment Scheme: CA: UE - 30:70

Sl. Assessment Formative/ Frequency Weightage CO
No. Instrument Summative (%)
1. Internal Assessment Formative 3 20 CO1 to CO6
2. MCQ 3 05 CO1 to CO6
3. Assignment Continuous 05 CO1 to CO6
4. End Semester Summative 1 70 CO1 to CO6

Examination (UE)
Total 100
Others Details:
1. Class Participation – Punctuality, Frequency, and Level of Interaction, Contribution to the Learning
Process (1 – Poor/Below 75%, 2 – Good/75-80%, 3 – Very Good/80-90%, 4 and above –
Excellent/Above 90%
2. Review Paper – Parameters for Evaluation:
a. Stated objectives
b. Provides evidence
c. Critical analysis of evidence
d. Global self-awareness
e. Perspective taking
f. Cultural diversity
3. Discipline – The students are expected to be punctual and regular in attending classes, submitting
assignments and activities. They should be decently dressed all the time. In their interactions, they
should be respectful and sensitive to everyone.
4. Chamber Consultation Hours – 11.00 am to 12.00 noon (Tentative)
5. Pre Reading – The readings/ references given in session-wise plan should be read by students before
coming to class to have effective and meaningful discussion on the topic.
6. Participation in Co-curricular and Extra-Curricular Activities – Attendance for the course on
Multidisciplinary Writing is compulsory as it will help in writing Review Essays
Natural Language Processing
ELECTIVE GROUP: V CREDITS: 03

SEMESTER: 07 L: T:P – 3:0:0
IA/UE: 30/70 CONTACT HRS/WEEK: 03
Course Objective:
1. To understand the pre-processing of text for natural language processing.

2. To gain the importance of considering syntactic parsing.
3. To learn the mechanism of natural language generation in processing of natural language.
4. To comprehend the importance of corpus creation in natural language processing.
5. To use statistical techniques and Part-of-Speech tagging in natural language processing
Course Outcomes:
CO1 Explain the basic concepts of natural language processing and its important terminologies.
CO2 Illustrate the key role of syntactic parsing and semantic analysis in natural language processing.
CO3 Discuss the importance of corpus creation in natural language processing
CO4 Use the important statistical techniques used in natural language processing
CO5 Analyze the concept of Part-of-Speech tagging in English and other languages
CO6 Demonstrate the application of natural language processing in sentimental analysis and in
biological sciences.
CO-PO MAPPING

PO1. PO2. PO3. PO4. PO5. PO6. PO7. PO8. PO9. PO10. PO11. PO12. PSO1. PSO2.
CO1. 3 2 2 2 1 1 3 1 2
CO2. 3 3 2 3 2 3 1 1 3
CO3. 3 3 2 3 2 1 3 1 3
CO4. 3 3 2 2 2 1 3 1 3 3
CO5. 3 3 2 3 2 1 3 2 3 3
CO6. 3 2 3 3 2 1 3 2 3 3
Introduction to Natural Language Processing: Introduction to text pre-processing, terminologies related with text
processing, challenges of text pre-processing, tokenization, sentence segmentation, introduction to lexical analysis,
finite state morphology, finite state morphology, morphology vs lexical analysis, paradigm based lexical analysis.
Syntactic Parsing and Semantic Analysis: Introduction to syntactic parsing, The Cocke–Kasami–Younger Algorithm,
parsing as deduction, Implementing Deductive Parsing, LR Parsing, Constraint-based Grammars, Issues in Parsing,
Basic Concepts and Issues in Natural Language Semantics, Theories and Approaches to Semantic Representation,
Relational Issues in Lexical Semantics, Fine-Grained Lexical-Semantic Analysis.
Natural Language Generation: Introduction to natural language generation, simple Examples of Generated Texts,
The Components of a Generator: Components and level of representation, Approaches to Text Planning: The
Function of the Speaker, Desiderata for Text Planning, Pushing vs. Pulling, Planning by Progressive Refinement of
the Speaker’s Message, Planning Using Rhetorical Operators, Text Schemas, The Linguistic Component: Surface
Realization Components, Relationship to Linguistic Theory, Chunk Size, Assembling vs. Navigating, Systemic
Grammars, Functional Unification Grammars.
UNIT- IV [9 HOURS]
Corpus Creation: Introduction and definition of corpus in natural language processing, corpus size, Balance,
Representativeness, and Sampling, Data Capture and Copyright, Corpus Markup and Annotation, Multilingual
Corpora, Multimodal Corpora, Corpus Annotation Types, Morphosyntactic Annotation, Treebanks: Syntactic,
Semantic, and Discourse Annotation, The Process of Building Treebanks, application of Treebanks.
UNIT- V [9 HOURS]
Statistical Techniques in Natural Language Processing: Introduction to statistics and its importance in natural
language processing, general linear model, binary linear classification, one versus all method for multicategory
classification, maximum likelihood estimation in parameter estimation in linear classification techniques, concepts
of generative and discriminative models, introduction to sequence prediction model and its application in natural
language processing.
TEXT BOOKS
1. Hand Book of Natural Language Processing, Second Edition – NITIN INDURKHYA FRED J. DAMERAU, CRC
Press,2010.
2. Natural Language Processing and Text Mining - Anne Kao and Stephen R. Poteet (Eds), Springer,2006
REFERENCES
1. Mining Text Data - Charu C. Aggarwal, ChengXiang Zhai, Springer ,2012.

2. Text Mining Classification, Clustering, and Applications - Ashok N. Srivastava, Mehran Sahami, CRC
Press,2009.
3. Introduction to Natural Language Processing, Jacob Eisenstein,MIT press,2019.

Dimensionality Reduction and Model Validation Techniques
Subject Code: 18CS7DS10 Total Hours: 30

Prerequisite: Knowledge on Unsupervised machine learning techniques and supervised

machine learning techniques.
Course Objective:
1. To understand the importance of dimensionality reduction in data science.
2. To know the different data dimension reduction techniques and its appropriate uses.
3. To apply the importance of principle component analysis in data dimension reduction.
4. To analyze the difference between factor and principle component analysis in
variable reduction technique.
5. To apply the essentials of model validation for better prediction with minimal errors.
MODULE I (6 hours)
Introduction to Dimensionality Reduction: Introduction to dimensionality reduction –
basic concepts of dimensionality reduction, linearity of variables, assumptions of linearity
among variables, correlation, important techniques to data dimension reduction techniques:
missing values, lower variance, decision trees, decision tree ensembles, high correlation and
backward feature elimination, forward feature construction, factor analysis, principle
component analysis, importance of data dimension reduction technique in data science.
MODULE II (6 hours)
Dimensionality Reduction – I: General purpose and description of principal component
analysis, extraction of principle components, meaning of Eigen values and Eigen vectors in
principle component analysis, extraction techniques, orthogonal and oblique rotation of linear
combination of variables, determination of number of principle components : cumulative
percent variance explained, average method, Kaisers rule, Broken stick method, Scree plot,
using all the preliminaries of PCA for dimension reduction.
MODULE III (6 hours)

Dimensionality Reduction – II: Random forest and its importance in reducing dimension
reduction, fundamental equation of factor analysis, factor model estimation and application in
dimension reductions, extraction of factors, orthogonal rotations, communality, variance and
covariance, factor scores and importance of factor score in deciding the number of factors,
oblique rotation, difference between orthogonal and oblique rotation, application of factor
analysis for dimension reduction.
MODULE IV (6 hours)
Assessment and efficiency of model – I: Introduction to cross validation of different
classification algorithms, cross validation and resampling methods : K-fold cross validation,
5X2 cross validation, bootstrapping method, bagging, measurement of error in predictions,
confidence interval for the predicted values, confusion matrix and its interpretation, balanced
accuracy in confusion matrix, ROC curve for classification algorithms, importance of ROC
curve in model accuracy and fit, complexity parameter and its table, pruning using
complexity parameter.
MODULE V (6 hours)
Assessment and efficiency of model – II: Hypothesis testing – Binomial test, approximate
normal test, paired t test, Comparison of two classification algorithms – McNemar’s Test, K-
Fold Cross validated Paired t test, 5X2 Cross Validated Paired t test, 5X2 Cross Validated
Paired F test, ANOVA for comparing more than two classification algorithms.
Course Outcomes:
At the end of this course students will be able to
1. Explain the different dimension reduction techniques for parametric and non-
parametric models and their importance.
2. Use principle component analysis for data dimension reduction for data science
project.
3. Illustrate nonlinear dimension reduction technique to reduce unimportant variables.
4. Use factor analysis for data dimension reduction for data science project.
5. Examine model validation technique for classification models.
6. Build model validation technique for regression analysis and find the better fit model.
Text Books
1. Introduction to Linear Regression Analysis, Fifth Edition - Douglas C. Montgomery,
Elizabeth A. Peck, G. Geoffrey Vining, A John Wiley & Sons, Inc., Publication.
2. Goodness-of-Fit Tests and Model Validity - C. Huber-Carol, N. Balakrishnan , M.S.
Nikulin M. Mesbah , Springer Science + Business Media, LLC
Reference Books
1. Dimensionality Reduction with Unsupervised Nearest Neighbors, Volume 51 - Oliver
Kramer, Springer Science + Business Media, LLC.
2. Nonlinear Dimensionality Reduction - John A. Lee Michel Verleysen, Springer
Science + Business Media, LLC.
3. Fundamentals of mathematical statistics – SC Gupta and VK Kapoor, Sultan Chand
& Sons Publication, New Delhi
4. Using Multivariate Statistics, Sixth Edition - Barbara G. Tabachnick, Linda S. Fidell,
Pearson Education
5. Applied Regression Analysis, Third Edition – Norman R Draper, Harry Smith, Wiley
Publication.
SOFTWARE ENGINEERING
Core CREDITS: 03
IA/UE : 30/70 CONTACT HRS/WEEK : 03
SUB CODE: 18CS6SP09
Course Objective:
1. To describe solid fundamental knowledge of software engineering to be successful
professionals in the field.
2. To explain the the different software design process and concepts for given application.
3. To get the information about the techniques and tools for Software Project Management.
Course Outcomes:
CO1 Choose the software engineering lifecycle models by demonstrating competence in
communication, planning, analysis, design, construction, and deployment of software.
CO2 Describe an ability to use the techniques necessary to develop and deliver quality
software.
CO3 Select the different software design process and concepts for given application.
CO4 Discuss the different software testing techniques necessary to develop and deliver quality
software.
CO5 Choose the techniques and tools for Software Project Management.
CO6 Select the tools and techniques to work as an individual and as part of a multidisciplinary
team to develop and deliver quality software for the given application domain.
CO-PO MAPPING
CO1. 2 2 1 1 1 1 1 2 2 2
CO2. 2 2 1 2 1 1 2 2 2 2
CO3. 2 2 1 1 1 1 2 2 2 1
CO4. 2 2 2 2 1 1 2 2 3 3
CO5. 3 2 2 2 1 1 2 2 3 3
CO6. 3 3 2 2 2 1 2 2 3 3
Software Product and Process - Introduction – S/W Engineering Paradigm – Verification – Validation
– Life Cycle Models – System Engineering – Computer Based System – Business Process Engineering,
Overview – Product Engineering Overview.

Software Requirements - Functional and Non-Functional – Software Document – Requirement
Engineering Process – Feasibility Studies – Software Prototyping – Prototyping in the Software Process
– Data – Functional and Behavioral Models – Structured Analysis and Data Dictionary.
Analysis, Design Concepts and Principles - Systems Engineering - Analysis Concepts - Design Process
And Concepts – Modular Design – Design Heuristic – Architectural Design – Data Design – User
Interface Design – Real Time Software Design – System Design – Real Time Executives – Data
Acquisition System – Monitoring And Control System.
UNIT- IV [9 HOURS]
Testing - Taxonomy of Software Testing – Types Of S/W Test – Black Box Testing – Testing Boundary
Conditions – Structural Testing – Test Coverage Criteria Based On Data Flow Mechanisms – Regression
Testing – Unit Testing – Integration Testing – Validation Testing – System Testing And Debugging –
Software Implementation Techniques.
UNIT- V [9 HOURS]
Software Project Management - Measures And Measurements – ZIPF’s Law – Software Cost
Estimation – Function Point Models – COCOMO Model – Delphi Method – Scheduling – Earned Value
Analysis – Error Tracking – Software Configuration Management – Program Evolution Dynamics –
Software Maintenance – Project Planning – Project Scheduling– Risk Management – CASE Tools.
Text Books:
1. Ian Sommerville, “Software engineering”, Tenth Edition, Pearson Education Limited, 2016.
2. Roger S. Pressman, “Software Engineering – A practitioner’s Approach”, Eight Edition,

McGraw-Hill International Edition, 2019.
References Books:
1. Olga Filipova & Rui Vilão, “Software Development from A to Z: A Deep Dive into All the Roles
Involved in the Creation of Software”, Apress, 2018.
2. Ronald J. Leach, “Introduction to Software Engineering”, 2nd, Edition, Chapman and

Hall/CRC press, 2020.
3. Rajib Mall, “Fundamentals of Software Engineeing”, 4th Edition, Prentice Hall India Learning
Private Limited, 2015.
Semester-VI
Elective – II
Exploratory Data Analysis
Subject Code: 18DS6DE23 Total Hours: 45
Prerequisite: Statistics and Graphical knowledge on data

Course Objectives:
The objective of the course is to understand data and its types, explain the importance of data pre-
processing and exploration, use of univariate and bivariate data analysis and to create visual
methods to analyze the trends, patterns, relationships in the data.
Unit I (9 Hours)
Introduction to Data and its types: Definition and importance of data, classification of data :
based on observation – Cross Sectional, times series and panel data, based on measurement – ratio,
interval, ordinal and nominal, based on availability – primary, secondary, tertiary, based on
structural form – structured, semi structured and unstructured, based on inherent nature –
quantitative and qualitative, concepts on sample data and population, small sample and large
sample, statistic and parameter, types of statistics and its application in different business
scenarios, frequency distribution of data.
Unit II (9 Hours)
Introduction to Exploratory Data Analysis (EDA): Definition of EDA, difference between
EDA with classical and Bayesian Analysis, comparison of EDA with Classical data summary
measures, goals of EDA, Underlying assumptions in EDA, importance of EDA in data exploration
techniques, introduction to different techniques to test the assumptions involved in EDA, role of
graphics in data exploration, introduction to unidimensional, bidimensional and multidimensional
graphical representation of data.
Unit III (9 Hours)

Data Preparation: Introduction to data exploration process for data preparation, data discovery,
issues related with data access, characterization of data, consistency and pollution of data,
duplicate or redundant variables, outliers and leverage data, noisy data, missing values, imputation
of missing and empty places, with different techniques, missing pattern and its importance,
handling non numerical data in missing places.
Unit IV (9 Hours)
Univariate Data Analysis –: Description and summary of data set, measure of central tendency –
mean: Arithmetic, geometric and harmonic mean – Raw and grouped data, confidence limit of
mean, median for raw (odd and even numbers) and grouped data, mode for raw and grouped data,
quartile and percentile, interpretation of quartile and percentile values, introduction to spreadness
of data, measure of dispersion, concepts on error, range, variance, standard deviation, confidence
limit of variance and standard deviation, coefficient of variation, mean absolute deviation, mean
deviation, quartile deviation, interquartile range, concepts on symmetry of data, skewness and
kurtosis.
Unit V (9 Hours)
Bivariate Data Analysis: Introduction to bivariate distributions, association between two nominal
variables, contingency tables, Chi-Square calculations, Phi Coefficient, scatter plot and its causal
interpretations, correlation coefficient, regression coefficient, relationship between two ordinal
variables – Spearman Rank correlation, Kendall’s Tau Coefficients, measuring association
between mixed combination of numerical, ordinal and nominal variables.
EDA – Graphical Representation: Introduction to graphical representation of data, dot plot, stem
and leaf plot, bar chart, stacked bar chart, multiple bar chart, percentage bar chart, histogram,
bimodal and symmetric interpretation of histogram, pie chart and its legends, block plot, Box Plot,
contour plot, star plot, dendrogram, interpretation of dendrogram, heat map, tree map.
Course Outcomes:
At the end of this course students able to
• Classify the different types of data: based on observation, measurement, availability,
inherent nature and structural form and understanding the concept of sample data and
population.
• Describe data analysis and its different techniques and various unidimensional,
bidimensional and multidimensional graphical representation of data.
• Illustrate the different phases of data preparation.
• Demonstrate the concept of univariate data analysis by considering different data sets.
• Differentiate the different graphical representations used for EDA.
• Examine trends, patterns, relationships in the data.
Text Books
1. Exploratory Data Analysis – John W Tukey, Addison Wesley Publishing Company
Reference Books
1. Exploratory Data Analysis in Business and Economics - An Introduction Using SPSS, Stata
and Excel – Thomas Cleff, Springer Publication
2. Graphical Exploratory Data Analysis - S.H.C. du Toit A.G.W. Steyn R.H. Stumpf,
Springer Publication
Information Security
Subject Code : Total Contact Hours : 45

Credits : 03 Hours per week : 03
L-T-P : 3-0-0
Prerequisite: Basic Information Security
Course Objectives:
• The course primarily covers the Types of Threats, Vulnerabilities, Risks and various
terminologies in Information Security.
• It explains the formation of Security policy at various levels inside the Organization
and provides the definition Procedures, Standard and Guidelines.
• The units emphasizes the need of Performing Asset Classification and Declassification,
Retention and Disposal of Information Asset also it identifies the various levels of
Authorization for access Viz., Owner, Custodian and User.
• The course covers the different types of Access Controls and Physical security
measures to safeguard the Assets.
• It deals with the Digital Rights Management also covering the concepts of Common
Authentication protocols and Real world Protocols.
• It helps to understand about the authorization process of access to owner, user and
custodian
Unit-I: (9 Hours)
Introduction to Information Security
Definition of Information Security, Evolution of Information Security; Basics Principles of
Information Security; Critical Concepts of Information Security; Components of the
Information System; Balancing Information Security and Access; Implementing IT Security,
The system Development Life cycle, Security professional in the organization.
1. What is Information Security? Explain in detail about the different characteristics of

the Information Security.
2. Explain about the different components of the Information Security. Write a note on
how to balance the Information Security and access.
3. Explain the SDLC for Information Security. According to you, which approach is the
best for Information Security development.
4. Write an essay on the roles and responsibilities of the Information Security
Professionals in the IT organization.
Unit-II: (9 Hours)
The Need for IT Security
Business Needs-Protecting the functionality, Enabling the safe operations, Protecting the data,
safe guarding the technology assets; Threats-compromises to Intellectual property, deliberate
software attacks, Espionage and trespass, sabotage and vandalism; Attacks-Malicious Codes,
Back Doors, Denial of Service and Distributed Denial of Service, Spoofing, sniffing, Spam,
Social Engineering.
5. Write an Essay on the DoS and DDos attacks.

6. Explain about Spoofing, sniffing, Spam, Social Engineering.
7. Define Intellectual property. Write a brief note on different threats to Intellectual
property.
Unit –III: (9Hours)
Risk Management
Definition of risk management, risk identification, and risk control, Identifying and Accessing
Risk, Assessing risk based on probability of occurrence and likely impact, the fundamental
aspects of documenting risk via the process of risk assessment, the various risk mitigation
strategy options, the categories that can be used to classify controls.
Unit IV: (9 Hours)

Network Infrastructure Security and Connectivity
Understanding Infrastructure Security- Device Based Security, Media-Based Security,
Monitoring and Diagnosing; Monitoring Network- Firewall, Intrusion Detection System,
Intrusion Prevention system; OS and Network Hardening, Application Hardening; Physical
and Network Security- Policies, Standards and Guidelines.
Unit V: (9 Hours)
Information Asset Classification
Classification of Information, Information Assets – Owner, Custodian, User, Information
Classification in terms of Secret, Confidential, Private and Public, Declassification. Retention
and Disposal of Information Assets. Provide Authorization for Access – Owner, Custodian and
User.
Course Outcome:
• To enable students to understand the concepts of IT security, Threats, Vulnerabilities,
Impact and control measures.
• To enable the students to understand about the need of Information Security.
• To enable to the students to understand about the risk identification process, risk
detection and prevention and risk management.
• To enable the students to understand about network infrastructure security.
• To enable the students to understand about the network security policies, standards and
policies.
• And also to get familiarize with Asset management along with the objective to create
awareness in Digital Rights management.
Text Books:
1. Mark Stamp's Information Security: Principles and Practice (WIND) Paperback – 2009
by Deven N. Shah, Wiley (2009)
2. Information Security Risk Analysis - Thomas R. Peltier, Third Edition, Pub: Auerbach,
2012
3. Information Systems Security: Security Management, Metrics, Frameworks and Best
Practices by Nina Godbole, Wiley, 1st ed; 2008.
Reference Books:
1. Information Security: The Complete Reference by Mark Rhodes-Ousley, McGraw Hill
Education; Second edition (1 May 2013)
2. Principles of Information Security by Michael E. Whitman, Cengage Learning India
Private Limited; 5 edition (2015)
3. Cryptography and Network Security Principles and Practices, by William Stallings,
Pearson Education; Seventh edition (30 June 2017).
Advanced Big Data Analytics
Subject Code : 18CS6DS08 Total Contact Hours : 60
Credits : 04 Hours per week : 04
Course Objectives:
● To understand the advance concept of Big Data Analytics
● To understand different types of Data Processing Tools
● To understand architecture of different tools in Hadoop Cluster
● To understand about ETL process in Hadoop Cluster
● To understand internal concept Hive, Pig, Sqoop, Flume
● You will understand the concept zookeeper
● You will get to know about different data processing techniques
● You will learn about automating jobs in Hadoop Cluster
Unit I: Apache Pig (12 Hours)
Apache Pig, Pig on Hadoop, Pig Latin, Pig Philosophy, Pig’s History, Local Mode and
MapReduce Mode, Pig’s Data Model, Scalar, Complex, Load, Dump, Store, Foreach, Filter,
Join, group, Order by, Distinct, Limit, Sample, Parallel, User Defined Function
Advanced Relational Operations, Using different Join Implementations, Co-group, Union,
Cross, Nonlinear Data flows, Controlling Executions, Parameter Substitutions, and Program
for Word Count Job, Comparison Apache Pig and MapReduce
Unit II: Apache Hive (12 Hours)

Apache Hive, Features of Apache Hive, Command Line Interface, History of Apache Hive,
Hadoop dfs commands from Inside Hive, Hive Data Types & Files Formats, Databases in hive,
Alter Database, Creating Managed Table, External Table, Partitioned Table, Dropping Tables,
Alter Table, Loading data into Managed Table, Inserting Data into Tables from Queries,
Dynamic Partitions inserts, Exporting data, SELECT from clauses, WHERE Clauses, GROUP
BY Clauses, JOIN Statements, ORDER BY, SORT BY
Unit III: Apache Sqoop & Apache Oozie (12 Hours)

Apache Sqoop, Sqoop Architecture, Sqoop Features, Need for Apache Sqoop, Sqoop
Connectors, Import Function, Incremental Import, Direct Mode Import, Performing Export
Function, Import to Hive, Exports and Transactionality, Apache Oozie, Features of Apache
Oozie, Need for Apache Oozie, Workflow.xml, Coordinator, Job properties
Unit IV: Apache Flume & Zookeeper (12 Hours)
Apache Flume, Flume Architecture, Features of Apache Flume, Need for Apache Flume,
Transactions & Reliability, Source, Sink, Channel , HDFS Sink, Partitioning & Interceptors,
File Formats, FAN Out, Integrating Flume with Applications, Apache Zookeeper, Features and
Application of Zookepper, Understanding Concept of Zookeeper
Unit V: Apache spark and Mahout (12 Hours)

Spark introduction, Reduction operation and Distributed Key-Value Pairs, Partitioning and
shuffling, Structured data: SQL, Dataframes and Datasets, Mahout Introduction, Hortonworks,
HDFS, CAP, Large Scale Data Storage, Streaming Systems, Graph Processing and Machine
learning.
Course Outcome:
● Understand the concept of Hadoop Cluster

● Understand the concept of Different Processing Tool
● Understand the concept of ETL process
● Understand the internals Pig, Hive, Sqoop, Oozie, Flume
● Understand the entire Hadoop Ecosystem
● Work on Hadoop Cluster using different processing tools
Text Books:
1. Hadoop: The Definitive Guide, By: Tom White, O’REILLY
2. Programming Hive, By: Edward Capriolo, Dean Wampler & Jason Rutherglen,
Published by O’REILLY
3. Programming Pig, By: Alan Gates, Published by O’REILLY
Reference Books:
1. Hadoop for Dummies, By: Dirk deRoos, Paul C. Zikopoulos, Bruce Brown, Rafael
Coss, and Roman B. Melnyk, A Wiley brand
2. Hbase The Definitive Guide, By: Lars George, Published by O’REILLY
3. Learning Spark, Lightening Fast Data Analysis, Holden Karau, Andy Konwinsky,
Patrick and Matei Zaharia
ADVANCED MACHINE LEARNING
SUB CODE: 19CS6DS09 CREDITS: 03
IA/UE : 30/70 CONTACT HRS/WEEK : 03
Course Objective:
1 To understand the advanced machine learning concepts
2 To understand the importance of ensemble methods and reinforcement learning
3 To develop a machine learning algorithm-based web api on cloud
Course Outcomes:
CO1 Describe the advanced machine learning concepts.
CO2 Discuss ensemble methods of machine learning
CO3 Use the concept of reinforcement learning in real world scenarios
CO4 Demonstrate the advanced machine learning concepts in real world scenarios
CO5 Develop machine learning concepts on real based dataset
CO6 Construct the machine learning algorithms-based web api on cloud
CO-PO MAPPING
CO PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2
CO01 3 2 2 1 2 2 2 2 2 2
CO02 2 2 2 1 2 2 2 2 2 2
CO03 1 1 1 1 2 2 2 2 2 2
CO04 2 2 3 1 2 2 2 2 3 3
CO05 2 2 3 2 2 2 2 2 3 3
CO06 2 2 3 2 2 2 2 2 3 3
Advanced Machine learning with TensorFlow
Introduction, Tensorflow operations, declaring tensors, working with metrics, declaring operations,
implementing activation functions, operations in computational graph, layering nested operations,
working with multiple layers, implementing loss functions, implementing back propagation, working
with batch and stochastic training, evaluating models, Implementing unit tests, multiple executors,
productionalizing tensorflow.
UNIT II [9HOURS]
Ensemble Methods
Bagging and Random Forest, Bootstrap method, Bootstrap aggregation, Variable Importance,
Boosting, AdaBoost, Boosting ensemble method, AdaBoost ensemble, CatBoost, Learning with
ensembles, Implementing a simple majority vote classifier, Leveraging weak learners via adaptive
boosting.
Reinforcement Learning
Introduction, formal framework, different components to learn a policy, value-based methods for
RL, Q-learning, fitted Q-learning, Deep Q-networks, double DQN, dueling network architecture,
distributional DQN, Multi step learning, concepts of generalization, feature selection, modifying
objective function, hierarchical learning, bias-over fitting tradeoff.
UNIT- IV [9 HOURS]
Model Evaluation and Hyper-Parameter Tuning
Streamlining workflows with pipelines, K-fold cross validation, Model performance measures,
debugging algorithms with learning and validation curves, fine-tuning machine learning models via
grid search, looking at different performance evaluation metrics, ranking metrics, Classification
metrics, regression metrics, Bootstrapping and Jackknife, Hold-out validation, difference between
model validation and testing.
UNIT- V [9 HOURS]
Machine Learning Deployment
Serializing fitted scikit – learn estimators, setting up a SQLite database for data storage, developing
web application with Flask, turning the classifier into a web application, turning a regression
problem into a web application, pickle model, deploying web application to a public server, Cloud
deployment using AWS and Google.
Text Books:
1) Master Machine Learning Algorithms: Discover How They Work and Implement Them From
Scratch, Jason Brownlee, Machine Learning Mastery, 2016.
2) Python: Deeper Insights into Machine Learning, By Sebastian Raschka , David Julian , John Hearty
Birmingham, Packt publishing, 2016.
3) An Introduction to Deep Reinforcement Learning, Vincent François-Lavet, Peter Henderson,

Riashat Islam, Marc G. Bellemare and Joelle Pineau, Foundations and Trends® in Machine
Learning, 2018.
4) Tensorflow machine learning cookbook, Nick McClure, Packt publishing, 2017.
Reference Books and links:
1) Advanced machine learning with python, John hearty, Packt publishing, 2016.
2) Introduction to Machine Learning with Python: A Guide for Data Scientists, by Andreas C. Mueller,
Sarah Guido, 1st Edition, Published by O’REILLY, 2016.
DATA ANALYTICS USING SQL
Elective – III CREDITS: 03
SEMESTER: 06 L:T:P – 3:0:0
SUB CODE: 18DS6DE33
Course Objective:
1 To get the information of SQL, features of it, and statement of it
2 To apply the basic SQL commands
3 To get the information of SQL arithmetic functions for manipulating data
Course Outcomes:
CO1 Describe the concept of SQL, its history, feature, process, roles, types, standards,
architectures, OLAP and OLTP Applications.
CO2 Summarize and classify SQL statements for its execution.
CO3 Demonstrate basic SQL commands for creating and dropping database, index and tables,
inserting and altering table structure and data
CO4 Compare different SQL operators and order by clause by executing the queries for SQL
tables
CO5 Assess and judge SQL arithmetic functions for manipulating data with respect to non-
functional use of SQL queries.
CO6 Formulate grouping, summarizing and aggregating results and different join operations
while providing real world SQL solutions though assignments and mini projects.
CO-PO MAPPING
Course Outcomes – Program Outcome Mapping (H/M/L: 3/2/1)
CO PO PO PO PO PO PO PO PO PO PO1 PO1 PO1 PSO PSO
1 2 3 4 5 6 7 8 9 0 1 2 1 2
CO0 3 2 2 1 1 1 1 2 1 2 2 2
1
CO0 2
3 1 3 1 1 1 1 1 2 1 1 2 1
2
CO0 1 1 1 1 1 1 1 1 2 1 1 2 2 2
3
CO0 1 2 3 1 1 1 1 1 2 1 2 2 2
4
CO0 2 2 3 1 1 1 1 1 2 1 2 2 2
5
CO0 2 2 3 1 1 1 1 1 2 1 2 2 2
6
Unit I: (9 Hours)
Introduction to SQL
Introduction to Structure Query Language (SQL), SQL History & Evolution, Features of SQL,
Understanding of SQL process, Benefits and Role of SQL along with different market forces, Types of
SQL, SQL Standards, SQL and Networking, Centralized architecture, File Server Architecture, Client
Server Architecture, Multitier Architecture, Understanding concept for OLAP and OLTP Applications,
Difference between OLAP and OLTP, SQL and Database Management, Data warehouse Concept
Unit II: (9 Hours)

SQL Statements & Executions
Types of SQL Statement, Data Definition language, Data Control language, Data Manipulation
Language, Types of execution, Direct Invocation, Embedded SQL, Module Binding, Call-level interface,
Data types, Constants, Numeric Constants, String Constants, Time & date Constants, Symbolic
Constants, Expressions, Built in function, Null Values, Primary and Foreign Key Concept
Unit III: (9 Hours)

Starting with basic SQL Syntax
Types of Tables, Create Database statement, drop database Statement, use statement, create table
Statement, drop table Statement, create index Statement, drop index Statement, Describe Statement,
Truncate Statement, alter table Statement, Insert INTO Statement, Update table Statement, delete
table Statement, Commit Statement
Create SQL Tables, Specify Column data types, create user Defined Types, Specify Column Default
Values, Alter SQL Tables, Updating Data, Using WHERE Clause, Using Logical operations, AND
operations, OR operations, Deleting SQL table
Unit IV: (9 Hours)

Extracting Information & Manipulating Data
Select Statement, returning only Distinct Rows, Using Aliases, Filtering Results using WHERE Clause,
Logical Operations and Operator Precedence, NOT operator, BETWEEN Operator, LIKE Operator, IN
Operator, Ordering Results with ORDER BY
Understanding SQL Arithmetic, basic Math operations, ABS () function, POWER() function, SQRT()
function, RAND() function, CEILING() function, FLOOR() function, ROUND() function, SUBSTRING()
function, Case Conversion Functions, REVERSE() function, TRIM() function, LENGTH() function,
SOUNDEX() function, DIFFERENCE() function, DATE() function
Unit V: (9 Hours)
Grouping & Multi-table Queries
Grouping Results, Summarizing and Aggregating Data, counting results, Adding Results, Averaging
Results, MAX & MIN functions, using HAVING clause with GROUP BY Statements, Implicit Versus
Explicit Groups, Counting DISTICT Values
Simple Joins/ Equi-Joins, Parent / child queries, Inner Joins, Multiple Joins, Cross Joins, Self Joins, Outer
Joins, Right Joins, Left Joins, Full-outer Joins, Creating joins with more than two tables, Equi-Joins
Versus Non-Equi Joins, Union operations.
Text Books:
1. Beginning SQL, Paul Wilton and John W. Colby, 1st Edition, Published by: Wrox, 2005.
Reference Books:
1. SQL: The Complete Reference, James R. Groff and Paul N. Weinberg, 1st Edition, McGraw-
Hill/Osborne Education, 2017.
2. Learning SQL, ALAN Beaulieu, 3rd Edition, O’Reilly Media, Inc., 2020.
Economics for Engineers

Credits: 3
Course Code: 18HSS03
The students will able:
● To demonstrate the knowledge of the fundamental and technical concepts of economics.
• To identify and use economics terminologies in oral and written communications.

• To make decisions wisely using cost-benefit analysis.
• To demonstrate a sense of responsibility and a capacity for service.
• To recognize when change is appropriate, to adapt to change as it occurs, and to take the lead in
creating change as the country’s economic environment changes.
UNIT – I : Basic Principles and Methodology of Economics:(10hrs)
Nature and Scope of Economics- Basic Economic Problems: Scarcity and choices, Resource allocation,
Marginal analysis, Production possibility curve, Externalities, Welfare Economics. Basics of
microeconomics - Demand and Supply Analysis, equilibrium, elasticity; Markets – Perfect competition,
Monopoly, Monopolistic, Oligopoly, Basics of macroeconomics - the circular flow models, National
income analysis (GDP/GNP/NI/Disposable Income, Green GDP), and inflation trade cycles.
UNIT-II: Public Sector Economics (7hrs)
Public economics, Role of Public and private sectors in economic development, Public Expenditure and
Public Debt, Monetary and Fiscal Policy Tools & their impact on the economy
UNIT-III:Monetary Economics. (7hrs)

Components of Monetary and Financial System, Capital and Debt Markets, Central Bank, Commercial
Banks & their functions, Price Indices (WPI/CPI), Direct and Indirect Taxes. Budget,
UNIT-IV: Elements of Business and forms of organizations (10hrs)
Theory of the Firm: production and production function -Cost & Cost Control Techniques -
Types of Costs, opportunity costs, Budgets, Break even Analysis, Capital Budgeting,
Application of Linear Programming, Investment Analysis – NPV, ROI, IRR, Payback Period,
Depreciation, Time value of money. Business Forecasting – Elementary techniques.
Statements – Cash flow, Financial. Case Study Method
UNIT-V: (a) Indian economy: Brief overview of post-independence period (11hrs)
5 year plans. Industrial policy in India; Recent trends in Indian industrial growth; MNCs and transfer of
technology; Liberalization and privatization; Regional industrial growth in India; Post reform Growth,
Structure of productive activity.
(b) Employment, Migration and Urbanization
Migration and Urbanization,Labour Market and Employment–Informal, Organized, Unorganized, Public,
Private.
Reference books:
1. Mankiw Gregory N.(2002), Principles of Economics, Thompson Asia

2. V. Mote, S. Paul, G. Gupta(2004), Managerial Economics, Tata McGraw Hill
3. Misra, S.K. and Puri (2009), Indian Economy, Himalaya
4. PareekSaroj (2003), Textbook of Business Economics, Sunrise Publishers
5. Ahluwalia, I.J. (1985), Industrial Growth in India, Oxford University Press, New Delhi
Course Outcomes:
1. To identify and explain economic concepts and theories related to the behavior of economic agents,
markets, industry and firm structures, legal institutions, social norms, and government policies.
2. To demonstrate an awareness of the role in the global economics environment.

3. To integrate theoretical knowledge with quantitative and qualitative evidence in order to
explain past economic events and to formulate predictions on future ones.
4. To evaluate the consequences of economic activities and institutions for individual and social
welfare.
5. To apply the basic theories of economics in critical thinking and problem solving.
Theory of Computation
Subject Code: 18CS5SE01/DS01 Total

Hours: 45
COURSE OBJECTIVES:
1. To give an overview of the theoretical foundations of computer science from the
perspective of formal languages
2. To illustrate finite state machines to solve problems in computing
3. To explain the hierarchy of problems arising in the computer sciences.
4. To familiarize Regular grammars, context frees grammar.
UNIT – I 9 Hours
FINITE AUTOMATA (FA): Introduction, Deterministic Finite Automata (DFA) -Formal
definition, simpler notations (state transition diagram, transition table), language of a DFA.
Nondeterministic Finite Automata (NFA)- Definition of NFA, language of an NFA,
Equivalence of Deterministic and Nondeterministic Finite Automata, Applications of Finite
Automata, Finite Automata with Epsilon Transitions, Eliminating Epsilon transitions,
Minimization of Deterministic Finite Automata, Finite automata with output (Moore and
Mealy machines) and Inter conversion.
UNIT – II 9 Hours
REGULAR EXPRESSIONS (RE): Introduction, Identities of Regular Expressions, Finite
Automata and Regular Expressions- Converting from DFA’s to Regular Expressions,
Converting Regular Expressions to Automata, applications of Regular Expressions.
REGULAR GRAMMARS: Definition, regular grammars and FA, FA for regular grammar,
Regular grammar for FA. Proving languages to be non-regular -Pumping lemma,
applications, Closure properties of regular languages.
UNIT – III 9 Hours

CONTEXT FREE GRAMMER (CFG): Derivation Trees, Sentential Forms, Rightmost
and Leftmost derivations of Strings. Ambiguity in CFG’s, Minimization of CFG’s, CNF,
GNF, Pumping Lemma for CFL’s, Enumeration of Properties of CFL.
UNIT – IV 9 Hours
PUSHDOWN AUTOMATA: Definition, Model, Acceptance of CFL, Acceptance by Final
State and Acceptance by Empty stack and its Equivalence, Equivalence of CFG and PDA.
TURING MACHINES (TM): Formal definition and behaviour, Languages of a TM, TM as
accepters, and TM as a computer of integer functions, Types of TMs.
UNIT V 9 Hours
RECURSIVE AND RECURSIVELY ENUMERABLE LANGUAGES (REL): Properties
of recursive and recursively enumerable languages, Universal Turing machine, The Halting
problem, Undecidable problems about TMs. Context sensitive language and linear bounded
automata (LBA), Chomsky hierarchy, Decidability, Post's correspondence problem (PCP),
undecidability of PCP.
Course Outcomes: At the end of the course students will be able to:
Understanding of the core concepts in automata theory and Theory of Computation.
Identify limitations of some computational models and possible methods of proving them.
Recognize Finite Automata and Regular Expressions for various languages.

Solve various types of problems by applying normal form techniques, push down automata and Turing
Machines.
Apply formal mathematical methods to prove properties of languages, grammars and automata.
Demonstrate the formal relationships among machines, languages and grammars.
TEXT BOOKS:
1. John E. Hopcroft, Rajeev Motwani, Jeffrey D. Ullman (2007), Introduction to Automata
Theory
Languages andComputation, 3rd edition, Pearson Education, India.
REFERENCE BOOKS:
1. K. L. P Mishra, N. Chandrashekaran (2003), Theory of Computer Science-Automata
Languages and Computation, 2nd edition, Prentice Hall of India, India.
Python for Data Science

Credits : 03 L-T-P : 3-0-0
Prerequisite: Basic Knowledge on Programming
Course Objectives:
 To learn basic blocks of Python programming such as variables, datatypes, loops,
conditionals, functions etc.
 To impart skills that can enable students to approach business problems analytically by
identifying opportunities to derive business value from data.
 To provide adequate technical detail related to capturing, cleaning, and accessing data,
while emphasizing the organizational and implementation issues relevant in an organization
environment.
Unit I: Introduction to Python Environment (9 Hours)

History and development of Python, Why Python? Grasping Python’s core philosophy,
Discovering present and future development goals, Working with Python : Getting a taste of
the language, Understanding the need for indentation, Working at the command line or in the
IDE, Visualizing Power, Using the Python Ecosystem for Data Science, Accessing scientific
tools using SciPy, Performing fundamental scientific computing using NumPy, Performing
data analysis using pandas, Implementing machine learning using Scikit‐learn, Plotting the
data using matplotlib, Parsing HTML documents using Beautiful Soup, Setting Up Python
for Data Science, Getting Continuum Analytics Anaconda, Getting Enthought Canopy
Express, Getting pythonxy, Getting WinPython, Installing Anaconda on Windows, Linux and
MAC
Unit II : Data Structures, Looping and Branching (9 Hours)

Working with Numbers and Logic, Performing variable assignments, Doing arithmetic,
Comparing data using Boolean expressions, Creating and Using Strings, Interacting with
Dates, Creating and Using Functions, Calling functions in a variety of ways, Using
Conditional and Loop Statements, Making decisions using the if statement, Choosing
between multiple options using nested decisions, Performing repetitive tasks using for, Using
the while statement, Storing Data Using Sets, Lists, and Tuples : Performing operations on
sets, Working with lists, Creating and using Tuples, Defining Useful Iterators, Indexing Data
Using Dictionaries.
Unit III: Data Management (9 Hours)

Working with Real Data, Uploading small amounts of data into memory, Streaming large
amounts of data into memory, Sampling data, Accessing Data in Structured Flat‐File Form,
Sending Data in Unstructured File Form, Managing Data from Relational Databases,
Interacting with Data from NoSQL Databases, Accessing Data from the Web, Juggling
between NumPy and pandas, Validating Your Data, Removing duplicates, Manipulating
Categorical Variables, Dealing with Dates in Your Data, Dealing with Missing Data, Slicing
and Dicing: Filtering and Selecting Data, Concatenating and Transforming Working with
HTML Pages, Working with Raw Text, Working with Graph Data.
Unit IV: Data Transformation (9 Hours)

Understanding classes in Scikit‐learn, Playing with Scikit‐learn, Defining applications for
data science, Performing the Hashing Trick, Using hash functions, Demonstrating the hashing
trick, Working with deterministic selection, Considering Timing and Performance,
Benchmarking with timeit, Working with the memory profiler, Performing multicore
parallelism, Demonstrating multiprocessing.
Unit V: Python for Statistics (9 Hours)

Exploring Data Analysis, The EDA Approach, Defining Descriptive Statistics for Numeric
Data, Measuring central tendency, Measuring variance and range, Working with percentiles,
Defining measures of normality, Counting for Categorical Data, Understanding frequencies,
Creating contingency tables, Creating Applied Visualization for EDA, Inspecting boxplots,
Performing t‐tests after boxplots, Observing parallel coordinates, Graphing distributions,
Plotting scatterplots, Using covariance and correlation, Using nonparametric correlation,
Considering chi‐square for tables, Using the normal distribution, Creating a Z‐score
standardization, Transforming other notable distributions, Detecting Outliers in Data,
Clustering, Reducing dimensionality.
Course Outcome:

 Explore Python language fundamentals, including basic syntax, variables, types,
control statements and functions.
 Applying various data structures, integrate data from disparate sources, transform data
from one format to another, and program data management in relational databases.
 Create and customize plots on real data using various test and analysis of data.
 Analyze different options in Data Management and Data Transformation
 Analyzeelementary to advanced statistical methods in Python Programming
environment.
Text Book:
1. Python for Data Science for Dummies - Luca Massaron and John Paul Mueller, John
Wiley & Sons, Inc, I Edition, John Wiley & Sons, Inc.,2015
2. Python for Probability, Statistics, and Machine Learning, First Edition - José
Unpingco, Springer , 2nd Edition, Springer Publications,2019
Reference Books:
1. Python for Data Analysis - Wes McKinney, O’Reilly Media, Inc.
2. Data Science from Scratch - Joel Grus, O’Reilly Media, Inc.
Elective-I
Data Warehousing and Data Mining
Subject Code : 18DS5DE11 Total Contact Hours : 45

Credits : 03 L-T-P : 3-0-0
Course Objective:
• Be familiar with mathematical foundations of data mining tools.

• Understand and implement classical models and algorithms in data warehouses and
data mining
• Characterize the kinds of patterns that can be discovered by association rule mining,
classification and clustering.
• Master data mining techniques in various applications like social, scientific and
environmental context.
• Develop skill in selecting the appropriate data mining algorithm for solving practical
problems.
UNIT – I (9 Hours)
Data Warehouse: Introduction to Data Ware House, Differences between operational data
base systems and data Ware House, Data Ware House characteristics, Data Ware House
Architecture and its components, Extraction-Transformation-Loading, Logical
(MulitDimensional), Data Modeling, Schema Design, star and snow-Flake Schema, Fact
Constellation, Fact Table, Fully Addictive, Semi-Addictive, Non-Addictive Measures;
FactLess-Facts, Dimension Table characteristics; Fact-Less-Facts, Dimension Table
characteristics; OLAP cube, OLAP Operations, OLAP Server Architecture-ROLAP, MOLAP
and HOLAP.
UNIT -II (9 Hours)

Introduction to Data Mining: Introduction, What is Data Mining, Definition, KDD,
Challenges, Data Mining Tasks, Data Preprocessing- Data Cleaning, Missing Data,
Dimensionality Reduction, Feature Subset Selection, Discretization and Binaryzation , Data
Transformation; Measures of similarity and dissimilarity-Basics.
UNIT – III (9 Hours)

Association Rules: Problem Definition, Frequent Item Set Generation, The APRIORI
Principle, Support and Confidence Measures, Association Rule Generation, APRIORI
Algorithm, The Partition Algorithms, FP-Growth Algorithms, Compact Representation of
Frequent Item Set-Maximal Frequent Item Set, Closed Frequent Item Set.
UNIT -IV (9 Hours)

Classification: Problem definition, General Approaches to solving a classification problem,
Evaluation of Classifiers, Classification techniques, Decision trees-Decision Tree
Construction, Methods for expressing attribute test conditions, Measures for Selecting the
Best split, Algorithm for Decision tree Induction, Naïve-Bayes Classifier, Bayesian Belief
Networks; K-nearest neighbor classification-Algorithm and characteristics.
UNIT – V (9 Hours)
Clustering: Problem Definition, Clustering overview, Evaluation of clustering algorithms,
Partitioning clustering K-Means Algorithm, K-Means Additional Issues, PAM Algorithm,
Hierarchical Clustering-Algorithm- Agglomerative Methods and Divisive Methods, Basic
Agglomerative Hierarchical Clustering Algorithm, Specific techniques, Key Issues in
Hierarchical Clustering, Strengths and weakness, Outlier Detection
Course Outcome:
1. Understand the functionality of the various data mining and data warehousing component.
2 Appreciate the strengths and limitations of various data mining and data warehousing
models.
3 Explain the analyzing techniques of various data
4 Describe different methodologies used in data mining and data ware housing.
5 Compare different approaches of data ware housing and data mining with various
technologies.
TEXT BOOKS:
1) Data Mining-Concepts and Techniques- Jiawei Han, Micheline Kamber, Morgan
Kaufmann Publishers, Elsevier, 2 Edition, 2006.
2) Introduction to Data Mining, Pang-Ning Tan, Vipin Kumar, Michael Steinbanch, Pearson
Education. REFERENCES:
1) Data Mining Techniques, Arun K Pujari, 3rd Edition, Universities Press.
2) Data Ware Housing Fundamentals, Pualraj Ponnaiah, Wiley Student Edition.
Machine Learning
Credits : 03 L-T-P : 3-0-0
Prerequisite: Python Programming Language
Course Objective:
• Understand the underlying concepts about Machine Learning.
• To understand the importance of Linear Algorithms
• Understand the concepts of Non-Linear Algorithms.
• To understand the Data Preprocessing and Dimensionality Reduction, Clustering
Analysis
Unit-I: (9 Hours)
Introduction to Machine Learning:
Supervised Machine Learning, Unsupervised Machine Learning, Semi-Supervised Machine
Learning, Bias Error ,Variance Error ,Bias-Variance Trade-Off, Statistical Fit ,Overfitting in
Machine Learning, Underfitting in Machine Learning ,A Good Fit in Machine Learning ,How
To Limit Overfitting.
Unit-II: (9 Hours)
Linear Algorithms:
Linear Regression, Logistic Regression, Gradient Descent For Machine Learning, Batch
Gradient Descent, Stochastic Gradient Descent, Linear Regression Using Gradient Descent,
Logistic Regression by Stochastic Gradient Descent, Linear Discriminant Analysis,
Representation of LDA Models, Making Predictions with LDA, Preparing Data For LDA.
Unit –III: (9 Hours)

Non-Linear Algorithms:
Classification and Regression Trees, Decision Trees, CART Model Representation, Naive
Bayes, K-Nearest Neighbors, Learning Vector Quantization, Support Vector Machines,
Maximal-Margin Classifier, Soft Margin Classifier, Support Vector Machines (Kernels),
Training SVM With Gradient Descent ,Learn an SVM Model from Training Data, Make
Predictions with SVM Model.
Unit IV: (9 Hours)

Data Preprocessing and Dimensionality Reduction, Clustering Analysis
Dealing with missing data ,Handling categorical data, Partitioning a dataset in training and
test sets, Bringing features onto the same scale , Selecting meaningful features , Assessing
feature importance with random forests, Unsupervised dimensionality reduction via principal
component analysis , Supervised data compression via linear discriminant analysis , Using
kernel principal component analysis for nonlinear mappings, Grouping objects by similarity
using k-means ,Organizing clusters as a hierarchical tree ,Locating regions of high density via
DBSCAN.
Unit V: (9 Hours)
Time Series Analysis and Forecasting:
Time Series Patterns, Horizontal Pattern, Trend Pattern, Seasonal Pattern, Forecast Accuracy,
Moving Averages and Exponential Smoothing, Moving Averages, Weighted Moving
Averages, Exponential Smoothing, Trend Projection, Linear Trend Regression,
Holt’s Linear Exponential Smoothing, Nonlinear Trend Regression, Seasonality and Trend,
Seasonality Without Trend, Seasonality and Trend, Models Based on Monthly Data, Time
Series Decomposition ,Calculating the Seasonal Indexes, Deseasonalizing the Time Series
,Using the Deseasonalized Time Series to Identify Trend.
Course Outcomes:
On successful completion of the course, students will be able to,
• Examine with many of the Introduction Concepts.
• Demonstrate about importance of Linear and Non-Linear Algorithms
• Examine with Data Preprocessing, Clustering Analysis
• Experiment with Time Series Analysis and Forecasting
Text Books:
1. Master Machine Learning Algorithms by Jason Brownlee

2. Statistics for Business and Economics by Anderson, Sweeney and Williams
3. Deeper Insights into Machine Learning by BIRMINGHAM(Packt)
Reference Books:
1. Using Multivariate Statistics - Barbara G. Tabachnick, Linda S. Fidell, Pearson

2. Introduction to Machine Learning - Ethem Alpaydm, The MIT Press
Computer Networks
Subject Code : 18CS4CMO1 Total Contact Hours : 45
Credits : 03 L-T-P : 3-0-0
Prerequisite: Basic Knowledge on Operating System Concepts.
Course Objectives:
● Build an understanding of the fundamental concepts of computer networking.
● Familiarize the student with the basic taxonomy and terminology of the computer
networking area.
● Acquire knowledge on the various networking devices.
● To emphasize on the protocols, standards and the models associated with networking
technology.
● To introduce how the troubleshooting mechanisms work in networks.
Unit-I:
(8 Hours)
Introduction
Uses of Computer Networks, Network Hardware, Network Software, Reference Models,
Network Standardization, Metric Units.
Unit-II:
(9 Hours)
The Physical Layer
The basis for Data communication, Guided Transmission Media, Wireless Transmission,
Communication Satellites, Digital Modulation and Multiplexing, The Public Switched Telephone
Network, The Mobile Telephone System, Cable Television.
Unit –III:
(9 Hours)
The Data Link Layer
The Datalink layer design issues, Error Detection and Correction, Elementary Datalink
Protocols, Sliding Window Protocols, Datalink Protocols.
Unit IV:
(10 Hours)
The Medium Access Control Sublayer and Network Layer
The Medium Access Control Sublayer: The channel allocation problem, Multiple Access
Protocols, Ethernet, Wireless LANs, Broadband Wireless, Bluetooth, RFID, Datalink Layer
Switching.
Network Layer: Network Layer Design Issues, Routing Algorithms.
Unit V:
(9 Hours)
The Transport and Application Layer
Transport Layer: The Transport Service, Elements of Transport Protocols.
Application Layer:DNS System, Electronic Mail, The World Wide Web.
Course Outcomes:
After the successful completion of course, students will be able to,
● Independently understand basic computer network technology.

● Enumerate the layers of the OSI model and TCP/IP and explain the functions of each
layer.
● Identify the design issues, perform error detection and correction.
● Apply the various routing algorithms for the different networks designs.
● Understand the various protocols used in respective layers of OSI reference model.
TEXT BOOKS:
1. Andrew S. Tanenbaum, “Computer Networks”, Pearson, Fourth Edition, 2010.
REFERENCES:
1. Behrouz A. Forouzan, “Data communication and Networking”, Tata McGraw- Hill,
Fourth Edition 2011.
2. William Stallings, “Data and Computer Communication”, Eighth Edition, Pearson
Education, 2008.
Big Data Analytics

Credits : 03 L-T-P : 3-0-0
Prerequisite: Basic Knowledge about of information technology, programming concepts and

DBMS
Course Objectives:
• To understand the basic concept of BigData
• To understand architecture of Hadoop and YARN
• To understand internal concept of MapReduce
• To understand the concept of Master and Slave Architecture
PART-A
Unit I (8 hours)
Understanding Big Data :Defining Data, Types of Data, Structured Data, Semi
Structured Data, Unstructured Data, How data being Generated, Different source of Data
Generation, Rate at which Data is being generated, Different V’s, Volume, Variety, Velocity,
Veracity, Value, How single person is contributing towards BigData, Significance for
BigData, Reason for BigData, Understanding RDBMS and why it is failing to store BigData.
Future of BigData, BigData use cases for major IT Industries.
Unit II (10 hours)

Introduction to Hadoop: What is Hadoop, Apache Community, Cluster, Node, Commodity
Hardware, Rack Awareness, History of Hadoop, Importance of Hadoop, Understanding
Hadoop Ecosystem, Hadoop Architecture, Hadoop Framework, Master- Slave Architecture,
Name Node, Secondary Name Node, Job Tracker, Task tracker, Data Node.
Storage Unit: Hadoop Distributed File System, How files are stored in HDFS, Replication
factor, FS Image, Edit-logs, Check-pointing Concept, HDFS federation, HDFS High
availability, Architectural description for Hadoop Cluster, When to use or not to use HDFS,
Block Allocation in Hadoop Cluster, Read operation in HDFS, Write operation in HDFS,
Advantages of Hadoop
Unit III (8 hours)

Processing Unit:What is MapReduce, History of MapReduce, How does MapReduce works,
Input files, Input Format types Output Format Types, Input split, Record Reader, MapReduce
overview, Mapper Phase, Reducer Phase, Sort and Shuffle Phase, Importance of MapReduce,
Counters, Combiner Function, Partition Function, Joins, Map Side Join, Reduce Side Join,
Job Scheduling, Task Scheduling, Fault Tolerance, Writing MapReduce Application, Driver
Class, Mapper Class, Reducer Class, Writing a simple MapReduce program to Count
Number of words.
Unit IV: (10 hours)
YARN:YARN, YARN Architecture, YARN Components, Resource Manager, Node
Manager, Application Master, Concept of Container, Difference between Hadoop 1.x and 2.x
Architecture, Execution of Job in Yarn Cluster, Different modes of Hadoop, Standalone
Mode, Pseudo Distributed Mode, Fully Distributed Modes, Comparing and Contrasting
Hadoop with Relational Databases.
Apache Pig:Apache Pig, Pig Architecture, Different modes, Local Mode and MapReduce
Mode, Features of Apache Pig, Significance, History, Difference between Pig and
MapReduce, Pig Data Types, Simple Data Types, Complex Data Types, Map, Bag, Tuple,
Loading and Storing data, Different Operations in pig, Filtering, Grouping, User Defined
Function.
Unit V: (9 hours)
Apache Hive: Apache Hive, Hive Architecture, Different modes to Load Data, Features of
Apache Hive, HQL, History of Apache Hive, Hive Data Types, Managed Table, External
Table, Partitioned Table, Buckets, Importing Data, Creating and Altering Table, Joins.
Apache Sqoop & Flume: Apache Sqoop, Sqoop Architecture, Sqoop Features, Need for
Apache Sqoop, Import Function, Export Function, Import to Hive, Apache Flume, Flume
Architecture, Features of Apache Flume, Need for Apache Flume, Source, Sink, Channel .
Course Outcome:
• Understand the concept of BigData and Hadoop
• Understand the internals of MapReduce and YARN
• Write MapReduce job for word count
• Create one node Hadoop cluster
Text Books:
1. Hadoop: The Definitive Guide, By: Tom White, O’REILLY.
Reference Book:
1. Hadoop for Dummies, By: Dirk deRoos, Paul C. Zikopoulos, Bruce Brown, Rafael
Coss, and Roman B. Melnyk, A Wiley brand.
2. Hadoop in Action, Writer: Chuck Lam Published By: Manning Publications
Design and Analysis of Algorithms Lab
Subject Code : 18CSI401L

Credits : 02 L-T-P : 0-0-4
Course objectives:
This course will enable students to,
• Design and implement various algorithms in JAVA
• Employ various design strategies for problem solving.
• Measure and compare the performance of different algorithms.
Description:
Design, develop, and implement the specified algorithms for the following problems using Java language under
LINUX/Windows environment. Netbeans/Eclipse IDE tool can be used for development and demonstration.
Lab Exercise 1
A Create a Java class called Student with the following details as variables within it. (i) USN (ii) Name (iii)
Branch (iv) Phone no. Write a Java program to create nStudent objects and print the USN, Name, Branch, and
Phone no. of these objects with suitable headings.
B Write a Java program to implement the Stack using arrays. Write Push(), Pop(), and Display() methods to
demonstrate its working.
Lab Exercise 2
A. Write a Java program to read two integers a and b. Compute a/b and print, when b is not zero. Raise an
exception when b is equal to zero.
B. Write a Java program that implements a multi-thread application that has three threads. First thread generates
a random integer for every 1 second; second thread computes the square of the number and prints; third thread
will print the value of cube of the number.
Lab Exercise 3
Print all the nodes reachable from a given starting node in a digraph using BFS an DFS method
Lab Exercise 4
Sort a given set of elements using the quick sort method and determine the time required to sort the elements.
Repeat the experiment for different values of n, the number of elements in the 1st to be sorted and plot a graph
of the time taken versus n. The elements can be read from a file or can be generated using the random number
generator.
Lab Exercise 5
Implement merge sort algorithm to sort a given set of elements and determine the time required to sort the
elements. Repeat the experiment for different values of n, the number of elements in the list to be sorted and
plot a graph of the time taken versus n. The elements can be read from a file or can be generated using the
random number generator
Lab Exercise 6
Find Minimum Cost Spanning Tree of a given connected undirected graph using Kruskal's algorithm and Prim's
algorithm.
Lab Exercise 7
From a given vertex in a weighted connected graph, find shortest paths to other vertices using Dijkstra's
algorithm. Write the program in Java.
Lab Exercise 8
Implement in Java, the 0/1 Knapsack problem using Greedy method and Dynamic Programming method
Lab Exercise 9
Write Java programs to Implement Travelling Sales Person problem using Dynamic programming
Lab Exercise 10
Write a Java program to Implement All-Pairs Shortest Paths problem using Floyd's algorithm.
Lab Exercise 11
Design and implement in Java to find a subset of a given set S = {Sl, S2,.....,Sn} of n positive integers whose
SUM is equal to a given positive integer d. For example, if S ={1, 2, 5, 6, 8} and d= 9, there are two solutions
{1,2,6}and {1,8}. Display a suitable message, if the given problem instance doesn't have a solution.
Lab Exercise 12
Design and implement in Java to find all Hamiltonian Cycles in a connected undirected Graph G of n vertices
using backtracking principle.
Course Outcomes: The students should be able to,

• Design algorithms using appropriate design techniques (brute-force, greedy, dynamic programming, etc.)
• Implement a variety of algorithms such as sorting, graph related, combinatorial, etc., in a high level language.
• Analyze and compare the performance of algorithms using language features.
• Apply and implement learned algorithm design techniques and data structures to solve real world problems.
Principles of Operating Systems

Credits : 02 L-T-P : 2-0-0
Prerequisite: Knowledge on basics of ICT
Course Objectives:
• To understand the concepts of Design techniques, process management, and processor
scheduling;
• To learn the resource management problems and solutions using deadlocks, memory
management, secondary memory management, file management;
• To gain the knowledge of I/O systems, and protection in Unix systems.
• Gain knowledge of basic UNIX/Linux commands from the command line (from a terminal
window);
• Organize and manage their files within the UNIX file system
Unit I: (7 Hours)
Operating System Concepts: Operating System Classification- Simple Monitor, Multi

Programming, Time Sharing, Real Time Systems, Multiprocessor Systems, Batch Processing,
Simple User, Multi User, Operating System Functions and Characteristics.
Process Management: Process Overview, Process States, Process State Transitions, Process Control
Block, Operations on Processes, Suspend and Resume, Interrupt Processing, Scheduling Algorithms,
Multiple Processor Scheduling.
Unit II: (7 Hours)
Deadlock: Deadlock Problem, Deadlock, Deadlock Characterization, Necessary Conditions,

Deadlock Prevention, Deadlock Avoidance, Deadlock Detection, Recovery from Deadlock.
Memory Management: Partition, Paging, Segmentation, Types Of Memory Management Scheme,
Bare Machine, Resident Monitor, Swapping, Multiple Partition, Virtual Memory, Demand Paging.
Unit III: (6 Hours)

File Management: File Types, Operation On Files, File Support, Access Methods, Sequential
Access, Direct Access, Index, Allocation Method (Free Space Management, Contiguous, Linked,
Indexed), Directory System Single-Level, Two-Level, Tree-Structured, File Protection.
Unit IV: (4 Hours)

Vi Editor: Introduction to Text Processing, Command & edit Mode, Invoking vi, deleting &
inserting Line, Deleting & Replacing Character, Searching for Strings, Yanking, Running Shell
Command Macros, Set Window, Set Auto Indent, Set No. Communicating with Other Users: who,
mail, wall, send, mesg.
.
Unit V: (6 Hours)
Shell programming-I: Introduction – Need for Scripts – Creating and Calling the Script – The
Shebang – Different ways of running a script - Using variables in Script – Reading Input – Integer
Variables – Arithmetic Expressions – Read-only variables –
Exporting variables – Arrays - Control Statements : If, Then, Else, While and Until, Classic For,
Break and Continue, Case – Handling Script Parameters : Shift, Getopts – Shell Functions –
Handling Conditional expression patterns and Regular expressions in scripts.
Course Outcomes:
1. Master the features of the operating system functions, structures, and design issues
associated with operating systems.
2. Handle the various process management issues including scheduling, synchronization,
deadlocks and multithreading.
3. Apply the concepts of memory management including virtual memory; resource sharing
among the users; and Process scheduling techniques to solve the real world problems.
4. Solve the problems related to file system interface and implementation, disk management
and protect the system.
5. Use UNIX tools using features such as filters, pipes, redirection, and regular expressions
Customize their UNIX working environment
Text Books:
1. James L. Peterson And Abraham Silberschatz, “Operating System Concepts”, Addison
Wesley Publishing Company.
2. H.M.Deitel, “Operating Systems”, Addison Wesley Publishing Company.
Reference Books:
1. M.G. Venkatesh Murthy: UNIX & Shell Programming, Pearson Education.
2. Richard Blum , Christine Bresnahan : Linux Command Line and Shell Scripting Bible, 2
ndEdition , Wiley,2014.
3. A. Silberschatz, P.B. Galvin and G. Gagne, “Operating System Concepts, (6th or Newer
Edition) Wiley.
Design and Analysis of Algorithms
Subject Code : 18CSI401 Total Contact Hours : 45

Credits : 03 L-T-P : 3-0-0
Prerequisite:
1. Problem Solving Skills
2. Data Structures
Course Objectives:
This course focuses on understanding of various algorithm design techniques like Divide and Conquer,
Greedy Method, Dynamic Programming, Backtracking and Branch and Bound with several examples
rather than individual algorithms. Students will be emphasized on asymptotic analysis in measuring
algorithms running time. Also enlighten the students to a good program structure and its correctness.
UNIT: 1 Introduction to Algorithms and Elementary Data Structures 10Hrs
What is an Algorithm? Algorithm Specification, Performance Analysis: Space complexity, Time

complexity. Asymptotic Notations: Big-Oh notation (O), Omega notation (Ω), Theta notation (Θ).
Introduction to Randomized algorithms. Stacks and queues, trees, Dictionaries: Binary search tree,
AVL tree, Cost amortization. Priority queue, sets and disjoint set union, graphs
UNIT : 2 Basic Traversal, Search Techniques and Divide and Conquer 09Hrs
Techniques for binary trees, techniques for graphs: breadth first search and traversal, depth first search
and traversal, connected components and spanning trees, biconnected components and DFS.
General method of divide and conquer, Binary search, Finding the maximum and minimum, Merge
sort, Quick sort Strassen’s matrix multiplication. Advantages and Disadvantages of divide and
conquer.
UNIT : 3 Greedy Method 08Hrs
General method, Knapsack Problem, Job sequencing with deadlines, minimum cost spanning trees:
Prim's Algorithm, Kruskal's Algorithm. single source shortest paths.
UNIT : 4 Dynamic Programming 09Hrs
General method, Multistage Graphs, Single source shortest paths: Dijkstra's Algorithm, All Pairs
Shortest Paths: Floyd's Algorithm, Optimal Binary Search Trees, Knapsack problem, Bellman-Ford
Algorithm, Travelling Sales Person problem.
UNIT : 5 Backtracking, Branch and Bound 09Hrs
General method of backtracking, N-Queens problem, Sum of subsets problem, Graph coloring,
Hamiltonian cycles, Knapsack problem.
General method of Branch and Bound, 0/1 Knapsack problem: LC Branch and Bound solution, FIFO
Branch and Bound solution, Travelling Sales Person problem, NP-Hard and NP-Complete problems:
Basic concepts.
Text Books:
1. Fundamentals of computer Algorithms, Ellis Horowitz, Satraj Sahni and Rajasekaran, 2nd
Edition, 2014, Universities Press
2. Introduction to the Design and Analysis of Algorithms, Anany Levitin: 2nd Edition, 2009.
Pearson.
Reference Books:
1. Introduction to Algorithms, Thomas H. Cormen, Charles E. Leiserson, Ronal L. Rivest, Clifford

Stein, 3rd Edition, PHI
2. Design and Analysis of Algorithms, S. Sridhar, Oxford (Higher Education)
Course Outcomes:
Sl. Course Description Bloom’s

No Outcome Taxonomy Level
.
1. CO 1 To understand the process of designing and analyzing an

algorithm through basic problem types and asymptotic Understand(2)
notations.
2. CO 2 Identify the key characteristics of a given problem, Applying (3)
suitable design approach and its impact on performance
CO 3 Design an algorithm through appropriate design Applying (3)
3. strategy to solve the real time problems
4. CO 4 Evaluate the correctness of the algorithm through valid Analyzing (4)

and invalid inputs
5. CO 5 Analyze the space and time efficiency of the algorithm Analyzing (4)
6. CO 6 Implement the algorithm using appropriate design Applying (3)

strategies for problem solving.
Introduction to Data Science
Subject Code : 18CS3DS01 Total Contact Hours :45

Credits : 03 L-T-P : 3-0-0
Prerequisite: Fundamentals of statistics and problem solving skills.
Course objectives:
• To understand the overview and definition of Data Science with its crucial role in
current business world.
• To understand the importance of mathematics & Statistics in Data Science.
• To understand the role of machine learning techniques in Data Science and its different
types.
• To know the integrated role of computers and its components in Data Science
• To understand the flow and process model of data science project management.
Unit I: Data Science - An Overview 8 Hours
Introduction to Data Science, Definition and description of Data Science, history and
development of Data Science, terminologies related with Data Science, basic framework and
architecture, difference between Data Science and business analytics, importance of Data
Science in today’s business world, primary components of Data Science, users of Data Science
and its hierarchy, overview of different Data Science techniques, challenges and opportunities
in business analytics, different industrial application of Data Science techniques.
Unit II: Mathematics and Statistics in Data Science 10 Hours

Role of mathematics in Data Science, importance of probability and statistics in Data Science,
important types of statistical measures in Data Science : Descriptive, Predictive and
prescriptive statistics, introduction to statistical inference and its usage in Data Science,
application of statistical techniques in Data Science, overview of linear algebra : matrix and
vector theory, role of linear algebra in Data Science, exploratory data analysis and visualization
techniques, difference between exploratory and descriptive statistics, EDA and visualization
as key component of Data Science.
Unit III: Machine Learning in Data Science 9 Hours

Role of machine learning in Data Science, different types of machine learning techniques and
its broad scope in Data Science: Supervised, unsupervised, reinforcement and deep learning,
difference between different machine learning techniques, brief introduction to machine
learning algorithms, importance of machine learning in today’s business, difference between
machine learning classification and prediction.
Unit IV: Computers in Data Science 9 Hours

Role of computer science in Data Science, various components of computer science being used
for Data Science, role of relation data base systems in Data Science: SQL, NoSQL, role of data
warehousing in Data Science, terms related with data warehousing techniques, importance of
operating concepts and memory management, various freely available software tools used in
Data Science : R, Python, important proprietary software tools, different business intelligence
tools and its crucial role in Data Science project presentation.
Unit V: Data Science Project Management 9 Hours

Data Science project framework, execution flow of a Data Science project, various components
of Data Science projects, stakeholders of Data Science project, industry use cases of Data
Science implementation, challenges and scope of Data Science project management, process
evaluation model, comparison of Data Science project methods, improvement in success of
Data Science project models.
Text books:
1. Data Science from Scratch: First Principles with Python 1st Edition by Joel Grus
2. Principles of Data Science by Sinan Ozdemir, (2016) PACKT.
Reference Books:
1. Data Science For Dummies by Lillian Pierson (2015)

2. Data Science for Business: What You Need to Know about Data Mining and Data-
Analytic Thinking by Foster Provost, Tom Fawcett
3. Data Smart: Using Data Science to Transform Information into Insight 1st Edition by
John W. Foreman. (2015) Wiley Publication.
Course outcomes:
• After completing this course, students will be able to appreciate the need of Data
Science in day to day life.
• They will be able to understand the process and components of Data Science project.
• Student will the Learn importance of probability and statistics in Data Science
• Student will be able to understand the machine learning in today’s business world.
• Understands the various components of computer science being used for Data Science
• Student will bale to understand the execution flow of a Data Science project
Artificial Neural Networks and Deep Learning
CREDITS: 03
SEMESTER: 07 L:T:P – 3:0:0
Course Objective:
1. To understand the importance of neural network system and its components and to understand
the neural network learning and adaptation.
2. To get the knowledge of associative memory in retrieving information from data
3. To gain the knowledge of deep learning techniques for images, audio, and text
4. To understand the working process of genetic algorithm as optimizer
Course Outcomes:
CO1 Explain the concept of Single layer perceptron model in ANN.

CO2 Discuss the concepts of Genetic algorithm as optimizer
CO3 Demonstrate the back propagation algorithm and various types of Associative Memory Network
CO4 Examine the performance of various architectures of CNN for images.
CO5 Examine Deep learning models such as such as RNN, LSTM and GAN to sequences on various
types of image-based datasets.
CO6 Recommend a suitable solution after understanding the problem of Speech Recognition.
CO-PO MAPPING

CO1. 3 2 2 1 1 1 1 1 1 2 2 2
CO2. 3 2 2 1 1 1 1 2 2 1
CO3. 3 3 2 1 1 1 1 1 1 2 2 2
CO4. 3 3 3 3 3 3 2 2 3 2 3 3
CO5. 3 3 3 3 3 3 2 2 3 2 3 3
CO6. 3 3 3 3 3 3 2 2 3 2 3 3
Single layer feed forward Network: Single layer feedforward NN: Single layer perceptron- Classification model,
feature and decision regions- Discriminant function- Non-Parametric Training Concept- Training and classification
using discrete perceptron algorithm- Perceptron convergence theorem- Single layer Continuous perceptron
network for linearly separable classification.
Multilayer feedforward Network: Multilayer feedforward NN: generalized delta learning rule- delta learning rule
for multiperceptron layer- Backpropagation- Algorithm for error back propagation- Kolmogorov’s theorem.
Associative Memory Network: Algorithm for pattern association- Delta rule- Hetero Associative memory Neural
Network- Auto associative memory network- Recurrent linear Auto Associator-Bidirectional Associative Memory-
Linear Associator – Storage Algorithm
Deep Learning for images: Image Classification: The data-driven approach -K-nearest neighbor -Linear
Classification. Convolutional Neural Networks: History -Convolution and pooling -ConvNets outside vision. Training
Neural Networks: Activation functions- initialization- dropout- batch normalization-Update rules- ensembles- data
augmentation- transfer learning. CNN Architectures: AlexNet- VGG- GoogLeNet- ResNet.
UNIT- IV [9 HOURS]
Deep learning for sequences: RNN and Backpropagation- Generating names with RNNs-Modern RNNs-How to use
RNNs- LSTM, GRU models- Application to NLP- Application to Speech recognition. Application of ANN: Unsupervised
representation learning: Linear factor model- Autoencoder-Word Embeddings: Generative adversarial networks:
Representation Learning- Structured probabilistic model for Deep learning- Monte Carlo Methods- Deep generative
models- Application of Neural Network
UNIT- V [9 HOURS]
Introduction To Genetics-Based Deep learning: Introduction-The rise of Genetic Algorithm – working of Genetic
Algorithm -Genetic Algorithm application of Historical Interaction- Robustness of Traditional Optimization and
Search methods – Goals of optimization- Genetic Algorithm versus Traditional methods – Simple Genetic Algorithm
-genetic based deep learning-Current applications of Genetic Algorithm
TEXT BOOKS
1. Neural Networks and Deep Learning: A TextbookBy Charu C. Aggarwal, Springer International Publishing,
2018
2. Nature-Inspired Optimization Algorithms by Xin-She Yang, Elsevier Science, 2014
REFERENCES
1. An introduction to neural networks by Kevin Gurney, CRC press, 2018
2. Evolutionary Optimization Algorithms by Dan Simon, Wiley, 2013

Syllabus

Uploaded by

Document Information

Original Title

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

Syllabus

Uploaded by

Copyright:

Available Formats

Scanned by CamScanner

Subject code: 18ESCS01 Total hours: 45

Subject Code:18HSS01 Total Hours: 45

Unit 2: Basic Writing Skills

Unit 4: Listening Comprehension

Unit 5: Reading comprehension & Oral Communication

Reference Books:(i) Practical English Usage. Michael Swan. OUP. 1995.

Knowledge level Attainment level Comments

Subject Code 18HSS01 Semester Knowledge

Implement their public speaking skills with correct pronunciation and

CO3 Define written comprehension

CO4 Acquire their listening comprehension skills by practicing active listening L3

Subject Code 18HSS01 Semester I

Course title : Basic Electrical Engineering (Theory & Lab.)

Module 1 : DC Circuits (10 hours)

Module 2: AC Circuits (10 hours)

Module 3: Transformers (9 hours)

Module 4: Electrical Machines (9 hours)

Generation of rotating magnetic fields, Construction and working of a three-phase induction

Module 5: Electrical Installations (7 hours)

• To understand and analyze basic electric and magnetic circuits

• To study the working principles of transformers and rotating electrical machines

• To introduce the components of low voltage electrical installations

Subject : 18ESCEE02 - BASICS OF ELECTRICAL ENGINEERING

01 Electrical circuit elements (R, L and C circuits 2.00

02 voltage and current sources 1.00

03 Kirchhoff’s current law 1.00

05 Analysis of simple circuits with dc excitation 1.00

06 Time-domain analysis of first-order RL circuits 1.00

07 Time-domain analysis of first-order RC circuits 1.00

01 Introduction to AC circuits, Representation of sinusoidal waveforms 1.00

03 Phasor representation, real power, reactive power 1.00

04 Apparent power, power factor 1.00

05 Analysis of Ac series circuits 1.00

06 Analysis of Ac parallel circuits 1.00

07 Resonance in series and parallel circuits 1.00

08 Analysis of three phase balance circuits 1.00

09 voltage and current relations in star connection 1.00

10 voltage and current relations in delta connection 1.00

01 Magnetic materials used in transformers 1.00

Page 1 of 3 Printed on : 06/08/2018 10:21:17

Subject : 18ESCEE02 - BASICS OF ELECTRICAL ENGINEERING

02 Study of BH characteristics 1.00

03 Self and mutual inductance, Numerical problems 1.00

04 Concept and construction of Ideal and practical transformer 1.00

05 Equivalent circuit of a single phase transformer 1.00

Losses in transformers, Regulation and efficiency of a single phase

08 Three-phase transformer connections 1.00

Module 04 Electrical Machines 10

01 Introduction to Induction motors, Generation of rotating magnetic fields 1.00

02 Construction and working of a three-phase induction motor 1.00

03 Significance of torque-slip characteristic 1.00

04 Loss components and efficiency 1.00

05 Starting of three phase induction motors 1.00

06 Speed control of 3 phase induction motor 1.00

07 Single-phase induction motor. Construction, working 1.00

08 Torque-speed characteristics 1.00

09 Speed control of separately excited dc motor 1.00

10 Construction and working of synchronous generators 1.00

Module 05 Electrical Installations 7

01 Types of switches, two way and three way connections 1.00

02 Components of LT Switchgear 1.00

Page 2 of 3 Printed on : 06/08/2018 10:21:17