Shivaji University

Kolhapur
Revised Syllabus
as per
National Education Policy-2020
(NEP-2.0)

S. Y. B. Tech.
Computer Science and Engineering
To be Implemented from
Academic Year 2025-26
 Exit Course for Computer Science and Engineering After 1st Year

• As part of the NEP 2020 Revised Syllabus, for the First Year B. Tech Exit, students must earn a
total of 8 additional credits. This includes 6 credits from online SWAYAM NPTEL courses and
2 credits from Virtual Lab performance.
• Students must complete two SWAYAM NPTEL courses (12-week duration) from the provided
list and successfully perform two Virtual Labs from the specified list.
• Each SWAYAM NPTEL course carries 3 credits, while each Virtual Lab is worth 1 credit.

Sr. No. Name of NPTEL Course

1 An Introduction to Programming Through C++
2 Computer Networks and Internet Protocol
3 Discrete Mathematics
4 Problem Solving Through Programming In C
5 Programming In Modern C++
6 The Joy of Computing Using Python

Sr. No. Name of Virtual Lab

1 Computer Programming Lab
2 Data Structures Lab
3 Problem Solving Lab
4 Python Programming Lab

Examination Scheme

• Swayam NPTEL Course Certificate Should be submitted to Department 6 Credits

• Lab Experiments Report must be prepared and submitted to department 2 Credits
 Direct Second Year Additional 2 Credits Course

Sr. No. Semester Subject Credit Examination Scheme

In Semester Evaluation has 50 Marks

Internal Evaluation will be done for 50 Marks.
Internal Examiner can use any of the following
C
1 III 2
Programming parameter to assess Students.
• Descriptive Test of 50 Marks.
• POE Examination on Given Experiments

Students have to complete course in Online/Offline Mode for given syllabus content. In Semester
Evaluation will be done for 2 credits
Department of Computer Science and Engineering Revise Syllabus as per NEP 2020
Direct Second Year Additional Credit Course

Year and Semester Direct Second Year Admitted Students Course for 2 Additional Credits.
Course Category Engineering Science (ESC)
Title of Course C Programming Course Code CSE-DSY-AC
Contact
L T P Credits
Teaching Scheme Hrs/Week
-- -- -- -- 02

Examination MSE ISE/CA ESE Total

Scheme -- 50 50

Course
Basics of Operating System, Basic Math Skills, Basic Problem-Solving Skills.
Pre-Requisite
1 Mastering Fundamentals of C Programming

Course 2 Understanding Program Flow

Objective 3 Effective Problem-Solving Skills to develop programming logic in C
4 Debugging and Error Handling in C
After completion of this course Students will be able to ….
CO1 Understand basic Programming concepts.

Course CO2 Apply programming logic using Conditional and Looping statements in C.
Outcomes CO3 Understand fundamentals of Arrays and Strings in C.
CO4 Understand User Defined Functions and User Defined Data Types in C
CO5 Understand Dynamic Memory Allocation

CO PO Mapping
PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12
CO1 2 3
CO2 2 3
CO3 2 3
CO4 2 3
Level of Mapping as: Low 1, Moderate 2, High 3

Marking Scheme
In Semester Evaluation has 50 Marks
Internal Evaluation will be done for 50 Marks.
Internal Examiner can use any of the following parameter to assess Students.
Descriptive Test of 50 Marks or POE Examination on Given Experiments
Unit
Title and Content of Unit
No.

Overview and fundamentals of Programming

Basic Structure of C Program, Executing a C Program, Character Set, C Tokens, Keywords and
1 Identifiers, Constants, Data Types, Variable Declaration and Initialization.

Formatted Input and Output statements in C (getchar(), putchar(), scanf(), printf())

Operators and Expressions

Operators in C
2 Arithmetic Operators, Relational Operators, Logical Operators, Assignment Operator,
Increment and Decrement Operator, Conditional Operator (? :), Bitwise Operators, Special
Operators
Type Conversion in Expression, Mathematical Functions.

Decision Making: Branching and Looping

Decision Making Statements:

Simple if, The if… else Statement, Nesting of if… else statements, The else if ladder, The Switch
3 Statement.
Loping Statements:
The While Statement, The Do Statement, The FOR Statement. Jumps in Loop (break and
continue statement)

Arrays and Strings in C

Introduction to Array, One Dimensional Array – Declaration and Initialization, Two-

4 Dimensional Array – Declaration and Initialization.
Introduction to String in C, Reading and Writing String (gets (), puts (), scanf(), printf()), String
Functions: strlen(), strcmp(), strcpy(), strcat(),

User Defined Functions

Introduction, Multifunction Program, Elements of User Defined Function (Function

5 Declaration, Function Call, Function Definition), Categories of Functions (Function with and
Without Return value, Function with and Without Arguments), Recursion, Passing array to
Functions.

Structures and Pointers

What Are Pointers? Pointer Variables, The Pointer 0perators, Pointer Expressions, Pointers and
Arrays, Arrays of Pointers, Pointers to Functions and structures, Dynamic
6 Allocation Functions.
Structures, Arrays of Structures, Passing Structures to Functions, Structure Pointers, Arrays
and Structures Within Structures, Unions, Bit-Fields, Enumerations, using sizeof to Ensure
Portability, typedef.
 Guidelines for Practical Performance

Students Should be able to perform experiments on following topics.

Exp. No. Title of Experiment/ Problem Statement

1 Formulate areas of different Geometric shapes and design C program for same.

2 Illustration various Mathematical functions in C

3 Demonstration of Operators in C

4 Using Decision Making Statements in Programming Logic

5 Using Looping Statements in Programming Logic

6 Implementation of One-Dimensional Array.

7 Implementation of Two-Dimensional Array

8 Performing various String Operations in C
9 Implementation of function with all categories.
10 Demonstrate Recursive Function
11 Implementation of Structures.
12 Implementation of Pointers and Dynamic Memory Allocation.

Textbooks
Sr. no. Title Author Edition/Publication
01 Programming with ANSI C E Balguruswamy Mc Graw Hill
02 Let Us C Yashwant Kanitkar BPB Publication

Reference Books
Sr. no. Title Author Edition/Publication
(PHI)/Pearson
01 The C Programming Language Kernighan and Richie
Education
02 Complete ‘C’ Reference -- Herbert Schildt
 Second Year B. Tech. Computer Science and Engineering Semester – III
Course Contact Course EXAM SCHEME
Sr. No. Course Code Course Title L T P
Category Hrs./Wk. Credits MSE ISE/CA ESE TOTAL
1 PCC CSE2101 Discrete Mathematical Structures 3 -- -- 3 3 30 10 60 100
2 PCC CSE2102 Data Structures Using C 3 -- -- 3 3 30 10 60 100
3 PCC CSE2103 Computer Networks 3 -- -- 3 3 30 10 60 100
4 EL CSE2104 Data Structures Using C Lab -- -- 4 4 2 -- 50 25 75
5 MDM CSE2105 Multi-disciplinary Minor – 01 2 -- -- 2 2 30 10 60 100
6 OE CSE2106 Open Elective -01 3 -- -- 3 3 30 10 60 100
7 HSSM CSE2107 Employability Enhancement Skills-I 2 -- -- 2 2 -- 50 -- 50
8 PCC CSE2108 Computer Networks Lab -- -- 2 2 1 -- 50 25 75
9 HSSM CSE2109 Business English -- 02 -- 2 2 -- 50 -- 50
10 OE CSE2110 Open Elective -01 Lab -- -- 2 2 1 -- 25 25 50
Total 16 02 08 26 22 150 275 375 800

Open Elective
Vocational Humanities Social Co-curricular and
Basic Science Engineering Programme Programme other than
and Skill Science and Experiential Extracurricular
Course Category Courses Science Core Elective particular
Enhancement Management Learning (EL) Activities
(BSC) Courses (ESC) Course (PCC) Course (PEC) Programme
Course (VSEC) (HSSM) (CCA)
(OE/MDM)
Last Sem.
Cumulative Sum 16 16 -- -- -- 06 04 -- 02

Semester Credits -- -- 10 -- 06 -- 04 02 --

Cumulative Sum 16 16 10 -- 06 06 08 02 02

PROGRESSIVE TOTAL CREDITS: 44+22 =66

 Second Year B. Tech. Computer Science and Engineering Semester – IV

Course Contact Course EXAM SCHEME

Sr. No. Course Category Course Title L T P
Code Hrs./Wk. Credits MSE ISE/CA ESE TOTAL
1 PCC CSE2201 Operating System 3 -- -- 3 3 30 10 60 100
2 PCC CSE2202 Object Oriented Programming 2 -- -- 2 2 30 10 60 100
3 PCC CSE2203 Automata Theory 3 1 -- 4 4 30 10 60 100
4 MDM CSE2204 Multi-disciplinary Minor – 02 2 -- -- 2 2 30 10 60 100
5 OE CSE2205 Open Elective -02 2 -- -- 2 2 30 10 60 100
6 HSSM (AEC) CSE2206 Soft Skills -- 2 -- 2 2 - 25 25 50
7 HSSM (EEMC) CSE2207 Employability Enhancement Skills-II 2 -- -- 2 2 - 25 -- 25
8 VSEC CSE2208 Operating System Lab -- -- 2 2 1 -- 50 -- 50
9 HSSM (VEC) CSE2209 Object Oriented Programming Lab -- -- 4 4 2 - 50 25 75
10 VSEC CSE2210 Mini Project-I Lab -- -- 2 2 1 -- 25 25 50
11 BSC CSE2211 Environmental Science 2 -- -- 2 Audit 30 10 60 100
12 VSEC CSE2212 Computer Maintenance Technology -- -- 2 2 1 50 -- 50
Total 16 03 10 29 22 180 285 435 800+100 (Audit)

Open Elective
Vocational Humanities Social Co-curricular and
Basic Science Engineering Programme Programme other than
and Skill Science and Experiential Extracurricular
Course Category Courses Science Core Course Elective particular
Enhancement Management Learning (EL) Activities
(BSC) Courses (ESC) (PCC) Course (PEC) Programme
Course (VSEC) (HSSM) (CCA)
(OE/MDM)
Last Sem.
16 16 10 -- 06 06 08 02 02
Cumulative Sum

Semester Credits -- -- 09 -- 04 03 06 -- -

Cumulative Sum 16 16 19 -- 10 09 14 02 02

PROGRESSIVE TOTAL CREDITS: 66 + 22 = 88

 List of Open Elective Cour ses

EXAM SCHEME
Course Contact Course
Sr. No. Course Code Course Title L T P
Category Hrs./Wk. Credits MSE ISE/CA ESE TOTAL
Semester 3
1 CSE2106 Advanced Computer Graphics 3 -- -- 3 3 30 10 60 100
Open CSE2110 Advanced Computer Graphics-Lab -- -- 2 2 2 -- 25 25 50
Elective Semester 4
2 Computer Organization &
CSE2205 2 -- -- 2 2 30 10 60 100
Architecture

Abbreviations
Abbreviation Definition Abbreviation Definition
L Lecture BSC Basic Science Courses
T Tutorial ESC Engineering Science Courses
P Practical PCC Programme Core Course
MSE Mid Semester Evaluation PEC Programme Elective Course
ISE/CA In Semester Evaluation/Continuous Assessment OE Open Elective

End Semester Evaluation

ESE MDM Multi-Disciplinary Minor
(For Laboratory, End Semester Performance)

VSEC Vocational and Skill Enhancement Course

HSSM Humanities Social Science and Management
EL Experimental Learning
CCA Co-curricular and Extracurricular Activities
 Department of Computer Science and Engineering Revised Syllabus as per NEP 2020
Second Year Bachelor of Technology 3rd Semester

Year and Semester Second Year B. Tech - Semester III - Computer Science and Engineering
Course Category Programme Core Course (PCC)
Title of Course Discrete Mathematical Structures Course Code CSE2101
Contact
L T P Credits
Teaching Scheme Hrs/Week
03 -- -- 03 03
MSE ISE/CA ESE Total
Examination Scheme
30 10 60 100

Course
Fundamentals of mathematics: -Sets, Functions, Algebraic operations.
Pre-Requisite
To introduce students to fundamental concepts in discrete mathematics,
1 including Sets, relations, Functions, Algebraic Systems, Graphs, Groups, lattices
and logic and use mathematically correct terminology and notations.
To understand and critically analyse, formulate and solve the mathematical
2
problems and proofs
Course
Objective To cultivate students' ability to solve complex problems using discrete
3
mathematical methods and algorithms.
To design and implement experiments on Discrete Structures – Truth tables of
statement formula, set operations, tree traversal techniques and explore
4
applications of discrete mathematics in computer science, cryptography, and
other fields.
After completion of this course Students will be able to
CO1 Explain the basic concepts of discrete mathematical structures
Demonstrate the applications of discrete structures in different fields of
Course CO2
computer science.
Outcomes
CO3 Make use of concepts of discrete mathematical structures to solve the problems.

