0% found this document useful (0 votes)

12 views

BoS CSE for Revision of Syllabus - B.tech - 26.07.2023

Uploaded by

manojkumarkunchala2

We take content rights seriously. If you suspect this is your content, claim it here.

Available Formats

Download as PDF, TXT or read online on Scribd

0% found this document useful (0 votes)

12 views

BoS CSE for Revision of Syllabus - B.tech - 26.07.2023

Uploaded by

manojkumarkunchala2

We take content rights seriously. If you suspect this is your content, claim it here.

Available Formats

Download as PDF, TXT or read online on Scribd

You are on page 1/ 182

B.

TECH COURSE IN COMPUTER SCIENCE AND ENGINEERING

(FOR THE STUDENTS ADMITTED IN 2023-24)

DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING

RAJIV GANDHI UNIVERSITY OF KNOWLEDGE TECHNOLOGIES
ANDHRA PRADESH
CONTENTS
S.No Chapter Title
1 1 General, Course Structure, Theme and Semester-wise credit
distribution
2 2 Detailed Syllabus of 4-year Curriculum
(i) Basic Science Courses
Engineering Physics
Engineering Physics Lab
Calculus and Linear algebra
Discrete Mathematics
Probability and Statistics
(ii) Engineering Science Courses
Engineering Graphics and Computer Drafting
Basic Electrical and Electronics Engg.
Basic Electrical and Electronics Engg. Lab
Problem Solving and Programming through C
Problem Solving and Programming through C Lab
Digital Logic Design
Digital Logic Design Lab
(iii) Humanities and Social Sciences including Management
Courses
English Lab-I
English Lab-II
English Lab-III
Managerial Economics and Financial Analysis
Introduction to Operational Research
Community Service
(iv) Mandatory Courses
Indian Constitution
Environmental Science
Career Development Course
(v) Program Core Courses
Data Structures
Data Structures Lab
Design and Analysis of Algorithms
Object Oriented Programming Through Java
Design and Analysis of Algorithms Lab
Object Oriented Programming Through Java Lab
Computer Organization and Architecture
Database Management Systems
Formal Languages and Automata Theory
Data Science with Python
Web Technologies
Computer Organization and Architecture Lab
Data Science with Python Lab
Database Management Systems Lab
Web Technologies Lab
Compiler Design
Computer Networks
Software Engineering
Operating Systems
Computer Networks Lab
Software Engineering Lab
Operating Systems Lab
Artificial Intelligence
Cryptography and Network Security
Machine Learning
(vi) Professional Elective Courses
Elective - I Pool
Data Mining and Warehousing
Mobile Application Development
Distributed Computing
Advanced Computer Architecture
Advanced JAVA
Object Oriented Analysis and Design
Elective - II & III Pool
Big Data Analytics
Distributed Operating Systems
Real Time Operating Systems
Embedded Systems
Digital Image Processing
Information Retrieval
Software Testing
Mobile Computing
Data Compression
Computer Graphics
Blockchain Technology
Elective - IV & V Pool
Unix Shell Programming
Deep Learning
VLSI
Optimization Techniques
Design Patterns
Cloud Computing
Internet of Things
Natural Language Processing
Computer Vision
Cyber Security
Elective - VI Pool
Human Computer Interaction
Bioinformatics
Applied Graph Theory
Software Reliability
Information Security
Soft Computing
Robotics
Digital Speech Processing
Social Networks
Open Elective Courses
Data Science with Python
Data Structures
Object Oriented Programming through Java
Web Technologies
Database Management Systems
Machine Learning
Artificial Intelligence
Blockchain Technology
Unix Shell Programming
Cloud Computing
Internet of Things
Natural Language Processing
Human Computer Interaction
Information Security
Big Data Analytics
Digital Image Processing
Computer Vision
Computational Science and Engineering with Python
(vii) Seminars/Mini Projects/Projects
Mini Project
Summer Internship
Project-I
Project-II & Dissertation

Chapter-1
General, Course structure, Theme and Semester-wise credit distribution
A. Definition of Credit:
1 Hour Lecture (L) per week 1 Credit
1 Hour Tutorial (T) per week 1 Credit
3 Hours Practical (P) per week 1.5 Credits
B. Total number of credits: 161
C. Minimum number of Contact Hours/weeks per semester: 15 weeks of teaching
1. For 1 credit course: 15 Contact Hours per semester
2. For 2 credit course: 30 Contact Hours per semester
3. For 3 credit course: 45 Contact Hours per semester
4. For 4 credit course: 60 Contact Hours per semester

D. Course code and definition, Abbreviations

Course code Definitions
L Lecture
T Tutorial
P Practical
ESC Engineering Science Course
Humanities and Social Science including
HSMC
Management Science Course
OEC Open Elective Course
MC Mandatory Course
PCC Program Core Course
PEC Professional Elective Course
BSC Basic Science Course
PR Mini project/Project

E. Structure of Program

Notations:
E1S1: Engineering first year first semester
E1S2: Engineering first year second semester
E2S1: Engineering second year first semester
E2S2: Engineering second year first semester
E3S1: Engineering third year first semester
E3S2: Engineering third year second semester
E4S1: Engineering fourth year first semester
E4S2: Engineering fourth year second semester
Summer Internship: Summer Internship program

G. Codes:

NAME OF DEPARTMENT CODE

CHEMICAL CH

CIVIL CE

CSE CS

ECE EC

MECHANICAL ME

MME MM
CHEMISTRY CH

PHYSICS PY

MATHEMATICS MA

ENGLISH EG

MANGEMENT BM

BIOSCIENCE BE
CHAPTER – 2
SEMESTER-WISE STRUCTURE OF CURRICULUM
Mandatory Induction Program
3 Weeks Duration
1. Physical activity
2. Creative Arts
3. Universal Human Values
4. Literary
5. Proficiency Modules
6. Lectures by Eminent people
7. Visit to local areas
8. Familiarization of Dept./Branch Innovations

ENGINEERING FIRST YEAR: SEMESTER-1

Sl. Course Course Hours per week

Course Title Credits
No. Type Code L T P

1 BSC 23MA1102 Calculus & Linear Algebra 3 1 0 4

Basic Electrical and Electronics

2 ESC 23EE1109 3 1 0 4
Engg.

Problem Solving and

3 ESC 23CS1101 3 1 0 4
Programming Through C

Engineering Graphics and

4 ESC 23ME1214 1 0 3 2.5
Computer Drafting

English Language
5 HSMC 23EG1181 0 0 3 2.5
Communications Skills Lab-I

Basic Electrical and Electronics

6 ESC 23EE1189 0 0 3 1.5
Engg. Lab

Problem Solving and

7 ESC 23CS1181 0 0 3 1.5
Programming Through C Lab

8 MC 23HS1102 Indian Constitution 2 0 0 0

Total 12 3 12 20

ENGINEERING FIRST YEAR:SEMESTER-2

Hours per week
Sl. Course Course Credits
Course Title
No. Type Code
L T P
1 BSC 23MA1202 Discrete Mathematics 3 1 0 4
2 BSC 23PY1201 Engineering Physics 3 1 0 4
Managerial Economics and
3 HSMC 23BM1201 Finance Analysis
3 0 0 3
23CS1201 Object Oriented Programming 3 1 0 4
4 PCC
through Java
5 PCC 23CS1202 Data Structures 3 0 0 3
6 BSC 23PY1281 Engineering Physics Lab 0 0 3 1.5
23CS1281 Object Oriented Programming 0 0 3 1.5
7 PCC through Java Lab
8 PCC 23CS1282 Data Structures Lab 0 0 3 1.5
9 MC 23BE1201 Environmental Science 2 0 0 0
Total 17 3 9 21.5

ENGINEERING SECOND YEAR: SEMESTER-1

Sl. Course Course Hours per week
Course Title Credits
No. Type Code L T P
Probability and Statistics
1 BSC 23MA2102 3 1 0 4

2 ESC 23EC2110 Digital Logic Design 3 0 0 3

3 PCC 23CS2101 Design & Analysis of Algorithms 3 1 0 4

4 PCC 23CS2102 Database Management Systems 3 0 0 3

Formal Languages & Automata

5 PCC 23CS2103 3 0 0 3
Theory
Design & Analysis of Algorithms
6 PCC 23CS2181 0 0 3 1.5
Lab
7 ESC 23EC2180 Digital Logic Design Lab 0 0 3 1.5
Database Management Systems
8 PCC 23CS2182 0 0 3 1.5
Lab
Total 15 2 9 21.5

ENGINEERING SECOND YEAR:SEMESTER-2

Sl. Course Course Hours per week
Course Title Credits
No. Type Code L T P
Introduction to Operation
1 HSMC 23BM2202 3 0 0 3
Research
Computer Organization &
2 PCC 23CS2201 3 0 0 3
Architecture
3 PCC 23CS2202 Data Science with Python 3 0 0 3
4 PCC 23CS2203 Web Technologies 3 0 0 3
5 PCC 23CS2204 Compiler Design 3 0 0 3
Computer Organization &
6 PCC 23CS2281 0 0 3 1.5
Architecture Lab
7 PCC 23CS2282 Data Science with Python Lab 0 0 3 1.5
8 PCC 23CS2283 Web Technologies Lab 0 0 3 1.5
Total 15 0 9 19.5

ENGINEERING THIRD YEAR:SEMESTER-1

Sl. Course Course Hours per week
Course Title Credits
No. Type Code L T P
1 PCC 3 0 0 3
23CS3101 Operating Systems
2 PCC 23CS3102 Computer Networks 3 0 0 3
3 PCC 23CS3103 Software Engineering 3 0 0 3
4 PCC 23CS3104 Artificial Intelligence 3 1 0 4
5 PEC 23CS31XX Elective - I 3 0 0 3
6 PCC 23CS3181 Operating System Lab 0 0 3 1.5
7 PCC 23CS3182 Computer Networks Lab 0 0 3 1.5
8 PCC 23CS3183 Software Engineering Lab 0 0 3 1.5
23EG3182 English Language 0 0 3 1.5
9 HSMC
Communication Skills Lab-II
Total 15 0 12 22

ENGINEERING THIRD YEAR:SEMESTER-2

Sl. Course Course Hours per week
Course Title Credits
No. Type Code L T P
Cryptography and Networks
1 PCC 23CS3201 3 1 0 4
Security
2 PCC 23CS3202 Machine Learning 3 1 0 4
3 PEC 23CS32XX Elective - II 3 0 0 3
4 PEC 23CS32XX Elective - III 3 0 0 3
5 OEC 23XX32XX Open Elective-I 3 0 0 3
23EG3283 English Language 0 0 3 1.5
6 HSMC
Communications Skills Lab-III
7 PR 23CS3235 Mini Project 0 0 6 3
8 MC 23CS3203 Career Development Course 2 0 0 0
Total 16 0 9 21.5

ENGINEERING THIRD YEAR:SUMMER SEMESTER

Hours per week Credits
Course Code Course Title
L T P
Summer Internship
23CS3236 0 0 6 3

ENGINEERING FOURTH YEAR:SEMESTER-1

Sl. Course Course Hours per week Credits
Course Title
No. Type Code L T P
1 PCC 23CS41XX Elective-IV 3 0 0 3
2 PEC 23CS41XX Elective-V 3 0 0 3
3 OEC 23XX41XX Open Elective – II 3 0 0 3
4 PR 23CS4137 Project-I 0 0 12 6

Total 9 1 12 15
ENGINEERING FOURTH YEAR:SEMESTER-2
Sl. Course Course Hours per week Credits
Course Title
No. Type Code L T P
1 PEC 23CS42XX Elective-VI 3 0 0 3
2 OEC 23XX42XX Open Elective-III 3 0 0 3
3 OEC 23XX42XX Open Elective-IV 3 0 0 3
4 PR 23CS4238 Project-II 0 0 12 6
5 HSMC 23HS4299 Community Service 0 0 4 2
Total 9 0 16 17

ENGINEERING FIRST YEAR: SEMESTER-I

*******************************************

Course code Course

Course Name L-T-P Credits
Category
23MA1102 Calculus and Linear Algebra
BSC 3-1-0 4
(CSE)

Course Learning Objectives: The objective of this course is to

1. Discuss the Solutions of first order differential equations
2. Understand Continuity and differentiability of multi-variable functions and its applications to
discuss maximum and minimum
4.Discuss the linear transformation and its Eigen values and Eigen vectors.
5. Discuss numerical methods to find the roots of polynomial and transcendental equations
Interpolating and Fitting the curves for data points.
6. Evaluate integrals by using numerical methods and solving IVP

Unit – I (10 Contact Hours)

Differential equations of first order and first degree:
Basic concepts, Variable Separable method, homogeneous differential equations, Exact differential
equations, Integrating factor, Differential equations Reducible to exact, Linear differential
equations, Bernoulli differential equations.

Unit - II (12 Contact Hours)

Functions of several variables:
Limit, Continuity and Differentiability of functions of several variables, Partial derivatives and their
geometrical interpretation, Differentials, Derivatives of Composite and Implicit functions, Chain
rule, Jacobians, Derivatives of higher order, Homogeneous functions, Euler's theorem, and
Harmonic functions.
Unit - III
Applications of Functions of several Variable: (8 Contact Hours)
Taylor's expansion of functions of several variables, Maxima and Minima of functions of several
variables - Lagrange's method of multipliers.

Unit – I V
Linear Algebra: (10 Contact Hours)
Vector Spaces, Linear Combinations of Vectors, Linear dependence and Independence, Basis and
Dimension, Linear Transformations, Matrix Representations of Linear transformation.

Unit-V (10 Contact Hours)

Matrix Algebra (Eigen Values and Eigen Vectors):
Solving system of Homogeneous and Non-Homogeneous equations by using Gauss elimination
method. Characteristic roots and Characteristic Vectors of a matrix - Cayley-Hamilton Theorem
(without proof); Finding inverse and power of a matrix by Cayley-Hamilton Theorem.

Unit - VI (10 Contact Hours)

Numerical solution of transcendental equations, Interpolation:
Roots of polynomial and transcendental equations – bisection method, Regula-falsi method and
Newton-Raphson Method, Finite differences, Newton's forward and backward interpolation
formulae, Gauss central difference Interpolation formulae.

Learning Resources:

Text Book:
1. ERWIN KREYSZIG, ‘Advanced Engineering Mathematics’, Wiley-India,9th Edition
Reference Books:
1. TOM M. APOSTAL,’Calculus, Volume II’, Wiley-India,Second Edition,
2.R. K. JAIN AND S. R. K. IYENGAR,’Advanced Engineering Mathematics’, Narosa
Publishers,3rd Edition.
3.B.S.GREWAL, ‘Higher Engineering Mathematics’, Khanna Publishers,42nd Edition.

Web Resources:
1. NPTEL, IIT- Madras,08-June-2017, Introduction to ordinary differential equations URL:
https://nptel.ac.in/courses/111106100/12
2. NPTEL, IIT- Kanpur, 15-March-2016,Differential Calculus of Several Variables
URL:https://nptel.ac.in/courses/111104092/11
3. NPTEL, IIT- Madras,2015-02-05,Linear Algebra
URL: https://nptel.ac.in/courses/111/106/111106051/
4. NPTEL, IIT- Delhi, 2009-12-31,Numerical Methods and Computation
URL: https://nptel.ac.in/courses/122/102/122102009/
5. NPTEL, IIT- Kharagpur, 2012-07-11,Regression Analysis
URL: https://nptel.ac.in/courses/111/105/111105042/
6. RGUKT Course Content
Course Outcomes: At the end of the course, the student will be able to

CO 1 Solve first order differential equations.

Explain limits and continuity, differentiability and partial derivatives of functions
CO 2
of multivariable and solve the extremum problems subjected to constraints.
CO 3 Find Taylor’s series and extreme values for functions of two variables .
CO 4 Finding Eigen values and Eigen vector for a linear transformation.
CO 5 Approximate the roots of polynomial and transcendental equations.
Approximate the value at a point by using given discrete data. Solve IVP
CO 6
numerically.

Assessment Method
Assessment Weekly tests Monthly tests End Semester Test Total
Tool
Weightage (%) 10% 30% 60% 100%
*************************************************************************
Course Code Course Name Course Category L-T-P Credits
Basic Electrical and Electronics
23EE1109 ESC 3-1-0 4
Engineering

Course Learning Objectives

1. Impart a basic knowledge of electrical quantities such as current, voltage, power, energy and
frequency to understand the impact of technology.
2. Provide knowledge for the analysis of basic DC and AC circuits used in electrical and
electronic devices.
3. To explain the working principle, construction, applications of DC machines, AC machines.
4. Realize the importance of electronic devices in the present technology.

Course Content:
Unit-I (13 Contact Hours)
DC Circuits: Parallel circuits, Star-delta and delta-star transformations, equivalent resistance
calculation, Mesh and Nodal analysis, superposition theorem, thevenin’s theorem and maximum
power transfer theorem. Introduction, Basic definitions, Types of elements, Ohm’s Law, Kirchhoff’s
Laws, Series.

Unit-II (7 Contact Hours)

AC Circuits
Single-phase: Inductive circuits, capacitive circuits, series RL, RC and RLC circuits, resonance
Three-phase: star connection and delta connection.

Unit-III (9 Contact Hours)

DC Machines
Generator: Principle of operation of DC Generator, EMF equation, types, applications Motor: DC
motor types, torque equation, applications, three point starter.
UNIT-IV (9 Contact Hours)
AC Machines
Transformers: Principle of operation of single phase transformers, EMF equation, losses,
efficiency and regulation.
Induction Machine: Principle of operation of induction motor, slip-torque characteristics,
applications.

UNIT-V (9 Contact Hours)

Semiconductor Devices
Diode: types of semiconductors, P-N junction diode, V-I Characteristics, zener diode, Diode
Applications. Rectifiers: Half wave, Full wave and Bridge rectifiers.

UNIT-VI (7 Contact Hours)

Transistors
PNP and NPN Junction transistor, Transistor configurations, Transistor as an amplifier.

Learning Resources
Text books:
Basic Electrical and Electronics Engineering by Kothari and Nagarath, TMH Publications, 2nd
Edition.
Reference Books:
Principles of Electrical and Electronics Engineering by V.K.Mehta, S.Chand & Co.
Basic Electrical Engineering by Kothari and Nagarath, TMH Publications, 2nd Edition.
Web Resources:
1. Prof T S Natarajan, NPTEL-IIT Madras, 'Basic Electronics'
URL: https://nptel.ac.in/courses/122106025/
2. Prof U Umanand, IISC Bangalore, 'Basic Electrical Technology'.
URL: http://nptel.ac.in/courses/108108076/
3. Prof S Aniruddhan, IIT Madras, 'Basic Electrical Circuits'.
URL: https://onlinecourses.nptel.ac.in/noc16_ee03

Course Outcomes:
At the end of the course, the student will be able to

CO 1 Predict the behaviour of any electrical and magnetic circuits.

CO 2 Formulate and solve complex AC, DC circuits
CO 3 Identify the type of electrical machine used for that particular application
CO 4 Realize the requirement of transformers in transmission and distribution of electric power and
other applications
CO 5 Utilize the semiconductor devices like diodes and transistors
CO 6 Internlink Knowledge of electrical and electronic circuits to general problems

Assessment Method
Assessment Weekly tests Monthly tests End Semester Test Total
Tool
Weightage (%) 10% 30% 60% 100%

***************************************************************************
Course Code Course Name Course Category L-T-P Credits
23CS1101 Problem Solving and Programming Through
ESC 3-1-0 4
C

Course Learning Objectives:

1. To understand the various steps in Program development.
2. To understand the basic concepts in C Programming Language.
3. To learn about arrays and character arrays
4. To learn how to write modular and readable C Programs
5. To understand the basic concepts of Pointers and Dynamic memory allocation.
6. To understand the usage of Structure and Unions and about file operations
Course Content:

UNIT – I (10 Contact Hours)

Introduction to Computer Programming: Computing Environments, Computer Languages,
Creating and Running Programs. Algorithms and Flowcharts: Definition of Algorithms and
examples, Introduction to C Language - Background, C Identifiers, Data Types, Operators,
Variables, Constants, Input / Output, Expressions, C Programs, Precedence and Associativity,
Evaluating Expressions, Type Conversion, Statements, Bitwise Operators.

UNIT-II (10 Contact Hours)

Conditional Statements and Loops: if-else, switch Statements, Standard Functions. Repetition:
loops, while, for, do-while statements, Loop examples, break, continue and GOTO statements.
UNIT-III (8 Contact Hours)
Arrays: Array Concepts, Using Arrays in C, Array Applications, Two- Dimensional Arrays,
Multidimensional Arrays.
Strings: Declaring, Initializing, Printing and reading strings, string manipulation functions, String
input and output functions, array of strings.

UNIT – IV (12 Contact Hours)

Functions: Designing Structured Programs, Function Basics, User Defined Functions, Inter
Function Communication, Standard Functions, Recursion- Recursive Functions, Preprocessor
Commands. Strings - Concepts, C Strings, String Input / Output Functions, Arrays of Strings, String
Manipulation Functions.

UNIT – V (10 Contact Hours)

Pointers: Introduction, Pointers to Pointers, Compatibility, void Pointers, Arrays and Pointers,
Pointer constants, Pointers and Strings, Pointers to Functions, Pointers to Constant Objects,
Constant Pointers, Pointer Arithmetic. Call-by-reference: Pointers for Inter-Function
Communication, Passing Arrays to a Function.
Dynamic Memory Allocation: Memory Allocation Functions, Programming Applications,
Command-line Arguments.

UNIT – VI (10 Contact Hours)

The Type Definition (type def), Enumerated Types .
Structure& Union: Definition and Initialization of Structures, Accessing Structures, Nested
Structures, Arrays of Structures, Structures and Functions, Pointers to Structures, Self-Referential
Structures, definition and Initialization of Union, Accessing of Union.
Files: Input and Output: Files, Streams, Standard library Input Output Functions, Character Input
Output Functions.
Learning Resources
Text Book:
nd
1. Reema Thareja, “ Programming in C”, Oxford Publications, 2 Edition
Reference Books:
th
1. E. BalaguruSwamy, “ Programming in ANSI C”, McGraw Hill, 7 Edition
nd
2. Brian W. Kernighan, Dennis M. Ritchie, “ The C Programming Language”, Prentice Hall, 2
Edition
Web Resources:
1. Indian Institute of Technology, Kharagpur, “Problem Solving through Programming in
C”, https://nptel.ac.in/courses/106105171/

Course outcomes: At the end of the course, the student will be able to

CO 1 Develop flowcharts, algorithms for given complex problems.

CO 2 Analyze basic programming constructs.
Write C programs for real world problems. Implement C programming by using various
CO 3
control structures.
CO 4 Able to write rite modular and readable C Programs
CO 5 Able to use pointers in C programming
CO 6 Appreciate coding standards and best practices for program development.

Assessment Method
Assessment Tool Weekly tests Monthly End Semester Total
tests Test
Weightage (%) 10% 30% 60% 100%

***************************************************************

Course Code Course Name Course Category L-T-P Credits

23ME1214 Engineering Graphics & Computer Drafting ESC 1-0-3 2.5

Course Learning Objectives:

1. To know about the emergence of Engineering Graphics as a refined communication tool and
to be aware of International and national standards of practice for uniform presentation of drawings.
2. To adopt the projection of three-dimensional objects orthogonally on a set of vertical and
horizontal planes and obtain the views of the frontal and the top surfaces.
3. To describe the position of a point and position of the line with respect to all the planes of
projection and obtain its views.
4. To learn orthographic projections of various simple plane surfaces in simple and inclined
positions.
5. To know about orthographic projections of right and regular solids in simple positions, when
their axes are perpendicular to one reference plane and parallel to the other.
6. To learn about types of cutting planes and to obtain views of simple solids.
7. To learn about different methodologies to be used for obtaining the two dimensional layout
of the lateral surfaces of uncut solids.
8. To learn about computer aided drafting techniques and to be familiarized with one of the
most powerful software ‘AutoCAD’.
Course Content:

Unit - I (6 Contact Hours)

Introduction to Engineering drawing – Tools and Standards, Geometric Constructions, Scales,
Conics and Special Curves - ellipse, parabola, hyperbola, cycloids, Involutes.

Unit - II (6 Contact Hours)

Introduction to Orthographic Projections,Projections of Points, Projection of Lines.

Unit - III (7 Contact Hours)

Projection of Planes, Projections of Solids cube, prism, pyramid, cylinder, cone and sphere.

Unit - IV (5 Contact Hours)

Sections of Solids - cube, prism, pyramid, cylinder, cone and sphere. Development of Surfaces –
Parallel line method and Radial line method.

Unit - V (6 Contact Hours)

Computer Aided Design – Introduction to AutoCAD, Co-ordinate System (UCS) and their
Commands, Basic Commands of Drawing and Editing, Dimensioning and Text.

Unit – VI (6 Contact Hours)

Drawing practice with AutoCAD – Creating 2D Drawings of Objects from Isometric views,
Creating Isometric views form Orthographic views and . Introductions to 3D drawings.

Learning Resources
Text Book:
1. N.D. Bhatt and V.M. Panchal, “Engineering Drawing”, Charotar Publications
Reference Books:
1. K. Venugopal , “Engineering drawing”
2. N.S. Parthasarathy and Vela Murali , “Engineering Drawing”

Course Outcomes: At the end of the course, the student will be able to

CO 1 Student will be aware of International and national standards of practice.

Student will be familiar with obtaining the views of the frontal and the top surfaces of an
CO 2
object.
Student will be aware of orthographic projections of right and regular solids in simple
CO 3
positions, when their axes are perpendicular to one reference plane and parallel to the other.
Student will know about computer aided drafting techniques and will be familiar with one of
CO 4
the most powerful software ‘AutoCAD’.

Assessment Method
Assessment Tool Practice charts Monthly tests End Semester Test Total
(Average of
min 8 charts)
Weightage (%) 20% 20% 60% 100%
***************************************************************************
Course Code Course Name Course Category L – T -P Credits

English
Language
23EG1181 HSMC 1–0–3 2.5
Communicatio
ns Skills Lab-I

Course objectives:
1. To facilitate computer-aided multi-media instruction enabling individualized and
independent language learning
2. To sensitize the students to the nuances of English speech sounds, word accent, intonation
and rhythm
3. To provide opportunities for practice in using English in day to day situations
4. To improve the fluency in spoken English and neutralize mother tongue influence
5. To train students to use language appropriately for debate, group discussion and public
speaking

COURSE CONTENT:

UNIT-I: (06 Contact Hours)

Theory: An Ideal Family by Katherine Mansfield
Spoken Skills: Situational Dialogues – Role-play – Expressions in various situations – Self
Introduction – Introducing others – Greetings – Apologies – Requests – Giving directions.
UNIT-II: (06 Contact Hours)
Theory: Energy -Alternative sources of Energy Panel Debate on “On-grid & off-grid support to
public participation in the production of solar energy in India”, Reading the Wikipedia content on
“The Green New Deal”. Reflective session on the prospects of “The Green New Deal in India”.
Writing Skills: Letter Writing (Formal & Informal) and Hands on Session on Letter Writin.
UNIT-III: (06 Contact Hours)
Theory: Transport - Problems & solutions
Group Discussion on “The Future of Bullet Trains in India”
PPT on “The Dedicated Freight Corridors & the Future of Indian Economy” – Introduction to
Speech.
Spoken Skills: Sounds – Vowels, Consonants and Diphthongs – Pronunciation Exercises (Basic
Level).
UNIT-IV: (06 Contact Hours)
Theory: Technology - Evaluating technology
PPT on “3R: Reduce, Recycle, Reuse” - Solo Debate on “Can Block Chain Technology Mitigate the
Issue of Cyber Crimes and Hacking?”
Presentation Skills: JAM –Description of Pictures, Photographs, Process, Talking about wishes,
Information Transfer.
UNIT-V: (06 Contact Hours)
Theory: Environment - Ecology versus Development
Listening Skills: Listening Activity on YouTube video on “Greening the Deserts” - Students’
seminar on “Waste to Wealth: Examples from around the Globe”.
UNIT-VI: (06 Contact Hours)
Theory: Industry - Selling products
Reading Skills: Reading the material on “4Ps: Product, Price, Place, and Promotion” Role play on
“How to sell your product and services”.
References:

1. Non – Detailed Text Book: Panorama – A Course on Reading published by Oxford

University Press, India
2. English for engineers and technologists by Orient Black Swan
3. A Textbook of English Phonetics for Indian Students 2nd Ed T. Balasubramanian.
(Macmillan), 2012.
4. Speaking English Effectively, 2nd Edition Krishna Mohan & NP Singh, 2011. (Macmillan).
5. A Hand book for English Laboratories, E.Suresh Kumar, P.Sreehari, Foundation Books,2011
6. English Pronunciation in Use. Intermediate & Advanced, Hancock, M. 2009. CUP
7. Basics of Communication in English, Soundararaj, Francis. 2012.. New Delhi: Macmillan
8. English Pronouncing Dictionary, Daniel Jones Current Edition with CD.Cambridge, 17th
edition, 2011.

Course Outcomes: At the end of the course, the student will be able to

Understand the issues affecting the economy and environment in India and across the
CO 1
globe
CO 2 Develop the instinct for problem solution

Develop the ability to collect materials on various socio-economic-technological issues

CO 3
and prepare PPT for presentation

CO 4 Improving listening skills

CO 5 Inculcate speaking as a behaviour by repeated practice and exposure

Assessment Method:
Course Nature: THEORY + LABORATORY

Internal Assessment (40 Marks) External Assessment (60 Marks)

Record Writing – 10 Marks Reading Comprehension – 15 Marks

Attendance – 10 Marks Writing – 30 Marks

Continuous Assessment (Listening – 10 Marks Speaking (Viva-Voce) – 15 Marks
+ Oral Presentations – 10 Marks)

************************************************************************

Course Code Course Name Course Category L-T-P Credits

Basic Electrical and Electronics Engineering
23EE1189 ESC 0-0-3 1.5
Laboratory
Course Learning Objective:
1. To make students get familiarized with the electrical and electronic measuring equipment.
2. To make the student understand the concepts of characteristics of Resistors, Capacitors and
Inductors.
3. To understand the behaviour of electrical equipment.
4. To understand the concepts of diodes, transistors and amplification.

List of Experiments:
Familiarization with Computer Hardware and software installation, DSO, Function generators, RPS,
FPS, Mustimeters and other lab equipment

Section A: Computer Hardware and software installation:

1. Every student should Draw the block diagram of the CPU along with the configuration of
each peripheral and submit it to your instructor. Every student should disassemble and assemble the
PC back to working condition.
2. Every student should individually install operating systems like Linux or MS windows on
the personal computer. The system should be configured as dual boot with both Windows and
Linux.
3. Hardware Troubleshooting: Students have to be given a PC which does not boot due to
improper assembly or defective peripherals. They should identify the problem and fix it to get the
computer back to working condition.
4. Software Troubleshooting: Students have to be given a malfunctioning CPU due to system
software problems. They should identify the problem and fix it to get the computer back to working
condition

Section B: Electrical Engineering Laboratory:

1. Verification of ohm’s law, series and parallel circuits
2. Verification of Kirchhoff’s Laws
3. Verification of Voltage division and Current division principles
4. Verification of circuit theorems
5. V-I characteristics of Incandescent and CFL lamp
6. V-I characteristics of Fluorescent lamp
7. A.C analysis of series R-L circuit and R-C circuit
8. Calibration of Energy meter
9. Open circuit characteristics of D.C Generator
10. Speed control of D.C shunt Motor
11. Three phase power measurement
12. Lab project

Section C: Electronics Engineering Laboratory:

1. Familiarization with any CAD tools like multisim/Pspice/ngspice for doing basic
experiments .
2. V-I characteristics of a P-N junction diode and zener diode
3. Half wave and center tapped full wave rectifier
4. Full wave bridge Rectifier with and without filters.
5. Design of a simple amplifier using BJT
6. Experiment on simple analog-modulation scheme
7. Simple experiment on Arduino kit and interfacing with sensors
8. Lab project
Course Outcomes:
At the end of the course, the student will be able to

CO 1 Design basic circuits using P-N junction diode and Zener diode
CO 2 Design rectifier circuits considering the practical aspects into consideration
CO 3 Design simple amplifier with required gain
CO 4 Use circuit knowledge in analyzing Arduino boards
CO 5 Designing simple experiments using Arduino board and sensors interfacing
CO 6 Experimental verification of basic circuit laws and circuit theorems
CO 7 Experimental analysis of V-I characteristics of different electrical and electronic equipments

CO 8 Experimental analysis of electrical machines likes motors, generators etc

CO 9 Design of a simple prototype project

Assessment Method:

Assessment Tool Experiments Report/Viva-Voce/ Quiz/MCQ/Lab project Total

Weightage (%) 25% 15% 40%
End Semester Examination weightage (%) 60%

***************************************************************************

Course Code Course Name Course Category L-T-P Credits

23CS1181 Problem Solving and Programming Through
ESC 0-0-3 1.5
C Lab

Course Learning Objectives:

1. Identify situations where computational methods and computers would be useful.
2. Given a computational problem, identify and abstractthe programming task involved.
3. Approach the programming tasks using techniques learned and write pseudo-code.
4. To understand the concepts of Programming language.
5. To learn the basics of C declarations, operators and expressions.
6. To learn on the manipulation of strings, functions and pointers.
7. To apply concepts and techniques for implementation.

List of Programming Assignments for Laboratory:

Statements, Expressions & Conditionals

1. Write a program to print the memory allocation required for all the datatypes in C Language.
2. Write a program to check whether the given number is an even number or odd number.
3. Write a menu based program to take of input of two values followed input of choice and
accordingly perform arithmetic operations like Addition, Subtraction, Multiplication, Modulus,
Division, Power( Using Switch Statement)
4. Write a program to swap two given numbers with and without using extra variables.
5. Write a program to find out whether the given number is a perfect square or not.
6. Write a program to find out whether the given number is positive, negative or zero value.
Iterative Constructs - I: For Loop, While Loop & Do. While
1. Write a program print all the factors of a given number
2. Write a program to find the factorial of a given number
3. Write a program to find whether a given number is Palindrome or not.
4. Write a program to find whether a given number is Prime or not.
5. Write a program to print the Fibonacci series upto given ‘n’ number of terms.

Iterative Constructs – II: Nested Loops

1. Write a program to print the first ‘n’ prime numbers and prime numbers upto ‘n’ value.
2. Write a program to print the Pascal Triangle for given ‘n’ value
3. Write a program to print the first ‘n’ perfect number for a given ‘n’ value.
4. Write a program to print the following pattern for a given ‘n’ value.
5. For Eg. If n = 3, the output would be

*
* * *
* * * * *
* * *
*
6. Write a program to print the following pattern for given ‘n’ value. For Eg. If n = 4, the output
would be
2
3 5
7 11 13
17 19 23 29

Single Dimensional Arrays: Basic Operations and Problems

1. Write a program to take an input array of ‘n’ numbers and find out the sum of all the
elements, product of all the elements and mean of the array.
2. Write a program to take an input array of ‘n’ numbers and print the second smallest and
second largest element of all elements in the array.

Two Dimensional Arrays –Matrices & its operations

Functions
1. Write a program to implement the string operations like Length of String, String Copying,
String Concatenation, Conversion to Uppercase and String Comparison.( Define own Function for
each of the operations. Header file “string.h” is not allowed)
2. Write a C program to implement Multiplication and Division Operations without using
operators “*” and “\” respectively. Define function “mul” for multiplication and “div” for integer
division.
Recursion
1. Write a program to print the integers from 1 to N and then N to 1 for the given input number
‘N’ without using any loops.
N)
2. Write a program to find the X power N(X using the user defined recursive function
“pow(X,N)” without using any predefined function from the library.
3. Write a program to find the GCD of two numbers ‘a’ and ‘b’ by defining a recursive
function GCD(a,b).

Structures
1. Write a program to take the information of ‘n’ Students (REGID, Name, CGPA, Address –
Village, District, Phone NO) and print the topper among the n students.
2. Write a program to take the information of ‘n’ Students (REGID, Name, CGPA, Address –
Village, District, Phone NO) and print the students in the ascending order of Regn ID.
3. Write a program to take the information of ‘n’ Students (REGID, Name, CGPA, Address –
Village, District, Phone NO)and print the list of Phone Number for the students who are above
average of CGPA.

File Handling – Create, Read and Write operations on File

1. Write a program to print the number of lines and words in a given input file name.
2. Write a program to copy from the given file to another file.
3. Write a program to append one file at the end of another file.
4. Write a program to search for a word in a given text file.

Course Outcomes:
At the end of the course, the student will be able
CO 1 To formulate the algorithms for simple problems
CO 2 To translate the given algorithms to a working and correct program
CO 3 To identify and correct logical errors encountered at run time
CO 4 To write iterative as well as recursive programs
CO 5 To represent Data in arrays, strings, Structures and manipulate them through a program
CO 6 To decompose a problem into functions and synthesize a complete program
CO 7 To be able to create, read and write to and from text files

Assessment Method
Assessment Tool Experiments Report/Viva-Voce/ Quiz/MCQ/Lab project Total
Weightage (%) 25% 15% 40%
End Semester Examination weightage (%) 60%

********************************************************************

Course Code Course

Course Name L-T-P Credits
Category
23HS1102 Indian Constitution MC 2-0-0 0

Course Learning Objectives:

1. The basic objective of the course is to provide knowledge about institutions.
2. It helps to understand the processes governing the society in a systematic way.
3. It helps to establish social Justice, Liberty, Equity and Fraternity.
4. The course will introduce the idea of political system in general
5. It provides ideas about the working process of constitutional institutions.
6. To create awareness about the functioning of the judicial system in India.
Course Contents:

UNIT I: (5 Contact Hours)

Introduction-Constitution’ meaning of the term, Indian constitution sources and constitutional
history, Features: Citizenship, Preamble, Fundamental Rights and duties, Directive Principles of
State Policy.
UNIT II: (5 Contact Hours)
Union Government and its Administration-Structure of the Indian Union: Federalism, centre-state
relationship, President: Role, power and position, PM and Council of ministers, Cabinet and Central
Secretariat, Lok sabha, Rajya sabha.
UNIT III: (5 Contact Hours)
Election commission- Election commission: Role and functioning, Chief Election Commissioner
and Election Commissioners, State Election Commission: Role and functioning, Institute and
Bodies for the welfare of SC/ST/OBC and women.
UNIT IV: (3 Contact Hours)
State Government and its Administration- Governor: Role and position, CM and Council of
ministers, state secretariat: Organization, structure and functions.

UNIT V: (7 Contact Hours)

Local Administration-District’s Administration head: Role and importance, Municipalities:
Introduction, Mayor and role of Elected Representatives, CEO of Municipal Corporation,
Panchayati raj: Introduction, PRI: Zilla Panchayat, Elected officials and their roles, CEO Zilla
Panchayat: Position and role, Block level: Organizational Hierarchy (different departments), Village
level: Role of elected and appointed officials, Importance of grass root democracy.
UNIT VI: (5 Contact Hours)
Union Judiciary-Establishment and constitution of Supreme court, Appointment of Judges,
Establishment of State High court, Establishment of common High court for 2 or more states,
WRITS, PIL(Public Interest Litigation).

Learning Resources
Text Book:
1. Durga Das Basu, Constitutions of India, 23rd ed, LexisNexis Publication.
Reference Books:
1. ’Indian Polity’ by Laxmikanth
2.’Indian Administration’ by Subhash Kashyap
4.’Indian Administration’ by Avasti and Avasti
5.’Government and Politics of India’ by W.H.Mrrison Jones
6.’Constitution of India’ by J.C.Johari

Course Outcomes: At the end of the course, the student will be able to
CO 1 The students will understand their fundamental rules and duties.
CO 2 The students will learn the political system and the system of elections in India.
CO 3 It is to provide the students the institutions and processes to govern themselves in
the manner they prefer.
CO 4 Students can also be able to utilize the laws and facilities provided by constution
CO 5 It will provide over all idea about our legal system.

CO 6 It will enable students more strong in terms of law and practice in

day to day life.

*******************************************************************
ENGINEERING FIRST YEAR: SEMESTER-2

********************************************

Course Code Course

Course Name L-T-P Credits
Category
23MA1202
Discrete Mathematics BSC 3-1-0 4

Course learning objectives: The objective of this course is to

1. Develop mathematical maturity of students to build the ability to understand and create
mathematical arguments and to teach them how to think logically and mathematically.
2. Prove theorems and Mathematical arguments by using different methods. provide the
mathematical foundations for many computer science courses including data structures, algorithms,
database theory, automata theory, formal languages, compiler theory, computer security and
operating systems.
3. Learn the basic properties of sets and how to work with discrete structures, which are
abstract mathematical structures used to represent discrete objects and relationship between these
objects.
4. Introduce basic techniques of counting so that they develop the ability to enumerate..
5. Learn the concepts of graphs and its properties, solving real world problems by using graph
concepts.
6. Learn the concepts of Euler Paths , graph coloring , trees.

Course Content:

Unit – I (10 Contact Hours)

Propositional logic:
Propositions and Connectives, well-formed formulas, Logical Equivalence and laws of
logic,Normal forms, PCNF, PDNF.

Unit - II (10 Contact Hours)

Proof techniques:
Tautological implications and rules of inferences, Methods of proofs (Forward proof, proof by
contradiction, contra positive proofs, proof of necessity and sufficiency, Proof by Mathematical
induction).

Unit - III (12 Contact Hours)

Sets, relations and functions: Sets, Relations, Equivalence Relations and compatibility relations,
Transitive closure, Posets, Finite and infinite sets, countable and uncountable sets (definitions),
Functions.

Unit - IV (12 Contact Hours)

Introduction to counting: Counting Principles, Pigeon hole Principle, Permutations and
Combinations, Recurrence Relations, Linear Recurrence relations, Generating functions.

Unit - V ( 9 Contact Hours)

Introduction to Graph Theory:

Graphs and their basic properties, Special types of graphs and representations of graphs,
Isomorphism’s, connectivity.

Unit – VI
Graph Theory(Continuation) : (7 Contact Hours)
Euler and Hamiltonian Paths, Planar Graphs, Graph coloring, Trees.

Learning Resources:

TEXT BOOKS:

1. Kenneth H. Rosen,’Discrete Mathematics and its Applications’, Tata McGraw-Hill. Seventh

edition

REFERENCE BOOKS:

1. Trembley and Manohar, ‘Discrete Mathematical Structures to Computer Science’, by Mc -

Graw Hill (1997).
2. Kolman, Busby and Ross, ‘Discrete Mathematical Structures’ PHI (2009), Sixth Edition.
3. Thomas Koshy, ‘Discrete Mathematics with Applications’, Elsevier Academic press.

Web Resources:

1. NPTEL Lectures by Prof. Kamala Krithivasan, Dept of CSE,IIT Madras

link: https://www.youtube.com/watch?v=xlUFkMKSB3Y&list=PL0862D1A947252D20

2. MIT open course ware: Mathematics for Computer Science, Fall 2010. Instructor: Tom Leighton
link: https://www.youtube.com/watch?v=L3LMbpZIKhQ&list=PLB7540DEDD482705B
Also visit: http://ocw.mit.edu/6-042JF10

3. Discrete Mathematics for GATE. IIT lecture:

link:
https://www.youtube.com/watch?v=E6uhC0pT9J8&list=PLEJxKK7AcSEGD7ty8DB1aU0xVG_P_hs_0
4.RGUKT Course Content

Course Outcomes: At the end of the course, the student will be able to
CO 1 Read, comprehend and construct mathematical argument
CO 2 Prove theorems and mathematical statements in different techniques.
CO 3 Deal with set, relation, countability and functions.
Apply permutation, combination, pigeon hole principle, recurrence relation and
CO 4
generating functions to enumerate objects.
CO 5 Understand and apply concepts of graph in many computer science courses.
CO 6 Deal with Euler paths in graphs and coloring of graphs

Assessment Method
Assessment Weekly tests Monthly tests End Semester Test Total
Tool
Weightage (%) 10% 30% 60% 100%

*********************************************************************

Course Code Course Name Course L-T-P Credits

Category
23PY1201 Engineering Physics BSC 3-1-0 4

Course Learning Objectives:

1. To enhance the knowledge on waves & oscillation with an emphasis on different type of
oscillations and its resonance conditions.
2. To distinguish vividly the Optical phenomena’s such as Interference, Diffraction and their
applications through experimental point of view like Michelson Interferometer, Newton Rings and
Plane Diffraction Grating.
3. To pursue the in-depth knowledge on Polarization with emphasis on Laurent’s half-shade
Polarimeter and also to learn all the basic necessary concepts regarding the LASERs including basic
important types of LASERs.
4. To pull the student attention towards the difference between Photography and Holography
and also the basic knowledge regarding Optical fibers along with its applications.
5. To identify the necessity of origin of Quantum mechanics over the grand old Classical
mechanics and also to learn the knowledge on postulates of Quantum mechanics.
6. To get knowledge about the band theory of solids by the assumption of movement of an
electron in the periodic potential well only and hence distinguishes the materials classification,
phenomena of Hall Effect exhibited by semiconductors and its applications.

Course Content:

Unit I: Oscillations (8 Contact Hours)

Oscillations: Simple Harmonic Oscillator (SHO), Damped Oscillations, Forced Oscillations,
Amplitude and Velocity Resonance, Quality Factor, Coupled Oscillations &Normal modes, Coupled
Pendulums & energy and Oscillation on N coupled modes.

Unit – II: Wave Optics (10 Contact Hours)

Interference: Superposition principle, Division of amplitude and wave front division,
Interferometers (Michelson), Newton’s Rings due to Reflected waves, Applications; Diffraction:
Fraunhoffer diffraction (single, double & multiple slits),Plane Diffraction Grating, Rayleigh
criterion for resolving power, Dispersive power, Applications.

Unit – III: Polarization and LASERS (9 Contact Hours)

Polarization: Classification of Polarized light: Linear, Circular, Elliptical; Production & detection of
polarized light; Retardation wave plates: Quarter & Half wave plates; Optical activity: Laurent Half
shade Polarimeter; Basic principles of Lasers, Theory of Lasers, and Types of Lasers: Three level
and four level lasers, Ruby Laser, He-Ne Laser, and Semiconductor laser: P-N Junction Diode
Laser, applications of lasers.

Unit – IV: Holography, and Optical fibers (9 Contact Hours)

Basic principles of Holography, types of holograms, difference between photography and
holography, holographic NDT & applications of holography; Optical fibers: Basic principles, types
and applications for communication and sensing, Acceptance angle &Numerical Aperture NA.

Unit V: Quantum Mechanics (12 Contact Hours)

Photo electric effect, Compton effect; De-Broglie matter waves, properties of matter waves,
Uncertainty Principle, Wave function& it’s probability interpretation, Operators, Expectation
values, Postulates of quantum mechanics, Time independent Schrodinger Equation and its
Applications, Particle in a box (1-D and 3-D).

Unit VI: Semiconductor Physics (12 Contact Hours)

Electron in periodic structures, Band theory of solids, E-K curve, effective mass, Density of states,
Fermi levels. Intrinsic and extrinsic semiconductors, dependence of Fermi level on carrier-
concentration and temperature (equilibrium carrier statistics), Carrier generation and recombination,
Carrier transport: diffusion and drift, Hall effect- Hall sensors, Physics of p-n junction, Metal-
semiconductor junction (Ohmic and Schottky).

Text Books:
1. Dr. N. Subrahmanyam, Brijalal, Dr. M.N Avadhanulu“A Text Book of Optics” S. chand
Publication.
2. Md. N. Khan & S. Panigrahi “Principals of Engineering Physics” Volume I, Volume II,
Cambridge University Press.
3. Hitendra K. Malik and A.K. Singh, ‘Engineering Physics’Tata McGraw Hill, 2nd Edition, 2017
4. Gaur and Gupta “Engineering Physics, Dhanpathrai Publications, 6th edition.

References:
1. AjoyGhatak‘Optics’ Tata McGraw Hill, 6th Edition
2. M. Armugam, Anuradha‘Engineering Physics’, Agencies publishers, 2003
3. David McMahon, ‘Quantum Computing Explained’, Wiley, 2016

Course Outcomes: At the end of the course, the student will be able to
1: Student will be able to distinguish the phenomena’s of interference & diffraction exhibited by
light waves theoretically through Michelson Interferometer, Newton’s Rings and Plane Diffraction
Grating.

2: Student will have capable to understand the lengths and breadths of Concept called Polarization
as well as working nature and construction of LASERs rather closely along with its applications in
various fields.

3: Students will have capable to discriminate the merits and de-merits of Holography over the
Photography besides of that they can purse the knowledge about optical fibers and their
applications.

4: Student will be able to differentiate all type of oscillations like Simple Harmonic, Forced,
Damped & Coupled and also implications governed by Amplitude & Velocity Resonance.

5: Student will be able to construct a quantum mechanical model to explain the behavior of a
system at microscopic level and solve engineering problems using the laws of quantum mechanics.

6: Student will acquire the capacity to describe classification of solid state materials by the band
theory of solids and semiconducting materials along with its significance.

Assessment Method
Assessment Weekly tests Monthly tests End Semester Test Total
Tool
Weightage (%) 10% 30% 60% 100%

************************************************

Course code Course

Course name L-T-P Credits
Category
23BM1201 Managerial Economics and
HSMC 3-0-0 3
Financial Analysis

Course Learning Objectives:

1. To strengthen students managerial skill.
2. To enhance the conceptual clarity in economic concepts.
3. To develop to forecasting capability.
4. It will help to produce multi-disciplinary thought.
5. It will enhance their conceptual and practical/hand on practice in accounting.
6. It will help to implement and understand the uses of ratios.
Course Contents:

Unit I: (7 Contact Hours)

Introduction to managerial economics, consumer behavior, demand, demand analysis, demand
forecasting, supply, supply analysis.

Unit II: (7 Contact Hours)

Theory of production, production functions, concept of cost, cost analysis, break even analysis.
Unit III: (7 Contact Hours)
Market structure-monopoly, oligopoly, monopolistic, prefect market; Types of business
organizations-sole proprietorship, partnership, private ltd. Companies and public ltd. Companies,
formation of company.

Unit IV: (8 Contact Hours)

Introduction to capital, capital sources, capital budgeting- NPV, IRR, Payback period, profitability
index.

Unit V: (8 Contact Hours)

Introduction to financial accounting, rules of debit-credit, Double-Entry Book Keeping, Journal,
Ledger, Trial Balance- Final Accounts (Trading Account, Profit and
Loss Account and Balance Sheet with simple adjustments, Preparation of final account and other
related accounting statements.

Unit VI: (8 Contact Hours)

Financial statements, comparative statement analysis, common- size statement analysis, ,ratio
analysis, time series (only theories).

Learning resources
Text book:
1. 1. Aryasri, A. R., Managerial Economics & Financial Analysis, McGraw Hill, 2014.

Reference Books:
1. Siddiqui., Managerial Economics & Financial Analysis, 2e, New Age International Private
Limited, 2017.
2. . Pandey, I.M., “Financial Management”, 11e, Vikas Publishing House, 2015.
3. . Prasanna Chandra., “Financial Management: Theory and Practice”, 9e, Mc Graw Hill
Education, 2015.
Web resources:

1. Managerial Economics and Financial Analysis, Dr. Trupti , IIT Bombay

http://nptel.ac.in/courses/110101005/

Course outcomes: At the end of the course, the student will be able to
A student will be able to understand basic economics as well as management
CO 1
concepts.
CO 2 This subject will provide implication facilities of concepts.
CO 3 Students can be able to do primary data collection and classification.
Students can also be able to forecast as well as generate trend series by utilizing the
CO 4
available secondary data.
CO 5 They have basic knowledge about accounting and its terminologies.
CO 6 They will be able to prepare and understand accounting tables.

Assessment Method
Assessment Weekly tests Monthly tests End Semester Test Total
Tool
Weightage (%) 10% 30% 60% 100%

***************************

Course
Course code Course Name L-T-P Credits
Category

23CS1201
Object Oriented Programming PCC
3-1-0 4
through JAVA

Course Learning Objectives:

1. Gain knowledge about basic Java language syntax and semantics to write Java programs
and use concepts such as variables, conditional and iterative execution methods etc.,
2. Understanding the fundamentals of object-oriented programming in Java, including
defining classes, objects, invoking methods etc. and exception handling mechanisms.
3. Understand the principles of inheritance, packages and interfaces.
4. Understand the principles of Multithreading and Event handling mechanisms.
Course Content:

Unit 1: (8 Contact Hours)

Introduction: Object Oriented Programming, Introduction to java and JVM, Key features,
Fundamentals of Objects and Classes, Access Specifiers, data types, dynamic initialization, scope
and life time, operators, Conditional Statements, control structures, arrays, type conversion and
casting. Constructors, usage of static, access control, this keyword, garbage collection, overloading,
parameter passing mechanisms, nested classes and inner classes.

Unit II: (7 Contact Hours)

Strings: Exploring the String class, String buffer class, Command-line arguments. Library:
StringTokenizer, Random class, Wrapper classes. Encapsulation: Abstraction. Creating User defined
Data Structures: Array of Objects, User defined Linked List.

Unit III: (10 Contact Hours)

Inheritance and Interface:Types of Inheritance, usage of super key word, method overriding, final
methods and classes, abstract classes, Polymorphism: dynamic method dispatch, Static method
dispatch. Interfaces: Differences between classes and interfaces, defining an interface,
implementing interface, variables in interface and extending interfaces.

Unit IV: (6 Contact Hours)

File Handling: Streams, File class, File streams. File Reader, File Writer, Buffered Reader,
Buffered Writer, String Tokenizer Exception Handling: Concepts of Exception handling, types of
exceptions, usage of try, catch, throw, throws and finally keywords, Built-in exceptions, creating
own exception sub classes.
Unit V (6 Contact Hours)

Packages: Creating a Package, setting CLASSPATH, Access control protection, importing

packages.Multithreading : Concepts of Multithreading, differences between process and thread,
thread life cycle, Thread class, Runnable interface, creating multiple threads, Synchronization,
thread priorities, inter thread communication, daemon threads, deadlocks, thread groups.

Unit VI (8 Contact Hours)

Learning Resources
Text books:
1. Herbert Schildt, “The Complete Reference Java”, TMH Publishing Company Ltd, 9th Edition.
2. Cay Horstmann, “Big Java”, John Wiley and Sons, 2nd Edition
Reference Books:
1. Allen B.Downey,“Think Java; How to Think Like a Computer Scientist”,Paper Back
1stEdition
2. David J. Eck, Hobart and William Smith Colleges, “Introduction to Programming Using
Java” Published by Paper Back .
3. H.M.Dietel and P.J.Dietel “Java How to Program”, Sixth Edition, Pearson Education/PHI
Web resources:
1. http://www.nptelvideos.com/java/java_video_lectures_tutorials.php
2. https://www.tutorialspoint.com/java/
3. https://www.javatpoint.com/java-tutorial
4. http://mooc.fi/courses/2013/programming-part-1/material.html
5. http://math.hws.edu/javanotes

Course Outcomes: At the end of the course, the student will be able to
CO 1 Explain OOP Principles and Write Basic Java Programs.
CO 2 Defining Classes and Objects. Identify classes, objects, members of a class and
relationships among them needed for a specific problem
CO 3 To be able to write Java Programs to demonstrate method overloading and
Demonstrate the concepts of polymorphism and inheritance. Discuss method
overriding V/s method overloading.
CO 4 Explain the benefits of JAVA’s Exceptional handling mechanism compared to
other Programming Language
CO 5 To be able to write Java Programs to demonstrate Packages and Threading
concepts.
CO 6 Discuss and Demonstrate the AWT Concepts and develop the AWT
Applications.

Assessment Method
Assessment Tool Weekly tests Monthly tests End Semester Test Total
Weightage (%) 10% 30% 60% 100%
*****************************************************

Course Code Course Name Course Category L-T-P Credits

23CS1202 Data Structures PCC 3-0-0 3

Course Learning Objectives:

1. To understand the basic concepts such as Abstract Data Types, Linear, and Non Linear Data
structures
2. To understand the behavior of data structures such as stacks, queues
3. To understand building of trees and its operations
4. To be familiar with searching and sorting algorithms
5. To choose the appropriate data structure for a specified application.
6. To study various graph processing algorithms and Algorithm Design technique

Course Content:
Unit- I (7 Contact Hrs)
Introduction to Linear and Non-Linear data structures. Singly Linked Lists-Operations-Insertion,
Deletion, Searching, Concatenation of singly linked lists, Circularly linked lists-Operations for
Circularly linked lists, Doubly Linked Lists- Operations Insertion, Deletion, Searching.
Unit- II (8 Contact Hours)
Stack ADT, definition, operations, array and linked implementations in C, applications-infix to
postfix conversion, Postfix expression evaluation, recursion implementation, Queue ADT, definition
and operations, array and linked Implementations in C, Circular Queues-Insertion and deletion
operations, Deque (Double ended queue) ADT, array and linked implementations in C.
Unit- III (9 Contact Hours)
Sorting-Insertion Sort, Selection Sort, Merge Sort, Quick sort, Heap Sort, Comparison of Sorting
methods and linear sorting algorithms-Counting sort, Radix sort, shell sort
Searching – Linear Search, Binary Search, Basic Concepts- Hashing Methods- Collision
Resolutions- Open Addressing- Linked List Collision Resolution- Bucket Hashing
Unit- IV (6 Contact Hours)
Trees – Terminology, Representation of Trees, Binary tree ADT, Properties of Binary Trees, Binary
Tree Representations-array and linked representations, Binary Tree traversals, Max Priority Queue
ADT-implementation-Max Heap-Definition, Insertion into a Max Heap, Deletion from a Max Heap,
Min-Heap-Operations on Min-Heap.
Unit- V (9 Contact Hours)
Search Trees-Binary Search Trees, Definition, Operations- Searching, Insertion and Deletion, AVL
Trees-Definition and operations on AVL Tree, Red Black Trees, Trie Tree, B and B+ -Trees.
Unit- VI (6 Contact Hours)
Graphs – Introduction, Definition, Terminology, Graph ADT, Graph Representations- Adjacency
matrix, Adjacency lists, Graph traversals – DFS and BFS. Applications of DFS and BFS- Connected
Components, Topological sort.

Text Books:
1. R. Thareja “Data Structures using C” , Oxford University Press.
2. M. A. Weiss “Data structures and Algorithm Analysis in C “ , 2nd edition, Pearson.
References
1. Narsimha Karumanchi “Data Structures and Algorithms made easy in C”, 2nd Edition,
Career Monk Publications.
2. Allen Weiss, “Data Structures and Algorithms Analysis in C”, Pearson, 2nd Edition
Web resources:
1. Indian Institute of Technology, Madras , “Programming and Data Structures”, URL:
https://nptel.ac.in/courses/106106130/
2. Indian Institute of Technology, Delhi, ‘Data Structures and Algorithms’,
https://nptel.ac.in/courses/106102064/
Course outcomes: At the end of the course, the student will be able to

CO 1 Learn how to use data structure concepts for realistic problems.

Able to use linear and non-linear data structures like stacks, queues , linked list
CO 2
etc.
Ability to identify appropriate data structure for solving computing problems
CO 3
in respective language.
Ability to implement algorithms for the creation, insertion, deletion, searching,
CO 4
and sorting of each data structure.
CO 5 To build the different Hight balanced trees and perform the basic operations

Assessment Method
Assessment Weekly tests Monthly tests End Semester Test Total
Tool
Weightage (%) 10% 30% 60% 100%

***********************************************************************

Course code Course name Course Category L-T-P Credits

23PY1281 Engineering Physics Lab BSC 0-0-3 1.5

Course Learning Objectives:

1. To determine the wavelength of laser light using Diffraction Grating.

2. To determine the radius of curvature of a Plano convex lens by Newton’s Ring experiment.
3. To determine the specific rotation of cane sugar solution with the help of Polarimeter.
4. To calculate the velocity of ultrasonic sound waves in different liquid media by
interferometer.
5. To study the phenomena of Hall Effect in given semiconductors and to calculate:-(i) The
Hall Coefficient (RH) (ii) the concentration of charge carriers of given semiconductor material.
6. To verify the postulates of Bohr’s theory and discrete (quantized) energy level of atoms.
7. To study the photoelectric effect and determine the value of Plank’s constant.
8. To determine the Energy Band Gap of a Semiconductor by using a Junction Diode / Four
Probe method
9. Study of I-V Characteristics of a solar cell illuminated by an incandescent lamp at different
fixed frequencies.
10. Determination of Acceptance angle and Numerical Aperture using fiber optic cable
Experiments list
1. Laser Diffraction
2. Newton’s Ring expt
3. Polarimeter.
4. Ultrasonic interferometer
5. Hall Effect
6. Frank Hertz
7. Photo electric Effect
8. Energy Band Gap of a Semiconductor
9. Solar cells
10. Optical fiber

Course outcomes: At the end of the course, the student will be able to
1. Student will able to recognize the diffraction phenomena exhibited by different grating
elements and then capable to calculate wavelength of given laser light.
2. Student will able to recognize the interference phenomena exhibited by division of
amplitude using Newton’s Ring experiment. And capable of calculate the radius of curvature by
given Plano-convex lens by ring pattern.
3. Student will able to distinguish the purity of sugar cane by measuring polarization and
specific rotation of given sugar solution with the help of Polarimeter. The higher the polarization
purer will more in sugar; and lesser the polarization impurity will be more.
4. Student will able to understand the generation of ultrasonic sound waves by piezoelectric
effect in different liquid media and to know how the velocity of sound wave varies with adiabatic
compressibility of medium.
5. Student will have capable to distinguish the nature of semiconductors by measuring Hall
coefficient, carrier density and carrier mobility of a given semiconductor.
6. Students will able to understand quantization of energy in atoms.
7. Student will able to understand physical characteristics of photoelectric effect and how to
calculation of Plank’s constant value by Einstein particle radiation concept.
8. Student will have ability to describe the relation between conductivity and temperature in
semiconductor materials and then calculate the energy gap ofgiven material.
9. Student will have skillful to draw I-V characteristic of solar cells.
10. Student will able to calculate the acceptance angle and numerical aperture using fiber optic
cable.
11. Student will able to understand how recording and reconstruction of holograms under Laser
light.

Course Nature Practical

Assessment Method
Assessment Tool Experiments Record Viva-Voce/ Total
Quiz/MCQ/Lab project
Weightage (%) 25% 5% 10% 40%
End Semester Examination weightage (%) 60%
********************************************************************

Course code Course Name Course Category L-T-P Credits

Object Oriented Programming
23CS2181 PCC 0-0-3 1.5
Through JAVA Lab

Course Learning Objective:

1. To build software development skills using java programming for real-world applications.
2. To understand and apply the concepts of classes, packages, interfaces, arraylist, User defined
Linked List, File Handling, exception handling and Multi-threading.
3. To develop applications using AWT programming and event handling.

List of Experiments:
1. Lab No 1: Basic Programs in JAVA
2. Lab No 2: Programming Assignments on Arrays and Strings
3. Lab No 3: Programming Assignments on Classes, Objects and Encapsulation
4. Lab No 4: Implementing the concepts of Inheritance and Array Objects
5. Lab No 5: Implementing the OOPS Concepts of Abstract, Interfaces and Polymorphism
6. Lab No. 6: Programming Assignments on File Handling
7. Lab No. 7: Programming Exercises on Exception Handling
8. Lab No 8: Working with List Operations
9. Lab No 9: Implementing the concepts of Multi-Threading
10. Lab No 10: Programming Exercises on Event Handling

Course Outcomes
At the end of the course, the student will be able to

CO 1 Understanding the control structures and conditional statements in Java

CO 2 Understanding the arrays and String handling in java
CO 3 Understanding the difference between class and object and providing security
for objects
CO 4 Understanding the reusability of objects and working with multiple objects
CO 5 Understanding about hiding the data, getting multiple inheritance through
interfaces
CO 6 Understanding the data processing from files
CO 7 Understanding about handling run time abnormal program executions
CO 8 Understanding about creating user defined linked list and dynamic objects
CO 9 Understanding the multi-threaded programming and inter thread
communication
CO 10 Understanding about GUI creation

Assessment Method

Assessment Experiment Report/Viva-Voce/ Quiz/MCQ/Lab Total

Tool s project
Weightage (%) 25% 15% 40%
End Semester Examination weightage (%) 60%
Course Nature Practical
Assessment Method
Assessment Tool Experiment Record Viva-Voce/ Total
s Quiz/MCQ/Lab project
Weightage (%) 25% 5% 10% 40%
End Semester Examination weightage (%) 60%

*****************************************************************

Course Code Course Name Course Category L-T-P Credits

23CS1282 Data Structures Lab PCC 0-0-3 1.5

Course Objectives:
1. To develop skills to design and analyze simple linear and non-linear data structures.
2. To strengthen the ability to identify and apply the suitable data structures for the given real-
world problem.
3. To gain knowledge in practical applications of data structures.
List of Experiments:
1. Write a C program that uses functions to perform the following:
a) Create a singly linked list of integers.
b) Delete a given integer from the above linked list.
c) Display the contents of the above list after deletion.
2. Write a C program that uses functions to perform the following:
a) Create a doubly linked list of integers.
b) Delete a given integer from the above doubly linked list.
c) Display the contents of the above list after deletion.
3. Write a C program implement the Stack ADT using Arrays and Linked List.
4. Write a C program that uses stack operations to convert a given infix expression into its postfix
equivalent.
5. Write a C program that evaluates a postfix expression.
6. Write C program to implement queue ADT using array and doubly linked list.
7. a) Write C program to implement priority queue ADT using array.
b) Write C program to implement circular queue ADT using array.
8. Write C program for implementing the following sorting methods:
b) Insertion sort b) Merge sort
9. Write C program for implementing the following sorting methods:
b) Quick sort b) Selection sort

10. Write a C program for implementing Heap sort algorithm.

11. Write a C program that uses functions to perform the following:
a) Create a Binary Search Tree (BST).
b) Insert data in BST
b) Traverse the above BST recursively in Postorder.
12. Write a C program that uses functions to perform the following:
a) Deletion an element BST
b) Traverse the above BST non recursively in Inorder.
13. Write a C program to implement all the functions of a dictionary (ADT) using hashing.
14. Write C program for implementing Depth first traversal and Breadth first traversal.

Course Outcomes:
At the end of this lab session, the student will
CO 1 Be able to design and analyze the time and space efficiency of the data
structure
CO 2 Be capable to identity the appropriate data structure for given problem
CO 3 Have practical knowledge on the application of data structures

Assessment Method
Assessment Experiment Report/Viva-Voce/ Quiz/MCQ/Lab
Total
Tool s project
Weightage (%) 25% 15% 40%

Course Nature Practical

Assessment Method
Assessment Tool Experiment Record Viva-Voce/ Total
s Quiz/MCQ/Lab project
Weightage (%) 25% 5% 10% 40%
End Semester Examination weightage (%) 60%

Course Course name Course L-T-P Credits

code Category
23BE1201 Environmental Science MC 2-0-0 0
Course Learning Objectives:
1. To provide knowledge about multidisciplinary nature of environment, various sources of
natural energy.
2. Understanding of ecosystem structure and function etc.
3. Knowledge of biodiversity and conservation.
4. Understanding of problems caused by pollution and its impact.
5. Understanding about the various social issues related to environment.
6. Awareness for the Environment and human health.

Course Content:

UNIT-I: The Multidisciplinary Nature of Environmental Studies and Natural Resources

(9 Contact Hours)
The Multidisciplinary Nature of Environmental Studies: Definition, scope and importance;
Need for public awareness.

Natural Resources: Renewable and Non Renewable Resources

Natural resources and associated problems.
a) Forest resources: Use and over-exploitation, deforestation, case studies. Timber extraction,
mining, dams and their effects on forest and tribal people. b) Water resources: Use and over-
utilization of surface and ground water, floods, drought, conflicts over water, dams-benefits and
problems. c) Mineral resources: Use and exploitation, environmental effects of extracting and using
mineral resources, case studies. d) Food resources: World food problems, changes caused by
agriculture and overgrazing, effects of modern agriculture, fertilizer-pesticide problems, water
logging, salinity, case studies. e) Energy resources: Growing energy needs, renewable and non
renewable energy sources, use of alternate energy sources. Case studies. f) Land resources: Land as
a resource, land degradation, man induced landslides, soil erosion and desertification. Role of an
individual in conservation of natural resources. Equitable use of resources for sustainable lifestyles.

UNIT-II: Ecosystems (4 Contact Hours)

Concept of an ecosystem, Structure and function of an ecosystem, Producers, consumers and
decomposers,Energy flow in the ecosystem,Ecological succession, Food chains, food webs and
ecological pyramids,Introduction, types, characteristic features, structure and function of the
following ecosystem:-a. Forest ecosystem, b. Grassland ecosystem, c. Desert ecosystem, d. Aquatic
ecosystems (ponds, streams, lakes, rivers, oceans, estuaries).

UNIT-III: Biodiversity and It’s Conservation (4 Contact Hours)

Introduction – Definition: genetic, species and ecosystem diversity, Biogeographical classification
of India,Value of biodiversity: consumptive use, productive use, social, ethical, aesthetic and option
values, Biodiversity at global, National and local levels, India as a mega-diversity nation, Hot-
sports of biodiversity, Threats to biodiversity: habitat loss, poaching of wildlife, man-wildlife
conflicts, Endangered and endemic species of India, Conservation of biodiversity: In-situ and Ex-
situ conservation of biodiversity.

UNIT-IV: Environmental Pollution (6 Contact Hours)

Cause, effects and control measures of:-a. Air pollution, b. Water pollution, c. Soil pollution, d.
Marine pollution, e. Noise pollution, f. Thermal pollution, g. Nuclear hazards, Solid waste
Management: Causes, effects and control measures of urban and industrial wastes, Role of an
individual in prevention of pollution, Pollution case studies, Disaster management: floods,
earthquake, cyclone and landslides.
UNIT- V: Social Issues and the Environment (4 Contact Hours)
From Unsustainable to Sustainable development Urban problems related to energy, Water
conservation, rain water harvesting, watershed management, Resettlement and rehabilitation of
people; its problems and concerns. CaseStudies, Environmental ethics: Issues and possible
solutions.• Climate change, global warming, acid rain, ozone layer depletion, nuclear accidents and
holocaust. Case Studies. Wasteland reclamation, Consumerism and waste products, Environment
Protection Act, Air (Prevention and Control of Pollution) Act, Water (Prevention and control of
Pollution) Act, Wildlife Protection Act, Forest Conservation Act, Issues involved in enforcement of
environmental legislation, Public awareness.

UNIT-VI: Human Population and the Environment (3 Contact Hours)

Population growth, variation among nations, Population explosion – Family Welfare Programme,
Environment and human health, Human Rights, Value Education, HIV/AIDS, Women and Child
Welfare, Role of Information Technology in Environment and human health, Case Studies.

Learning Resources

Text Book:
1. Erach Bharucha, ‘Textbook of Environmental studies’, UGC

Reference Books:
1. Clark RS, ‘Marine Pollution’, Clanderson Press, Oxofrd (TB).
2. De AK, ‘Environmental Chemistry’, Wiley Eastern Ltd.

Course Outcomes: At the end of the course, the student will be able to
Well understanding about their surrounding natural resources and their
CO 1 conservation
CO 2 Able to understand the ecosystem food chain and habitat.
CO 3 Develop the practices for conservation of biodiversity
CO 4 To well understand the pollution courses, impact and prevention from pollution
CO 5 Able to bring about an awareness of a variety of environmental concerns.
CO 6 It attempts to create a pro-environmental attitude and a behavioral pattern in
society that is based on creating sustainable lifestyles.

Assessment Method
Assessment Weekly tests Monthly tests End Semester Test Total
Tool
Weightage (%) 10% 30% 60% 100%

********************************************************************

ENGINEERING SECOND YEAR:SEMESTER-1

***********************************************

Course code Course

Course Name L-T-P Credits
Category
23MA2102 Probability and Statistics
BSC 3-1-0 4
(CSE)
Course Learning Objectives:
1. Providing students with a formal treatment of probability theory.
2. Equipping students with essential tools for statistical analysis.
3. Fostering understanding through real-world statistical applications.
4. Develop skills in presenting quantitative data using appropriate diagrams, tabulations.
5. Use appropriate statistical methods in the analysis of simple datasets.
6. Instill the belief that Statistics is important for scientific research.

Course Content:

Unit – I
Probability and theorems in Probability (8 Contact Hours)
Probability introduction through Sets and Relative Frequency, Experiments and Sample
Spaces, Discrete and Continuous Sample Spaces, Events, Probability Definitions and Axioms,
Mathematical Model of Experiments, Probability as a Relative Frequency, Joint Probability,
Conditional Probability, Total Probability, Bayes’ Theorem and Independent Events.

Unit – II
Probability Distributions: (10 Contact Hours)
Discrete distributions: Bernoulli, Binomial, Poisson, Negative Binomial, Geometric and hyper
geometric distributions (Find their mean, variance and problems). Continuous distributions:
Uniform, Exponential, Normal, Beta and Gamma distributions.

Unit – III
Moment Generating functions (10 Contact Hours)
Functions of Random Variables, Correlation coefficient and Bivariate Normal Distribution.
Probability Inequalities and Generating Functions, Moment Generating Function, Characteristic
Function, Cumulant Generating Function, Probability Generating Function.

Unit – IV
Order Statistics and Central Limit theorem (08 Contact Hours)
Order Statistics, Convergence of Sequence of Random Variables, Weak Law of Large Numbers,
Strong Law of Large Numbers, Central Limit Theorem.

Unit - V
Sampling Theory: (12 Contact Hours)
Definition of population, sampling, statistics and parameters. Types of sampling, Expected values
of sample mean and variance, sampling distribution, standard error, sampling distribution of mean
and sampling distribution of variance. Sampling -Distributions (t, F and Chi-square), confidence
interval and interval estimation.

Unit – VI
Large Sample Tests: (12 Contact Hours)
Definition of Null and alternative hypothesis, critical region. Type I and Type II errors, power of the
test, one tail, two tail tests, Tests for the single mean, two means, single proportion and two
proportions using Z-test and t-test, t-test and F-test for significance of difference variance.
Learning resources

Text book:
1 William W. Hines and Douglas C. Montgomery, ‘Probability and Statistics in Engineering’, Willy
Publications, 4th Edition.
Reference Books:
1. Sheldon Ross, ‘A First Course in Probability’, Pearson Publications, 9th Edition.
2. Athanasios Papoulis and S. Unnikrishna Pillai, ’Probability, Random Variables and Stochastic
Processes’, TMH, 4th Edition,.

Web resources:
1. https://nptel.ac.in/courses/117105085/
2. https://nptel.ac.in/courses/111106112/
3. https://nptel.ac.in/courses/111102111/
4. RGUKT Course Content

Course outcomes: At the end of the course, the student will be able to
CO 1 Apply Probability theory via Bayes Rule.
CO 2 Describe the properties of Discrete and Continuous distributions.
CO 3 Apply problem-solving techniques to solving real-world events.
CO 4 Apply selected probability distributions to solve problems.
CO 5 Develop problem-solving techniques needed to accurately calculate probabilities.
CO 6 Interpret and clearly present output from statistical analysis.

Assessment Method
Assessment Weekly tests Monthly tests End Semester Test Total
Tool
Weight age (%) 10% 30% 60% 100%

******************************************************************************

Course
Course Code Course Name L-T-P Credits
Category
23EC2109 Digital Logic Design ESC 3-0-0 3

Course Learning Objectives:

1. To discuss the relevance of Digital Logic Design with Computer Science and Engineering
course.
2. To discuss the concepts of Number systems and representations, combinational design,
sequential designs and complete system design at gate-level abstraction in computer Design.
3. To discuss the important features of IC design like area, power and delay.

Course Content
Unit-I (8 Contact Hours)
Number systems-Representations-Conversions, error detection and error correction, Boolean
constants and variables, basic gates: operation and truth tables, describing logic gates algebraically,
evaluating logic circuit outputs, implementing circuits from Boolean expressions, universality of
gates, Boolean theorems.
Unit-II (8 Contact Hours)
Combinational circuit minimization using Boolean laws and karnaugh maps, multilevel synthesis,
logic levels and noise margins. Single bit adders and subtractors, parallel adders, multi-bit
subtraction using adders, signed multiplier, unsigned multiplier.
Unit-III (6 Contact Hours)
Decoders, Encoders, Multiplexers, Demultiplexers. Realization of various functions using
Decoders, Multiplexers. Priority encoders ,IC 74x148.
Unit-IV (7 Contact Hours)
Bistable elements, Latches and Flip-flops : S-R latch, D latch, J - K Flipflop, D Flipflop,
master/slave flip-flop, edge triggered J-K flip-flop with asynchronous inputs, T flip-flops.
Excitation tables, Characteristic tables, Characteristic equations.
Unit-V (8 Contact Hours)
Frequency division and counting. Design and analysis of synchronous counters, asynchronous
counters. State diagrams for D-flipflop, T-Flip flop, J-K Flip flop, Mealy machines and Moore
machines.
Unit-VI (8 Contact Hours)
Design and display of mobile numbers using synchronous and asynchronous counters, design and
display of digital clock using synchronous and asynchronous counters.

Learning Resources:
Text books:
1. Ronald J Tocci, Neal S.Widmer, Gregory L.Moss,'Digital systems' Pearson 10th edition.
2. Stephen Brown, Zvonko Vranesic,'Fundamentals of Digital Logic with Verilog Design',
TMH, 2nd edition.

Reference books
1. John F.Wakerly, 'Digital Design' , Pearson 4th edition.
Web Resources
1. Prof. Shankar Balachandran, NPTEL-IIT Madras, 'Digital Circuits & Systems'
URL: https://nptel.ac.in/courses/117106114/
2. Prof. S Srinivasan, NPTEL-IIT Madras, 'Digital Circuits and Systems'
URL: https://nptel.ac.in/courses/117106086/

Course Outcomes
At the end of the course, the student will be able to
CO 1 Apply the knowledge of simplification in obtaining optimal digital circuits
CO 2 Employ Boolean algebra to describe the function of logic circuits
CO 3 Design circuits which represent digital logic expressions. Specifically, design a
gate-level digital circuit to implement a given Boolean function
CO 4 Study and examine the SSI, MSI, LSI and Programmable elements
CO 5 Analyse the operation of synchronous and asynchronous state machines
CO 6 Design any combinational or sequential digital circuits to meet the given
specifications
CO 6 Analyse any digital circuit and to debug such circuit
CO 7 Prototype a real time application on EDA tool

Assessment Method
Assessment Weekly tests Monthly tests End Semester Test Total
Tool
Weightage (%) 10% 30% 60% 100%
***************************************************************************

Course
Course Code Course Name L-T-P Credits
Category
Design & Analysis of
23CS2101 PCC 3-1-0
Algorithms 4

Course Learning Objectives:

1. Interpret the fundamental needs of algorithms in problem solving.
2. Classify the different algorithm design techniques for problem solving.
3. Develop algorithms for various computing problems.
4. Analyze the time and space complexity of various algorithms.
Course Content
Unit I (8 Contact Hours)
Algorithm, Pseudo code for expressing algorithms, Performance Analysis-Space complexity, Time
complexity, Asymptotic Notation- Big oh notation, Omega notation, Theta notation and Little oh
notation, Probabilistic analysis, Amortized analysis. Analysis of Insertion Sort & Heap Sort.
Unit II (10 Contact Hours)
Divide and conquer: General Method, solving of recurrence relations – Substitution Method,
Recursion Tree Method, Masters Method, applications-Binary search, Quick sort, Merge sort,
Strassen’s matrix multiplication.

Unit III (10 Contact Hours)

Greedy method: General method, applications-Job sequencing with deadlines, 0/1 knapsack
problem, Minimum cost spanning trees, Disjoint Sets- disjoint set operations, union and find
algorithms, spanning trees, connected components and bi-connected components, Single source
shortest path problem.

Unit IV (10 Contact Hours)

Dynamic Programming: General method, applications-Matrix chain multiplication, Optimal
binary search trees, 0/1 knapsack problem, All pairs shortest path problem, Travelling sales person
problem, Reliability design.

Unit V (12 Contact Hours)

Backtracking: General method, applications-n-queen problem, sum of subsets problem, graph
coloring, Hamiltonian cycles.
Branch and Bound: General method, applications - Travelling sales person problem, 0/1 knapsack
problem- LC Branch and Bound solution, FIFO Branch and Bound solution.

Unit VI (10 Contact Hours)

String Matching: Naive string matching, Tries, Rabin Karp Algorithm, KMP algorithm, Boyer
moore Algorithm.
NP-Hard and NP-Complete problems: Basic concepts, non deterministic algorithms, NP - Hard
and NP Complete classes, Reducibility.

Learning resources
Text Books:
9. Thomas H.Cormen, Charles E. Leiserson, Ronald L.Rivest, Clifford Stein , “Introduction to
Algorithms”.
Reference Books:
3. SatrajSahni and Rajasekharam,“Fundamentals of Computer Algorithms”,
4. Galgotia publications pvt. Ltd.
5. ParagHimanshu Dave, HimanshuBhalchandraDave,”Design and Analysis
algorithms”,Publisher: Pearson.
6. R.C.T.Lee, S.S.Tseng, R.C.Chang and T.Tsai, McGraw Hill “Introduction to Design and
Analysis of Algorithms A strategic approach”
7. Allen Weiss “Data structures and Algorithm Analysis in C++”, Second edition,
8. Pearson education.
9. Aho, Ullman and Hopcroft “Design and Analysis of algorithms” Pearson education.

Web Resources
1.https://www.oreilly.com/library/view/design-and-analysis/9788177585957/
2.https://www.tutorialspoint.com/design_and_analysis_of_algorithms
3.https://www.amazon.in/Design-Analysis-Algorithms-V-Muniswamy/dp/9380026730

Course outcomes: At the end of the course, the student will be able to
CO 1 Synthesize efficient algorithms in common engineering design situations.
Major techniques for algorithm design and analysis are introduced through the
CO 2
study of various algorithms.
CO 3 Apply design principles and concepts to algorithm design

CO 4 Have the mathematical foundation in analysis of algorithms

CO 5 Understand different algorithmic design strategies

CO 6 Analyze the efficiency of algorithms using time and space complexity theory

Assessment Method
Assessment
Weekly tests Monthly tests End Semester Test Total
Tool
Weightage (%) 10% 30% 60% 100%

***************************************************************************

Course
Course code Course name L-T-P Credits
Category
23CS2102 Database Management Systems PCC 3-0-0 3

Course Learning Objectives:

1. To Understand the role of a database management system in an organization.
2. To Understand the basics of ER Diagram, Relational model, Relational Algebra and
Relational Calculus.
1. To Understand basic database concepts, including the structure and operation of the
relational data model.
2. To Construct simple and moderately advanced database queries using Structured Query
Language (SQL).
3. To Understand and successfully apply logical database design principles, including E-R
diagrams and database normalization.
4. To Understand the concept of a database transaction and related database facilities and
indexing techniques.

Course Content:
Unit I (8 Contact Hours)
Introduction to database systems, File System vs. Database Systems, Database system structure,
Views of data in a database system, Data models and Database languages.
Introduction to Entity-Relationship data model, Elements of an ER model, Constructing ER
diagrams, Modelling of constraints, Reduction of ER diagrams to relational tables.

Unit II (6 Contact Hours)

Basics of relational model, ER diagrams to relational design, Relational algebra: Simple operations
and extended operations, writing relational algebra expressions for queries, Introduction to tuple
relational calculus and writing basic queries using tuple calculus
Unit III (9 Contact Hours)
Basic structure of SQL queries, Writing simple queries, Complex queries and nested Subqueries in
SQL, Aggregate functions in SQL, Effect of NULL values on result, Defining a Relational Schema,
View definitions and constraints, types of keys. Introduction to PL/SQL..
Unit IV (7 Contact Hours)
Features of Good Relational Designs, Atomic Domains and First Normal Form, Problems
encountered in bad schema design, Motivation for normal forms, Dependency theory-functional
dependencies, Armstrong’s Axioms for FD, Closure of a set of FD’s, Minimal Cover, Definition of
1NF, 2NF, 3NF and BCNF, Decomposition and desirable properties of them.
Unit V (6 Contact Hours)
Storing data in disk and files and the memory hierarchy, RAID, File organization and indexes,
ISAM Tree.
Unit VI (9 Contact Hours)
Transaction concept, ACID properties, Concurrency in a DBMS, Serializability and Recoverability,
Concurrency control Protocols (lock-based and time-stamp based)

Learning Resources:
Text Books:

1. A. Silberschatatz, H. F. Korth and S. Sudarshan, Database System Concepts, 5/e, McGraw

Hill,2006.
2. R. Ramakrishnan and J. Gehrke, Database System Concepts, 3/e, McGraw Hill, 2003.
3. Wilfried Lemahieu, Seppe Vanden Broucke and Bart baesens Principles of Database
Management Systems, 1/e Cambridge 2018.
Reference Books:

1. Ramez Elmasri, Shamkant B. Navathe , Fundamentals of Database (7th Edition),

Paperback, 2007
2. Theorey T J, Database Modeling & Design, 2/e, Morgan Kaufmann Publishers, 1994.
3. H. GarciaMolina, J. D. Ullman and J. Widom, Database Systems The Complete Book, 1/e,
Pearson Education, 2007
Web Resources:
1. Department of CS&E, IIT M, “Introduction to Database Sytems and Design”,
https://nptel.ac.in/courses/106106095/
2. Indian Institute of Technology, Kharagpur, “ Database Management Systems”,
https://nptel.ac.in/courses/106105175/
Course Outcomes: At the end of the course, the student will be able to
CO 1 Demonstrate the basic elements of a relational database management system,
CO 2 Ability to identify the data models for relevant problems.
Ability to design entity relationships and convert entity relationship diagrams
CO 3
into RDBMS and formulate SQL queries on the respect data.
CO 4 Apply normalization for the development of application software
CO 5 Ability to learn about Disk Management, Buffer management
CO 6 Ability learn about transaction management

Assessment Method
Assessment Weekly tests Monthly tests End Semester Test Total
Tool
Weightage (%) 10% 30% 60% 100%

Course Course
Course Name L-T-P Credits
code Category
Formal Languages and Automata
23CS2103 PCC 3-0-0 3
Theory

Course Learning Objectives:

1. To understand and design Finite State Machines and applications.
2. To Understand about Regular Expressions and its applications.
3. Understanding of formal grammars and their applications.
4. Understanding various other formal languages and their designing models.
5. To understand Decidability and Undecidability of various problems in theoretical computer
science.

UNIT I: Introduction to Automata (6 Contact Hours)

Strings, Alphabet, Language, Operations, Finite state machine, definitions, finite automaton model,
acceptance of strings, and languages, deterministic finite automaton and non-deterministic finite
automaton, transition diagrams and Language recognizers.

UNIT II: Finite Automata (9 Contact Hours)

NFA with Ɛ-transitions - Significance, acceptance of languages. Conversions and Equivalence:
Equivalence between NFA with and without Ɛ transitions, NFA to DFA conversion, minimization of
FSM, equivalence between two FSM’s, Finite Automata with output- Moore and Mealy machines,
Equivalence between Moore and Mealy.

UNIT III: Regular Languages (6 Contact Hours)

Regular sets, regular expressions, identity rules, Constructing finite Automata for a given regular
expressions, Conversion of Finite Automata to Regular expressions. Pumping lemma of regular
sets, Closure properties of regular sets (Proofs not required).

UNIT IV: Grammars (9 Contact Hours)

Regular grammars: Right linear and left linear grammars, Equivalence between regular linear
grammar and FA, Inter conversion, Context free grammar, derivation trees, and sentential forms.
Right most and leftmost derivation of strings.
Context Free Grammars: Ambiguity in context free grammars. Minimization of Context Free
Grammars. Chomsky Normal Form, Greibach Normal Form, Pumping Lemma for Context Free
Languages. Enumeration of properties of CFL (Proofs omitted).

UNIT V: Push Down Automata (7 Contact Hours)

Push down automata, definition, model, acceptance of CFL, Acceptance by final state and
acceptance by empty state and its equivalence. Equivalence of CFL and PDA, Inter conversion.
(Proofs not required). Introduction to DCFL and DPDA.

UNIT VI: Turing Machine & Computability Theory (8 Contact Hours)

Recursive and Recursively enumerable languages, and Church’s Hypothesis. Turing Machine:
Introduction, Components of Turing Machine, Description of Turing Machine, Elements of TM,
Language accepted by a TM, Role of TMs, Design of TMs, Universal Turing Machine,
Undecidability of Post Correspondence problem.

Learning Resources:
Text Books:
1. Hopcroft, J D Ullman “Introduction to Automata and Language Theory”, 3rd Edition, 2006
2. C. Papadimitrou and C. L. Lewis. Elements of Theory of Computation, Prentice-Hall, 1981.

Reference Books:
1. John.C.Martin, “Introduction to Languages and the Theory of Computation” McGraw-Hill
Education, 01- May-2010.
2. Kamala Krithivasan, Rama.R, “Introduction to Formal Languages, Automata Theory and
Computation”, Pearson Education India, 01-Sep-2009
Web Resources:
1. Indian Institute of Technology, Guwahati, “ Formal Languages and Automata
Theory”, https://nptel.ac.in/courses/111103016/
Course outcomes: At the end of the course, the student will be able to
CO 1 Construct finite state diagrams while solving problems of computer science
CO 2 Ability to convert NFA to DFA and Epsilon NFA to DFA
CO 3 Ability to convert RE to Finite Automata and vise versa
CO 4 Design of new grammar and language
CO 5 Ability to design PDA and NPDA
Ability to learn design of Turing machine and Find solutions to the problems
CO 6
using Turing machines

Assessment Method
Assessment Weekly tests Monthly tests End Semester Test Total
Tool
Weightage (%) 10% 30% 60% 100%

Course
Course Code Course Name L-T-P Credits
Category
Design & Analysis of
23CS2181 PCC 0-0-3 1.5
Algorithms Lab

Course Learning Objective:

1. This practical course should enable the students to design the algorithms.
2. Lear how to analyze a problem and design the solution for the problem
3. Design and Implement efficient algorithms for a specified application
4. Strengthen the ability to identify and apply the suitable algorithm for a given real world
problem.
5. To understand various graph algorithms.

List of Experiments:
1. Lab No 1: Implementation and Analysis of Sorting Algorithms – Quick Sort, Merge Sort &
Heap Sort
2. Lab No 2: Warshalls Algorithms – Applying to Topological Ordering of vertices in a given
digraph and computing the transitive closure of given directed graph
3. Lab No 3: Implement 0/1 Knapsack Problem using Dynamic Programming
4. Lab No 4: Shortest Paths Algorithms : All Pair Shortest Path algorithms – Floyds Algorithm
and other algorithms
5. Lab No 5: Implement any scheme to find the optimal solution for the Travelling Salesman
Problem
6. Lab No 6: Implement Minimum Spanning Tree Algorithms – Prims Algorithms and Kruskal
Algorithm
7. Lab No 7: Single Source Shortest Path Algorithms and other Graph Algorithms like
connected components
8. Lab No 8: Implement the Sum of Subsets Problem
9. Lab No 9: Implementation of any scheme to solve the SUDOKU puzzle
10. Lab No 10: Implement N Queens Problem using the Back Trackin

Course Outcomes
At the end of the course, the student will be able to
CO 1 To analyze asymptotic notation and worst, average and best case analysis using
suitable mathematical tools.
CO 2 To design efficient algorithms for computational problems using appropriate
algorithmic paradigm.
CO 3 To understand different graph algorithms and traversal problems.
CO 4 To analyze the complexity of different class of problems.
CO 5 To explain the role of randomization and approximation in computation

Assessment Method
Course Nature Practical
Assessment Method
Assessment Tool Experiment Record Viva-Voce/ Total
s Quiz/MCQ/Lab project
Weightage (%) 25% 5% 10% 40%
End Semester Examination weightage (%) 60%

Course Nature Practical

Assessment Method
Assessment Tool Experiment Record Viva-Voce/ Total
s Quiz/MCQ/Lab project
Weightage (%) 25% 5% 10% 40%
End Semester Examination weightage (%) 60%

*************************************************************************

Course Code Course Name Course Category L-T-P Credits

23EC2189 Digital Logic Design Lab ESC 0-0-3 1.5

Course Learning Objectives:

1. To expose to the concept of Digital knowledge and its applications.
2. To understand Combinational and Sequential circuits.
3. To design a prototype digital logic design.

List of Experiments
1. Familiarization with logic gate IC’s and Arduino kits.
2. Design of code converters and comparators (8-bit) on breadboard
3. Adder related experiments: Half adder , full adder , half subtractor, full subtractor , ripple
carry adder, BCD adder, carry look ahead adder using IC.
4. Design of a binary multiplier and displaying its inputs and outputs on seven segment display
unit.
5. Familiarization with multiplexer, decoder, encoder. Design of Half adder, full adder,
magnitude comparator and other examples using above familiarized components.
6. Bi-stable multi-vibrator design. Design and verification of SR,JK,D,T latch/flip-flops.
Verification and elimination of Race Around Condition.
7. Flip-flop
conversions and Design of frequency dividers.
8. Design of synchronous counters (Up and Down) and displaying result on seven segment
display unit.
9. Design of Mod n ≤ 2n counter design( total 8 states, design of mod6 and mod7 with
clear.
10. Design and IC verification of Decade counter.
11. Cascading of counters.
12. Synchronous counter design and displaying result on seven segment display unit.
13. Random sequence.
14. Ring counter/Johnson counter.
15. Verification and analysis of ALU IC.
16. Design of a digital clock in synchronous state machine design and in asynchronous state
machine design.
17. Design and submission of term project.
Note:
1. All the above experiments (except few exceptional cases) are to be implemented on Arduino
kits also.
2. It is mandatory to perform experiment on any one of the EDA Tools before the experiment is
done on hardware. All experiments must be unique, design specifications should not be common in
the lab.

Course Outcomes:
After the completion of this Laboratory course, the student will be able to
CO 1 Understand the implementation of discrete digital components
CO 2 Utilize the ICs of Decoder, Multiplexer, Seven segment display unit in
combination circuit design
CO 3 Utilize the ICs of suitable Flipflops in sequential circuit design
CO 4 Utilize the Programmable Logic devices in digital design
CO 5 Understand the concepts of setup time, hold time, propagation delays
CO 6 Design circuits with optimal features of Area, Power and delay
CO 7 Design and implement prototypes of complete digital systems

Assessment Method
Assessment Tool Experiment Report/Viva-Voce/ Quiz/MCQ/Lab Total
s project
Weightage (%) 25% 15% 40%
End Semester Examination weightage (%) 60%

Course Nature Practical

Assessment Method
Assessment Tool Experiment Record Viva-Voce/ Total
s Quiz/MCQ/Lab project
Weightage (%) 25% 5% 10% 40%
End Semester Examination weightage (%) 60%

Course
Course Code Course Name L-T-P Credits
Category
Database Management Systems
23CS2182 PCC 0-0-3 1.5
Lab

Course Objectives:
1. Analyze the problem and identify the Entities and Relationships, keys for a given database.
2. Design, develop and query a database.
3. Able to construct queries and maintain a simple database using MySQL.
4. Normalization of data present in database tables.
5. Develop trigger programs using PL/SQL.
List of Experiments:
1. Designing the Database through Identifying Entities, Relationship Attributes.
MySQL
1. Queries to facilitate acquaintance of Built-In Functions, String Functions, Numeric
Functions.
2. Queries to facilitate acquaintance of Date Functions and Conversion Functions.
3. Queries for Creating, Dropping, and Altering Tables.
4. Queries using operators in SQL.
5. Queries to Retrieve and Change Data: Select, Insert, Delete, and Update.
6. Queries using Group By, Order By, and Having Clauses.
7. Queries on Controlling Data: Commit, Rollback, and Save point.
8. Queries for creating Views, and Constraints.
9. Queries on Joins ( Outer and Inner joins).
10. Queries on Correlated Sub-Queries.
PL/SQL
1. Write a PL/SQL Code using Basic Variable, Anchored Declarations, and Usage of
Assignment Operation.
2. Write a PL/SQL block using SQL and Control Structures in PL/SQL.
3. Write a PL/SQL Code using Cursors, Exceptions and Composite Data Types.
4. Write a PL/SQL Code using Procedures, Functions, and Packages FORMS.
Course Outcomes:
After completing this course the student must demonstrate the knowledge and ability to:
CO 1 Identify the entities, attributes, relationships, keys for a given database.
CO 2 Design a database schema for a given problem.
CO 3 Formulate queries using MySQL DML, DDL commands.
CO 4 Formulate SQL queries using constraints and set comparison operators.
CO 5 Apply the normalization techniques for development of application software
to realistic problems.
CO 6 Develop PL/SQL programs using triggers, procedures
CO 7 Ability to design and implement given case study.

Course Nature Practical

Assessment Method
Assessment Tool Experiment Record Viva-Voce/ Total
s Quiz/MCQ/Lab
project
Weightage (%) 25% 5% 10% 40%
End Semester Examination weightage (%) 60%

ENGINEERING SECOND YEAR: SEMESTER-2

****************************************

Course
Course
Course Name L-T-P Credits
Code Category
23BM2202
Introduction to Operation Research HSMC 3-0-0 3

Course Learning Objective:

1. The objective of this course is to provide exposure to the major tools and techniques of
Operations Research.
2. To create awareness and appreciation about the applications of Operations Research in the
functional areas of management.
3. To provide a formal quantitative approach to problem solving and an intuition about situations
where such an approach is appropriate.
4. To introduce some widely- used mathematical models.
5. The understanding of these models will allow the students to communicate with persons who run
them and to evaluate the results they present.
6. To provide a tool that the students can use to solve management problems.

Course Contents:

Unit I: (6 Contact Hours)

Decision making, Development of OR, An overview and scope of Operations Research
Application of OR.

Unit II: (9 Contact Hours)

Linear Programming Problems (LPP), Introduction to Linear Programming (LP) Illustration of LP
Problems. Formulation exercises on LP Problem, Graphical Method of solving LPP Simplex
Method, Unboundedness, Multiple Optimum Solutions, Degeneracy and Cycling Problems.

UNIT III: (9 Contact Hours)

Artificial Variables : Big-M Method, Sensitivity Analysis, Duality Problems, Economic
Interpretation of Simplex Tableau Computer Software for Solving LPP.
UNIT IV: (9 Contact Hours)
Formulation of Transportation Problems, Sensitivity Analysis in Transportation Problems,
Assignment Problems.

UNIT V: (7 Contact Hours)

Elements of queuing models, Poisson arrival and exponential service time distributions, M/M/1
Queue; Finite population models. Queuing cost models, Applications.

UNIT VI: (5 Contact Hours)

Introduction of Costs, Deterministic and Stochastic models.

Learning Resources:
Text Book:
1. Taha H.A., Operation Research- An Introduction, PHI, (2008)

Reference Books:

1. Ravindran, Phillips & Solberg, Operations research, John Wiley, Singapore, (2007)

2. Richard Levin & David Rubin, Quantitative approaches to Management, Mc GrawHill

International, (1992).
3. Hillier & Lieberman, Operation Research, Addison Wesley, (1974)
4. Hadley G., Linear Programming, Addison-Wesley, (1962).
Web Resources:
1. Introduction to Operation Research, Prof. G.S, Srinivasan, IIT Madras
https://nptel.ac.in/courses/110106062/

Course outcomes: At the end of the course, the student will be able to

CO 1 A student will be able to understand basic of operation research and its

multipurpose uses
CO 2 It will provide application facilities of concepts.

CO 3 Students can be able to explore different uses of linear programming with its
advance technique.
CO 4 It will enable to take decision regarding assignment, transportation and queuing
related issues
CO 5 This will provide alternative techniques with its effective uses

CO 6 It will have an overall impact on the decision making related to

various types of real time issues.

Assessment Method
Assessment Weekly tests Monthly tests End Semester Total
Tool Test
Weightage 10% 30% 60% 100%
(%)

****************************************************

Course Course
Course Name L-T-P Credits
Code Category
23CS2201 Computer Organization and
PCC 3-0-0 3
Architecture

Course Learning Objectives:

1. To conceptualize the basics of organizational and architectural issues of a digital
computer.
2. To analyze performance issues in processor and memory design of a digital
computer.
3. To understand various data transfer techniques in digital computers.
4. To analyze processor performance improvement using instruction level parallelism

Course content:
UNIT-I (8 Contact Hours)
Basic Functional blocks of a computer: CPU, memory, input -output subsystems, control unit.
Data Representation: Number systems, signed number representation, fixed and floating point
representations, character representation.
UNIT-II (9 Contact Hours)
ALU: Computer Integer Arithmetic: addition, subtraction, multiplication, division, floating point
arithmetic: Addition, subtraction, multiplication, division.
Instruction set architecture of a CPU registers, instruction execution cycle, RTL interpretation of
instructions, addressing modes, instruction set. RISC and CISC architecture. Case study instruction
sets of some common CPUs.
UNIT-III (9 Contact Hours)
CPU control unit design: Introduction to CPU design, Processor Organization, Execution of
Complete Execution, Design of Control Unit: hardwired and micro-programmed control, Case
study design of a simple hypothetical CPU.
UNIT-IV (8 Contact Hours)
Memory system design: Concept of memory: Memory hierarchy, SRAM vs DRAM ,Internal
organization of memory chips , cache memory: Mapping functions, replacement algorithms,
Memory management, virtual memory.
UNIT-V (6 Contact Hours)
Input -output subsystems, I/O transfers: programmed I/O, interrupt driven and DMA.
I/O Buses, Peripheral devices and their characteristics, Disk Performance
UNIT-VI (5 Contact Hours)
Performance enhancement techniques: Pipelining: Basic concepts of pipelining,
Throughput and speedup, pipeline hazards.
Parallel processing: Introduction to parallel processing, Introduction to Network, Cache coherence

Learning Resources:
Text Books:
1.V. C. Hamacher, Z. G. Vranesic and S. G. Zaky, “Computer Organization,” 5/e, McGraw Hill,
2002.
2. William Stallings, “Computer Organization and Architecture”: Designing for Performance, 8/e,
Pearson Education India. 2010.
3.Morris Mano, “ Computer System Architecture”, Pearson Education India, Third edition.

References:
1.A. S. Tanenbaum, “Structured Computer Organization”, 5/e, Prentice Hall of India, 2009.
2.D. A. Patterson and J. L. Hennessy, “Computer Organization and Design,” 4/e, Morgan
Kaufmann, 2008.
3.J. L. Hennessy and D. A. Patterson,” Computer Architecture: A Quantitative Approach",4/e,
Morgan Kaufmann, 2006.
4.D. V. Hall, “Microprocessors and Interfacing”, 2/e, McGraw Hall, 2006 “ 8086 Assembler
Tutorial for Beginners “By Prof. Emerson GiovaniCarati.
Web referneces:
1.https://en.wikibooks.org/wiki/IB/Group_4/Computer_Science/Computer_Organisation
2.http://www.cs.uwm.edu/classes/cs458/Lecture/HTML/ch05.html
3.http://www.cse.iitm.ac.in/~vplab/courses/comp_org.html OA IIT-Guwahati Pdf

Course outcomes: At the end of the course, the student will be able to
CO1 Understand the basic organization of computers and different instruction formats
and addressing modes.
CO2 Analyze the concept of pipelining, segment registers and pin diagram of CPU.
CO3 Understand and analyze various issues related to memory hierarchy.
CO4 Evaluate various modes of data transfer between CPU and I/O devices.
CO5 Examine various interconnection structures of multi processors.

Assessment Method
Assessment Tool Weekly tests Monthly tests End Semester Test Total
Weightage (%) 10% 30% 60% 100%

**********************************
Course code Course
Course name L-T-P Credits
Category
23CS2202 Data Science with Python PCC 3-0-0 3

Unit – I : Python Basics for Data Science (7 Contact Hours)

Introduction to Python, Types, Expressions & Variables, String Operations, Lists & Tuples, Sets,
Dictionaries, Conditions & Branching, Loops, Functions, Objects & Classes.
Unit – II: Working with Data in Python (7 Contact Hours)
File Operations, Regular Expressions, Pandas, NumPys, Web Scraping.
Unit – III: Data Processing (7 Contact Hours)
Importing DataSets; Cleaning & Preparing Data – Handling Missing Values, Data Formatting,
Binning;Summarizing the Data Frame – Descriptive Statistics, Grouping, ANOVA, Correlation.
Unit – IV: Data Analysis (8 Contact Hours)
Model Development : Simple & Multiple Linear Regression, Model Evaluation using Visualization,
Polynomial Regression; Model Evaluation – Overfitting, Underfitting, Model Selection, Ridge
Regression, Model Refinement.
Unit – V: Data Visualization (9 Contact Hours)
Introduction to Visualization Tools – Matplotlib, Line Plots, Area Plots, Histograms, Bar Charts, Pie
Charts, Box Plots, Scatter Plots, Bubble Plots; Advance Visualization Tools – Waffle Charts, Word
Clouds, Seaborn and Regression Plots; Creating Maps & Visualizing Geospatial Data – Folium,
Maps with Markers, Choropleth Maps.
Unit – VI: Machine Learning using Python (7 Contact Hours)
Introduction to Machine Learning – Supervised vs Unsupervised Learning, Python Libraries for
Machine Learning; Regression; Classification; Unsupervised Learning; Recommender Systems.

Learning resources:
Text Book:
1. Jake VanderPlas, Python Data Science Handbook - Essential Tools for Working with Data,
o'reilly publications.
Online Course Reference:
1. https://www.edx.org/professional-certificate/python-data-science

Assessment Method
Assessment Weekly tests Monthly tests End Semester Test Total
Tool
Weightage (%) 10% 30% 60% 100%

*************************************************************************
Course Code Course Name Course Category L-T-P Credits

23CS2203 Web Technologies PCC 3-0-0 3

Course Learning Objectives:

1. To demonstrate basic skills in analysing the usability of a web site.

2. To identify how to plan user research related to web design.
3. To Learn how to design, add client side script and publish web page.
4. To Learn about server side programming and deploy the app into a server.
5. To Learn about storing the data into SQL and NoSQL.
6. To Learn about Front-End Web UI Frameworks and GIT repository Tools.
7. To learn the language of the Web: jQuery Frontend design and Bootstrap.
8. To learn the language of Web: NodeJS.
UNIT I (10 Contact Hours)
Introduction to Web World: Recap on HTML, inserting Frames and frame sets, inserting
hyperlinks, lists, tables and images.
JavaScript :Client side scripting with JavaScript, variables, functions, conditions, loops and
repetition, Pop up boxes, objects,HTML DOM and web, Browser environments, form validation,
Events and Event Listeners.

UNIT II (10 Contact Hours)

Server Programming: PHP basics: PHP Syntax, variables, constants, Data Types, Strings,
Conditional and Control Structures. PHP GET and POST. PHP Advanced: include files, File system,
parsing directories, file upload and download, Sessions, Form handling, JSON Parsing.

UNIT-III (10 Contact Hours)

Database Connectivity: Introduction to SQL: Connect, create database, create table, insert,
prepared statements. Use of NoSQL: Introduction to NoSQL, Difference between SQL and NoSQL,
Types of NoSQL Databases, Query mechanism tools for NoSQL.

Authentication: Google OAuth: Basic Steps. Access to Google APIs: For Server-side Web apps,
for Java Script Web apps, for Mobile & Desktop apps.

UNIT IV (10 Contact Hours)

Front-End Web UI Frameworks and Tools: Bootstrap, Full-Stack Web Development, Setting up
Git, Basic Git commands, Online Git Repositories, Node.js and NPM, Front-end Web UI
Frameworks.

jQuery: Introduction, Selectors, Attributes, Event Handlers, Style Methods, Traversing the DOM,
Effects, and Introduction to jQuery Plugins.

UNIT V (7 Contact Hours)

Bootstrap: Introduction to Bootstrap, Responsive Design, Bootstrap Grid system, Navigation and
Navigation Bar, Icon Fonts, User Inputs, Bootstrap CSS Components, Bootstrap and JavaScript
Components, Bootstrap and JQuery, Building and Deployment, NPM Scripts, Task Runners.
UNIT VI (7 Contact Hours)
NodeJs: Introduction, Environment Setup, First Application, REPL Terminal, Native Package
Manager(NPM), Web Module, Express Framework, RESTFul API.

Learning Resources:
Text Books

1. Ralph Moseley and M. T. Savaliya, WileyIndia “Developing Web Applications”

2. Jeffrey C.Jackson,"Web Technologies--A Computer Science Perspective", PearsonEducation,
3. Dreamtech Press “Web TechnologiesBlack Book,” HTML 5,
4. Web Technologies: HTML, JAVASCRIPT, PHP, JAVA, JSP, XML and AJAX, Black Book
Kindle Edition by Kogent Learning Solutions Inc. (Author)
5. O'Reilly - Head First Servlets and JSP, 2nd Edition.
6. Node.js Web Development: Create real-time server-side applications with this practical,
step-by-step guide, 3rd Edition.
7. Bootstrap: Responsive Web Development Book by Jake Spurlock

Reference Books

1. Joel Sklar, Cengage ” Web Design”, Learning

2. Robert. W. Sebesta, "Programming the World Wide Web", Fourth Edition, PearsonEducation
3. P.J. Deitel& H.M. Deitel “Internet and World Wide Web How to program”, Pearson

Web Resources

https://www.w3schools.com/
https://www.tutorialspoint.com/web_development_tutorials.htm
https://html.com/
https://www.coursera.org/learn/bootstrap-4
https://www.tutorialspoint.com/jquery/index.htm
https://www.tutorialspoint.com/nodejs/
http://www.ntu.edu.sg/home/ehchua/programming/java/javaservlets.html
http://wiki.lib.sun.ac.za/images/0/07/Bootstrap-tutorial.pdf
https://media.readthedocs.org/pdf/htmlguide/latest/htmlguide.pdf

Course outcomes: At the end of the course, the student will be able to

CO 1 Learn how to design, add client side script and publish web page

CO 2
Learn how to write server side programming and deploy the app into a server.
CO 3
Learn how to store data into databases and NoSQL.
CO 4
Learn about Front-End Web UI Frameworks and GIT repository Tools.
CO 5
Learn about responsive Web design.
CO 6
Learn about Package manager and Web modules.

Assessment Method
Assessment Weekly tests Monthly tests End Semester Test Total
Tool
Weightage (%) 10% 30% 60% 100%

*******************************************************************************

Course Code Course Name Course Category L-T-P Credits

23CS2204 Compiler Design PCC 3-0-0 3

Course Learning Objectives:

1. To implement the concept learned in automata theory and languages to the field of
Computer Science.
2. Analyze the basic steps involved in converting a source language to target code.
3. Understands the concepts of parsers and can write solutions for various grammars by using
tools, and also analyzes different storage techniques, error recovery strategies
4. Gain the knowledge to write a compiler program or be able to build a compiler.

Course Content:

Unit I
Introduction to Compilers (6 Contact Hours)
Introduction to compilers, Phases of compiler, Lexical Analyzer, The role of the lexical analyzer,
input buffering, specification of tokens, Recognition of tokens.
Unit II
Syntax Analysis -I (9 Contact Hours)
Role of the parser, writing grammars and context free grammars, Top down parsing, Brute-force
approach, Recursive descent parsing, Predictive parsing, FIRST and FOLLOW constructs.
Unit III
Syntax Analysis -II (8 Contact Hours)
Bottom-up parsing, shift-reduce parsing, operator precedence parsing, LR parsers, SLR parser,
canonical LR parser, LALR parser.
Unit IV
Semantic Analysis (8 Contact Hours)
Syntax directed translations, applications of syntax directed translations, Syntax directed
definitions, construction of syntax tree, Bottom-up evaluation of S-attributed definitions, L-
attributed definitions.
Unit V
Intermediate Code Generation and Code Optimization (8 Contact Hours)
Intermediate languages, Declarations, Assignment statements, Boolean Expressions, case
statements, back patching, Procedure calls, Principal sources of optimization, optimization of basic
blocks, DAG representation of basic blocks, flow graphs.
Unit VI
Code generation (6 Contact Hours)
Issues in the design of code generator, the target machine, run time storage management, peephole
optimization.

Learning Resources:
Text Book:
1. Alfred V Aho, Monica S Lam, Ravi Sethi, Jeffrey D Ullman, “Compilers: Principles
Techniques & Tools”, Pearson Education,2nd Edition 2013.

Reference Books:
1. Kenneth C Louden, “Compiler Construction: Principles and Practice”, Cengage Learning.
Lex &Yacc, John R Levine, Oreilly Publishers.
2. Keith D Cooper & Linda Tarezon, “Engineering a Compiler”, Morgan Kafman, Second
edition. Lex &Yacc, John R Levine, Tony Mason, Doug Brown, Shroff Publishers.
3. Muchnik, “Advanced Compiler Design and Implementation”, Kauffman(1998)

Course Outcomes:
CO1 Identify the basic concepts needed for the development of a compiler
CO2 Analyze the various phases and Tools of a Compiler
CO3 Describe the differences between Top-Down and Bottom-Up Parsers and apply
parsing methods for various grammars.
CO4 Compare and Contrast Symbol table organization for Block Structured and Non-
Block Structured languages.
CO5 Analyze the concepts involved in Intermediate, Code Generation and Code
Optimization Process.
CO6 Recognize the various types of errors and error recovery strategies in phases of
Compilation

Assessment Method
Assessment Weekly tests Monthly tests End Semester Test Total
Tool (In semester) (In semester)
Weightage (%) 10% 30% 60% 100%
*****************************************************************************

Course Course
Course Name L-T-P Credits
Code Category
23CS2281 Computer Organization and
PCC 0-0-3 1.5
Architecture Lab

Course Objectives:
1. To expose the students to the various key aspects of Computer Organization &
Architecture.
2. To acquaint with various registers in the CPU and understand about the assembly language
programming.

List of Experiments:
Lab No 1.a) Verification of Logic gates.
b) Assembly language program to find largest number in an Array.

Lab No 2. a) Verification of Full-Adder and Full-Subtractor.

b) Assembly language program to find smallest number in an array.

Lab No 3. a)Verification of Ripple Carry Adder and Carry-look-ahead adder.

b) Assembly language program for adding to two arrays.
Lab No 4. a) Combinational Multipliers.
b) Assembly language program to separate even and odd numbers from an array.
Lab No 5. a) Booth's Multiplier.
b) Assembly language program to find prime numbers between a given range.

Lab No 6. a) Wallace Tree Adder.

b) Assembly language program to find factorial of the given number.

Lab No 7. a) Arithmetic Logic Unit.

b) Assembly language program to find LCM.
Lab No 8. a) Verification of Registers and Counters.
b) Assembly language program to find GCD.
Lab No 9. a) Memory Design.
b) Assembly language program to search an element using linear search.

Lab No 10. a) Direct Mapped cache Design.

b) Assembly language program to search an element using binary search.

Lab No 11. a) Associative cache Design.

b) Assembly language program to sort numbers using bubble sort.

Course Outcomes
At the end of the course, the student will be able to
CO 1 Understand the basic logic gates
CO 2 Understand the full adder and full subtractor
Ripple Carry Adder
examine the behavior of the working module to understand how the carry ripples
CO 3
through the adder stages
to design a ripple carry adder using full adders to mimic the behavior of the working
module .
Carry Lookahead Adder
understand the behaviour of carry lookahead adder
understand the concept of reducing computation time with respect of ripple carry
adder by using carry generate and propagate functions

Combinational Multipliers
understand the behaviour of combinational multipliers .
understand the scheme implemented for the multiplication.
it can be designed by unrolling the multiplier loop
CO4
instead of handling the carry out of partial product summation bit,the carry out can
be sent to the next bit of the next step
this scheme of handling the carry is called carry save addition

Booth’s Multiplier
Understand the behaviour of Booth's multiplication.
Design Booth's multiplier with a controller and a datapath. This will also help in the
learning of control unit design as a finite state machine
Understand the advantages of Booth's multiplier
CO 5
It can handle signed integers in 2's complement notation
It decreases the number of addition and subtraction
It requires less hardware than combinational multiplier
It is faster than straightforward sequential multiplier

Wallace Tree Adder

Understand the behaviour of the wallace tree.
CO 6
understand the concept of reducing gate delay by using tree of adders instead of
using cascaded full adders
Arithmetic Logic Unit
CO 7 Understand the behaviour of the arithmetic logic unit.
Design an arithmetic logic unit for given parameters.
Registers

to understand the shifting of data

to examine the behavior of different modes of data input and data output(serial-in
serial-out, serial-in parallel-out, parallel-in serial out,parallel-in parallel-out)
to make use of shift register in data transfer
CO8 developing skills in the designing and testing of sequential logic circuits
developing skills in analysing timing signals.
Counters
understand the concept of counting upto certain limiting value and returning back to
the start state from final state
understand the generation of timing sequences to control operations in a digital
system
develop skills in the design and testing of counters for given timing sequences
develop skills in generating timing signals .

Memory Design
CO 9 Understand the behavior of memory.
Design memory for given parameters.
Direct Mapped Cache Design
CO 10 Understand the behavior of direct mapped cache from working module
Design a direct mapped cache for given parameters.
Associative Cache Design
CO 11 Understand the behavior of associative cache.
Designs an associative cache for given parameters.
Understand and develop Assembly Language Programs

Assessment Method
Assessment Tool Experiment Record/Viva-Voce/ Quiz/MCQ/Lab project Total
s
Weightage (%) 25% 15% 40%
End Semester Examination weightage (%) 60%

*****************************************************************

Course Code Course

Course Name L-T-P Credits
Category
23CS2282 Data Science using Python Lab PCC 0-0-3 1.5

Lab:
Experiment 1:
a) Python Basics: Your first program, Types Expressions and Variables String Operations
b) Python Data Structures: Lists and Tuples Sets,and Dictionaries
c) Python Programming Fundamentals: Conditions and Branching Loops, Functions, Objects
and Classes
d) Working with Data in Python: Reading files with open, Writing files with open, Loading data
with Pandas, Working with and Saving data with Pandas
e) Working with Numpy Arrays: Numpy 1d Arrays, Numpy 2d Arrays
Experiment 2:
a) Importing Datasets: Learning Objectives, Understanding the Domain, Understanding the
Dataset, Python package for data science, Importing and Exporting Data in Python, Basic Insights
from Datasets
b) Cleaning and Preparing the Data: Identify and Handle Missing Values, Data Formatting, Data
Normalization Sets, Binning, Indicator variables
c) Model Development: Simple and Multiple Linear Regression, Model
EvaluationUsingVisualization, Polynomial Regression and Pipelines, R-squared and MSE for In-
Sample Evaluation, Prediction and Decision Making
d) Summarizing the Data Frame: Descriptive Statistics, Basic of Grouping, ANOVA, Correlation,
More on Correlation
e) Model Evaluation: Model Evaluation, Over-fitting, Under-fitting and Model Selection, Ridge
Regression, Grid Search, Model Refinement
Experiment 3:
a) Introduction to Visualization Tools: Introduction to Data Visualization,Introduction to
Matplotlib, Basic Plotting with Matplotlib,Dataset on Immigration to Canada, Line Plots
b) Basic Visualization Tools: Area Plots,Histograms,Bar Charts
c) Specialized Visualization Tools: Pie Charts, Box Plots, Scatter Plots, Bubble Plots
d) Advanced Visualization Tools: Waffle Charts, Word Clouds,Seaborn and Regression Plots
Experiment 4:
a) Introduction to Machine Learning: Applications of Machine Learning, Supervised vs
Unsupervised Learning, Python libraries suitable for Machine Learning
b) Regression: Linear Regression, Non-linear Regression, Model evaluation methods
c) Classification: K-Nearest Neighbour, Decision Trees, Logistic Regression, Support Vector
Machines,Model Evaluation
d) Unsupervised Learning:K-Means Clustering,Hierarchical Clustering, Density-Based Clustering

Assessment Method
Assessment Experiment Report/Viva-Voce/ Quiz/MCQ/Lab Total
Tool s project
Weightage (%) 25% 15% 40%
End Semester Examination weightage (%) 60%

**************************************************************

Course
Course Name Course Category L-T-P Credits
Code
23CS2283 Web Technologies Lab PCC 0-0-3 1.5

Course Learning Objective:

The course will enable the students to:
1. Demonstrate the ability to retrieve data from a database and present it in a web page.
2. Create web pages that meet accessibility needs of those with physical disabilities and apply
the effects of CSS in web page creation.
3. Create effective scripts using JavaScript and jQuery to enhance the end user experience.
4. Demonstrate knowledge of introductory programming concepts.
5. Test, debug, and deploy web pages containing JavaScript and jQuery.
6. learn to create pages common to all web applications, and implement the most frequently.
used components and classes provided by Bootstrap.
7. Understand the JavaScript and technical concepts behind Node JS.
8. Understand the Servlet programming and deploying applications in Web servers.

List of Experiments:
1. Install and configure the IDE.
2. Incorporating JavaScript on an HTML page, and how to link to an external .js file
3. Comparing JavaScript with jQuery for same tasks.
4. Using major methods/events in jQuery.
5. Using Plugins and local data storage.
6. Implement Bootstrap in existing web sites.
7. Common Bootstrap components and use Bootstrap themes.
8. Setup a Node.js project using npm.
9. Use the Node.js core modules.

Course Outcomes
At the end of the course, the student will be able to
CO 1 Install and configure the IDE
CO 2 Incorporating JavaScript on an HTML page, and how to link to an external .js
file
CO 3 Comparing JavaScript with jQuery for same tasks
CO 4 Using major methods/events in jQuery
CO 5 Using Plugins and local data storage
CO 6 Implement Bootstrap in existing web sites
CO 7 Common Bootstrap components and use Bootstrap themes
CO 8 Setup a Node.js project using npm
CO 9 Use the Node.js core modules
CO 10 Creating Servlet application and deploying application in web server

Assessment Method
Assessment Experiment Report/Viva-Voce/ Quiz/MCQ/Lab Total
Tool s project
Weightage (%) 25% 15% 40%
End Semester Examination weightage (%) 60%

*******************************************************************************

ENGINEERING THIRD YEAR : SEMESTER-I

Course
Course Name Course Category L-T-P Credits
Code
23CS3101 Operating Systems PCC 3-0-0 3

Course Objectives:
1. To learn the fundamentals of Operating Systems.
2. To learn the mechanisms of OS to handle processes and threads and their
communication
3. To learn the mechanisms involved in memory management in contemporary OS
4. To know the components and management aspects of concurrency management
5. To learn programmatically to implement simple OS mechanisms

Course Content:
Unit - I (6 Contact Hours)
Basics: Evaluation, definition, Operating System Functionalities, Types of Operating Systems,
Computer Architecture support to Operating Systems: Kernel and user mode. Introduction to
Systems calls.

Unit - II (7 Contact Hours)

Process Management: definition: Process and PCB, description, Life cycle, Process Scheduling:
Preemptive and Non-Preemptive; (Round Robin, FIFO, SJF and priority based) Uniprocessor
scheduling algorithms, Multiprocessor and Real-time scheduling algorithms
Unit - III (8 Contact Hours)
Process Synchronization - Peterson's Solution, Banker’s Algorithm,, Semaphores, Critical
Regions: Producer-consumer problems, Readers writers problem, dining Philosophers problem.
Monitors

Unit - IV (7 Contact Hours)

Introduction to deadlocks, Resource allocations, Deadlock Conditions, Deadlock prevention,
Deadlock Detection- safe and unsafe states, deadlock avoidance- Banker’s algorithms, and
Recovery.

Unit - V (10 Contact Hours)

Memory Management: Partitioning, Paging and Segmentation and space allocation; Page
replacement algorithms, Analysis of page allocation policies - Working Set, Virtual memory,
Demand Paging.

Unit – VI (9 Contact Hours)

File Systems And Secondary Storage Management: : Free space management: Contiguous,
Sequential and Indexed Allocation, File system interface, File System implementation, Disk
Scheduling, Device drivers - block and character devices, streams, Character and Block device
switch tables,

Learning Resources:
Text book:
1. Abraham Silberschatz, Peter Baer Galvin, Greg Gagne,”Operating System Concepts”, John
Wiley & Sons Inc., 6th Edition.
2. William Stallings, “Operating System: Internals and Design Principles”, Pearson, 5th
Edition.

Reference Books:
1. Andrew S Tanenbaum, “Modern Operating Systems”, Pearson Prentice Hall, 4th Edition.
2. D M Dhamdhere, Operating Systems - System Programming and Operating, Tata McGraw
Hill
3. Gary Nutt, Operating Systems: A Modern Perspective, Addison Wesley, 2nd Edition.

Web resources:
1. PCP Bhattm, December 31 2009, Operating Systems, https://nptel.ac.in/courses/106108101/

Course outcomes: At the end of the course, the student will be able to
Identify the structure of OS and basic architectural components involved in OS
CO 1
design.
CO 2 Explain the Mutual exclusion, Deadlock Handling Methods
Design applications to simulate process scheduling and memory management
CO 3
algorithms.
CO 4 Differentiate the system functionalities in between old and modern OS
CO 5 Tell the need of protection and security in OS

Assessment Method
Assessment Tool Weekly tests Monthly tests End Semester Test Total
Weightage (%) 10% 30% 60% 100%

*************************************************************************

Course Code Course Name Course Category L-T-P Credits

23CS3102 Computer Networks PCC 3-0-0 3

Course Learning Objectives:

1. Build an understanding of the fundamental concept of computer networking.
2. Formalize the student with the basic terminology of computer networking.
3. Introducing advanced networking concepts.
4. Preparing the students for entry Advanced courses in Computer Networking.

Course Content:
Unit - I (7 Contact Hours)
Introduction: Network Hardware, Network Software, References Models. Physical Layer-Guided
medium and unguided medium , topologies.
Unit - II (8 Contact Hours)
The Data Link Layer : Data link Layer Design Issues, Error Control.
Elementary Data Link Protocols, Sliding Window Protocols. The Medium Access Control Sublayer:
The Channel allocation Problem, Multiple Access protocols, Ethernet - Ethernet Cabling, standard
Ethernet , Switched Ethernet, Fast Ethernet.
Unit - III (9 Contact Hours)
The Network Layer: Network Layer Design Issues, Routing Algorithms, Congestion Control
Algorithms. Internetworking,subnetting, The Network Layer in the Internet.
Unit - IV (7 Contact Hours)
The Transport Layer: The Transport Service, Elements of Transport Protocols, The Internet
Transport Protocols: UDP, The Internet Transport Protocols: TCP.
Unit - V (7 Contact Hours)
The Application Layer: DNS - The Domain Name System, Electronic Mail. The World Wide Web,
file transfer protocol Multimedia.
Unit – VI (7 Contact Hours)
Network Security: Cryptography, Symmetric - Key Algorithms, Public - Key Algorithms, Digital
Signatures.

Learning resources:

Text Book:
1. Andrew S. Tanenbaum “Computer Networks”, 4e, Pearson Education.
2. Behrouz A. Forouzan “Data Communications and Networking”, 4e , Tata McGraw Hill.
3. W. Stallings, “Data and Computer Communication”, 8e, Pearson

Reference Books:
1. S. Kshev “An Engineering Approach to Computer Networks “, 2nd edition
2. W.A.Shay,Thomson “Understanding Communications and Networks”,3rd edition,
Web resources:
1. https://www.tutorialspoint.com/computer_fundamentals/computer_networking.htm
2. https://www.geeksforgeeks.org/computer-network-tutorials/
3. https://nptel.ac.in/courses/106105081/

Course outcomes: At the end of the course, the student will be able to

CO 1 Independently understand basic Computer Network technology

CO 2 Identify the different types network topology and protocols

CO 3 Enumerate the OSI layers and TCP/IP.

CO 4 Explain each layer's functions.

Assessment Method
Assessment
Weekly tests Monthly tests End Semester Test Total
Tool
Weightage (%) 10% 30% 60% 100%

**********************************************************************

Course Code Course Name Course Type L-T-P Credits

23CS3103 Software Engineering PCC 3-0-0 3

Course Learning Objectives:

2. To recognize the emergence and importance of Software engineering
3. To identify the different phases in Software Development Life Cycle
4. To prepare the SRS(Software Requirement Specifications) Document for suitable product
5. To discuss the characteristics of good software design
6. To draw the UML Pattern designs for suitable design
7. To validate the product using various testing methods for producing quality software
product.
Course Content:
Unit - I (7 Contact Hours)
Introduction: Introduction to Software Engineering, Exploratory style Vs. Modern style of
development; Software Development Life Cycle; Process Models.
Unit - II (8 Contact Hours)
Software Project management: project Planning, estimation, Software requirements and
specification: gathering, analysis, specification, characteristics, organization.

Unit – III (9 Contact Hours)

Software design: overview, characteristics of good design, function-oriented software design,
object oriented design, UML, design patterns.
Unit –IV (7 Contact Hours)
Coding:Implementation, Coding Standard and Guidelines, review, Unit Testing; Verification and
validation.
Unit – V (7 Contact Hours)
Testing: Integration and systems testing, Black box & White Box Testing, debugging techniques.
Unit – VI (7 Contact Hours)
Software Reliability And Quality Management: Software quality, SEI CMM and ISO- 9001,
Reliability, Safety, Risk Analysis, computer-aided software engineering (CASE).

Learning Resources:
Text Book:
1. Rajib Mall, ‘Fundamentals of Software Engineering’, PHI; Fourth edition (2014)
2. Pressman, R.S., ‘Software Engineering: A Practitioner's Approach’, McGraw Hill, seventh
edition, 2010.
3. Pankaj Jalote. ‘An Integrated Approach to Software Engineering’, 2nd edition, Narosa
Publishing House
Reference Books:
1. Pressman, R.S., ‘Software Engineering: A Practitioner's Approach’, McGraw Hill, seventh
edition, 2010.
2. Pankaj Jalote. ‘An Integrated Approach to Software Engineering’, 2nd edition, Narosa
Publishing House
3. Bennett S., McRobb S. & Farmer R., ‘Object Oriented Systems Analysis and Design using
UML’, Tata McGraw-Hill, second edition, 2004.
4. Summerville Ian, ‘Software Engineering’, Addison-Wesley, fifth edition, 2000
5. K.K.Agarwal, ‘Software Engineering’
Video Resources :
1. Primary Producer: NPTEL: Prof. Sarda, IIT Bombay, Publication Date: October 8, 2008,
‘Introduction to Software Engineering’ URL
https://nptel.ac.in/courses/106101061/
Web Resources:
1. https://www.tutorialspoint.com/software_engineering/
2. https://www.geeksforgeeks.org/software-engineering
3. https://onlinecourses.nptel.ac.in/noc18_cs43

Course Outcomes: At the end of the course the students will be able to
CO1 Describe the software engineering lifecycle by demonstrating competence in
communication, planning, analysis, design, construction, and deployment
CO2 An ability to work in one or more significant application domain
CO3 To develop and deliver quality software by working as an individual and as part
of a multidisciplinary team
CO4 Demonstrate an understanding of and apply current theories, models, and
techniques that provide a basis for the software lifecycle
CO5 Deliver quality software products by possessing the leadership skills as an
individual or contributing to the team development and demonstrating effective
and modern working strategies by applying both communication and negotiation
management skills.
CO6 Apply new software models, techniques and technologies to bring out
innovative and novelistic solutions for the growth of the society in all aspects
and evolving into their continuous professional development.
Assessment Method
Assessment Tool Weekly tests Monthly tests End Semester Test Total
Weightage (%) 10% 30% 60% 100%

*******************************************************************************

Course Course
Course name L-T-P Credits
code Category
23CS3104 Artificial Intelligence PCC 3-1-0 4

Course Learning Objectives:

1. Definitions of Artificial Intelligence, Different Perspectives, Historical background
2. To understand those elements constituting problems and learn to solve it by various
searching techniques.
3. To understand those formal methods for representing the knowledge and the process of
inference to derive new representations of the knowledge to deduce what to do.
4. To understand the notion of planning in AI and some techniques in the classical planning
system.
5. To understand the notion of uncertainty and some of probabilistic reasoning methods to
deduce inferences under uncertainty.
6. To understand some of those mechanisms by which an AI system can improve its behavior
through its experience.
UNIT I: (6 Contact Hours)
Introduction to AI Problems: AI technique, Criteria for success. Problems; Problem Space and
Search: Defining the problem as a state space search, Production as a systems, Problem
characteristics, Production system characteristics.
Unit II: (6 Contact Hours)
Heuristic Search Techniques: Generate and Test, Hill climbing, Best first search, Problem reduction,
Constraint satisfaction, Means ends analysis.
UNIT III (12 Contact Hours)
Knowledge Representation: Representation and mappings, Approaches to knowledge
representation; Issues in knowledge representation. Using Predicate Logic: Representing simple
facts in logic, Representing instance and IS-A relationships, Computable functions and predicates,
Resolution, Natural deduction, Forward vs. Backward reasoning.

UNIT IV: (6 Contact Hours)

Different Knowledge Representation Schemes: Semantic nets, Frames, Conceptual dependency,
Scripts.
UNIT V: (9 Contact Hours)
Natural Language Processing: Overview of linguistics, Grammars and languages, Basic parsing
techniques, Transitional networks, Semantic analysis and representation structures, Brief
introduction on discourse and pragmatic processing;
UNIT VI: (6 Contact Hours)
Expert System Architecture: Characteristic features of expert systems, History, Applications, Rule
based system architecture. General Concepts in Knowledge Acquisition: Types of learning, General
learning model, Performance measures.

Learning Resources:
Text Books:
1. Elaine Rich, Kevin Knight, “Artificial Intelligence”, 3rd Edition, Tata McGraw-Hill, 2009.
2. Dan W. Patterson, “Introduction to Artificial Intelligence & Expert Systems”, PHI, 1990.
References:
1.Stuart Russel and Peter Norvid, “ Artificial Intelligence : A Modern Approach”, Pearson
Education, 3rd Edition
Web References
1.Berkley University, “Artificial Intelligence”,
https://courses.edx.org/courses/BerkeleyX/CS188.1x-4/1T2015/course/
2.MIT, “Artificial Intelligence”, FALL 2010.
https://www.youtube.com/playlist?list=PLUl4u3cNGP63gFHB6xb-kVBiQHYe_4hSi
3.“Introduction to Artificial Intelligence”, https://classroom.udacity.com/courses/cs271

Course Outcomes: At the end of this course, the student should be able to
CO 1 Identify problems that are amendable to solution by AI methods
CO 2 Identify appropriate AI methods to solve a given problem
CO 3 Formalise a given problem in the language / framework of different AI
methods
CO 4 Implement basic AI algorithms
CO 5 Design and carry out an empirical evaluation of different algorithms on a
problem formalization, and state the conclusions that the evaluation
supports.

Assessment Method
Assessment Weekly tests Monthly tests End Semester Test Total
Tool
Weightage (%) 10% 30% 60% 100%

*********************************************************************

Course
Course Name Course Category L-T-P Credits
Code
23CS3181 Operating Systems Lab PCC 0-0-3 1.5

Career Objectives:
1. To understand the design aspects of operating systems.
2. To study the process management concepts & Techniques.
3. To study the paging and segmentation concepts.
4. To familiarize students with the Linux environment
List of Experiments:
1. Introduction to system calls – implementation of open(), creat(),close(), write(), read(),
lseek().
2. Implementation of fork (), wait (), exec() and exit () system calls.
3. Write a program to simulate the following non-preemptive CPU scheduling algorithms to
find turnaround time and waiting time.
a) FCFS b) SJF
4. Write a program to simulate the following preemptive CPU scheduling algorithms to find
turnaround time and waiting time.
a) Round Robin b) Priority
5. Write a program to simulate producer-consumer problem using multi-threading.
6. Write a program to simulate Bankers algorithm for the purpose of deadlock avoidance.
7. Write a program to simulate the following contiguous memory allocation techniques
a) Worst-fit b) Best-fit c) First-fit
8. Write a program to simulate paging technique of memory management.
9. Write a C program to simulate page replacement algorithms
a) FIFO b) LRU
10. Write a C program to simulate disk scheduling algorithms
a) FCFS b) SCAN c) C-SCAN
11. Study and practice of Unix/Linux general purpose utility command list
man,who,cat, cd, cp, ps, ls, mv, rm, mkdir, rmdir, echo, more, date, time, kill, history,
chmod, chown, finger, pwd, cal, logout, shutdown.
12. Write a C program that makes a copy of a file using standard I/O, and system calls
13. Write a C program to emulate the UNIX ls –l command.
14. Write a C program that illustrates how to execute two commands concurrently with a
command pipe.
Ex: - ls –l | sort
15. a)Study of Bash shell, Bourne shell and C shell in Unix/Linux operating system.
b) Study of Unix/Linux file system (tree structure)
c) Study of .bashrc, /etc/bashrc and Environment variables.
Course Outcomes: At the end of this lab session, the student will be able
CO 1 To use Unix utilities and perform basic shell control of the utilities
CO 2 To use the Unix file system and file access control.
CO 3 To use of an operating system to develop software
CO 4 To use Linux environment efficiently
Assessment Method
Assessment Experiments Report/Viva-Voce/ Quiz/MCQ/Lab Total
Tool project
Weightage (%) 25% 15% 40%
End Semester Examination weightage (%) 60%
*****************************************************************************
Course Code Course Name Course Category L-T-P Credits

23CS3182 Computer Networks Lab PCC 0-0-3 1.5

Course Learning Objectives:

1. To understand the principles of subnetting and types of subnetting
2. To Simulate the network communication and packet routing
3. To differentiate various subnet masking models
4. To analyze the various routing algorithms
5. To know the concept Virtual Lan’s and Spanning ports

List of Experiments:
1. Lab No 1: Understanding and using commands like ifconfig, netstat, ping, arp, telnet, ftp,
finger, traceroute, whois etc..
2. Lab No 2: Understanding packet tracer and independent components in packet tracer
3. Lab No 3: Understanding the subnetting concept and types, Fixed Length subnet Masking
(FLSM)and Variable length subnet masking (VLSM).
4. Lab No 4: To implement Static Routing using FLSM & VLSM.
5. Lab No 5: To configure DHCP as a pool router & Service Server.
6. Lab No 6: To implement Dynamic Routing using RIP version 1
7. Lab No 6: To implement Dynamic Routing using RIP version 2
8. Lab No 7: To implement Dynamic Routing using OSPF single area network
9. Lab No 8: To implement Dynamic Routing using OSPF multi area network
10. Lab No 9: To implement NAT(Network Address Translation) ,PAT(Port Address
Translation)
11. Lab No 10: To implement VLAN
12. Lab No 11: Implementation of Socket program (Client server chat application using JAVA)
13. Lab No 12: Implementation FTP application to transfer multimedia

Course Outcomes
At the end of the course, the student will be able to
CO 1 Understand details and functionality of Network Devices and Network commands

CO 2 Apply subnetting techniques to design various topologies in computer networking

CO 3 Compare various routing algorithms and it’s simulation.

CO 4 Understanding the implementation of VLAN’s and DHCP servers.

CO 5 Applying Network Address Translation

CO 6 Understand how to implement client-server applications using JAVA.

Assessment Method
Assessment Tool Experiments Report/Viva-Voce/ Quiz/MCQ/Lab Total
project
Weightage (%) 25% 15% 40%
End Semester Examination weightage (%) 60%
********************************************************************

Course Course
Course Name L-T-P Credits
Code Category
23CS3183 Software Engineering Lab PCC 0-0-3 1.5

Course Learning Objectives:

1. To get familiar with the objective and abstract of the project.
2. To get familiar with preparing a document which is used before starting the project
3. Prepare System Design & Architecture
4. Identify & draw different UML based diagrams
5. To understand actual system using analysis model
6. To understand the project implementation according to MVC architecture
7. To understand various testing techniques.
List of Experiments:

1. Identify the Objective and Abstract of the project based on the given Scenarios.
2. Prepare Software Requirement Analysis document for respective project.
3. Compute function point of the selected project.
4. Prepare System Design & Architecture design.
5. UML based design diagrams.
6. Prepare Data Flow Diagrams of the selected project.
7. Complete design part of the selected project.
8. Design of the Test Cases of the selected project.
9. On completion of coding prepare test cases and perform black-box testing , record the
defects and its time of identification.
10. Do vulnerability analysis of the selected project.

Course Outcomes
At the end of the course, the student will be able to
CO 1 Objective and Abstract of the project
CO 2 SRS document which contains detailed information about the given project
Design document which contains detailed diagrams of System design and
CO 3
System Architecture of the given project
Design document which contains detailed diagrams of Use case, Class,
CO 4
Sequence, Activity, State, State transition Diagrams
CO 5 E-R diagram, data-flow diagram, state-transition diagram for the project
Understanding about Unit testing, regression testing, integration testing,
CO 6
validation and system testing
Implementing the given project with Advanced Java programming according to
CO 7
MVC Architecture
Assessment Method
Assessment Tool Experiments Report/Viva-Voce/ Quiz/MCQ/Lab Total
project
Weightage (%) 25% 15% 40%
End Semester Examination weightage (%) 60%

***************************************************************************

Course Code Course Name Course Category L – T -P Credits

English Language
23EG3182 Communication HSMC 0–0–3 1.5
Skills Lab-II

Course objectives:
1. To improve group discussion skills of the students.
2. To help the students to write their CV and Internship application.
3. To improve the telephonic etiquettes of the students.
4. To help the students to take decision on their career.
Content Content:

Unit I: (06 Contact Hours)

Group Discussion - How to think and analyze - How to initiate a topic - How to continue a topic -
How to support or reject a point-of-view - How to defend your position - Managing distractions and
mediating between contenders - How to summarize & conclude.
Unit II: (06 Contact Hours)
Telephonic conversation & Etiquettes - How to introduce oneself - How to introduce the main issue
- How to keep the other person engaged - How to convince the other person - How to complain
without irritating. - Giving assurance and asking for clarification - How to end a formal telephonic
conversation.
Unit III: (06 Contact Hours)
Career Planning & Job-Skill Analysis - ASK: Talking about one’s Attitudes, Knowledge, & Skills -
SMART goals - Reading & Analysis of Job Advertisements.
Unit IV: (06 Contact Hours)
CV & Resume Writing - Difference between CV & Resume - Writing CV - Writing Resume -
Writing Cover Letter.
Unit V: (06 Contact Hours)
Application for Internship - Application for internship in Academic Labs - Application for
internship in Industries - Follow up the Application with reminders and requests.
Unit VI: (06 Contact Hours)
Interview Skills - Preparation for the Interview - Frequently asked questions - Dress Codes,
Appearance, and Etiquettes. 6.4 Facing the Interview.
References:
1. Business Communication Today, 12th Edition, Courtland L Bovee & John Thill, Pearson
2. British Council Material on Career Planning & Interviews
3. Master the Group Discussion & Personal Interview - Complete Discussion on the topics
asked by reputed B-schools & IIMs by Sheetal Desarda, Notion Press
4. Group Discussion and Interview Skills by Priyadarshi Patnaik , Cambridge University Press
India
5. The Ultimate Guide to Internships: 100 Steps to Get a Great Internship and Thrive in It
by Eric Woodard
6. Telephone Etiquette by Robert DeGroot

Course Outcomes: At the end of the course, the student will be able to

Get used to a variety of GDs to understand the principles, finer nuances, and
CO 1
intricacies of the art

CO 2 Get exhaustive information on how to prepare for internship and interview

CO 3 Write his/her CV to remain well-prepared for the interviews

CO 4 Take decision on his/her career goals and plans

CO 5 Attain professional speaking skills to enhance his/her employability skills.

Assessment Method:
Course Nature: LABORATORY

Internal Assessment (40 Marks) External Assessment (60 Marks)

Record Writing – 10 Marks Reading Comprehension – 15 Marks

Attendance – 10 Marks Writing – 30 Marks

Continuous Assessment (Listening – 10 Marks Speaking (Viva-Voce) – 15 Marks
+ Oral Presentations – 10 Marks)

****************************************************************************

List of Professional Elective Courses (PEC)

Elective-I Pool
*******************************************

Course Code Course Name Course Category L-T-P

Credits

23CS3121 Data Mining and Warehousing PEC 3-0-0 3

Course Learning Objectives

1. Interpret the contribution of data warehousing and data mining to the decision-support level
of organizations.
2. Categorize and carefully differentiate between situations for applying different data-mining
techniques: frequent pattern mining, association, correlation, classification, prediction, and cluster
and outlier analysis.
3. Design and implement systems for data mining.
4. Evaluate the performance of different data-mining algorithms.
5. Propose data-mining solutions for different applications.
Course Content:
Unit - I: (6 Contact Hours)

Data Mining: Data mining functionalities, Integration of a data mining system with a database or
data warehouse systems, Classification of data mining systems, Data mining task primitives,
Major issues in data mining. Data Processing: Data cleaning, Data integration and transformation,
Data reduction, Discretization and concept hierarchy generation.
Unit-II: (9 Contact Hours)
Data Warehouse and OLAP Technology: Differences between operational database systems and
data warehouses, A Multidimensional data model, Data warehouse architecture, Data warehouse
implementation - Efficient computation of data cubes, From Data warehousing to data mining.
Unit - III: (9 Contact Hours)

Association Rules in Large Databases: Basic concepts of association rule mining, Efficient and
scalable frequent itemset mining methods. Mining Multilevel Association Rules: Mining
multidimensional association rules from relational databases and data warehouses, From
Association mining to correlation analysis, Constraint based association mining.
Unit – IV: (7 Contact Hours)

Classification: Issues regarding classification and prediction, Classification by decision tree

induction, Bayesian classification, Rule-Based classification. Prediction: Linear regression,
Nonlinear regression, Other regression based methods.

Unit – V: (9 Contact Hours)

Cluster Analysis: Basic of cluster analysis, Types of data in cluster analysis, A categorization of
major clustering methods, Partitioning methods – k-Means and k-Medoids, Hierarchical method -
Agglomerative vs. divisive hierarchical clustering, Distance measures in algorithmic methods,
BIRCH, Chameleon, Density based clustering: DBSCAN.
Unit – VI: (5 Contact Hours)

Outlier analysis:
Introduction to outlier detection, design and implementation of naïve methods related to data
mining techniques.- Statistical distribution based outlier detection, Distance based outlier detection.

Learning resources:
Text book:
1. Jiawei Han, MichelineKamber,“Data Mining: Concepts and Techniques”, Morgan
Kaufmann Publishers editor, 2006.
2. Pang-Ning Tan, Michael Steinbach, and Vipin Kumar. Introduction to Data Mining.
3. David J. Hand, HeikkiMannila, PadhraicSmyth ,“Principles of Data mining” MIT Press
4. Parteek Bhatia “Data Mining and Data Warehousing “ 1/e, Cambridge,19

Reference Books:
1. “Advances in Knowledge Discovery and Data Mining”. AAAI/MIT Press, 1996. Selected
papers from conferences and journals, conference tutorials.
2. Jiawei Han, Micheline Kamber, and Jian Pei. Data Mining:Concepts and Techniques (3rd
ed.). Morgan Kaufmann, 2012. eText ISBN: 9780123814807.
Web Resources:
1. http://nptel.ac.in/courses/106106093/35
Course outcomes: At the end of the course, the student will be able to
Discover interesting patterns from large amounts of data to analyze and extract
CO 1
patterns to solve problems and make predictions of outcomes.
CO 2 Evaluate systematically supervised models and algorithms w.r.t their accuracy.
Evaluate and implement a wide range of emerging and newly-adopted
CO 3
methodology and technologies to facilitate the knowledge discovery.
CO 4 Design and implement data mining applications using sample, realistic data sets
and modern tools.
Evaluate and select appropriate data mining algorithms to apply, interpret and
CO 5
report the output appropriately.

Assessment Method
Assessment Weekly tests Monthly tests End Semester Test Total
Tool
Weightage (%) 10% 30% 60% 100%

********************************************************************************

Course Code Course Name Course Category L-T-P

Credits

Mobile Application
23CS3122 PEC 3-0-0 3
Development

Course Objectives:
1. Describe those aspects of mobile programming that make it unique from programming for
other platforms.
2. Critique mobile applications on their design pros and cons.
3. Utilize rapid prototyping techniques to design and develop sophisticated mobile interfaces.
4. Program mobile applications for the Android operating system that use basic and advanced
phone features.
5. Deploy applications to the Android marketplace for distribution.

UNIT I: ( 6 Contact Hours )

J2ME Overview: Java 2 Micro Edition and the World of Java, Introduction to Mobile app
Development, Reasons to Build Mobile App, Mobile Application Development Today, Myths of
Mobile Application Design. Diving into Mobile: App or Website? Mobile Web Presence.

UNIT II : ( 12 Contact Hours )

Android Platform and Development Environment: Intro to Android, Create your First Android App,
Layouts, Views and Resources. Text and Scrolling Views. Activities and Intents. Debugging and
Testing your App.

UNIT III : ( 9 Contact Hours )

User Input Controls, Menus, Screen Navigation, Recycler View, Drawables, Themes and Styles.
Material Design.
UNIT IV: ( 10 Contact Hours )
Async Task and Async TaskLoaders, Connecting to the Internet, Broadcast Receivers, Services,
Notifications, Alarm Managers, Transferring Data Efficiently. Shared Preferences.
UNIT V: ( 5 Contact Hours)

SQLite Primer, Store Data using SQLite, Content Providers, Using Loaders to Load and Display
Data, Permissions, Performance and Security.
UNIT VI : (10 Contact Hours)
Kotlin : Introduction to Kotlin, Environment Setup , Architecture, Functions, Classes, Visibility
Control, Inheritance and Interfaces, Extensions, Data and Sealed Classes, Delegation, Example to
build basic apps using Kotlin.
Text Books
1. Professional Mobile Application Development by Jeff McWherter, Scott Gowell Wiley
india pvt.ltd 2013
2. https://google-developer-training.gitbooks.io/android-developer-fundamentals-course-
practicals/content/en/
3. https://developers.google.com/training/courses/android-fundamentals
4. https://kotlinlang.org/docs/tutorials/edu-tools-learner.html

Open Source Videos Link:

1. https://www.youtube.com/playlist?list=PLlyCyjh2pUe9wv-hU4my-Nen_SvXIzxGB

Reading Material Open Source Link:

1. https://google-developer-training.gitbooks.io/android-developer-fundamentals-course-
concepts/content/en/
2. https://www.tutorialspoint.com/kotlin

Tutorial Hours (Practical Problem sets) Open Source Link:

1. https://google-developer-training.gitbooks.io/android-developer-fundamentals-course-
practicals/content/en/

Course Outcomes: At the end of the course, the student will be able to
CO 1
Understand importance of mobile presence

CO 2
Will be able to design mobile applications

CO 3 Understand the Android Studio installation, Project structure, creating activities,

testing apps and using the Android Support Library

Understand that how to get input from the user, implement navigation strategies,
CO 4
use themes and styles, test your user interface, and follow Material Design
principles

CO 5 Understand how to do background work, how to schedule tasks, and how to

trigger events

CO 6 Understand the difference between other languages and kotlin, how to build apps
using kotlin.

Assessment Method
Assessment Weekly tests Monthly tests End Semester Test Total
Tool
Weightage (%) 10% 30% 60% 100%
********************************************************************************

Course Code Course Name Course Category L-T-P

Credits

23CS3123 Distributed Computing PEC 3-0-0 3

Course Learning Objectives:

1. To expose students to both the abstraction and details of file systems.
2. To introduce concepts related to distributed computing systems.
3. To focus on performance and flexibility issues related to systems design decisions.
4. To prepare students for life-long learning.
5. To evaluate how and not just memorize the details.
6. To expose students to current literature in distributed systems.

Course Content:
UNIT – I (8 Contact Hours)
Fundamentals: Evolution of Distributed Computing Systems, System models, issues in design of
Distributed Systems, Distributed computing environment, web based distributed model, computer
networks related to distributed systems and web based protocols.

UNIT-II (8 Contact Hours)

Message Passing: Inter process Communication, Desirable Features of Good Message-Passing
Systems, Issues in IPC by Message, Synchronization, Buffering, Multidatagram Messages,
Encoding and Decoding of Message Data, Process Addressing, Failure Handling, Group
Communication.

UNIT-III (7 Contact Hours)

Remote Procedure Calls: The RPC Model, Transparency of RPC, Implementing RPC Mechanism,
Stub Generation, RPC Messages, Server Management, Communication Protocols for RPCs,
Complicated RPCs, Client-Server Binding, Exception Handling,Some Special Types of RPCs,
Lightweight RPC, Optimization for Better Performance.

UNIT- IV (8 Contact Hours)

Distributed Shared Memory: Design and Implementation issues of DSM, Granularity, Structure
of Shared memory Space, Consistency Models, replacement Strategy, Thrashing, Other Approaches
to DSM, Advantages of DSM.

UNIT – V (8 Contact Hours)

Synchronization: Clock Synchronization, Event Ordering, Mutual Exclusion, Election Algorithms.
Constant.

Resource and Process Management: Desirable Features of a good global scheduling algorithm,
Load Balancing approach, Load Sharing Approach, Process Migration, Threads, Processor
allocation, Real time distributed Systems.

UNIT – VI (8 Contact Hours)

Distributed File Systems: Desirable Features of a good Distributed File Systems, File-sharing
Semantics, File Models, File Accessing Models,ile caching Schemes, File Replication, Design
Principles, Sun’s network file system, Andrews file system, comparison of NFS and AFS.

Learning resources:
Text books:
1. Ajay D. Kshemkalyani, Mukesh Singhal , “Distributed Computing: Principles, Algorithms,
and Systems Reissue Edition”,
2. Sukumar Ghosh, Distributed Systems: An Algorithmic Approach, Second Edition
Reference Books:
1. Distributed OS by Pradeep K. Sinha (PHI)
2. Tanenbaum S.: Distributed Operating Systems, Pearson Education
3. Tanenbaum S. Maarten V.S.: Distributed Systems Principles and Paradigms, (Pearson
Education)
4. George Coulouris, Jean Dollimore. Tim Kindberg: Distributed Systems concepts and design.
Web Resources:
1. https://eclass.uoa.gr/modules/document/file.php/D245/2015/DistrComp.pdf

Course Outcomes: At the end of the course, the student will be able to
CO 1 Study software components of distributed computing systems.
Know about the communication and interconnection architecture of multiple
CO 2
computer systems.
Recognize the inherent difficulties that arise due to distributed-ness of
CO 3
computing resources.
Understanding of networks & protocols, mobile & wireless computing and
CO 4
their applications to real world problems
CO 5 Able to use pointers in C programming

Assessment Method
Assessment Weekly tests Monthly tests End Semester Test Total
Tool
Weightage (%) 10% 30% 60% 100%

********************************************************************************

Course Code Course Name Course Category L-T-P

Credits

Advanced Computer
23CS3124 PEC 3-0-0 3
Architecture

Course Learning Objectives:

1. To understand the Concept of Parallel Processing and its applications.
2. To understand the micro-architectural design of processors.
3. To learn about the various techniques used to obtain performance improvement and power
savings in current processors.
4. To develop the Pipelining Concept for a given set of Instructions.
5. To distinguish the performance of pipelining and non pipelining environments in a
processor.
6. To improve the performance of applications on modern and high performance computers.

Course Content:
Unit I: (10 Contact Hours)
Introduction and Pipelining: Defining computer architecture; Trends in Technology, power in
Integrated Circuits and cost; Dependability; Measuring, reporting and summarizing Performance;
Quantitative Principles of computer design;Pipeline hazards; Implementation of pipeline; What
makes pipelining hard to implement?

Unit II: (10 Contact Hours)

Instruction –Level Parallelism: ILP: Concepts and challenges; Basic Compiler Techniques for
exposing ILP; Reducing Branch costs with prediction; Overcoming Data hazards with Dynamic
scheduling; Hardware-based speculation.

Unit III: (8 Contact Hours)

Instruction –Level Parallelism – 2: Exploiting ILP using multiple issues and static scheduling;
Exploiting ILP using dynamic scheduling, multiple issues and speculation; Advanced Techniques
for instruction delivery and Speculation; The Intel Pentium 4 as example.

Unit IV: (12 Contact Hours)

Multiprocessors and Thread –Level Parallelism: Introduction; Symmetric shared-memory
architectures; Performance of symmetric shared–memory multiprocessors; Distributed shared
memory and directory-based coherence; Basics of synchronization; Models of Memory
Consistency.

Unit V: (12 Contact Hours)

Memory Hierarchy and Design : Introduction; Cache performance; Cache Optimizations, Virtual
memory;Advanced optimizations of Cache performance; Memory technology and optimizations;
Protection: Virtual memory and virtual machines.

Unit VI: (10 Contact Hours)

Hardware and Software for VLIW and EPIC: Introduction: Exploiting Instruction-Level
Parallelism Statically; Detecting and Enhancing Loop-Level Parallelism; Scheduling and
Structuring Code for Parallelism; Hardware Support for Exposing Parallelism: Predicated
Instructions; Hardware Support for Compiler Speculation; The Intel IA-64 Architecture and Itanium
Processor.

Learning Resources
Text Book:
1. John L Hennessey and David A Patterson, “Computer Architecture A Quantitative
Approach”, Morgan Kaufmann/ Elsevier, Fifth Edition, 2012

Reference Books:
1. Kai Hwang and Faye Briggs, “Computer Architecture and Parallel Processing”, Mc
Graw-Hill International Edition, 2000.
2. Sima D, Fountain T and Kacsuk P, ”Advanced Computer Architectures: A Design
Space Approach”, Addison Wesley, 2000.

Web resources:
1. Higher Performance Computer Architecture, NPTEL Course
https://nptel.ac.in/courses/106105033/1
Course Outcomes: At the end of the course, the student will be able to
Evaluate performance of different architectures with respect to various
CO 1
parameters
CO 2 Analyze performance of different ILP techniques.
CO 3 Identify cache and memory related issues in multi-processors
Design the overall organization of cache and virtual memories, and pipelined
CO 4
processors.
Describe the challenges faced in the implementation of these high performance
CO 5
system
CO 6 Improve application performance for different cpu architectures

Assessment Method
Assessment Weekly tests Monthly tests End Semester Test Total
Tool
Weightage (%) 10% 30% 60% 100%
*******************************************************************************

Course Code Course Name Course Category L-T-P

Credits

23CS3125 Advanced JAVA PEC 3-0-0 3

Course Learning Objectives:

The objective of this course is to:

1. Introducing Java as a programming language.

2. Introduce Java as a dynamic web programming language.
3. Develop applications using Java.
4. Introduce the concepts of JDBC for the purpose of database connectivity.
5. Describe the technique to develop networking or socket programming.

CONTENT:

Unit I: CORE JAVA (6 Contact Hours)

Introduction to Java, Data types, variables, operators, Arrays, Control Statements, Classes &
Methods, Inheritance, Exception Handling, Multithreading, Collections, I/O streams.

Unit II: NETWORKING (8 Contact Hours)

Connecting to a Server, Implementing Servers, Sending E-Mail, Making URL Connections,

Advanced Socket Programming DATABASE NETWORKING: The Design of JDBC. The
Structured Query Language, JDBC Installation, Basic JDBC Programming Concepts, Query
Execution, Scrollable and Updatable Result Sets, Metadata, Row Sets, Transactions.

Unit III: AWT and SWINGS (9 Contact Hours)

Lists, Trees, Tables, Styled Text Components, Progress Indicators, Component Organizers The
Rendering Pipeline, Shapes, Areas, Strokes, Paint, Coordinate Transformations, Clipping,
Transparency and Composition, Rendering Hints, Readers and Writers for Images, Image
Manipulation, Printing. The Clipboard, Drag and Drop.

Unit IV: Event Handling (7 Contact Hours)

The delegation event model, Event classes, Adapter classes, Inner classes, Event listener interfaces

Unit V: JAVABEANS COMPONENTS (8 Contact Hours)

Beans, The Bean-Writing Process, Using Beans to Build an Application, Naming Patterns for Bean,
Components and Events Bean Property, Tubes Bean info Classes, Property, Editors, Customizes.

Unit VI: JSP and SERVLETS (7 Contact Hours)

Introduction to JSP, JSP built in objects, tags, Servlets, mapping, a web application.

Text Book:

1. Core JavaTM 2, Volume II-Advanced Features, 7th Edition by Cay Horetmann, Gary
Cornelll Pearson Publisher, 2004.

Reference Books:

1. Professional Java Programming by Brett Spell, WROX Publication

2. Advanced Java 2 Platform, How to Program, 2nd Edition, Harvey. M. Dietal, Prentice Hall.
3. Advanced Java, Gajendra Gupta , Firewall Media.

Course Outcomes:

At the end of the course student will be able to:

1. Design a desktop application which can be used for many kinds of clients.
2. Design a web application which can work as a dynamic web with the help of JDBC.
3. Develop an application which can also be connected with the database

Assessment Method
Assessment Weekly tests Monthly tests End Semester Test Total
Tool
Weightage (%) 10% 30% 60% 100%
*******************************************************************************

Course Code Course Name Course Category L-T-P

Credits
Object Oriented Analysis and
23CS3126 PEC 3-0-0 3
Design

Course Learning Objectives:

1. Master the implementation of different Models

2. Be familiar with models,relationships,roles,types and interfaces

3. Demonstrate understanding the abstractions of various system models
4. Demonstrate understanding of various common modeling techniques
5. Implement various object models designing in more than one manner.
6. Choose the appropriate model for a specified application and different mechanisms

Course Content:

UNIT I : Introduction to UML (6 Contact Hours)

Importance of modeling, principles of modeling, object oriented modeling, conceptual model of the
UML, Architecture, and Software Development Life Cycle.

UNIT II : Basic Structural Modeling (9 Contact Hours)

Classes, Relationships, Common Mechanisms, and diagrams. Advanced Structural Modeling:
Advanced classes, advanced relationships, Interfaces, Types and Roles, Packages.

UNIT III: Class & Object Diagrams (7 Contact Hours)

Terms, concepts, modeling techniques for class & object diagrams.

UNIT IV : Basic Behavioral Modeling (7 Contact Hours)

Interactions, Interaction diagrams, Use cases, Use case diagrams, Activity Diagrams.

UNIT V : Advanced Behavioral Modeling (8 Contact Hours)

Events and signals, state machines, processes and threads, time and space, state chart diagrams.

UNIT VI :Architectural Modeling (8 Contact Hours)

Component, Deployment, Component diagrams and Deployment diagrams and case study.

Learning Resources:
Text Books:
1. Grady Booch, James Rumbaugh, Ivar Jacobson: ‘The Unified Modeling Language User
Guide’, Pearson Education.

Reference Books:
1. Meilir Page-Jones, ‘Fundamentals of Object Oriented Design in UML’, Pearson Education.
2. AtulKahate, ‘Object Oriented Analysis & Design’, The McGraw-Hill Companies

Web Resources:
1. IIT Kharagpur, July 22 2016, ‘Foundations of the Object Model’,
a. URL:https://nptel.ac.in/courses/106105153/10
2. IIT Kharagpur, August 12 2016, ‘Overview of UML’,
a. URL: https://www.youtube.com/watch?time_continue=31&v=iN4Ft6loL7o
3. IIT Kharagpur, July 29 2016, ‘Relationship among objects’,
a. URL: https://nptel.ac.in/courses/106105153/20

Course Outcomes: At the end of the course, the student will be able to
CO 1 Define basic terms necessary for modeling computer systems
CO 2 Collect requirements and prepare their scenarios
CO 3 Draw diagrams by UML
CO 4 Prepare and use of design patterns
CO 5 Prepare supporting documentation.
CO 6 Create New Models as per requirements.

Assessment Method
Assessment Weekly tests Monthly tests End Semester Test Total
Tool
Weightage (%) 10% 30% 60% 100%

***************************************************************************

ENGINEERING THIRD YEAR: SEMESTER-II

*********************************************

Course Code Course Name Course Category L-T-P

Credits

Cryptography and Network PCC

23CS3201 3-1-0 4
Security

Course Learning Objectives:

3. To understand the basics of Cryptography and Network Security.
4. To be able to secure a message over an insecure channel by various means.
5. To learn about how to maintain the Confidentiality, Integrity and Availability of data.
6. To understand various protocols for network security to protect against the threats in the
networks.

Course Content:
Unit 1: (12 Contact Hours)
Introduction to security attacks, services and mechanism, introduction to cryptography -
Conventional Encryption: Conventional encryption model, classical encryption techniques -
substitution ciphers and transposition ciphers, cryptanalysis, stream and block ciphers ,Modern
Block Ciphers: Block ciphers principals, Shannon’s theory of confusion and diffusion, Fiestal
structure, data encryption standard(DES): strength of DES, differential and linear cryptanalysis of
DES. Block cipher modes of operations, triple DES, AES.

Unit II: (8 Contact Hours)

Confidentiality using conventional encryption, traffic confidentiality, key distribution, random
number generation. Introduction to graph, ring and field, prime and relative prime numbers,
modular arithmetic, Fermat’s and Euler’s theorem, primality testing, Euclid’s Algorithm, Chinese
Remainder theorem, discrete algorithms.

Unit III: (11 Contact Hours)

Principles of public key cryptosystems, RSA algorithm, security of RSA, key management, Diffle-
Hellman key exchange algorithm, introductory idea of Elliptic curve cryptography, Elgamel
encryption, Message Authentication and Hash Function: Authentication requirements,
authentication functions, message authentication code, hash functions, birthday attacks, security of
hash functions and MACS.

Unit IV: (11 Contact Hours)

MD5 message digest algorithm, Secure hash algorithm (SHA), Digital Signatures: Digital
Signatures - authentication protocols - digital signature standards (DSS) - proof of digital signature
algorithm, Authentication Applications: Kerberos and X.509, directory authentication service,
electronic mail security, pretty good privacy (PGP), S/MIME.

Unit V: (9 Contact Hours)

IP Security: Architecture, Authentication header, Encapsulating security payloads, combining
security associations, key management.

Unit VI: (9 Contact Hours)

Web Security: Secure socket layer and transport layer security, secure electronic transaction (SET),
System Security: Intruders - Viruses and related threats, IDS.

Learning Resources:
Text Books:

1. William Stallings, “Crpyptography and Network security Principles and Practices”,

Pearson/PHI.
2. Wade Trappe, Lawrence C Washington, “ Introduction to Cryptography with coding theory”,
Pearson.

Reference Books:
1. W. Mao, “Modern Cryptography – Theory and Practice”, Pearson Education.
2. Charles P. Pfleeger, Shari Lawrence Pfleeger – Security in computing Prentice Hall of India.

Web Resources:
1. http://nptel.ac.in/courses/106105031/ lecture by Dr. Debdeep Mukhopadhyay IIT
Kharagpur
2. https://ocw.mit.edu/courses/electrical-engineering-and-computer-science/6-033-
computer-system-engineering-spring-2009/video-lectures/ lecture by Prof. Robert Morris and
Prof. Samuel Madden MIT.

Course Outcomes: At the end of the course, the student will be able to
CO 1 Implement security of the data over the network.

CO 2 Explore emerging areas of cryptography and network security.

CO 3 Implement various networking protocols.

CO 4 Demonstrate how to protect any network from the threats in the world.
Assessment Method
Assessment Tool Weekly tests Monthly tests End Semester Test Total
Weightage (%) 10% 30% 60% 100%

**************************************************************************

Course Code Course Name Course Category L-T-P Credits

23CS3202 Machine Learning PCC 3-1-0 4

Course Learning Objectives:

1. To understand the basic theory underlying machine learning.
2. To be able to formulate machine learning problems corresponding to different applications.
3. To understand a range of machine learning algorithms along with their strengths and weaknesses.
4. To be able to apply machine learning algorithms to solve problems of moderate complexity.

Course Content:

UNIT I: INTRODUCTION (10 Contact Hours)

Learning Problems – Perspectives and Issues - A brief introduction to Machine Learning, Supervised
Learning, Unsupervised Learning, Reinforcement Learning – Concept Learning – Version Spaces and
Candidate Eliminations – Inductive bias – Decision Tree learning.

UNIT II: NEURAL NETWORKS AND GENETIC ALGORITHMS (12 Contact Hours)
Neural Network Representation – Problems – Perceptrons – Multilayer Networks and Back Propagation
Algorithms – Advanced Topics – Genetic Algorithms – Hypothesis Space Search – Genetic Programming –
Models of Evalution and Learning.

UNIT III: BAYESIAN LEARNING (9 Contact Hours)

Bayes Theorem – Concept Learning – Maximum Likelihood – Minimum Description Length Principle –
Bayes Optimal Classifier – Gibbs Algorithm – Naïve Bayes Classifier – Bayesian Belief Network – EM
Algorithm – Probability Learning – Sample Complexity – Finite and Infinite Hypothesis Spaces – Mistake
Bound Model.

UNIT IV : COMPUTATIONAL LEARNING (10 Contact Hours)

Probability Learning – Sample Complexity – Finite and Infinite Hypothesis Spaces – Mistake Bound Model.
Learning Sets of Rules – Sequential Covering Algorithm – Learning Rule Set – First Order Rules – Sets of
First Order Rules.

UNIT V: INSTANCE BASED LEARNING (9 Contact Hours)

K- Nearest Neighbour Learning – Locally weighted Regression – Radial Bases Functions – Case Based
Learning.

UNIT VI: ADVANCED LEARNING (10 Contact Hours)

SVM – Formulation, SVM – Interpretation & Analysis, SVMs for Linearly Non-Separable Data, SVM
Kernels. Reinforcement Learning – Task – Q-Learning – Temporal Difference Learning.

Learning Resources:
Text Books:
1. Machine Learning – Tom M. Mitchell, - MGH
2. Machine Learning: An Algorithmic Perspective, Stephen Marsland, Taylor & Francis
Reference Books:

1. Gareth James, Daniela Witten, Trevor Hastie, Robert Tibshirani, Trevor Hastie,” An Introduction to
Statistical Learning: with Applications in R”, Springer, First Edition.
2. Kevin Murphy, “Machine learning: a probabilistic perspective”, MIT Press, First Edition.
3. Christopher Bishop, “pattern recognition and machine learning”, Springer, First Edition.

Assessment Method
Assessment Weekly tests Monthly tests End Semester Test Total
Tool
Weightage (%) 10% 30% 60% 100%

*****************************************************************************

Course code Course name Course Category L-T-P

Credits

English Language
23EG3283 HSMC 0-0-3 1.5
Communications Skills Lab-III

Course objectives:
1. To improve interpersonal skills of the students
2. To help the students to write professional letters and reports
3. To practice the etiquettes to be used at workplace
4. To reward hands on experience on managing meetings
5. To imbibe leadership qualities in the students
CONTENT:
UNIT-I (6 Contact Hours)
Professional Presentation - Collecting & Reading the materials to be presented - Analyzing the main
points - Summarizing & concluding - Developing PPT - Delivery of the Presentation.
UNIT-II (6 Contact Hours)
Report Writing & Writing Professional Emails & Applications – Routine Reports – Investigative
Reports - Professional Emails - Formal Letters and Applications.
UNIT-III (6 Contact Hours)
Agenda, Meetings, & Minutes - Setting the agenda for a meeting - Managing a meeting - Keynote
address & vote of thanks - Publishing the minutes.
UNIT-IV (6 Contact Hours)
People skills and small talks (2 minutes) - Talking to professional executives - Talking to colleagues
- Talking to the boss - Talking to your team - Talking to the media delegates.
UNIT-V (6 Contact Hours)
Corporate Etiquettes - How to introduce & greet - How to raise a question - How to clarify a doubt -
How to say “yes” or “no” - Rapport building - Dining & winning - Counseling somebody - How to
influence & motivate
UNIT-VI (6 Contact Hours)
Life Skills - Leadership communication - Interpersonal communication - Stress management - Time
Management

Learning Resources:
Text Books:

1. Business Communication Today, 12th Edition, Courtland L Bovee & John Thill, Pearson
2. British Council Material on communication
3. Training in Interpersonal Skills: Tips f: Tips for Managing People at Work by Robbins and
Hunsaker
Reference Books:
1. Soft Skills for Everyone, with CD Paperback –by Jeff Butterfield
2. Communication for business by Shirley Taylor, Pearson

Course outcomes: At the end of the course, the student will be able to

CO 1 The art of professional presentation

CO 2 Write professional reports and letters

CO 3 Conduct a formal meeting

CO 4 Develop people skills and corporate etiquettes

Gain the basic knowledge about leadership communication, stress management and
CO 5
time management

Assessment Method:
Course Nature: LABORATORY

Internal Assessment (40 Marks) External Assessment (60 Marks)

Record Writing – 10 Marks Reading Comprehension – 15 Marks

Attendance – 10 Marks Writing – 30 Marks

Continuous Assessment (Listening – 10 Marks Speaking (Viva-Voce) – 15 Marks
+ Oral Presentations – 10 Marks)

*****************************************************************************

Course Name Course L-T-P Credits

Course Code
Category
Career Development MC 2- 0-0 0
23CS3203
Course

Course Learning Objectives:

1. To enable the students for their competitive exams
2. To enhance their capability in aptitude and reasoning & programming.
3. To develop their reasoning skills.
4. To prepare them for all type of competitive exams
Course Contents:

Unit I (8 Contact Hours)

Number system: Base System, Exponents, Factorials, LCM & HCF, Properties of Numbers,
Remainders, Successive Divisions.
Sequence & Series: Arithmetic Progression, Harmonic Progression, Geometric Progression
Programming in C.

Unit II (8 Contact Hours)

Arithmetic: Averages, Clocks & Calendars, Simple Interest & Compound Interest, Mixture &
Allegations, Percentages, Profit, Loss & Discounts, Ratio & Proportion, Speed, Time & Distance,
Time & Work.
Programming in JAVA.
Algebra: Binomial Theorem, Complex Numbers, Functions, Higher Degree Equations,
Inequalities , Linear Equations, Logarithm, Quadratic Equations.
Programming in Python.

Unit III: (6 Contact Hours)

Geometry: Mensuration, Lines & Angles, Circles, Polygons, Triangles, Co-ordinate Geometry,
Trigonometry.
Probability & Statistics: Mean, Median & Mode, Permutation & Combination, Probability Set
Theory & Venn Diagram. Programming in C++

Unit IV: (7 Contact Hours)

Logical Reasoning: Logical Sequence, Premise, Assumption & Conclusion, Binary Logic, Blood
Relations, Linear & Matrix Arrangement, Seating Arrangement, Coding & Decoding, Statements
& Assumptions Puzzles
Analytical Reasoning: Course of Action Fact, Inference & Judgement, Logical Deduction,
Statement & Assumption, Strong & Weak Arguments, Syllogism

Unit V: (4 Contact Hours)

Data Interpretation: Charts (Column, Pie & Bar), Tables Graphs (Line & Area), Venn Diagram,
Data Sufficiency. Reading Comprehension
Unit VI: (3 Contact Hours)
Verbal Ability: Cloze Test Error Spotting, Fill in the blanks, Sentence Correction, Word Usage,
Para jumbles, Paragraph Completion, Paragraph Summary.
Learning Resources
Text Book:
1. Sarvesh K Verma, 'Quantitative Aptitude Quantum CAT', arihant publications
2. Arun Sharma, Meenakshi Upadhyay, ' Verbal Ability and Reading Comprehension' ,
McGraw Hill publications
3. Arun Sharma, 'Data Interpretation', McGraw Hill publications
4. Arun Sharma, 'Logical Reasoning', McGraw Hill publications

Reference Books:
1. Nishit K Sinha, 'Logical Reasoning and Data Interpretation', Pearson publications
2. Arun Sharma, 'Quantitative Aptitude', McGraw Hill publications

Web Resources:
1. https://unacademy.com/

Course Outcomes: At the end of the course, the student will be able to
CO 1 Improve aptitude, problem solving skills and reasoning abilities
CO 2 Improve Verbal ability skills, Data interpretation skills
CO 3 Understand the basic techniques required for solving Reading Comprehension
Familiarize with the written tests of competitive exams, campus placements and
CO 4
PSUs
CO 5 Collectively solve problems in teams and group
CO 6 Adopt and acquire new techniques in solving problem

Assessment Method
Assessment Weekly tests Monthly tests End Semester Test Total
Tool

Weightage (%)
Nil Nil 100 100

**********************************************************************

List of Professional Elective Courses (PEC)

Elective - II & III Pool
*******************************************

Course
Course Code Course Name L-T-P Credits
Category
23CS3221 Big Data Analytics PEC 3-0-0 3
Course Learning Objectives:
1. Applying and understanding the big data flow for the actual projects.
2. Understands the lifecycle of the data analytics & big data ecosystem and able to apply for
real world problems.
3. Acquires knowledge on the tools and techniques for solving big data analytics.
4. Learns how to apply the mining techniques on big data.

Course Content:
Unit - I (8 Contact Hours)
Introduction to Big Data Analytics:Big Data Overview, State of the Practice in Analytics, Key
Roles for the New Big Data Ecosystem, Examples of Big Data Analytics.
Data Analytics Lifecycle:Data Analytics Lifecycle Overview, Discovery, Data Preparation, Model
Planning, Model Building, Communicate Results, Operationalize.

Unit - II (8 Contact Hours)

Advanced Analytical Theory and Methods- Clustering: Overview of Clustering, K-means,
Additional Algorithms Advanced Analytical Theory and Methods-Association Rules: Overview,
Apriori Algorithm, Evaluation of Candidate Rules, Applications of Association Rules, An Example:
Transactions in a Grocery Store, Validation and Testing, Diagnostics.

Unit-III (8 Contact Hours)

Advanced Analytical Theory and Methods- Regression: Linear Regression, Logistic Regression,
Reasons to Choose and Cautions, Additional Regression Models Advanced Analytical Theory and
Methods-Classification: Decision Trees, Naïve Bayes, Diagnostics of Classifiers, Additional
Classification Methods.

Unit – IV (8 Contact Hours)

Advanced Analytical Theory and Methods-Time Series Analysis: Overview of Time Series
Analysis, ARIMA Model, Additional Methods.
Advanced Analytical Theory and Methods-Text Analysis: Text Analysis Steps, A Text Analysis
Example, Collecting Raw Text, Representing Text, Term Frequency--Inverse Document Frequency
(TFIDF), Categorizing Documents by Topics, Determining Sentiments, Gaining Insights.

UNIT V: (7 Contact Hours)

Advanced Analytics--Technology and Tools-MapReduce and Hadoop:Analytics for Unstructured
Data, The Hadoop Ecosystem, NoSQL.Advanced Analytics--Technology and Tools-In-Database
Analytics: SQL Essentials, In-Database Text Analysis, Advanced SQL.The Endgame or Putting It
All Together:Communicating and Operationalizing an Analytics Project, Creating the Final
Deliverables, Data Visualization Basics.

UNIT – VI: (7 Contact Hours)

Social Media Analytics and Text Mining: Introducing Social Media; Key elements of Social Media;
Text mining; Understanding Text Mining Process; Sentiment Analysis, Performing Social Media
Analytics and Opinion Mining on Tweets.

Learning Resources
Text Book:
1. Dunlop, Dorothy D., and Ajit C. Tamhane. ‘Statistics and data analysis: from elementary to
intermediate’. Prentice Hall, 2000.
2. EMC Education Services “Data Science and Big Data Analytics: Discovering, Analyzing,
Visualizing and Presenting Data” Wiley Publishers.
3. Tom White “ Hadoop: The Definitive Guide” Third Edition, O‟reilly Media, 2011.
4. Prajapati, "V. Big data analytics with R and Hadoop",Packt Publishing Ltd, 2013.
Reference Books:
1. Ohlhorst, Frank J. ‘Big data analytics: turning big data into big money’. John Wiley &
Sons, 2012.
2. W.N. Venables, D.M Smith, ‘An introduction to R’, Network Theory Ltd.
3. Nina Zumel, John Mount, ‘Practical Data Science with R’, Manning Publications, 2014
4. Tom Plunkett, Mark Hornick, ‘Using R to Unlock the Value of Big Data: Big Data Analytics
with Oracle R Enterprise and Oracle R Connector for Hadoop’, McGraw-Hill/Osborne Media
(2013), Oracle press.

Web Resources:
1. Implementing big data analysis, 19 Dec 2017 URL https://aiodex.com/?ref=5b45a599c7165
2. Big data and Hadoop introduction 17 Jul 2014 URL http://www.simplilearn.com/big-data-a
3. Big data and analytics 17 Jul 2014 URL https://www.simplilearn.com/resources

Course Outcomes: At the end of the course, the student will be able to
CO 1 Have a clear idea about the big data flow and its ecosystem.

Apply the tools and techniques on big data while applying data mining
CO 2 techniques.

CO 3 Use statistical tool and statistical methods that can be applied on big data.

CO 4 Have a clear idea about how to represent the unstructured data in the data bases
Understand the common Hadoop ecosystem components, Hadoop Architecture,
CO 5
HDFS, Anatomy of File Write and Read, Rack Awareness.
CO 6 Have a clear idea about social media data,text mining,mobile analytics.

Assessment Method
Assessment Tool Weekly tests Monthly tests End Semester Test Total
Weightage (%) 10% 30% 60% 100%
****************************************************************************

Course
Course Code Course Name L-T-P Credits
Category
Distributed
23CS3222 PEC 3-0-0 3
Operating Systems

Course Learning Objectives:

1. To learn the fundamentals of Distributed Systems.
2. To learn distributed services such as the world-wide web.
3. To learn examples of research and commercial distributed systems.
4. To learn about distributed algorithms and distributed file systems and distributed.
5. databases, security and protection.
6. To expose students to past and current research issues in the field of distributed systems
7. challenges in cloud computing.
8. To create an awareness of the fundamental technical challenges in advanced distributed
9. systems design and implementation.

Course Contents:

Unit I (7 Contact Hours)

Definition of distributed systems, Goals of distributed system, types of distributed systems,
Architectural Styles , types of architectures.

Unit II (8 Contact Hours)

Threads in Distributed Systems ,Virtualization, clients , servers , client server design issues, code
migration.

Unit III (8 Contact Hours)

Distributed systems communication fundamentals, RPC,Message-Oriented Communication Stream-
Oriented Communication , Multicast communication.

Unit IV (9 Contact Hours)

Names, Distributed Hash Tables, Attribute-based Naming, Hierarchical Implementations,
Decentralized Implementations .clock synchronization,logical clocks, mutual exclusion, election
algorithms, atomic transaction, deadlocks in distributed systems.

Unit V (8 Contact Hours)

Distributed file systems, distributed file system design, distributed file system implementation,
trends in distributed file system.

Unit VI (9 Contact Hours)

Distributed shared memory, introduction, what is shared memory, consistency models, page based
distributed shared memory, shared-variable distributed shared memory, object based distributed
shared memory.

Learning Resources:
Text Book:
1. Andrew S. Tanenbaum, ”Distributed Operating Systems”, PHI, Third Edition.
2. George Coulouris,”Distributed Systems: Concepts and Design”Pearson,5th Edition

References:
1. William Stallings. “Operating Systems, Internal and Design principles”, Pearson India,
Fourth Edition.
Video References:
1. NPTEL Lecture: Prof. Ananthanarayana V.S. https://nptel.ac.in/courses/106106107
2. NPTEL Lecture: Dr. Rajiv Misra, https://nptel.ac.in/courses/106104182

Course Outcomes: At the end of the course, the student will be able to
CO 1 Demonstrate knowledge of the basic elements and concepts related to distributed
system technologies
CO 2 Demonstrate knowledge of the core architectural aspects of distributed systems
CO 3 Design and implement distributed applications
CO 4 Demonstrate knowledge of details the main underlying components of distributed
systems (such as RPC, file systems)
CO 5 Demonstrate knowledge of details the main underlying components of distributed
systems (such as RPC, file systems)
CO 6 Demonstrate experience in building large-scale distributed applications.

Course learning Objectives:

1. To learn the fundamentals of Operating Systems.
2. To learn the mechanisms of OS to handle processes and threads and their communication.
3. To learn the mechanisms involved in memory management in contemporary OS.
4. To gain knowledge on distributed operating system concepts that includes architecture,
Mutual exclusion algorithms, deadlock detection algorithms and agreement protocols.
5. To know the components and management aspects of concurrency management, To learn
programmatically to implement simple OS mechanisms.
6. Syllabus deals with issues in real time operating systems, importance of deadlines and concept
of task scheduling.

Course Content:

UNIT-I: REVIEW OF OPERATING SYSTEMS (8 Contact Hours)

Overview, OS structures, system calls, process cooperation, process communication, semaphores,
conditional critical regions, deadlock, processor management, scheduling algorithms, Queuing
system model.

UNIT-II AN INTRODUCTION TO RTOS (8 Contact Hours)

Introduction to RTOS, types of RTOS, GPOS vs RTOS, applications of RTOS, Issues in real time
computing.

UNIT-III: REAL TIME MODELS AND LANGUAGES (8 Contact Hours)

Event Based – Process Based and Graph based Models – Pertinent Models – Real Time Languages
– RTOS Tasks – RT scheduling - Interrupt processing – Synchronization – Control Blocks –
Memory Requirements.

UNIT-IV: REAL TIME KERNEL (8 Contact Hours)

Principles – Design issues – Polled Loop Systems – RTOS Porting to a Target – Comparison and
study of RTOS VX works and μCOS – Case studies.

UNIT-V: RTOS APPLICATION DOMAINS (9 Contact Hours)

RTOS for Image Processing – Embedded RTOS for voice over IP – RTOS for fault Tolerant
Applications – RTOS for Control Systems.
UNIT-VI: DISTRIBUTED OPERATING SYSTEMS (8 Contact Hours)
Distributed operating systems concept, file systems, mode of computation, load balancing, event
ordering, synchronization, distributed mutual exclusion, drinking philosophers problem, deadlocks
in distributed systems.

Learning Resources:
Text Books:
1. R.Mall, Real Time Systems: Theory and Practice, Pearson Education, 2007.
2. William Stallings, Operating Systems: Internals and Design Principles, 8th edition Pearson
Education Limited, 2014 ISBN: 1292061944, 9781292061948

References:
1. Tanenbaum, “Distributed Operating Systems”, Pearson Education.
2. Jane Liu, Real Time Systems, Pearson Education, 2000.
3. C.M.Krishna and K.G.Shin, Real Time Systems, Tata McGraw Hill, 1997.
4. Raymond J.A.Bhur, Donald L.Bailey, “An Introduction to Real Time Systems”, PHI 1999.
5. D.M Dhamdhere: Operating systems - A concept based Approach, 3rd Edition, Tata
McGraw- Hill, 2012.
6. P.C.P. Bhatt: Introduction to Operating Systems Concepts and Practice, 3rd Edition, PHI,
2010.

Video Reference:
1. NPTEL Lecture: Prof.Rajib Mall https://nptel.ac.in/courses/106105172
2. NPTEL Lecture: Prof. Chester Rebeiro https://nptel.ac.in/courses/106106144

Course Outcomes: At the end of the course, the student will be able to
CO 1 Summarize the issues in real time computing
CO 2 Understand the concept of the tradeoffs in design and implementation concepts
used in the development of Operating Systems
CO 3 Understand the differences between the processes and Threads.
CO 4 Understanding of memory management techniques are used in operating
systems.
CO 5 Understanding of I/O techniques are used in operating systems.
CO 6 Analyze the situation of fault occurrence and will be able to apply solutions
accordingly.
CO 7 Solve scheduling problems and can apply them in real time applications in
industry.
CO 8 Design an RTOS and will be able to interpret the feasibility of a task set to
accomplish or not.

Course Content:

Unit I (8 Contact Hours)

Introduction to Embedded Systems: Definition, Applications of ES, Embedded Hardware Units and
Devices, Embedded Software, Design Metrics in ES, Challenges in ES Design.

Unit II (7 Contact Hours)

Architecture of 8051: 8051 Microcontroller Hardware, Input/output Ports and Circuits, External
Memory, Counter and Timers, Serial data Input/output, Interrupts and Programming 8051.

Unit III (8 Contact Hours)

ARM- Embedded Processor: History, Architecture, Interrupt vector, Programming the ARM, ARM
Assembly language, Instruction set, Conditional Execution, Arithmetic and Logical Compare.

Unit IV (8 Contact Hours)

ARM PROGRAMMING: Assembly programming, General structure of assembly language,
Writing programs, Branch instructions, Loading constraints, load and store instructions, Readonly
and read/write Memory, Multiple Register Load and Store.

Unit V (8 Contact Hours)

REAL TIME OPERATING SYSTEMS: Introduction, Tasks and Task States, Tasks and Data,
Reentrancy, Semaphores and Shared Data, Inter Process Communication-Message Queues,
Mailboxes and Pipes.

Unit VI (7 Contact Hours)

REAL TIME OPERATING SYSTEMS-I : Timer Functions, Events, Memory Management,
Interrupt Routines in an RTOS Environment.

Learning Resources:
Text Books:
1. Raj Kamal, “Embedded Systems”, 2nd edition, Tata McGraw Hill, 2009.
2. Lyla B Das, “Embedded Systems an Integrated Approach”, 1st edition, Pearson, 2012.
3. David E. Simon, “An Embedded Software Primer”, 1st edition, Pearson Education, 2008.

Reference Books:
1. Wayne Wolf, “Computers as Components-principles of Embedded Computer System
Design”, 1st edition, Elseveir, 2009.
2. Labrosse, “Embedding system building blocks”, 2rd edition, CMP Publishers, 2007.
3. Kenneth J. Ayala and Thomson, “The 8051 Microcontroller”, 3rd edition, Thomson Delmar,
Learning, 2008.
4. Frank Vahid, Tony Givargis and John Wiley, “Embedded System Design, Microcontrollers”,
3rd edition, Pearson Education, 2008. 5. Michael J. Pont, “Embedded C”, Addison Wesley, 2002

Course Outcomes: At the end of the course, the student will be able to
CO 1 Understand the concept of embedded system, microcontroller, different
components of microcontroller and their interactions
Get familiarized with programming environment to develop embedded
CO 2
solutions
CO 3 Program ARM microcontroller to perform various tasks.
Understand the key concepts of embedded systems such as I/O, timers,
CO 4
interrupts and interaction with peripheral devices

Assessment Method
Assessment Tool Weekly tests Monthly tests End Semester Test Total
Weightage (%) 10% 30% 60% 100%
****************************************************************************
Course
Course Code Course Name L-T-P Credits
Category
Digital Image
23CS3225 PEC 3-0-0 3
Processing
Course Learning Objectives:
1. To describe the image fundamentals and mathematical transforms necessary for image
processing.
2. To explain the image enhancement techniques
3. To analyze images in the frequency domain using various transforms.
4. To explain image restoration procedures.
5. To describe Image Compression and Segmentation used in digital image processing.
6. To describe image feature extraction methods.
Course content:
Unit I (8 Content Hours)
Digital image fundamentals – Electromagnetic spectrum and imaging, Image acquisition, image
formation. Digitization-sampling and quantization, Resolution-pixel, gray scale, spatial, basic
relationship between pixels, Distance measure, Mathematical operations on image, Geometrical and
spatial transformation.

Unit II (8 Content Hours)

Intensity transformation and spatial filtering: Image enhancement, log transformation, Gamma
transformation, Histogram processing, Histogram matching, Special filtering- spatial correlation
and convolution, generating spatial filter mask, mage smoothing, Image sharpening-Laplacian filter,
Highboost filter. Edge detection- gradient filter, Morphological image processing-erosion, Dilation,
opening and closing operations, Boundary extraction, Hole Filling, Extraction of connected
components, Thinning, and thickening.

Unit III (7 Content Hours)

Image Restoration-Noise model, Restoration-Mean filter, Geometric filter, median filter, adaptive
filter, band pass filter, Notch filter, least mean square filters. Color fundamental-RGB color model,
CMY color model, HSI color model. Converting RGB to HSI and vice-versa
.
Unit IV (7 Content Hours)
Filtering in Frequency domain-Preliminary concept: Fourier series, Fourier transform, convolution,
Sampling, DFT, Enhancement in frequency domain, low pass filter, high pass filter. Computing
IDFT from DFT.

Unit V (8 Content Hours)

Image compression fundamental, coding, temporal and spatial redundancy, Error-free (Lossless)
and Lossy compression. Image segmentation, Point-line-edge detection. Image gradients operator,
canny edge detection, Edge linking and boundary detection, local processing, thresholding, variable
thresholding, Region Growing, Texture Segmentation; Region oriented segmentation.
Unit VI (8 Content Hours)
Feature Extraction: Edges – Canny, Sobel; Line detectors, Corners - Harris, Orientation Histogram,
SIFT, SURF, Scale-Space Analysis- Image Pyramids, Haar transform. Decision-theoretic and
structure descriptors.

Leaening Resources:
Text B Books:
1. Digital Image processing – R.C. Gonzalez & R.E. Woods, Addison Wesley/ Pearson
education, 3rd edition.
2. D. A. Forsyth, J. Ponce, Computer Vision: A Modern Approach, PHI Learning 2009.
3. Milan Soanka, Vaclav Hlavac and Roger Boyle, Digital Image Processing and Computer
Vision, Cengage Learning.

Reference Books:
1. Fundamentals of Digital Image processing – A.K.Jain , PHI

Course Outcomes:
1. Be able to apply, design and implement solutions for digital image processing problems.
2. Be able to discuss the strengths and limitations of DIP applications in solving problems with
both professional peers and lay clients.

2. To apply IR principles to locate relevant information large collections of data

3. To analyze performance of retrieval systems when dealing with unmanaged data
sources

4. To implement retrieval systems for web search tasks.

Course Content:

Unit I (7 Contact Hours)

Boolean retrieval. The term vocabulary and postings lists. Dictionaries and tolerant retrieval. Index
construction.

Unit II (8 Contact Hours)

Index Compression, Scoring, term weighting and the vector space model. Computing scores in a
complete search system, Relevance feedback and query expansion.

Unit III (9 Contact Hours)

XML retrieval. Probabilistic information retrieval, Text classification. Vector space classification.

Unit IV (7 Contact Hours)

Flat clustering, Hierarchical clustering, Matrix decompositions and latent semantic indexing.

Unit V (7 Contact Hours)

Web search basics. Web crawling and indexes, Link analysis.

Unit VI (7 Contact Hours)

Learning to Rank, Future of web search, Recommender Systems, Content Based Filtering,
Collaborative Filtering.

Learning resources:
Text Book:
1. Introduction to Information Retrieval , Christopher D. Manning and Prabhakar Raghavan
and Hinrich Schütze, Cambridge University Press, 2008.

Reference Books:
1. Information Storage and Retrieval Systems: Theory and Implementation, Kowalski, Gerald,
Mark T Maybury, Springer.
2. Modern Information Retrieval, Ricardo Baeza-Yates, Pearson Education, 2007.
3. Information Retrieval: Algorithms and Heuristics, David A Grossman and Ophir Frieder,
2nd Edition, Springer, 2004.
4. Information Retrieval Data Structures and Algorithms, William B Frakes, Ricardo
BaezaYates, Pearson Education, 1992. 5. Information Storage & Retieval, Robert Korfhage, John
Wiley & Sons
5. C.D. Manning, P. Raghavan, H. Schütze. Introduction to Information Retrieval, Cambridge
UP, 2008. (available in the Web, http://nlp.stanford.edu/IR‐book/).
6. Kowalski, Gerald, Mark T Maybury: Information Retrieval Systems: Theory and
Implementation, Kluwer Academic Press, 1997.

Web Resources:
1. https://youtu.be/q0srNT_XM_Y?list=PL0ZVw5- GryEkGAQT7lX7oIHqyDPeUyOMQ
2. https://youtu.be/j789k96g5aQ?list=PL0ZVw5-GryEkGAQT7lX7oIHqyDPeUyOMQ
3. https://youtu.be/Bl_tfdy6814
Course outcomes: At the end of the course, the student will be able to
CO 1 Ability to identify Database Management systems and data warehouses
Ability to use knowledge of data structures and indexing methods in information
CO 2
retrieval systems
CO 3 Ability to choose clustering and searching techniques for different database systems
Ability to Explain different types of search algorithms like Hardware text search
CO 4
systems and software text search systems
CO 5 understand the underlined problems related to IR

Assessment Method
Assessment Tool Weekly tests Monthly tests End Semester Test Total
Weightage (%) 10% 30% 60% 100%
****************************************************************************

Course
Course Code Course Name L-T-P Credits
Category
23CS3227 Software Testing PEC 3-0-0 3

Course Learning Objectives:

1. To understand the basic concepts of software engineering, life cycle models.
2. To understand in detail about the requirement analysis and requirement engineering
processes and testing methods.
3. To understand the concepts and principles involved in software design .
4. To understand the concepts and various types of software testing and project implementation
techniques.
5. To understand the techniques involved in software project management and Risk
management.
6. To understand the scope of test automation and tools for testing.

Course Content:

Unit 1 (8 Contact Hours)

Introduction to software testing: testing as an engineering activity, testing as a process,
testing axioms, basic definitions, software testing principles, tester’s role in a software development
organization.

Unit II (8 Contact Hours)

Introduction to software defects: origin of defects, costs of defects, defect classes, defect
repository and test design, defect examples, developer/tester support for developing a defect
repository, defect prevention techniques.

Unit III (12 Contact Hours)

Test case design : Test case design strategies: black box approach to test design, random testing,
requirements based testing, boundary value analysis, equivalence class partitioning, state-based
testing, cause-effect graph, compatibility testing, user documentation testing, domain testing, using
white box approach to test design: test adequacy criteria, static testing vs. structural testing, code
functional testing, coverage and control-flow graph, covering-code logic, paths, code-complexity
testing, evaluating test-adequacy criteria.

Unit IV (12 Contact Hours)

Levels of testing: need of levels of testing, unit testing,designing the unit tests, the test harness,
running the unit tests and recording results, integration tests, designing integration tests, integration
test planning,defect bash elimination system testing, acceptance testing, performance testing,
regression testing, ad-hoc testing, alpha-beta tests, testing Object Oriented systems-usability and
accessibility testing, configuration testing, compatibility testing, testing the documentation, website
testing.

Unit V (10 Contact Hours)

Test management: People and organizational issues in testing, organization structure for testing
teams, testing services,test plan components, test plan attachments, locating test items, test
management, test process, reporting test results, the role of three groups in test planning and policy
development-introducing test specialist, skills needed by test specialist, building a testing group.

Unit VI (10 Contact Hours)

Test Automation: software test automation, skills needed for automation, scope of automation,
design and architecture for automation, requirements for a test tool, challenges in automation, test
metrics and measurements, project progress and productivity metrics.

Learning resources:
Text books:
1. SrinivasanDesikan and Gopalaswamy Ramesh, “Software testing-principles and practices”,
Pearson Education, 2006
2. Ron Patton, “Software testing”, Second Edition, Sams Publishing, Pearson education, 2007

Reference Books:
1. Ilene Burnstein, “Practical software testing”, Springer International Edition, 2003
2. Edward Kit, “Software testing in real world- improving the process”, Pearson Education,
1995
3. Boris Beizer, “Software testing techniques”, Second Edition,
4. AdityaP.Mathur, “Foundations of software testing-fundamental algorithms and techniques”,
Pearson Education, 2008.

Web resources:
1. https://nptel.ac.in/courses/106105171/

Course outcomes: At the end of the course, the student will be able to
CO 1 Various test processes and continuous quality improvement
Methods of test generation from requirements
CO 2
CO 3 Behavior modeling using UML
Test adequacy assessment using: control flow, data flow, and program
CO 4
mutations
CO 5 The use of various test tools
CO 6 Application of software testing techniques in commercial environments
Assessment Method
Assessment Tool Weekly tests Monthly tests End Semester Test Total
Weightage (%) 10% 30% 60% 100%
****************************************************************************

Course
Course Code Course Name L-T-P Credits
Category
23CS3228 Mobile Computing PEC 3-0-0 3

Course Learning Objectives:

1. To understand the basic concepts of mobile computing.
2. To learn the basics of mobile telecommunication systems.
3. To be familiar with the network layer protocols and Ad-Hoc networks.
4. To know the basis of transport and application layer protocols.
5. To gain knowledge about different mobile platforms and application development.

Course Content:

Unit I: Introduction (9 Contact Hours)

Mobile Computing – Mobile Computing Vs Wireless Networking – Mobile Computing
Applications – Characteristics of Mobile computing – Structure of Mobile Computing Application.
MAC Protocols – Wireless MAC Issues – Fixed Assignment Schemes – Random Assignment
Schemes – Reservation Based Schemes.

Unit II: MOBILE INTERNET PROTOCOL AND TRANSPORT LAYER (9 Contact Hours)
Overview of Mobile IP – Features of Mobile IP – Key Mechanism in Mobile IP – route
Optimization – DHCP. Overview of TCP/IP – Architecture of TCP/IP- Adaptation of TCP Window
– Improvement in TCP Performance.

Unit III: MOBILE TELECOMMUNICATION SYSTEM (9 Contact Hours)

Global System for Mobile Communication (GSM) – General Packet Radio Service (GPRS) –
Universal Mobile Telecommunication System (UMTS).

Unit IV: MOBILE AD-HOC NETWORKS (9 Contact Hours)

Ad-Hoc Basic Concepts – Characteristics – Applications – Design Issues – Routing – Essential of
Traditional Routing Protocols –Popular Routing Protocols – Vehicular Ad Hoc networks (VANET)
– MANET Vs VANET – Security.

Unit V: MOBILE PLATFORMS AND APPLICATIONS (8 Contact Hours) Mobile

Device Operating Systems – Special Constraints & Requirements – Commercial Mobile Operating
Systems – Software Development Kit: iOS, Android, BlackBerry, Windows Phone.

Unit VI: MOBILE COMMERCE (8 Contact Hours)

Applications of MCommerce – Structure – Pros & Cons – Mobile Payment System – Security
Issues.

Learning resources
Text book:
1. Prasant Kumar Pattnaik, Rajib Mall, “Fundamentals of Mobile Computing”, PHI Learning
Pvt. Ltd, New Delhi – 2012
2. Jochen Schiller, “Mobile Communications”, PHI, Second Edition, 2003.

Reference Books:
1. Dharma Prakash Agarval, Qing and An Zeng, “Introduction to Wireless and Mobile
systems”, Thomson Asia Pvt Ltd, 2005.
2. Uwe Hansmann, Lothar Merk, Martin S. Nicklons and Thomas Stober, “Principles of
Mobile Computing”, Springer, 2003.
3. William. C. Y. Lee, “Mobile Cellular Telecommunications-Analog and Digital Systems”,
Second Edition, TataMcGraw Hill Edition ,2006.
4. C. K. Toh, “AdHoc Mobile Wireless Networks”, First Edition, Pearson Education, 2002.

Course outcomes: At the end of the course, the student will be able to
CO 1 Explain the basics of mobile telecommunication systems
CO 2 Illustrate the generations of telecommunication systems in wireless networks
Determine the functionality of MAC, network layer and Identify a routing
CO 3 protocol for a given Ad hoc network

CO 4 Explain the functionality of Transport and Application layers

CO 5 Develop a mobile application using android/blackberry/ios/Windows SDK
CO 6 Understand the M commerce

Course Learning Objectives:

1. Define compression; understand compression as an example of representation.
2. Understand the idea of lossless and lossy compression.
3. Understand the most common file formats for image, sound and video.
4. Distinguish the basic techniques of lossless compression.

Course Content:

Unit 1: (6 Contact Hours)

Introduction: Mathematical Preliminaries, Lossy and Lossless compression, Measure of
performances, Application of compression, Introduction to information theory.

Unit II: (8 Contact Hours)

Simple lossless Encoding, Run length encoding: Huffman coding, Applications of Huffman coding,
Adaptive Huffman coding, LZW coding, LZ77 and LZ78, Run length encoding, Arithmetic coding.

Unit III: (8 Contact Hours)

Fundamentals of Information Theory: Concepts of entropy, probability models, Markov models,
Fundamentals of coding theory, Algorithmic information theory & Minimum description.
Unit IV: (10 Contact Hours)
Lossless Compression Standards: zip, gzip, bzip, unix compression, GIF, JBIG, predictive coding

Unit V: (6 Contact Hours)

Image and Video Compression: Basis functions and transforms from an intuitive point,
JPEG, MPEG, Vector Quantization, Case study of WinZip, WinRar.

Unit VI: (7 Contact Hours)

Wavelet Based Compression, Quantization: Fundamentals of wavelets, various standard wavelet
bases, Multi resolution analysis and scaling function, JPEG 2000, scaler and vector quantization.

Learning Resources
Text books:

1. Khalid Sayood, “Introduction to Data Compression”, Elsevier, Fifth edition

Reference Books:
1. Mark Nelson, “The Data Compression book”, BPB Publications, First edition
2. Colt McAnlis, “Understanding Compression::Data Compression for Modern Developers”,
PublishShroff Publishers & Distributors Pvt Ltd,First edition

Web resources:
1. https://ocw.mit.edu/courses/electrical-engineering-and-computer-science/6-050j-
information-and-entropy-spring-2008/videos-homework-and-readings/unit-2-lecture-1/
2. https://nptel.ac.in/courses/106102064/19
3. https://www.ics.uci.edu/~dan/pubs/DataCompression.html.

Course Outcomes: At the end of the course, the student will be able to
CO 1 Explain lossless and lossy compression and correlate them with mathematical
concepts.
CO 2 Implement Huffman encoding, LZW, LZ77 and LZ78 in various projects.
CO 3 Discuss the concept of Information theory and its relation to data compression.
CO 4 Use the standards like zip, bzip etc. according to the requirements.
CO 5 Perform image and video compression according to the real world project
requirements.
CO 6 Use the concepts like wavelet transform and quantization.

Assessment Method
Assessment Tool Weekly tests Monthly tests End Semester Test Total
Weightage (%) 10% 30% 60% 100%
****************************************************************************

Course
Course Code Course Name L-T-P Credits
Category
23CS3230 Computer Graphics PEC 3-0-0 3

Course Learning Objectives:

1. Gain knowledge about graphics hardware devices and software used.
2. Understand the two dimensional graphics and their transformations.
3. Understand the three dimensional graphics and their transformations. Appreciate
illumination and color models.
4. Be familiar with understanding clipping techniques.

Course Content:

UNIT I INTRODUCTION (8 Contact Hours)

Survey of computer graphics, Overview of graphics systems – Video display devices, Raster scan
systems, Random scan systems, Graphics monitors and Workstations, Input devices, Hard copy
Devices, Graphics Software; Output primitives – points and lines, line drawing algorithms, loading
the frame buffer, line function; circle and ellipse generating algorithms; Pixel addressing and object
geometry, filled area primitives.

UNIT II Two Dimensional Graphics (8 Contact Hours)

Two dimensional geometric transformations – Matrix representations and homogeneous
coordinates, composite transformations; Two dimensional viewing – viewing pipeline, viewing
coordinate reference frame; widow-to-viewport coordinate transformation, Two dimensional
viewing functions; clipping operations – point, line, and polygon clipping algorithms.

UNIT III Three Dimensional Graphics (8 Contact Hours)

Three dimensional concepts; Three dimensional object representations – Polygon surfaces- Polygon
tables- Plane equations – Polygon meshes; Curved Lines and surfaces, Quadratic surfaces; Blobby
objects; Spline representations – Bezier curves and surfaces -B-Spline curves and surfaces.
TRANSFORMATION AND VIEWING: Three dimensional geometric and modeling
transformations – Translation, Rotation, Scaling, composite transformations; Three dimensional
viewing – viewing pipeline, viewing coordinates, Projections, Clipping; Visible surface detection
methods.

UNIT IV Illumination And Colour Models (7 Contact Hours)

Light sources – basic illumination models – halftone patterns and dithering techniques; Properties
of light – Standard primaries and chromaticity diagram; Intuitive colour concepts – RGB colour
model – YIQ colour model – CMY colour model – HSV colour model – HLS colour model; Colour
selection.

UNIT V Animations & Realism 10 Animation Graphics (8 Contact Hours)

Design of Animation sequences – animation function – raster animation – key frame systems –
motion specification –morphing – tweening. COMPUTER GRAPHICS REALISM: Tiling the plane
– Recursively defined curves – Koch curves – C curves – Dragons – space filling curves – fractals –
Grammar based models – fractals – turtle graphics – ray tracing.

UNIT –VI Multimedia System: (8 Contact Hours)

An Introduction, Multimedia hardware, Multimedia System Architecture. Data & File Format
standards. i.e RTF, TIFF, MIDI, JPEG, DIB, MPEG,Audio: digital audio, MIDI, processing sound,
sampling, compression. Video: Avi, 3GP,MOV, MPEG .

Learning Resources:
Text Books:
1. John F. Hughes, Andries Van Dam, Morgan Mc Guire ,David F. Sklar , James D. Foley,
Steven K. Feiner and Kurt Akeley ,”Computer Graphics: Principles and Practice”, , 3rd Edition,
Addison- Wesley Professional,2013.
2. Donald Hearn and Pauline Baker M, “Computer Graphics”, Prentice Hall, New Delhi, 2007.

References:
1. Donald Hearn and M. Pauline Baker, Warren Carithers,“Computer Graphics With Open
GL”, 4th Edition, Pearson Education, 2010.
2. Jeffrey McConnell, “Computer Graphics: Theory into Practice”, Jones and Bartlett
Publishers, 2006.
3. Hill F S Jr., “Computer Graphics”, Maxwell Macmillan” , 1990.
4. Peter Shirley, Michael Ashikhmin, Michael Gleicher, Stephen R Marschner, Erik Reinhard,
KelvinSung, and AK Peters, Fundamental of Computer Graphics, CRC Press, 2010.
5. William M. Newman and Robert F.Sproull, “Principles of Interactive Computer Graphics”,
Mc GrawHill 1978. http://nptel.ac.in/

Course Outcomes: At the end of the course, the student will be able to
CO1 Design two dimensional graphics.
CO2 Apply two dimensional transformations.
CO3 Design three dimensional graphics.
CO4 Apply three dimensional transformations.
CO5 Apply Illumination and color models.
CO6 Apply clipping techniques to graphics.
CO7 Design animation sequences.

Assessment Method
Assessment Tool Weekly tests Monthly tests End Semester Test Total
Weightage (%) 10% 30% 60% 100%
****************************************************************************

Course
Course Code Course Name L-T-P Credits
Category
Blockchain
23CS3231 PEC 3-0-0 3
Technology

Course Learning Objectives:

1. To assess blockchain applications in a structured manner.
2. To impart knowledge in block chain techniques and be able to present the concepts clearly
and structured.
3. To get familiarity with future currencies and to create own crypto token

Unit I (8 Contact Hours)

Introduction to Block chain: The story of a transaction, From Transactions to Blocks, Blocks and
Distributed Consensus, Design Primitives Protocols, Security, Consensus, Permissions, Privacy
Block chain Architecture and Design Basic crypto primitives of Hash, Signature, Hash chain to
Block chain Basic mechanisms, Introduction to major block chain platforms.

Unit II (7 Contact Hours)

Unit III (8 Contact Hours)

Block chain in Multitude of clients in Ethereum, Production and test networks in Ethereum, Public,
private and development deployments; Solidity in depth, Building blocks popular contracts already
in deployment; Consensus protocols for Permissioned Block chains; Hyperledger Fabric I:
Decomposing the consensus process, Hyperledger fabric components, Chain code Design and
Implementation; Hyperledger Fabric II: Beyond Chain code: fabric SDK and Front End
Hyperledger composer tool.

Unit IV (8 Contact Hours)

Block chain in Financial Software and Systems Settlements KYC, Capital markets, Insurance Block
chain in trade/supply chain, and Provenance of Block chain for Government: Digital identity, land
records and other kinds of public distribution system / social welfare systems; Conceptual
distinction between a payment system and a decentralized applications platform. Differences in
their architectures from security-first aspect to a rich feature set, Future roadmap for them,
following their own paths with probable interconnections.

Unit V (7 Contact Hours)

Block chain Cryptography: Privacy and Security on Block chain, Research aspects: Secure
cryptographic protocols on Block chain; Secured Multi-party Computation.

Unit VI (7 Contact Hours)

Block chain for science making better use of the data-mining network; Considerations for
production deployment a) Quality of decentralized applications in Code patterns, Security Other
smart contract platforms, Discussion of future prospects.

Learning Resources:
Text Books:
1. Robert C. Hackney, “Lawyer's Guide to Block chain Technology: What it is and how it will
disrupt the practice of law”, Kindle Edition, O’Reilly Publishing, 2017.

Reference Books
1. Andreas Antonopoulos, “Mastering Bit Coin”, O’Reilly Publishing, 2014.
2. Stephan Fleming, “Block chain Technology & Micro services Architecture: A Non-Programmer’s
Handbook “Kindle Edition, Neha Dubey, 2018.

Course Outcomes:
1. Understand the various technologies and their business use.
2. Analyse the block chain applications in a structured manner.
3. Explain the modern concepts of block chain technology systematically.
4. Handle the cryptocurrency. Understand the modern currencies and its market usage.
5. Demonstrate the application of hashing and public key cryptography in protecting the blockchain
6. Explain the elements of trust in a Blockchain: validation, verification, and consensus.

Assessment Method
Assessment Tool Weekly tests Monthly tests End Semester Test Total
Weightage (%) 10% 30% 60% 100%
****************************************************************************

ENGINEERING FOURTH YEAR: SEMESTER-I

****************************************************

List of Professional Elective Courses (PEC)

Elective - IV & V Pool
***********************************************

Course
Course Code Course Name L-T-P Credits
Category
Unix Shell
23CS4121 PEC 3-0-0 3
Programming

Course Learning Objectives:

1. Written technical communication and effective use of concepts and
terminology.
2. Facility with UNIX command syntax and semantics.
3. Ability to read and understand specifications, scripts and programs.
4. Individual capability in problem solving using the tools presented within
the class Students will demonstrate a mastery of the course materials and concepts
within in class discussions.

Course Content:

UNIT I – Introduction to UNIX (8 Contact Hours)

Architecture of Unix, Features of Unix , Unix Commands – PATH, man, echo, printf, script,
passwd, uname, who, date, stty, pwd, cd, mkdir, rmdir, ls, cp, mv, rm, cat, more, wc, lp, od, tar,
gzip,cpio,ln.

UNIX Utilities: (8 Contact Hours)

Process utilities, disk utilities,networking commands, unlink, du, df, mount, umount, find, unmask,
ulimit, ps, w, finger, arp, ftp, telnet, rlogin.Text processing utilities and backup utilities , detailed
commands to be covered are tail, head , sort, uniq, grep, egrep, fgrep, cut, paste, join, tee, pg,
comm, cmp, diff, tr, awk.

UNIT II - File Management (6 Contact Hours)

Introduction to unix file system, vi editor, file handling utilities, security by file permissions,File
Structures, System Calls for File Management – create, open, close, read, write, lseek, link,
symlink, unlink, stat, fstat, lstat, chmod, chown, Directory API – opendir, readdir, closedir, mkdir,
rmdir, umask.

UNIT III – Introduction to Shells & Filters (7 Contact Hours)

Introduction to Shells : Unix Session, Standard Streams, Redirection, Pipes, Tee Command,
Command Execution, Command Line Editing, Quotes, Command Substitution, Job Control,
Aliases, Variables, Predefined Variables, Options, Shell/Environment Customization.
Filters: Filters and Pipes, Concatenating files, Display Beginning and End of files, Cut and Paste,
Sorting, Translating Characters, Files with Duplicate Lines, Count Characters, Words or Lines,
Comparing Files.

UNIT IV – grep, sed, awk (7 Contact Hours)

grep : Operation, grep Family, Searching for File Content.
sed : Scripts, Operation, Addresses, commands, Applications, grep and sed.
awk: Execution, Fields and Records, Scripts, Operations, Patterns, Actions, Associative Arrays,
String Functions, String Functions, Mathematical Functions, User – Defined Functions, Using
System commands in awk, Applications, awk and grep, sed and awk.

UNIT V – Korn shell programming (7 Contact Hours)

Interactive Korn Shell: Korn Shell Features, Two Special Files, Variables, Output, Input, Exit
Status of a Command, eval Command, Environmental Variables, Options, Startup Scripts,
Command History, Command Execution Process.
Korn Shell Programming: Basic Script concepts, Expressions, Decisions: Making Selections,
Repetition, special Parameters and Variables, changing Positional Parameters, Argument Validation,
Debugging Scripts, Script Examples.
UNIT VI – C shell programming (7 Contact Hours)
Interactive C Shell: C shell features, Two Special Files, Variables, Output, Input, Exit Status of a
Command, eval Command, Environmental Variables, On-Off Variables, Startup and Shutdown
Scripts, Command History, Command Execution Scripts.
C Shell Programming: Basic Script concepts, Expressions, Decisions: Making Selections,
Repetition, special Parameters and Variables, changing Positional Parameters, Argument Validation,
Debugging Scripts, Script Examples.

Learning resources:
Text Book:

1. Behrouz A. Forouzan & Richard F. Gilberg, “Unix and Shell Programming”, 1st edition,
Cengage Learning, 2003

Reference Books:
1. Sumitabha Das, “Your Unix: The Ultimate Guide”, 1st edition, Tata Mcgraw hill, 2001
2. Graham Glass, King Ables, “Unix for programmers and Users”, 3rd edition, Pearson
Education, 2003
3. Kernighan & Pike, “The UNIX Programming Environment”, 1st edition, Pearson Education
India, 2015
4. Ken Rosen, James Farber, Rachel Klee, Douglas Host, and Dick Rosinski, “ Unix: The
Complete Reference”, 2nd edition, McGraw Hill Education, 2007

Web resources:
1. Essential Linux/Unix Commands – GeeksforGeeks https://www.geeksforgeeks.org/essential-
linuxunix-commands/
2. Introduction to Linux Shell and Shell Scripting - GeeksforGeeks
https://www.geeksforgeeks.org/introduction-linux-shell-shell-scripting/
3. UNIX /LINUX TUTORIAL https://www.tutorialspoint.com/unix/

Course outcomes: At the end of the course, the student will be able to

CO 1 Documentation will demonstrate good organization and readability.

CO 2 Able to do Data organization, problem solving and research.
CO 3 Demonstrate simple effective user interfaces.
CO 4 Demonstrate effective use of structured programming.

CO 5 Will be accompanied by printed output demonstrating completion of a test plan

Assessment Method
Assessment Tool Weekly tests Monthly tests End Semester Test Total
Weightage (%) 10% 30% 60% 100%
****************************************************************************

Course
Course Code Course Name L-T-P Credits
Category
23CS4122 Deep Learning PEC 3-0-0 3

Course Objectives:
1. To build the foundation of deep learning.
2. To understand how to build the neural network.
3. To enable the students to develop successful machine learning concepts.

UNIT - I (8 Contact Hours)

Introduction: Feed forward Neural networks, Gradient descent and the back propagation algorithm,
Unit saturation, the vanishing gradient problem, and ways to mitigate it. RelU Heuristics for
avoiding bad local minima, Heuristics for faster training, Nestors accelerated gradient descent,
Regularization, Dropout.

UNIT - II (7 Contact Hours)

Convolutional Neural Networks: Architectures, convolution / pooling layers, Recurrent
NeuralNetworks: LSTM, GRU, Encoder Decoder architectures.

UNIT -III (7 Contact Hours)

Deep Unsupervised Learning: Autoencoders, Variational Auto-encoders, Adversarial Generative
Networks, Auto-encoder and DBM Attention and memory models, Dynamic Memory Models.

UNIT - IV (7 Contact Hours)

Applications of Deep Learning to Computer Vision: Image segmentation, object detection,
automatic image captioning, Image generation with Generative adversarial networks, video to text
with LSTM models, Attention models for computer vision tasks.
UNIT - V (9 Contact Hours)
Applications of Deep Learning to NLP: Introduction to NLP and Vector Space Model of
Semantics,Word Vector Representations: Continuous Skip-Gram Model, Continuous Bag-of-Words
model(CBOW), Glove, Evaluations and Applications in word similarity.

UNIT - VI (7 Contact Hours)

Analogy reasoning: Named Entity Recognition, Opinion Mining using Recurrent Neural Networks:
Parsing and Sentiment Analysis using Recursive Neural Networks: Sentence Classification using
Convolutional Neural Networks, Dialogue Generation with LSTMs.

Learning Resources:
Text Books:
1. Deep Learning by Ian Goodfellow, YoshuaBengio and Aaron Courville, MIT Press.
2. The Elements of Statistical Learning by T. Hastie, R. Tibshirani, and J. Friedman, Springer.
3. Probabilistic Graphical Models by D. Koller, and N. Friedman, MIT Press.

Course Outcomes:
1. Upon the Successful Completion of the Course, the Students would be able to: Learn the
fundamental principles of deep learning.
2. Identify the deep learning algorithms for various types of learning tasks in various domains.
3. Implement deep learning algorithms and solve real-world problems.

Assessment Method
Assessment Tool Weekly tests Monthly tests End Semester Test Total
Weightage (%) 10% 30% 60% 100%
****************************************************************************

Course
Course Code Course Name L-T-P Credits
Category
23CS4123 VLSI PEC 3-0-0 3

Course Learning Objectives:

1. To make
understand the student the introductory concepts of Very Large Scale Integrated Circuits
design such as HDLs, CMOS circuit design, Layout techniques and fabrication

Course Content:

Unit I (13 Contact Hours)

Finite State Machines and Verilog HDL: Mealy state machines, Moore state machines,
Conversion of Mealy machines to Moore machines and vice-versa, Redundancy elimination,
Sequence detectors with and without overlapping, Parity detectors and generators.
Verilog HDL: Gate Level modeling, Dataflow modeling, Behavioral modeling, Delay
modeling, Writing test bench, FSM modeling.
5. Unit-II (7
Contact Hours)
Digital System Design and Verilog HDL: Specifications, Moore’s Law, Data path design, Control
path design, GCD Datapath design, GCD Control path design, State machine for traffic light
controller . FPGA Design flow, ASIC Design flow. Verilog HDL: Datapath, Control path, System
Design

Unit III (3 Contact Hours)

Fabrication: Fabrication process flow: cleaning, oxidation, patterning, Mask Alignment,
Lithography- types, etching-types, annealing, different photo-resists, Electrical and Mechanical
Testing, Cleaning.

Unit IV (3 Contact Hours)

CMOS Circuit Design: Design of inverter, NAND, NOR, EXOR, Half-Adder, Full adder,
Multiplexer and other circuits using CMOS logic.

Unit V (3 Contact Hours)

Circuit Layout Design: MOS Layers, Stick Diagrams, Design Rules and Layout, General
Observations on the Design rules, Layout diagrams and optimization techniques.
Learning Resources:

6. T
ext Books:

1. Stephen Brown,
ZvokoVranesic, 'Fundamentals of Digital Design using Verilog', Mc Graw Hill publications
2. Douglas A.Pucknell and Kamran Eshraghian, 'Basic VLSI Design', PH publications.

Reference Books:
1. Samir
Palnitkar, 'Verilog HDL - A Guide to Digital Design and Synthesis', Pearson publications.
2. Stephen D.
Senturia, 'Microsystem Design', Kluwer Academic Publishers.
3. Marc Madou,
'Fundamentals of Microfabrication', CRC Press.
4. Ian Grout, 'Digital
Systems Design with FPGAs and CPLDs', Elsevier-2008.

Web Resources:
1. Prof S Shankar
Balachandran, NPTEL-IIT Madras, 'Digital circuits & Systems'. URL:
http://nptel.ac.in/courses/117106114/
2. P
rof S Srinivasan, NPTEL - IIT Madras, 'Digital circuits and systems' URL:
https://nptel.ac.in/courses/117106086/
3. Pro
f S Parasuraman, NPTEL-IIT Madras, 'Electronic materials, devices and
fabrication'. URL: https://nptel.ac.in/courses/113106062/
4. Deepak Kumar
Tala, URL: http://www.asic-world.com
Course Outcomes: At the end of the course, the student will be able to

CO 1 Understand specifications of VLSI designs, Moore's Law

CO 2 Different VLSI Design flows - FPGA, ASIC
Understand the concepts of Finite State Machines and its relevance in IC
CO 3
Design
CO 4 Modeling of digital designs using hardware description language
CO 5 Understand the different steps involved in IC fabrication process
CO 6 Understand the concept of IC layout

Assessment Method
Assessment Tool Weekly tests Monthly tests End Semester Test Total
Weightage (%) 10% 30% 60% 100%
****************************************************************************

Course
Course Code Course Name L-T-P Credits
Category
Optimization
23CS4124 PEC 3-0-0 3
Techniques

Course Learning Objectives:

1. To define an objective function and constraint functions in terms of design variables, and then
state the optimization problem.
2. To state single variable and multi variable optimization problems, without and with Constraints.
3. To explain linear programming technique to an optimization problem, define slack and surplus
variables, by using Simplex method.
4. To state transportation and assignment problems as a linear programming problem to determine
Simplex method.
5. To study and explain nonlinear programming techniques, unconstrained or
6. Constrained, and define exterior and interior penalty functions for optimization problems.
7. To explain Dynamic programming technique as a powerful tool for making a sequence of
interrelated decisions.

Course Content:
Unit I (8 Contact Hours)
Introduction and Classical Optimization Techniques: Statement of an Optimization problem –
design vector – design constraints – constraint surface – objective function – objective function
surfaces – classification of Optimization problems.

Unit II (8 Contact Hours)

Classical Optimization Techniques : Single variable Optimization – multi variable Optimization
without constraints – necessary and sufficient conditions for minimum/maximum – multivariable
Optimization with equality constraints. Solution by method of Lagrange multipliers – multivariable
Optimization with inequality constraints – Kuhn – Tucker conditions.

Unit III (8 Contact Hours)

Linear Programming : Standard form of a linear programming problem – geometry of linear
programming problems – definitions and theorems – solution of a system of linear simultaneous
equations – pivotal reduction of a general system of equations – motivation to the simplex method –
simplex algorithm – Duality in Linear Programming – Dual Simplex method.

Unit IV (7 Contact Hours)

Transportation Problem : Finding initial basic feasible solution by north – west corner rule, least
cost method and Vogel’s approximation method – testing for optimality of balanced transportation
problems – Special cases in transportation problem.

Unit V (7 Contact Hours)

Nonlinear Programming: Unconstrained cases – One – dimensional minimization methods:
Classification, Fibonacci method and Quadratic interpolation method – Univariate method, Powell’s
method and steepest descent method.

Unit VI (7 Contact Hours)

Dynamic Programming: Dynamic programming multistage decision processes – types – concept
of sub optimization and the principle of optimality – computational procedure in dynamic
programming – examples illustrating the calculus method of solution – examples illustrating the
tabular method of solution.

Learning resources
Text books:
1. S.S.Rao - “Engineering optimization : Theory and practice”, New Age International (P)
Limited, 3rd edition, 1998.
2. H.S. Kasene & K.D. Kumar “Introductory Operations Research” , Springer (India), Pvt.
LTd.

Reference Books:
1. K.V. Mital and C. Mohan -“Optimization Methods in Operations Research and System
Analysis” , New Age International (P) Limited, Publishers, 3rd edition, 1996.
2. Dr. S.D.Sharma, Kedarnath, Ramnath & Co -Operations Research
3. G. Hadley “Operations Research : An Introduction” – by H.A.Taha,PHI pvt. Ltd., 6th
edition Linear Programming.

Course outcomes: At the end of the course, the student will be able to
State and formulate the optimization problem, without and with constraints, by
CO 1
using design variables from an engineering design problem
Apply classical optimization techniques to minimize or maximize a multi-
CO 2 variable objective function, without or with constraints, and arrive at an
optimal solution.
Formulate a mathematical model and apply linear programming technique by
CO 3 using Simplex method. Also extend the concept of dual Simplex method for
optimal solutions
Solve transportation and assignment problem by using Linear programming
CO 4
Simplex method.
Apply gradient and non-gradient methods to nonlinear optimization problems
CO 5 and use interior or exterior penalty functions for the constraints to derive the
optimal solutions.
Formulate and apply Dynamic programming technique to inventory control,
CO 6 production planning, engineering design problems etc. to reach a final optimal
solution from the current optimal solution.

Assessment Method
Assessment Tool Weekly tests Monthly tests End Semester Test Total
Weightage (%) 10% 30% 60% 100%
****************************************************************************

Course
Course Code Course Name L-T-P Credits
Category
23CS4125 Design Patterns PEC 3-0-0 3

Course Learning Objectives

1. The focus of this course is on design rather than implementation.

2. Introducing the Unified Process and showing how UML can be used within the process.
3. Presenting a comparison of the major UML tools for industrial-strength development.
4. Introduction to design patterns, practical experience with a selection of central patterns.

Course Content: (8 Contact Hours)

Unit I: Introduction
Introduction to OOAD; typical activities / workflows / disciplines in OOAD, Introduction to
iterative development and the Unified Process, Introduction to UML; mapping disciplines to UML
artifacts, Introduction to Design Patterns – goals of a good design, Introducing a case study & MVC
architecture.

Unit II: Inception (8 Contact Hours)

Artifacts in inception, Understanding requirements – the FURPS model, Understanding Use case
model – introduction, use case types and formats, Writing use cases – goals and scope of a use case,
elements / sections of a use case, Use case diagrams, Use cases in the UP context and UP artifacts,
Identifying additional requirements, Writing requirements for the case study in the use case model.

Unit III: Elaboration: (8 Contact Hours)

System sequence diagrams for use case model, Domain model: Identifying concepts, adding
associations, adding attributes, Interaction Diagrams, Introduction to GRASP design Patterns,
Design Model: Use case realizations with GRASP patterns, Design Class diagrams in each MVC
layer Mapping Design to Code, Design class diagrams for case study and skeleton code.

Unit IV More Design Patterns: (7 Contact Hours)

Fabrication, Indirection, Singleton, Factory, Facade, Publish-Subscribe.

Unit V More UML diagrams : (7 Contact Hours)

State-Chart diagrams, Activity diagrams, Component Diagrams, Deployment diagrams, Object
diagrams.
Unit VI Advanced concepts in OOAD : (7 Contact Hours)
Use case relationships, Generalizations Domain Model refinements, Architecture, Packaging model
elements.

Learning Resources:

Text books:

1. Applying UML and patterns’ by Craig Larman, Pearson

2. Object-Oriented Analysis & Design with the Unified Process by Satzinger, Jackson & Burd
Cengage Learning
3. ‘UML distilled’ by Martin Fowler , Addison Wesley, 2003

Reference Books:
1. O’reilly ‘ s ‘Head-First Design Patterns’ by Eric Freeman et al, Oreillly
2. UML 2 Toolkit, by Hans-Erik Eriksson, Magnus Penker, Brian Lyons, David Fado:WILE\’-
Dreamtech lndia Pvt. Lid.

Course Outcomes

1. Students successfully completing this course will be able to:

1. identify the purpose and methods of use of common object-oriented design patterns.
2. select and apply these patterns in their own designs for simple programs.
3. represent the data dependencies of a simple program using UML.
4. represent user and programmatic interactions using UML.
5. create design documentation outlining the testable and complete design of a simple program.
6. produce and present documents for the purpose of capturing software requirements and
specifications.
7. produce plans to limit risks specific to software designed for use in a particular social
context.

Assessment Method
Assessment Tool Weekly tests Monthly tests End Semester Test Total
Weightage (%) 10% 30% 60% 100%
****************************************************************************

Course
Course Code Course Name L-T-P Credits
Category
23CS4126 Cloud Computing PEC 3-0-0 3

Course Learning Objectives:

1. Understan
d various basic concepts related to cloud computing technologies.
2. Understan
d the architecture and concept of different cloud models: IaaS, PaaS, SaaS.
3. Understan
d big data analysis tools and techniques.
4. Understan
ding of cloud virtualization, cloud storage, data management and data visualization.
5. Understan
d different cloud programming platforms and tools.

Course Content:

Unit I: (9 Contact Hours)

Introduction to Cloud Computing: Cloud Computing in a Nutshell, System Models for Distributed
and Cloud Computing, Roots of Cloud Computing, Grid and Cloud, Layers and Types of Clouds,
Desired Features of a Cloud, Basic Principles of Cloud Computing, Challenges and Risks, Service
Models.

Unit II (9 Contact Hours)

Virtual Machines and Virtualization of Clusters and Data Centers, Levels of Virtualization,
Virtualization Structures/tools and Mechanisms, Virtualization of CPU, Memory and I/O Devices,
Virtual Clusters and Resource Management, Virtualization Data-Centre Automation.

Unit III (7 Contact Hours)

Cloud computing architectures: over Virtualized Data Centers: Data–Center design and
Interconnection networks, Architectural Design of Compute and Storage Clouds, Public Cloud
Platforms, GAE, AWS, Azure, Inter-cloud Resource Management.

Unit IV (8 Contact Hours)

Cloud Programming and Software Environments: Features of Cloud and Grid Platforms, parallel
and distributed Programming Paradigms, Programming Support of Google App Engine,
Programming on Amazon AWs and Microsoft Azure, Emerging Cloud Software Environments.

Unit V (7 Contact Hours)

Disaster Recovery, Disaster Recovery Planning, comparing approaches in Xen, Eucalyptus, Open
Nebula, Amazon, Nimbus.

Unit VI (7 Contact Hours)

Various trends in computing, Web Services, Service Oriented Architecture (SOA)

Learning resources:
Text book:
1. John W. Rittenhouse, James F. Ransome, "Cloud Computing: Implementation, Management,
and Security ", CRC Press, 2009.
2. RajkumarBuyya, James Broberg, Andrzej M. Goscinski, “Cloud Computing: Principles and
Paradigms”, WileyPublishing, 2011.
3. Sandeep Bhowmik “Cloud Computing” Cambridge Publishing, 2017

Course outcomes: At the end of the course, the student will be able to
CO 1 Develop and deploy cloud application using popular cloud platforms,
CO 2 Design and develop highly scalable cloud-based applications by creating and
configuring virtual machines on the cloud and building private cloud.
CO 3 Explain and identify the techniques of big data analysis in the cloud.
CO 4 Identify the technological drivers of the cloud computing paradigm.
CO 5 Identify the security issues in cloud computing.
CO 6 Develop cloud services using popular cloud platforms.

Assessment Method
Assessment Tool Weekly tests Monthly tests End Semester Test Total
Weightage (%) 10% 30% 60% 100%
****************************************************************************

Course
Course Code Course Name L-T-P Credits
Category
23CS4127 Internet of Things PEC 3-0-0 3

Course Learning Objectives:

1. Familiarity with the essential protocols of IoT and their operations
2. Design and implementation of IoT networks
3. Identifying various design parameters for developing IoT applications

Course Content:

Unit I (8 Contact Hours)

Introduction: Definition and functional requirements, History of IoT, Architecture, Major
components of IOT devices, Enabling technologies of IoT, Four pillars of IoT, DNA of IoT,
Overview of wireless communication technologies, Internet and Web 3.0 View of IoT, Ubiquitous
IoT applications, Toolkit approach for End-user participation in IoT.

Unit II (8 Contact Hours)

Programming the Microcontroller for IoT: Basics of Sensors and actuators, Examples and working
principles of sensors and actuators, Arduino/Equivalent microcontroller platform, Setting up the
board, Programming for IoT; Reading from Sensors Communication: Connecting microcontroller
with mobile devices, Communication through bluetooth and USB, Connection with the internet
using wi-fi/ethernet.

Unit III (8 Contact Hours)

IoT-Middleware and Protocols: Overview of middleware, Communication middleware for IoT,
LBS and surveillance middleware, IoT information security, Protocol standardization for IoT,
Efforts, M2M and WSN protocols, SCADA and RFID protocols, Issues with IoT standardization,
Unified data standards, Protocols, IEEE 802.15.4, BACNet protocol, Modbus, Zigbee, Zwave,
Network layer, APS layer, Security.

Unit IV (7 Contact Hours)

Web of Things:WoTvs. IoT, Two pillars of the Web, Architecture Standardization for WoT, Platform
middleware for WoT, Unified Multitier WoT architecture, WoT portals and business intelligence.

Unit V (7 Contact Hours)

Cloud of Things: Grid/SOA and cloud computing, Cloud middleware, Cloud standards, Cloud
providers and systems, IoT and cloud computing, Set up cloud environment - Send data from
microcontroller to cloud, Mobile cloud computing, Cloud of things architecture.
Unit VI (7 Contact Hours)
IoT Physical Servers and Cloud Offerings: Introduction to Cloud Storage models and
communication APIs, Webserver – Web server for IoT, Cloud for IoT, Python web application
framework, Designing a RESTful web API.

Learning Resources:
Text Book:
1. Honbo Zhou, “The Internet of Things in the Cloud: A Middleware Perspective”, CRC Press,
2012.

Reference Books:
1. Hakima Chaouchi, “The Internet of Things, Connecting objects to the web”, ISTE & Wiley
Publications, 2010.
2. Dieter Uckelmann, Mark Harrison, Florian Michahelles, “Architecting the Internet of
Things”, Springer Science & Business Media, 2011.
3. Charalampos Doukas, “Building Internet of Things with the Arduino”, Create space, 2002.
4. Jan Holler, Vlasios Tsiatsis, Catherine Mulligan, Stefan Aves and, Stamatis Karnouskos,
David Boyle, “From Machine-to-Machine to the Internet of Things: Introduction to a New Age of
Intelligence”, 1st Edition, Academic Press, 2014.

Course outcomes:
1. Understand the concepts of Internet of Things.
2. Analyze basic protocols in wireless sensor networks.
3. Design IoT applications in different domains and be able to analyze their performance.
4. Implement basic IoT applications on embedded platforms.

Assessment Method
Assessment Tool Weekly tests Monthly tests End Semester Test Total
Weightage (%) 10% 30% 60% 100%
****************************************************************************

Course
Course Code Course Name L-T-P Credits
Category
Natural Language
23CS4128 PEC 3-0-0 3
Processing

Course Learning Objectives:

1.To provide the student with knowledge of various levels of analysis involved in NLP.
2.To understand language modeling.
3.To gain knowledge in automated natural language generation and machine translation.
4.To familiarize the concepts and techniques of Natural language Processing for analyzing words
based on Morphology.

Course Content:

Unit I: (8 Contact Hours)

Origins and challenges of NLP-Language and Grammar-Processing Indian Languages-NLP
Applications-Information Retrieval. Introduction-Various Grammar-based Language Models-
Statistical Language Model, N-Grams.

Unit II: (8 Contact Hours)

Introduction- Regular Expressions-Finite-State Automata-Morphological Parsing-Spelling Error

Detection and correction-Words and Word classes-Part-of Speech Tagging. Introduction-Context-
free Grammar-Constituency Parsing-Probabilistic Parsing

Unit III (7 Contact Hours)

Introduction- Meaning Representation-Lexical Semantics Ambiguity-Word Sense Disambiguation.

Introduction- cohesion-Reference ResolutionDiscourse Coherence and Structure.

Unit IV (8 Contact Hours)

Introduction-Architecture of NLG Systems, Generation Tasks and Representations-Application of

NLG. Introduction-Problems in Machine Translation Characteristics of Indian Languages- Machine
Translation Approaches-Translation involving Indian Languages

Unit V (7 Contact Hours)

Introduction-Design features of Information Retrieval Systems-Classical, Non-classical, Alternative

Models of Information Retrieval - Evaluation

Unit VI (7 Contact Hours)

Introduction-WordNet-FrameNet-Stemmers-POS Tagger Research Corpora , HMM in POS

Tagging.

Learning Resources:

Text Books:

1. Tanveer Siddiqui, U.S. Tiwary, “Natural Language Processing and Information Retrieval”,
Oxford University Press, 2008.

Reference Books:

1. Daniel Jurafsky and James H Martin, ”Speech and Language Processing: An introduction to
Natural Language Processing, Computational Linguistics and Speech Recognition”, Prentice Hall,
2nd Edition, 2008.
2. James Allen, Bejamin/cummings, “Natural Language Understanding'', 2nd edition, 1995.

Course Outcomes: At the end of the course, the student will be able to
1. Extract information from text automatically using concepts and methods from natural
language processing (NLP) including stemming, n-grams, POS tagging, and parsing.
2. Develop speech-based applications that use speech analysis (phonetics, speech recognition,
and synthesis).
3. Analyze the syntax, semantics, and pragmatics of a statement written in a natural language.
4. Develop a conversational agent that uses natural language understanding and generation.
5. Apply machine learning algorithms to natural language processing.
6. Evaluate the performance of NLP tools and systems.

Assessment Method
Assessment Tool Weekly tests Monthly tests End Semester Test Total
Weightage (%) 10% 30% 60% 100%
******************************************************************************

Course
Course Code Course Name L-T-P Credits
Category
23CS4129 Computer Vision PEC 3-0-0 3
Course Learning Objectives:
1. To review image processing techniques for computer vision
2. To understand Image Homographies
3. To understand Scale Invariant Feature Transform and its applications
4. To understand Camera Model (Intrinsic and Extrinsic Parameters) and Epipolar geometry
5. To understand motion analysis
6. To study some applications of computer vision algorithms.

Course Content:
Unit- I: (5 Contact Hours)
Introduction to Computer vision, Review of Linear Algebra, Review of Probability, Introduction to
OPENCV/Matlab.

Unit- II: (6 Contact Hours)

Basic relations b/w pixels, Linear filters, Convolutions and correlation, Finite difference filters,
Smoothing filters, box filter, Guassian image noise model, Gaussian smoothing filter,Gradients and
Edge detection,canny edge detector, Smoothing and differentiation, Prewitt filter, sobel filter,
Derivative of Gaussian filter, Types of edges: step, ramp, ridge. , canny edge detector.

Unit - III: (8 Contact Hours)

Harris corner detection, feature matching, Image mappings, Planar Hymnographies, Similarity
transformations, Affine transformations, warping images, SIFT, RANSAC, creating panoramas.

Unit - IV: (10 Contact Hours)

Correspondence problem, correspondence matching, Camera model, Pinhole camera model, camera
calibration, Augmented reality, Epipolar geometry, Epipoles, Epipolar lines, Conjugate Epipolar
lines, computing with cameras and 3D structures, Multiple view reconstruction, Stereo images,
recover depth from two images, geometry of simple stereo system, stereo disparity, Image
pyramids, Camera projection: (Extrinsics and Intrinsics parameters)

Unit - V: (8 Contact Hours)

Optical flow, Flow estimation, Brightness constancy equation, computing optic flow, Horn Shunck
and Lucas Kanade Algorithms, Pyramids, Video change detection, Background subtraction, frame
differencing, Adaptive Background subtraction, Presistant frame differencing, Appearance based
tracking, Video tracking : Mean-shift and Lucas-kanade tracking.

Unit -VI: (8 Contact Hours)

Image clustering and classification, k-means clustering, Hierarchical clustering, spectral clustering,
Image segmentation, Graph cuts, Segmentation using clusters, variational methods, Visual tracking,
Intro to Deep learning.

Learning resources
Text Books:
1. D. Forsyth and J. Ponce, “Computer Vision - A modern approach”, McGraw-Hill.
Reference Books:
1. Richard Szeliski ,“Computer Vision: Algorithms and Applications”
2. Fisher et al , “Dictionary of Computer Vision and Image Processing”
3. Simon J.D. Prince, “Computer Vision: Models, Learning, and Inference”

Web References:
1. University of Central Florida, Sept 2012, “Computer Vision”
https://www.youtube.com/watch?v=715uLCHt4jE&list=PLd3hlSJsX_Imk_BPmB_H3AQjFKZS9X
gZm
2. University of Pennsylvania, FALL 2007, “ Introduction to Computer Vision”,
a. http://www.cse.psu.edu/~rtc12/
3. Stanford University, Fall 2016-17, “ Computer Vision : Foundations and Applications”
4. http://vision.stanford.edu/teaching/cs131_fall1617/schedule.html

Course outcomes: At the end of the course, the student will be able to
identify basic concepts, terminology, theories, models and methods in the field
CO 1
of computer vision
describe basic methods of computer vision related to multi-scale
CO 2
representation, edge detection
CO 3 detection of other primitives, stereo, motion and object recognition,
CO 4 suggest a design of a computer vision system for a specific problem

Assessment Method
Assessment Tool Weekly tests Monthly tests End Semester Test Total
Weightage (%) 10% 30% 60% 100%
******************************************************************************

Course
Course Code Course Name L-T-P Credits
Category
23CS4130 Cyber Security PEC 3-0-0 3
Course Learning Objectives:
1. To discuss basics of Information Security, related terminologies and the legal aspects.
2. To list assets and discuss the policies, standard and business continuity in an organization.
3. To illustrate risk assessment and explain the need of authentication and authorization.
4. To discuss firewall, IDS and various networking tools.
5. To explain the vulnerabilities present in the system, web and mobile environment.
6. To discuss the importance of physical security and the ways to maintain information security
in any organization.

Course Content:
Unit - I (8 Contact Hours)
History of Information Security, Understanding security, CNSS security model, Security in SDLC,
Types of threats and attacks, Principles of Information Security, Laws and Ethics for Information
Security, Introduction to IT ACT, International Laws and Legal bodies.

Unit - II (8 Contact Hours)

Asset, Asset classification, Understanding the basics of Information Security Policy, Standards and
Practices, Types of Policies, Policy development process, ISO 27001, Business Continuity
Planning, Disaster Recovery, Maintaining Backups.

Unit - III (8 Contact Hours)

Identification, Assessment, Analysis, Control of Risk, Quantitative vs Qualitative Risk
Management, FAIR approach to risk assessment, NIST Risk management framework,
Authentication vs Authorization, Types of authentication, Understanding different types of Access
Controls(ACLs, RBAC, RUBAC etc.).

Unit - IV (8 Contact Hours)

Overview of Firewalls, VPNs, DMZs, IDS, IPS, Honeypots, Detection methods, various network
analysis tools.

Unit - V (8 Contact Hours)

OS security, OWASP Top 10 web application security vulnerabilities, Mobile Devices risks,
OWASP Top 10 mobile application security vulnerabilities.

Unit – VI (5 Contact Hours)

Physical Vulnerability Assessment, Securing Assets, Physical Intrusion Detection, Procedures and
Methods to maintain the implemented information Security.

Learning resources
Text book:
1. Whitman, Michael E., and Herbert J. Mattord, ‘Principles of Information Security’, Cengage
Learning India Private Limited, 5th edition
Reference Books:
1. Mark Rhodes and Ousley, ‘Information Security: The Complete Reference’, McGraw-Hill
Education; 2nd edition.
2. Stuart McClure , Joel Scambray and George Kurtz, ‘Hacking Exposed 7’, McGraw- Hill
Education; 7th edition.

Course outcomes: At the end of the course, the student will be able to
CO 1 Analyze any organization for information security loopholes.
CO 2 Create and implement information security policies for any organization.
CO 3 Create and maintain information asset register.
CO 4 Implement Information Security framework for an organization.
Identify the Information security risk, estimate its severity and recommend
CO 5
solutions.
CO 6 Test any application (system, web and mobile) for the technical risks.

Assessment Method
Assessment Tool Weekly tests Monthly tests End Semester Test Total
Weightage (%) 10% 30% 60% 100%
******************************************************************************

ENGINEERING FOURTH YEAR: SEMESTER-II

**********************************************************
List of Professional Elective Courses (PEC)
Elective - VI Pool
**********************************************

Course
Course Code Course Name L-T-P Credits
Category
Human Computer
23CS4221 PEC 3-0-0 3
Interaction

Course Objective:
1. The Main Objective is the student to think constructively and analytically about how to
design and evaluate interactive technologies.
2. Students can clearly understand the importance of the user interface design.
3. It gives an introduction to the key areas, approaches and developments in the field.
4. Basically, the course will introduce them to key areas, theoretical frameworks, approaches
and major developments in HCI.
5. The main objective is to get students to think constructively and analytically about how to design and
evaluate interactive technologies.

Course Content:

UNIT-I: Introduction and Graphical User Interface (9 Contact Hours )

Importance of user Interface – definition, importance of good design. Benefits of good design. A
brief history of Screen design.

The graphical user interface – popularity of graphics, the concept of direct manipulation,
graphical system, Characteristics, Web user – Interface popularity, characteristics- Principles of user
interface.

UNIT-II: Design Process (7 Contact Hours )

Human interaction with computers, importance of human characteristics human consideration,
Human interaction speeds, understanding business junctions.

UNIT-III: Screen Designing (9 Contact Hours )

Design goals – Screen planning and purpose, organizing screen elements, ordering of screen data
and content – screen navigation and flow – Visually pleasing composition – amount of information
– focus and emphasis – presentation information simply and meaningfully – information retrieval
on web – statistical graphics – Technological consideration in interface design.

UNIT-IV: Windows ( 7 Contact Hours )

New and Navigation schemes selection of window, selection of devices based and screen
based controls.

UNIT-V: Components (7 Contact Hours )

Text and messages, Icons and increases – Multimedia, colors, uses problems, choosing colors.
UNIT-VI: Software Tools and Interaction Devices (7 Contact Hours )
Specification methods, interface – Building Tools; Keyboard and function keys – pointing devices –
speech recognition digitization and generation – image and video displays – drivers.

Learning Resources:
Text Books:
1. Wilbert O Galitz,”The essential guide to user interface design”, Wiley DreamaTech.
2. Ben Shneidermann ,”Designing the user interface”, Pearson Education Asia 3rd Edition,.
References:
1. Alan Dix, Janet Fincay, Gre Goryd, Abowd, Russell Bealg “Human – Computer
Interaction”, Pearson, Third Edition.
2. Prece, Rogers, Sharps ,“Interaction Design” ,Wiley Dreamtech , Third Edition.
3. Soren Lauesen ,“User Interface Design”,Pearson Education.

Web resources:
1. Dr. Samit Bhattacharya , Dept. of Computer Science and Engineering, IIT Guwahati URL:
http://nptel.ac.in/courses/106103115
Course outcomes: At the end of the course, the student will be able to
Explain the capabilities of the both humans and computers from the view point
CO 1
of human Information processing
Describe typical human-computer Interaction (HCI) models styles and various
CO 2
historic HCI paradigms.
Apply an interactive design process and universal design principles to
CO 3
designing HCI system.
CO 4 Describe and use HCI design principles, standards and guidelines.
Analyze and identify user models ,user support ,socio-organizational issues,
CO 5
and stakeholder requirements of HCI system.
Design tasks and dialogs of relevant HCI system based on task analysis and
CO 6
dialog design.

Assessment Method
Assessment Tool Weekly tests Monthly tests End Semester Test Total
Weightage (%) 10% 30% 60% 100%
******************************************************************************

Course
Course Code Course Name L-T-P Credits
Category
23CS4222 Bioinformatics PEC 3-0-0 3

Course Objectives:
1. Adapt basic knowledge on various techniques and areas of applications in bioinformatics.
2. Analyze common problems in bioinformatics, alignment techniques, ethical issues, public data
sources, and evolutionary modelling.
3. Discover the practical use of tools for specific bioinformatic areas.

UNIT:1 Introduction to bioinformatics (7 Contact Hours)

Scope and applications of bioinformatics, Alignment of pairs of sequences; Introduction- Definition
of sequence alignment, Methods ‐ Dot matrix sequence comparison.

UNIT:II Pairwise sequence alignment (8 Contact Hours)

Dynamic programming algorithm for sequence alignment – Global Alignment: NeedlemanWunsch,
Local Alignment: Smith-Waterman, Gap penalty, Assessing the significance of an alignment.

UNIT:III Multiple sequence alignment (8 Contact Hours)

Dynamic programming, progressive methods, Iterative methods, MSA using CLUSTAL W,PILEUP
and CLUSTAL X, purpose and applications of multiple sequence alignment.

UNIT:IV Scoring matrices (7 Contact Hours)

Similarity searches ‐ PAM and BlOSUM matrix, Dayhoff mutation matrix, construction of PAM
and BLOSUM matrix. Differences between PAM & BLOSUM.

UNIT:V Database search methods (8 Contact Hours)

Sequence similarity search, FASTA sequence database similarity search, BLAST sequence database
similarity search, other methods of comparing database sequences and patterns.

UNIT:VI Neural Networks (7 Contact Hours)

Introduction – Priors & likelihoods ‐ Learning algorithms: back propagation ‐ NeuralNetworks:
Applications ‐ Sequence encoding & output interpretation‐ Sequence correlations & neural
networks.

Text Books
1. Bioinformatics: Sequence and Genome Analysis David W.Mount, David Mount
2. Bioinformatics: the Machine Learning Approach – Pierre Baldi and Søren Brunak Publisher: MIT
Press.

Reference Books
1. Hooman H Rashidi, Lukas K Buehler. Bioinformatics Basics ‐2000.
2. Per Jambeck, Cynthia Gibas. Developing BioinformaticsComputer Skills. Computers –
2001.
3. Bioinformatics Methods and Protocols: Methods and Protocols. edited by Stephen Misener,
Stephen A Krawetz ‐ Science – 1999.

Course Outcomes:
1. Apply knowledge of bioinformatics in a practical project.
2. Develop the ability for critical assessment of scientific research publications in bioinformatics.
3. Build an understanding of the research process in general, such as research methods, scientific
writing, and research ethics.
4. Evaluate the main databases at the NCBI and EBI resources
5. Compare the databases, tools, repositories and be able to use each one to extract specific
information
6. Demonstrate the selected tools at NCBI and EBI to run simple analyses on genomic sequences.

Assessment Method
Assessment Weekly tests Monthly tests End Semester Test Total
Tool
Weightage (%) 10% 30% 60% 100%

Course
Course Code Course Name L-T-P Credits
Category
Applied Graph
23CS4223 PEC 3-0-0 3
Theory

Course Objectives

1. To understand and apply the fundamental concepts in graph theory

2. To apply graph theory based tools in solving practical problems
3. Use definitions in graph theory to identify and construct examples and to distinguish
examples from non-example.
4. Reason from definitions to construct mathematical proofs
5. Apply theories and concepts to test and validate intuition and independent mathematical
thinking in problem solving.
6. Analyze new networks using the main concepts of graph theory

Unit I:

Introduction (8 Contact Hours)

Discovery of graphs, Definitions, Subgraphs, Isomorphic graphs, Matrix representations of graphs,

Degree of a vertex, Directed walks, paths and cycles, Connectivity in digraphs, Eulerian digraphs,
Hamilton digraphs, Special graphs, Complements, Union, Sum, Cartesian Product, Composition,
Graphic sequences, Graph theoretic model of the LAN problem, Havel-Hakimi criterion,
Realization of a graphic sequence.

Unit II:

Connected graphs and shortest paths (7 Contact Hours)

Walks, trails, paths, cycles, Connected graphs, Distance, Cut-vertices and cut-edges, Blocks,
Connectivity, Weighted graphs and shortest paths, Weighted graphs, Dijkstra‟s shortest path
algorithm, Floyd-Warshall shortest path algorithm.

Unit III:

Matrices, Colouring and Directed Graph (8 Contact Hours)

Chromatic number – Chromatic partitioning – Chromatic polynomial – Matching – Covering – Four

color problem – Directed graphs – Types of directed graphs – Digraphs and binary relations –
Directed paths and connectedness – Euler graphs.

Unit IV:
Graph Management (7 Contact Hours)

Graph Data Management, Indexes, Graph Partitioning, Query Processing, Enumeration of

Subgraphs.

Unit V:

Permutations and Combinations (8 Contact Hours)

Fundamental principles of counting – Permutations and combinations – Binomial theorem –

combinations with repetition – Combinatorial numbers – Principle of inclusion and exclusion –
Derangement – Arrangements with forbidden positions.

Unit VI:

Social network Analysis (7 Contact Hours)

Social Network as Graphs, Topology Identification in Social Networks, Community Detection in

Social Network.

Learning Resources:
Text Books:
1. Narsingh Deo, “Graph Theory: With Application to Engineering and Computer Science”,
Prentice Hall of India, 2003.
2. Grimaldi R.P. “Discrete and Combinatorial Mathematics: An Applied Introduction”,
Addison Wesley, 1994.
Reference Books:
1. J. A. Bondy and U. S. R. Murty. Graph Theory, volume 244 of Graduate Texts in
Mathematics. Springer, 1st edition, 2008.
2. J. A. Bondy and U. S. R. Murty. Graph Theory with Applications.
3. Schaum's Outlines Graph Theory, Balakrishnan, TMH
Web Resources:
1. Lecture Videos: http://nptel.ac.in/courses/111106050/13
2. Introduction to Graph Theory, Douglas B. West, Pearson

Course outcomes: At the end of the course, the student will be able to
CO 1 Know some important classes of graph theoretic problems

Be able to formulate and prove central theorems about trees, matching,

CO 2
connectivity, colouring and planar graphs;
CO 3 Be able to describe and apply some basic algorithms for graphs;
CO 4 Be able to use graph theory as a modelling tool.
Use a combination of theoretical knowledge and independent mathematical
CO 5
thinking in creative investigation of questions in graph theory
Use mathematical definitions to identify and construct graphs for social network
CO 6
applications.

Assessment Method
Assessment Tool Weekly tests Monthly tests End Semester Test Total
Weightage (%) 10% 30% 60% 100%

*************************************************************************

Course
Course Code Course Name L-T-P Credits
Category
23CS4224 Software Reliability PEC 3-0-0 3

Course Objectives:

1. To learn about the engineering techniques for developing and maintaining reliable software
systems.
2. To measure the reliability of software systems.
3. To understand fault prevention, fault removal, fault tolerance and failure forecasting in
software systems.
4. To learn different time dependent and time independent software reliability models and
design reliability models for software systems.

Unit I: (8 Contact Hours)

Basic Ideas of Software Reliability, Hardware reliability vs. Software reliability, Reliability metrics,
Failure and Faults – Prevention, Removal, Tolerance, Forecast, Dependability Concept – Failure
Behaviour, Characteristics, Maintenance Policy.

Unit II: (8 Contact Hours)

Reliability and Availability Modeling, Reliability Evaluation Testing methods, Limits, Starvation,
Coverage, Filtering, Microscopic Model of Software Risk.[10 Hours]

Unit III: (8 Contact Hours)

Computation of software reliability, Functional and Operational Profile, Operational Profiles –

Difficulties, Customer Type, User Type, System Mode, Test Selection - Selecting Operations,
Regression Test.

Unit IV: (7 Contact Hours)

Classes of software reliability Models, Time Dependent Software Reliability Models: Time between
failure reliability Models, Fault Counting Reliability Models.

Unit IV: (9 Contact Hours)

Independent Software Reliability Models: Fault injection model of Software Reliability, Input
Domain Reliability Model, Orthogonal defect classification, Software availability Models. Software
Reliability Modeling: A general procedure for reliability modeling.

Unit V: (7 Contact Hours)

Short and Long Term Prediction, Model Accuracy, Analysing Predictive Accuracy – Outcomes
Unit VI: (7 Contact Hours)

Recalibration – Detecting Bias, Different Techniques, Power of Recalibration, Limitations in

Present Techniques, Improvements

Learning Resources:

Text Books:

1. J.D. Musa, Software Reliability Engineering, McGraw Hill, New York , 2004
2. H. Pham, Software Reliability, Springer Verlag, New York , 2000
3. Hoang Pham, System Software Reliability, (Springer Series in Reliability Engineering)
Reference Books:
1. Patric D. T.O Connor, Practical Reliability Engineering, 4th Edition, John Wesley & Sons ,
2003
2. D. Reled, Software Reliability Methods, Springer Verlag, New York , 2001

Course Outcomes: At the end of the course, the student will be able to
CO 1 Develop reliable software systems

Understand the fault handling and failure forecasting techniques in software

CO 2
systems.
Understand different time dependent and time independent software reliability
CO 3
models.
CO 4 Design reliability models for software systems.
Apply methods and techniques to analyze requirements and design software
CO 5
artifacts to assess and model software reliability

Assessment Method
Assessment Tool Weekly tests Monthly tests End Semester Test Total
Weightage (%) 10% 30% 60% 100%

*************************************************************************

Course
Course Code Course Name L-T-P Credits
Category
Information
23CS4225 PEC 3-0-0 3
Security

Content:
Unit-1: (5 Contact Hours)
Introduction: Security mindset, Computer Security Concepts (CIA), Threats, Attacks, and Assets.
Unit-2: (5 Contact Hours)
Software Security: Vulnerabilities and protections, malware, program analysis.
Unit-3: (8 Contact Hours)
Practical Cryptography: Encryption, authentication, hashing, symmetric and asymmetric
cryptography, Digital Signatures and Certificates.
Unit-4: (10 Contact Hours)
Network Security: Network security issues, Sniffing, IP spoofing, Common threats, E-Mail
security, IPSec, SSL, PGP, Intruders, Virus, Worms, Firewalls-need and features of firewall, Types
of firewall, Intruder Detection Systems.
Unit-5: (8 Contact Hours)
Cyber Security: Cyber Crime and security, Security tools, Introduction to Digital Forensic, OS
fingerprinting, TCP/IP stack masking, Social Engineering.
Unit-6: (6 Contact Hours)
Applications and special topics: Web application Security, Privacy and Anonymity, public policy

Text Book:
1. Computer Security: Principles and Practice, William Stallings; Lawrie Brown
References:
1. Introduction to Computer Security, 2004 Matt Bishop, Addison-Wesley, ISBN 0-321-24744-
2. Buchmann J. A., Introduction to Cryptography, Springer Verlag (2001).
3. Stallings William, Cryptography and Network Security, Pearson Education (2006).
4. Schneier Bruce, Applied Cryptography, John Wiley and Sons (1996).
5. Britz M., Computer Forensic and cyber crime, Upper Saddle River, Prentice Hall (2003).
Course Outcomes:
1. Evaluate vulnerability of an information system and establish a plan for risk management.
2. Demonstrate basic principles of Web application security
3. Evaluate the authentication and encryption needs of an information system.
4. Demonstrate how to secure a network
5. Evaluate a company’s security policies and procedures

Course
Course Code Course Name L-T-P Credits
Category
23CS4226 Soft Computing PEC 3-0-0 3

Course Objectives:
1.To introduce soft computing concepts and techniques and foster their abilities in designing
appropriate techniques for real-world problems.
2.To provide adequate knowledge of non-traditional technologies and fundamentals of artificial
neural networks, back propagation networks, fuzzy sets, fuzzy logic, genetic algorithms in solving
social and engineering problems.
3.To provide comprehensive knowledge of associative memory networks and adaptive resonance
theory

Unit I: Soft Computing (7 Contact Hours)

Introduction of soft computing, soft computing vs. hard computing, various types of soft computing
techniques, applications of soft computing.
Unit II: Feed-Forward Neural Networks (8 Contact Hours)

Structure and Function of a single neuron: Biological neuron, artificial neuron, definition of ANN,
Taxonomy of neural net, Difference between ANN and human brain, characteristics and
applications of ANN, single layer network, Perceptron training algorithm.

Unit III: Fuzzy Logic (8 Contact Hours)

Fuzzy set theory, Fuzzy set versus crisp set, Crisp relation & fuzzy relations, Fuzzy systems: crisp
logic, fuzzy logic, introduction & features of membership functions, Fuzzy rule base system : fuzzy
propositions, formation, decomposition & aggregation of fuzzy rules, fuzzy reasoning, fuzzy
inference systems, fuzzy decision making & Applications of fuzzy logic.

Unit IV: Genetic algorithms (8 Contact Hours)

Fundamentals, basic concepts, working principle, encoding, fitness function, reproduction, Genetic
modeling: Inheritance operator, cross over, inversion & deletion, mutation operator, Bitwise
operator, Generational Cycle, Convergence of GA, Differences similarities between GA.

Unit V: Neuro-Fuzzy Modeling (7 Contact Hours)

Adaptive Neuro-Fuzzy Inference System (ANFIS): Architecture and Learning, Neuron Function for
Adaptive Networks, Neuro-Fuzzy Spectrum, Neuro-Fuzzy Control.

Unit VI: Rough Sets (7 Contact Hours)

Introduction, Upper and Lower Approximation, Boundary Region, Decision Tables and Decisions
Tables, Properties of Rough Sets, Rough Set Model based Tolerance Relations

Learning Resources:
Text Books:

1.Soft Computing and Intelligent Systems Design, Theory, Tools and Applications by Fakhreddine.
2.2) Soft Computing Techniques in Engineering Applications by by Srikanta Patnaik Baojiang
Zhong Published by Paperback

Reference Books:

3.Soft Computing Book By Chaturvedi, Devendra K Springer Publications

4.Soft Computing and its Applications Vol 1 & 2 by Kumar S. Roy published by Apple Academic
Press

Course outcomes: At the end of the course, the student will be able to
Apply neural networks, bidirectional associative memories and adaptive resonance
CO 1
theory for solving different engineering problems
Identify and describe soft computing techniques and build supervised learning and
CO 2
unsupervised learning networks.
CO 3 Apply fuzzy logic and reasoning to handle uncertainty and solve various
engineering problems.
CO 4 Apply genetic algorithms to combinatorial optimization problems.
Evaluate and compare solutions by various soft computing approaches for a given
CO 5
problem

Assessment Method
Assessment Weekly tests Monthly tests End Semester Test Total
Tool
Weightage (%) 10% 30% 60% 100%
******************************************************************************

Course
Course Code Course Name L-T-P Credits
Category
23CS4227 Robotics PEC 3-0-0 3
Course Learning Objectives:
students should be able to
1. To simulate the robot functions and joint movements.
2. Graphic animation sequences for robot movement.
3. Velocity, acceleration analysis of joints and linkages.
4. The basics and the latest technology of sensors used in robotics.
5. The different sensing variables
6. Robot vision system

Course Content:
UNIT I (Introduction to Robotics) (7 Contact Hours)
What is robot and robotics, already designed robots, Manual and Autonomous robots, Different
types of industrial ARM robots, and arm design, Coordinate transformations for more motor
moments, Electrical connections of different boards and modules: How to connect closed circuit,
digital and analog pins connections.
UNIT II (Robotic Principles) (7 Contact Hours)
Robotic functions Geometrical commands, Edit commands. Selecting robot views, standard Robot
part, using the parts in a simulation.
UNIT III (Robotic Motion ) (7 Contact Hours)
Types of motion, velocity and acceleration, Types of simulation motion Harmonic motion,
parabolic motion, uniform motion velocity and acceleration analysis for robots.
UNIT IV (Actuators and sensors) (7 Contact Hours)
Introduction to Arduino, Actuators, Sensors, Wired and wireless communication, I/O
communication through USB cable, Bluetooth HC05, RF modules, DTMF module, Xbee modules.
UNIT V (Robotics Simulation) (8 Contact Hours) Simulation
packages, Loading the simulation, Simulation editors, delay, Resume commands. Slide commands,
program flow control. Robot motion control, Analysis of robot elements, Robotic linkages.
UNIT VI (Basic robots and Raspberry pi) (10 Contact Hours)
Line follower: Line follower robot design and control with Arduino board, Obstacles avoider:
Obstacle avoider robot with IR sensors and Arduino board, Mobile controller: Mobile controller
robot with DTMF module and HC05 module. Introduction to Raspberry pi: What is raspberry and
differences between Arduino and raspberry pi, Applications of robotics.

Learning resources:
Text book:
1. Robotics for engineers by Yoram Koren
2. John J. Craig - Introduction to Robotics: Mechanics and Control, Pearson, Upper Saddle
River, NJ, 2005.
3. Marco Schwartz - Internet of Things with Arduino Cookbook.
4. P.A. Janaki Raman, Robotics and Image Processing an Introduction, Tata Mc Graw Hill
Publishing company Ltd., 1995.
5. Richard D. Klafter, Thomas .A, Chri Elewski, Michael Negin, Robotics Engineering an
Integrated Approach, Phi Learning., 2009.
6. Mikell P Groover & Nicholas G Odrey, Mitchel Weiss, Roger N Nagel, Ashish Dutta,
Industrial Robotics, Technology programming and Applications, Tata McGraw-Hill Education,
2011.
Reference Books:
1. Myke Predko, “Programming Robot Controllers” – McGrawHill, 1st edition, 2003.
2. Murphy Robin R,” Introduction to AI Robotics”, MIT Press, 2000.
3. Siegwart R and Nourbakhsh I.R, “Introduction to Autonomous mobile Robots”, Prentice Hall
India, 2005.

Web resources:
https://ieeexplore.ieee.org/document/833572/ by K Taylor - 2000
https://www.iste.org/explore/articleDetail?articleid=846&category=In-the.Nov 1, 2016
www.ieee-ras.org/...resources.../educational-material-in-robotics-and-automation2015 - SyRoTek -
System for robotic e-learning
Course outcomes: At the end of the course, the student will be able to

knowledge of programming and algorithms, as well as systems development

CO 1
techniques
knowledge of digital technology that forms the basis for designing computers
CO 2
and embedded systems.
knowledge about electronics and sensors that form the basis for machine
CO 3
launching.
CO 4 knowledge of mathematics required for electronics, programming and robotics.
CO 5 knowledge about the management and analysis of robotics systems.
knowledge of how machines can interpret surroundings, act intelligently
CO 6
and adapt.

Assessment Method
Assessment Weekly tests Monthly tests End Semester Test Total
Tool
Weightage (%) 10% 30% 60% 100%

Course
Course Code Course Name L-T-P Credits
Category
Digital Speech
23CS4228 PEC 3-0-0 3
Processing
Course Learning Objectives:

Unit I: (8 Contact Hours)

Mechanics of speech: Speech production: Mechanism of speech production, Acoustic
phonetics, The Acoustic Theory of Speech Production: Uniform lossless tube, Effects of
losses in the vocal tract, Digital models for speech signals: Vocal tract, Radiation,
Excitation, Auditory perception: psycho acoustics. Representations of speech waveform:
Sampling of speech signals, Quantization.

Unit II: (8 Contact Hours)

Time and frequency domain methods for speech processing: Time domain parameters of
Speech signal: Short-Time Energy, Average Magnitude, Average Zero crossing Rate,
Silence Discrimination using ZCR and energy, Short Time Autocorrelation Function, Pitch
period estimation using Autocorrelation Function.

Unit III: (7 Contact Hours)

Short Time Fourier analysis: Fourier transform and linear filtering interpretations, Sampling
rates in time and frequency, Pitch detection, Analysis by Synthesis, Analysis synthesis
systems: Phase vocoder, Channel Vocoder, Median Smoothing, Spectrographic displays.

Unit IV: (8 Contact Hours)

Linear predictive analysis of speech: Basic Principles of linear predictive analysis: Auto
correlation method, Covariance method, Solution of LPC equations: Cholesky method,
Durbin’s Recursive algorithm, Application of LPC parameters: Pitch detection using LPC
parameters, Formant analysis using LPC parameters, VELP. Relations Between the Various
Speech Parameters, CELP.

Unit V: (7 Contact Hours)

Application of speech processing: Voice response systems: General considerations in the
design of voice response systems, A multiple output digital voice response system, Speaker
recognition systems: Speaker verification system, Speaker identification system.

Unit VI: (7 Contact Hours)

Speech recognition systems: Isolated digit recognition system, Continuous digit
recognition system. Typical applications of computer voice response systems: Wiring
communication equipment, Information retrieval systems

Learning Materials:
Textbooks:
1. L.R.Rabinerand, R.W.Schaffer, Digital Processing of Speech signals, Prentice Hall, 2004.
2. Ben Gold and Nelson Morgan, Speech and Audio Signal Processing, John Wiley and Sons
Inc., Singapore, 2004.

Reference Books:
1. Quatieri, Discrete-time Speech Signal Processing, PrenticeHall,2001
2. L.R. Rabiner and B. H. Juang, Fundamentals of speech recognition, Prentice Hall, 1999.

Course Outcomes:
At the end of this course the student will be able to:
1. Summarize the mechanism of human speech production and articulation
2. Identify the time domain speech signal parameters
3. Differentiate time and frequency domain methods of speech processing
4. Attribute linear predictive analysis for speech signals
5. Explain the solutions for LPC equations
6. Implement the different algorithms and models involved for speaker and speech recognition
systems

Assessment Method
Assessment Weekly tests Monthly tests End Semester Test Total
Tool
Weightage (%) 10% 30% 60% 100%
******************************************************************************

Course
Course Code Course Name L-T-P Credits
Category
23CS4229 Social Networks PEC 3-0-0 3

Course Objectives:
1.To understand the concept of semantic web and related applications.
2.To learn knowledge representation using ontology.
3.To understand human behaviour in social web and related communities.
4.To learn visualization of social networks.
5.Formalize different types of entities and relationships as nodes and edges and represent this
information as relational data.

Unit I: (8 Contact Hours)

Social Network analysis: Development of Social Network Analysis - Key concepts and measures in
network analysis - Electronic sources for network analysis: Electronic discussion networks, Blogs
and online communities - Web-based networks - Applications of Social Network Analysis.

Unit II: (7 Contact Hours)

Random graph models: Random graphs and alternative models, Models of network growth,
Navigation in social Networks, Cohesive subgroups, Multidimensional Scaling, Structural
equivalence, roles and positions.

Unit III: (8 Contact Hours)

Extracting evolution of Web Community from a Series of Web Archive - Detecting communities in
social networks - Definition of community - Evaluating communities - Methods for community
detection and mining - Applications of community mining algorithms - Tools for detecting
communities social network infrastructures and communities.

Unit IV: (7 Contact Hours)

Understanding and predicting human behaviour for social communities - User data management -
Inference and Distribution - Enabling new human experiences - Reality mining - Context -
Awareness.

Unit V: (8 Contact Hours)

Privacy in online social networks - Trust in online environment - Trust models based on subjective
logic - Trust network analysis - Trust transitivity analysis - Combining trust and reputation - Trust
derivation based on trust comparisons - Attack spectrum and countermeasures.

Unit VI: (7 Contact Hours)

Visualizing online social networks, Visualizing social networks with matrix-based representations -
Matrix and Node-Link Diagrams - Hybrid representations - Applications - Cover networks -
Collaboration networks - Co-Citation networks.

Learning Resources:
Text Books:

1.Peter Mika, ―Social Networks and the Semantic Web‖, First Edition, Springer 2007.
2.Borko Furht, ―Handbook of Social Network Technologies and Applications‖, 1st Edition,
Springer, 2010.
Reference Books:
1.Guandong Xu ,Yanchun Zhang and Lin Li, ―Web Mining and Social Networking – Techniques
and applications‖, First Edition, Springer, 2011.
2.Dion Goh and Schubert Foo, ―Social information Retrieval Systems: Emerging Technologies
and Applications for Searching the Web Effectively‖, IGI Global Snippet, 2008.
Course Outcomes:
At the end of this course the student will be able to:
1. Know basic notation and terminology used in network science.
2. Visualize, summarize and compare networks.
3. Illustrate basic principles behind network analysis algorithms.
4. Develop practical skills of network analysis.
5. Be capable of analyzing real work networks

Assessment Method
Assessment Weekly tests Monthly tests End Semester Test Total
Tool
Weightage (%) 10% 30% 60% 100%
******************************************************************************

List of Open Elective Courses (OEC)

***************************************

Course
Course Code Course Name L-T-P Credits
Category
Data Science with
23CSXX41 OEC 3-0-0 3
Python

Unit – I : Python Basics for Data Science (7 Contact Hours)

Introduction to Python, Types, Expressions & Variables, String Operations, Lists & Tuples, Sets,
Dictionaries, Conditions & Branching, Loops, Functions, Objects & Classes
Unit – II: Working with Data in Python (7 Contact Hours)
File Operations, Regular Expressions, Pandas, NumPys, Web Scraping
Unit – III: Data Processing (7 Contact Hours)
Importing DataSets; Cleaning & Preparing Data – Handling Missing Values, Data Formatting,
Binning;Summarizing the Data Frame – Descriptive Statistics, Grouping, ANOVA, Correlation
Unit – IV: Data Analysis (8 Contact Hours)
Model Development : Simple & Multiple Linear Regression, Model Evaluation using Visualization,
Polynomial Regression; Model Evaluation – Overfitting, Underfitting, Model Selection, Ridge
Regression, Model Refinement
Unit – V: Data Visualization (9 Contact Hours)
Introduction to Visualization Tools – Matplotlib, Line Plots, Area Plots, Histograms, Bar Charts, Pie
Charts, Box Plots, Scatter Plots, Bubble Plots; Advance Visualization Tools – Waffle Charts, Word
Clouds, Seaborn and Regression Plots; Creating Maps & Visualizing Geospatial Data – Folium,
Maps with Markers, Choropleth Maps
Unit – VI: Machine Learning using Python (7 Contact Hours)
Introduction to Machine Learning – Supervised vs Unsupervised Learning, Python Libraries for
Machine Learning; Regression; Classification; Unsupervised Learning; Recommender Systems

Learning Resources:
Text Book:
2. Jake VanderPlas, Python Data Science Handbook - Essential Tools for Working with Data,
o'reilly publications.
Online Course Reference:
2. https://www.edx.org/professional-certificate/python-data-science

Assessment Method
Assessment Weekly tests Monthly tests End Semester Test Total
Tool
Weightage (%) 10% 30% 60% 100%
******************************************************************************

Course
Course Code Course Name L-T-P Credits
Category
23CSXX42 Data Structures OEC 3-0-0 3
Course Learning Objectives:
1. To understand the basic concepts such as Abstract Data Types, Linear, and Non Linear Data
structures
2. To understand the behavior of data structures such as stacks, queues
3. To understand building of trees and its operations
4. To be familiar with searching and sorting algorithms
5. To choose the appropriate data structure for a specified application.
6. To study various graph processing algorithms and Algorithm Design technique

Learning Resources:
Text Books:
1. R. Thareja “Data Structures using C” , Oxford University Press.
2. M. A. Weiss “Data structures and Algorithm Analysis in C “ , 2nd edition, Pearson.
References
1. Narsimha Karumanchi “Data Structures and Algorithms made easy in C”, 2nd Edition,
Career Monk Publications.
2. Allen Weiss, “Data Structures and Algorithms Analysis in C”, Pearson, 2nd Edition
Web Resources:
1. Indian Institute of Technology, Madras , “Programming and Data Structures”, URL:
https://nptel.ac.in/courses/106106130/
2. Indian Institute of Technology, Delhi, ‘Data Structures and Algorithms’,
https://nptel.ac.in/courses/106102064/

Assessment Method
Assessment Weekly tests Monthly tests End Semester Test Total
Tool
Weightage (%) 10% 30% 60% 100%
******************************************************************************

Course
Course Code Course Name L-T-P Credits
Category
Object Oriented
23CSXX43 Programming OEC 3-0-0 3
Through Java

1. Gain knowledge about basic Java language syntax and semantics to write Java programs
and use concepts such as variables, conditional and iterative execution methods etc.
2. Understanding the fundamentals of object-oriented programming in Java, including
defining classes, objects, invoking methods etc. and exception handling mechanisms.
3. Understand the principles of inheritance, packages and interfaces.
4. Understand the principles of Multithreading and Event handling mechanisms.

Course Content:

Unit 1: (8 Contact Hours)

Introduction: Object Oriented Programming, Introduction to java and JVM, Key features,
Fundamentals of Objects and Classes, Access Specifiers, data types, dynamic initialization, scope
and life time, operators, Conditional Statements, control structures, arrays, type conversion and
casting. Constructors, usage of static, access control, this key word, garbage collection, overloading,
parameter passing mechanisms, nested classes and inner classes.

Unit II: (7 Contact Hours)

Unit III: (7 Contact Hours)

Inheritance:Types of Inheritance, usage of super key word, method overriding, final methods and
classes, abstract classes, Polymorphism: dynamic method dispatch, Static method dispatch.

Unit IV: (8 Contact Hours)

Unit V (7 Contact Hours)

Packages: Creating a Package, setting CLASSPATH, Access control protection, importing

packages. Multithreading : Concepts of Multithreading, differences between process and thread,
thread life cycle, Thread class, Runnable interface, creating multiple threads, Synchronization,
thread priorities, inter thread communication, daemon threads, deadlocks, thread groups.

Unit VI (8 Contact Hours)

Event Handling: Introduction to Event Handling, AWT Components, windows, Layout Managers,
Event handling model of AWT, Adapter classes, Menu, Menu bar. Swings: swings introduction,
JFrame, JPanel and JComponent, Icons and Labels, text fields, buttons – The JButton class, Check
boxes, Radio buttons. Combo boxes, Action Listeners. Introduction to JDBC.
Learning Resources
Text Books:
1. Herbert Schildt, “The Complete Reference Java”, TMH Publishing Company Ltd, 9th Edition.
2. Cay Horstmann, “Big Java”, John Wiley and Sons, 2nd Edition
Reference Books:
1. Allen B.Downey,“Think Java; How to Think Like a Computer Scientist”,Paper Back
1stEdition
2. David J. Eck, Hobart and William Smith Colleges, “Introduction to Programming Using
Java” Published by Paper Back .
3. H.M.Dietel and P.J.Dietel “Java How to Program”, Sixth Edition, Pearson Education/PHI

Web Resources:
1. http://www.nptelvideos.com/java/java_video_lectures_tutorials.php
2. https://www.tutorialspoint.com/java/
3. https://www.javatpoint.com/java-tutorial
4. http://mooc.fi/courses/2013/programming-part-1/material.html
5. http://math.hws.edu/javanotes

Assessment Method
Assessment Weekly tests Monthly tests End Semester Test Total
Tool
Weightage (%) 10% 30% 60% 100%
******************************************************************************

Course
Course Code Course Name L-T-P Credits
Category
23CSXX44 Web Technologies OEC 3-0-0 3

Course Learning Objectives:

1. To demonstrate basic skills in analysing the usability of a web site.
2. To identify how to plan user research related to web design.
3. To Learn how to design, add client side script and publish web page.
4. To Learn about server side programming and deploy the app into a server.
5. To Learn about storing the data into SQL and NoSQL.
6. To Learn about Front-End Web UI Frameworks and GIT repository Tools.
7. To learn the language of the Web: jQuery Frontend design and Bootstrap.
8. To learn the language of Web: NodeJS.

Course Content:
UNIT I (10 Contact Hours)
Introduction to Web World: Recap on HTML, inserting Frames and frame sets, inserting
hyperlinks, lists, tables and images.
JavaScript :Client side scripting with JavaScript, variables, functions, conditions, loops and
repetition, Pop up boxes, objects,HTML DOM and web, Browser environments, form validation,
Events and Event Listeners.

UNIT II (10 Contact Hours)

UNIT-III (10 Contact Hours)

Authentication: Google OAuth: Basic Steps. Access to Google APIs: For Server-side Web apps,
for Java Script Web apps, for Mobile & Desktop apps.

UNIT IV (10 Contact Hours)

Front-End Web UI Frameworks and Tools: Bootstrap, Full-Stack Web Development, Setting up
Git, Basic Git commands, Online Git Repositories, Node.js and NPM, Front-end Web UI
Frameworks.

jQuery: Introduction, Selectors, Attributes, Event Handlers, Style Methods, Traversing the DOM,
Effects, and Introduction to jQuery Plugins.

UNIT V (7 Contact Hours)

UNIT VI (7 Contact Hours)

NodeJs: Introduction, Environment Setup, First Application, REPL Terminal, Native Package
Manager(NPM), Web Module, Express Framework, RESTFul API.
Learning Resources:
Text Books:

1. Ralph Moseley and M. T. Savaliya, WileyIndia “Developing Web Applications”

2. Jeffrey C.Jackson,"Web Technologies--A Computer Science Perspective", PearsonEducation,
3. Dreamtech Press “Web TechnologiesBlack Book,” HTML 5,
4. Web Technologies: HTML, JAVASCRIPT, PHP, JAVA, JSP, XML and AJAX, Black Book
Kindle Edition by Kogent Learning Solutions Inc. (Author)
5. O'Reilly - Head First Servlets and JSP, 2nd Edition
6. Node.js Web Development: Create real-time server-side applications with this practical,
step-by-step guide, 3rd Edition
7. Bootstrap: Responsive Web Development Book by Jake Spurlock

Reference Books

1. Joel Sklar, Cengage ” Web Design”, Learning

2. Robert. W. Sebesta, "Programming the World Wide Web", Fourth Edition, PearsonEducation
3. P.J. Deitel& H.M. Deitel “Internet and World Wide Web How to program”, Pearson

Web Resources

1. https://www.w3schools.com/
2. https://www.tutorialspoint.com/web_development_tutorials.htm
3. https://html.com/
4. https://www.coursera.org/learn/bootstrap-4
5. https://www.tutorialspoint.com/jquery/index.htm
6. https://www.tutorialspoint.com/nodejs/
7. http://www.ntu.edu.sg/home/ehchua/programming/java/javaservlets.html
8. http://wiki.lib.sun.ac.za/images/0/07/Bootstrap-tutorial.pdf
9. https://media.readthedocs.org/pdf/htmlguide/latest/htmlguide.pdf

Course outcomes: At the end of the course, the student will be able to

CO 1 Learn how to design, add client side script and publish web page

Assessment Method
Assessment Weekly tests Monthly tests End Semester Test Total
Tool
Weightage (%) 10% 30% 60% 100%
******************************************************************************

Course
Course Code Course Name L-T-P Credits
Category
Database
23CSXX45 Management OEC 3-0-0 3
Systems

Course Learning Objectives:

1. To Understand the role of a database management system in an organization.
2. To Understand the basics of ER Diagram, Relational model, Relational Algebra and
Relational Calculus.
3. To Understand basic database concepts, including the structure and operation of the
relational data model.
4. To Construct simple and moderately advanced database queries using Structured Query
Language (SQL).
5. To Understand and successfully apply logical database design principles, including E-R
diagrams and database normalization.
6. To Understand the concept of a database transaction and related database facilities and
indexing techniques.

Course Content:
Unit I (8 Contact Hours)
Introduction to database systems, File System vs. Database Systems, Database system structure,
Views of data in a database system, Data models and Database languages. Introduction to Entity-
Relationship data model, Elements of an ER model, Constructing ER diagrams, Modelling of
constraints, Reduction of ER diagrams to relational tables.

Unit II (6 Contact Hours)

Unit III (9 Contact Hours)

Basic structure of SQL queries, Writing simple queries, Complex queries and nested Subqueries in
SQL, Aggregate functions in SQL, Effect of NULL values on result, Defining a Relational Schema,
View definitions and constraints, types of keys. Introduction to PL/SQL..

Unit IV (7 Contact Hours)

Features of Good Relational Designs, Atomic Domains and First Normal Form, Problems
encountered in bad schema design, Motivation for normal forms, Dependency theory-functional
dependencies, Armstrong’s Axioms for FD, Closure of a set of FD’s, Minimal Cover, Definition of
1NF, 2NF, 3NF and BCNF, Decomposition and desirable properties of them.

Unit V (6 Contact Hours)

Storing data in disk and files and the memory hierarchy, RAID, File organization and indexes,
ISAM Tree.

Unit VI (9 Contact Hours)

Transaction concept, ACID properties, Concurrency in a DBMS, Serializability and Recoverability,
Concurrency control Protocols (lock-based and time-stamp based)

Learning Resources:
Text Books:

1. A. Silberschatatz, H. F. Korth and S. Sudarshan, Database System Concepts, 5/e, McGraw

Reference Books:

1. Ramez Elmasri, Shamkant B. Navathe , Fundamentals of Database (7th Edition),

Web Resources:
1. Department of CS&E, IIT M, “Introduction to Database Sytems and Design”,
https://nptel.ac.in/courses/106106095/
2. Indian Institute of Technology, Kharagpur, “ Database Management Systems”,
https://nptel.ac.in/courses/106105175/

Course Outcomes: At the end of the course, the student will be able to
CO 1 Demonstrate the basic elements of a relational database management system,
CO 2 Ability to identify the data models for relevant problems.
Ability to design entity relationship and convert entity relationship diagrams
CO 3
into RDBMS and formulate SQL queries on the respect data.
CO 4 Apply normalization for the development of application software
CO 5 Ability to learn about Disk Management, Buffer management
CO 6 Ability learn about transaction management

Assessment Method
Assessment Weekly tests Monthly tests End Semester Test Total
Tool
Weightage (%) 10% 30% 60% 100%
******************************************************************************

Course
Course Code Course Name L-T-P Credits
Category
23CSXX46 Machine Learning OEC 3-0-0 3

Course Learning Objectives:

Course Content:

UNIT I: INTRODUCTION (8 Contact Hours)

UNIT II: NEURAL NETWORKS AND GENETIC ALGORITHMS (7 Contact Hours)

Neural Network Representation – Problems – Perceptrons – Multilayer Networks and Back Propagation
Algorithms – Advanced Topics – Genetic Algorithms – Hypothesis Space Search – Genetic Programming –
Models of Evalution and Learning.

UNIT III: BAYESIAN LEARNING (8 Contact Hours)

UNIT IV : COMPUTATIONAL LEARNING (8 Contact Hours)

UNIT V: INSTANCE BASED LEARNING (7 Contact Hours)

K- Nearest Neighbour Learning – Locally weighted Regression – Radial Bases Functions – Case Based
Learning.

UNIT VI: ADVANCED LEARNING (7 Contact Hours)

SVM – Formulation, SVM – Interpretation & Analysis, SVMs for Linearly Non-Separable Data, SVM
Kernels. Reinforcement Learning – Task – Q-Learning – Temporal Difference Learning.

Learning Resources:
Text Books:
1. Machine Learning – Tom M. Mitchell, - MGH
2. Machine Learning: An Algorithmic Perspective, Stephen Marsland, Taylor & Francis

Reference Books:
1. Gareth James, Daniela Witten, Trevor Hastie, Robert Tibshirani, Trevor Hastie,” An Introduction to
Statistical Learning: with Applications in R”, Springer, First Edition.
2. Kevin Murphy, “Machine learning: a probabilistic perspective”, MIT Press, First Edition.
3. Christopher Bishop, “pattern recognition and machine learning”, Springer, First Edition.

Course Outcomes:
1. Ability to understand what is learning and why it is essential to the design of intelligent machines.
2. Ability to design and implement various machine learning algorithms in a wide range of real-world
applications.
Assessment Method
Assessment Weekly tests Monthly tests End Semester Test Total
Tool
Weightage (%) 10% 30% 60% 100%
******************************************************************************
Course
Course Code Course Name L-T-P Credits
Category
Artificial
23CSXX47 OEC 3-0-0 3
Intelligence

Course Learning Objectives:

Unit II: (7 Contact Hours)

Heuristic Search Techniques: Generate and Test, Hill climbing, Best first search, Problem reduction,
Constraint satisfaction, Means ends analysis.

UNIT III (8 Contact Hours)

Knowledge Representation: Representation and mappings, Approaches to knowledge
representation; Issues in knowledge representation. Using Predicate Logic: Representing simple
facts in logic, Representing instance and IS-A relationships, Computable functions and predicates.

UNIT IV: (7 Contact Hours)

Different Knowledge Representation Schemes: Semantic nets, Frames, Conceptual dependency,
Scripts.

UNIT V: (8 Contact Hours)

Natural Language Processing: Overview of linguistics, Grammars and languages, Basic parsing
techniques, Transitional networks, Semantic analysis and representation structures, Brief
introduction on discourse and pragmatic processing;

UNIT VI: (8 Contact Hours)

Expert System Architecture: Characteristic features of expert systems, History, Applications, Rule
based system architecture. General Concepts in Knowledge Acquisition: Types of learning, General
learning model, Performance measures.

Assessment Method
Assessment Weekly tests Monthly tests End Semester Test Total
Tool
Weightage (%) 10% 30% 60% 100%
******************************************************************************

Course
Course Code Course Name L-T-P Credits
Category
Blockchain
23CSXX48 OEC 3-0-0 3
Technology
Course Learning Objectives:
1. To assess blockchain applications in a structured manner.
2. To impart knowledge in block chain techniques and be able to present the concepts clearly
and structured.
3. To get familiarity with future currencies and to create own crypto token

Unit I (8 Contact Hours)

Unit II (7 Contact Hours)

Development environments in block chain: Requirements for the consensus protocols, Proof of
Work, Scalability aspects of Block chain consensus protocols, Permission Block chains Design
goals; Block chain deployment, Mining and forking, Segregated Witness Block chain architectures-
Abstract Architecture, Introduction to major block chain platforms.
Unit III (8 Contact Hours)
Block chain in Multitude of clients in Ethereum, Production and test networks in Ethereum, Public,
private and development deployments; Solidity in depth, Building blocks popular contracts already
in deployment; Consensus protocols for Permissioned Block chains; Hyperledger Fabric I:
Decomposing the consensus process, Hyperledger fabric components, Chain code Design and
Implementation; Hyperledger Fabric II: Beyond Chain code: fabric SDK and Front End
Hyperledger composer tool.

Unit IV (8 Contact Hours)

Unit V (7 Contact Hours)

Block chain Cryptography: Privacy and Security on Block chain, Research aspects: Secure
cryptographic protocols on Block chain; Secured Multi-party Computation.

Unit VI (7 Contact Hours)

Course Outcomes:
1. Understand the various technologies and its business use.
2. Analyse the block chain applications in a structured manner.
3. Explain the modern concepts of block chain technology systematically.
4. Handle the cryptocurrency. Understand the modern currencies and its market usage.
5. Demonstrate the application of hashing and public key cryptography in protecting the blockchain
6. Explain the elements of trust in a Blockchain: validation, verification, and consensus.

Assessment Method
Assessment Weekly tests Monthly tests End Semester Test Total
Tool
Weightage (%) 10% 30% 60% 100%
******************************************************************************

Course Code Course Name Course L-T-P Credits

Course Learning Objectives:

1 Written technical communication and effective use of concepts and terminology.
2 Facility with UNIX command syntax and semantics.
3 Ability to read and understand specifications, scripts and programs.
4 Individual capability in problem solving using the tools presented within the class
Students will demonstrate a mastery of the course materials and concepts within
in class discussions.

Course Content:
UNIT I – Introduction to UNIX (11 Contact Hours)
Architecture of Unix, Features of Unix , Unix Commands – PATH, man, echo, printf, script,
passwd, uname, who, date, stty, pwd, cd, mkdir, rmdir, ls, cp, mv, rm, cat, more, wc, lp, od, tar,
gzip,cpio,ln.
UNIX Utilities:
Process utilities, disk utilities,networking commands, unlink, du, df, mount, umount, find, unmask,
ulimit, ps, w, finger, arp, ftp, telnet, rlogin.Text processing utilities and backup utilities , detailed
commands to be covered are tail, head , sort, uniq, grep, egrep, fgrep, cut, paste, join, tee, pg,
comm, cmp, diff, tr, awk.
UNIT II - File Management (6 Contact Hours)
Introduction to unix file system, vi editor, file handling utilities, security by file permissions,File
Structures, System Calls for File Management – create, open, close, read, write, lseek, link,
symlink, unlink, stat, fstat, lstat, chmod, chown, Directory API – opendir, readdir, closedir, mkdir,
rmdir, umask.
UNIT III – Introduction to Shells & Filters (7 Contact Hours)
Introduction to Shells : Unix Session, Standard Streams, Redirection, Pipes, Tee Command,
Command Execution, Command Line Editing, Quotes, Command Substitution, Job Control,
Aliases, Variables, Predefined Variables, Options, Shell/Environment Customization.
Filters: Filters and Pipes, Concatenating files, Display Beginning and End of files, Cut and Paste,
Sorting, Translating Characters, Files with Duplicate Lines, Count Characters, Words or Lines,
Comparing Files.
UNIT IV – grep, sed, awk (7 Contact Hours)
grep : Operation, grep Family, Searching for File Content.
sed : Scripts, Operation, Addresses, commands, Applications, grep and sed.
awk: Execution, Fields and Records, Scripts, Operations, Patterns, Actions, Associative Arrays,
String Functions, String Functions, Mathematical Functions, User – Defined Functions, Using
System commands in awk, Applications, awk and grep, sed and awk.
UNIT V – Korn shell programming (7 Contact Hours)
Interactive Korn Shell: Korn Shell Features, Two Special Files, Variables, Output, Input, Exit
Status of a Command, eval Command, Environmental Variables, Options, Startup Scripts,
Command History, Command Execution Process.
Korn Shell Programming: Basic Script concepts, Expressions, Decisions: Making Selections,
Repetition, special Parameters and Variables, changing Positional Parameters, Argument Validation,
Debugging Scripts, Script Examples.
UNIT VI – C shell programming (7 Contact Hours)
Interactive C Shell: C shell features, Two Special Files, Variables, Output, Input, Exit Status of a
Command, eval Command, Environmental Variables, On-Off Variables, Startup and Shutdown
Scripts, Command History, Command Execution Scripts.
C Shell Programming: Basic Script concepts, Expressions, Decisions: Making Selections,
Repetition, special Parameters and Variables, changing Positional Parameters, Argument Validation,
Debugging Scripts, Script Examples.
Learning resources
Text Book:
1. Behrouz A. Forouzan & Richard F. Gilberg, “Unix and Shell Programming”, 1st edition, Cengage
Learning, 2003
Reference Books:
1. Sumitabha Das, “Your Unix: The Ultimate Guide”, 1st edition, Tata Mcgraw hill, 2001
2. Graham Glass, King Ables, “Unix for programmers and Users”, 3rd edition, Pearson Education,
2003
3. Kernighan & Pike, “The UNIX Programming Environment”, 1st edition, Pearson Education
India, 2015
4. Ken Rosen, James Farber, Rachel Klee, Douglas Host, and Dick Rosinski, “ Unix: The Complete
Reference”, 2nd edition, McGraw Hill Education, 2007
Web resources:
1.Essential Linux/Unix Commands – GeeksforGeekshttps://www.geeksforgeeks.org/essential-
linuxunix-commands/
2.Introduction to Linux Shell and Shell Scripting - GeeksforGeeks
https://www.geeksforgeeks.org/introduction-linux-shell-shell-scripting/
3. UNIX /LINUX TUTORIAL
https://www.tutorialspoint.com/unix/

Course outcomes: At the end of the course, the student will be able to

CO 1 Documentation will demonstrate good organization and readability.

CO 2 Able to do Data organization, problem solving and research.
CO 3 Demonstrate simple effective user interfaces.
CO 4 Demonstrate effective use of structured programming.

CO 5 Will be accompanied by printed output demonstrating completion of a test plan

Assessment Method
Assessment Weekly tests Monthly tests End Semester Test Total
Tool
Weightage (%) 10% 30% 60% 100%
******************************************************************************

Course
Course Code Course Name L-T-P Credits
Category
23CSXX50 Cloud Computing OEC 3-0-0 3
Course Learning Objectives:
1. Understan
d various basic concepts related to cloud computing technologies.
2. Understan
d the architecture and concept of different cloud models: IaaS, PaaS, SaaS.
3. Understan
d big data analysis tools and techniques.
4. Understan
ding of cloud virtualization, cloud storage, data management and data visualization.
5. Understan
d different cloud programming platforms and tools.

Course Content:

Unit I: (9 Contact Hours)

Unit II (9 Contact Hours)

Virtual Machines and Virtualization of Clusters and Data Centers, Levels of Virtualization,
Virtualization Structures / tools and Mechanisms, Virtualization of CPU, Memory and I/O Devices,
Virtual Clusters and Resource Management, Virtualization Data-Centre Automation.

Unit III (7 Contact Hours)

Unit IV (8 Contact Hours)

Unit V (7 Contact Hours)

Disaster Recovery, Disaster Recovery Planning, comparing approaches in Xen, Eucalyptus, Open
Nebula, Amazon, Nimbus.

Unit VI (7 Contact Hours)

Various trends in computing, Web Services, Service Oriented Architecture (SOA)

Reference Books:
1. Morgan Kaufmann, ‘Distributed and Cloud Computing’, 1st edition, 2011.
2. Gautam Shroff,’ Enterprise Cloud Computing’, Cambridge, 2010.
3. Ronald Krutz and Russell Dean Vines, ‘Cloud Security’, 1st Edition, Wiley, 2010.
Course outcomes: At the end of the course, the student will be able to
CO 1 Develop and deploy cloud application using popular cloud platforms,
Design and develop highly scalable cloud-based applications by creating and
CO 2
configuring virtual machines on the cloud and building private cloud.
CO 3 Explain and identify the techniques of big data analysis in cloud.
CO 4 Identify the technological drivers of cloud computing paradigm.
CO 5 Identify the security issues in cloud computing
CO 6 Develop cloud services using popular cloud platforms

Assessment Method
Assessment Weekly tests Monthly tests End Semester Test Total
Tool
Weightage (%) 10% 30% 60% 100%
******************************************************************************

Course
Course Code Course Name L-T-P Credits
Category
23CSXX51 Internet of Things OEC 3-0-0 3
Course Learning Objectives:
1. Familiarity with the essential protocols of IoT and their operations
2. Design and implementation of IoT networks
3. Identifying various design parameters for developing IoT applications

Course Content:

Unit I (8 Contact Hours)

Unit II (8 Contact Hours)

Unit III (8 Contact Hours)

Unit IV (7 Contact Hours)

Web of Things:WoTvs. IoT, Two pillars of the Web, Architecture Standardization for WoT, Platform
middleware for WoT, Unified Multitier WoT architecture, WoT portals and business intelligence.
Unit V (7 Contact Hours)
Cloud of Things: Grid/SOA and cloud computing, Cloud middleware, Cloud standards, Cloud
providers and systems, IoT and cloud computing, Set up cloud environment - Send data from
microcontroller to cloud, Mobile cloud computing, Cloud of things architecture.

Unit VI (7 Contact Hours)

IoT Physical Servers and Cloud Offerings: Introduction to Cloud Storage models and
communication APIs, Webserver – Web server for IoT, Cloud for IoT, Python web application
framework, Designing a RESTful web API.

Learning Resources:
Text Book:
1. Honbo Zhou, “The Internet of Things in the Cloud: A Middleware Perspective”, CRC Press,
2012.

Assessment Method
Assessment Weekly tests Monthly tests End Semester Test Total
Tool
Weightage (%) 10% 30% 60% 100%
******************************************************************************

Course
Course Code Course Name L-T-P Credits
Category
Natural Language
23CSXX52 OEC 3-0-0 3
Processing

Course Learning Objectives:

Course Content:

Unit I: (8 Contact Hours)

Origins and challenges of NLP-Language and Grammar-Processing Indian Languages-NLP

Applications-Information Retrieval. Introduction-Various Grammar-based Language Models-
Statistical Language Model, N-Grams.

Unit II: (8 Contact Hours)

Introduction- Regular Expressions-Finite-State Automata-Morphological Parsing-Spelling Error

Detection and correction-Words and Word classes-Part-of Speech Tagging. Introduction-Context-
free Grammar-Constituency Parsing-Probabilistic Parsing

Unit III (7 Contact Hours)

Introduction- Meaning Representation-Lexical Semantics Ambiguity-Word Sense Disambiguation.

Introduction- cohesion-Reference ResolutionDiscourse Coherence and Structure.

Unit IV (8 Contact Hours)

Introduction-Architecture of NLG Systems, Generation Tasks and Representations-Application of

NLG. Introduction-Problems in Machine Translation Characteristics of Indian Languages- Machine
Translation Approaches-Translation involving Indian Languages

Unit V (7 Contact Hours)

Introduction-Design features of Information Retrieval Systems-Classical, Non-classical, Alternative

Models of Information Retrieval - Evaluation

Unit VI (7 Contact Hours)

Introduction-WordNet-FrameNet-Stemmers-POS Tagger Research Corpora , HMM in POS

Tagging.

Learning Resources:

Text Books:

1. Tanveer Siddiqui, U.S. Tiwary, “Natural Language Processing and Information Retrieval”,
Oxford University Press, 2008.

Reference Books:
1. Daniel Jurafsky and James H Martin, ”Speech and Language Processing: An introduction to
Natural Language Processing, Computational Linguistics and Speech Recognition”, Prentice Hall,
2nd Edition, 2008.
2. James Allen, Bejamin Cummings, “Natural Language Understanding'', 2nd edition, 1995.

Assessment Method
Assessment Weekly tests Monthly tests End Semester Test Total
Tool
Weightage (%) 10% 30% 60% 100%
******************************************************************************

Course
Course Code Course Name L-T-P Credits
Category
Human Computer
23CSXX53 OEC 3-0-0 3
Interaction

Course Content:
UNIT-I: Introduction and Graphical User Interface (9 Contact Hours )
Importance of user Interface – definition, importance of good design. Benefits of good design. A
brief history of Screen design.
The graphical user interface – popularity of graphics, the concept of direct manipulation,
graphical system, Characteristics, Web user – Interface popularity, characteristics- Principles of user
interface.

UNIT-II: Design Process (7 Contact Hours )

Human interaction with computers, importance of human characteristics human consideration,
Human interaction speeds, understanding business junctions.

UNIT-III: Screen Designing (9 Contact Hours )

UNIT-IV: Windows ( 7 Contact Hours )

New and Navigation schemes selection of window, selection of devices based and screen
based controls.

UNIT-V: Components (7 Contact Hours )

Text and messages, Icons and increases – Multimedia, colors, uses problems, choosing colors.

UNIT-VI: Software Tools and Interaction Devices (7 Contact Hours )

Specification methods, interface – Building Tools; Keyboard and function keys – pointing devices –
speech recognition digitization and generation – image and video displays – drivers.

Text Books:
1. Wilbert O Galitz,”The essential guide to user interface design”, Wiley DreamaTech.
2. Ben Shneidermann ,”Designing the user interface”, Pearson Education Asia 3rd Edition,.
References:
1. Alan Dix, Janet Fincay, Gre Goryd, Abowd, Russell Bealg, “Human – Computer
Interaction”, Pearson, Third Edition.
2. Prece, Rogers, Sharps ,“Interaction Design” ,Wiley Dreamtech , Third Edition.
3. Soren Lauesen ,“User Interface Design”,Pearson Education.

Web resources:
1. Dr. Samit Bhattacharya , Dept. of Computer Science and Engineering, IIT Guwahati URL:
http://nptel.ac.in/courses/106103115

Course outcomes: At the end of the course, the student will be able to
Explain the capabilities of the both humans and computers from the viewpoint
CO 1
of human Information processing
Describe typical human-computer Interaction (HCI) models styles and various
CO 2
historic HCI paradigms.
Apply an interactive design process and universal design principles to
CO 3
designing HCI systems.
CO 4 Describe and use HCI design principles, standards and guidelines.
Analyze and identify user models ,user support ,socio-organizational issues,
CO 5
and stakeholder requirements of HCI system.
Design tasks and dialogs of relevant HCI systems based on task analysis and
CO 6
dialog design.

Assessment Method
Assessment Weekly tests Monthly tests End Semester Test Total
Tool
Weightage (%) 10% 30% 60% 100%
******************************************************************************

Course
Course Code Course Name L-T-P Credits
Category
Information
23CSXX54 OEC 3-0-0 3
Security

Course Content:

Unit-1: (5 Contact Hours)

Introduction: Security mindset, Computer Security Concepts (CIA), Threats, Attacks, and Assets.

Unit-2: (5 Contact Hours)

Software Security: Vulnerabilities and protections, malware, program analysis.

Unit-3: (8 Contact Hours)

Practical Cryptography: Encryption, authentication, hashing, symmetric and asymmetric
cryptography, Digital Signatures and Certificates.

Unit-4: (10 Contact Hours)

Network Security: Network security issues, Sniffing, IP spoofing, Common threats, E-Mail
security, IPSec, SSL, PGP, Intruders, Virus, Worms, Firewalls-need and features of firewall, Types
of firewall, Intruder Detection Systems.

Unit-5: (8 Contact Hours)

Cyber Security: Cyber Crime and security, Security tools, Introduction to Digital Forensic, OS
fingerprinting, TCP/IP stack masking, Social Engineering.

Unit-6: (6 Contact Hours)

Applications and special topics: Web application Security, Privacy and Anonymity, public policy.

Learning Resources:
Text Book:
1. Computer Security: Principles and Practice, William Stallings; Lawrie Brown
Reference Books:
1. Introduction to Computer Security, 2004 Matt Bishop, Addison-Wesley, ISBN 0-321-24744-
2. Buchmann J. A., Introduction to Cryptography, Springer Verlag (2001).
3. Stallings William, Cryptography and Network Security, Pearson Education (2006).
4. Schneier Bruce, Applied Cryptography, John Wiley and Sons (1996).
5. Britz M., Computer Forensic and cyber crime, Upper Saddle River, Prentice Hall (2003).
Course Outcomes:
1. Evaluate vulnerability of an information system and establish a plan for risk management.
2. Demonstrate basic principles of Web application security
3. Evaluate the authentication and encryption needs of an information system.
4. Demonstrate how to secure a network
5. Evaluate a company’s security policies and procedures.

Assessment Method
Assessment Weekly tests Monthly tests End Semester Test Total
Tool
Weightage (%) 10% 30% 60% 100%
******************************************************************************

Course
Course Code Course Name L-T-P Credits
Category
23CSXX55 Big Data Analytics OEC 3-0-0 3

Course Learning Objectives:

1. Applying and understanding the big data flow for the actual projects.
2. Understands the lifecycle of the data analytics & big data ecosystem and able to apply for
real world problems.
3. Acquires knowledge on the tools and techniques for solving big data analytics.
4. Learns how to apply the mining techniques on big data

Course Content:

Unit - I (8 Contact Hours)

Introduction to Big Data Analytics:Big Data Overview, State of the Practice in Analytics, Key
Roles for the New Big Data Ecosystem, Examples of Big Data Analytics.
Data Analytics Lifecycle:Data Analytics Lifecycle Overview, Discovery, Data Preparation, Model
Planning, Model Building, Communicate Results, Operationalize.

Unit - II (8 Contact Hours)

Unit-III (8 Contact Hours)

Unit – IV (8 Contact Hours)

Advanced Analytical Theory and Methods-Time Series Analysis: Overview of Time Series
Analysis, ARIMA Model, Additional Methods. Advanced Analytical Theory and Methods-Text
Analysis: Text Analysis Steps, A Text Analysis Example, Collecting Raw Text, Representing Text,
Term Frequency--Inverse Document Frequency (TFIDF), Categorizing Documents by Topics,
Determining Sentiments, Gaining Insights.

UNIT V: (7 Contact Hours)

UNIT – VI: (7 Contact Hours)

Learning resources
Text book:
1. Dunlop, Dorothy D., and Ajit C. Tamhane. ‘Statistics and data analysis: from elementary to
intermediate’. Prentice Hall, 2000.
2. EMC Education Services “Data Science and Big Data Analytics: Discovering, Analyzing,
Visualizing and Presenting Data” Wiley Publishers.
3. Tom White “ Hadoop: The Definitive Guide” Third Edition, O‟reilly Media, 2011.
4. Prajapati, "V. Big data analytics with R and Hadoop",Packt Publishing Ltd, 2013.

Reference Books:
1. Ohlhorst, Frank J. ‘Big data analytics: turning big data into big money’. John Wiley &
Sons, 2012.
2. W.N. Venables, D.M Smith, ‘An introduction to R’, Network Theory Ltd.
3. Nina Zumel, John Mount, ‘Practical Data Science with R’, Manning Publications, 2014
4. Tom Plunkett, Mark Hornick, ‘Using R to Unlock the Value of Big Data: Big Data Analytics
with Oracle R Enterprise and Oracle R Connector for Hadoop’, McGraw-Hill/Osborne Media
(2013), Oracle press.

Course Outcomes: At the end of the course, the student will be able to
CO 1 Have a clear idea about the big data flow and its ecosystem.

Apply the tools and techniques on big data while applying data mining
CO 2 techniques.

CO 3 Use statistical tool and statistical methods that can be applied on big data.

Assessment Method
Assessment Weekly tests Monthly tests End Semester Test Total
Tool
Weightage (%) 10% 30% 60% 100%
******************************************************************************

Course
Course Code Course Name L-T-P Credits
Category
Digital Image
23CSXX56 OEC 3-0-0 3
Processing

Course Learning Objectives:

7. To describe the image fundamentals and mathematical transforms necessary for image
processing.
8. To explain the image enhancement techniques
9. To analyze images in the frequency domain using various transforms.
10. To explain image restoration procedures.
11. To describe Image Compression and Segmentation used in digital image processing.
12. To describe image feature extraction methods.
Course content:
Unit I (8 Content Hours)
Digital image fundamentals – Electromagnetic spectrum and imaging, Image acquisition, image
formation. Digitization-sampling and quantization, Resolution-pixel, gray scale, spatial, basic
relationship between pixels, Distance measure, Mathematical operations on image, Geometrical and
spatial transformation.
Unit II (8 Content Hours)
Intensity transformation and spatial filtering: Image enhancement, log transformation, Gamma
transformation, Histogram processing, Histogram matching, Special filtering- spatial correlation
and convolution, generating spatial filter mask, mage smoothing, Image sharpening-Laplacian filter,
Highboost filter. Edge detection- gradient filter, Morphological image processing-erosion, Dilation,
opening and closing operations, Boundary extraction, Hole Filling, Extraction of connected
components, Thinning, and thickening.
Unit III (7 Content Hours)
Image Restoration-Noise model, Restoration-Mean filter, Geometric filter, median filter, adaptive
filter, band pass filter, Notch filter, least mean square filters. Color fundamental-RGB color model,
CMY color model, HSI color model. Converting RGB to HSI and vice-versa.
Unit IV (7 Content Hours)
Filtering in Frequency domain-Preliminary concept: Fourier series, Fourier transform, convolution,
Sampling, DFT, Enhancement in frequency domain, low pass filter, high pass filter. Computing
IDFT from DFT.

Unit V (8 Content Hours)

Leaening Resources:
Text B Books:
4. Digital Image processing – R.C. Gonzalez & R.E. Woods, Addison Wesley/ Pearson
education, 3rd edition.
5. D. A. Forsyth, J. Ponce, Computer Vision: A Modern Approach, PHI Learning 2009.
6. Milan Soanka, Vaclav Hlavac and Roger Boyle, Digital Image Processing and Computer
Vision, Cengage Learning.

Reference Books:
2. Fundamentals of Digital Image processing – A.K.Jain , PHI

Course Outcomes:
3. Be able to apply, design and implement solutions for digital image processing problems.
4. Be able to discuss the strengths and limitations of DIP applications in solving problems with
both professional peers and lay clients.

Assessment Method
Assessment Weekly tests Monthly tests End Semester Test Total
Tool
Weightage (%) 10% 30% 60% 100%
******************************************************************************

Course
Course Code Course Name L-T-P Credits
Category
23CSXX57 Computer Vision OEC 3-0-0 3

Course Learning Objectives:

1. To review image processing techniques for computer vision
2. To understand Image Homographies
3. To understand Scale Invariant Feature Transform and its applications
4. To understand Camera Model (Intrinsic and Extrinsic Parameters) and Epipolar geometry
5. To understand motion analysis
6. To study some applications of computer vision algorithms
Course Content:

Unit- I: (5 Contact Hours)

Introduction to Computer vision, Review of Linear Algebra, Review of Probability, Introduction to
OPENCV/Matlab.

Unit- II: (6 Contact Hours)

Unit - III: (8 Contact Hours)

Harris corner detection, feature matching, Image mappings, Planar Hymnographies, Similarity
transformations, Affine transformations, warping images, SIFT, RANSAC, creating panoramas.

Unit - IV: (10 Contact Hours)

Correspondence problem, correspondence matching, Camera model, Pinhole camera model, camera
calibration, Augmented reality, Epipolar geometry, Epipoles, Epipolar lines, Conjugate Epipolar
lines, computing with cameras and 3D structures, Multiple view reconstruction, Stereo images ,
recover depth from two images, geometry of simple stereo system, stereo disparity, Image
pyramids, Camera projection: (Extrinsics and Intrinsics parameters)

Unit - V: (8 Contact Hours)

Unit -VI: (8 Contact Hours)

Web References:
1. University of Central Florida, Sept 2012, “Computer Vision”
https://www.youtube.com/watch?v=715uLCHt4jE&list=PLd3hlSJsX_Imk_BPmB_H3AQjFKZS9X
gZm
2. University of Pennsylvania, FALL 2007, “ Introduction to Computer Vision”,
http://www.cse.psu.edu/~rtc12/
3. Stanford University, Fall 2016-17, “ Computer Vision : Foundations and Applications”
5. http://vision.stanford.edu/teaching/cs131_fall1617/schedule.html

Assessment Method
Assessment Weekly tests Monthly tests End Semester Test Total
Tool
Weightage (%) 10% 30% 60% 100%

Course
Course Code Course Name L-T-P Credits
Category
Computational
Science and
23CSXX58 OEC 3-0-0 3
Engineering with
Python
Course Learning Objectives:
1. To introduce the Python programming language as a tool for computation.
2. To solve numerical algorithms covering interpolation, integration, differentiation,
ODE and PDE solvers and basic linear algebra using Python.

Course Content:
Unit I: (6 Contact Hours)
About computers, Python- Variables, assignments, Numpy arrays, Control structures.

Unit II: (8 Contact Hours)

Python packages, programming, plotting, Errors, Non dimensionalization, Data I/O and Mayavi.

Unit III: (8 Contact Hours)

Lagrange interpolation , interpolation in 2D, Splines.

Unit IV: (8 Contact Hours)

Numerical integration: Newton- Cotes, Gaussian quadratures.

Unit V: (8 Contact Hours)

Numerical differentiation, ODE solvers.

Unit VI: (7 Contact Hours)

Fourier transform, PDE solver: Diffusion equation in Spectral method, using finite difference. PDE
solver: Wave equation using finite difference, Liner algebra Ax=B solver.

Learning Resources:
Text Books:
1. Mark Newmann, ‘ Computational Physics with Python’, 2nd Edition
2. J.M. Stewart, ‘Python for Scientists’, Cambridge Univ. Press (2014)
Reference Books:
1. M.Lutz, ‘Learning Python’, O’Reilly, 5th Edition(2013)
2. J.H Ferziger, ‘Numerical Methods for Engineering Applications’, John Wiley & Sons(1998)
Web Resources:
1. Prof Mahendra K Verma,NPTEL-IIT Kanpur, ‘Computational Science and Engineering
using Python’.
URL: https://nptel.ac.in/courses/115104095/

Course Outcomes:
After the completion of the course, the student will be able to:
CO 1 Use python as a computational tool.
CO 2 Understand Python packages
CO 3 Use python programming for solving ODE, PDE
CO 4 Use python programming for solving integration
CO 5 Use python programming for fourier transforms
CO 6 Use python programming for linear algebra

Assessment Method
Assessment Weekly tests Monthly End Semester Test Total
Tool tests
Weightage (%) 10% 30% 60% 100%
**************************************************************************

Courses Offered to Other Departments

*********************************************

Course Course
Course Name L-T-P Credits
Code Category
Programming and Data
23CSXX61 ESC 3-0-0 3
Structures

Course Learning Objectives:

1. To deduce adequate knowledge in programming language and problem-solving techniques.
2. To develop programming skills using the fundamentals of C Language.
3. To recognize the effective usage of arrays, structures, functions, pointers.
4. To implement the memory management concepts.
5. To illustrate the usage of pointers and dynamic memory allocation.
6. Explore Data Structures and its applications.
Course Content:
Unit – I (7 Contact Hours)
Introduction: Computer Hardware, Bits and Bytes, History of Programming Languages, Character
Set, Variables and Identifiers, Built-In Data Types. Operators and Expressions, Constants and
Literals, Simple Assignment Statement, Basic Input/output Statement, Simple 'C' Program,
Conditional Statements and Loops.

Unit – II Arrays: (8 Contact Hours)

One Dimensional Arrays, Array Manipulation, Searching, Insertion, Deletion of An Element from
An Array; Finding the Largest/Smallest Element in An Array; Two Dimensional Arrays,
Addition/Multiplication of Two Matrices, Transpose of square Matrix, Character Arrays.

Unit – III (8 Contact Hours)

Functions: Function Declaration, Function Definition, Function Call, Call by Value, Call by
Reference, Recursion, String Fundamentals, String Handling Functions.

Unit – IV (8 Contact Hours)

Structure &Union: Structure Variables, Initialization, Structure Assignment, Nested Structure,
Structures and Functions, Structures and Arrays: Arrays of Structures, Structures Containing Arrays,
Unions.

Unit – V (7 Contact Hours)

Pointer: Pointer Type Declaration, Pointer Assignment, Pointer Initialization, Pointer Arithmetic,
Functions and Pointers, Arrays and Pointers, Pointer to Pointers, Dangling Memory, Dynamic
Memory Allocations, Storage Classes.

Unit – VI (7 Contact Hours)

Introduction to Data Structures: Linked List, Double Linked Lists, Stack, Stack Implementation
Using Arrays, Stack Implementation Using Linked List.

Text Book:
1. Reema Thareja, ‘Data Structures using C’, Oxford Higher Education,2nd Edition.

Reference Books:
1. E. BalaguruSwamy, “ Programming in ANSI C”, Mc Graw Hill, 7th Edition
2. Brian W. Kernighan, Dennis M. Ritchie, “ The C Programming Language”, Prentice Hall,
nd
2 Edition
Assessment Method:
Assessment Weekly tests Monthly tests End Semester Total
Tool Test
Weightage (%) 10% 30% 60% 100%

********************************************************************************
**

Course
Course Code Course Name L-T-P Credits
Category
Programming and Data Structures
23CSXX91 ESC 0-0-3 1.5
Lab

Course Learning Objectives:

1. The purpose of the course is to introduce the students to the field of programming using C
language.
2. To deduce adequate knowledge in programming language and problem-solving techniques.
3. To develop programming skills using the fundamentals of C Language.
4. To recognize the effective usage of arrays, structures, functions, pointers
5. To illustrate the usage of pointers and dynamic memory allocation.
6. Explore Data Structures and its applications.

Unit 1
Introduction
1. C Program to calculate the sum of Natural numbers.
2. C Program to find factorial of a number
3. C Program to generate a multiplication table of a given number.
4. C Program to display Fibonacci sequence (up to given number)
5. C Program to Check whether a given number is prime or not
6. C Program to make a simple Calculator using switch case
7. C Program to check whether a number is palindrome or not
8. C Program to display factors of a given number
9. C Program to print Pyramids and Triangles using loops

Unit II
Arrays
1. C Program to find second largest Element of an Array
2. C Program to add two matrix using multi-dimensional arrays.
3. C Program to multiply two matrix using multi-dimensional arrays.
4. C Program to find the transpose of a matrix.
5. C Program to Sort Elements of an Array.

Unit III
Functions
1. C Program to check whether a given number is prime or not using a user-defined function.
2. C Program to check whether a given number is Armstrong or not using a user- defined function.
3. C Program to swap two integer values using call by value and call by reference.
4. C Program to find the sum of Natural numbers using recursion.
5. C Program to find the factorial of a given number using recursion.
6. C Program to calculate length of string without using strlen() function.
7. C Program to sort elements in Lexicographical order (Dictionary order) using in built string
functions.

Unit IV
Structures and Unions
1. C Program using structures to read and display the information about a student.
2. C Program to read, display, add and subtract two complex numbers.
3. C Program to read and display the information of a student using nested structure.
4. C Program, using an array of pointers to a structure, to read and display the data of students.
5. C Program to demonstrate arrays of Union variables.

Unit V
Pointers
1. C Program to demonstrate handling of pointers in C.
2. C Program to access array elements using pointers.
3. C Program to find the sum of n numbers with arrays and pointers.
4. C Program to swap two numbers using pointers and function
5. C Program to find the sum of n elements entered by the user. To perform this allocate memory
dynamically using malloc() function.
6. C Program to find the sum of n elements entered by the user. To perform this allocate memory
dynamically using calloc() function.

Unit VI
Introduction to Data Structures
1. Write a program to create a linked list and perform insertions and deletions of all cases. Write
functions to sort and finally delete the entire list at once.
2. Write a program to create a doubly linked list and perform insertions and deletions in all cases.
3. Write a program to perform push, pop and peek operations on a stack.
4. Write a program to implement a linked stack.

References:
1. Rema Thareja, Programming in C, 3rd edition, Oxford Higher Education.
2. Rema Thareja, Data structures using C, 2nd edition ,Oxford Higher Education

**********************************************************************
Course Code Course Name Course L-T-P Credits

23CSXX62 Artificial Intelligence and PCC 3-0-0 3

Machine Learning

Course Objectives:

1. Artificial Intelligence is a major step forward in how computer system adapts, evolves and
learns. It has widespread application in almost every industry and is considered to be a big
technological shift, similar in scale to past events such as the industrial revolution, the computer
age, and the smart phone revolution
2. To be able to formulate machine learning problems corresponding to different applications
3. To understand a range of machine learning algorithms along with their strengths and weaknesses.
4. To be able to apply machine learning algorithms to solve problems of moderate complexity.

Unit I: (8 Contact Hours)

Introduction: What Is AI?, The Foundations of Artificial Intelligence, The History of Artificial
Intelligence, The State of the Art, Agents and Environments, Good Behaviour: The Concept of
Rationality, The Nature of Environments, The Structure of Agents..

Unit II: (7 Contact Hours)

Problem Solving: Problem-Solving Agents, Example Problems, Searching for Solutions,
Uninformed Search Strategies, Informed (Heuristic) Search Strategies, Local Search Algorithms
and Optimization Problems, Searching with Nondeterministic Actions.

Unit III: (7 Contact Hours)

Introduction to ML: A brief introduction to Machine Learning, Supervised Learning, Unsupervised

Learning, Reinforcement Learning, Statistical decision theory – Regression, Classification, Bias-
variance, Linear Regression, Multivariate Regression, Dimensionality : Subset Selection,
Shrinkage Methods, Principal Component Regression, Partial Least Square.
Unit IV: (8 Contact Hours)
Statistical Models: Naïve Bayes, Bayesian Classifier, Gaussian Multivariate model, Gaussian
Mixture model, Parameter Estimation: Maximum Likelihood Estimation, Expectation and
Maximization, Priors & MAP Estimation, Bayesian Parameter Estimation..

Unit V: (8 Contact Hours)

Artificial Neural Networks and SVM: Feed forward network, Perceptron Learning, Back
propagation, SVM – Formulation, SVM – Interpretation & Analysis, SVMs for Linearly Non-
Separable Data, SVM Kernels, SVM – Hinge Loss Formulation.

Unit VI: (7 Contact Hours)

Decision Trees and Ensemble method : Introduction, Entropy, Information gain, Decision Trees,
Stopping Criteria, Loss-Function for Classification, Missing Values ,Multi-way splits, Imputations
& Surrogate Splits, Instability, Smoothness & Repeated Subtrees, Ensemble Methods: Bagging,
Boosting.

Text Books:
1. Stuart Russell and Peter Norvig, “Artificial Intelligence: A Modern Approach” , 3rd Edition,
Pearson.
2. Tom M. Mitchell, Machine Learning, McGraw Hill Edition, 2013
3. Saroj Kaushik, “Artificial Intelligence”, Cengage Learning India, 2011.

Reference Books:
1. Elaine Rich and Kevin Knight, “Artificial Intelligence”, Tata McGraw Hill.
2. David Poole and Alan Mackworth, “Artificial Intelligence: Foundations for Computational
Agents”, Cambridge University Press 2010.
3. Trivedi, M.C., “A Classical Approach to Artifical Intelligence”, Khanna Publishing House, Delhi
4. Christopher Bishop, Pattern Recognition and Machine Learning (PRML) , Springer, 2007.
************************************************************************

Course Course Name Course Category L-T-P Credits

Code
23CSXX63 Object ESC 2-0-0 2
Oriented
Programming

Course Learning Objectives

1. Gain knowledge about basic C++ language syntax and semantics to write C++ programs and use
concepts such as variables, conditional and iterative execution methods etc.,

2. Understanding the fundamentals of object-oriented programming inC++, including defining

classes, objects, invoking methods etc. and exception handling mechanisms. 3. Understand the
principles of inheritance, packages and interfaces.

4. Understand the principles of Multithreading and Applet Programming

Course Content:

Unit-1: (5 Contact Hours)

Review of C: strings, arrays, pointers, Programming in C++ : Build and execute a C program in
C++, Write equivalent programs in C++, C++ as Better C : Procedural Extensions of C

Unit-2: (5 Contact Hours)

OOP in C++: Classes and basic Object-Oriented features (encapsulation), Overview of OOP in
C++: More OO features, overloading, namespace and using struct and union

Unit-3: (5 Contact
Hours)

Inheritance : Generalization / Specialization of Object Modeling in C++, Polymorphism : Static and

Dynamic Binding.

Unit-4: (5 Contact Hours)

Type Casting &Exceptions : C++ cast operators; C++ Exceptions & standard exception

Unit-5: (5 Contact
Hours)

Classes Templates& STL - Function and Class templates and using STL like containers, algorithms.

Unit-6: File handling, streams, Interfaces and Multithreaded Programming. (5 Contact

Hours)

References:
1. C++ Primer, Stanley Lippman, 5th edition.
2. Object-Oriented Programming with C++, E.Balagurusamy, McGraw-Hill Education (India)
Web resources:

********************************************************************************
******

Course Code Course Name Course L-T-P Credits

23CSXX92 Object Oriented ESC 0-0-3 1.5

Programming Lab

Course Learning Objectives:

1. To build software development skills using C++ programming for real-world applications.

2. To understand and apply the concepts of classes, packages, interfaces, arraylist, User defined
Linked List, File Handling, exception handling andMulti-threading.

List of Experiments

Lab No 1: Basic Programs in C++.

Lab No 2: Programming Assignments on Arrays and Strings.

Lab No 3: Programming Assignments on Classes, Objects and Encapsulation. Lab No 4:

Implementing the concepts of Inheritance and Array Objects. Lab No 5: Implementing the OOPS
Concepts of Abstract, Interfaces and Polymorphism. Lab No 6: Programming Assignments on File
Handling.

Lab No 7: Programming Exercises on Exception Handling.

Lab No 8: Working with List Operations.

Lab No 9: Implementing the concepts of Multi-Threading.

******************************************************************************

Course Course Name Course L-T- Credits

Code Category P
23CSXX64 Basic Programming Language (CE Only)
ESC 3-1-0 4

Course Learning Objectives:

1. To understand the various steps in Program development.
2. To understand the basic concepts in Computer Languages in C, C++ and Python.
3. To learn about arrays, strings and structures.
4. To learn how to write modular programming.
5. To understand the basic concepts of object oriented programming using C++.

Course Content:
UNIT – I (10 Contact Hours)
Introduction to Computer Programming: Computer Languages, Creating and Running
Programs. Algorithms and Flowcharts, Definition of Algorithms and examples, Introduction to C
Language - Background, C Identifiers, Data Types, Operators, Variables, Constants, Input / Output
functions, Expressions, C Programs, Precedence and Associativity, Evaluating Expressions, Type
Conversion.
Conditional Statements and Loops: if-else, switch Statements, Repetition: loops, while, for, do-
while statements, break and continue statements.
UNIT-II (10 Contact Hours)
Arrays: Array Concepts, Using Arrays in C, Array Applications, Two- Dimensional Arrays,
Multidimensional Arrays. Strings-Declaring, Initializing, Printing and reading strings, String
manipulation functions, String input and output functions, Array of strings.
Functions and Pointers: Introduction to Pointers, Function Basics, function types, User Defined
Functions, Inter Function Communication.

UNIT-III (10 Contact Hours)

Structure: Definition and Initialization of Structures, Accessing Structures, Nested Structures,
Arrays of Structures, Structures and Functions, Pointers to Structures, Self-Referential Structures.
Files: Input and Output: Files, Streams, Standard library Input Output Functions, Character Input
Output Functions.

UNIT – IV (10 Contact Hours)

Introduction Object Oriented Programming (OOP), Procedural Vs. Object Oriented
Programming, Principles of OOP, Benefits and applications of OOP.
Basics of object and class in C++, Private and public members, static data and function members,
constructors and their types, destructors, operator overloading.

Unit V: (10 Contact Hours)

Concept of Inheritance, types of inheritance: single, multiple, multilevel, hierarchical, hybrid,
protected members, overriding, virtual base class.
Pointers in C++, Pointers and Objects, this pointer, virtual and pure virtual functions, Implementing
polymorphism,Templates.

UNIT – VI (10 Contact Hours)

Template: Introduction to template, function templates and class templates, Introduction to
exception, try-catch- throw, multiple catch, catch all, implementing user defined exceptions,
Overview and use of Standard Template Library(STL).
Learning resources:
Text Book:
1. Reema Thareja, “ Programming in C”, Oxford Publications, 2nd Edition
2. E.Balaguruswamy,“Object Oriented Programming with C++”, 7nd Edition
Reference Books:
1. E. BalaguruSwamy, “ Programming in ANSI C”, Mc Graw Hill, 7th Edition
2. Brian W. Kernighan, Dennis M. Ritchie, “ The C Programming Language”,
Prentice Hall, 2nd Edition
Web Resources:
Indian Institute of Technology, Kharagpur, “Problem Solving through Programming in C”,
https://nptel.ac.in/courses/106105171/

CO 1 Develop flowcharts, algorithms for given complex problems.

Assessment Method
Assessment Tool Weekly tests Monthly tests End Semester Test Total
Weightage (%) 10% 30% 60% 100%

********************************************************************************
**

Course Course Name Course L-T- Credits

Code Category P
23CSXX93 C- Programming Lab (CE Only)
ESC 0-0-3 1.5

Course Learning Objective:

1. Identify situations where computational methods and computers would be useful.
2. Given a computational problem, identify and abstract the programming task involved.
3. Approach the programming tasks using techniques learned and write pseudo-code.
4. To understand the concepts of Programming language
5. To learn the basics of C declarations, operators and expressions
6. To learn on the manipulation of strings, functions and pointers
7. To apply concepts and techniques for implementation
List of Programming Assignments for Laboratory:

Statements, Expressions , Conditionals ,For Loop & While Loop :

1. Write a program to print the memory allocation required for all the datatypes in C Language.
2. Write a menu based program to take of input of two values followed input of choice and
accordingly perform arithmetic operations like Addition, Subtraction, Multiplication, Modulus,
Division, Power( Using Switch Statement)
3. Write a program to find out whether the given number is a perfect square or not.
4. Write a program to find the factorial of a given number
5. Write a program to find whether a given number is Palindrome or not.
6. Write a program to print the Fibonacci series upto given ‘n’ number of terms.
7. Write a program to print the first ‘n’ prime numbers and prime numbers upto ‘n’ value.
8. Write a program to print the Pascal Triangle for given ‘n’ value
Single Dimensional Arrays: Basic Operations and Problems
1. Write a program to take an input array of ‘n’ numbers and find out the sum of all the
elements, product of all the elements and mean of the array.
2. Write a program to take an input array of ‘n’ numbers and print the second smallest and
second largest element of all elements in the array.
3. Write a program to find the addition and multiplication for the given two matrices of sizes
‘M x N’ and ‘P x Q’ respectively.

Two Dimensional Arrays –Matrices & its operations

1. Write a program to find the addition and subtraction for the given two matrices of sizes ‘M x
N’ and ‘P x Q’ respectively
2. Write a program to find the multiplication of the given two matrices of sizes ‘M x N’ and ‘P
x Q’ respectively.
3. Write a program to find the transpose of a matrix.
Strings ,Functions types & Recursion Functions
1. Write a program to print out the number of vowels, consonants, and digits (0-9) present in
the given input string.
2. Write a program to implement the string operations like Length of String, String Copying,
String Concatenation, Conversion to Uppercase and String Comparison.( Define own Function for
each of the operations. Header file “string.h” is not allowed)
3. Write a program to check whether the given input string is palindrome string or not using
string handling functions.
4. Write a program to print the words of a given input string in reverse order For Eg. If input
string is “I am an Indian”, the output would be “Indian an am I”
5. Write a menu driven program to perform all arithmetic operations using functions(using all
types of functions).
6. Write a program to demonstrate how to pass 1D and 2D arrays as arguments to a function.
7. Write a program to find the factorial of the given number without using loops.
8. Write a program to swap two numbers using call by reference (pointers)
9. Write a program to print fibonacci series upto the given number using a recursion method.
Structures & File Handling (Create, Read and Write operations on File)
1. Write a program to take the information of ‘n’ Students (REGID, Name, CGPA, Address –
Village, District, Phone NO) and print the topper among the n students.
2. Write a program to create a Node using self referential structure.
3. Write a program to print the number of lines and words in a given input file name.
4. Write a program to copy from the given file to another file.
5. Write a program to append one file at the end of another file.
Object Programming concepts( Class & Constructors):
1. Create an EMPLOYEE class contains the following members: data members: Employee
number, Employee name, Basic, DA, Net Salary and print data members.
2. Write a C++ Program to display Names, Roll No, and grades of 3 students who have appeared in
the examination. Declare the class of name, Roll No. and grade. Create an array of class objects.
Read and display the contents of the array.
3. Write a Program to allocate memory dynamically for an object of a given class using
constructor.
4. Program to illustrate the working of public and private in C++ Class
5. Write a C++ program to declare a class, declare pointer to class, initialize and display contents
of class members.
Inheritance and Polymorphism
1. Write a C++ program to create multilevel inheritance. (Hint: Classes A1, A2, A3)
2. Write a program to define three classes A,B and C. Each class contains private data
members.
Derive class C from A and B by applying multiple inheritance. Read and display the data using
constructors and destructors.
3. Write a C++ program to create an array of pointers. Invoke functions using array objects.
4. Write a C++ program to use pointer for both base and derived classes and call the member
function.
Use Virtual keyword.
5. Write a program to invoke member functions of base and derived classes using pointer of
base class.

Assessment Method:

Assessment Tool Experiments Report/Viva-Voce/ Quiz/MCQ/Lab project Total

Weightage (%) 25% 15% 40%
End Semester Examination weightage (%) 60%

********************************************************************

Course Code Course Name Course Category L-T-P Credits

23CSXX65 Advanced Programming PCC 3-0-0 3
Course (CE Only)

Course Learning Objectives:

Course Content:
Unit- I (7 Contact Hours)
Introduction to Linear and Non-Linear data structures. Singly Linked Lists-Operations-Insertion,
Deletion, Searching, Concatenation of singly linked lists, Circularly linked lists-Operations for
Circularly linked lists, Doubly Linked Lists- Operations Insertion, Deletion, Searching.
Unit- II (8 Contact Hours)
Stack ADT, definition, operations, array and linked implementations in C, applications-infix to
postfix conversion, Postfix expression evaluation, Queue ADT, definition and operations, array and
linked Implementations in C, Circular Queues-Insertion and deletion operations.
Unit- III (9 Contact hours)
Sorting-Insertion Sort, Selection Sort, Merge Sort, Quick sort, Comparison of Sorting methods and
linear sorting algorithms-Counting sort, Radix sort, shell sort.
Searching – Linear Search, Binary Search, Basic Concepts- Hashing Methods- Collision
Resolutions- Open Addressing- Linked List Collision Resolution.
Unit- IV (6 Contact Hours)
Trees – Terminology, Representation of Trees, Binary tree ADT, Properties of Binary Trees, Binary
Tree Representations-array and linked representations, Binary Tree traversals, Max Priority Queue
ADT-implementation-Max Heap-Definition, Insertion into a Max Heap, Deletion from a Max Heap,
Min-Heap-Operations on Min-Heap.
Unit- V (9 Contact Hours)
Search Trees-Binary Search Trees, Definition, Operations- Searching, Insertion and Deletion,
AVL Trees- Definition and operations on AVL Tree, B-Tree.
Unit- VI (6 Contact Hours)
Graphs – Introduction, Definition, Terminology, Graph ADT, Graph Representations- Adjacency
matrix, Adjacency lists, Graph traversals – DFS and BFS. Applications of DFS and BFS.

Text Books:
1. R. Thareja “Data Structures using C” , Oxford University Press.
2. M. A. Weiss “Data structures and Algorithm Analysis in C “ , 2nd edition, Pearson.
References:
1. Narsimha Karumanchi “Data Structures and Algorithms made easy in C”, 2nd Edition, Career
Monk Publications.
2. Allen Weiss, “Data Structures and Algorithms Analysis in C”, Pearson, 2nd Edition
Web Resources:
1. Indian Institute of Technology, Madras , “Programming and Data Structures”, URL:
https://nptel.ac.in/courses/106106130/
2. Indian Institute of Technology, Delhi, ‘Data Structures and
Algorithms’, https://nptel.ac.in/courses/106102064/
Course Outcomes: At the end of the course, the student will be able to

CO 1 Learn how to use data structure concepts for realistic problems.

Able to use linear and non-linear data structures like stacks, queues , linked list
CO 2 etc.
Ability to identify appropriate data structure for solving computing problems in
CO 3 respective language.
Ability to implement algorithms for the creation, insertion, deletion, searching,
CO 4 and sorting of each data structure.
CO 5 To build the different Hight balanced trees and perform the basic operations

Assessment Method
Assessment Weekly tests Monthly tests End Semester Test Total
Tool
Weightage (%) 10% 30% 60% 100%

***********************************************************************

Course Code Course Name Course Category L-T-P Credits

23CSXX94 Advanced PCC 0-0-3 1.5

Programming Lab
(CE Only)

Course Objectives:
1. To develop skills to design and analyze simple linear and non-linear data structures
2. To strengthen the ability to identify and apply the suitable data structures for the given real-
world problem
3. To gain knowledge in practical applications of data structures.
List of Experiments:
1. Write a C program that uses functions to perform the following:
a) Create a singly linked list of integers.
b) Delete a given integer from the above linked list.
c) Display the contents of the above list after deletion.
2. Write a C program that uses functions to perform the following:
a) Create a doubly linked list of integers.
b) Delete a given integer from the above doubly linked list.
c) Display the contents of the above list after deletion.
3. Write a C program implement the Stack ADT using Arrays and Linked List.
4. Write a C program that uses stack operations to convert a given infix expression into its postfix
equivalent.
5. Write a C program that evaluates a postfix expression.
6. Write C program to implement queue ADT using array and doubly linked list.
7. a) Write C program to implement priority queue ADT using array.
b) Write C program to implement circular queue ADT using array.
8. Write C program for implementing the following sorting methods:
a) Insertion sort b) Merge sort
9. Write C program for implementing the following sorting methods:
a) Quick sort b) Selection sort
10. Write a C program that uses functions to perform the following:
a) Create a Binary Search Tree (BST).
b) Insert data in BST
c) Traverse the above BST recursively in Postorder.
11. Write a C program that uses functions to perform the following:
a) Deletion an element BST
b) Traverse the above BST non recursively in Inorder.
12. Write a C program to implement the concept of simple hashing.
13.Write C program for implementing Depth first traversal and Breadth first traversal.

Assessment Method
Assessment Experiments Report/Viva-Voce/
Total
Tool Quiz/MCQ/Lab project
Weightage (%) 25% 15% 40%

Course Nature Practical

Assessment Method
Assessment Tool Experiment Record Viva-Voce/ Total
s Quiz/MCQ/Lab project
Weightage (%) 25% 5% 10% 40%
End Semester Examination weightage (%) 60%

*********************************************************

B.Tech Syllabus-Final Copy Witth All Years - 12th Jan 2021
No ratings yet
B.Tech Syllabus-Final Copy Witth All Years - 12th Jan 2021
228 pages
Annexure III - CSE - Final Copy Witth All Years - 3rd Feb 2021-Converted (1) - 1
No ratings yet
Annexure III - CSE - Final Copy Witth All Years - 3rd Feb 2021-Converted (1) - 1
164 pages
Cse Ay20-21
No ratings yet
Cse Ay20-21
12 pages
Cse R 18
No ratings yet
Cse R 18
13 pages
Course Structure AND Detailed Syllabus: For Computer Science and Engineering
No ratings yet
Course Structure AND Detailed Syllabus: For Computer Science and Engineering
14 pages
Ug r20 It Course Structure and Syllabus
No ratings yet
Ug r20 It Course Structure and Syllabus
292 pages
Annexure V B.tech Computer Science and Engineering
No ratings yet
Annexure V B.tech Computer Science and Engineering
143 pages
New CSE SYLLUBUS
No ratings yet
New CSE SYLLUBUS
52 pages
SNU Computer Science
No ratings yet
SNU Computer Science
35 pages
Cse Ug R 21
No ratings yet
Cse Ug R 21
254 pages
B.Tech Syllabi - Branch-CSE, 2022 Regulations
No ratings yet
B.Tech Syllabi - Branch-CSE, 2022 Regulations
76 pages
SVUCE BTech CSE R2018 Syllabus
No ratings yet
SVUCE BTech CSE R2018 Syllabus
78 pages
r20 Cse With Honors and Minors Final 22-10-2021
No ratings yet
r20 Cse With Honors and Minors Final 22-10-2021
258 pages
3rd Sem Syllabus
No ratings yet
3rd Sem Syllabus
141 pages
cse-ug-r-23
No ratings yet
cse-ug-r-23
168 pages
B.Tech - CSE in Artificial Intelligence Curriculum Syllabus
No ratings yet
B.Tech - CSE in Artificial Intelligence Curriculum Syllabus
113 pages
B Tech Computer Science Syllabus-71
No ratings yet
B Tech Computer Science Syllabus-71
8 pages
R20 Syllabus
No ratings yet
R20 Syllabus
159 pages
Year Schedule
No ratings yet
Year Schedule
9 pages
UG-comp-SY-24-25
No ratings yet
UG-comp-SY-24-25
93 pages
Bos Curriculum Rgukt Cse
No ratings yet
Bos Curriculum Rgukt Cse
260 pages
B.Tech CST R20
No ratings yet
B.Tech CST R20
212 pages
2018 2022 Computer Science Engeering
No ratings yet
2018 2022 Computer Science Engeering
125 pages
Syllabi CSE2023
No ratings yet
Syllabi CSE2023
64 pages
4_09-14-2022_11-28-07_IT%20Syllabus%20updated
No ratings yet
4_09-14-2022_11-28-07_IT%20Syllabus%20updated
198 pages
2018 2022 Computer Science and System Engineering
No ratings yet
2018 2022 Computer Science and System Engineering
123 pages
CSE tech hub
No ratings yet
CSE tech hub
19 pages
CSE Curriculum 2020
No ratings yet
CSE Curriculum 2020
207 pages
UG Syllabus 2021-25
No ratings yet
UG Syllabus 2021-25
280 pages
BTech CSE Batch 2020-21
No ratings yet
BTech CSE Batch 2020-21
13 pages
Academic Regulations AND Syllabus MLR20: Computer Science & Engineering
No ratings yet
Academic Regulations AND Syllabus MLR20: Computer Science & Engineering
8 pages
BT-CSE
No ratings yet
BT-CSE
44 pages
Syllabus DU New
No ratings yet
Syllabus DU New
48 pages
CSE Teaching Scheme Syllabus Sem-III to VIII
No ratings yet
CSE Teaching Scheme Syllabus Sem-III to VIII
50 pages
1 Year Syllabus B.tec
No ratings yet
1 Year Syllabus B.tec
5 pages
r21 Ecs Curriculum Syllabus Mrinmoy Dutta
No ratings yet
r21 Ecs Curriculum Syllabus Mrinmoy Dutta
209 pages
B.Tech. Degree in Computer Science and Engineering
No ratings yet
B.Tech. Degree in Computer Science and Engineering
171 pages
BT Cse
No ratings yet
BT Cse
51 pages
CSE Course Structure
No ratings yet
CSE Course Structure
16 pages
5282syllabus (NEP2020) CSE
No ratings yet
5282syllabus (NEP2020) CSE
109 pages
Final Updated on 22.10.24 SS GD R22(Final) B.E Curriculum & Syllabi
No ratings yet
Final Updated on 22.10.24 SS GD R22(Final) B.E Curriculum & Syllabi
219 pages
2018 2022 Information Technology
No ratings yet
2018 2022 Information Technology
121 pages
Bca Preamble
No ratings yet
Bca Preamble
6 pages
B. Tech ICT Booklet V4
No ratings yet
B. Tech ICT Booklet V4
66 pages
BT Cse Ai
No ratings yet
BT Cse Ai
50 pages
Courses of Study
No ratings yet
Courses of Study
229 pages
5 CS
No ratings yet
5 CS
82 pages
IT Course Structure Final Compressed
No ratings yet
IT Course Structure Final Compressed
257 pages
BTech - CSE Syllabus
No ratings yet
BTech - CSE Syllabus
179 pages
Department of Computer Engineering
No ratings yet
Department of Computer Engineering
79 pages
BSC Subjects Cs
No ratings yet
BSC Subjects Cs
119 pages
IT B. Tech Syllabus - Applicable From 2019
No ratings yet
IT B. Tech Syllabus - Applicable From 2019
153 pages
SVCE CSE R20 Course Structure
No ratings yet
SVCE CSE R20 Course Structure
11 pages
BSCS - F18 To Onwards HEC Computer-Science 2017
No ratings yet
BSCS - F18 To Onwards HEC Computer-Science 2017
5 pages
B.Tech-CSE-2022-23-Course-Structure (1)
No ratings yet
B.Tech-CSE-2022-23-Course-Structure (1)
6 pages
Scheme of Studies BS Computer Science PDF
No ratings yet
Scheme of Studies BS Computer Science PDF
66 pages
B.E.CSE-Syllabus-2018-2019 (2)
No ratings yet
B.E.CSE-Syllabus-2018-2019 (2)
179 pages
Updated R21 CSE Curriculumn Syllabus
No ratings yet
Updated R21 CSE Curriculumn Syllabus
208 pages
B.tech CSE 21-22 Syllabus POs COs
No ratings yet
B.tech CSE 21-22 Syllabus POs COs
178 pages
Python for AI: Applying Machine Learning in Everyday Projects
From Everand
Python for AI: Applying Machine Learning in Everyday Projects
Robert Johnson
No ratings yet
Manual de Funcionamiento
No ratings yet
Manual de Funcionamiento
68 pages
C Primer Plus 4th ed Edition Stephen Prata 2024 scribd download
100% (14)
C Primer Plus 4th ed Edition Stephen Prata 2024 scribd download
60 pages
PPS Unit1
No ratings yet
PPS Unit1
40 pages
(Ebook) Oracle Database Transactions and Locking Revealed: Building High Performance Through Concurrency by Darl Kuhn; Thomas Kyte ISBN 9781484264256, 1484264258 2024 Scribd Download
100% (4)
(Ebook) Oracle Database Transactions and Locking Revealed: Building High Performance Through Concurrency by Darl Kuhn; Thomas Kyte ISBN 9781484264256, 1484264258 2024 Scribd Download
65 pages
4th Sem VB NET 2022
No ratings yet
4th Sem VB NET 2022
50 pages
2021 ITT205
No ratings yet
2021 ITT205
10 pages
Chapter 2 Computer Programming Fresh Man
No ratings yet
Chapter 2 Computer Programming Fresh Man
75 pages
C Programming Lecture Plan
No ratings yet
C Programming Lecture Plan
4 pages
Ge8151 Unit Ii
No ratings yet
Ge8151 Unit Ii
34 pages
Assignment Title: "Buffer Overflow Attacks and Mitigations"
No ratings yet
Assignment Title: "Buffer Overflow Attacks and Mitigations"
17 pages
Data Structure - Algorithm Analysis
No ratings yet
Data Structure - Algorithm Analysis
36 pages
CSC304 Week 1 Slides
No ratings yet
CSC304 Week 1 Slides
44 pages
Unit II
No ratings yet
Unit II
136 pages
Coal 9
No ratings yet
Coal 9
9 pages
Python Asyncio
No ratings yet
Python Asyncio
141 pages
R20 DBMS LAB MANUAL MASTER COPY
No ratings yet
R20 DBMS LAB MANUAL MASTER COPY
64 pages
Cse2009 Coa M2
No ratings yet
Cse2009 Coa M2
59 pages
Mini Max User Manual v3.03
No ratings yet
Mini Max User Manual v3.03
110 pages
1.2.1 ppt
No ratings yet
1.2.1 ppt
7 pages
B.Tech CSE (AI)-R23
No ratings yet
B.Tech CSE (AI)-R23
99 pages
introduction to Modular Programming
No ratings yet
introduction to Modular Programming
2 pages
PWC Unit-1 Part-2 (Basics of Programming)
No ratings yet
PWC Unit-1 Part-2 (Basics of Programming)
44 pages
Test Bank
No ratings yet
Test Bank
16 pages
Unit-2 Fundamentals of C
No ratings yet
Unit-2 Fundamentals of C
62 pages
CP1 - Unit 8 - Input Statements
No ratings yet
CP1 - Unit 8 - Input Statements
11 pages
Modern Fortran: Building Efficient Parallel Applications 1st Edition Milan Curcic 2024 Scribd Download
100% (3)
Modern Fortran: Building Efficient Parallel Applications 1st Edition Milan Curcic 2024 Scribd Download
62 pages
CModel Sets
No ratings yet
CModel Sets
85 pages
Oracle Application Express Developer (APEX)
No ratings yet
Oracle Application Express Developer (APEX)
11 pages
300+ TOP Computer Organization & Architecture MCQs and Answers 2023
No ratings yet
300+ TOP Computer Organization & Architecture MCQs and Answers 2023
41 pages
Object Oriented Programming Using C++ Notes
No ratings yet
Object Oriented Programming Using C++ Notes
76 pages

Uploaded by

Uploaded by

B.

TECH COURSE IN COMPUTER SCIENCE AND ENGINEERING

(FOR THE STUDENTS ADMITTED IN 2023-24)

DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING

D. Course code and definition, Abbreviations

S.No Category Credits

NAME OF DEPARTMENT CODE

ENGINEERING FIRST YEAR: SEMESTER-1

Sl. Course Course Hours per week

1 BSC 23MA1102 Calculus & Linear Algebra 3 1 0 4

Basic Electrical and Electronics

Problem Solving and

Engineering Graphics and

Basic Electrical and Electronics

Problem Solving and

8 MC 23HS1102 Indian Constitution 2 0 0 0

ENGINEERING FIRST YEAR:SEMESTER-2

ENGINEERING SECOND YEAR: SEMESTER-1

2 ESC 23EC2110 Digital Logic Design 3 0 0 3

4 PCC 23CS2102 Database Management Systems 3 0 0 3

Formal Languages & Automata

ENGINEERING SECOND YEAR:SEMESTER-2

ENGINEERING THIRD YEAR:SEMESTER-1

ENGINEERING THIRD YEAR:SEMESTER-2

ENGINEERING THIRD YEAR:SUMMER SEMESTER

ENGINEERING FOURTH YEAR:SEMESTER-1

ENGINEERING FIRST YEAR: SEMESTER-I

Course code Course

Course Learning Objectives: The objective of this course is to

Unit – I (10 Contact Hours)

Unit - II (12 Contact Hours)

Unit-V (10 Contact Hours)

Unit - VI (10 Contact Hours)

CO 1 Solve first order differential equations.

Course Learning Objectives

Unit-II (7 Contact Hours)

Unit-III (9 Contact Hours)

UNIT-V (9 Contact Hours)

UNIT-VI (7 Contact Hours)

CO 1 Predict the behaviour of any electrical and magnetic circuits.

Course Learning Objectives:

UNIT – I (10 Contact Hours)

UNIT-II (10 Contact Hours)

UNIT – IV (12 Contact Hours)

UNIT – V (10 Contact Hours)

UNIT – VI (10 Contact Hours)

CO 1 Develop flowcharts, algorithms for given complex problems.

Course Code Course Name Course Category L-T-P Credits

23ME1214 Engineering Graphics & Computer Drafting ESC 1-0-3 2.5

Course Learning Objectives:

Unit - I (6 Contact Hours)

Unit - II (6 Contact Hours)

Unit - III (7 Contact Hours)

Unit - IV (5 Contact Hours)

Unit - V (6 Contact Hours)

Unit – VI (6 Contact Hours)

CO 1 Student will be aware of International and national standards of practice.

UNIT-I: (06 Contact Hours)

1. Non – Detailed Text Book: Panorama – A Course on Reading published by Oxford

Develop the ability to collect materials on various socio-economic-technological issues

CO 4 Improving listening skills

CO 5 Inculcate speaking as a behaviour by repeated practice and exposure

Internal Assessment (40 Marks) External Assessment (60 Marks)

Attendance – 10 Marks Writing – 30 Marks

Course Code Course Name Course Category L-T-P Credits

Section A: Computer Hardware and software installation:

Section B: Electrical Engineering Laboratory:

Section C: Electronics Engineering Laboratory:

CO 8 Experimental analysis of electrical machines likes motors, generators etc

Assessment Tool Experiments Report/Viva-Voce/ Quiz/MCQ/Lab project Total

Course Code Course Name Course Category L-T-P Credits

Course Learning Objectives:

List of Programming Assignments for Laboratory:

Statements, Expressions & Conditionals

Iterative Constructs – II: Nested Loops

Single Dimensional Arrays: Basic Operations and Problems

Two Dimensional Arrays –Matrices & its operations

File Handling – Create, Read and Write operations on File