Annexure II

Course Curriculum for

B Tech in Computer Science
and Engineering
Computer Science and Engineering Department

NATIONAL INSTITUTE OF TECHNOLOGY

DELHI
(An autonomous Institute under the aegis of Ministry of
Education, Govt. of India.)
 Department of Computer Science and Engineering
National Institute of Technology Delhi

About the Department

The Computer Science and Engineering Department was started in 2010 along with the
foundation of NIT Delhi. Initially, only the Bachelor of Technology Programme was
offered with the intake 30 which presently has been increased to 60. Now, apart from B.
Tech., the department also offers Master of Technology (CSE & Analytics), and Ph.D.
program which cover a number of important areas of Computer Science and Engineering. The
department provides the students with a broad undergraduate and graduate curriculum, based
on the application and theoretical foundations of computer science. The departmental
faculties and students participate in interdisciplinary research. The department envisions
producing quality graduates, capable of leading the world in the technical realm. The
department is equipped with the latest configuration and high computing system with hi-
speed Internet facilities. The Computer Science Program at this institute are dedicated to
educate students and to advance research in computer and information technology. The
department has all the facilities to carry out the related teaching and research work.

VISION
To communicate quality Computer Science Education for producing globally
identifiable skilled technocrats and entrepreneurs upholding sound ethics, profound
knowledge, and innovative ideas to meet industrial and societal expectations.

MISSION

M1 To impart value-based technical knowledge and skill relevant to Computer

Science and Engineering through effective pedagogies and hands-on experience
on the latest tools and technologies to maximize employability.
M2 To strengthen multifaceted competence, nurture creativity, and
innovation, and create entrepreneurial environment for an ever-changing
technological scenario requiring communally cognizant solutions.
M3 To create an appetite for research, and higher education in contemporary, and
emerging areas of Computer Science.
M4 To inculcate the moral, ethical, and social ideals essential for prosperous nation-
building.

PROGRAM EDUCATIONAL OBJECTIVES (PEOs)

PEO1 Graduates are prepared to be employed in IT industries and be engaged in

continuous learning, understanding, and applying innovative ideas while
maintaining strong ethical standards.
PEO2 Graduates are prepared to pursue higher studies and continue to develop their
professional knowledge.
PEO3 Graduates are equipped to do research in areas of specialization and the allied
fields.
 PEO4 Graduates are prepared to meet the changing needs of society through
knowledge-based service, exhibit leadership qualities with demonstrable
attributes in lifelong learning and become successful entrepreneurs.

PROGRAM SPECIFIC OUTCOMES (PSOs)

PSO1 Ability to analyze, develop and design new tools and approaches to createcutting-
edge solutions for Industry.
PSO2 Ability to carry out research and education in trans-disciplinary fields to solvethe
problems of national as well as international significance.

B. Tech. (Computer Science and Engineering)

Programme Framework

● Minimum Credits requirements for completion of BTech program is 160

● The Curriculum is based on the guidelines of National Education Policy(NEP)–
2020
● The curriculum has embedded the Multi Exit/ Multi Entry in the BTech program
● There is provision of Major degree and Minor Degree for students
● The curriculum is designed to meet the prevailing and ongoing industrial
requirements
● The curriculum includes Project based Education with Projects every year
● The curriculum is flexible and offers Choice Based Credit System (CBCS)
● The curriculum inherits the Value based Edu cation and offers
Interdisciplinary/Multidisciplinary Courses
● The Curriculum offers Digital Pedagogy & Flipped Learning with adequate
motivation for Entrepreneurship/ Startups
● The curriculum aims at the Holistic Development of the students
● In the proposed UG scheme, the department of CSE is proposing followingspecializations:
1. Artificial Intelligence and Machine Learning (Bucket 1)
2. Data Science (Bucket 2)
3. Information Security (Bucket 3)
4. Computer Systems (Bucket 4)
5. Networks and Distributed Systems (Bucket 5)

● Total 7 electives are proposed in the complete UG program, among them at least 5
electives are required from a bucket to get the specialization (with the respective bucket)
with [Link] in Computer Science and Engineering
 ● Students can attend 2 MOOC/NPTEL/any online courses (as per department list) among
the proposed 7 electives and the evaluation will be done by the Department as per
Academic Calendar and prevailing norms
● Students can do any number of courses from the other IITs/NITs/or any other CFTI
institutes. There will be the provision of credit transfer as per NIT Delhi norms
● If any student from the other branch will do 4 courses (16 credits) and one project (2
credits), then the student will be awarded the minor degree in Computer Science and
Engineering with the respective bucket specialization. The project should be
approved by the department of CSE Hence, in a minor degree a student should
complete 18 credits other than the desired credits of his/her major degree

Cardinal Mentions

✔ The students can exit after completing 1st Year, 2nd Year and 3rd Year from the program
and will be awarded Certificate, Diploma and Advanced Diploma in Computer Science
and Engineering respectively. A minimum Credit requirement for Certificate is 40
Credits, Diploma is 80 Credits and Advanced Diploma is 120 Credits respectively.

✔ The other branches students can opt for Minor Degree in Computer Science and
Engineering across any specialization offered by the department from 5th Semester
onwards by obtaining 18 credits from Computer Science and Engineering (16 credits in
course work and 02 credits in projects) from the respective specializations.

Semester wise Credit Structure

Credits
Sl. Courses Total
1st Year 2nd Year 3rd Year 4th Year
N
o. 1st 2nd 3rd 4th 5th 6th 7th 8th
Sem Sem Sem Sem Sem Sem Sem Sem
1 Programme Core 8 13 12 12 16 7 0 0 68
(PC)
2 Programme
0 0 0 0 4 8 16 0 28
Electives (PE)
3 Open Electives (OE) 0 0 0 0 0 3 0 0 3
4 Applied Sciences 4 4 4 0 0 0 0 0 12
(AS)
5 Humanities (HM) 4 0 0 3 0 0 3 0 10
6 Summer Training,
Independent 0 2 0 1 0 2 1 20 26
Study & Project (ST-
IS-PR)
7 Allied Engineering 4 1 4 4 0 0 0 0 13
(AE)
Total 20 20 20 20 20 20 20 20 160
Credits Distribution

Credits Distribution (%)

 Course Scheme
Year First Semester Second Semester
Sub Code Subject Name L T P C Sub Code Subject Name L T P C
Problem Solving & Computer
CSBB 101 Programming 3 0 2 4 CSBB 151 Data Structures 3 0 2 4
CSBB 102 Introduction to Computer Systems 3 0 2 4 CSLB 152 Discrete Structures 3 1 0 4
MALB 101 Advanced Calculus 3 1 0 4 CSLB 153 System Programming 3 1 0 4
Ist Theory and Practices of Human
HMBB 101 2 0 2 3 MALB 152 Applied Linear Algebra 3 1 0 4
Ethics
MEBB 162 Engineering Visualization 3 0 2 4 CSPB 154 Introduction to Hardware 0 0 2 1
HMPB 102 Communication Skills 0 0 2 1 CEPB 121 Nature and Care 0 0 2 1
EAPB 101 Extra Academic Activity - - - - CSPB 100 Project I 0 0 4 2
Total 20 Total 20
Third Semester Fourth Semester
Computer Architecture and
CSBB 202 Design and Analysis of Algorithms 3 0 2 4 CSBB 251 3 0 2 4
Organization
CSBB 203 Operating System 3 0 2 4 CSBB 252 Artificial Intelligence 3 0 2 4
IInd CSBB 204 Database Management Systems 3 0 2 4 CSBB 254 Software Engineering 3 0 2 4
MALB 202 Probability and Statistics 3 1 0 4 HMBB 251 Professional Communication 2 0 2 3
ECBB 206 Digital Electronics and Logic Design 3 0 2 4 ECBB 254 Communication Systems 3 0 2 4
CSPB 200 Project II 0 0 2 1
Total 20 Total 20
 Fifth Semester Sixth Semester
Sub Code Subject Name L T P C Sub Code Subject Name L T P C
CSBB 301 Computer Networks 3 0 2 4 CSBB 351 Compiler Design 3 0 2 4
CSLB 302 Theory of Computation 3 1 0 4 CSBB 352 Theory of App Development 2 0 2 3
CSBB 303 Data Mining 3 0 2 4 XXXB XXX Open Elective 3 0 0 3
Elective 2[Select in Set 2 from
CSBB 304 Quantum Computing 3 0 2 4 CSXB XXX 3 0/1 2/0 4
the respective specialization]
IIIrd Elective 1 [Select in Set 1 from the Elective 3[Select in Set 2 from
CSXB XXX 3 0/1 2/0 4 CSXB XXX 3 0/1 2/0 4
respective specialization] the respective specialization]
CSPB 300 Project III 0 0 4 2
Credit will be
Internship (during summer
CSPB 301 given in next
break)
Semester
Total 20 Total 20
Seventh Semester Eighth Semester
B. Tech Project (Internship
Elective 4 [Select in Set 3 from the
CSXB XXX 3 0/1 2/0 4 CSPB 400 inside NIT Delhi / Outside - - - 16
respective specialization]
NIT Delhi)
Elective 5 [Select in Set 3 from the
CSXB XXX respective specialization] 3 0/1 2/0 4 CSPB 401 Mooc Course 3 0 0 3
Elective 6 [Select in Set 3 from the
IVth CSXB XXX 3 0/1 2/0 4 CSPB 402 Seminar 0 0 2 1
respective specialization]
Elective 7 [Select in Set 3 from the
CSXB XXX 3 0/1 2/0 4
respective specialization]
HMLB 401 Management Principles and Practices 3 0 0 3
Internship (completed in last summer
CSPB 301 - - - 1
break)
Total 20 Total 20
 Bucket 1 of Elective Courses [Specialization in Artificial Intelligence and Machine Learning]
Set-1
Sub Code Subject Name L T P C Sub Code Subject Name L T P C
CSBB 311 Machine Learning 3 0 2 4 CSBB 312 Pattern Recognition 3 0 2 4
CSBB 313 Digital Image Processing 3 0 2 4 CSBB 314 Computer Vision 3 0 2 4
CSLB 315 Optimization Techniques 3 1 0 4 CSBB 405 Fuzzy Logic and Applications 3 0 2 4
CSBB 406 Cloud Computing 3 0 2 4
Set-2
Sub Code Subject Name L T P C Sub Code Subject Name L T P C
CSBB 314 Computer Vision 3 0 2 4 CSLB 315 Optimization Techniques 3 1 0 4
CSBB 316 Information Storage & Retrieval 3 0 2 4 CSBB 317 Soft Computing 3 0 2 4
CSBB 405 Fuzzy Logic and Applications 3 0 2 4 CSBB 407 Natural Language Processing 3 0 2 4
Reinforcement Learning and
CSBB 408 3 0 2 4 CSBB 409 Social Network Analysis 3 0 2 4
Applications
CSBB 412 Motion Analytics 3 0 2 4 CSBB 415 Motion Planning for Robotics 3 0 2 4
CSBB 424 Deep Learning and Applications 3 0 2 4
Set-3
Sub Code Subject Name L T P C Sub Code Subject Name L T P C
CSBB 405 Fuzzy Logic and Applications 3 0 2 4 CSBB 406 Cloud Computing 3 0 2 4
Reinforcement Learning and
CSBB 407 Natural Language Processing 3 0 2 4 CSBB 408 Applications 3 0 2 4
CSBB 409 Social Network Analysis 3 0 2 4 CSBB 412 Motion Analytics 3 0 2 4
Introduction to Cognitive
CSBB 413 3 0 2 4 CSLB 414 Game Theory 3 1 0 4
Computing
Deep Learning and
CSBB 415 Motion Planning for Robotics 3 0 2 4 CSBB 424 3 0 2 4
Applications
 Bucket-2 [Specialization in Data Science]