Apply the mathematical proofs and techniques to prove the theorems in

CO4
computer science.

CO PO Mapping
PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12
CO1 3 3 2 1
CO2 3 2 2 2 2
CO3 2 1 3 2 2 1`
CO4 2 2 2 1 1
Level of Mapping as: Low 1, Moderate 2, High 3
Marking Scheme

• Compulsory passing with 40% marks is mandatory in ESE examinations and combined
passing marks (MSE+ISE/CA+ESE) for theory course is 40 %
• Mid sem. examination will be based on 50 % syllabus from beginning (First Three Units).
• No compulsory passing for MSE.
• ESE paper setting weightage will be, 25 % on syllabus covered for MSE (First Three Units)
and 75 % on remaining syllabus (Last Three Units).

Unit
Title and Content of Unit Hours
No.

Mathematical Logic
Statements & Notations, Connectives, Statement Formulas & truth table, Well-
1 formed formulas, Tautologies, Equivalence of formulas, Duality law, Tautological 7 Hrs
Implications, functionally complete set of connectives, other connectives, Normal
Forms

Set Theory

2 Basic concepts of set theory, Operations on Sets, Ordered pairs & n-tuples, 5 Hrs
Cartesian product

Relation and Ordering

Relations, Properties of binary relations, Matrix & Graph Representation of

3 Relation, Partition & covering of Set, Equivalence Relations, Composition of 6 Hrs
Binary Relation, POSET & Hasse Diagram, Functions, Types of Functions,
Composition of functions.

Algebraic Systems
4 Algebraic Systems: Examples & General Properties, Semi groups & Monoids, 7 Hrs
Groups: Definitions & Examples, Subgroup & Homomorphism.

Lattice and Boolean Algebra:

Lattice as partially ordered sets, Lattice as Algebraic Systems., Special Lattices.,

5 7 Hrs
Boolean Algebra: Definitions & examples, Boolean Functions., Representation &
Minimization of Boolean Functions.

Graph Theory:

Basic concepts of graph theory., Paths, Reachability & Connectedness, Matrix,

6 7 Hrs
Representations of Graphs., Storage Representation & Manipulations of Graphs.
PERT & Related technologies.
Textbooks
Sr. no. Title Author Edition/Publication
“Discrete Mathematical Structures J. P. Tremblay & R.
01 MGH International
with Application to Computer Science” Manohar

Discrete Mathematics and its (AT&T Bell Labs)

02 Kenneth H. Rosen
Applications (mhhe.com/rosen)

Reference Books
Sr. no. Title Author Edition/Publication

Marc Lipson (MGH),

01 Discrete Mathematics Semyour Lipschutz
Schaum’s outlines

Bernard Kolman, Robert

02 Discrete Mathematical Structures Busby, S. C. Ross and Pearson Education
Nadeemur- Rehman
Year and Semester Second Year B. Tech - Semester III - Computer Science and Engineering

Course Category Programme Core Course (PCC)

Title of Course Data Structures using C Course Code CSE2102

Contact
L T P Credits
Teaching Scheme Hrs/Week
03 -- -- 03 03
MSE ISE/CA ESE Total
Examination Scheme
30 10 60 100

Course
Fundamentals of C Programming
Pre-Requisite
1 Introduce fundamentals of Data Structures

Course 2 Review of the nature of data and its storage requirements.

Objective 3 Design of storage and operations for different types of data.
4 Assessment of complexity of data structures.
After completion of this course Students will be able to
CO1 Identify the appropriate data structure for specific application
Course
CO2 Select appropriate searching and Sorting algorithms.
Outcomes
CO3 Apply Data Structures to solve a complex problem.
CO4 Analyse the performance of different data structures

CO PO Mapping
PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12
CO1 2 3
CO2 2 3
CO3 2 3
CO4 2 3
Level of Mapping as: Low 1, Moderate 2, High 3

Marking Scheme

• Compulsory passing with 40% marks is mandatory in ESE examinations and combined
passing marks (MSE+ISE/CA+ESE) for theory course is 40 %
• Mid sem. examination will be based on 50 % syllabus from beginning (First Three Units).
• No compulsory passing for MSE.
• ESE paper setting weightage will be, 25 % on syllabus covered for MSE (First Three Units)
and 75 % on remaining syllabus (Last Three Units).
Unit
Title and Content of Unit Hours
No.

Basic of Data Structures

Pointers: Introduction to Pointers, Pointer Arithmetic, Dynamic Memory
Allocation (Malloc and Calloc)

1 Structures: Array of Structures, Passing Structures to Function, Structure and 7 Hrs

Pointers
Data structure: Definition, Types of data structures, Data Structure Operations
Algorithms: Complexity, Time and Space complexity

Searching and Sorting

Searching: Linear search, Binary search,
2 7 Hrs
Sorting: Bubble sort, Selection sort, Insertion sort, Merge sort, Quick sort, Radix
sort.

Stacks and Queues

Stack: Definition and operations, Array representation of stack, applications of

3 Stack 6 Hrs
Queue: Definition and operations, Array representation of queue, applications of
Queue, Circular Queue, Priority Queue.

Linked Lists
Definition, Representation, Operations, Implementation, Applications of Singly,
4 7 Hrs
Doubly and Circular linked lists.
Linked representation of stack and Queue.

Trees
Terminology, Representation, Binary tree, Traversal methods, Binary Search Tree,
5 6 Hrs
AVL Search Tree, B tree and B+ tree.
Heaps- Operations and their applications, Heap sort.

Graphs
Basic concept of graph theory, storage representation.
6 6 Hrs
Graph Traversal Techniques: BFS and DFS.
Graph Representation using Sparse Matrix.
Textbooks
Sr. no. Title Author Edition/Publication
01 Programming in ANSI C E. Balagurusamy Tata McGraw Hill
02 Schaum’s Outlines Data Structures Seymour Lipschutz MGH

Reference Books
Sr. no. Title Author Edition/Publication

A. M. Tanenbaum, Y.
01 Data Structure using C Langsam, M. J. PHI
Augenstein

Data Structures Richard F. Gilberg and

02 2nd Edition
A Pseudo code Approach with C Behrouz A. Forouzon
Year and Semester Second Year B. Tech - Semester III - Computer Science and Engineering

Course Category Programme Core Course (PCC)

Title of Course Computer Networks Course Code CSE2103

Contact
L T P Credits
Teaching Scheme Hrs/Week
03 -- -- 03 03
MSE ISE/CA ESE Total
Examination Scheme
30 10 60 100

Course
Fundamentals of C Programming
Pre-Requisite
To provide a strong foundation in computer network concepts, architectures, and
1
protocols.
Course To explore advanced topics, including client-server programming, IPv6, and
Objective 2
multimedia communication.
3 To develop hands-on expertise with networking tools and software.
After completion of this course Students will be able to
Demonstrate understanding of basic and advanced networking concepts and
CO1
protocols.
CO2 Implement and analyse data link and MAC sublayer functionalities.
Course Develop network layer functionalities and design and configure IPv4 and IPv6
CO3
Outcomes addressing schemes.
Analyse transport layer services and develop client-server network applications
CO4
using socket programming.
CO5 Configure and simulate application-layer services.
CO6 Explain and implement multimedia networking and streaming protocols.

CO-PO Mapping

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

CO1 3 2 1

CO2 2 3 2 1 3

CO3 2 1 2 2 2

CO4 3 2 2

CO5 2 2 3 2 2

CO6 2 1 2 1

Level of Mapping as: Low 1, Moderate 2, High 3

Marking Scheme

• Compulsory passing with 40% marks is mandatory in ESE examinations and combined
passing marks (MSE+ISE/CA+ESE) for theory course is 40 %
• Mid sem. examination will be based on 50 % syllabus from beginning (First Three Units).
• No compulsory passing for MSE.
• ESE paper setting weightage will be, 25 % on syllabus covered for MSE (First Three Units)
and 75 % on remaining syllabus (Last Three Units).

Unit
Title and contents Hours
No.
Introduction to Computer Networks
01 Overview of OSI layer Model and TCP/IP protocol model, Addressing, 04
Underlying technologies for LANs, WANs.

Data Link Layer and Medium Access Control Sub layer

Data Link Layer: Design issues for Data Link Layers, Framing methods, Error
control: detection and correction, Flow control, Elementary Data Link protocols,
02 07
sliding window Protocols, Go back n, Selective repeat
Medium Access Control Sub layer: Static and Dynamic channel allocation,
Multiple Access protocols ALOHA, CSMA, Collision Free Protocols

Network Layer and Internet Protocol

Network Layer: IPv4 Addresses: Classful Addressing, Class less Addressing,
Delivery, Forwarding and routing; Routing methods: shortest path, Link state;
03 07
Congestion prevention policies
Internet Protocol: IP Datagram format, Fragmentation and reassembly models,
ARP, RARP, ICMP, IGMP; IPv6: Addressing, Packet Format

Transport Layer and Socket Programming

04 TCP and UDP: Features, Segment Format, Flow Control; Introduction to Sockets: 07
Socket Addressing, Elementary System Calls; Client-Server Programming:
Connection-Oriented and Connectionless Models

Application Layer
Domain Name System (DNS): Name Resolution, Messages, Records, Remote
05 Login (TELNET, SSH) and File Transfer (FTP, TFTP); HTTP: Architecture, Persistent 07
vs. Non-Persistent Connections, Proxy Servers; Email Protocols: SMTP, POP3,
IMAP

Multimedia Networking and Advanced Topics

06
Streaming Protocols: RTP, RTCP, SIP, VoIP; Basics of Multimedia Networking: 07
Real-Time Streaming (Audio/Video)
Textbooks
Sr. No. Title Author Edition/Publication
01 Computer Networks Andrew S. Tanenbaum 5th Edition, Pearson
02 TCP/IP Protocol Suite Behrouz A. Forouzan 4th Edition, McGraw-Hill

Reference Books
Sr. No. Title Author Edition/Publication
Computer Networking James F. Kurose, Keith W.
01 8th Edition, Pearson
A Top-Down Approach Ross
Volume 1, 3rd Edition,
02 Unix Network Programming W. Richard Stevens
Pearson Education
Volume 1, 6th Edition,
03 Internetworking with TCP/IP Douglas Comer
Pearson Education
Year and Semester Second Year B. Tech - Semester III - Computer Science and Engineering

Course Category Experimental Learning (EL)

Title of Course Data Structures using C Lab Course Code CSE2104

Contact
L T P Credits
Hrs/Week
Teaching Scheme
-- -- 04 04 02

MSE ISE/CA ESE Total

Examination
Scheme
-- 50 25 75

Course
Fundamentals of C Programming
Pre-Requisite
1 Introduce fundamentals of Data Structures

Course 2 Review of the nature of data and its storage requirements.

Objective 3 Design of storage and operations for different types of data.
4 Assessment of complexity of data structures.
After completion of this course Students will be able to
CO1 Identify the appropriate data structure for specific application
Course
CO2 Select appropriate searching and Sorting algorithms.
Outcomes
CO3 Apply Data Structures to solve a complex problem.
CO4 Analyse the performance of different data structures

CO PO Mapping
PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12
CO1 2 3
CO2 2 3
CO3 2 3
CO4 2 3
Level of Mapping as: Low 1, Moderate 2, High 3

Marking Scheme
In Semester Evaluation/ Continuous Assessment has 50 Marks
Parameters for In Semester Evaluation could be: Attendance, Assignments, Unit Tests,
Presentation, Online Activities like (Virtual Labs, NPTEL) etc.
Lab File should be prepared and should be assessed continuously during academic.
End Semester Evaluation has 25 Marks
External Practical Examination with Performance and Oral Examination
 Guidelines for Lab Performance

Faculty can create Experiment list based on following listed topics.

Minimum 12 to 15 Experiments should get performed.

Exp. No. Title of Experiment/ Problem Statement

1 Dynamic Memory Allocation: Malloc and Calloc functions in c

2 Array of Structures, Passing Structures to Function, Structure and Pointers

3 Searching: Linear and Binary Search

4 Sorting: Bubble Sort, Selection Sort, Insertion Sort, Quick Sort

5 Implementation of Stack using Array

6 Implementation of Linear and Circular Queue using array

Implementation of Single Linked List or Doubly Linked List

• Inserting Node at Beginning, Random and Last Position
7 • Deleting Node from Beginning, Random and Last Position
• Searching Given Node
• Displaying Nodes

8 Implementation of Stack and Queue using Linked List

Implementation of Binary Search Tree Traversing Techniques (In order, Preorder and
9
Postorder)

10 Implementation of Graph 1. Depth First Search, 2. Breadth First Search

Textbooks
Sr. no. Title Author Edition/Publication
01 Programming in ANSI C E. Balaguruswamy Tata McGraw Hill
02 Schaum’s Outlines Data Structures Seymour Lipschutz MGH

Reference Books
Sr. no. Title Author Edition/Publication

A. M. Tanenbaum, Y. Langsam, M. J.
01 Data Structure using C PHI
Augenstein

Data Structures
Richard F. Gilberg and Behrouz A.
02 A Pseudo code Approach 2nd Edition
Forouzon
with C
Year and Semester Second Year B. Tech - Semester III - Computer Science and Engineering

Course Category Multi-disciplinary Minor – 01

Title of Course Data Structures using C (MDM-01) Course Code CSE2105

Contact
L T P Credits
Teaching Scheme Hrs/Week
02 -- -- 02 02
MSE ISE/CA ESE Total
Examination Scheme
30 10 60 100

Course
Fundamentals of C Programming
Pre-Requisite
1 Introduce fundamentals of Data Structures
Course 2 Review of the nature of data and its storage requirements.
Objective 3 Design of storage and operations for different types of data.
4 Assessment of complexity of data structures.
After completion of this course Students will be able to
CO1 Identify the appropriate data structure for specific application
Course
CO2 Select appropriate searching and Sorting algorithms.
Outcomes
CO3 Apply Data Structures to solve a complex problem.
CO4 Analyse the performance of different data structures

CO PO Mapping
PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12
CO1 2 3
CO2 2 3
CO3 2 3
CO4 2 3
Level of Mapping as: Low 1, Moderate 2, High 3

Marking Scheme

• Compulsory passing with 40% marks is mandatory in ESE examinations and combined
passing marks (MSE+ISE/CA+ESE) for theory course is 40 %
• Mid sem. examination will be based on 50 % syllabus from beginning (First Three Units).
• No compulsory passing for MSE.
• ESE paper setting weightage will be, 25 % on syllabus covered for MSE (First Three Units)
and 75 % on remaining syllabus (Last Three Units).
Unit
Title and Content of Unit Hours
No.

Basic of Data Structures

1 Data structure: Definition, Types of data structures, Data Structure Operations 3 Hrs
Algorithms: Complexity, Time and Space complexity

Searching and Sorting

2 Searching: Linear search, Binary search, 6 Hrs

Sorting: Bubble sort, Selection sort, Insertion sort, Merge sort, Quick sort, Radix sort.

Stacks and Queues

3 Stack: Definition and operations, Array representation of stack, applications of 5 Hrs

Stack. Queue: Definition and operations, Array representation of queue,
applications of queue.

Linked Lists
4 Definition, Representation, Operations, Implementation, Applications of Singly 5 Hrs
and Doubly Linked List

Trees
5 Terminology, Representation, Binary tree, Traversal methods, Binary Search Tree, AVL 4 Hrs
Search Tree, B tree and B+ tree

Graphs

6 Basic concept of graph theory, storage representation.

4 Hrs
Graph Traversal Techniques: BFS and DFS.
Graph Representation using Sparse Matrix.

Textbooks
Sr. no. Title Author Edition/Publication
01 Programming in ANSI C E. Balaguruswamy Tata McGraw Hill
02 Schaum’s Outlines Data Structures Seymour Lipschutz MGH

Reference Books
Sr. no. Title Author Edition/Publication
A. M. Tanenbaum, Y.
01 Data Structure using C PHI
Langsam, M. J. Augenstein

Data Structures Richard F. Gilberg and

02 2nd Edition
A Pseudo code Approach with C Behrouz A. Forouzon
Year and Semester Second Year B. Tech - Semester III - Computer Science and Engineering
Course Category OE
Open Elective-1
Title of Course Course Code CSE2106
Advanced Computer Graphics
Contact
L T P Credits
Teaching Scheme Hrs/Week
03 -- -- 03 --

MSE ISE/CA ESE Total

Examination Scheme
30 10 60 100

Course
Fundamentals of Computer Graphics
Pre-Requisite
1 To expose students to the various transformation techniques and projections
Course To make students understand different algorithms concerned with scanning,
2
Objective filling, windowing and clipping on graphical objects
3 To make the students aware of generation of curves and surfaces

After completion of this course Students will be able to

CO1 Understand 2D & 3D Transformation techniques
CO2 Implement Bresenham's line and circle drawing algorithms
Course
Outcomes CO3 Implement windowing & clipping
CO4 Implement Bezier curves
CO5 Understand Computer Animation
CO6 Understand illumination models and surface rendering methods

CO PO Mapping
PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12
CO1 1 1
CO2 1 1 1 1
CO3 1 1 1 1 1
CO4 1 3 2 2 1 1 1 1 2
CO5 1 1 1
CO6 1 1 1
Level of Mapping as: Low 1, Moderate 2, High 3

Marking Scheme

• Compulsory passing with 40% marks is mandatory in ESE examinations and combined
passing marks (MSE+ISE/CA+ESE) for theory course is 40 %
• Mid sem. examination will be based on 50 % syllabus from beginning (First Three Units).
• No compulsory passing for MSE.

• ESE paper setting weightage will be, 25 % on syllabus covered for MSE (First Three Units) and
75 % on remaining syllabus (Last Three Units).
Unit
Title and Content of Unit Hours
No.

Transformations

Basic 2D & 3D transformations - Translation, Scaling, Rotation, Reflection, Shearing,

1 Multiple Transformations, Rotation about an axis parallel to a coordinate axis, rotation 7 Hrs
about an arbitrary axis in space, Affine and Perspective Geometry, Orthographic

projections and Axonometric projections

Raster Scan Graphics

Bresenham's line and circle drawing algorithms, Scan Conversion techniques: RLE, Frame
2 7 Hrs
Buffer, Scan converting polygons: Edge fill and Seed fill algorithms, Anti-aliasing and

Halftoning

Viewing and clipping

3 Introduction, Windowing and View-porting, Introduction to clipping, Point 4 Hrs

clipping, and line clipping: Sutherland - Cohen line clipping algorithm

Curves and Surfaces

Curve Representation, Non-parametric and parametric curves, representation of
4 8 Hrs
space curves, Cubic Spline, Parabolic Blended curves, Bezier curves and B-spline curves,

Z- buffer, Warnock algorithm

Computer Animation

Introduction, Key frame animation, Construction of an animation sequence, Motion

5 6 Hrs
control methods, Procedural animation, Key- frame animation vs. Procedural
animation, Introduction to Morphing, Warping techniques, Three-dimensional morphing

Illumination models and surface rendering methods

6 Light sources, Basic illumination models, Displaying light intensities, Polygon Rendering 7 Hrs
methods, Ray tracing methods, Radiosity lighting model, Introduction to Blender
 Textbooks

Sr. No. Title Author Edition/Publication

Mathematical elements for Computer David F. Rogers, J. Alan (MGH Int.)
01
Graphics Adams For Unit 1 & 4
(MGH
Procedural elements for Computer
02 David F. Rogers International)
Graphics
For Unit 2 & 3
WILEY India
03 Computer Graphics Rajesh Maurya
For Unit 5
Computer Graphics C Version second Donald D. Hearn, M. Pearson
04
edition Pauline Baker For Unit 6

Reference Books

Sr. No. Title Author Edition/Publication

Zhigang Xiang & Roy Schaum's Outline

01 Computer Graphics (second Edition)
Plastock Series, TMGH

02 Computer Graphics Using OpenGL F.S. Hill Jr. Stephen M. Kelley Pearson
Year and Semester Second Year B. Tech - Semester III - Computer Science and Engineering

Course Category (Humanities Social Science and Management (HSSM)

Title of Course Employability Enhancement Skills-I Course Code CSE2107

Contact
L T P Credits
Teaching Scheme Hrs/Week
02 -- -- 02 02
MSE ISE/CA ESE Total
Examination Scheme
-- 50 -- 50

To enable the students to understand the skills required for effective

1
communication at different levels of an organization.
Course 2 To enhance listening, note and presentation skills.
Objective
3 To build communication skills among the students required for Digital Platforms.
4 To build Business Correspondence Skills among the students.
After completion of this course Students will be able to
Understand the skills required for effective communication at different levels of an
CO1
organization.
Course
CO2 Enhance themselves with good listening, note taking and presentation skills.
Outcomes
Build good communication skills among the students required for Digital
CO3
Platforms.
CO4 Efficiently Manage with Business Correspondence Skills among the students.

CO PO Mapping
PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12
CO1 2 3 1
CO2 2 3 1
CO3 2 3 1
CO4 2 3 1
Level of Mapping as: Low 1, Moderate 2, High 3

Marking Scheme
In Semester Evaluation/ Continuous Assessment has 50 Marks
Parameters for In Semester Evaluation could be: Attendance, Assignments, Presentation, Online
Activities like (Virtual Labs, NPTEL) etc.
Lab File should be prepared and should be assessed continuously during academic.
Unit
Title and Content of Unit Hours
No.
Behavioural Skills

Expectation Setting: Creating a focused and responsible learning environment,

Personal Strength Analysis/Strength Blindness: Self -awareness and confidence
building, Perception Management: Display Professionalism at the institute and
1 5 Hrs
work place Ethics, Values& Etiquette Increased social initiations relationships
and networks Acceptance of peers from different cultures and social groups and
work with them. Collaboration with team to prioritize the common goal and
compromise Individual priorities.

English Reading Ability

Functional English: Greetings & Self Introduction Asking & responding to

2 questions Sharing information with others Formal & Informal communication 5 Hrs
Speak and provide information about workplace Reading: Self, Work,
Environment

Financial and Legal Literacy

Discuss the significance of using financial products and services safely and
securely.
3 4 Hrs
Explain the importance of managing expenses, income, and savings.
Explain the significance of approaching the concerned authorities in time
for any exploitation as per legal rights and laws

Essential Digital Skills

Show how to operate digital devices and use the associated applications
4 and features, safely and securely, 4 Hrs
Discuss the significance of using internet for browsing, accessing social
media platforms, safely and securely.

Essential Skills for Success

Building basic skills to navigate life and career. Self-Awareness, articulating

personal values, Value-based decision making, Dilemma situations. Identify
5 4 Hrs
sources and types of stress (positive / negative stress), Managing stress (long-
term / short-term), Handling rejection and building resilience, Identify day
wasters.

Getting Ready for Apprenticeship & Jobs

Create a biodata, Use various sources to search and apply for jobs Discuss the
6 4 Hrs
significance of dressing up neatly and maintaining hygiene for an interview
Discuss how to search and register for apprenticeship opportunities
Textbooks
Sr. no. Title Author Edition/Publication
01 Communication Skills Fillip Learning - FL

Communication for Business: A

02 Taylor, Shirley Pearson Education
Practical Approach

03 Corporate Communication C.S. Raydu HPH

The Art and Science of Business P. D. Chaturvedi and
4th Edition, Pearson
04 Communication-Skills, Concepts, Cases Mukesh Chaturvedi
Education
and Applications (2017)
Critical Thinking: An Introduction to Oxford University
05 Wright, L.
Analytical Reading and Reasoning Press

Reference Books
Sr. no. Title Author Edition/Publication

01 Business Communication Rai & Rai HPH

S. P. Sharman,
02 Corporate Communication VBH
Bhavani H.

Basic Business Communication:

03 Rajkumar Excel Books
Concepts, Applications and Skills
Year and Semester Second Year B. Tech - Semester III - Computer Science and Engineering

Course Category Programme Core Course (PCC)

Title of Course Computer Networks Lab Course Code CSE2103

Contact
L T P Credits
Hrs/Week
Teaching Scheme
-- -- 02 02 01

MSE ISE/CA ESE Total

Examination
Scheme
-- 50 25 75

Course
Fundamentals of C Programming
Pre-Requisite
To provide a strong foundation in computer network concepts, architectures, and
1
protocols.
Course To explore advanced topics, including client-server programming, IPv6, and
Objective 2
multimedia communication.
3 To develop hands-on expertise with networking tools and software.
After completion of this course Students will be able to
Demonstrate understanding of basic and advanced networking concepts and
CO1
protocols.
CO2 Implement and analyse data link and MAC sublayer functionalities.
Course Develop network layer functionalities and design and configure IPv4 and IPv6
CO3
Outcomes addressing schemes.
Analyse transport layer services and develop client-server network applications
CO4
using socket programming.
CO5 Configure and simulate application-layer services.
CO6 Explain and implement multimedia networking and streaming protocols.

CO-PO Mapping

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

CO1 3 2 1

CO2 2 3 2 1 3

CO3 2 1 2 2 2

CO4 3 2 2

CO5 2 2 3 2 2

CO6 2 1 2 1

Level of Mapping as: Low 1, Moderate 2, High 3

 Guidelines for Lab Performance

Faculty can create Experiment list based on following listed topics.

Minimum 10 to 12 Experiments should get performed.

Exp. No. Title of Experiment/ Problem Statement

1 Study and Installation of Cisco packet tracer tool.

2 Design of LAN or network topologies using Cisco packet tracer tool.
3 Implementing Framing methods (Character count, Bit Stuffing, Character Stuffing).
4 Implementation of error detection codes (CRC, Hamming codes).

5 Simulation of data link layer protocols (Stop-and-Wait, Sliding Window).

6 Programs to understand IP addressing, classful & classless addressing.

7 Simulate working of DHCP, ARP and FTP using Cisco packet tracer tool.

8 Development of client-server applications using TCP/UDP sockets.

9 Capturing and analysing application layer protocols using Wireshark.

10 Study of multimedia protocols (RTP, SIP) and streaming services.

Textbooks
Sr. no. Title Author Edition/Publication
01 Computer Networks Andrew S. Tanenbaum 5th Edition, Pearson
4th Edition,
02 TCP/IP Protocol Suite Behrouz A. Forouzan
McGraw-Hill

Reference Books
Sr. no. Title Author Edition/Publication
Computer Networking: A Top-Down James F. Kurose, Keith
01 8th Edition, Pearson
Approach W. Ross
Volume 1, 3rd
02 Unix Network Programming W. Richard Stevens Edition, Pearson
Education
Volume 1, 6th
03 Internetworking with TCP/IP Douglas Comer Edition, Pearson
Education
Year and Semester Second Year B. Tech - Semester III - Computer Science and Engineering

Course Category (Humanities Social Science and Management (HSSM)

Title of Course Business English Course Code CSE2109

Contact
L T P Credits
Teaching Scheme Hrs/Week
-- 02 -- 02 2
MSE ISE/CA ESE Total
Examination Scheme
-- 50 -- 50

Course
Knowledge of functional grammar and vocabulary in English
Pre-Requisite
1 Develop basic skills to deal with people in business situations

Course 2 Write and read basic business reports, letters, e-mails etc
Objective 3 Expand vocabulary related to general business situations
4 Develop confidence to deal with people and basic issues in the business world
After completion of this course Students will be able to
CO1 Communicate with others in practical, business-oriented situations

Course CO2 Express themselves in English with greater fluency, accuracy and confidence
Outcomes Enhance the skills of listening, speaking, pronunciation skills, as well as business
CO3
vocabulary
Acquire the communicative competencies crucial for appropriate workplace
CO4
behaviour

CO PO Mapping
PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12
CO1 1 2 3 2
CO2 2 2 3 2
CO3 2 2 3 1
CO4 1 2 2 2
Level of Mapping as: Low 1, Moderate 2, High 3

Marking Scheme
In Semester Evaluation/ Continuous Assessment has 50 Marks
• Parameters for In Semester Evaluation could be:
Attendance, Assignments, Presentation, etc.
• Lab File should be prepared and should be assessed continuously during academic.
Unit
Title and Content of Unit Hours
No.

Vocabulary building and Reading comprehension

1 Synonyms and antonyms, Reading techniques and comprehension skills, Prefixes and 5 Hrs
Suffixes, Idioms and phrases, One-word substitution

Getting acquainted with professional culture

2 4 Hrs
First day at work, Induction program, Company hierarchy

Verbal Etiquettes
3 4 Hrs
Group Discussion, Meeting, Dining, Telephone, Interview, Video Conferencing

Written Etiquettes
4 4 Hrs
Resume Writing, E Mail Writing, Report Writing, Minutes of Meeting

Public speaking and Presentation Skills

5 Preparing and conducting presentation, Body language, Overcoming stage fear, Best 5 Hrs
practices

Miscellaneous
6 4 Hrs
Handling Complains, Negotiation Skills, Business Etiquettes

Textbooks
Sr. no. Title Author Edition/Publication
01 Technical Communication Ashraf Rizvi Tata McGraw Hill, 2005
02 Technical English Dr. M. Hemamalini Wiley, 2014

Reference Books
Sr. no. Title Author Edition/Publication
SCITECH
01 English for Technical Communication K. R. Laxminarayan nd
2 Edition 2014
Year and Semester Second Year B. Tech - Semester III - Computer Science and Engineering

Course Category OE
Open Elective-1
Title of Course Course Code CSE2110
Advanced Computer Graphics Lab
Contact
L T P Credits
Teaching Scheme Hrs/Week
-- -- 02 02 01

MSE ISE/CA ESE Total

Examination Scheme
-- 25 25 50

Course
Fundamentals of Computer Graphics
Pre-Requisite
1 To expose students to the various transformation techniques and projections
Course To make students understand different algorithms concerned with scanning,
2
Objective filling, windowing and clipping on graphical objects
3 To make the students aware of generation of curves and surfaces

After completion of this course Students will be able to

CO1 Understand 2D & 3D Transformation techniques
CO2 Implement Bresenham's line and circle drawing algorithms
Course
Outcomes CO3 Implement windowing & clipping
CO4 Implement Bezier curves
CO5 Understand Computer Animation
CO6 Understand illumination models and surface rendering methods

CO PO Mapping
PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12
CO1 1 1
CO2 1 1 1 1
CO3 1 1 1 1 1
CO4 1 3 2 2 1 1 1 1 2
CO5 1 1 1
CO6 1 1 1
Level of Mapping as: Low 1, Moderate 2, High 3

Marking Scheme

In Semester Evaluation/ Continuous Assessment has 25 Marks

Parameters for In Semester Evaluation could be: Attendance, Assignments, Unit Tests, Presentation,
Online Activities like (Virtual Labs, NPTEL) etc.
Lab File should be prepared and should be assessed continuously during academic.
End Semester Evaluation has 25 Marks
External Practical Examination with Performance and Oral Examination
 Guidelines for Lab Performance

Faculty can create Experiment list based on following listed topics. Minimum 08 to 10 Experiments should
get performed.

Exp. No Title of Experiment/ Problem Statement

1 Study of basic graphics functions defined in “graphics.h “

2 Draw A Circle, Arc, Ellipse & Rectangle

3 2D Translation, Rotation & Scaling

4 3D Translation, Rotation & Scaling

5 Bresenham’s Line Drawing Algorithm

6 Bresenham’s Circle Drawing Algorithm

7 Mid-Point Line Drawing Algorithm

8 Polygon Filling

9 Line clipping

10 Study of OPENGL & Blender 3D Software

11 DDA Line Drawing Algorithm

Textbooks

Sr. No. Title Author Edition/Publication

Mathematical elements for Computer David F. Rogers, J. Alan (MGH Int.)
01
Graphics Adams For Unit 1 & 4
(MGH
Procedural elements for Computer
02 David F. Rogers International)
Graphics
For Unit 2 & 3
WILEY India
03 Computer Graphics Rajesh Maurya
For Unit 5
Computer Graphics C Version second Donald D. Hearn, M. Pearson
04
edition Pauline Baker For Unit 6

Reference Books

Sr. No. Title Author Edition/Publication

Zhigang Xiang & Roy Schaum's Outline

01 Computer Graphics (second Edition)
Plastock Series, TMGH

02 Computer Graphics Using OpenGL F.S. Hill Jr. Stephen M. Kelley Pearson
 Department of Computer Science and Engineering Revised Syllabus as per NEP 2020
Second Year Bachelor of Technology 4 t h Semester

Year and Semester Second Year B. Tech - Semester IV - Computer Science and Engineering

Course Category Programme Core Course (PCC)

Title of Course Operating System Course Code CSE 2201
Contact
L T P Credits
Teaching Scheme Hrs/Week
03 -- -- 03 03
MSE ISE/CA ESE Total
Examination Scheme
30 10 60 100

Course
Computer Network, Data Structure
Pre-Requisite
1 To make the students understand basic concepts of operating system
To expose the students to various functions of the Operating system and their
2
Course usage
Objective 3 Architecture and algorithms of process scheduling and memory management.
Algorithms of buffer cache management and Internal File system organizations in
4
UNIX
After completion of this course Students will be able to
Explain basic concepts of operating system and their structures to compare
CO1
various operating systems using various OS parameters.
Course Use deadlock handling and Memory management techniques with suitable
CO2
Outcomes method to handle a deadlock and memory management.
Develop appropriate solution to solve critical section problem by using
CO3
accurate operating system algorithm
CO4 Illustrate internal representation of files and relevant algorithms.

CO PO Mapping
PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12
CO1 2 2
CO2 2 2 2
CO3 2 2 2
CO4 2
Level of Mapping as: Low 1, Moderate 2, High 3
Marking Scheme

• Compulsory passing with 40% marks is mandatory in ESE examinations and combined
passing marks (MSE+ISE/CA+ESE) for theory course is 40 %
• Mid sem. examination will be based on 50 % syllabus from beginning (First Three Units).
• No compulsory passing for MSE.
• ESE paper setting weightage will be, 25 % on syllabus covered for MSE (First Three Units)
and 75 % on remaining syllabus (Last Three Units).

Unit
Title and Content of Unit Hours
No.
Introduction and Process Management
Overview: Introduction to Operating Systems, Operating System structure,
Operating System Services, Architecture of the UNIX OS, Introduction to System
Concepts, Types of Operating Systems - Batch Processing System,
1 Multiprogramming System, The Time-Sharing System, The Real Time Operating 7 Hrs
System, Distributed operating system.
Process concept: Basic concepts, Processes and programs, Implementing
processes, Process States, Process Control Block, Context switch, Operations on
processes, Inter-process communication, Threads.

Processes Synchronization and Scheduling

Processes Synchronization: Background, Process synchronization, Race

condition, Critical Section, Synchronization approaches, Classic process
2 synchronization problems, Semaphores, Monitors 7 Hrs
Process Scheduling: Scheduling criteria, Types of Schedulers, Scheduling
algorithms, Multiple-Processor scheduling, Multilevel Queue Scheduling,
Multilevel Feedback Queue Scheduling

Deadlock
System model, deadlock characterization, methods for handling deadlocks,
3 6 Hrs
deadlock preventions, deadlock avoidance, deadlock detection, deadlock
recovery.
Buffer Cache
4 Buffer Headers, Structure of the Buffer Pool, Scenarios for Retrieval of a Buffer, 6 Hrs
Reading and Writing Disk Blocks, Advantages and Disadvantages of Buffer Cache.
Unit
Title and Content of Unit Hours
No.

Internal Representation of Files and system calls

I-nodes, Structure of the Regular File, Directories, Conversion of a Pathname to I-

node, Super Block, I-node Assignment to a New File, Allocation of Disk Blocks.
5 System Calls: Open, Read, Write, File and Record Locking, Adjusting the position 7 Hrs
of FILE I/O-LSEEK, Close, File Creation, Creation of Special Files, Change Directory
and Change Root, Change Owner and Change Mode, Stat and Fstat, Pipes, Dup,
Mounting and Un-mounting File Systems, Link, Unlink.

Memory Management

Memory Management Strategies: Background, swapping, contiguous and non-

6 contiguous memory allocation, paging, structure of the page table, 6 Hrs
Segmentation. Virtual Memory Management: Background, demand paging,
copy-on write, page replacement, Thrashing

Textbooks
Sr. no. Title Author Edition/Publication
Operating Systems –A Concept
01 Dhananjay M. Dhamdhere TMGH, 3rd Edition
Based approach.
Abraham Silberschatz, Peter
02 Operating System Concepts Wiley
B. Galvin & Grege Gagne
The design of Unix Operating
03 Maurice J. Bach PHI
System

Reference Books
Sr. no. Title Author Edition/Publication

Operating System: Concepts and

01 Milan Milenkovic TMGH
Design

02 Linux System Programming Robert Love SPD, O’ REILLY

Year and Semester Second Year B. Tech - Semester IV - Computer Science and Engineering

Course Category Programme Core Course (PCC)

Title of Course Object Oriented Programming Course Code CSE2202

Contact
L T P Credits
Teaching Scheme Hrs/Week
02 -- -- 02 02
MSE ISE/CA ESE Total
Examination Scheme
30 10 60 100

Course
Object Oriented Programming
Pre-Requisite
To learn the object-oriented programming paradigm, focusing on the definition and
1
use of classes along with the fundamentals of object-oriented design.
2 To learn the syntax and semantics of the C++ programming language
To understand the concept of data abstraction and encapsulation, how to design
Course 3 C++ classes for code reuse, how to implement copy constructors and class member
Objective functions, to overload functions and operators in C++.
To learn how inheritance and virtual functions implement dynamic binding with
4
polymorphism.
To learn how to design and implement generic classes with C++ templates and how
5
to use exception handling in C++ programs
After completion of this course Students will be able to
Apply constructs- sequence, selection and iteration; classes and objects, inheritance,
CO1
use of predefined classes from libraries while developing software.
CO2 Design object-oriented solutions for small systems involving multiple objects.
Course
Outcomes CO3 Use virtual and pure virtual function and complex programming situations.
CO4 Apply object-oriented software principles in problem solving.
CO5 Analyse the strengths of object-oriented programming
CO6 Develop the application using object-oriented programming language (C++).

CO PO Mapping
PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12
CO1 2 1 1 1
CO2 1 2 1 1 1
CO3 2 1 2 2
CO4 2 1 1 1
CO5 1 1
CO6 1 1
Level of Mapping as: Low 1, Moderate 2, High 3
Marking Scheme

• Compulsory passing with 40% marks is mandatory in ESE examinations and combined
passing marks (MSE+ISE/CA+ESE) for theory course is 40 %
• Mid sem. examination will be based on 50 % syllabus from beginning (First Three Units).
• No compulsory passing for MSE.
• ESE paper setting weightage will be, 25 % on syllabus covered for MSE (First Three Units)
and 75 % on remaining syllabus (Last Three Units).

Unit
Title and Content of Unit Hours
No.
Fundamentals of Object-Oriented Programming

Introduction to object-oriented programming, Need of object-oriented

programming, Fundamentals concepts or features of object-oriented programming,
Namespaces, Benefits of OOP, C++ as object-oriented programming language.
C++ Programming- C++ programming Basics, Data Types, Structures, Enumerations,
1 5 Hrs
control structures, Arrays and Strings, Class, Object, class and data abstraction,
Access specifiers, separating interface from implementation. Functions- Function,
function prototype, accessing function and utility function, Constructors and
destructor, Types of constructors, Static members: variable and functions, inline
function, friend function.

Inheritance and Pointers

Inheritance- Base Class and derived Class, protected members, relationship between
base Class and derived Class, Constructor and destructor in Derived Class, Overriding
Member Functions, Class Hierarchies, Public and Private Inheritance, Types of
Inheritance, Ambiguity in Multiple Inheritance, Virtual Base Class, Abstract class,
2 5 Hrs
Friend Class, Nested Class.
Pointers: declaring and initializing pointers, indirection Operators, Memory
Management: new and delete, Pointers to Objects, this pointer, Pointers Vs. Arrays,
accessing Arrays using pointers, Arrays of Pointers, Function pointers, Pointers to
Pointers, Pointers to Derived classes, Passing pointers to functions

Polymorphism
Polymorphism- Introduction to Polymorphism, Types of Polymorphism, Operator
Overloading- concept of overloading, operator overloading, Overloading Unary
Operators, Overloading Binary Operators, Data Conversion, Type casting (implicit and
3 5 Hrs
explicit), Pitfalls of Operator Overloading and Conversion, Keywords explicit and
mutable. Function overloading,
Run Time Polymorphism- Pointers to Base class, virtual function and its significance
in C++, pure virtual function and virtual table, virtual destructor, abstract base class.
Unit
Title and Content of Unit Hours
No.

Files and Streams

Data hierarchy, Stream and files, Stream Classes, Stream Errors, Disk File I/O with
4 Streams, File Pointers, and Error Handling in File I/O, File I/O with Member Functions, 4 Hrs
Overloading the Extraction and Insertion Operators, memory as a Stream Object,
Command-Line Arguments, Printer output.

Exception Handling
Exception Handling- Fundamentals, other error handling techniques, simple
5 exception handling- Divide by Zero, Multiple catching, re-throwing an exception, 3 Hrs
exception specifications, user defined exceptions, processing unexpected exceptions,
constructor, destructor and exception handling, exception and inheritance.
Templates & Standard Template Library (STL)
Templates- The Power of Templates, Function template, overloading Function
templates, and class template, class template and Nontype parameters, template and
6 friends Generic Functions 5 Hrs
STL: Introduction to STL, STL Components, Containers- Sequence container and
associative containers, container adapters, Application of Container classes: vector,
list

Textbooks

Sr. no. Title Author Edition/Publication

01 C++ How to Program Deitel Pearson Education

02 Object-Oriented Programming in C++ Robert Lafore Sams Publishing

Reference Books
Sr. no. Title Author Edition/Publication

McGraw Hill
01 C++-The complete reference Herbert Schildt
Professional

Third Edition
02 The Object-Oriented Thought Process Matt Weisfeld
Pearson

03 Object-Oriented Programming with C++ E. Balagurusamy Graw-Hill

Year and Semester Second Year B. Tech - Semester IV - Computer Science and Engineering

Course Category Programme Core Course (PCC)

Title of Course Automata Theory Course Code CSE2203
Contact
L T P Credits
Teaching Scheme Hrs/Week
03 01 -- 04 04
MSE ISE/CA ESE Total
Examination Scheme
30 10 60 100

Course
Prerequisite: Basic Mathematical Concepts, Sets, graphs. Course Objectives:
Pre-Requisite
To introduce students to the mathematical foundations of computation, the
1
theory of formal languages and grammars.
Course 2 Understand and conduct mathematical proofs for computations.
Objective 3 Understand the use of automata theory in Compliers & System Programming.
To analyse and design finite automata, pushdown automata, grammars & Turing
4
machines.
After completion of this course Students will be able to
CO1 Understand basic concepts of Regular Language and Regular Expressions.
CO2 Select appropriate abstract machine to recognize a given formal language.
Course Generate complex languages by applying Union, Intersection, Complement,
Outcomes CO3
Concatenation and Kleene * operations on simple languages.
CO4 Apply parsing concepts for syntax analysis.
Be familiar with thinking analytically and intuitively for problem solving situations
CO5
in related areas of theory in computer science.

CO PO Mapping
PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12
CO1 2 3
CO2 2 3
CO3 2 2 3
CO4 2 3
Level of Mapping as: Low 1, Moderate 2, High 3

Marking Scheme
• Compulsory passing with 40% marks is mandatory in ESE examinations and combined
passing marks (MSE+ISE/CA+ESE) for theory course is 40 %
• Mid sem. examination will be based on 50 % syllabus from beginning (First Three Units).
• No compulsory passing for MSE.
• ESE paper setting weightage will be, 25 % on syllabus covered for MSE (First Three Units)
and 75 % on remaining syllabus (Last Three Units).
Unit
Title and Content of Unit Hours
No.
Introduction to Automata Theory:

Central Concepts of Automata theory, Recursive Definitions, Regular expressions

1 7 Hrs
and regular languages Deterministic Finite Automata (DFA), Non- Deterministic
Finite Automata (NFA), Epsilon- NFA.

Non-determinism Automata and Kleene’s Theorem

2 Nondeterministic finite automata, NFA with null transition, Equivalence of FA’s, 6 Hrs.
Kleene’s Theorem (Part I & Part II), Minimal Finite Automata, NFA to DFA
Conversion, Minimization of DFA, Role of Lexical Analyser.

Context free Grammars

Definition, Union, Concatenation and Kleene *’s of CFLs, Derivations Using a
3 Grammar, Parse Trees, simplified normal forms-Ambiguity and Elimination of 5 Hrs.
Ambiguity, Elimination of Left Recursion, Left Factoring. Syntax Analysis Phase of
Compilers: Role of Parser

Pushdown Automata
Introduction to Pushdown Automata, Properties of Pushdown Automata,
4 7 Hrs
Equivalence of CFG’s & PDA’s, Parsing with Pushdown Automata-Top-down
parsing, bottom-up parsing, Applications of Pushdown Automata.

Context Free Languages

Formal Definition of CFLs, Properties of Context-Free Languages, Applications of

5 Context-Free Languages, Non-Context-Free Languages, 7 Hrs.
Pumping Lemma- Introduction to the Pumping Lemma, Pumping Lemma for
Context-Free Languages.

Turing machines
6 Definition, TM as language acceptors, computing partial function with a TM, 7 Hrs.
combining Turing machines, multi-tape TMs and Universal TM.

Text books
Sr. no. Title Author Edition/Publication

Introduction to Languages & the

01 John C. Martin Tata McGraw Hill
Theory of Computations

Discrete Mathematical Structures with J. P. Trembley &

02 MGH
applications to Computer Science R. Manohar
Reference Books
Sr. no. Title Author Edition/Publication

John E. Hopcraft,
Introduction to Automata Theory,
01 Raje, Motwani, Pearson Edition
Languages and computation
Jeffrey D. Ullman

Introduction to theory of Thomson

02 Michael Sipser
Computations Books/Cole

OXFORD Higher
03 Theory of Computation Vivek Kulkarni
Education
Year and Semester Second Year B. Tech - Semester IV - Computer Science and Engineering

Course Category Multi-disciplinary Minor – 02

Title of Course Object Oriented Programming (MDM-02) Course Code CSE2204

Contact
L T P Credits
Teaching Scheme Hrs/Week
02 -- -- 02 02
MSE ISE/CA ESE Total
Examination Scheme
30 10 60 100

Course
C Programming
Pre-Requisite
To learn the object-oriented programming paradigm, focusing on the definition and
1
use of classes along with the fundamentals of object-oriented design.
2 To learn the syntax and semantics of the C++ programming language
To understand the concept of data abstraction and encapsulation, how to design
Course 3 C++ classes for code reuse, how to implement copy constructors and class member
Objective functions, to overload functions and operators in C++.
To learn how inheritance and virtual functions implement dynamic binding with
4
polymorphism.
To learn how to design and implement generic classes with C++ templates and how
5
to use exception handling in C++ programs
After completion of this course Students will be able to
Apply constructs- sequence, selection and iteration; classes and objects, inheritance,
CO1
use of predefined classes from libraries while developing software.
CO2 Design object-oriented solutions for small systems involving multiple objects.
Course
Outcomes CO3 Use virtual and pure virtual function and complex programming situations.
CO4 Apply object-oriented software principles in problem solving.
CO5 Analyse the strengths of object-oriented programming
CO6 Develop the application using object-oriented programming language (C++).

CO PO Mapping
PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12
CO1 2 1 1 1
CO2 1 2 1 1 1
CO3 2 1 2 2
CO4 2 1 1 1
CO5 1 1
CO6 1 1
Level of Mapping as: Low 1, Moderate 2, High 3
Marking Scheme

• Compulsory passing with 40% marks is mandatory in ESE examinations and combined
passing marks (MSE+ISE/CA+ESE) for theory course is 40 %
• Mid sem. examination will be based on 50 % syllabus from beginning (First Three Units).
• No compulsory passing for MSE.
• ESE paper setting weightage will be, 25 % on syllabus covered for MSE (First Three Units)
and 75 % on remaining syllabus (Last Three Units).

Unit
Title and Content of Unit Hours
No.
Fundamentals of Object-Oriented Programming

Introduction to object-oriented programming, Need of object-oriented

programming, Fundamentals concepts or features of object-oriented programming,
Namespaces, Benefits of OOP, C++ as object-oriented programming language.
C++ Programming- C++ programming Basics, Data Types, Structures, Enumerations,
1 5 Hrs
control structures, Arrays and Strings, Class, Object, class and data abstraction,
Access specifiers, separating interface from implementation. Functions- Function,
function prototype, accessing function and utility function, Constructors and
destructor, Types of constructors, Static members: variable and functions, inline
function, friend function.

Inheritance and Pointers

Inheritance- Base Class and derived Class, protected members, relationship between
base Class and derived Class, Constructor and destructor in Derived Class, Overriding
Member Functions, Class Hierarchies, Public and Private Inheritance, Types of
Inheritance, Ambiguity in Multiple Inheritance, Virtual Base Class, Abstract class,
2 5 Hrs
Friend Class, Nested Class.
Pointers: declaring and initializing pointers, indirection Operators, Memory
Management: new and delete, Pointers to Objects, this pointer, Pointers Vs. Arrays,
accessing Arrays using pointers, Arrays of Pointers, Function pointers, Pointers to
Pointers, Pointers to Derived classes, Passing pointers to functions

Polymorphism

Polymorphism- Introduction to Polymorphism, Types of Polymorphism, Operator

Overloading- concept of overloading, operator overloading, Overloading Unary
Operators, Overloading Binary Operators, Data Conversion, Type casting (implicit and
3 5 Hrs
explicit), Pitfalls of Operator Overloading and Conversion, Keywords explicit and
mutable. Function overloading,
Run Time Polymorphism- Pointers to Base class, virtual function and its significance
in C++, pure virtual function and virtual table, virtual destructor, abstract base class.
Unit
Title and Content of Unit Hours
No.

Files and Streams

Data hierarchy, Stream and files, Stream Classes, Stream Errors, Disk File I/O with
4 Streams, File Pointers, and Error Handling in File I/O, File I/O with Member Functions, 4 Hrs
Overloading the Extraction and Insertion Operators, memory as a Stream Object,
Command-Line Arguments, Printer output.

Exception Handling
Exception Handling- Fundamentals, other error handling techniques, simple
5 exception handling- Divide by Zero, Multiple catching, re-throwing an exception, 3 Hrs
exception specifications, user defined exceptions, processing unexpected exceptions,
constructor, destructor and exception handling, exception and inheritance.
Templates & Standard Template Library (STL)
Templates- The Power of Templates, Function template, overloading Function
templates, and class template, class template and Nontype parameters, template and
6 friends Generic Functions 5 Hrs
STL: Introduction to STL, STL Components, Containers- Sequence container and
associative containers, container adapters, Application of Container classes: vector,
list

Textbooks

Sr. no. Title Author Edition/Publication

01 C++ How to Program Deitel Pearson Education

02 Object-Oriented Programming in C++ Robert Lafore Sams Publishing

Reference Books
Sr. no. Title Author Edition/Publication

McGraw Hill
01 C++-The complete reference Herbert Schildt
Professional

Third Edition
02 The Object-Oriented Thought Process Matt Weisfeld
Pearson

03 Object-Oriented Programming with C++ E. Balagurusamy Graw-Hill

Year and Semester Second Year B. Tech - Semester IV - Computer Science and Engineering

Course Category OE
Open Elective-2
Title of Course Course Code CSE2205
Computer Organization & Architecture
Contact
L T P Credits
Teaching Scheme Hrs/Week
02 -- -- 02 02

MSE ISE/CA ESE Total

Examination Scheme
30 10 60 100

Course
Fundamentals of Computer
Pre-Requisite
1 To provide a high-level overview of Computer organization
2 To discuss the basic of I/O addressing and access
Course To make the students aware of overall design and architecture of computer and its
Objective 3
organization
To analyse performance issues in processor and memory design of a digital
4
computer
After completion of this course Students will be able to
Recapitulate the history of computer system and the basic concepts of computer
CO1
architecture and organization
CO2 Understand the concept of I/O organization
Course
Outcomes CO3 Apply the different algorithms to perform arithmetic operations
CO4 Articulate the design issues in the development of processor
CO5 Conceptualize instruction level parallelism
CO6 Understand the concept of memory techniques

CO PO Mapping
PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12
CO1 2 1 1
CO2 1 1
CO3 1 1 1
CO4 1 2 1 1 1 1
CO5 1 1
CO6 1 1
Level of Mapping as: Low 1, Moderate 2, High 3

Marking Scheme

• Compulsory passing with 40% marks is mandatory in ESE examinations and combined
passing marks (MSE+ISE/CA+ESE) for theory course is 40 %
• Mid sem. examination will be based on 50 % syllabus from beginning (First Three Units).
• No compulsory passing for MSE.
• ESE paper setting weightage will be, 25 % on syllabus covered for MSE (First Three Units) and
75 % on remaining syllabus (Last Three Units).
Unit
Title and Content of Unit Hours
No.

Computer Evolution and Performance

1 4 Hrs
Evolution of computer – Mechanical Era: Babbage’s Difference Engine, Generations of
Computer, Difference between RICS and CISC

Input and Output Organization

2 4 Hrs
Accessing I/O devices, Direct Memory Access (DMA), Buses: Synchronous Bus and
Asynchronous Bus, Interface Circuits, Standard IO Interface

Arithmetic
3 Addition and Subtraction of Signed Numbers, Multiplication of Positive numbers, Signed 4 Hrs
Operand Multiplication, Integer Division, IEEE 754 Floating Point Format

The Processing Unit

4 Some fundamental Concepts, Execution of complete Instruction, Multiple bus 4 Hrs

organization, Hardwired control, Micro programmed Control

Pipelining

5 Role of Cache Memory, Pipeline Performance. Data Hazards: Operand Forwarding, 5 Hrs
Handling Data Hazards

Computer Memory System

6 Some Basic Concepts, Types of Memories: ROM and RAM, Cache Memories: Mapping 5 Hrs
functions, Replacement Algorithms, Example of Mapping

Textbooks

Sr. No. Title Author Edition/Publication

01 Computer Architecture and Organization John P Hayes (MGH) 3rdEdition

Carl Hamacher,
Tata McGraw Hill.
02 Computer Organization ZvonkoVranesic and
5thEdition
SafwatZaky

Reference Books

Sr. No. Title Author Edition/Publication

Computer Systems Organization &

01 John D. Carpinelli Pearson Education
Architecture
 Year and Semester Second Year B. Tech (Computer Science and Engineering) Semester IV

Course Category Humanities Social Science and Management (HSSM) AEC

Title of Course Soft Skills Course Code CSE2206

Contact
L T P Credits
Hrs/Week
Teaching Scheme
-- 02 -- 02 02

MSE ISE/CA ESE Total

Examination
Scheme
-- 25 25 50

Course
English Language, Professional Communication Skills.
Pre-Requisite
To make the engineering students aware of the importance, the role and the
1 content of soft skills through instruction, knowledge acquisition,
demonstration and practice.
To develop and nurture the soft skills of the students through individual and
Course 2
group activities.
Objective
To expose students to right attitudinal and behavioural aspects and to build
3
the same through activities
To encourage the all-round development of students by focusing on soft
4
skills.
After completion of this course Students will be able to
CSE2206.1 Demonstrate effective communication through verbal/written
communication and improved listening skill.
CSE2206.2 Exhibit effective communication in group discussion/meetings/interviews,
Course
prepare & presentations.
Outcomes
CSE2206.3 Demonstrate effective communication in multi-disciplinary and
heterogeneous teams through the knowledge of team work, inter-personal
relationships, conflict management and leadership quality.
CSE2206.4 Write precise briefs or reports and technical documents.

CO PO Mapping
PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12
CO1 2 3 3
CO2 3 3 3 2 2
CO3 2 3 3 2 2
CO4 2 3 2 2
Level of Mapping as: Low 1, Moderate 2, High 3
Marking Scheme

In Semester Evaluation/ Continuous Assessment has 50 Marks

Parameters for In Semester Evaluation could be: Attendance, Tutorials, Group Discussion,
Seminar, Power point Presentation on technical or non-technical topics, and LSRW Activities etc.
Assignment should be given and should be assessed continuously during academic.

End Semester Evaluation has 25 Marks

External Oral Examination

Unit
Title and Content of Unit Hours
No.

Understanding Communication Skills

1 Understanding Communication Skills: Verbal Communication - Effective 4Hrs

Communication - Active listening – Articulation Paraphrasing – Feedback
Non- Verbal Communication- Body Language of self and others- LSRW Skills

Behavioral Skills /Self Development:

2 Behavioral Skills /Self Development: SWOT Analysis, Confidence improvement, 4Hrs
values, positive attitude, positive thinking and self-esteem.

Leadership and Team Building

Leadership and Team Building, Culture and Leadership- Salient Features of
3 Corporate Culture, Leadership Styles, Leadership Trends, Team Building- Team 4Hrs
Development Stages, Types of Teams, Attributes of a successful team – Barriers
involved
Developing Writing skills
4 4Hrs
Developing Writing skills, E-mail writing, report writing, resumes writing, practice.

Stress and Time Management

Stress and Time Management
Stress in Today‘s Time- Identify the Stress Source, Signs of Stress, Ways to Cope
5 5 Hrs
with Stress. Healthier Ways to Combat Stress, Steps to be taken in the
Organizations: Open communication, Time Management, working towards Your
Goals, Smart Work, Prioritize your Tasks
Professional Skill
Professional Skill
Ethics, Etiquette and Mannerism-All types of Etiquette (at Meetings, Etiquette at
Dining. Involuntary Awkward Actions, Public Relations Office (PRO)‘s Etiquettes)
6 5 Hrs
Technology Etiquette: Phone Etiquette, Email Etiquette, Social Media Etiquette,
Video Conferencing Etiquette, Interview Etiquette. Dressing Etiquettes: for
Interview, offices and social functions. Ethical Values: Importance of Work Ethics,
Problems in the Absence of Work Ethics.
Guidelines for Tutorial Performance (ISE/CA)

ISE/CA- In Semester Evaluation/Continuous Assessment:

✓ The instructor shows videos to enhance skills supporting career aspects and discussion about
same videos. Multiple set of observations based on videos can be prepared by students.
✓ Multiple set of activity-based assignments can be prepared to allow multiple skills exposure
for example a group task encouraging discussions, team building, value sharing, leadership
and role play all at the same time. Every student must be given adequate opportunity to
participate actively in each activity.
✓ Each student will write one report based on visit / project / business proposal etc.
✓ Faculty may arrange one or more sessions from following: Yoga and Meditation. Stress
management, relaxation exercises, and fitness exercises. Time management and personal
planning sessions.
✓ The student must prepare the journal in the form of report elaborating the activities
performed in the lab. Continuous assessment of laboratory work is to be done based on
overall performance and lab assignments performance of student. Each lab assignment
assessment will assign grade/marks based on parameters with appropriate weightage.
Suggested parameters for overall assessment as well as each lab assignment assessment
include- timely completion, performance, punctuality, neatness, enthusiasm, participation and
contribution in various activities-SWOT analysis, presentations, team activity, event
management, group discussion, Group exercises and interpersonal skills and similar other
activities/ assignments.

Sr. No. Title of Assignment

01 Communication Skills
02 SWOT Analysis
03 Positive attitude
04 Leadership and team building
05 Developing writing skills: Email, report & resume
06 Stress management
07 Time management
08 Ethic and etiquettes
09 Ethical values
10 Group Discussion
11 Power point Presentation on technical or non-technical topics
Textbooks
Sr. no. Title Author Edition/Publication
Soft Skills- Know Yourself and Know S. Chand &
01 Dr. K. Alex
the world Company Pvt. Ltd.
Gajendra Singh
Soft Skills – An Integrated Approach
02 Chauhan, Sangeeta WILEY INDIA
to Maximize Personality,
Sharma
MacMillan India
Krishna Mohan and
03 Developing Communication Skills Ltd.,
Meera Banerji
Delhi
Prentice Hall of
04 Essentials of Effective Communication Ludlow and Panthon
India

Reference Books
Sr. no. Title Author Edition/Publication
An Approach to Communication
01 Indrajit Bhattacharya Delhi, Dhanpat Rai
Skills
Cambridge
02 English for Business Communication Simon Sweeney
University Press
Year and Semester Second Year B. Tech - Semester III - Computer Science and Engineering

Course Category (Humanities Social Science and Management (HSSM) EEMC

Title of Course Employability Enhancement Skills-II Course Code CSE2207

Contact
L T P Credits
Teaching Scheme Hrs/Week
02 -- -- 02 2
MSE ISE/CA ESE Total
Examination Scheme
-- 25 -- 25

Course
Employability Enhancement Skills-II
Pre-Requisite
To enable the students to understand, Interpret & use formal and technical
1
communication.
To enhance and apply the concept in productivity & quality management in day-
Course 2
to-day work to improve productivity & quality.
Objective Utilize basic Employability skills and tools to take benefit of connection in the
3
industry.
4 To build communication skills among the students required for Digital Platforms.
After completion of this course Students will be able to
Demonstrate proficiency in critical thinking by analysing complex problems and
CO1
proposing effective solutions.
Course CO2 Exhibit creativity through the development of innovative projects and solutions.
Outcomes Display heightened emotional intelligence by managing stress, communicating
CO3
empathetically, and resolving conflicts constructively.
Showcase collaborative skills by actively participating in group activities,
CO4
contributing to team goals, and communicating ideas effectively.

CO PO Mapping
PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12
CO1 3 3
CO2 2 1
CO3 3 2
CO4 3 3
Level of Mapping as: Low 1, Moderate 2, High 3

Marking Scheme
In Semester Evaluation/ Continuous Assessment has 50 Marks
Parameters for In Semester Evaluation could be: Attendance, Assignments, Presentation, Online
Activities like (Virtual Labs, NPTEL) etc.
• Lab File should be prepared and should be assessed continuously during academic.
Unit
Title and Content of Unit Hours
No.
Problem Solving:
Problem Solving, Critical thinking and decision making, Creative thinking,
1 Group Dynamics & Decision-Making Techniques, 4 Hrs
Customer Centricity - Types of customers,
Responding effectively to customers

Inter-Personal & Inter-Organisational Communication

Inter-Personal & Inter-Organisational Communication,
2 Emotional Intelligence & Stress Management, 4 Hrs
Teamwork, Work efficiency,
Team collaboration, Conflict management

Maintaining Efficiency at Workplace

Factors affecting productivity, Improving Productivity, Basic provisions on safety
3 4 Hrs
and Health, Self-Awareness, articulating personal values, Value-based decision
making, Dilemma situations.

Entrepreneurial Mindset:
Opportunity recognition, Creativity and innovation,
4 Conception and ideation, Identify the customer, 5 Hrs
Self-confidence and resilience, Competition analysis,
Leadership and team spirit, Serving the society, Taking ownership

Preparation to the world of work

Career Plan: Identify the difference between job and career, Job roles available in
respective trades.
Career Pathways: Awareness of industries, and the respective professional
5 pathways 5 Hrs
Search and apply for a job: Awareness of higher education, up skilling (short-
term) options Steps involved in online application for Instructor course,
Apprenticeship and different jobs in popular site like theindiajobs.com,
naukri.com, monsterindia.com, Govt. website

Getting Started with LinkedIn:

Introduction to LinkedIn, Setting up your profile.

6 4 Hrs
Connecting to companies and influencers, highlighting your skills,
managing recommendations and endorsement, Effective job searching in LinkedIn
Textbooks
Sr. no. Title Author Edition/Publication

The Art and Science of Business P. D. Chaturvedi and

4th Edition, Pearson
01 Communication-Skills, Concepts, Cases Mukesh Chaturvedi
Education
and Applications (2017)

Critical Thinking: An Introduction to Oxford University

02 Wright, L.
Analytical Reading and Reasoning Press

Think Smarter: Critical Thinking to

03 Improve Problem-Solving and Kallet, M. Wiley
Decision-Making Skills

Reference Books
Sr. no. Title Author Edition/Publication

Emotional Intelligence 2.0. Talent Bradberry, T.,

01
Smart & Greaves, J.

Mindset: The New Psychology of

02 Dweck, C. S. Ballantine Books
Success

Chakravarthi T. Kalyana
Biztantra
03 Soft Skills for Managers and
Publications, 2014
Chakravarthi T. Latha

Kumar Sanjay and Pushp 2nd Edition, Oxford

04 Communication Skills
Lata University Press
Year and Semester Second Year B. Tech - Semester IV - Computer Science and Engineering

Course Category Vocational and Skill Enhancement Course (VSEC)

Title of Course Operating System Lab Course Code CSE2208

Contact
L T P Credits
Hrs/Week
Teaching Scheme
-- -- 02 02 01

MSE ISE/CA ESE Total

Examination
Scheme
-- 50 -- 50

Course
Computer Network, Data Structure
Pre-Requisite
1 Understand and Install Operating Systems.

Course 2 Apply UNIX Commands for System and File Management.

Objective 3 Implement CPU Scheduling and Process Management Techniques.

4 Solve Synchronization and Deadlock Problems.

After completion of this course Students will be able to

Students will be able to install different operating systems and configure their
CO1 settings, gaining foundational knowledge in OS installation procedures and
system setup.

Students will demonstrate proficiency in using basic UNIX utility commands for
Course CO2 file and directory management, as well as managing file access permissions,
Outcomes enhancing their command-line skills for system administration.

Students will implement various CPU scheduling algorithms and manage UNIX
CO3 processes, from creation to termination, improving their understanding of
process scheduling and control in operating systems.

Students will develop programs to address synchronization issues and apply

CO4
deadlock avoidance strategies for deadlock management.

CO PO Mapping
PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12
CO1 2 2
CO2 2 1
CO3 2 2
CO4 2 1
Level of Mapping as: Low 1, Moderate 2, High 3
Marking Scheme

In Semester Evaluation/ Continuous Assessment has 50 Marks

Parameters for In Semester Evaluation could be: Attendance, Assignments, Unit Tests,
Presentation, Online Activities like (Virtual Labs, NPTEL) etc.
Lab File should be prepared and should be assessed continuously during academic.

Guidelines for Lab Performance

Faculty can create Experiment list based on following listed topics.

Minimum 08 to 10 Experiments should get performed.

Exp. No. Title of Experiment/ Problem Statement

1 Installation of various Operating System.

2 Demonstration of basics of UNIX utility commands.
3 Demonstration of File and Directory management Commands
4 Demonstration of various File access and permission Commands.
5 Implementation of CPU Scheduling Algorithms.
6 Implementation of various operations on Files (Create, Open, Read, Write, Append)
Demonstration of UNIX Process Management – from process creation to process
7
termination.
8 Write a program to simulate producer-consumer problem using semaphores.

9 Write a program based on Banker’s algorithm for Deadlock Avoidance.

10 Implementation of Shell Scripts.

Textbooks
Sr. no. Title Author Edition/Publication
Abraham Silberschatz,
01 Operating System Concepts Peter B. Galvin & Grege Wiley
Gagne
02 The design of Unix Operating System Maurice J. Bach PHI

Reference Books
Sr. no. Title Author Edition/Publication

01 Unix concepts & administration Sumitabh Das Tata McGrow Hill,

Year and Semester Second Year B. Tech - Semester III - Computer Science and Engineering

Course Category VEC

Title of Course Object Oriented Programming Lab Course Code CSE2209

Contact
L T P Credits
Teaching Scheme Hrs/Week
-- -- 04 04 02
MSE ISE/CA ESE Total
Examination Scheme
-- 50 25 75

Course
Object Oriented Programming
Pre-Requisite
To learn the object-oriented programming paradigm, focusing on the definition
1
and use of classes along with the fundamentals of object-oriented design.
2 To learn the syntax and semantics of the C++ programming language
To understand the concept of data abstraction and encapsulation, how to design
Course 3 C++ classes for code reuse, how to implement copy constructors and class
Objective member functions, to overload functions and operators in C++.
To learn how inheritance and virtual functions implement dynamic binding with
4
polymorphism.
To learn how to design and implement generic classes with C++ templates and
5
how to use exception handling in C++ programs
After completion of this course Students will be able to
Apply constructs- sequence, selection and iteration; classes and objects,
CO1
inheritance, use of predefined classes from libraries while developing software.
CO2 Design object-oriented solutions for small systems involving multiple objects.
Course
Outcomes CO3 Use virtual and pure virtual function and complex programming situations.
CO4 Apply object-oriented software principles in problem solving.
CO5 Analyse the strengths of object-oriented programming
CO6 Develop the application using object-oriented programming language (C++).

CO PO Mapping
PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12
CO1 2 1 1 1
CO2 1 2 1 1 1
CO3 2 1 2 2
CO4 2 1 1 1
CO5 1 1
CO6 1 1
Level of Mapping as: Low 1, Moderate 2, High 3
Marking Scheme

In Semester Evaluation/ Continuous Assessment has 50 Marks

Parameters for In Semester Evaluation could be: Attendance, Assignments, Unit Tests,
Presentation, Online Activities like (Virtual Labs, NPTEL) etc.
Lab File should be prepared and should be assessed continuously during academic.

End Semester Evaluation has 25 Marks

External Practical Examination with Performance and Oral Examination

Experiment List: Minimum 12 to 15 Experiments should get performed:

Sr. no. Experiment Name

Implement a program to define a Student class with attributes like name, roll number,
1
and marks. Implement member functions to input and display student details.

Implement a program to create a Complex class to represent complex numbers.

2
Implement member functions for addition, subtraction, and display of complex numbers

Develop a simple banking system with classes for Account, Savings Account, and
3 Checking Account. Implement features such as deposit, withdrawal, and account
statement.

Implement a Rectangle class with attributes for length and width. Include constructors, a
4
destructor, and member functions to calculate the area and perimeter

5 Implement a Program to find out area of different shapes using function overloading

Implement a program to create student class from which derive test class and from test
6
class derive the result class

Implement a class hierarchy for a simple library system with a base class Library item.
7
And derived classes Book and Magazine.

Implement a program to perform multiple inheritances for Educational Institute

8
database.

9 Implement a program to perform Hybrid Inheritance.

10 Implement a program to overload all unary and binary operators.

11 Implement a program to overload relational operators.

12 Program to overload insertion and extraction operators.

Implement a program to create a base class Shape with a virtual function area (). Derive
13 two classes Circle and Rectangle from Shape and implement the area()
function in each derived class
Sr. no. Experiment Name
Implement a program to create a base class Employee with a virtual function
14 calculateSalary(). Derive two classes Fulltime Employee and Part Time Employee and
Implement the calculateSalary() function in each derived class.

Implement a program to write user input data to a file and then read it back from the
15
file

Implement a program that uses try, catch, and throw to handle division by zero
16 exceptions. Create a custom exception class InvalidAgeException and use it to validate
the age input for a Person class.

Implement program using template function to find the maximum of two numbers.
17 Create a program that demonstrates the use of STL containers (vector, list, map) for
basic operations.

Textbooks
Sr. no. Title Author Edition/Publication
01 C++ How to Program Deitel Pearson Education
02 Object-Oriented Programming in C++ Robert Lafore Sams Publishing

Reference Books
Sr. no. Title Author Edition/Publication

McGraw Hill
01 C++-The complete reference Herbert Schildt
Professional

Third Edition
02 The Object-Oriented Thought Process Matt Weisfeld
Pearson

Object-Oriented Programming
03 E. Balagurusamy Graw-Hill
with C++
Year and Semester Second Year B. Tech - Semester IV - Computer Science and Engineering
Course Category Vocational and Skill Enhancement Course (VSEC)
Title of Course Mini Project-I Lab Course Code CSE2210
Contact
L T P Credits
Teaching Scheme Hrs/Week
-- -- 02 02 01
MSE ISE/CA ESE Total
Examination Scheme
-- 25 25 50

Course
Knowledge of software engineering and C/C++/Python
Pre-Requisite
1 To expose the students to solve the real-world problems.
Course To utilize the techniques. Skills and modern Engineering tools for building the
2
Objective project.
3 To follow the methods and tasks as per SDOLC Approach
After completion of this course Students will be able to
CO1 Define the problem statement.
CO2 Organize, Plan and prepare the detailed project activities.
Course CO3 Construct Flowchart, System Architecture based on the project description
Outcomes CO4 Implement the solution for their problem.
CO5 Demonstrate project management principles during project work
Demonstrate capabilities of oral communication and self-learning in a group,
CO6
which leads to lifelong learning.

CO PO Mapping
PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12
CO1 2 3
CO2 2 3
CO3 2 2 3
CO4 2 2 2 3
CO5 3
CO6 2 2 3 3 2
Level of Mapping as: Low 1, Moderate 2, High 3

In Semester Evaluation (ISE)/Continuous Assessment (CA)

The review/ progress monitoring committee shall be constituted by head of departments of each
institute. The progress of mini project to be evaluated on continuous basis, minimum two reviews.

In continuous assessment focus shall also be on each individual student, assessment based on
individual’s contribution in group activity, their understanding and response to questions.
Distribution of ISE/ CA marks shall be as below: Marks
1 Marks awarded by guide/supervisor 10
2 Marks awarded by review committee 10
3 Quality of Project report 05
Guidelines for Mini Project

✓ Students shall form a group of 3 to 4 students, while forming a group shall not be allowed
less than three or more than four students, as it is a group activity.
✓ The Mini Project topic should be based on the any one subject concept that students have
studied for their Academic Year.
✓ Students should do survey and identify needs, which shall be converted into problem
statement for mini project in consultation with faculty supervisor/head of
department/internal committee of faculty members
✓ In the Synopsis they have to state Flowchart, Usage of the logic, algorithm, functions and
suitable data structure for implementing the solution. They have to implement project using
C, C++ and Python languages.
✓ Faculty supervisor may give inputs to students during mini project activity; however, focus
shall be on self-learning.
✓ Students in a group shall understand problem effectively, propose multiple solution and
select best possible solution in consultation with guide/ supervisor.

Guidelines for Assessment of Mini Project Lab

Report should be prepared as per the guidelines issued by the Shivaji University,
1
Kolhapur
Mini Project shall be assessed through a presentation and demonstration of working
model by the student project group to a panel of Internal and External Examiners
2 preferably from industry or research organizations having experience of more than five
years approved by
head of Institution.

Mini Project shall be assessed based on following points;

1 Quality of problem and Clarity
2 Innovativeness in solutions, Cost effectiveness and Societal impact
3 Full functioning of working model as per stated requirements
4 Effective use of skill sets & programming languages learnt.
5 Contribution of an individual’s as member or leader
6 Presentation and ability to explain the project.
 Second Year B. Tech Semester IV
Year and Semester
(Common to All Branches of Engineering)

Course Category Basic Science Courses (BSC)

Title of Course Environmental Science Course Code CSE2212

Contact
L T P Credits
Hrs/Week
Teaching Scheme
02 -- -- 02 Audit

MSE ISE/CA ESE Total

Examination
Scheme
30 10 60 100

1 Understand the scope & multidisciplinary nature of Environmental Studies

Get acquainted with the problems associated with natural resources and their
2
Course conservation
Objective
3 Familiarize the environmental & social problems with global concern

4 Recognize the importance of Biodiversity with respect to Western Ghats

Blooms
After completion of this course Students will be able to
Taxonomy

Understand the importance of Environmental Studies and recognize

CO1 II
significance of ecosystem

Classify the values of natural resources with associated problems for

CO2 II
sustainable lifestyles

Course CO3 Describe the social and global environmental issues II

Outcomes

CO4 Make aware of Pollution issues with its mitigation measures II

Familiarize the basics of Biodiversity and concerned issues in the context

CO5 II
of Western Ghats

Acquaint with the role of environmental laws and regulations in

CO6 I
conservation efforts
Unit
Title and Content of Unit Hours
No.

Nature of Environmental Studies and Importance of ecosystems.

• Definition, scope and importance.

• Multidisciplinary nature of environmental studies
• Need for public awareness.
• Ecosystem
• Concept of an ecosystem.
• Structure and function of an ecosystem.
• Producers, consumers and decomposers.
1 6 Hrs
• Food chains, food webs and ecological pyramids
• Introduction, types, characteristics 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)
• Degradation of the ecosystems and it’s impacts.

Natural Resources and Associated Problems

• Forest resources: Use and over-exploitation, deforestation, dams and their

effects on forests and tribal people.
• Water resources: Use and over-utilization of surface and ground water,
floods, drought, conflicts over water, dams-benefits and problems.
• Mineral resources: Usage and exploitation. Environmental effects of
extracting and using mineral resources.
2 • Food resources: World food problem, changes caused by agriculture, 6 Hrs
effect of modern agriculture, fertilizer-pesticide problems.
• Energy resources: Growing energy needs, renewable and non- renewable
energy resources, use of alternate energy sources. Solar energy, Biomass
energy.
• Land resources: Land as a resource, land degradation, man induced
landslides, soil erosion and desertification.
• Role of individuals in conservation of natural resources. Equitable use of
resources for sustainable lifestyles.
Unit
Title and Content of Unit Hours
No.

Social Issues and the Environment

• Human population growth and impact on environment.

• Environmental ethics: Role of Indian religious traditions and culture in
conservation of the environment.
• Environmental movements- Chipko Movement, Appiko Movement, Silent
3 4 Hrs
Valley Movement.
• Resettlement and rehabilitation of people; its problems and concerns.
• Water conservation, rain water harvesting.
• Disaster management: floods, earthquake, cyclone, tsunami and
landslides, Case studies.

Environmental Pollution

• Definition: Causes, effects and control measures of: Air pollution, Water
pollution, Soil pollution, Marine pollution, Noise pollution, Thermal
4 pollution, Global warming, acid rain, ozone layer depletion. 5 Hrs
• Solid waste Management: Causes, effects and control measures of urban
and industrial wastes. Solid waste management, control & rules,
• Role of an individual in prevention of pollution

Biodiversity and its conservation:

• Introduction- Definition: genetic, species and ecosystem diversity.

• Bio-geographical classification of India.
• Value of biodiversity: consumptive use, productive use, social, ethical,
aesthetic and option values.
5 • India as a mega- diversity nation. 5 Hrs
• Western Ghat as a biodiversity region. Hot-spots of biodiversity.
• Threats to biodiversity: habitat loss, poaching of wildlife, man- wildlife
conflicts,
• Conservation of biodiversity: In-situ and Ex- situ conservation of
biodiversity.

Environmental Protection-Policies and practices

• Environment Protection Act.

• Air (Prevention and Control of Pollution) Act.
6 • Water (Prevention and control of Pollution) Act 4 Hrs
• Wildlife Protection Act
• Forest Conservation Act
• National and International Conventions and agreements on environment.
 Field work: (Field work is equal to 4 lectures) 10 marks
Note - The ISE/CA is carried out through the Field work and Report writing.

• Visit to a local area to document environmental assets river/ forest/grassland/hill/mountain

• Visit to a local polluted site-Urban/Rural/Industrial/Agricultural
• Study of common plants, insects, birds.
• Study of simple ecosystems-pond, river, hill slopes, etc.

References:
Reference Books
1 Raut P.D., Environmental Studies, Shivaji University Press, 2021

Gleick, H.,1993, Water in crisis, Pacific Institute for studies in Dev., Environment & Security.
2
Stockholm Env. Institute. Oxford Univ. Press 473p
Hawkins R.e., Encyclopedia of Indian Natural History, Bombay Natural History Society, Bombay
3
(R)
Heywood, V.H. & Watson, R.T.1995, Global Biodiversity Assessment, Cambridge Univ. Press
4
1140p.
Jadhav, H. & Bhosale, V.M.1995, Environmental Protection and Laws, Himalaya Pub. House,
5
Delhi 284p.
McKinney, M.L. & School. R.M.1196, Environmental Science Systems & Solutions, Web
6
enhanced edition, 639p
7 Mhaskar A.K., Master Hazardous, Techno-Science Publications (TB)

Question Paper Format (S.Y. B. Tech) NEP2020

Environmental Science End Semester Examination Marks – 60 Marks

All Questions are compulsory Q1 to Q4

Q.1 Attempt Any Three Questions 15 Marks
A Unit 1 5
B Unit 2 5
C Unit 3 5
D Unit 1 to 3 (Any one) 5
Q.2 Attempt Any Three Questions 15 Marks
A Unit 4 5
B Unit 4 5
C Unit 4 5
D Unit 4 5
Q.3 Attempt Any Three Questions 15 Marks
A Unit 5 5
B Unit 5 5
C Unit 5 5
D Unit 5 5
Q.4 Attempt Any Three Questions 15 Marks
A Unit 6 5
B Unit 6 5
C Unit 6 5
D Unit 6 5
Year and Semester Second Year B. Tech Semester IV

Course Category VSEC

Title of Course Computer Maintenance Technology Course Code CSE2212

Contact
L T P Credits
Hrs/Week
Teaching Scheme
-- -- 02 02 01

MSE ISE/CA ESE Total

Examination
Scheme
-- 50 -- 50

Course
Basics of Operating System, Basic Computer knowledge, Basic Problem-Solving Skills.
Pre-Requisite
1 To understand the construction and working of Input & Output devices

Course 2 To Know the Troubleshooting and preventive maintenance of PC.

Objective 3 Troubleshoot peripherals and networks.
4 Select processors required for relevant systems.
After completion of this course Students will be able to
CO1 Identify different types of computer systems.
Course
CO2 Perform formatting, partitioning and Hard disk installation.
Outcomes
CO3 Troubleshoot common motherboard problems.
CO4 Test power supplies.

CO PO Mapping
PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12
CO1 2 3 3
CO2 2 3 3
CO3 2 3 2
CO4 2 3 2
Level of Mapping as: Low 1, Moderate 2, High 3

Marking Scheme

In Semester Evaluation/ Continuous Assessment has 50 Marks

Parameters for In Semester Evaluation could be: Attendance, Assignments, Practical,
Presentation, Online Activities like (Virtual Labs, NPTEL) etc.
Lab File should be prepared and should be assessed continuously during academic.
 Guidelines for Practical Performance
Faculty can create Experiment list based on following listed topics.
Minimum 10 to 12 Experiments should get performed along with flow chart and Execution.

Exp. No. Title of Experiment/ Problem Statement

1 Desktop/laptop/server type identification and its specification
2 Identification and cleaning of Components
3 Preventive Maintenance of PC
4 Perform Internal socket connections
5 Perform BIOS settings
6 Installation of Windows Operating System
7 Installation of Unix family Operating System
8 Peripheral devices cleaning
9 Installation of local and Network printer
10 Share devices, files and folders
11 Installation of scanner
12 Set Input/output devices
13 Connect devices to external port
14 Networking devices connection
15 Fiber optic cable construction
16 Connection of Switches/Hub
17 Setup wired network environment
18 Setup wireless I/O devices
19 Fault diagnostics
20 Component replacement

Textbooks
Sr. no. Title Author Edition/Publication
BPB Publication, New
01 The Complete PC Upgrade And maintenance Guide Minasi, Mark
Delhi
02 Hardware Trouble Shooting and Maintenance B. Govindarajalu Tata McGraw Hill

Reference Books

Sr. no. Title Author Edition/Publication

PHI Learning, New
The computer hardware installation, interfacing
01 James, K.L. Delhi, 2014, ISBN: 978-
troubleshooting and maintenance
81-203-4798-4
02 PC Upgrade & Repair Bible -- Wiley India
 Equivalence of Subjects between CBCS and NEP for
S. Y. B. Tech (Sem-III & IV)

Name of Programme : Computer Science and Engineering

Class : S. Y. B. Tech Semester : III

Name of Subjects in existing CBCS

Sr. Name of Subjects in NEP
2018 onwards pattern Reason Remark
No pattern
(Add all subjects)

Not
1 Applied Mathematics
Equivalent

100
Discrete Mathematical
2 Discrete Mathematics & Structures Percent
Structures
Equivalent

100
3 Data Structures Data Structures Using C Percent
Equivalent
Not
4 Microprocessors
Equivalent
50
5 C programming Data Structures Using C Lab Percent
Equivalent
Not
6 Soft Skills
Equivalent
50
7 Computer Networks - I Computer Networks Percent
Equivalent

50
8 Computer Networks Lab Percent
Equivalent
Not
9 Multi-disciplinary Minor – 01
Equivalent
Not
10 Open Elective -01
Equivalent

Employability Enhancement Not

11
Skills-I Equivalent

Not
12 Business English
Equivalent
Class : S. Y. B. Tech Semester : IV

Name of Subjects in existing CBCS

Sr. Name of Subjects in NEP
2018 onwards pattern Reason Remark
No pattern
(Add all subjects)

100
1 Automata Theory Automata Theory Percent
Equivalent
Computer Organization and Not
2
Architecture Equivalent

100
3 Operating System-I Operating System Percent
Equivalent

Operating System Lab

Not
4 Software Engineering
Equivalent
100
5 Object Oriented Programming Object Oriented Programming Percent
Equivalent
100
Object Oriented Programming
Percent
Lab
Equivalent
100
6 Mini Project Mini Project-I Lab Percent
Equivalent
Not
7 Computer Networks-II
Equivalent
90
8 Environmental Studies Environmental Science Percent
Equivalent
Not
Multi-disciplinary Minor – 02
Equivalent
Not
Open Elective -02
Equivalent
Not
Soft Skills
Equivalent
Employability Enhancement Not
Skills-II Equivalent

Computer Maintenance Not

Technology Equivalent
 Exit Course for Computer Science and Engineering After 2nd Year

• As part of the NEP 2020 Revised Syllabus, for the Second Year B. Tech Exit, students

must earn a total of 8 additional credits. This includes 6 credits from online SWAYAM
NPTEL courses and 2 credits from Virtual Lab performance.

• Students must complete two SWAYAM NPTEL courses (12-week duration) from the

provided list and successfully perform two Virtual Labs from the specified list.
• Each SWAYAM NPTEL course carries 3 credits, while each Virtual Lab is worth 1 credit.

Sr. No. Name of NPTEL Course

1 Introduction to Database Systems
2 Introduction To Internet of Things
3 Programming in Modern C++
4 Programming In Java
5 Real Time Operating System
6 Advanced Computer Networks

Sr. No. Name of Virtual Lab

1 Computer Organization Lab
2 Artificial Intelligence I Lab
3 Cryptography Lab
4 Python Programming Lab: Advanced Topics

Examination Scheme

• Swayam NPTEL Course Certificate Should be submitted to Department 6 Credits

• Lab Experiments Report must be prepared and submitted to department 2 Credits