B.tech Syllabus Soe 2025-26
B.tech Syllabus Soe 2025-26
Research Methodology 0 0 4 4
Continuous Evaluation in
Course Teaching Scheme
terms of Marks
Total 14 0 12 20
Liberal Learning Courses : A) Music (Vocal), B) Music (Instrumental), C) Dance, D) Yoga, E) Meditation, F)
Painting, G) Theater and Acting, H) Photography, I) Chess, J) Athletics, K) Basketball, L)
Elements of German Language, M) Elements of French Language
Indian Knowledge Systems : A) Introduction To Constitution of India, B) Indian Contribution to Science and
Technology C) Indian Culture and Civilization
Continuous Evaluation in
Course Teaching Scheme
terms of Marks
Basic of Electrical
4 ESC 24EE1201 3 0 0 3 30 10 60 100
Engineering
Basic of Electrical
5 ESC 24EE1202 0 0 2 1 – 50 50 100
Engineering Lab
Total 14 0 10 21
Liberal Learning Courses : A) Music (Vocal), B) Music (Instrumental), C) Dance, D) Yoga, E) Meditation, F)
Painting, G) Theater and Acting, H) Photography, I) Chess, J) Athletics, K) Basketball, L)
Elements of German Language, M) Elements of French Language
BSC ESC PCC PEC MDM OE VSEC AEC HSSM IKS VEC ELC LLC Total
c 15 – – – – 02 02 – 02 02 – 04 41
Continuous Evaluation
Course Teaching Scheme
in terms of Marks
Open Elective – I:
CEP01/FP
10 24CE2308 Mini Project / Field Project 0 0 4 2 – 50 50 100
01**
Total 21 00 08 25
Continuous Evaluation
Course Teaching Scheme
in terms of Marks
Microcontroller and
3 PCC05 24CE2403 3 0 0 3 30 10 60 100
Interfacing
Microcontroller and
4 PCC05 24CE2404 0 0 2 1 – 50 50 100
Interfacing Lab
I) Object-Oriented
6 OE02 24CE2406 3 0 0 3 30 10 60 100
Programming with Java
Total 17 0 08 21
BSC ESC PCC PEC MDM OE VSEC AEC HSSM IKS VEC ELC LLC Total
14 15 22 0 4 6 04 04 06 02 05 02 04 88
Continuous Evaluation
Course Teaching Scheme
in terms of Marks
Total 15 0 10 20
Continuous Evaluation
Course Teaching Scheme
in terms of Marks
Total 18 0 08 22
BSC ESC PCC PEC MDM OE VSEC AEC HSSM IKS VEC ELC LLC Total
14 15 41 10 10 9 08 04 06 02 05 02 04 130
Continuous Evaluation
Course Teaching Scheme
in terms of Marks
Total 18 0 06 21
Continuous Evaluation
Course Teaching Scheme
in terms of Marks
Total 4 0 32 20
BSC ESC PCC PEC MDM OE VSEC AEC HSSM IKS VEC ELC LLC Total
14 15 49 19 13 09 08 04 06 02 05 22 04 170
SEMESTER - III
24CE2301: Object Oriented Paradigm
Continuous Evaluation
Course Teaching Scheme
in terms of Marks
Course
Category Course Name L T P Credits MSEs TA ESE Total
Code
Object Oriented
PCC01 24CE2301 3 0 0 3 30 10 60 100
Paradigm
Course Objectives:
1. To understand the concept of OOP
2. To understand the concept of overload functions and operators in C++.
3. To understand the concept of containment and inheritance promote code reuse in
C++.
4. To understand the concept of inheritance and virtual functions implement dynamic
binding with polymorphism.
5. To learn how to design and implement generic classes with C++ templates
Unit I : 7 Hrs.
Foundations of Object Oriented Programming: Concept of OOP, Features of OOP, Need of
object-oriented programming, Introduction of ‘C++’, Structure of ‘C++’ program, Executing and
Debugging a ‘C++’ Program. Basic data types, user defined data type, derived data type
operator and control statement.
Unit II: 7 Hrs.
Objects & Classes: Declaring & using classes, Constructors, Objects as function arguments,
Copy Constructors, Static class data, Arrays of Objects.
Unit III : 7 Hrs.
Operator Overloading: Overloading Unary & Binary Operators, Data Conversion, Rules for
overloading operators, Pitfalls of Operator Overloading
Unit IV: - 7 Hrs.
Inheritance: Derived Class & Base Class, Derived class Constructors, Function overloading,
Class hierarchies, Public & Private Inheritance, Multiple Inheritance, Containership: Classes
within Classes.
Function Template, Class template, Exception Syntax, Multiple exceptions, Exception with
Arguments, Introduction to Standard Template Library, Algorithms, Sequential Containers,
Iterates, Specialized iterates, associative containers, Function objects
Total Lecture 42
Text Books:
1. Object Oriented Programming with C++ -E. Balaguruswamy, Tata - Graw Hill publishing
Co.Ltd., New Delhi,1995
2. Herbert Schildt, C++, The Complete Reference, Tata McGraw-Hill
Reference Books:
1. Object Oriented Programming in Turbo C++ Rober Lofore Galgotia Publications Pvt.Ltd.,
New Delhi,1995
2. The C++ Programming Language (Third Edition) Bjarne Stroustrup Pub.Co.,New York,1995
(AddisonWesley)
3. Bjarne Stroustrup, The C++ Programming Language, Pearson Education
Continuous Evaluation
Course Teaching Scheme
in terms of Marks
Course
Category Course Name L T P Credits MSEs TA ESE Total
Code
Object Oriented
PCC01 24CE2302 0 0 2 1 - 50 50 100
Paradigm Lab
Course Objectives:
1. To learn how to design classes for code reuse.
2. To understand the concept of data abstraction and encapsulation.
3. To learn how to overload functions and operators in C++.
4. To learn how containment and inheritance promote code reuse in C++.
5. To learn how inheritance and virtual functions implement dynamic binding with
polymorphism.
6. To learn how to design and implement generic classes with C++ templates.
Sr.
Name of Experiment
No
7 Write a program to pass an object as a functions argument – pass object by value, pass
object by reference.
Write a program to demonstrate the use of operator overloading unary operator & binary
8
operators like ++ operator and <<operator.
9 Write a program to demonstrate the use of function overloading.
Continuous Evaluation
Course Teaching Scheme
in terms of Marks
Course
Category Course Name L T P Credits MSEs TA ESE Total
Code
PCC02 24CE2303 Data Structures 3 0 0 3 30 10 60 100
Course Objectives:
1. To understand the Linear and non linear data Structure and its memory representation.
2. To perform different operation on data structure such as insertion, deletion, searching
and traversing.
3. To understand various data searching and sorting methods and with its complexity.
4. To introduce various techniques for representation of the data in the real world.
Course Outcomes: After successfully completing the course, the students will be able to
1. Understand basic data structures such as various linear and nonlinear data structures,
concepts, operations like insertion, deletion, traversing etc on them and hash tables.
2. Understand use of basic data structures in different applications and implement various
applications.
3. Understand methods for analysis of algorithms, learn, analyze and implement different
searching and sorting techniques and their implementation.
4. Understand fundamental algorithmic problems including Tree traversals, Graph theory and
hashing techniques.
5. Implement basic data structure such as stacks, queues, and trees.
6. Analyse fundamental algorithmic problems including Tree traversals, Graph theory and
hashing techniques
Text Books:
Reference Books:
Continuous Evaluation
Course Teaching Scheme
in terms of Marks
Course
Category Course Name L T P Credits MSEs TA ESE Total
Code
PCC02 24CE2304 Data Structures Lab 0 0 2 1 50 50 100
Course Objectives:
1. To understand the Linear and nom linear data Structure and its memory
representation.
2. To perform different operation on data structure such as insertion, deletion, searching
and traversing.
3. To understand various data searching and sorting methods and with its complexity.
4. To introduce various techniques for representation of the data in the real world.
Course Outcomes: After successfully completing the course, the students will be able to
1. Understand basic data structures such as various linear and nonlinear data structures,
concepts, operations like insertion, deletion, traversing etc on them and hash tables.
2. Understand use of basic data structures in different applications and implement various
applications.
3. Understand methods for analysis of algorithms, learn, analyze and implement different
searching and sorting techniques and their implementation.
4. Understand fundamental algorithmic problems including Tree traversals, Graph theory and
hashing techniques.
5. Implement basic data structure such as stacks, queues, and trees.
6. Analyse fundamental algorithmic problems including Tree traversals, Graph theory and
hashing techniques
List of Experiments
1. Write a program to find out largest number from the array and also find it’s location.
2. Write a program to traverse an array and find the sum and average of data elements from
an array.
10. To study and implement following operations on the circular linked list.
Continuous Evaluation
Course Teaching Scheme
in terms of Marks
Course
Category Course Name L T P Credits MSEs TA ESE Total
Code
Discrete and Logic
PCC03 24CE2305 3 0 0 3 30 10 60 100
Structure
Course Objectives:
1. Define and identify propositional logic, its components (propositions and connectives),
and their syntactic structure.
2. Define Boolean algebra and its key concepts, including variables, operators, and
expressions
3. Use the laws of set theory (associative, commutative, distributive, De Morgan’s laws) in
solving set-theoretic problem.
4. Students will learn to model and solve combinatorial problems using permutations,
combinations.
5. Study fundamental concepts and properties of graphs and directed graphs (digraphs),
focusing on their structure, representation, and applications.
Course Outcomes: After successfully completing the course, the students will be able to
1. Understand the various types of sets, functions and relations.
2. Understand the concepts of group theory.
3. Understand the concepts of combinatory.
4. Apply the concepts of graph theory and its applications.
5. Apply the logic and Boolean algebra concepts to solve the problems
6. Understand trees and apply their properties to solve computational problems.
Introduction of Boolean algebra, truth table, basic logic gate, basic postulates of Boolean algebra,
principle of duality, canonical form, Karnaugh map
Unit III : Set Theory 7 Hrs.
Basicconcepts,VennDiagrams,RepresentationofDiscreteStructure,Relationand ordering,Partial
Ordering, Functions, Recursions, Sets and predicates.
Unit IV : Algebraic structures 7 Hrs.
Introduction,ClassificationofAlgebraicstructures,Lagrange’stheorem,Generatorsandcyclic groups
Text Books:
1. J. P. Tremblay and R. Manohar: Discrete Mathematical Structures with Applications to
Computer Science, Tata McGraw-Hill Edition, McGraw-Hill.
Reference Books:
1. C. L. Liu and D. P. Mohapatra: Elements of Discrete Mathematics: A Computer Oriented
Approach, 3rd Edition, Tata McGraw-Hill, McGraw-Hill.
3. Seymour Lipschutz and Marc Lars Lipson: Schaum’s Outline of Theory and Problems of
Discrete Mathematics, 3rd Edition, Schaum’s Outlines Series, McGraw-Hill.
4. Kenneth H. Rosen: Discrete Mathematics and Its Applications, 7th Edition, McGraw-Hill.
Continuous Evaluation
Course Teaching Scheme
in terms of Marks
Course
Category Course Name L T P Credits MSEs TA ESE Total
Code
Mathematics of
MDMO1 24CE2306 3 0 0 3 30 10 60 100
Computation
Course Objectives:
1. Find general solutions of linear differential equations with constant coefficients using
the roots of auxiliary equation.
2. Calculate the Laplace Transform of basic functions using the definition.
3. Apply Laplace transform to find solution of linear differential equations. And solve
problems related to Fourier Transform
4. Compute and interpret the correlation coefficient.
5. Compute the Analytic function and Complex Analysis.
6. Demonstrate the basic concepts of probability and statistics.
Course Outcomes: After successfully completing the course, the students will be able to
1. Understand the concept of differential equations and linear differential equations .
2. Apply Laplace transform to solve differential equations.
3. Analyze the Fourier Transform to connect the time domain and frequency domain.
4. Understand the basic concepts of probability and statistics.
5. Apply and interpret regression lines from data for predictive analysis
6. Apply the knowledge of Complex Analysis
b) Statistics Curve fitting: Least Square Method, Coefficient of Correlations, Lines of Regression
Text Books:
1. Elements of Applied Mathematics by P. N. Wartikar and J. N. Wartikar
Reference Books:
Continuous Evaluation
Course Teaching Scheme
in terms of Marks
Course
Category Course Name L T P Credits MSEs TA ESE Total
Code
OE01 24CE2307 Python for Beginner 3 0 0 3 30 10 60 100
Course Objectives:
1. Introduce the basic principles and concepts of python programming, and how python
programming concepts are useful in problem-solving.
2. Write clear and effective python code.
3. To perform file operations to read and write data in files.
4. To create applications using Python Programming.
Sets: Accessing values in Set, deleting values in Set, and updating Sets, Basic Set operations,
Built-in Set functions. Dictionaries: Accessing values in Dictionary, deleting values in
Dictionary, and updating Dictionary, Basic Dictionary operations, Built-in Dictionaries
functions.
Unit V : 7 Hrs
Python Functions, modules, and Packages: Use of Python built-in functions (e.g., type/data
conversion functions, math functions etc.), user-defined functions: Function definition,
Function call, function arguments and parameter passing, Return statement, Scope of
Variables: Global variable and Local Variable. Modules: Writing modules, importing modules,
importing objects from modules, Python built-in modules (e.g., Numeric, mathematical module,
Functional Programming Module), Packages.
Unit VI: 7 Hrs.
File Handling: Opening files in different modes, accessing file contents using standard library
functions, Reading, and writing files, closing a file, Renaming, and deleting files, File related
standard functions.
Total Lecture 42
Text Books:
1. Python the Complete Reference by Martin C Brown, Tata Mcgraw Hill, India
2. Introduction to Programming Using Python by Y. Daniel Liang, Pearson
Reference Books:
1. R. Nageswara Rao , ―Core Python Programmingǁ, Dreamtech Press, 3rd Edition, 2021
2. Programming and Problem Solving with Python by Ashok Kamthane and Amit Ashok
Kamthane, Tata Mcgraw Hill, India
3. Python Programming: Using Problem Solving Approach by Reema Thareja, Oxford University
Press
Continuous Evaluation
Course Teaching Scheme
in terms of Marks
Course
Category Course Name L T P Credits MSEs TA ESE Total
Code
OE01 24CE2307 Computer Network 3 0 0 3 30 10 60 100
Course Objectives:
1. The objective of the course is to equip the students with a general overview of the concepts
and fundamentals of computer networks.
2.Familiarize the students with the standard models for the layered approach to
communication between machines in a network and the protocols of the various layers.
Course Outcomes:
1. Explain the basic computer network technology.
2. Understand the functions of each layer in the OSI and TCP/IP reference model.
3. Use the skills of subnetting and routing mechanisms.
4. Understand with the essential protocols of computer networks.
5. Apply the protocols in network design and implementation.
6. Explain the working principles of application layer protocols such as DNS, HTTP, and SMTP.
UNIT - I 7 Hrs.
Introduction to Computer Network: Data Communication Components: Data Representation & its
flow network, Broadcast & point to point networks, Various connection topology, Protocols &
Standard, Protocol standard: De facto & De jure.
UNIT - II 7 Hrs.
Network Models: Network hardware & software, OSI, TCP/IP Reference models, Example Networks:
ARPANET, Internet. Physical Layer: Guided Transmission media: twisted pairs, coaxial cable, fiber
optics, Wireless transmission.
UNIT – III 7 Hrs.
Data link layer: Design issues, framing, Error detection and correction. Elementary data link
protocols: simplex protocol, stop and wait protocol. Go-Back-N, Selective Repeat ARQ. Medium
Access sublayer: The channel allocation problem, Multiple access protocols: ALOHA, CSMA
protocols, collision free protocols. Wireless LANs, Data link layer switching.
UNIT – IV 7 Hrs.
Network Layer: Design issues, Routing algorithms: shortest path routing, Flooding, Hierarchical
routing, Broadcast, Multicast, distance vector routing, Congestion Control Algorithms, Quality of
Service, Internetworking, The Network layer in the internet.
UNIT – V 7 Hrs.
Transport Layer: Transport Services, Elements of Transport protocols, Connection management,
TCP and UDP protocols, TCP Congestion Control; Quality of service.
UNIT – VI 7 Hrs.
TEXT BOOK:
1. Computer Networks -- Andrew S Tanenbaum, David. j. Wetherall, 5th Edition. Pearson
Education/PHI
REFERENCE BOOKS:
1. An Engineering Approach to Computer Networks-S. Keshav, 2nd Edition, Pearson Education
2. Data Communications and Networking – Behrouz A. Forouzan. Third Edition TMH.
Continuous Evaluation
Course Teaching Scheme
in terms of Marks
Course
Category Course Name L T P Credits MSEs TA ESE Total
Code
Economics for
HSSM01 24GE2301 3 0 0 3 30 10 60 100
Engineers
Course Objectives:
1. To familiarize the basic concepts and structure of Engineering Economics
2. To understand different principles of Engineering Economics
3. To learn the concepts Production and cost associated with it
4. To learn different types of cash flow
5. To learn depreciation analysis
6. To understand the concept of banking system in India
Course Outcomes:
Upon successful completion of this course, the student will be able to:
1. Understand the basics of Engineering Economics
2. Understand and compute the production cost
3. Describe different cash flow methods
4. Evaluate Engineering alternatives
5. Understand depreciation analysis
6. Understand Indian Banking System
Unit I: Introduction to Engineering Economics: 6 Hrs.
Definition and Scope of Engineering Economics, Subject Matter of Economics, Principles of
Engineering Economics, Microeconomics vs Macroeconomics, Utility Analysis, Laws of
diminishing utility analysis, Derivation of demand curve and law of Demand, Elasticity of
demand
Unit II: Theory of Production: 6 Hrs.
Theory, Importance, Isoquants and its properties, Marginal rate of Technical substitution, Law
of variable proportions, Returns to Scale, Cost of Production and Cost of Curves, The law of
supply, Price determination
Unit III: Time value of Money: 6 Hrs.
Techniques for adjusting time value of money, Uniform Gradient series factor, annuity, annuity
due, calculation of deferred annuity, Types and components of cash flow, cash flow diagrams,
principles of equivalence, Uses, significance and limitation of Cash flow statement
Unit IV: Engineering Alternatives: 6 Hrs.
Functions of Commercial Banks, Role of Commercial banks in developing economy, sound banking
system for under-developed countries, types of banks, balance sheet of a bank, New developments in
banking system.
Total Lecture 36 Hrs
Text Books:
1. Sasmita Mishra, Engineering Economics and Costing, Second Edition, PHI, 2010
Reference Books:
1. Donald G. Newnan, Ted Eschenbach, Jerome P. Lavelle, Engineering Economic Analysis,
Oxford University Press, 2004
2. R. Panneerselvam, Engineering Economics, PHI Learning, 2013
Continuous Evaluation
Course Teaching Scheme
in terms of Marks
Course
Category Course Name L T P Credits MSEs TA ESE Total
Code
VEC02 24GE2302 Values & Ethics 3 0 0 3 30 10 60 100
Course Objectives:
1. To create awareness about content and the process of value education.
2. To create awareness about human being is in co-existence of self and the body
3. To create awareness about the values of relationships in family, society and nature.
4. To understand the social responsibility of an engineer.
5. To appreciate ethical dilemma while discharging duties in professional life
6. To understand the strategies for transitioning towards a value-based life &
profession.
Course Outcomes: After successfully completing the course, the students will be
able to
1. Understand the need, content and process of value education through self
exploration.
2. Understand the human being as the coexistence of self and the body in ensuring
harmony with the self.
3. Understand the role of a human being in ensuring harmony in family, society &
nature.
4. Understand the social responsibility of an engineer.
5. Appreciate ethical dilemmas while discharging duties in professional life.
6. Understand the strategies for transitioning towards a value-based life
And profession.
Text Books:
Reference Books:
Continuous Evaluation
Course Teaching Scheme
in terms of Marks
Course
Category Course Name L T P Credits MSEs TA ESE Total
Code
CEP
24CE2308 Mini Project 0 0 4 2 - 50 50 100
01/FP 01
Course Objectives:
1. To acquaint students with the process of identifying the needs and converting it into the
problem.
2. To familiarize the process of solving the problem in a group.
3. To acquaint students with the process of applying engineering fundamentals to attempt
solutions to the problems.
4. To inculcate the process of self-learning and research.
Course Outcomes:
After successfully completing the course, the students will be able to,
SEMESTER – IV
24CE2401: Operating System
Continuous Evaluation
Course Teaching Scheme
in terms of Marks
Course
Category Course Name L T P Credits MSEs TA ESE Total
Code
PCC04 24CE2401 Operating System 3 0 0 3 30 10 60 100
Course Objectives:
1. To make students aware of the kernel and shell structure of the operating system.
2. To make students aware of the purpose, structure and functions of operating system.
3. To equip students with understanding of the various scheduling algorithms in OS.
4. To make students aware of understanding of memory management in different OS.
Course Outcomes:
After successfully completing the course, the students will be able to,
1. Analyze various process management concepts including scheduling, synchronization,
and deadlocks.
2. Explain the multithreading, process relationships , state of process.
3. Analyze the memory management and system resource sharing.
4. Understand the concept of Operating System Security
5. Explain the components and functioning of I/O systems including I/O hardware and
kernel subsystems.
6. Analyze various disk scheduling algorithms for performance evaluation.
Overview, I/O Hardware, Application I/O Interface, Kernel I/O Subsystem, Disk Management,
Swap-Space Management, Disk scheduling - FCFS, SSTF, SCAN, C-SCAN, Disk reliability, Disk
formatting,
Text Books:
2. Tanenbaum A.S, “Modern Operating Systems”, Pearson Education 3rd edition, 2008
3. William Stallings, Operating Systems: Internals and Design Principles, Prentice Hall, 2008
Reference Books:
1. Gary Nutt, NebenduChaki, and SarmisthaNeogy, “Operating Systems”, Pearson Education,
3rd edition, 2009
2. Jerry D. Peek, Grace Todino, John Strang, “Learning the Unix OperatingSystem”, O'Reilly &
3. Crowley C., “Operating Systems – A Design oriented Approach”, TMH 4. Maurice J. Bach;
The Design of the Unix Opearating System; Prentice Hall ofIndia; ISBN: 978-81-203-0516-8
Continuous Evaluation
Course Teaching Scheme
in terms of Marks
Course
Category Course Name L T P Credits MSEs TA ESE Total
Code
PCC04 24CE2402 Operating System Lab 0 0 2 1 - 50 50 100
Course Objectives:
1. To make students aware of the kernel and shell structure of the operating system.
2. To make students aware of the purpose, structure and functions of operating system.
3. To equip students with understanding of the various scheduling algorithms in OS.
4. To make students aware of understanding of memory management in different OS.
Course Outcomes:
After successfully completing the course, the students will be able to,
1. Analyze various process management concepts including scheduling, synchronization,
and deadlocks.
2. Explain the multithreading, process relationships ,state of process.
3. Analyze the memory management and system resource sharing.
4. Understand the concept of Operating System Security
5. Explain the components and functioning of I/O systems including I/O hardware and
kernel subsystems.
6. Analyze various disk scheduling algorithms for performance evaluation.
List of Experiments
1. To perform the following CPU scheduling algorithms Round Robin SJF FCFS Priority
Continuous Evaluation
Course Teaching Scheme
in terms of Marks
Course
Category Course Name L T P Credits MSEs TA ESE Total
Code
Microcontroller and
PCC05 24CE2403 3 0 0 3 30 10 60 100
Interfacing
Course Objectives:
1. Understand the difference between a Microprocessor and a Microcontroller and
embedded microcontrollers.
2. Familiarize the basic architecture of 8051 microcontroller.
3. Program 8051microprocessor using Assembly Level Language and C.
4. Understand the interrupt system of 8051 and the use of interrupts.
5. Understand the operation and use of inbuilt Timers/Counters and Serial port of 8051. •
6. Interface 8051 to external memory and I/O devices using its I/O ports
Course Outcomes: On completion of the course the students will be able:
1.Explain the difference between Microprocessors & Microcontrollers.
2. Understand the 8051 instruction set
3.Understand the Interrupt system, operation of Timers/Counters and Serial port .
4. Understand the 8051 serial port and to generate an external interrupt using a switch.
5. Implement 8051 I/O port interrupt and C Programme to send & receive serial data using
8051 serial port.
6. Use of simple switches, simple LEDs, ADC 0804, LCD and Stepper Motor to 8051 using
8051 I/O ports.
8051 Timers and Counters – Operation and Assembly language programming to generate a
pulse using Mode-1 and a square wave using Mode2 on a port pin. 8051 Serial
Interfacing 8051 to ADC-0804, DAC, LCD and Stepper motor and their 8051 Assembly
language interfacing.
Simple Serial Port programming in Assembly and C to transmit a message and to receive data
serially.
Interfacing simple switch and LED to I/O ports to switch on/off LED with respect to switch
status
Total Lecture 42 Hrs
Text Books:
1. “The 8051 Microcontroller and Embedded Systems – using assembly and C”, Muhammad
Ali Mazidi and Janice Gillespie Mazidi and Rollin D. McKinlay; PHI, 2006 / Pearson, 2006.
Reference Books:
1. “The 8051 Microcontroller Based Embedded Systems”, Manish K Patel, McGraw Hill, 2014,
ISBN: 978-93-329-0125-4.
Continuous Evaluation
Course Teaching Scheme
in terms of Marks
Course
Category Course Name L T P Credits MSEs TA ESE Total
Code
Microcontroller and
PCC05 24CE2404 0 0 2 1 - 50 50 100
Interfacing Lab
Course Objectives:
1. Familiarize the basic kit of 8051 microcontroller.
2. Program 8051microprocessor using Assembly Level Language and C.
3. Understand the interrupt system of 8051 and the use of interrupts.
4. Understand the operation and use of inbuilt Timers/Counters and Serial port of 8051.
5. Interface 8051 to external memory and I/O devices using its I/O ports.
Course Outcomes: After completion of this course the student shall be able to
1. Implement 8051 Assembly level programs using 8051 instruction set.
2. Explain the Interrupt system, operation of Timers/Counters and Serial port of 8051.
3. Implement 8051 Assembly language program to generate timings and waveforms using
8051 timers, to send & receive serial data using 8051 serial port and to generate an
external interrupt using a switch.
4. Implement 8051 Assembly language programs to generate square wave on 8051 I/O
port pin using interrupt and C Programme to send & receive serial data using 8051
serial port.
5. Develop simple switches, simple LEDs, ADC 0804, LCD and Stepper Motor to 8051
using 8051 I/O ports.
List of Experiments
Continuous Evaluation
Course Teaching Scheme
in terms of Marks
Course
Category Course Name L T P Credits MSEs TA ESE Total
Code
PCC06 24CE2405 Theory of Computation 3 0 0 3 30 10 60 100
Course Objectives:
1. To give an overview of the theoretical foundations of computer science from the
perspective of formal languages
2. To illustrate finite state machines to solve problems in computing
3. To explain the hierarchy of problems arising in the computer sciences.
4. To familiarize Regular grammars, context frees grammar.
Text Books:
1. Hopcraft H.E. & Ullman J: Introduction to Automata Theory, Languages and Computation
2. Peter Linz: An Introduction to Formal Languages and Automata
Reference Books:
1. Rajesh K. Shukla: Theory of Computation, CENGAGE Learning, 2009.
2. K V N Sunitha and N Kalyani: Formal Languages and Automata Theory, McGraw Hill,2010
3. Lewis H.P. and Papadimition C.H.: Elements of Theory of Computation.
4. Mishra & Chandrashekharan: Theory of Computation
Continuous Evaluation
Course Teaching Scheme
in terms of Marks
Course
Category Course Name L T P Credits MSEs TA ESE Total
Code
Object Oriented
OE02 24CE2406 Programming with 3 0 0 3 30 10 60 100
Java
Course Objectives:
1. To learn implementation of object-oriented concepts with Java.
2. To understand collection classes and interfaces.
3. To know the process of application development using Graphical User Interface (GUI).
4. To acquire knowledge about handling databases using Java. 5. To study web components
for developing web applications.
Course Outcomes:
1. Implement classes, objects, class members and relationships for a given problem.
2. Demonstrate end to end applications using object oriented constructs.
3. Apply collection classes for storing java objects.
4. Use Java APIs for program development.
5. Demonstrate abnormal termination of a program using exception handling
6. Demonstrate the use of inheritance, interfaces, and polymorphism in solving programming
tasks.
Introduction, Applet Class, Applet structure, Applet Life cycle, Common Methods used in displaying
the output, paint (), update () and repaint (), More about applet tag, getDocumentBase() and
getCodeBase () methods, Applet Context Interface, Audio clip, Graphic Class, Color, Font, Font
Metrics.
Unit VI: Event Handling & AWT 6 Hrs
Total Lecture 40
Text Books:
1. Sachin Malhotra and Saurabh Choudhary: Programming in Java, Oxford University Press
2010.
2. Herbert Schildt: Java Complete References (McGraw Hill)
Reference Books:
Continuous Evaluation
Course Teaching Scheme
in terms of Marks
Course Objectives:
In this course students will know and understand contribution of ancient Indian scientists
through:
1.To make students aware of the kernel and shell structure of the operating system.
2.To make students aware of the purpose, structure and functions of operating system.
3.To equip students with understanding of the various scheduling algorithms in OS.
4.To make students aware of understanding of memory management in different OS.
Course Outcomes: After successfully completing the course, the students will be able to
1. Analyze various process management concepts including scheduling, synchronization,
and deadlocks.
2. Explain the multithreading, process relationships ,state of process.
3. Analyze the memory management and system resource sharing.
4. Understand the concept of Operating System Security
5. Explain the components and functioning of I/O systems including I/O hardware and
kernel subsystems.
6. Analyze various disk scheduling algorithms for performance evaluation.
Unit I : Introduction to Operating System 6 Hrs.
Concept of Operating Systems (OS), Generations of OS, Types of OS, OS Services,process
Concept, Process Scheduling, Operations on Processes, Cooperating Processes, Interprocess
Communication, Interrupt handling and System Calls, Concept of Virtual Machine.
Unit II : Process Scheduling 6 Hrs.
Definition, Process Relationship, Different states of a Process, Process Control Block (PCB),
Context switching. Types of Schedulers, Scheduling algorithms: Pre-emptive and Non pre-
emptive, FCFS, SJF, RR, Priority.
Unit III : Memory Management 6 Hrs.
Memory Management, Swapping, Memory Allocation Schemes, Paging, Segmentation, Virtual
Memory Management: Background, Demand paging scheme, Process Creation, Page
Replacement Policies.
Unit IV: Process Synchronization 6 Hrs.
Critical Section, Race Conditions, Mutual Exclusion, Hardware Solution, Monitors, Message
Passing, Deadlocks - prevention, avoidance, detection and recovery. Deadlocks: Definition,
Necessary and sufficient conditions for Deadlock, Deadlock Prevention and Deadlock
Avoidance: Banker’s algorithm.
Overview, I/O Hardware, Application I/O Interface, Kernel I/O Subsystem, Transforming I/O to
Hardware Operations,Disk Management, Swap-Space Management, RAID Structure , Disk
scheduling - FCFS, SSTF, SCAN, C-SCAN.
Total Lecture 36 Hrs
Text Books:
2. Tanenbaum A.S, “Modern Operating Systems”, Pearson Education 3rd edition, 2008
3. William Stallings, Operating Systems: Internals and Design Principles, Prentice Hall, 2008
Reference Books:
Continuous Evaluation in
Course Teaching Scheme
terms of Marks
Course
Category Course Name L T P Credits MSEs TA ESE Total
Code
Java Coding
VSEC02 24CE2407 0 0 4 2 - 50 50 100
Workshop
Course Objectives: Design, implement, test, and debug simple programs in an object-
oriented programming language.
1. To develop the knowledge of object-oriented paradigm in the Java programming
language.
2. To evaluate classical problems using java programming.
3. To develop software development skills using java programming for real world
applications.
List of Experiments
Reference Books:
1. Sachin Malhotra and Saurabh Choudhary: Programming in Java, Oxford University Press
2010.
2. Herbert Schildt: Java Complete References (McGraw Hill)
3. E. Balagurusamy: Programming with Java (McGraw Hill)
4. Dr. R. Nageswara Rao: Core Java An Integrated Approach (Dreamtech)
Continuous Evaluation
Course Teaching Scheme
in terms of Marks
Course
Category Course Name L T P Credits MSEs TA ESE Total
Code
AEC02 24GE2401 Professional Communication 2 0 0 2 30 10 60 100
Course Objectives:
1. Understand the foundational theories and principles of professional communication.
2. Develop effective oral, written, and digital communication skills tailored to diverse
professional contexts.
3. Enhance critical thinking and analytical abilities for evaluating communication
practices.
4. Recognize and apply ethical standards and cultural sensitivities in professional
interactions.
5. Utilize appropriate communication technologies to facilitate collaboration and
information dissemination.
Course Outcomes: After successfully completing the course, the students will be able to
1. Understand key concepts and questions central to the communication discipline.
2. Implement communication theories and principles to analyze and address real-world
scenarios.
3. Demonstrate proficiency in crafting and delivering messages suitable for specific
audiences and purposes.
4. Analyze messages for their effectiveness, ethical considerations, and cultural
implications.
5. Evaluate the ability to achieve communication goals confidently across various
platforms.
6. Identify and apply best practices for professional communication using digital
platforms.
Text Books:
1. Business Communication: Process and Product – Mary Ellen Guffey and Dana Loewy.
2. Effective Business Communication – Asha Kaul.
3. The Essentials of Business Communication – Rajendra Pal and J. S. Korlahalli.
4. Business and Administrative Communication – Kitty O. Locker and Donna S. Kienzler.
Continuous Evaluation
Course Teaching Scheme
in terms of Marks
Course
Category Course Name L T P Credits MSEs TA ESE Total
Code
Project Management &
HSSM02 24GE2402 Entrepreneurship 3 0 0 3 30 10 60 100
Course Objectives:
1. To make them understand the concepts of Project Management for planning and execution
of projects.
2. To make them understand the feasibility analysis in Project Management and network
analysis tools for cost and time estimation.
3. To enable them to comprehend the fundamentals of Contract Administration, Costing and
Budgeting.
4. Make them capable to analyze, apply and appreciate contemporary project management
tools and methodologies in the Indian context.
Course Outcomes: After successfully completing the course, the students will be able to
1. Understand basic concept of Project management
2. Understand the knowledge of cost estimation & working capital
3. Compute Cost Sheets, balance sheets and Cash Flow statements
4. Understand the Entrepreneurial competencies & traits
5. Explain the Management skills for Entrepreneurs
6. Understand Social Entrepreneurship
Text Books:
Reference Books:
3. Roy Rajeev, Entrepreneurship, Second Edition, Oxford University Press, 2011.
4. P. Gopalakrishnan & V. E. Ramamoorthy, Textbook of Project Management, First Edition, Laxmi
Publications Pvt. Ltd., 2022.
5. John M. Nicholas, and Herman Steyn, Project Management for Engineering, Business and
Technology, Taylor and Francis Books India, 2022.
Exit Option
The candidate should pass the following two additional courses (ITI Level)
(excluding from the list of courses undertaken in First and Second Semester)
2. Internship 4 Credits
The candidate should pass the following two additional courses (Diploma Level)
(excluding from the list of courses undertaken in Third and Fourth Semester)
2. Internship 4 Credits
(excluding from the list of courses undertaken in Fifth and Sixth Semester)
2. Internship 4 Credits