Set-1
Sub Code Subject Name L T P C Sub Code Subject Name L T P C
CSBB 311 Machine Learning 3 0 2 4 CSLB 315 Optimization Techniques 3 1 0 4
Mathematical Foundation of Data
CSLB 321 3 1 0 4
Science
Set-2
Sub Code Subject Name L T P C Sub Code Subject Name L T P C
CSBB 314 Computer Vision 3 0 2 4 CSLB 315 Optimization Techniques 3 1 0 4
CSBB 323 Data Handling & Visualization 3 0 2 4 CSBB 325 Time Series Analysis 3 0 2 4
CSBB 326 Distributed System 3 0 2 4 CSBB 406 Cloud Computing 3 0 2 4
CSBB 409 Social Network Analysis 3 0 2 4 CSBB 421 Internet of Things 3 0 2 4
Deep Learning and
CSBB 422 Big Data Analytics 3 0 2 4 CSBB 424 3 0 2 4
Applications
Set-3
Sub Code Subject Name L T P C Sub Code Subject Name L T P C
CSBB 314 Computer Vision 3 0 2 4 CSBB 406 Cloud Computing 3 0 2 4
CSBB 409 Social Network Analysis 3 0 2 4 CSLB 414 Game Theory 3 1 0 4
CSBB 421 Internet of Things 3 0 2 4 CSBB 422 Big Data Analytics 3 0 2 4
Information Security and
CSBB 424 Deep Learning and Applications 3 0 2 4 CSBB 425 Privacy 3 0 2 4
CSBB 426 Business Intelligence and Analytics 3 0 2 4 CSBB 427 Advanced Databases 3 0 2 4
 Bucket 3 [Specialization in Information Security]
Set-1
Sub Code Subject Name L T P C Sub Code Subject Name L T P C
Cryptography and Computer
CSBB 331 Network and Data Security 3 0 2 4 CSBB 333 3 0 2 4
Security
CSBB 335 Information Security 3 0 2 4 CSBB 436 Block chain Technology 3 0 2 4
Set-2
Sub Code Subject Name L T P C Sub Code Subject Name L T P C
CSBB 333 Cryptography and Computer Security 3 0 2 4 CSBB 335 Information Security 3 0 2 4
Database and Online Social Media
CSBB 439 Security 3 0 2 4
Set-3
Sub Code Subject Name L T P C Sub Code Subject Name L T P C
Database and Online Social
CSBB 436 Block chain Technology 3 0 2 4 CSBB 439 3 0 2 4
Media Security
S CSBB 440 Introduction to Cyber Security 3 0 2 4 CSBB 444 Software Security 3 0 2 4
 Bucket 4 of Elective Courses [Specialization in Computer Systems]
Set-1
Sub Code Subject Name L T P C Sub Code Subject Name L T P C
CSBB 341 Advanced Computer Networks 3 0 2 4 CSBB 343 Computer Graphics 3 0 2 4
CSBB 344 Object Oriented Programming 3 0 2 4 CSBB 427 Advanced Databases 3 0 2 4
Set-2
Sub Code Subject Name L T P C Sub Code Subject Name L T P C
CSLB 315 Optimization Techniques 3 1 0 4 CSBB 326 Distributed Systems 3 0 2 4
CSBB 346 Parallel Algorithms 3 0 2 4 CSLB 348 Randomized Algorithms 3 1 0 4
CSBB 406 Cloud Computing 3 0 2 4
Set-3
Sub Code Subject Name L T P C Sub Code Subject Name L T P C
CSLB 315 Optimization Techniques 3 1 0 4 CSBB 406 Cloud Computing 3 0 2 4
CSBB 452 Advanced Operating Systems 3 0 2 4 CSLB 454 Computational Complexity 3 1 0 4
CSBB 456 Real Time Systems 3 0 2 4
 Bucket 5 of Elective Courses [Specialization in Networks and Distributed Systems]
Set-1
Sub Code Subject Name L T P C Sub Code Subject Name L T P C
CSBB 406 Cloud Computing 3 0 2 4 CSBB 410 Wireless Sensor Networks 3 0 2 4
Set-2
Sub Code Subject Name L T P C Sub Code Subject Name L T P C
CSLB 315 Optimization Techniques 3 1 0 4 CSLB 353 Queuing Theory 3 1 0 4
CSBB 354 Mobile Computing 3 0 2 4 CSBB 326 Distributed Systems 3 0 2 4
CSBB 356 Network and Wireless Security 3 0 2 4 CSBB 357 High Performance Computing 3 0 2 4
CSBB 358 Information Theory and Coding 3 0 2 4
Set-3
Sub Code Subject Name L T P C Sub Code Subject Name L T P C
CSBB 341 Advanced Computer Networks 3 0 2 4 CSBB 352 Optical Networks 3 0 2 4
CSBB 411 Distributed Databases 3 0 2 4 CSLB 414 Game Theory 3 1 0 4
CSBB 472 Next Generation Networks 3 0 2 4

List of new courses introduced in the scheme

Sub Code Subject Name L T P C

CSBB 415 Motion Planning for Robotics 3 0 2 4
CSBB 411 Distributed Databases 3 0 2 4
Course PC PE OE AS HM ST-IS-PR AE
Code: (YES/ (YES/ (YES/ (YES/ (YES/ (YES/NO) (YES/
CSBB 101 NO) NO) NO) NO) NO) NO)
YES NO NO NO NO NO NO
Type of Program Core
course
Course Title PROBLEM SOLVING AND COMPUTER PROGRAMMING
Course 1. To understand the computational model of Computer.
Objectives: 2. To understand the concepts of C programming.
3. To apply functions of C programming for solving problems.
4. To understand the concept of file management in C.

Course CO1: Understand the basics of computer and various L1, L2

Outcomes problemsolving approaches.
CO2: Understand the fundamentals of C programming. L1, L2
CO3: Apply functions, arrays, and structures for solving problem. L2, L3, L4
CO4: Understand the use of pointers and file management in C. L2, L3
Semester Autumn: Yes Spring:
I Lecture Tutorial Practical Credits Total
teachin
g
hours
Contact Hours 3 0 2 4 36
Prerequisite course code as
perproposed course numbers
Prerequisite credits
Equivalent course codes as
per proposed course and old
course
Overlap course codes as per
proposed course numbers

Text Books:
1 Title Programming in ANSI C
Author E. Balagurusamy
Publisher TATA McGraw Hil1
Edition 6 edition, 2012
Reference Book:
1 Title Let Us C
Author Yashwant Kanetkar
Publisher Infinity Science Press
Edition 13th edition, 2012
2 Title Schaum's Outline of Programming with C
Author Byron S Gottfried
Publisher TATA McGraw Hill
Edition 2 d edition, 1996
 3 Title The C Programming Language
Author Brian Kernighan & Dennis Ritchie
Publisher Prentice Hal
Edition 2nd edition, 1988
Content Unit 1
Introduction to Computers: Hardware and Software. Basic Model of Computation
Notion of Algorithms, Flowcharts, Top down design, Bottom-up approaches of
problem solving, Number system.

Unit 2
Introduction to programming language, Basics of C, Basic Data types - int, float
double, char, Bool, Void. Arithmetic and logical operators: precedence and
association. Flow of Control Conditional statements- If-else, Switch-case constructs,
Loops- While, do-while, for.

Unit 3
Function - User defined functions, library functions, Parameter passing call by value,
call by reference, recursion.

Unit 4
Arrays- Advantages and drawbacks, One dimensional, Multi-Dimensional Arrays
and strings: Declaration, initialization, Accessing, Passing arrays and strings as
parameters to functions. Pointers, Dynamic memory allocation, Dynamic arrays- One
dimensional, Multidimensional dynamic array.

Unit 5
Structure: Declaration, Initialization, passing structure to function, Use of pointers in
structures. Preprocessors, Macros, File management in C 1/0 - Opening closing and|
editing files. Correctness & Efficiency Issues in Programming, Time & Space
measures.
Course Continuous Evaluation 25%
Assessment Mid Semester 25%
End Semester 50%
Course Matrix (CO-PO-PSO Mapping)

COs POs & PSOs

PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2

CO1 3 1
CO2 2 1 1 2 2
CO3 3 2 2 2 2 1 2 2
CO4 3 2 2 2 2 2 2
 1=addressed to small extent
2= addressed significantly
3= addressed strongly (major part of course)

Lab Experiments:

Exp. No. List of Experiments

1 Familiarization of Linux environment - How to do Programming in C with Linux.
2 Familiarization of console VO and operators in C.
a. Display "Hello World"
b. Read two numbers, add them and display their sum
c. Read the radius of a circle, calculate its area and display it
d. Evaluate the arithmetic expression ((a -b/c *d+ e) * (f +g)) and display
solution. Read the values of the variables from the user through console.
3 Write a program to
a. Calculate simple and compound interest.
b. Find the roots of quadratic equation.
4 Write a program to swap values of two variables with and without using third
variable.
5 Write a program to find the largest of three numbers with and without ternary
Operators.
6 Write a program to input name, marks of 5 subjects of a student and display the
name of the student, the total marks scored, percentage scored and the class of
result.
7 Read a Natural Number and check whether the number is
a. prime or not
b. Armstrong or not
C. even or odd.
8 Write a program to compute grade of students using if else adder. The grades
are assigned as followed:
Marks Grade
marks<50 F
50 marks< 60 C
60 marks<70 B
70 marks<80 B+
80 marks<90 A
90 marks<100 A+
9 Write a program to check whether the entered year is leap year or not (a year is
leap if it is divisible by 4 and divisible by 100 or 400).
10 Write a program to find whether a character is consonant or vowel using switch
statement.
11 Find the factorial of a given Natural Number n using recursive and non-recursive
functions.
12 Compute sum of the elements stored in an array using pointers and user defined
function.
Course PC PE OE AS HM ST- AE (YES/ NO)
Code: (YES/ (YES/ (YES/ (YES/ (YES/ IS-
CSBB 102 NO) NO) NO) NO) NO) PR
(YES
/NO)
YES NO NO NO NO NO NO
Type of Program Core
course
Course Title INTRODUCTION TO COMPUTER SYSTEMS
Course 1. To understand the role and functions of a computer system.
Objectives: 2. To understand the memory hierarchy, and role of operating system along with
system software.
3. To understand number systems, Boolean logic, and analyze logic gates
through experiments.
4. To understand the importance of data communication, and computer
networks.

Course CO1: Understand the basic data types of High Level Languages L1, L2
Outcomes that are stored and processed by Computer Systems.
CO2: Understand the dynamic behavior of memory organization, L2, L3, L4
operating systems and the system software used in software
development.
CO3: Apply the concept of number systems, Logic gates and L3, L4, L5
Boolean Algebra through programming experiments.
CO4: Explain the basic mechanisms involved in data L1, L2
communication, and computer networking.
Semester Autumn: Yes Spring:
I Lecture Tutorial Practical Credits Total
teaching
hours
Contact Hours 3 0 2 4 36
Prerequisite course code as per
proposed course numbers
Prerequisite credits
Equivalent course codes as per
proposed course and old
course
Overlap course codes as per
proposed course numbers
Text Books:
1 Title Computer Systems: A Programmer's Perspective
Author Randal Bryant, David O'Hallaron
Publisher Pearson
Edition 3rd edition, 2015
Reference Book:
1 Title Computer Fundamentals
 Author Anita Goel
Publisher Pearson
Edition 1st edition, 2010
2 Title Computer Fundamentals And Programming In C
Author Reema Thareja
Publisher Oxford University Press
Edition Second edition, 2016
3 Title Fundamentals of Computers
Author E Balagurusamy
Publisher McGraw Hill Education
Edition
Content Unit 1
Introduction to Computers: Digital and Analog Computers; Characteristics of
Computer; Evolution of Computers; Generations of Computer; Classification of
Computer, Input and Output devices.

Unit 2
Computer Memory: Introduction, Memory Representation, Memory Hierarchy, CPU
Registers, Impact of Cache Memory on System Performance, Programming
Language and Program Development.

Unit 3
Computer Software: Introduction, Types of Software, System Software, Application
Software, Operating System (Introduction, Objectives of Operating System, Types of
OS, Functions of OS, Protection and Security, User Interface, Examples of Operating
Systems).

Unit 4
Data Representation: Introduction, Number System, Conversion from Decimal to
Binary, Octal, Hexadecimal, Conversion of Binary, Octal, Hexadecimal to Decimal,
Conversion of Binary to Octal, Hexadecimal, Conversion of Octal, Hexadecimal to
Binary, Boolean Logic, Logic Gates.

Unit 5
Data Communication and Computer Network: Introduction, Importance of
Networking, Data Transmission Media, Data Transmission across Media, Data
Transmission and Data Networking, Computer Network, Network Types, Network
Topology, Communication Protocol, Network Devices, Wireless Networking.

Course Continuous Evaluation 25%

Assessment Mid Semester 25%
End Semester 50%
Course Matrix (CO-PO-PSO Mapping)

COs POs & PSOs

PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2

CO1 3 1
CO2 2 1 1 2 2
CO3 3 2 2 2 2 1 2 2
CO4 3 2 2 2 2 2 2

1=addressed to small extent

2= addressed significantly
3= addressed strongly (major part of course)

Lab Experiments:

Exp. No. List of Experiments

1 To identify front panel, indicator, and switches along with rear side connection in
a computer system.
2 To familiarize with a computer system layout and mark the position of
motherboard, HDD, CD/DVD drives, and add on cards.
3 To create a document about describing about yourself using MS-WORD.
4 To create, open, rename, copy and delete the files in command prompt.
5 To execute external commands in MS-DOS.
6 To write a C program for converting a binary number to its decimal equivalent.
7 To write a C program for converting a decimal number to its binary equivalent.
8 To implement basic logic gates using C programming.
9 To implement universal gates using C programming.
10 To implement special gates XOR, XNOR using C programming.
Course Code: PC PE OE AS HM ST-IS-PR AE (YES/
CSBB 151 (YE (YE (YE (YE (YES/ (YES/NO) NO)
S/ S/ S/ S/ NO)
NO) NO) NO) NO)
YES NO NO NO NO NO NO
Type of course Program Core
Course Title DATA STRUCTURES
Course This course demonstrates familiarity with major algorithms and data
Objectives: structures and analyzes performance of algorithms. It is used to choose the
appropriate data structure and algorithm design method for a specified
application and determine which algorithm or data structure to use in
different scenarios
Course CO1: Explain the fundamentals of data structures and L1
Outcomes algorithms
CO2: Build data structures for a given problem L2
CO3: Illustrate applications and use of tree data structures L3
CO4: Compare algorithms for graph data structures L4
CO5: Compare the basic algorithmic techniques and L5
choose a suitable one for a given problem
CO6: Develop algorithms using various searching and L6
sorting techniques
Semester Autumn: Spring: YES
II Lecture Tutorial Practical Credits Total teaching hours
Contact Hours 3 0 2 4 36
Prerequisite course code as NIL
per proposed course numbers
Prerequisite credits NIL

Equivalent course codes as NIL

per proposed course and old
course
Overlap course codes as per NIL
proposed course numbers

Text Books:
1 Title Fundamentals of Data Structures
Author E. Horowitz, S. Sahni
Publisher Computer Science Press
Edition 2nd Edition, 2008

Reference Book:
1 Title Data Structures Using C
Author A. M. Tanenbaum, Y. Langsam, M. J. Augenstein
 Publisher Pearson Education
Edition 1990

2 Title Data Structures Using C

Author E. Balagurusamy
Publisher TATA McGraw Hill
Edition 2013

3 Title Data Structure and Program Design

Author R.L. Kruse
Publisher Prentice Hall
Edition 2nd Edition, 1996
Content Unit – 1
Introduction: Dynamic aspects of operations on data, Characteristics of data
structures, Creation and manipulation of data structures, Operations on data
structures, Types of data structures – linear and nonlinear. Introduction to
algorithm: Asymptotic notations, Analysis of algorithms: Time and Space
complexity.

Unit – 2
Arrays: Dynamic memory allocation, one-dimensional arrays, multidimensional
arrays, operations on arrays, storage – Row major order, Column major order.
Linked lists: types of linked lists – singly, doubly and circularly linked
lists, operations on linked lists.

Unit – 3
Stacks: Implementation of stacks– array and linked list, operations on stacks,
Applications of Stacks, Notations – infix, prefix and postfix, Conversion and
evaluation of arithmetic expressions using Stacks. Queues: Implementation of
queues– array and linked list, operations on queues, Types of queues – queue,
double ended queue and priority queue.

Unit – 4
Trees: Binary tree, Binary search tree, Threaded binary tree, Height balanced
trees, Tries, Heaps, Hash tables. Graph traversals: Breadth First Search, Depth
First Search, Shortest path: Depth first search in directed and undirected graphs.
Union-find data structure and applications. Directed acyclic graphs; topological
sort.

Unit – 5
Searching: Linear search, Binary search and Hashing. Algorithms and data
structures for sorting: Insertion Sort, Bubble sort, Selection Sort, Merge sort,
Quick Sort, Heap sort, Radix sort, Bucket sort. Algorithm design
techniques: Divide and conquer, Greedy approach, dynamic programming.
Course Continuous Evaluation 25%
Assessme Mid Semester 25%
nt End Semester 50%
Course Matrix (CO-PO-PSO Mapping)

COs POs & PSOs

PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2
CO1 2 2 2 3 2 2 3 1 1 2 2 3
CO2 3 2 2 3 3 2 2 1 1 2 2 3
CO3 3 3 2 2 3
CO4 3 2 1 2 3
CO5 2 2 3 3 2 3 1 1 2 2 3
CO6 3 3 3 2 2 3 1 1 2 2 3

1=addressed to small extent

2= addressed significantly
3= addressed strongly (major part of course)

Lab Experiments:

Exp. No. List of Experiments

1. Write a Program in C to Implement Stacks Using Arrays and Linked Lists

2. Write a Program in C to Implement Queues Using Arrays and Linked Lists

3. Write a program that uses functions to perform the following operations on singly
linked list i) Creation ii) Insertion iii) Deletion iv) Traversal
4. Write a program that uses functions to perform the following operations on
doubly linked list i) Creation ii) Insertion iii) Deletion iv) Traversal.
5. Write a program that uses functions to perform the following operations on
circular linked List i) Creation ii) Insertion iii) Deletion iv) Traversal
6. Write a program that uses both recursive and non recursive functions to perform
the following searching operations for a Key value in a given list of integers: a)
Linear search b) Binary search
7. Write a program that implements the following sorting i) Bubble sort ii) Selection
sort iii)Quick sort.
8. Write a program that implements the following i) Insertion sort ii) Merge sort
iii)Heap sort.
9. Write a program to perform the following operations: a) Insert an element into a
binary search tree. b) Delete an element from a binary search tree. c) Search for a
key element in a binary search tree
10. Write a program to implement the tree traversal methods
Course Code: PC PE OE AS HM (YES/ ST- AE (YES/
CSLB 152 (YES (YES (YES (YES NO) IS- NO)
/ NO) / NO) / NO) / NO) PR
(YES
/NO)
YES NO NO NO NO NO NO
Type of course Program Core
Course Title DISCRETE MATHEMATICS
Course The purpose of this course is to understand and use discrete mathematics
Objectives: which is the backbone of computer science. In this course the students will
learn various ways for describing sets, i.e., logic and proofs, identify
induction hypotheses and prove elementary properties of modular
arithmetic, and apply graph theory models of data structures to solve
problems of connectivity and constraint satisfaction.

Course CO1: Illustrate the basics of discrete mathematics and

Outcomes: predicate calculus
CO2: Explain set theory and relations.
CO3: Demonstrate the concepts of graph theory and
experiment with trees to solve problems like
minimum spanning tree and tree traversals.
CO4: Develop the concept of functions and recursive
function theory
CO5: Illustrate different algebraic structures
Semester Autumn: Spring: Yes
II Lecture Tutori Practical Credits Total teaching
al hours
Contact Hours 3 1 0 4 36
Prerequisite course code as NIL
per proposed course
numbers
Prerequisite credits NIL
Equivalent course codes as NIL
per proposed course and old
course
Overlap course codes as per NIL
proposed course numbers
Text Books:
1 Title Discrete Mathematics and applications
Author [Link]
Publisher TataMcGraw Hill

Edition fifth edition 2003

Reference Book:
2 Title Elements of Discrete Mathematics
Author [Link]
Publish McGraw-Hill Book
er Company.
 Edition Second edition 1985
3 Title Discrete Mathematics for Computer Scientists and
Mathematicians
Author J .[Link], [Link], T.P .Baker
Publisher Prentice Hall of India
Edition Second edition 1986
4 Title Logic and Discrete Mathematics
Author [Link] and [Link]
Publisher Pearson
Edition 1995
Content Unit – 1 (5 Hours)
Mathematical reasoning; propositions; negation disjunction and
conjunction; implication and equivalence; truth tables; predicates;
quantifiers; natural deduction; rules of Inference; methods of proofs; use
in program proving; resolution principle.

Unit-2 (10 Hours)

Set theory; Paradoxes in set theory; inductive definition of sets and proof
by induction; Peono postulates; Relations; representation of relations by
graphs; properties of relations;equivalence relations and partitions;
Partial orderings; Posets; Linear and well-ordered sets

Unit – 3 (7 Hours)
Graph Theory; elements of graph theory, Euler graph, Hamiltonian path,
trees, tree traversals, spanning trees.

Unit – 4 (7 Hours)
Functions; mappings; injection and surjections; composition of
functions; inverse functions;special functions; Peono postulates;
pigeonhole principle; recursive function theory.

Unit – 5 (7 Hours)
Definition and elementary properties of groups, semigroups, monoids,
rings, fields, vector spaces and lattices. Elementary combinatorics;
counting techniques; recurrence relation; generating functions.

Course Continuous Evaluation 25%

Assessment Mid Semester 25%
End Semester 50%
Course Matrix (CO-PO Mapping)

COs POs
PO PO PO PO PO PO PO PO PO PO PO11 PO12 PSO1 PSO2
1 2 3 4 5 6 7 8 9 10
CO1 3 2 2 3
CO2 3 3 3 2 3 3 2
CO3 3 3 3 3 3 3 3 3 3
CO4 3 2 3 2 2 3 3
CO5 2 2 2 2 2 2 3

1=addressed to small extent

2= addressed significantly
3= addressed strongly (major part of course)
Course PC PE OE AS HM ST-IS-PR AE
Code: (YES (YES (YES (YES (YES/ (YES/NO) (YES/
CSLB 153 / NO) / NO) / NO) / NO) NO)
NO)
YES NO NO NO NO NO NO
Type of Program Core
course
Course Title SYSTEM PROGRAMMING
Course This course introduces basic understanding of the concepts of
Objectives: System Programming. Understanding of the Design, write, and test moderately
complicated low-level programs using a systems programming language. Implement
routines that read and write structured binary files such as word processing
documents, index systems, or serialized hierarchical data. Understanding the
various methods of Linkers and Loaders, interpreters and debugging methods to
manage system memory.

Course CO1: Apply the knowledge of assembler and L4, L2

Outcomes: macro processors to convert assembly languageinto machine code.
CO2: Analyse working phases of Compiler toundertake meaningful L6, L3
language translation.
CO3: Evaluate Linkers, Loaders, Interpreters and debugging methods L5
to manage system memory and provide a portable runtime
environment.

CO4: Analyse the working of an operatingsystem and its components. L6, L2

Semester Autumn: Spring: Yes
Lecture Tutorial Practi Credits Total
cal teachi
ng
Hours
Contact 3 1 0 4 36
Hours
Prerequis
ite course
code as
per
proposed
course
numbers
Prerequisite NIL
credits
Equivalent NIL
course
codes as
per
propos
ed
course
andold
course
Overlap NIL
course
codes as per
proposed
course
numbers
Text Books:

1 Title Systems Programming,

Author Donovan John J.,
Publisher New York, Tata Mc-Graw Hill
Edition 2014
2 Title Introduction to Systems Software,
Author Dhamdhere, D.M.,
Publisher Tata Mc-Graw Hill
Edition 1996
Reference Book:
1 Title Principles of compiler Design
Author Aho A.V. and J.D. Ullman
Publisher Addison Wesley/Narosa
Edition
2 Title System Software- An Introduction to System
Programming
Author L.L. Beck
Publisher Addition Wesley
Edition 3rd edition, 1996
Content Unit – 1
Introduction: Evolution of the Components of a Programming
System, Evolution of Operating Systems, Machine Structure,
Machine Language and Assembly Language.

Unit – 2
Assemblers: Design of Assembler, Table Processing: searching
and sorting, Macro Language and the Macro Processor: Macro
Instructions, Features of Macro facility, Implementation.

Unit – 3
Linkers and Loaders: Concept of linking, Case study of Linker
in x86 machines, various loading schemes, Design of an
absolute loader, Design of a direct-linking loader.

Unit – 4
Compilers: Statement of problem, Phases of the complier, Data
structures, Recursion, Call and Return statements, Storage
Classes-Use implementation, Block structure, Nonlocal GoTo’s,
Interrupts, Pointers.
Debuggers: Introduction to various debugging techniques, Case
Study: - Debugging in Turbo C++ IDE.

Unit – 5
Operating System: I/O programming, Memory management,
Processor management, Device management, Information
management.
 Course Assessment Continuous Evaluation 25%
Mid Semester 25%
End Semester 50%

Course Matrix (CO-PO-PSO Mapping)

COs Pos

PO PO PO PO PO PO PO PO PO PO PO11 PO12 PSO1 PSO2

1 2 3 4 5 6 7 8 9 10
CO1 3 3 - - - - - - - - - - 3 -
CO2 3 3 2 3 - - - - - - - - 3 -
CO3 3 3 - 3 - - - - - - - - 3 3
CO4 2 2 3 3 - - - - - - - - 2 3

1=addressed to small extent

2= addressed significantly
3= addressed strongly (major part of course)
Course Code: PC PE OE AS HM ST-IS-PR AE
CSPB 154 (YES (YES (YE (Y (YES/ (YES/NO) (YES/
/ NO) / NO) S/ ES NO) NO)
NO /
) N
O)
YES NO NO NO NO NO NO
Type of Program Core
course
Course Title INTRODUCTION TO HARDWARE
Course • To impact the knowledge of various hardware components of a computer.
Objectives: • To provide the skill of assembling the computer.
• To impart the knowledge of various electronics components.

Course CO1: Identify various hardware components of a system. L1

Outcomes:

CO2: To assemble the computer. L2

CO3: To test various electronic components using Digital Multimeter. L1

Semester Autumn: Spring: Yes

II Lecture Tutorial Practic Credits Tota
al l
teac
hing
Hours
Contact 0 0 2 1 36
Hours
Prerequisit NIL
e course
code asper
proposed
course
numbers
Prerequisite NIL
credits
Equivalent NIL
course codes
as
per
propose
d course
andold
course
Overlap NIL
course codes
as per
proposed
course
numbers
Course Continuous Evaluation 25%
Assessment Mid Semester 25%
End Semester 50%
Course Matrix (CO-PO Mapping)

COs POs
PO PO PO PO PO PO PO PO PO PO PO11 PO12 PSO1 PSO2
1 2 3 4 5 6 7 8 9 10
CO1 1 1 2 1 1 1
CO2 1 1 2 1 1 1 1
CO3 2 1 2 1 1 1

1=addressed to small extent

2= addressed significantly
3= addressed strongly (major part of course)

Lab Experiments:

Exp. No. List of Experiments

1 To study the history of a Computer System.
2 Study of CPU
3 Study of RAM
4 Study of Processor
5 History of HDD and CDROM
6 Testing of Electronics components using a Digital Multimeter
7 Study of Motherboard

8 Simulation of electric circuit using any electric circuit simulator.

9 Study of peripheral devices I (Input- Keyboard, Mouse)
10 Study of peripheral devices II (Output- Printer, Monitor, Scanner)
Course Code: PC PE OE AS HM (YES/ ST- AE (YES/
CSBB 202 (YES (YES (YES (YES NO) IS- NO)
/ NO) / NO) / NO) / NO) PR
(YES
/NO)
YES NO NO NO NO NO NO
Type of course Program Core
Course Title DESIGN AND ANALYSIS OF ALGORITHMS
Course ● To develop an understanding of the fundamental concepts of
Objectives: algorithms and data structures, including time and space
complexity analysis.
● To learn various techniques for designing efficient algorithms,
such as divide-and-conquer, greedy algorithms, dynamic
programming, and graph algorithms.
● To learn how to use randomized algorithms, approximation
algorithms, and NP-completeness to solve real-world problems
and to evaluate the practical efficiency of algorithms.
● To gain exposure to current research and developments in the
field of algorithm design and analysis and to understand their
practical implications.
Course CO1: Analyze the asymptotic time and space L4, L2
Outcomes: complexity of algorithms, and understand the
trade-off between these complexities.
CO2: Design and implement algorithms for solving L6, L3
various computational problems, using techniques
such as divide-and-conquer, greedy algorithms,
dynamic programming, and graph algorithms.
CO3: Use randomized algorithms, approximation L5
algorithms, and NP-completeness to solve
real-world problems and to evaluate the practical
efficiency of algorithms.
CO4: Develop strong problem-solving skills and a L6, L2
deep understanding of the principles of algorithm
design and analysis.
Semester Autumn: Yes Spring:
III Lecture Tutoria Practical Credits Total teaching
l hours
Contact Hours 3 0 2 4 36
Prerequisite course code as NIL
per proposed course
numbers
Prerequisite credits NIL
Equivalent course codes as NIL
per proposed course and old
course
Overlap course codes as per NIL
proposed course numbers
Text Books:
1 Title Introduction to Algorithms
Author Cormen, Leiserson, Rivest
 Publisher Prentice Hall of India
Edition 3rd Edition 2010
Reference Book:
1 Title Fundamental of Computer algorithms.
Author Horowitz and Sahani
Publisher Universities Press
Edition Second edition 2008
2 Title Computer Algorithms : Introduction to Design
andAnalysis
Author Sara Baase and Allen Van Gelder
Publisher Pearson Education
Edition 3rd Edition 1999
3 Title Fundamental of Algorithms
Author Brassard Bratley
Publisher PHI
Edition 1st Edition 1996
4 Title Algorithms Design
Author M T Goodrich et. al.
Publisher John Wiley
Edition
5 Title The Design and analysis of Algorithms
Author A V Aho et al
Publishe Pearson Education
r
Edition 1st Edition 2002
7 Title Algorithm Design
Author Jon. Kleinberg and E Tardos
Publishe Pearson Education
r
Edition 1st Edition 2013
Content Unit – 1
Introduction: Algorithms, Analysis of Algorithms, Design of Algorithms,
Complexity of Algorithms, Asymptotic Notations, Growth of function,
Recurrences and their solution methods.
Sorting in polynomial Time: Insertion sort, Merge sort, Heap sort, and
Quick sort Sorting in Linear Time: Counting sort, Radix Sort, Bucket Sort,
Medians and order statistics.

Unit – 2
Advanced Data Structure: Red Black Trees, Augmenting Data Structure,
Binomial Heap, B-Tree, Fibonacci Heap, and Data Structure for Disjoint
Sets, All kinds of Algorithms on these data structures, Dictionaries and
priority Queues, mergeable heaps, concatenable queues.
 Unit – 3
Advanced Design and Analysis Techniques: Dynamic programming,
Greedy Algorithm, Backtracking, Branch-and-Bound, Amortized
Analysis.
Graph Algorithms: Elementary Graph Algorithms, Breadth First Search,
Depth First Search, Minimum Spanning Tree, Kruskal’s Algorithms,
Prim’s Algorithms, Single Source Shortest Path, All pair Shortest Path,
Maximum flow and Traveling Salesman Problem.

Unit – 4
Dynamic Programming: Chained matrix multiplication, longest common
subsequence. Divide and Conquer: Order Statistics – finding the median,
exponentiation, matrix multiplication, LCS. Computational Geometry:
Line segments, Optimal polygon triangulation. Approximate Algorithm:
Travelling Salesman Problem, vertex-cover problem.

Unit – 5
Primality testing, Integer factorization, Randomized algorithms,
Probabilistic algorithms. String Matching algorithms: Rabin Karp, KMP,
Boyer Moore. Introduction to problem classes – NP, NPC, NP-Hard.
Course Continuous Evaluation 25%
Assessment Mid Semester 25%
End Semester 50%

Course Matrix (CO-PO Mapping)

COs POs
PO PO PO PO PO PO PO PO PO PO PO11 PO12 PSO1 PSO2
1 2 3 4 5 6 7 8 9 10
CO1 3 2 2 3
CO2 3 3 3 2 3 2 2 3 2 3 3 2
CO3 3 3 3 3 3 3 3 3 3
CO4 3 2 3 2 2 3 3

1=addressed to small extent

2= addressed significantly
3= addressed strongly (major part of course)

Lab Experiments:

Exp. No. List of Experiments

1 Sort a given set of elements using the Quick sort method and determine the time
required to sort the elements. Repeat the experiment for different values of n, the
number of elements in the list to be sorted. The elements can be read from a file or
can be generated using the random number generator
2 Implement a Merge Sort algorithm to sort a given set of elements and determine
the time required to sort the elements. Repeat the experiment for different values
of n, the number of elements in the list to be sorted .The elements can be read
from a file or can be generated using the random number generator.
3 A) Obtain the Topological ordering of vertices in a given digraph. B) Compute the
transitive closure of a given directed graph using Warshall's algorithm
4 Implement 0/1 Knapsack problem using Dynamic Programming
5 From a given vertex in a weighted connected graph, find shortest paths to other
vertices using Dijikstra’s algorithm
6 Find Minimum Cost Spanning Tree of a given undirected graph using Kruskal’s
algorithm.
7 A) Print all the nodes reachable from a given starting node in a digraph using BFS
method. B) Check whether a given graph is connected or not using DFS method.
8 Find a subset of a given set S = {s1, s2,….., sN} of n positive integers whose sum
is equal to a given positive integer d. For example, if S= {1, 2, 5, 6, 8} and d = 9
there are two solutions {1,2,6}and{1,8}.A suitable message is to be displayed if
the given problem instance doesn't have a solution.
9 Implement any scheme to find the optimal solution for the Traveling Salesperson
problem and then solve the same problem instance using any approximation
algorithm and determine the error in the approximation.
10 Find Minimum Cost Spanning Tree of a given undirected graph using Prim’s
algorithm.
11 Implement All-Pairs Shortest Paths Problem using Floyd's algorithm.
12 Implement N Queen's problem using Back Tracking.
Course PC PE OE AS HM ST- AE (YES/ NO)
Code: (YES/ (YES/ (YES/ (YES/ (YES/ IS-
CSBB 203 NO) NO) NO) NO) NO) PR
(YES
/NO)
YES NO NO NO NO NO NO
Type of Program Core
course
Course OPERATING SYSTEM
Title
Course • To understand the role and functions of an operating system and its impact on
Objectives: the overall performance of a computer system.
• To understand the concepts and techniques involved in process
management, such as process creation, scheduling, interprocess
communication, and synchronization.
• To understand the concepts and techniques involved in memory
management, such as virtual memory, swapping, paging, and segmentation.
• To gain hands-on experience with the design and implementation of
operating systems through programming projects and case studies.
Course CO1: Understanding of the fundamental concepts, design principles, L2, L3
Outcomes and implementation techniques of modern operating systems
CO2: Ability to design, implement, and evaluate process L5, L6
management, memory management, file system management, and
input/output management algorithms
CO3: Ability to understand and implement distributed systems, such L2, L3, L4
as client-server systems, distributed file systems, and distributed
operating systems.
CO4: Hands-on experience with the design and implementation of L5, L6
operating systems through programming projects and case studies.
Semester Autumn: Yes Spring:
III Lecture Tutorial Practical Credits Total
teaching
hours
Contact Hours 3 0 2 4 36
Prerequisite course code as per
proposed course numbers
Prerequisite credits
Equivalent course codes as
per proposed course and old
course
Overlap course codes as per
proposed course numbers
Text Books:
1 Title Operating System Concepts
Author Abraham Silberschatz, Peter B. Galvin, Greg Gagne
Publisher Addison-Wesley
 Edition Sixth edition, 2003
Reference Book:
1 Title Modern Operating Systems
Author Andrew Tanenbaum
Publisher Prentice Hall
Edition
2 Title Operating Systems
Author William Stallings
Publisher Prentice Hall
Edition
3 Title An introduction to operating systems
Author Harvey M. Deitel
Publisher Addison-Wesley
Edition
4 Title Operating Systems: Design and Implementation
Author Andrew Tanenbaum & Albert Woodhull
Publisher Prentice-Hall
Edition
5 Title Operating System Design - The XINU Approach
Author Douglas Comer
Publisher Prentice-Hall
Edition
6 Title Fundamentals of Operating Systems
Author A.M. Lister
Publisher Macmillan
Edition 1979
Content Unit 1
Basics: Operating System Functionalities, Types of Operating
Systems, ComputerArchitecture support to Operating Systems.

Unit 2
Process Management: Threads, Process Scheduling - Uniprocessor
scheduling algorithms, Multiprocessor and Real-time scheduling
algorithms, Process Synchronization - Peterson's Solution, Bakery.
Algorithm, Hardware Support to Process Synchronization,
Semaphores, Critical Regions, Monitors - Deadlock prevention,
deadlock avoidance and Deadlock Detection and Recovery -
BankersAlgorithm,.

Unit 3
Memory Management: Segmentation and space allocation, Basics of
linking and loading, Demand Paging, Page replacement algorithms,
Analysis of page allocation policies, Thrashing- Working Set.
 Content
Unit 4
File Systems: Contiguous, Sequential and Indexed Allocation, File system interface,
File System implementation, Case study of Unix File system, Mounting and
Unmounting files systems, Network File systems.

Unit 5
I/O System: Disk Scheduling, Device drivers - block and character devices, streams,
Character and Block device switch tables. Protection and Security - Accessibility and
Capability Lists.

Course Continuous Evaluation 25%

Assessment Mid Semester 25%
End Semester 50%

Course Matrix (CO-PO-PSO Mapping)

COs POs & PSOs

PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2

CO1 3 1
CO2 2 1 1 2 2
CO3 3 2 2 2 2 1 2 2
CO4 3 2 2 2 2 2 2

1=addressed to small extent

2= addressed significantly
3= addressed strongly (major part of course)

Lab Experiments:

Exp. No. List of Experiments

1 Basic of Unix Commands
2 Implementation of Process Related System Calls (Fork).
3 Implementation of System Calls (Open, Read, Write and Close) for File
Managemen
4 Implementation of Process Synchronization
5 Implementation of Memory Management Using Address Translation
6 Implementation of FIFO Page Replacement Algorithms
7 Implementation of LRU Page Replacement Algorithms
8 Implementation of First Come First Serve and Shortest Job Fist Scheduling
Algorithm
9 Implementation of Priority and Round Robin CPU Scheduling Algorithm
10 Implementation of Banker’s Algorithm.
11 Implementation of Sleeping Barbar Problem in process synchronization
12 Implementation of Algorithm for Deadlock Detection
Course PC PE OE AS HM ST-IS-PR AE (YES/ NO)
Code: (YES/ (YES/ (YES/ (YES/ (YES/ (YES/NO)
CSBB 204 NO) NO) NO) NO) NO)
YES NO NO NO NO NO NO
Type of Program Core
course
Course Title DATABASE MANAGEMENT SYSTEMS
Course • To understand the role and functions of a database management system and its
Objectives impact on the overall performance of a computer system.
• To understand the concepts and techniques involved in ER modeling.
• To understand the SQL commands and relational algebraic expressions for query
processing.
• To gain hands-on experience with designing and implementing database
management systems through programming projects and case studies.

Course CO1: Learn the basic concepts of Database Systems L2

Outcomes CO2: Model the real-world systems using Entity Relationship Diagrams L3
and convert the ER model into a relational logical schema using various
mapping algorithms
CO3: Make use of SQL commands and relational algebraic expressions for L4
query processing
CO4: Simplify databases using normalization process based on identified L5
keys and functional dependencies and solve the atomicity, consistency,
isolation, durability, transaction, and concurrency related issues of
databases
Semester Autumn: Yes Spring
III Lecture Tutorial Practical Credits Total
teaching
hours
Contact Hours 3 0 2 4 36
Prerequisite course code as per
proposed course numbers
Prerequisite credits
Equivalent course codes as per
proposed course and old course
Overlap course codes as per
proposed course numbers
Text Books:
1 Title Fundamentals of Database Systems
Author R. Elmasri and S.B. Navathe
Publisher Pearson
Edition 2016
Reference Book:
1 Title Database Systems Concepts
Author [Link] and Silberschatz
Publisher McGraw Hill
Edition
2 Title Data Base Design
Author C.J. Date
Publisher Addison Wesley
Edition
3 Title DBM and Design
Author Hansen and Hansen
Publisher PHI
Edition
4 Title Database System
Author Hector Garcia-Molina, Jeff Ullman, and Jennifer Widom
Publisher Pearson
Edition 2nd Edition
Content Unit 1
Introduction - General introduction to database systems; Database - DBMS disctinction,
approaches to building a database, data models, database management system, three-
schema architecture of a database, challenges in building a DBMS, various components
of a DBMS.
Unit 2
Database design and ER Model:- Overview, ER-Model, Constraints, ER-Diagrams, ERD
Issues, weak entity sets, Codd’s rules, Relational Schemas, Introduction to UML
Relational database model: Logical view of data, keys, integrity rules. Relational
Database design: features of good relational database design, atomic domain and
Normalization (1NF, 2NF, 3NF, BCNF).
Unit 3
Relational algebra: introduction, Selection and projection, set operations, renaming,
Joins, Division, syntax, semantics. Operators, grouping and ungrouping, relational
comparison. Calculus: Tuple relational calculus, Domain relational Calculus, calculus vs
algebra, computational capabilities.
Unit 4
SQL - Introduction, data definition in SQL, table, and key and foreign key definitions,
update behaviors. Querying in SQL - basic select-from-where block and its semantics,
nested queries- correlated and uncorrelated, notion of aggregation, aggregation functions
group by and having clauses, embedded SQL. Data Storage and Indexes - file
organizations, primary, secondary index structures, various index structures - hash-
based, dynamic hashing techniques, multi-level indexes, and B+ trees.
Unit 5
Transaction management and Concurrency control: Transaction processing and Error
recovery - concepts of transaction processing, ACID properties, and serializability
concurrency control, Lock based concurrency control (2PL, Deadlocks), Time stamping
methods, optimistic methods, and database recovery management. Error recovery and
logging, undo, redo, undo-redo logging and recovery methods.
Course Continuous Evaluation 25%
Assessment
 Mid Semester 25%
End Semester 50%

Course Matrix (CO-PO-PSO Mapping)

COs POs & PSOs

PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2 PSO3

CO1 3 1
CO2 2 1 1 2 2 1
CO3 3 2 2 2 2 1 2 2
CO4 3 2 2 2 2 2 2

1=addressed to small extent

2= addressed significantly
3= addressed strongly (major part of course)

Lab Experiments:

Exp. No. List of Experiments

1 Library Management system (File Handling)
2 Introduction to SQL
● Installation of SQL-Server
● SQL data definition
● Constraints in SQL
● Schema change Statement

3 Basic SQL Queries

4 Complex SQL Queries-1
● Nested Queries
● Correlated Nested Queries
● EXISTS Function in SQL
● Aggregation Function

5 Complex SQL Queries-2

● Joined Tables
● Aggregate Functions

6 Complex SQL Queries-3

● Grouping
● EXISTS and UNIQUE functions
● Aggregate Functions
7 Entity-Relationship Diagram from Case Study
8 Normalization of the Case Study
9 Webpage Connectivity with SQL Server Using XAMPP- 1
10 Webpage Connectivity with SQL Server Using XAMPP- 2
11 Mini DBMS Project
12 Mini DBMS Project
Course Code: PC PE OE AS HM (YES/ ST-IS- AE (YES/ NO)
CSBB 251 (YES/ (YES/ (YES/ (YES/ NO) PR
NO) NO) NO) NO) (YES/N
O)
YES NO NO NO NO NO NO
Type of course Program Core
Course Title COMPUTER ARCHITECTURE AND ORGANIZATION
Course objectives: The purpose of this course is to have a thorough understanding of the basic
structure and operation of a digital computer. Students will learn the basic
operations involved in the execution of an instruction, interrupts and their
usage to implement I/O control and data transfers and identify the different
architectural design issues that can affect the performance of a computer such
as RISC architecture, instruction set design, and addressing modes.
POs CO1: Identify functional units and illustrate register L1
transfer operations.
CO2: Explain the internal organization of the computer L2
and its instructions.
CO3: Understand fixed and floating point algorithms and L3
apply micro program instructions.
CO4: Summarize the memory organization L2
and pipelining concepts.
Semester Autumn: Spring: Yes
IV Lecture Tutorial Practical Credi Total teaching
ts hours
Contact Hours 3 0 2 4 36
Prerequisite course code as
per proposed course numbers
Prerequisite credits
Equivalent course codes as
per proposed course and old
course
Overlap course codes as per
proposed course numbers
Text Books:
1 Title Computer Organization and Design - The
Hardware/Software Interface
Author D. A. Patterson and J. L. Hennessy
Publisher Morgan Kaufmann
Edition 2014
Reference Book:
1 Title Computer System Architecture
Author M. Morris Mano
Publisher Prentice Hall of India Pvt Ltd
Edition Third edition, 2002
2 Title Computer Organization and Architecture - Designing for
Performance
 Author W. Stallings
Publisher Prentice Hall of India
Edition 2002
3 Title Computer Organization
Author C. Hamacher, Z. Vranesic and S. Zaky
Publisher McGrawHill
Edition 2002
4. Title Computer Architecture and Organization
Author J .P. Hayes
Publisher McGraw-Hill
Edition 1998
Unit - 1
Introduction: Function and structure of a computer Functional components of a :
Function and structure of a computer, Functional components of a computer
Interconnection of components, Performance of a computer.

Unit -2
Representation of Instructions Representation of Instructions: Machine instructions,
Operands, Addressing : Machine instructions, Operands, Addressing modes, Instruction
formats, Instruction sets, Instruction set architectures - CISC and RISC architectures.

Unit - 3
Processing Unit: Organization of a processor - Registers, ALU and Control unit, Data
path in a CPU, Instruction cycle, Organization of a control unit - Operations of a control
unit, Hardwired control unit, Microprogrammed control unit.

Unit – 4
Memory Subsystem: Semiconductor memories, Memory cells - SRAM and DRAM
cells, Internal Organization of a memory chip, Organization of a memory unit, Error
correction memories, Interleaved memories, Cache memory unit - Concept of cache
memory, Mapping methods, Organization of a cache memory unit, Fetch and write
mechanisms, Memory management unit - Concept of virtual memory, Hardware support
for memory management.

Unit – 5
Input/Output Subsystem: Access of I/O devices, I/O ports, I/O control mechanisms -
Program controlled I/O Interrupt controlled I/O and DMA controlled I/O I/O interfaces
Program controlled I/O, Interrupt controlled I/O, and DMA controlled I/O, I/O interfaces
- Serial port, Parallel port, PCI bus, SCSI bus, USB bus, I/O peripherals - Input devices,
Output devices, Secondary storage devices.
Continuous Evaluation 25%
Mid Semester 25%
End Semester 50%
Course Matrix (CO-PO-PSO Mapping)
CO PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2

CO1 1 1 - 1 - - 1 - - - - - 3
CO2 2 1 - 1 - - 1 - - - - - 3 2
CO3 3 2 - 1 - - 2 - - - 2 - 3 3
CO4 3 2 - 1 - - 2 - - - 1 - 3

1=addressed to small extent

2= addressed significantly
3= addressed strongly (major part of course)

Lab Experiments:

Exp. No. List of Experiments

1 To study and verify the truth table of logic gates.
2 Implement Half Adder and Full Adder using basic logic gates.
3 To simplify the given expression and to realize it using Basic gates and Universal gates

4 Implement Gray-to-Binary and Binary-to-Gray code conversion.

5 To implement 4 x 1 and 8 x 1 multiplexers
6 Verify the excitation table of various Flip Flops
7 To Design an 8-bit Arithmetic Logical Unit.
8 Design the control unit of a computer using either handwriting or microprogramming
based on its register transfer language description.
9 To implement a simple instruction set computer with a control unit and a data path.
10 To design the data path of a computer from its register transfer language description.
Course PC PE OE AS HM ST-IS-PR AE (YES/ NO)
Code: (YES/ (YES/ (YES/ (YES/ (YES/ (YES/NO)
CSBB 252 NO) NO) NO) NO) NO)
YES NO NO NO NO NO NO
Type of Program Core
course
Course Title ARTIFICIAL INTELLIGENCE
Course Gain a comprehensive understanding of Artificial Intelligence, covering its historical
Objectives: development, problem-solving techniques, search strategies, logical reasoning, and
planning methods, with a focus on practical applications, particularly in the field of
robotics. Develop essential skills to tackle complex AI challenges effectively.

Course CO1: Understand the basic concepts of AI. L1, L2

Outcomes CO2: Apply search strategies to solve AI problems. L3
CO3: Apply knowledge representation and reasoning to solve real L3
world AI Problems.
CO4: Explore machine learning concepts and algorithms for real world L4
applications.
Semester Autumn: Spring: YES
IV Lecture Tutorial Practical Credits Total
teaching
hours
Contact Hours 3 0 2 4 36
Prerequisite course code as per
proposed course numbers
Prerequisite credits
Equivalent course codes as per
proposed course and old course
Overlap course codes as per
proposed course numbers
Text Books:
1 Title Artificial intelligence : A Modern Approach,
Author Stuart Russell, Peter Norvig
Publisher Prentice Hall
Edition Fourth edition, 2020.
Reference Book:
1 Title Artificial Intelligence: A New Synthesis
Author Nils J. Nilsson
Publisher Morgan-Kaufmann, 1998.
Edition
2 Title Heuristics: Intelligent Search Strategies for Computer
Problem Solving
 Author Judea Pearl
Publisher Addison-Wesley Publishing Company
Edition 1984
Content UNIT 1
Introduction, History, Possible Approaches in AI, Automated Problem Solving Agent:
Intelligent Agent & Environment, Complex Problems and AI, Shannon number, Problem
Representation in AI

UNIT 2
Search Strategies: Search introduction, Uninformed Search, Informed/Heuristic Search,
Beyond Classical Search, Local Search, Problem Reduction, Adversarial Search,
Constraint Satisfaction Problems

UNIT 3
Logic and Deduction: Logical Agents, Propositional logic and Predicate Logic,
Inferencing By Resolution Refutation
AI Planning: AI Planning, Robot introduction and types , Steps in Robot Motion
Planning, Graph-based Planning, Graph Construction Methods and path planning in
Configuration Space, Skeletonization, Collision Detection and Freespace Sampling,
Intruder Finding Problem, Probabilistic roadmaps(PRM)], Rapidly Exploring Random
Trees (RRT)

UNIT 4
Quantifying Uncertainty, Basic of Probability, Probabilistic Reasoning, Bayes Net,
Bayesian Network, Fuzzy Logic, Decisions Theory, Utility Function, Decision Network,
Markov Decision Process, Probabilistic Reasoning over time, Hidden Markov Model,
Kalman filter, Markov Chain Monte Carlo

UNIT 5
Reinforcement Learning, Learning Agent, Introduction to Machine Learning, Types of
Machine Learning, Learning from experience: Reinforcement Learning, Background,
Model based and Model free learning, TD and Q Learning, RL Applications, Learning
from Example, Supervised learning : Introduction, Naive Bayes, Decision Tree,
Perceptrons, Neural Network, Introduction to Deep Learning.

AI Applications and Ethics, Computer Vision and Robotics, natural language

understanding, AI in Healthcare, Ethics of AI

Course Continuous Evaluation 25%

Assessment Mid Semester 25%
End Semester 50%

Course Matrix (CO-PO-PSO Mapping)

COs POs & PSOs

PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2

CO1 3 2 2
CO2 2 3 3 3 3 3 3
CO3 2 2 3 3 3 3 3
CO4 2 2 3 3 3 3 3

1=addressed to small extent

2= addressed significantly
3= addressed strongly (major part of course)

Lab Experiments:

Exp. No. List of Experiments

1 Introduction to Prolog programming
2 Python Frameworks Tutorial (with Jupyter and Colab) and it’s Data Structures
3 Searching in graph based problem space, exploring Uninformed search Techniques
4 Exploring Informed search Techniques (Vacuum world and Maze Problem)
5 Exploring Uninformed and Informed search Techniques ( PACMAN Search Space)
6 Multi agent in a search space
7 Introduction Logical Agent and Knowledge representation using Prolog
8 Reasoning Under Uncertainty using Bayesian Learning
9 Reinforcement Learning using Q-Learning
10 Introduction to Machine Learning and Python libraries for Data Analysis (Pandas, NumPy,
Matplotlib)
Course Code: PC PE OE AS HM (YES/ ST-IS-PR AE (YES/
CSBB 254 (YE (YE (YE (YE NO) (YES/NO NO)
S/ S/ S/ S/ )
NO) NO) NO) NO)
YES NO NO NO NO NO NO
Type of course Program Core
Course Title SOFTWARE ENGINEERING
Course Objectives: The aim of the course is to provide an understanding of the working
knowledge of the techniques for estimation, design, testing and quality
management of large software development projects.
Topics include process models, software requirements, software design,
software testing, software process/product metrics, risk management,
quality management and UML diagrams
Course Outcomes: CO1: Analyze the basic knowledge in software engineering L4, L2
to learn the various software development process models.

CO2: Develop the standard models about the software L6, L3

product that is to be engineered and the processes that
provides a framework for the software engineering
methodologies.
CO3: Apply the knowledge of software engineering to L5
analyse the progress of the projects with the issues raised
and develop the process for software projects using real life
experiments.
CO4: Evaluate the software project processes and L6, L2
components of the projects to identify the risks, manage the
change to assure quality in software projects and also able to
see the risks with the help of real time projects
Semester Autumn: Spring: Yes
IV Lecture Tutorial Practical Credits Total
teaching
hours
Contact Hours 3 0 2 4 36
Prerequisite
course code as per
proposed course
numbers
Prerequisite NIL
credits
Equivalent course NIL
codes as per
proposed course
and old course
Overlap course NIL
codes as per
proposed course
numbers
Text Books:
1 Title Software Engineering, A practitioner’s Approach
Author Roger S. Pressman
Publisher Mc Graw Hill International Edition.
Edition 6th edition
2 Title Software Engineering
Author Sommerville
Publisher Pearson Education
Edition 7th edition
Reference Book:
1 Title Software Engineering, an Engineering approach
Author James F. Peters, Witold Pedrycz
Publisher John Wiley
Edition
2 Title Software Engineering principles and practice
Author Waman S Jawadekar,
Publisher The Mc Graw-Hill Companies.
Edition 2000
Content Unit – 1
Introduction: Definition of software and Software engineering, Need of
Software engineering, Difference between Program and Product, Software
development life cycle, Different life cycle models (waterfall, Iterative
waterfall, Prototype, Evolutionary, Incremental and Spiral model), Agile
software development and their characteristics, V-Model. Critical
Comparisons of SDLC models.

Unit – 2
Software Requirements: Functional and non-functional requirements,
user requirements, system requirements, interface specification, the software
requirements document.
Requirements engineering process: Feasibility studies, requirements
elicitation and analysis, requirements validation, requirements management.
System models: Context models, behavioral models, data models, object
models, structured methods.

Unit – 3
Software Design: Goals of good software design, Design strategies and
methodologies, Data oriented software design, Structured Design: Structure
chart, Coupling, Cohesion, Modular structure, Packaging, Object oriented
design, Topdown and bottom-up approach, Design patterns, Structured
Analysis: DFD, Data Dictionary, Software Measurement and Metrics:
Various Size Oriented Measures: Halstead's software science, Function
Point (FP) based measures, Cyclomatic Complexity Measures: Control flow
 graphs. Development: Selecting a language, Coding guidelines, Writing
code, Code documentation.

Unit – 4
Software Testing: Testing process, Design of test cases, Functional Testing:
Boundary value analysis, Equivalence class testing, Decision table testing,
Cause effect graphing, Structural testing, Path testing, Data flow and
mutation testing, Unit testing, Integration and system testing, Debugging,
Alpha & beta testing, testing tools & standards

Unit – 5
Software Maintenance: Management of maintenance, Maintenance
process, Maintenance models, Regression testing, Reverse engineering,
Software reengineering, Configuration management, documentation.
Quality Management: Quality concepts, software quality assurance,
software reviews, formal technical reviews, statistical software quality
assurance, software reliability, the ISO 9000 quality standards.
Current trends in Software Engineering: Software Engineering for
projects and products. Introduction to Web Engineering and Agile process
Course Continuous Evaluation 25%
Assessment Mid Semester 25%
End Semester 50%

Course Matrix (CO-PO-PSO Mapping)

COs POs

PO PO PO PO PO PO PO PO PO PO PO11 PO12 PSO1 PSO2

1 2 3 4 5 6 7 8 9 10
CO1 3 3 - - - - - - - - - - 3 -
CO2 3 3 2 3 - - - - - - - - 3 -
CO3 3 3 - 3 - - - - - - - - 3 3
CO4 2 2 3 3 - - - - - - - - 2 3

1=addressed to small extent

2= addressed significantly
3= addressed strongly (major part of course)

Lab Experiments:

Exp. List of Experiments

No.

1. INTRODUCTION TO RAPTOR
1) Find the roots of a quadratic equation.
2) Print all the numbers until the given number.
 3) Find the largest among the given three numbers.

2. 1) Find whether a number is prime.

2) Find the factorial of a given number.

3) Generate pyramid pattern.

4) Find the minimum and maximum element in an array.

3. To draw different levels of DFD.

4. To draw an ER diagram on UPS system.

5. To draw a

(a) Use case diagram of ATM system.

(b) Use case diagram of online shopping system
(c) UML diagram of credit card processing

6. Create a project of parking pass for students using ASANA software.

7. Create a project of purchasing MATLAB software using ASANA software.

8. To draw a Gantt chart and network diagram.

9. To draw a structured chart.

10. Development of design Document.

11. Development of SRS document.

12. To draw different levels of DFD.

13. To draw a sequence diagram and collaboration diagrams.

Course Code: PC PE OE AS HM (YES/ ST-IS-PR AE (YES/
CSBB 311 (YE (YE (YE (YE NO) (YES/NO NO)
S/ S/ S/ S/ )
NO) NO) NO) NO)
NO YES NO NO NO NO NO
Type of course Program Elective
Course Title MACHINE LEARNING
Course Objectives: With the increased availability of data from varied sources, there has
been increasing attention paid to the various data driven disciplines such
as analytics and machine learning. This course aims to provide students
with the knowledge of key concepts of machine learning from a
mathematically well motivated perspective. The course aims to
familiarize the students with the two broad categories of machine
learning algorithms supervised and unsupervised.
Course Outcomes: CO1: Learn the basics and mathematical background of L1, L2
Machine learning.
CO2: Data exploratory analysis before applying machine L2, L3
learning
CO3: Compare machine learning techniques L2, L3, L4
CO4: Apply Machine learning in real life applications. L4, L5, L6
Semester Autumn: Spring: Yes
Lecture Tutorial Practical Credits Total
teaching
hours
Contact Hours 3 0 2 4 36
Prerequisite NIL
course code as per
proposed course
numbers
Prerequisite NIL
credits
Equivalent course NIL
codes as per
proposed course
and old course
Overlap course NIL
codes as per
proposed course
numbers
Text Books:
1 Title Introduction to Machine Learning
Author Ethem ALPAYDIN
Publisher The MIT Press
Edition 2004
2 Title Pattern recognition and machine learning
Author Bishop, C. M.
Publisher New York: Springer
Edition 2007
Reference Book:
1 Title Machine Learning,
Author Tom Mitchel
Publisher McGraw Hill
Edition
2 Title Machine learning in action
Author Harrington, Peter.
Publisher Manning Publications Co
Edition 2002
Content Unit 1: Supervised Learning
Machine learning basics, Artificial Neural Network, Classifying with k
Nearest Neighbors, Splitting datasets one feature at a time: decision trees,
Classifying with probability theory: naive Bayes, Support vector machines,
Improving classification with the AdaBoost meta algorithm.

Unit 2: Unsupervised Learning

Grouping unlabeled items using k means clustering, Association analysis with
the Apriori algorithm, Efficiently finding frequent itemsets with FP growth.

Unit3: Reinforcement learning

Markov decision process (MDP), Bellman equations, Value iteration and
policy iteration, Linear quadratic regulation (LQR), Linear Quadratic
Gaussian (LQG), Q learning, Value function approximation, Policy search,
POMDPs.

Unit 4: Forecasting and Learning Theory

Predicting numeric values: regression, Logistic regression, Tree based
regression. Bias/variance tradeoff, Union and Chernoff/Hoeffding bounds,
Vapnik– Chervonenkis (VC) dimension, Worst case (online) learning,
Practical advice on how to use learning algorithms.

Unit 5: Additional Tools

Dimensionality reduction: Feature Extraction Principal component analysis to
simplify data, Simplifying data with the singular value decomposition,
Feature Selection – Ranking methods, subset selection – forward and
backward. Big Data and MapReduce
 Course Continuous Evaluation 25%
Assessment Mid Semester 25%
End Semester 50%

Course Matrix (CO-PO-PSO Mapping)

COs POs

PO PO PO PO PO PO PO PO PO PO PO11 PO12 PSO1 PSO2

1 2 3 4 5 6 7 8 9 10
CO1 3 2 1 2
CO2 2 3 2 3 3 3 2
CO3 2 2 2 3 3 3 3
CO4 2 2 3 3 3 3 3

1=addressed to small extent

2= addressed significantly
3= addressed strongly (major part of course)

Lab Experiments:

Exp List of Experiments

No.
1 Python Frameworks Tutorial (with Jupyter and Colab) and it’s Data Structures
2 Introduction to Python libraries for Data Analysis (Pandas, NumPy, Matplotlib)

3 Data Collection & Creation Using Web Scraping- Static and Dynamic Webpages

4 Exploratory Data Analytics and Feature Engineering

5 Regression Techniques: Linear and Logistic

6 Traditional Computational Techniques (Decision Tree, KNN)

7 Implementing Classifier with Probability Theory( naïve Bayes and Bayesian Networks)

8 Implementation of Perceptron for logic gates (AND, OR, NOT)

9 Implementing Support Vector Machine Classifier from scratch

10 Neural networks for Binary Classification

11 Introduction to Reinforcement Learning: Path finding bot problem

Course CODE: PC PE OE AS HM (YES/ ST-IS-PR AE
CSBB 313 (YE (YE (YE (YE NO) (YES/NO) (YES/
S/ S/ S/ S/ NO)
NO) NO) NO) NO)
NO YES NO NO NO NO NO
Type of course Program Elective
Course Title DIGITAL IMAGE PROCESSING
Course objectives: The course aims to cover techniques and tools for digital image
processing, image transformation in spatial and frequency domains.
It introduces image analysis techniques in the form of image
segmentation. The course also aims to cover the processing of
colored images. The course also aims to cover techniques and tools
for digital image processing and to provide hands-on experience in
applying these tools to process images. The students would be
encouraged to develop the image processing tools from scratch,
rather than using any image processing library functions. Students
will also get an opportunity to familiarize with image processing
platforms such as Open CV, MATLAB, etc.
Course Outcomes: CO1: Learn the basics and mathematical background L1, L3
of Machine learning
CO2: Data exploratory analysis before applying L2
machine learning
CO3: Utility of image compression techniques for L3, L5
storage and transmission purpose.
CO4: To learn about color imaging, color models, L4
and color image processing.
Semester Autumn: YES Spring: YES
Lecture Tutorial Practical Credits Total teaching
hours
Contact Hours 3 0 2 4 36
Prerequisite course code as NIL
per proposed course
numbers
Prerequisite credits NIL

Equivalent course codes as NIL

per proposed course and
old course
Overlap course codes as per NIL
proposed course numbers
Text Books:
1 Title Digital Image Processing
Author R.C. Gonzalez, R.E Woods
 Publisher Pearson Education
Edition 3rd Edition, 2008
Reference Book:
1 Title Digital Image Processing Using MATLAB
Author R.C. Gonzalez, R.E Woods, S. L. Eddins
Publisher PHI
Edition 2003
2 Title Image Processing, Analysis, and Machine Vision
Author M. Sonka, V. Hlavac, R. Boyle
Publisher Brooks/Cole
Edition 3rd edition, 2007
3 Title Digital Image Processing
Author W.K. Pratt
Publisher Wiley-Interscience
Edition 4th Edition, 2007
Content Unit-1
Introduction: Digital image representation, Fundamental steps in image
processing, Components of Digital Image processing systems, Elements of
visual perception, Image Formation model, Image Sampling and
quantization, Relationship between pixels – neighborhood, adjacency
connectivity, regions, boundaries and distance measures.

Unit-2
Image Enhancement: Enhancement by point processing, Sample intensity
transformation, Histogram processing, Image subtraction, Image averaging,
Spatial filtering- Smoothing Spatial filters, Sharpening Spatial filters,
Frequency domain- Fourier Transform, Low-Pass, High-Pass, Laplacian,
Homomorphic filtering.

Unit-3
Image Segmentation: Detection of discontinuities – point, line and edge
detection, Edge linking and boundary detection, Thresholding,
Region-based segmentation – region growing, region splitting and merging,
Use of motion in segmentation- Spatial techniques and Frequency domain
techniques.

Unit-4
Image Compression: Coding redundancy, Interpixel redundancy, fidelity
criteria, Image compression models, Error-free compression, Variable
length coding, Bit-plane coding, Lossless predictive coding, Lossy
compression, Image compression standards, Real-Time image transmission,
JPEG and MPEG.
 Unit-5
Color Image Processing: Color Models, Pseudo color Image Processing,
Color Transformations, Smoothing and sharpening, Image
Segmentation based on color.
Course ● Introduce the students to the fundamental techniques and
Outcomes algorithms used for acquiring, processing and extracting useful
information from digital images.
● Analysis and study of methods used for image sampling and
quantization, image transforms, image enhancement and
restoration, image encoding, image analysis and pattern
recognition
● Learn how to apply the methods to solve real world problems
in several areas including medical, remote sensing and
surveillance and develop the insight necessary to use the tools
of digital imageprocessing (DIP) to solve any new problem.
Course Continuous Evaluation 25%
Assessment Mid Semester 25%
End Semester 50%

Course Matrix (CO-PO-PSO Mapping)

COs POs & PSOs

PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2

CO1 3 1
CO2 2 1 1 2 2
CO3 3 2 2 2 2 1 2 2

1=addressed to small extent

2= addressed significantly
3= addressed strongly (major part of course)

Lab Experiments:

Exp. No. List of Experiments

1. Simulation and Display of an Image, Negative of an Image(Binary & Gray Scale)

2. Implementation of transformations namely, translation, rotation, scale and shear

3. Implementation of Histogram, and Histogram Equalization

4. Implementation of FFT(1-D & 2-D) of an image

5. Implementation of Image Compression by DCT

6. Implementation of Image Smoothening Filters(Mean and Median filtering of an

Image)
7. Implementation of image sharpening filters and Edge Detection using Gradient
Filters
8. Implementation of image restoring techniques

9. Implementation of image segmentation techniques

10. Program for morphological operation: erosion and dilation

Course Code: PC PE OE AS HM ST-IS-PR AE
CSLB 315 (YES/ (YES/ (YES/ (YES/ (YES/ (YES/NO) (YES/
NO) NO)
NO) NO) NO) NO)

NO YES NO NO NO NO NO
Type of Program Elective
course
Course Title OPTIMIZATION TECHNIQUES
Cour This course aims to cover the concepts of optimization methods and
se algorithms developed for solving various types of optimizationProblems.
obje To apply the mathematical results and numerical techniques of
ctive Optimization theory to various Engineering and Analytics problems.
s: Explain the theoretical workings of the graphical, simplex, and analytical
methods for making effective decision on variables so as to optimize the
objective function.

Course CO1: To understand the L1,L3

Outcomes: fundamentals of Linear Programmingand
Dynamic Programming.
CO2: Enumerate the fundamentals of L1,L2
Integer programming technique andapply
different techniques to solve various
optimization problems arisingfrom
engineering areas.
CO3: Identify appropriate L1,L2,L4
optimization methods to solve
complex problems involved in various
industries.
CO4: To understand the graphical, L2,L5
simplex, and analytical methods formaking
effective decisions.
Semester Autumn: YES Spring: YES
Lecture Tutorial Practical Credits Total
teaching
hours
Contact Hours 3 1 0 4 36
Prerequisite course NIL
code as per
proposed course
numbers
Prerequisite credits NIL
Equivalent course NIL
codes as per
proposed course
and old course
Overlap course NIL
codes as per
proposed course
Numbers
Text Books:
1 Title An Introduction to Optimization
Author Edwin K.P. Chong, Stanislaw H. Zak,
Publisher Wiley
Edition 4th
Reference Book:
1 Title Convex Optimization
Author Stephen Boyd
Publisher LievenVandenberghe
Edition 3rd
2 Title Modern Optimization with R (Use R)
Author Paulo Cortez
Publisher Springer
Edition 2014
Content Unit 1
Preliminaries: Proofs, Vector Spaces and Matrices, Linear
Transformations, Eigenvalues and Eigenvectors, Orthogonal
Projections, Quadratic Forms, Matrix Norms, Concepts from
Geometry, Elements of Calculus

Unit 2
Unconstrained Optimization: Basics of Set Constrained and
Unconstrained Optimization, One Dimensional Search Methods, Golden
Section Search,
Fibonacci Search, Newton's Method, Secant Method, Solving Ax = b

Unit 3
Linear Programming: Introduction to Linear Programming, Simplex
Method, Duality

Unit 4
Nonlinear Constrained Optimization: Problems with Equality
Constraints, Problems with Inequality Constraints, Karush Kuhn
Tucker Condition, Convex Optimization Problems,

Unit 5
Algorithms for Constrained Optimization: Projections, Project gradient
methods, Penalty methods.
Course Continuous Evaluation 25%
Assessment Mid Semester 25%
End Semester 50%
Course Matrix (CO-PO-PSO Mapping)

COs POs & PSOs

PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2

CO1 2 1
CO2 1 1 2 1 2
CO3 1 2 1 2 2 1 2 2
CO4 2 2 2 2 1 2 2

1=addressed to small extent

2= addressed significantly
3= addressed strongly (major part of course)
Course Code: PC PE OE AS HM (YES/ ST-IS-PR AE (YES/ NO)
CSBB 424 (YES (YE (YE (YE NO) (YES/NO
/ S/ S/ S/ )
NO) NO) NO) NO)
NO YES NO NO NO NO NO
Type of course Program Elective
Course Title DEEP LEARNING AND APPLICATIONS
Course objectives: The purpose of this course is to provide the students with the advance
knowledge of Machine learning. It aims to enable the students to
understand the design of various Deep Learning models and
application
COs CO1: Solve problems in linear algebra, probability, L1, L2, L3
optimization, and machine learning.
CO2: Implement deep learning models in Python L4, L5, L6
using the PyTorch library and train them with
real-world datasets.
CO3: Design convolutional networks for handwriting L4, L5, L6
and object classification from images or video.
CO4: Design recurrent neural networks with attention L4, L5, L6
mechanisms for natural language
classification, generation, and translation.
Semester Autumn: YES Spring: YES
Lecture Tutorial Practical Credits Total teaching
hours
Contact Hours 3 0 2 4 36
Prerequisite course code as CSL501
per proposed course numbers
Prerequisite credits NIL

Equivalent course codes as per NIL

proposed course and old
course
Overlap course codes as per NIL
proposed course numbers
Text Books:
1 Title Deep Learning
Author Ian Goodfellow and Yoshua Bengio and Aaron Courville.
Publisher MIT Press
Edition 2016
Reference Book:
1 Title Machine Learning: An Algorithmic Perspective, Second Edition
Author Stephen Marsland
Publisher Chapman and Hall/CRC
Edition 2nd
2 Title Introduction to Probability For Data Science
Author Stanley H. Chan

1
 Publisher Michigan Publishing
Edition May 2021
Content Unit – 1
Introduction:
Well posed learning problem, Types of Machine Learning, Applications, Linear
Algebra, Probability and Information Theory, Numerical Computation

Unit – 2
Traditional Machine Learning Basics: Linear Regression, Logistic, Regression, k-
Nearest Neighbors, Classifier with Probability Theory, Decision Trees, Random
Forest, Support Vector Machine,
Artificial Neural Network: Artificial Neuron, Perceptron, Stochastic Gradient
Descent, and Back Propagation Neural Network, Neural Network Architecture, NN
with One Hidden Layer, NN with One Hidden Layer and Multiple Outputs, Neural
Network Hyper-parameters

Unit – 3
Deep Architecture: need, applications, Hyper-parameters in Deep Neural Networks
( Encoding, Layers, Loss function, Learning Rate, Momentum and Optimization,
Regularization and dropout, Batch Norms) , vanishing gradient problem, and ways
to mitigate it

Convolution Neural Network: from Dense Layers to Convolutions, pooling layers,

CNN Architectures ( AlexNet, VGG, NiN, GoogLeNet, ResNet, DensNet), Application in
Image segmentation, Automated Object Detection models.

Unit – 4
Deep Sequence Models: Sequence Modeling Problems, Motivation and
Applications, Traditional Models: Recurrent Neural Networks, Back-propagation
through time; Modern Recurrent Neural Networks: Gated Recurrent Units, Long
Short Term Memory (LSTM), Deep Recurrent Neural Networks, automatic image
captioning, video to text with LSTM models.

Unit- 5
Deep Unsupervised Learning: Latent variable models, Autoencoders, Deep
Generative Modeling: Variational Autoencoders, Generative Adversarial Networks
(GANs), Recent Advance, Image generation with Generative adversarial networks,

Advance Topic in Deep Learning:

Transfer Learning: Need and motivation, Transfer Learning Process, Data
Augmentation, Applications

Unit –6
Deep Reinforcement Learning: Components of an RL - (Agent, Policy, Value
function, Model), MDP, DP, TDL, Q-Learning. SARSA Learning, Deep-Reinforcement
Learning Need and Applications, Types of Deep-RL : Deep Q-Network (DQN) , Policy
Gradient [ Advantage Actor-Critic (A2C/A3C), DDPG, PPO] , Alpha zero
Future Trends in Deep Leaning, Attention models for computer vision tasks.
Course Continuous Evaluation 25%
Assessmen Mid Semester 25%
t
End Semester 50%

2
Course Matrix (CO-PO-PSO Mapping)

COs POs & PSOs

PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2

CO1 3 3 3 3 3 3 3
CO2 2 2 3 3 3 3 3
CO3 2 2 3 3 3 3 3
CO4 3 2 3 3 3 3 3

1=addressed to small extent

2= addressed significantly
3= addressed strongly (major part of course)

Lab Experiments:

Exp. No. List of Experiments

1 Python Frameworks Tutorial (with Jupyter and Colab) and it’s Data Structures
2 Introduction to Python libraries for Data Analysis (Pandas, NumPy, Matplotlib)
3 Data Collection & Creation Using Web Scraping- Static and Dynamic Webpages
4 Exploratory Data Analytics and Feature Engineering
5 Regression Techniques: Linear and Logistic
6 Traditional Computational Techniques
7 Implementation of Perceptron for logic gates (AND, OR, NOT)
8 Neural networks for Binary Classification
9 Building CNN Image classifier using keras for image classification
10 Introduction to Sequence Models for Prediction
11 Financial Planning via Deep Reinforcement Learning

3
Course Offered to Other Departments
Course PC PE OE AS HM ST- AE (YES/ NO)
Code: (YES/ (YES/ (YES/ (YES/ (YES/ IS-
CSBB 111 NO) NO) NO) NO) NO) PR
(YES
/NO)
NO NO YES NO NO NO NO
Type of Open Elective
course
Course Title COMPUTER PROGRAMMING
Course 1. To understand the computational model of Computer.
Objectives: 2. To understand the concepts of C programming.
3. To apply functions of C programming for solving problems.
4. To understand the concept of file management in C.

Course CO1: Understand the basics of computer and various problem L1, L2
Outcomes solving approaches.
CO2: Understand the fundamentals of C programming. L1, L2
CO3: Apply functions, arrays, and structures for solving problem. L2, L3, L4
CO4: Understand the use of pointers and file management in C. L2, L3
Semester Autumn: Yes Spring:
Lecture Tutorial Practical Credits Total
teaching
hours
Contact Hours 2 0 2 3 24
Prerequisite course code as per
proposed course numbers
Prerequisite credits
Equivalent course codes as
per proposed course and old
course
Overlap course codes as per
proposed course numbers
Text Books:
1 Title Programming in ANSI C
Author E. Balagurusamy
Publisher TATA McGraw Hil1
Edition 6 edition, 2012
Reference Book:
2. Title Let Us C
Author Yashwant Kanetkar
Publisher Infinity Science Press
Edition 13th edition, 2012
Title Schaum's Outline of Programming with C
Author Byron S Gottfried
 Publisher TATA McGraw Hill
Edition 2 d edition, 1996
3. Title The C Programming Language
Author Brian Kernighan & Dennis Ritchie
Publisher Prentice Hal
Edition 2nd edition, 1988
Content Unit 1
Introduction and Characteristics of Computers, Applications, Notion of Algorithms,
Development of Flowcharts, Number system: Introduction and type of Number
System, Arithmetic Operations in Number System, Signed and Unsigned Number
System.

Unit 2
Introduction to programming language, Characteristics of C Language, Identifiers
and Keywords, Basic Data types - int, float double, char, Bool, Void, Constant and
Variables, Declarations and Statements, Representation of Expressions, Classification
of operators, precedence and association, type conversion and typecasting, formatted
input and output.

Unit 3
Introduction to Decision Control Statements, Conditional statements- If-else, Switch-
case constructs, Iterative statements, Loops- While, do-while, for.

Unit 4
Function - User defined functions, library functions, Parameter passing call by value,
call by reference, recursion.

Unit 5
Arrays- Advantages and drawbacks, One dimensional, Multi-Dimensional Arrays and
strings: Declaration, initialization, Accessing, Passing arrays and strings as
parameters to functions. Pointers, Structures

Course Continuous Evaluation 25%

Assessment Mid Semester 25%
End Semester 50%

Course Matrix (CO-PO-PSO Mapping)

COs POs & PSOs

PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2

CO1 3 1
CO2 2 1 1 2 2
CO3 3 2 2 2 2 1 2 2
CO4 3 2 2 2 2 2 2
 1=addressed to small extent
2= addressed significantly
3= addressed strongly (major part of course)

Lab Experiments:

Exp. No. List of Experiments

1 Familiarization of Linux environment - How to do Programming in C with Linux.
2 Familiarization of console VO and operators in C.
a. Display "Hello World"
b. Read two numbers, add them and display their sum
c. Read the radius of a circle, calculate its area and display it
d. Evaluate the arithmetic expression ((a -b/c *d+ e) * (f +g)) and display
solution. Read the values of the variables from the user through console.
3 Write a program to
a. Calculate simple and compound interest.
b. Find the roots of quadratic equation.
4 Write a program to swap values of two variables with and without using third
variable.
5 Write a program to find the largest of three numbers with and without ternary
Operators.
6 Write a program to input name, marks of 5 subjects of a student and display the
name of the student, the total marks scored, percentage scored and the class of
result.
7 Read a Natural Number and check whether the number is
a. prime or not
b. Armstrong or not
C. even or odd.
8 Write a program to compute grade of students using if else adder. The grades
are assigned as followed:
Marks Grade
marks<50 F
50 marks< 60 C
60 marks<70 B
70 marks<80 B+
80 marks<90 A
90 marks<100 A+
9 Write a program to check whether the entered year is leap year or not (a year is
leap if it is divisible by 4 and divisible by 100 or 400).
10 Write a program to find whether a character is consonant or vowel using switch
statement.
11 Find the factorial of a given Natural Number n using recursive and non-recursive
functions.
12 Compute sum of the elements stored in an array using pointers and user defined
function.
13 Write a program to add two distances in feet and inches using structures
14 Write a program to read two complex numbers using structures and perform their
addition, subtraction and display result.