SAGI RAMA KRISHNAM RAJU ENGINEERING COLLEGE

(AUTONOMOUS)
(Approved by AICTE, New Delhi, Affiliated to JNTUK, Kakinada)
Accredited by NAAC with ‘A+’ Grade.
Recognised as Scientific and Industrial Research Organisation
SRKR MARG, CHINA AMIRAM, BHIMAVARAM – 534204 W.G.Dt., A.P., INDIA

Regulation: R23 II / IV - B.Tech. I - Semester

COMPUTER SCIENCE AND ENGINEERING
COURSE STRUCTURE
(With effect from 2023-24 admitted Batch onwards)
Course Total
Course Name Category L T P Cr C.I.E. S.E.E.
Code Marks
Discrete Mathematics and
B23BS2101 BS 3 0 0 3 30 70 100
Graph Theory
Universal Human Values -II
B23HS2101 : Understanding Harmony HS 2 1 0 3 30 70 100
and Ethical Human Conduct
Digital Logic & Computer
B23CS2101 PC 3 0 0 3 30 70 100
Organization
Database Management
B23CS2102 PC 3 0 0 3 30 70 100
Systems
Object Oriented Programing
B23CS2103 PC 3 0 0 3 30 70 100
through Java
Database Management
B23CS2104 PC 0 0 3 1.5 30 70 100
Systems Lab
Object Oriented Programing
B23CS2105 PC 0 0 3 1.5 30 70 100
through Java Lab
B23CS2106 Python Programming SEC 0 1 2 2 30 70 100

B23MC2102 Environmental Science MC 2 0 0 - 30 - 30

TOTAL 16 2 8 20 270 560 830

Page 1 of 45
Course Code Category L T P C C.I.E. S.E.E. Exam
B23BS2101 BS 3 -- -- 3 30 70 3 Hrs.

DISCRETE MATHEMATICS AND GRAPH THEORY

(Common to CSE, CSBS, AIML, IT, AIDS, CSG, CIC, CSIT)

Course Objectives: Students are expected to

Understand the mathematical arguments using logical connectives and quantifiers and verify the
1.
validity of arguments using propositional, predicate logic and truth tables.
2. Understand various types of relations and discuss various properties of the relations
3. Know about the concepts of counting techniques and how to solve the recurrence relations.
4. Understand the concepts in graphs and trees.

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

Knowledge
S.No Outcome
Level
Use the concepts of propositional and predicate logic to verify the arguments for
1. K3
their validity.
Apply the knowledge of set theory to understand relations, functions and their
2. K3
properties.
3. Solve different counting problems and recurrence relations. K3
4. Use the concepts of graphs and their representations. K3
5. Determine different multi graphs and tree structures. K3

SYLLABUS
Mathematical Logic: Propositional Calculus: Statements and Notations, Connectives,
Well Formed Formulas, Truth Tables, Tautologies, Equivalence of Formulas, Duality
UNIT-I Law, Tautological Implications, Normal Forms, Theory of Inference for Statement
(10Hrs) Calculus, Consistency of Premises, Indirect Method of Proof, Predicate Calculus:
Predicates, Predicative Logic, Statement Functions, Variables and Quantifiers, Free and
Bound Variables, Inference Theory for Predicate Calculus.

Set Theory:
Sets: Operations on Sets, Principle of Inclusion-Exclusion,
UNIT-II Relations: Properties, Operations, Partition and Covering, Transitive Closure,
(10 Hrs) Equivalence, Compatibility and Partial Ordering, Hasse Diagrams, Lattice and its
Properties.
Functions: Bijective, Composition, Inverse, Permutation, and Recursive Functions.

UNIT-III Combinatorics and Recurrence Relations: Basis of Counting, Permutations,

(12Hrs) Permutations with repetitions, Circular and Restricted Permutations, Combinations,

Page 2 of 45
 Restricted Combinations, Binomial and Multinomial Coefficients and Theorems.
Recurrence Relations: Generating Functions, Function of Sequences, Partial Fractions,
Calculating Coefficient of Generating Functions, Recurrence Relations, Formulation as
Recurrence Relations, Solving Recurrence Relations by Substitution and Generating
Functions, Method of Characteristic Roots, Solving Inhomogeneous Recurrence Relations

Graph Theory: Basic Concepts, Graph Theory and its Applications, Subgraphs, Graph
UNIT-IV
Representations: Adjacency and Incidence Matrices, Isomorphic Graphs, Paths and
(10 Hrs)
Circuits, Eulerian and Hamiltonian Graphs.

Multi Graphs: Multi graphs, Bipartite and Planar Graphs, Euler’s Theorem, Graph
UNIT-V
Coloring and Covering, Chromatic Number, Trees and their properties, Spanning Trees-
(08Hrs)
BFS and DFS Spanning Trees, Prim’s and Kruskal’s Algorithms.

Textbooks:
Discrete Mathematical Structures with Applications to Computer Science, J. P. Tremblay and
1.
P. Manohar, Tata McGraw Hill.
Discrete Mathematics for Computer Scientists and Mathematicians, J. L. Mott, A. Kandel and
2.
T. P. Baker, 2nd Edition, Prentice Hall of India.
Reference Books:
Elements of Discrete Mathematics-A Computer Oriented Approach, C. L.Liu and D. P.
1.
Mohapatra, 3rd Edition, Tata McGraw Hill.
Theory and Problems of Discrete Mathematics, Schaum’s Outline Series, Seymour Lipschutz
2.
and Marc Lars Lipson, 3rd Edition, McGraw Hill.
Discrete Mathematical Structures, Bernand Kolman, Robert C. Busby and Sharon Cutler Ross,
3.
PHI.
4. Discrete Mathematics, S. K. Chakraborthy and B.K. Sarkar, Oxford, 2011.
Discrete Mathematics and its Applications with Combinatorics and Graph Theory, K. H.
5.
Rosen, 7th Edition, Tata McGraw Hill.
e-Resources :
1. https://nptel.ac.in/courses/106105192
2. https://archive.nptel.ac.in/courses/111/106/111106102/

Page 3 of 45
 Course Code Category L T P C CIE SEE Exam
B23HS2101 HS 2 1 -- 3 30 70 3 Hrs.

UNIVERSAL HUMAN VALUES-II: UNDERSTANDING HARMONY AND ETHICAL

HUMAN CONDUCT
(Common to all Programmes of Engineering)

Course Objectives: The objective of this course is to make the student aware of
Essential complementarity between 'Values' and 'Skills' to ensure sustained happiness and
1
prosperity which are the core aspirations of all human beings.
2 Harmony in the human being, family, society and nature/existence
3 Holistic perspective towards life, profession and happiness

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

Knowledge
S. No. Outcome
Level
1 Explain the role of value education in achieving basic human aspirations. K2
2 Summarize needs to obtain harmony in self(I). K2
3 Describe criteria for human-human relationship and harmony in society K2
4 Explain four orders of nature and our existence K2
5 Interpret significance of harmony in holistic development K2

SYLLABUS
Introduction to Value Education:
Understanding Value Education- Need, Basic Guidelines, Content and Process for
Value Education Purpose and motivation for the course.
Self-exploration as the Process for Value Education - Sharing about Oneself.
Myers-Briggs Type Indicator (MBTI) Personality Test.
UNIT-I Continuous Happiness and Prosperity – the Basic Human Aspirations and their
(9 Hrs) Fulfilment.
Right Understanding, Relationship and Physical Facility (Holistic Development
and the Role of Education) - Exploring Human Consciousness.
Happiness and Prosperity – Current Scenario.
Method to Fulfil the Basic Human Aspirations - Exploring Natural Acceptance-
understanding and living in harmony at various levels.

Harmony in the Human Being:

Understanding Human being as the Co-existence of the Self and the Body.
Distinguishing between the Needs of the Self and the Body - Exploring the difference of
UNIT-II
Needs of Self (I) and Body (Happiness and Physical Facility).
(9 Hrs)
The Body as an Instrument of the Self (I)’ (I being the doer, seer and enjoyer).
Understanding Harmony in the Self(I) - Exploring Sources of Imagination in the Self(I).
Harmony of the Self (I) with the Body (characteristics and activities of ‘I’ and harmony

Page 4 of 45
 in ‘I’).
Programme to ensure self-regulation(Sanyam) and Health(Swasth)- Exploring Harmony
of Self (I) with the Body.

Harmony in the Family and Society:

Harmony in the Family – the Basic Unit of Human Interaction.
'Trust' – the Foundational Value in Relationship- Exploring the Feeling of Trust-
UNIT-III intention and competence.
(9 Hrs) 'Respect' – as the Right Evaluation- Exploring the Feeling of Respect.
Other Feelings, Justice in Human-to-Human Relationship.
Understanding Harmony in the Society- (society being an extension of family).
Vision for the Universal Human Order- Exploring Systems to fulfil Human Goal.

Harmony in the Nature/Existence:

Understanding the harmony in the Nature.
Interconnectedness and mutual fulfillment among the four orders of nature- recyclability
UNIT-IV
and self-regulation in nature.
(6 Hrs)
Realizing Existence as Co-existence at All Levels - Understanding Existence as Co-
existence of mutually interacting units in all pervasive space.
Holistic perception of harmony at all levels of existence.

Implications of the Holistic Understanding – a Look at Professional Ethics:

Natural acceptance of human values. Definitiveness of (ethical) human conduct.
A Basis for Humanistic Education, Humanistic Constitution and Humanistic Universal
Order.
Competence in professional ethics: a. Ability to utilize the professional competence for
augmenting universal human order b. Ability to identify the scope and characteristics of
UNIT-V
people friendly and eco-friendly production systems, c. Ability to identify and develop
(9 Hrs)
appropriate technologies and management patterns for above production systems.
Holistic technologies, production systems and management models- typical case studies.
Strategies for transition towards value based life and profession (from the present state
to Universal Human Order): a. At the level of individual: as socially and ecologically
responsible engineers, technologists and managers, b. At the level of society: as
mutually enriching institutions and organizations.

Text Books
R R Gaur, R Sangal, G P Bagaria. "Human Values and Professional Ethics", Excel Books, New
1.
Delhi, 2010
R R Gaur, R Asthana, G P Bagaria. "Teachers’ Manual for A Foundation Course in Human
2. Values and Professional Ethics", 2nd Revised Edition, Excel Books, New Delhi, 2019. ISBN
978-93-87034-53-2
Reference Books:
1. Jeevan Vidya: Ek Parichaya, A Nagaraj, Jeevan Vidya Prakashan, Amarkantak, 1999.
2. Human Values, A.N. Tripathi, New Age Intl. Publishers, New Delhi, 2004.
3. The Story of Stuff (Book).

Page 5 of 45
 4. The Story of My Experiments with Truth - by Mohandas Karamchand Gandhi
5. Small is Beautiful - E. F Schumacher
6. Slow is Beautiful - Cecile Andrews
7. Economy of Permanence - J C Kumarappa
8. Bharat Mein Angreji Raj – Pandit Sunderlal
9. Rediscovering India - by Dharampal
10. Hind Swaraj or Indian Home Rule - by Mohandas K. Gandhi
11. India Wins Freedom - Maulana Abdul Kalam Azad
12. Vivekananda - Romain Rolland (English)
e-Resources
https://fdp-si.aicte-
1. india.org/UHV%20II%20Teaching%20Material/UHV%20II%20Lecture%2023-
25%20Ethics%20v1.pdf
2. https://fdp-si.aicte-india.org/UHV-II%20Class%20Note.php
https://fdp-si.aicte-india.org/download/FDPTeachingMaterial/3-days%20FDP-
3. SI%20UHV%20Teaching%20Material/Day%203%20Handouts/UHV%203D%20D3-
S2A%20Und%20Nature-Existence.pdf

Page 6 of 45
Course Code Category L T P C C.I.E. S.E.E. Exam
B23CS2101 PC 3 -- -- 3 30 70 3 Hrs.

DIGITAL LOGIC & COMPUTER ORGANIZATION

(Common to CSE, CSG, CSIT & CIC)

Course Objectives: The main objectives of the course is to provide students with:
A comprehensive understanding of digital logic design principles and computer organization
1.
fundamentals.
2. Describe memory hierarchy concepts.
3. Explain input/output (I/O) systems and their interaction with the CPU.
4. Memory and peripheral devices.

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

Knowledge
S.No Outcome
Level
1. Apply digital logic techniques in computer design. K3
2. Use computer arithmetic operations on Fixed and floating point numbers. K3
3. Explain instruction execution and how to control information flow in CPU. K2
4. Describe the organization of various types of memories. K2
Explain the data transfer between devices and optimization of I/O systems for
5. K2
efficient data access and processing.

SYLLABUS
UNIT-I Basic Logic Fundamentals, Minimization of Logic expressions using K-Maps, Decoders,
(10Hrs) Multiplexers, and Encoders, Introduction to Sequential Circuits.

Basic Structure of Computers: Von-Neumann Architecture, Register transfer and micro-

UNIT-II operations.
(12 Hrs) Computer Arithmetic: Fixed and floating-point representation of numbers, Addition,
Subtraction, Multiplication and Division algorithms, Floating- point arithmetic operations.

Central Processing Unit: Introduction, General Register Organization, Stack

Organization,
UNIT-III
Instruction Formats, Addressing Modes, Data Transfer and Manipulation.
(12 Hrs)
Micro programmed Control: Control Memory, Address Sequencing, Microprogram
Example, Design of Control Unit.

UNIT-IV Memory Organization: Memory Hierarchy, Auxiliary Memory, Associative Memory,

(08 Hrs) Cache Memory, Virtual memory.

Page 7 of 45
UNIT-V Input/output Organization: Peripheral devices, I/O interface, Asynchronous data
(08 Hrs) transfer, Modes of transfer, Priority interrupt, direct memory access and IOP.

Textbooks:
1. Digital Design, 4thEdition, M. Morris Mano, Michael D. Ciletti Pearson Prentice-Hall, 2007.
2. Computer Systems Architecture, M.Moris Mano, 3rdEdition, Pearson India, 2007.
Reference Books:
1. Computer Organization and Architecture, William Stallings, 11thEdition, Pearson India, 2022.
Computer Organization, Carl Hamacher, Zvonko Vranesic, Safwat Zaky, 6th Edition, McGraw
2.
Hill India, 2022.
Digital Design and Computer Architecture, 2nd Edition, David Money Harris, Sarah L.Harris,
3.
2019.

e-Resources:
1. https://nptel.ac.in/courses/106/103/106103068/

Page 8 of 45
Course Code Category L T P C C.I.E. S.E.E. Exam
B23CS2102 PC 3 -- -- 3 30 70 3 Hrs.

DATABASE MANAGEMENT SYSTEMS

(Common to CSE, AIML, CSG & CSIT)

Course Objectives: The main objectives of the course is to

1. Introduce database management systems
2. Analyze database through systematic database design approaches
3. Use SQL as a universal Database language
4. Demonstrate normalization
5 Explain transaction management techniques

Course Outcomes: At the end of the course Students will be able to,
Knowledge
S.No Outcome
Level
1. Describe database management systems fundamental concepts K2
2. Analyze databases using Conceptual and Logical database design K4
3. Apply SQL to Create, maintain and manipulate a relational database K3
4. Apply normalization for refining database schema K3
5. Illustrate Transaction management techniques. K2

SYLLABUS
Introduction: Databases and Database Management Systems, Characteristics of DBMS,
DBMS Vs File System, Database Users, Database applications. Brief introduction of
UNIT-I
different Data Models, Introduction to Relational Database Management Systems,
(08 Hrs)
Concepts of Schema, Instance, three tier schema architecture for data independence,
Database system structure, Centralized and Client Server architecture for the database.

Relational Model: Introduction to relational model, concepts of domain, attribute, tuple,

relation, importance of null values, constraints (Domain, Key constraints, integrity
UNIT-II constraints) and their importance, Relational Algebra (select and project) .
(10 Hrs) Entity Relationship Model: Introduction, Representation of entities, attributes, entity set,
relationship, relationship set, constraints, extended features of ER model, conversion of
ER diagrams to tables.

SQL: Simple Database schema, data types, table definitions (create, alter), Creating tables
UNIT-III with relationship, implementation of key and integrity constraints, different DML
(12 Hrs) operations (insert, delete, update), Basic SQL querying (select and project) using where
clause, arithmetic & logical operations, SQL functions (Date and Time, Numeric, String

Page 9 of 45
 conversion). nested queries, sub queries, grouping, aggregation, ordering, relational set
operations, implementation of different types of joins, view (updatable and non-
updatable).

Schema Refinement (Normalization): Purpose of Normalization or schema refinement,

concept of functional dependency, closure of functional dependencies, normal forms based
UNIT-IV
on functional dependencies, 1NF, 2NF and 3 NF, Boyce-Codd normal form (BCNF),
(10 Hrs)
Lossless join and dependency preserving decomposition, MVD, Fourth normal
form(4NF), Fifth Normal Form (5NF).

Transaction Concept: Transaction State, ACID properties, Concurrent Execution of

transactions, Schedules, Serializability, Recoverability, Testing for Serializability, Lock
UNIT-V
based and timestamp-based concurrency protocols, Implementation of Isolation, Failure
(10 Hrs)
Classification, ARIES Recovery algorithm, Introduction to Indexing Techniques, B+
Trees, operations on B+ Trees, Hash Based Indexing.

Textbooks:
Abraham Silberschatz, Henry F. Korth and S. Sudarshan (Author), Database System Concepts,
1.
7th Edition, TMH, 2021.
Raghu Ramakrishnan and Johannes Gehrke, Database Management Systems, 3rd Edition,
2.
Pearson, 2014
Reference Books:
C.J. Date, A. Kannan and S. Swamy Nathan, An Introduction to Database Systems, 8th Edition,
1.
Pearson, 2006.
Elmasri Ramez and Navathe Shamkant, Fundamentals of Database System, 7th Edition,
2.
Pearson, 2017.
Corlos Coronel, Steven Morris, Peter Robb, Database Principles Fundamentals of Design
3.
Implementation and Management, CBS publishers and Distributors, 2014.

e-Resources
1. https://nptel.ac.in/courses/106/105/106105175/
https://infyspringboard.onwingspan.com/web/en/app/toc/lex_auth_
2.
01275806667282022456_shared/overview

Page 10 of 45
Course Code Category L T P C C.I.E. S.E.E. Exam
B23CS2103 PC 3 -- -- 3 30 70 3 Hrs.

OBJECT ORIENTED PROGRAMMING THROUGH JAVA

(Common to CSE, AIML, CSG, CSIT & CIC)

Course Objectives:
1. To identify Java language components and how they work together in applications.
To learn the fundamentals of object-oriented programming in Java, including defining classes,
2.
invoking methods, using class libraries and collections.
To learn how to extend Java classes with inheritance and dynamic binding and how to use
3.
exception handling, file I/O in Java applications.
4. To understand how to design applications with threads in Java.
5. To understand how to use JDBC APIs for program development.

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

Knowledge
S.No Outcome
Level
1. Apply basic Object-Oriented Programming Concepts in Java. K3
2. Use Arrays, Collections and Strings to solve real world problems. K3
Apply the concepts of Inheritance, Interfaces and Packages for developing
3. K3
reusable programs.
Apply the concepts of Multithreading and Exception Handling to build an
4. K3
efficient and error free code.
5. Use Input/Output Streams and JDBC to manage data effectively. K3

SYLLABUS
Introduction to OOP: Basic concepts of OOP, Differences between Procedural and
Object-Oriented Programming, Advantages of OOP, Applications of OOP.
Introduction to JAVA: Structure of JAVA, Features of JAVA, Data Types, JAVA
Tokens, Control Statements.
UNIT-I
Classes & Objects: Introduction, Class Declaration, Class Members, Declaration of Class
(10 Hrs)
Objects, Access Control for Class Members, Static Variables and Methods, User input to
programs, Command Line Arguments, Method overloading.
Constructors: Default Constructor, Parameterized Constructor, Copy Constructor and
Constructor Overloading, This Keyword.

Arrays: Introduction, Declaration and Initialization of Arrays, Storage of Array in

UNIT-II Computer Memory, Accessing Elements of Arrays, Two-dimensional Arrays and Variable
(10 Hrs) Size Arrays.
Collections: Array List, HashMap and HashSet

Page 11 of 45
 String Handling in Java: Introduction, Methods in String class, String Constant Pool and
String Buffer class, Wrapper classes, Type Conversion.

Inheritance: Introduction, Single inheritance, Multi-level inheritance, Hierarchical

Inheritance, Method Overriding, Super Keyword, Final Keyword and Abstract Classes.
UNIT-III Interfaces: Introduction, Declaration of Interface, Implementing Multiple Inheritance,
(10 Hrs) Extending interfaces, Adapter classes.
Packages: Introduction, Defining Package, Java util Classes and Interfaces, Java lang
Classes, Importing Packages, Sub Packages, Access Modifiers.

Exception Handling: Introduction, Hierarchy of Standard Exception Classes, Keywords

try, catch, throw, throws and finally Blocks, Multiple Catch Statements, Custom
UNIT-IV
Exceptions, Nested try and catch Blocks.
(10 Hrs)
Multithreaded Programming: Introduction, Thread Life Cycle, Extending Thread class,
Implementing Runnable interface, Thread Priorities, Thread Synchronization.

File IO: Introduction, Hierarchy of Stream classes, Byte Streams, Character streams.
UNIT-V
Java Database Connectivity: Introduction, Structure of JDBC, JDBC Architecture,
(10 Hrs)
Types of JDBC Drivers, JAVA Database connection program for MySQL.

Textbooks:
1. The complete Reference Java, 12th edition (2022), Herbert Schildt, Publisher: McGraw Hill.
JdbcApi Tutorial and Reference 3E (2003), by Maydene, Jon Ellis (Author), Jonathan Bruce
2.
(Author), Publisher: Addison-Wesley Professional.
Joy with JAVA, Fundamentals of Object Oriented Programming, Debasis Samanta, Monalisa
3.
Sarma, Cambridge, 2023.
Reference Books:
1. Introduction to java programming, 9th edition (2014) by Y Daniel Liang, Publisher: Pearson.
2. Murach's Java Programming, 5th edition (2017) Joel Murach, Publisher: Mike Murach.
3. JAVA one step ahead, 1stedition (2017) Anitha Seth, B.L.Juneja, Oxford.
Java: A Beginner's Guide, Eighth Edition 8th Edition (2018) by Herbert Schildt, Publisher:
4.
McGraw-Hill Education.
Head First Java 3e (2021) (A Brain Friendly Guide) by Kathy Sierra & Bert bates, Publisher:
5.
O′Reilly.
6. Programming with Java: A Primer 6E (2019) By Balagurusamy, Publisher: TMH.

e-Resources
1. https://nptel.ac.in/courses/106/105/106105191/
2. https://www.coursera.org/learn/java-introduction
3. https://docs.oracle.com/javase/tutorial/

Page 12 of 45
Course Code Category L T P C C.I.E. S.E.E. Exam
B23CS2104 PC -- -- 3 1.5 30 70 3 Hrs.

DATABASE MANAGEMENT SYSTEMS LAB

(Common to CSE, AIML, CSG & CSIT)

Course Objectives: The main objectives of the course is to

1 Query a database using SQL DDL/DML Commands
2 Use PL/SQL to implement procedures, functions, cursors and triggers
3 Implement a DBMS mini project

Course Outcomes: At the end of the course Students will be able to,
Knowledge
S.No Outcome
Level
1 Apply SQL Commands for defining, constructing and manipulating databases K3
2 Demonstrate PL/SQL to create Procedures, Functions, Cursors, and Triggers. K3
3 Apply database design concepts for a real time problem K3

SYLLABUS
Creating, altering and dropping tables and inserting rows into a table (use constraints while
1
creating tables) examples using SELECT command.
Queries (along with sub-Queries) using ANY, ALL, IN, EXISTS, NOTEXISTS, UNION,
INTERSET, Constraints.
2
Example: - Select the roll number and name of the student who secured fourth rank in the
class.
Queries using Aggregate functions (COUNT, SUM, AVG, MAX and MIN), GROUP BY,
3
HAVING and Creation and dropping of Views.
Queries using Conversion functions (to_char, to_number and to_date), string functions
(Concatenation, lpad, rpad, ltrim, rtrim, lower, upper, initcap, length, substr and instr), date
4
functions (Sysdate, next_day, add_months, last_day, months_between, least, greatest, trunc,
round, to_char, to_date)
i. Create a simple PL/SQL program which includes declaration section, executable section and
exception –Handling section (Ex. Student marks can be selected from the table and printed
5 for those who secured first class and an exception can be raised if no records were found)
ii. Insert data into the student table and use COMMIT, ROLLBACK and SAVEPOINT in
PL/SQL block.
Develop a program that includes the features NESTED IF, CASE and CASE expression. The
6
program can be extended using the NULLIF and COALESCE functions.
Program development using WHILE LOOPS, numeric FOR LOOPS, nested loops using
7 ERROR Handling, BUILT –IN Exceptions, USE defined Exceptions, RAISE- APPLICATION
ERROR.

Page 13 of 45
 Develop programs using creation of procedures, passing parameters IN and OUT of
8
PROCEDURES.
Develop programs using creation of functions, invoke functions in SQL Statements and write
9
complex functions.
Develop programs using a CURSOR, FOR UPDATE CURSOR, WHERE CURRENT of
10
clause and CURSOR variables.
Develop Programs using BEFORE and AFTER Triggers, Row and Statement level
11
Triggers
Create a table and perform the search operation on the tables using indexing and non-indexing
12
techniques.
13 Mini Project Applying the concepts learnt in the lab.

Add on Programs:
1 Connect a database using JDBC from a JAVA program.
2 Write a java program using JDBC connection to manipulate data in a database.
3 Create and manipulate a Database using MySQL.

Reference Books:
Bob Bryla and Kevin Loney, Oracle Database 12c The Complete Reference (Oracle Press),
1
McGraw-Hill Education, 2013.
2 Nilesh Shah, Database systems using oracle, 2nd Edition, Pearson Education India, 2016.
Der Lans, Van, Introduction To Sql: Mastering The Relational Database Language, 4th Edition
3
(With Cd), Pearson Education India, 2007.

e-Resources
1. https://livesql.oracle.com/apex/f?p=590:1000

Page 14 of 45
Course Code Category L T P C C.I.E. S.E.E. Exam
B23CS2105 PC -- -- 3 1.5 30 70 3 Hrs.

OBJECT ORIENTED PROGRAMMING THROUGH JAVA LAB

(Common to CSE, AIML, CSG, CSIT & CIC)

Course Objectives:
1 Practice object-oriented programming in the Java programming language
Implement Classes, Objects, Methods, Inheritance, Exception, Runtime Polymorphism, User
2
defined Exception handling mechanism
3 Illustrate inheritance, Exception handling mechanism, JDBC connectivity
4 Construct Threads, Event Handling, implement packages

Course Outcomes: At the end of the course, the students will be able to
Knowledge
S.No Outcome
Level
Construct Basic programs using object-oriented programming principles such
1 K3
as classes, objects, constructors, and polymorphism.
Construct programs that utilize arrays, collections, and strings to solve a variety
2 K3
of computational problems.
3 Apply the concepts of Inheritance, Packages to develop reusable programs. K3
4 Develop robust programs using exception handing, multithreading and File I/O. K3
Develop java application to interact with database by using relevant JDBC
5 K3
Driver.

SYLLABUS
Exercise-1 (Basics)
1. Write a JAVA program to display default value of all primitive data types.
1
2. Write a java program that display the roots of a quadratic equation ax2+bx=0. Calculate
the discriminate D and basing on value of D, describe the nature of root.
Exercise- 2 (Classes & Constructors)
1. Write a JAVA program to implement class mechanism. Create a class, methods and
invoke them inside main method.
2
2. Write a JAVA program to implement method overloading.
3. Write a JAVA program to implement constructor overloading.
4. Write a JAVA program to implement this keyword.
Exercise– 3 (Arrays, Vectors, Strings)
1. Write a JAVA program to search for an element in a given list of elements using binary
search mechanism.
2. Write a JAVA program to sort for an element in a given list of elements using bubble
3
sort.
3. Write a JAVA program to implement Operations on Array list.
4. Write a JAVA program to implement Operations on Hash map.
5. Write a JAVA program to implement Operations on Hash set.

Page 15 of 45
 6. Write a JAVA program to implement String Operations.
7. Write a JAVA program to implement String Buffer class.
Exercise - 4(Inheritance & Interfaces)
1. Write a JAVA program to implement Single Inheritance.
2. Write a JAVA program to implement multilevel Inheritance.
4 3. Write a JAVA program for abstract class to find areas of different shapes.
4. Write a JAVA program that implements Runtime polymorphism (Method Overriding)
5. Write a JAVA program to implement “super” keyword.
6. Write a JAVA program to implement Interface.
Exercise-4(Packages & Exception Handling)
1. Write a JAVA program to implement simple Packages.
2. Write a JAVA program to implement sub-Packages.
3. Write a JAVA program to implement the following Built-in Exceptions.
i. Arithmetic Exception.
4
ii. Array Index Out of Bounds Exception
iii. Number Format Exception.
iv. Null Pointer Exception.
4. Write a JAVA program Illustrating Multiple catch clauses
5. Write a JAVA program to implement user defined Exception.
Exercise–5(Multithreading & File IO)
1. Write a JAVA program that creates threads by extending Thread class. First thread
display “Good Morning “every 1 sec, the second thread displays “Hello “every 2
seconds and the third display “Welcome” every 3 seconds.
2. Write a JAVA program to implement Runnable Interface.
5
3. Write a program to implement priorities to Thread.
4. Write a JAVA program to implement Thread Synchronization (Multiplication tables)
5. Write a JAVA program to copy contents of file into another using Byte Oriented IO.
6. Write a JAVA program to copy contents of file into another using Character Oriented
IO.
Exercise-6 (JDBC)
1. Write a JDBC program to insert data into database.
6 2. Write a JDBC program to delete data from database.
3. Write a JDBC program to update data into database.
4. Write a JDBC program to retrieve data from database.

Reference Books:
1 The complete Reference Java, 12th edition (2022), Herbert Schildt, Publisher: McGraw Hill.
2 Introduction to java programming, 9th edition (2014) by Y Daniel Liang, Publisher: Pearson.
3 Murach's Java Programming, 5th edition (2017) Joel Murach, Publisher: Mike Murach.
JdbcApi Tutorial and Reference 3E (2003), by Maydene, Jon Ellis (Author), Jonathan Bruce
4
(Author), Publisher: Addison-Wesley Professional.

Page 16 of 45
Course Code Category L T P C C.I.E. S.E.E. Exam
B23CS2106 SEC -- 1 2 2 30 70 3 Hrs.

PYTHON PROGRAMMING
(Common to CSE, AIML, CSG, CSIT & CIC)

Course Objectives:
1 Introduce core programming concepts of Python programming language.
2 Demonstrate about Python data structures like Lists, Tuples, Sets and dictionaries.
Implement Functions, Modules in Python Programming and to create practical and
3
contemporary applications using these.

Course Outcomes: At the end of the course, the students will be able to
Knowledge
S.No Outcome
Level
1 Demonstrate various operations on Built-in data types & Strings K3
Solve Computational Problems using Modular Programming through Functions
2 K3
and Modules
3 Apply Data Science methods and techniques on real time data. K3
SYLLABUS
Introduction: Introduction to python programming, Installing and Using Jupyter Notebook.
Parts of Python Programming Language: Identifiers, Keywords, Statements and
Expressions, Variables, Operators, Precedence and Associativity, Data Types, Indentation,
Comments, Reading Input, Print Output, Type Conversions, Dynamic and Strongly Typed
Language.
Control Flow Statements: if statement, if-else statement, if...elif…else, Nested if statement,
while Loop, for Loop, continue and break Statements.
Sample Experiments:
1. Write a program to find the largest element among three Numbers.
2. Write a Program to display all prime numbers within an interval
1 3. Write a program to swap two numbers without using a temporary variable.
4. Demonstrate the following Operators in Python with suitable examples.
i. Arithmetic Operators
ii. Relational Operators
iii. Assignment Operators
iv. Logical Operators
v. Bit wise Operators
vi.Ternary Operator
vii. Membership Operators
viii. Identity Operators
5. Write a program to add and multiply complex numbers

Page 17 of 45
 6. Write a program to print multiplication table of a given number.
Functions & Modules: Built-In Functions, Commonly Used Modules, Function Definition
and Calling the function, return Statement and void Function, Scope and Lifetime of Variables,
Default Parameters, Keyword Arguments, *args and **kwargs, Command Line Arguments.
Modules: random module, os module.
Strings: Creating and Storing Strings, Basic String Operations, Accessing Characters in String
by Index Number, String Slicing and Joining, String Methods, Formatting Strings.
Lists: Creating Lists, Basic List Operations, Indexing and Slicing in Lists, Built-In Functions
Used on Lists, List Methods, del Statement.
Sample Experiments:
2 1. Write a program to define a function with multiple return values.
2. Write a program to define a function using default arguments.
3. Write a program to find the length of the string without using any library functions.
4. Write a program to check if the substring is present in a given string or not.
5. Write a program to perform the given operations on a list:
i. addition
ii. insertion
iii. slicing
6. Write a program to perform any 5 built-in functions by taking any list.

Dictionaries: Creating Dictionary, Accessing and Modifying key: value Pairs in Dictionaries,
Built-In Functions Used on Dictionaries, Dictionary Methods, del Statement.
Tuples and Sets: Creating Tuples, Basic Tuple Operations, tuple() Function, Indexing and
Slicing in Tuples, Built-In Functions Used on Tuples, Relation between Tuples and Lists,
Relation between Tuples and Dictionaries, Using zip() Function, Sets, Set Methods, Frozenset.
Sample Experiments:
3 1. Write a program to create tuples (name, age, address, college) for at least two members
and concatenate the tuples and print the concatenated tuples.
2. Write a program to count the number of vowels in a string (No control flow allowed).
3. Write a program to check if a given key exists in a dictionary or not.
4. Write a program to add a new key-value pair to an existing dictionary.
5. Write a program to sum all the items in a given dictionary.

Files: Types of Files, Creating and Reading Text Data, File Methods to Read and Write Data,
Reading and Writing Binary Files, Reading and Writing CSV Files
Object-Oriented Programming: Classes and Objects, Creating Classes in Python, Creating
Objects in Python, Constructor Method, Classes with Multiple Objects, Class Attributes Vs
Data Attributes, Encapsulation, Inheritance, Polymorphism.
4
Sample Experiments:
1. Write a program to sort words in a file and put them in another file. The output file
should have only lower-case words, so any upper-case words from source must be
lowered.
2. Python program to print each line of a file in reverse order.

Page 18 of 45
 3. Python program to compute the number of characters, words and lines in a file.
4. Write a program to create, display, append, insert and reverse the order of the items in
the array.
5. Write a program to add, transpose and multiply two matrices.
6. Write a Python program to create a class that represents a shape. Include methods to
calculate its area and perimeter. Implement subclasses for different shapes like circle,
triangle, and square.
Introduction to Data Science:
NumPy:
NumPy arrays using Array function, Integer Indexing, Array Indexing, Boolean Array
Indexing, Slicing and Iterating Arrays, Arithmetic Operations on NumPy arrays, Mathematical
Functions in NumPy, changing shape of an array, Stacking and Splitting of arrays, Broad
Casting in arrays.
Pandas:
Pandas Series, Pandas Data Frame
5
Sample Experiments:
1. Python Program to demonstrate creation of Numpy Arrays.
2. Python program to demonstrate basic slicing, integer and Boolean indexing.
3. Python Program to Manipulate Numpy Arrays.
4. Python program to demonstrate Mathematical and Statistical Operations on Numpy
Arrays.
5. Python program to create Series and Data Frame Objects using the sample data.
6. Python Program to demonstrate various operation on Series and Data Frame Objects.

Reference Books:
1 Gowrishankar S, Veena A., Introduction to Python Programming, CRC Press.
2 Python Programming, S Sridhar, J Indumathi, V M Hariharan, 2ndEdition, Pearson, 2024
3 Introduction to Programming Using Python, Y. Daniel Liang, Pearson

E-Resources
1. Programming in Python | Coursera
2. Learn Python - Free Interactive Python Tutorial

Page 19 of 45
Course Code Category L T P C C.I.E. S.E.E. Exam
B23MC2102 MC 2 -- -- -- 30 -- --

ENVIRONMENTAL SCIENCE
(Common to CIC, CSG, CSE, ECE and EEE)

Course Objectives: The objective of the course is to impart:

1. Overall view on natural resources.
2. Awareness on ecosystem and its services.
3. Various environmental challenges induced due to unplanned anthropogenic activities.
4. Consciousness on the social issues, environmental legislation and global treaties

Course Outcomes: At the end of the course, the students will be able to
Knowledge
S. No Outcome
Level
1 Describe natural resources and their interaction K2
2 Illustrate ecosystem types, biodiversity and conservation strategies K2
3 Summarize contaminants of environment and preventive methods K2
4 Explain protection of environment by employing constitutional provisions K2
5 Explain global scenario of surroundings and social conditions K2

SYLLABUS
Multidisciplinary Nature of Environmental Studies: Definition, Scope and Importance
– Need for Public Awareness. Natural Resources: Renewable and non-renewable resources
– Natural resources and associated problems. Forest resources – Use and over –
exploitation, deforestation, case studies – Timber extraction – Mining, dams and other
effects on forest and tribal people. Water resources – Use and over utilization of surface
UNIT-I
and ground water – Floods, drought, conflicts over water, dams – benefits and problems.
(8 Hrs)
Mineral resources: Use and exploitation, environmental effects of extracting and using
mineral resources, case studies. Food resources: World food problems, changes caused by
agriculture and overgrazing, effects of modern agriculture, fertilizer-pesticide problems,
water logging, salinity, case studies. Energy resources: Growing energy needs, renewable
and non-renewable energy sources use of alternate energy sources

Ecosystems: Concept of an ecosystem. – Structure and function of an ecosystem –

Producers, consumers and decomposers – Energy flow in the ecosystem – Ecological
succession – Food chains, food webs and ecological pyramids – Introduction, types,
UNIT-II
characteristic features, structure and function of the following ecosystem: a. Forest
(8 Hrs)
ecosystem. b. Grassland ecosystem c. Desert ecosystem d. Aquatic ecosystems (ponds,
streams, lakes, rivers, oceans, estuaries)
Biodiversity and Its Conservation : Introduction and Definition - genetic, species and

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

Environmental Pollution: Definition, Cause, effects and control measures of: a. Air
Pollution. b. Water pollution c. Soil pollution d. Marine pollution e. Noise pollution f.
UNIT-III Thermal pollution g. Nuclear hazards. Solid Waste Management: Causes, effects and
(6 Hrs) control measures of urban and industrial wastes – Role of an individual in prevention of
pollution – Pollution case studies – Disaster management: floods, earthquake, cyclone and
landslides

Social Issues and the Environment: From Unsustainable to Sustainable development –

Urban problems related to energy watershed management – Resettlement and
rehabilitation of people; its problems and concerns – Carbon credits, Mission LiFE.
Environmental ethics: Issues and possible solutions.
UNIT-IV
Climate change, global warming, acid rain, ozone layer depletion, nuclear accidents and
(6 Hrs)
holocaust –Wasteland reclamation – Consumerism and waste products.
Environment Protection Act. – Air (Prevention and Control of Pollution) Act. – Water
(Prevention and control of Pollution) Act – Wildlife Protection Act – Forest Conservation
Act. Issues involved in enforcement of environmental legislation – Public awareness.

Human Population And The Environment: Population growth, variation among

nations. Population explosion – Family Welfare Programmes. – Environment and human
health – Human Rights – Value Education – HIV/AIDS – Women and Child Welfare –
UNIT-V
Role of information Technology in Environment and human health – Case studies.
(6 Hrs)
Field Work: 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, and birds – river, hill slopes, etc.

Text Books:
Erach Bharucha, Text book of Environmental Studies for Undergraduate Courses, Universities
1.
Press (India) Private Limited, 2019.
2. Palaniswamy, Environmental Studies, 2/e, Pearson education, 2014.
3. S. Azeem Unnisa, Environmental Studies, Academic Publishing Company, 2021.
K. Raghavan Nambiar, “Text book of Environmental Studies for Undergraduate Courses as per
4.
UGC model syllabus”, SciTech Publications (India), Pvt. Ltd, 2010.
5 K. V. S. G. Murali Krishna, The Book of Environmental Studies, Savera Publishing House.
6 Environmental Studies, R. Rajagopalan, 2nd Edition, 2011, Oxford University Press.
Reference Books:

Page 21 of 45
 1. Deeksha Dave and S.S. Katewa, Textbook of Environmental Studies, 2/e, Cengage Learning.
2. M. Anji Reddy, “Textbook of Environmental Sciences and Technology”, BS Publication, 2014.
3. J.P. Sharma, Comprehensive Environmental studies, Laxmi publications, 2006.
J. Glynn Henry and Gary W. Heinke, Environmental Sciences and Engineering, Prentice Hall of
4.
India Private limited, 1988.
5. G.R. Chatwal, A Text Book of Environmental Studies, Himalaya Publishing House, 2018
Gilbert M. Masters and Wendell P. Ela, Introduction to Environmental Engineering and Science,
6.
1/e, Prentice Hall of India Private limited, 1991.
e-Resources
1. https://onlinecourses.nptel.ac.in/noc23_hs155/preview
https://www.edx.org/learn/environmental-science/rice-university-ap-r-environmental-science-
2. part-3-pollution-and-resources?index=product&objectID=course-3a6da9f2-lec07.pdf
(iasri.res.in)
http://ecoursesonline.iasri.res.in/Courses/Environmental%20Science-
3.
I/Data%20Files/pdf/lec07.pdf
4. https://www.youtube.com/watch?v=5QxxaVfgQ3k

Page 22 of 45
 SAGI RAMA KRISHNAM RAJU ENGINEERING COLLEGE
(AUTONOMOUS)
(Approved by AICTE, New Delhi, Affiliated to JNTUK, Kakinada)
Accredited by NAAC with ‘A+’ Grade.
Recognised as Scientific and Industrial Research Organisation
SRKR MARG, CHINA AMIRAM, BHIMAVARAM – 534204 W.G.Dt., A.P., INDIA

Regulation: R23 II / IV - B.Tech. II - Semester

COMPUTER SCIENCE AND ENGINEERING
COURSE STRUCTURE
(With effect from 2023-24 admitted Batch onwards)
Course Total
Course Name Category L T P Cr C.I.E. S.E.E.
Code Marks
Managerial Economics and
B23HS2201 HS 2 0 0 2 30 70 100
Financial Analysis
B23BS2201 Probability & Statistics ES 3 0 0 3 30 70 100
B23CS2201 Operating Systems PC 3 0 0 3 30 70 100
Advanced Data Structures
B23CS2202 PC 3 0 0 3 30 70 100
& Algorithm Analysis
B23CS2203 Software Engineering PC 3 0 0 3 30 70 100
B23CS2204 Operating Systems Lab PC 0 0 3 1.5 30 70 100
Advanced Data Structures
B23CS2205 PC 0 0 3 1.5 30 70 100
& Algorithm Analysis Lab
B23CS2206 Full Stack Development-1 SEC 0 1 2 2 30 70 100
Design Thinking &
B23CS2207 ES 1 0 2 2 30 70 100
Innovation
B23MC2201 English Proficiency MC 2 0 0 - 30 - 30
TOTAL 17 1 10 21 300 630 930

Page 23 of 45
 Course Code Category L T P C C.I.E. S.E.E. Exam
B23HS2201 HS 2 -- -- 2 30 70 3Hrs.

MANAGERIAL ECONOMICS AND FINANCIAL ANALYSIS

(Common to AIDS, CSE, CIC, CSG, CSIT, CE, ECE, EEE, ME)

Course Objectives: Students are expected to

Understand the concept and nature of Managerial Economics, its relationship with other
1.
disciplines, the Concept of Demand and Demand forecasting
2. Familiarize about the Concepts of Cost and Break-Even Analysis
3. Learn about accounting cycle and preparation of Financial Statements
4. Understand the nature of markets and the Pricing Methods

5. Know the concept of Capital, Sources of Raising Finance and Depreciation

Course Outcomes: At the end of the course the student will be able to
Knowledge
S.No Outcome
Level
Interpreting the importance of Managerial Economics, demand analysis and
1. K2
methods of demand forecasting
2. Describe about the usefulness of Cost Analysis and Break Even Analysis K2
Apply the principles of accounting to convert the transactions and events into
3. K3
Journal, Ledger and Trail balance
4. Compute the results of Business by preparing Final Accounts K3
5. Illustrate the nature of markets and pricing theories K2
Explain the Types of capital, their sources and importance &estimation of
6. K2
Depreciation

SYLLABUS
Introduction to Managerial Economics and demand Analysis:
Managerial Economics: Definition of Economics & Classification of Economics (Micro
UNIT-I & Macro), Meaning, Nature, & Scope of Managerial Economics.
(12 Hrs) Demand Analysis: Concept of Demand, Determinants of Demand, Demand schedule,
Demand curve, Law of Demand and its exceptions. Elasticity of Demand, Types of
Elasticity of Demand. Importance of Demand Forecasting and its Methods.

Cost Analysis: Importance of cost analysis, Types of Cost- Actual cost Vs Opportunity
UNIT-II cost, Fixed cost Vs Variable cost, Explicit Vs Implicit cost, Historical cost Vs Replacement
(8 Hrs) cost, Incremental cost Vs Sunk cost; Elements of costs – Material, Labour, Expenses;
Methods of costing - Job costing, contract costing, Process costing, Batch costing, Unit

Page 24 of 45
 costing, Service costing, Multiple costing. Break-even analysis: Determination of Break-
even Point Applications, Assumptions and Limitations of Break-even analysis (Theory
only).

Introduction to Financial Accounting:

UNIT-III Importance of Accounting - Double Entry System of Accounting - Types of Accounts -
(12 Hrs) Journal, Ledger, Trail Balance, Trading Account, Profit and Loss Account and Balance
Sheet (Final Accounts with Simple adjustments).

Introduction to Markets & Pricing Policies

Market Structures: Salient Features of Perfect Competition, Monopoly, Monopolistic
UNIT-IV competition, Oligopoly and Duopoly. Pricing: Importance of pricing and its meaning;
(8 Hrs) Methods of Pricing: Cost Based -Full cost, Mark-up, Marginal & Break-even; Demand
Based-Penetrating, Skimming; Competition Based-Going rate, Sealed Bid, Discount;
Internet Pricing -Flat-rate, Usage sensitive.

Capital & Depreciation: Types of Capital-Fixed capital & Working Capital, Components
of Working Capital, Factors influencing Working capital. Methods of Raising Finance -
UNIT-V
Short term, Medium term and Long term. Depreciation – Meaning, Importance and
(8 Hrs)
causes of depreciation; Methods of Depreciation-Straight line and Diminishing Balancing
methods (Theory only).

Text Books:
1. AR Aryasri, Managerial Economics and Financial Analysis, TMH Pvt. Ltd, New Delhi
Dr. N. Appa Rao, Dr. P. Vijaya kumar: Managerial Economics and Financial Analysis,
2.
Cengage Publications, NewDelhi

Reference Books:
Dr.B.Kuberudu & T.V.Ramana :Managerial Economics and Financial anaysis, Himalaya
1.
Publishing House
2. Varshney R.L, K.L Maheswari, Managerial Economics, S. Chand & Company Ltd,
3. Shashi K.Gupta & R.K.Sharma Management Accounting, Kalyani Publishers
4. Maheswari S.N, An Introduction to Accountancy, Vikas Publishing House Pvt Ltd

Page 25 of 45
 Course Code Category L T P C C.I.E. S.E.E. Exam
B23BS2201 ES 3 0 0 3 30 70 3 Hrs.

PROBABILITY AND STATISTICS

(Common to AIML, CSE, CSBS, CSIT and IT)

Course Objectives: Students are expected to

Acquire critical thinking skills from the concepts of Descriptive Statistics, Data Science and
1.
Probability.
2. Predict the relationship and the impact of the relationship between the variables.
3. Obtain Decision-making skills from Sampling theory.

Course Outcomes: Upon the successful completion of this course, Students will
Knowledge
S.No. Outcome
Level
1. Compute various statistical measures like central tendency and spread values. K2
Use the concepts of probability and random variables to solve simple problems
2. K3
based on discrete and continuous probability distributions.
Determine correlation and regression coefficients and model a best suitable
3. K3
curve for a given data using the method of least squares.
Apply the procedures of sampling theory to find point and interval estimates for
4. K3
various sampling distributions.
Model a framework by testing of hypothesis for getting inferences about
5. K3
Population Parameters based on Sample statistic.

SYLLABUS
Descriptive statistics and methods for data science:
Data science- Statistics Introduction- Population vs Sample –Collection of data: primary
UNIT-I
and secondary data- Type of variables: dependent and independent, Categorical and
(10 Hrs.)
Continuous variables- Data visualization- Measures of Central tendency- Measures of
Variability (spread or variance)- Moments- Measures of Skewness and Kurtosis.

Probability, Random variables and Distributions:

Probability– Conditional probability, addition, Multiplication theorems and Baye’s
theorem.
UNIT-II Random variables – Discrete and Continuous random variables – Distribution functions –
(12 Hrs.) Probability mass function, Probability density function and Cumulative distribution
functions – Mathematical Expectation – Variance.
Discrete and Continuous Distributions:
Discrete Distributions: Bernoulli, Binomial and Poisson distributions - Mean, Variance,

Page 26 of 45
 Fitting of distributions.
Continuous Distributions: Uniform distribution, Normal Distribution, Standard Normal
Variate - Mean, Variance.

Correlation, Regression andCurve fitting:

Correlation: Definition, Karl Pearson’s Coefficient of Correlation, Limits for correlation
coefficient, Rank Correlation, Spearman’s rank correlation coefficient (without proofs).
UNIT-III
Linear Regression: Regression- Regression coefficients and properties–Multiple Linear
(12 Hrs.)
Regression.
Curve Fitting: Method of Least Squares, Fitting of a Straight line, Fitting of a Parabola,
Fitting of an Exponential curves: 𝑦 = 𝑎𝑒 𝑏𝑥 , 𝑦 = 𝑎𝑏 𝑥 and Power curve: 𝑦 = 𝑎𝑥 𝑏 .

Sampling Theory:
Introduction – Population and Samples –Parameter and Statistic- Sampling distribution of
UNIT-IV statistic-Standard error- Sampling distribution of Means and Variance (definition only) –
(8 Hrs.) Point and Interval estimations.
Maximum error of estimate – Central limit theorem (without proof) – Estimation using t,
 2 and F-distributions.

Testing of Hypothesis:
Testing of Hypothesis- Formulation of Null hypothesis, Alternative hypothesis, Critical
region, level of significance, Errors in sampling- Type-I-error, Type-II-error, One-tailed
and Two-tailed tests, Degrees of freedom.
Large Sample Theory:
UNIT-V
Test of significance for single and difference of Proportions.
(12 Hrs.)
Small Sample Theory:
Student’s-t-distribution: Definition, t-test for single mean, t-test for difference of means,
Paired t-test for difference of means.
F-distribution: Definition, F-test for equality of two population variances.
Chi-square distribution: Definition, Chi-square test for attributes and goodness of fit.

Text Books:
Fundamentals of Mathematical Statistics by S. C. Gupta and V.K. Kapoor, Sultan Chand &
1.
Sons Publishers.
2 Probability and Statistics for Engineers, Miller and Freund, 7th edition, Prentice-Hall India.
Reference Books:
Probability and statistics for Engineers and Scientists by Ronald E. Walpole, Raymond H.
1.
Myers, Sharon L. Myers and Keying Ye, Eighth edition, Pearson Education.
Probability and Statistics for Engineering and the Sciences, Jay l. Devore, 8th Edition,
2.
Cengage.
Introduction to probability and statistics Engineers and the Scientists, Sheldon M. Ross, 4th
3.
Edition, Academic Foundation, 2011.

Page 27 of 45
 Johannes Ledolter and Robert V. Hogg, Applied statistics for Engineers and Physical
4.
Scientists, 3rd Edition, Pearson, 2010.
5. Probability, Statistics and Random Processes by T.Veerarajan, Tata McGraw Hill Pub.
6. Higher Engineering Mathematics, by Dr.B.S.Grewal, 43rd Edition, Khanna Publishers
Paul L. Meyer, Introductory Probability and Statistical Applications (2ndedn.), Addison-
7.
Wesley, 1970.
e-Resources:
1. http://www.swayam.gov.in
2. https://archive.nptel.ac.in/courses/106/104/106104233/

Page 28 of 45
Course Code Category L T P C C.I.E. S.E.E. Exam
B23CS2201 PC 3 -- -- 3 30 70 3 Hrs.

OPERATING SYSTEMS
(Common to CSE CSG, CSIT & CIC)

Course Objectives:
Understand the basic concepts and principles of operating systems, including process
1.
management, memory management, file systems, and Protection
Make use of process scheduling algorithms and synchronization techniques to achieve better
2.
performance of a computer system.
3. Illustrate different conditions for deadlock and their possible solutions.

Course Outcomes: At the end of the course Students will be able to,
Knowledge
S.No Outcome
Level
1. Explain the principles of operating systems in diverse computing environments. K2
Apply various process scheduling algorithms and thread management
2. K3
techniques to optimize system performance.
Implement synchronization mechanisms and deadlock handling strategies to
3. K3
ensure efficient concurrent system operation
Analyze the memory management strategies in OS to optimize the practical
4. K4
computing scenarios.
Implement various file allocation methods, fundamental Protection techniques
5. K3
in OS to secure data integrity and accessibility.

SYLLABUS
Operating Systems Overview: Introduction, Operating system functions, Operating
systems operations, Computing environments, Free and Open-Source Operating Systems
UNIT-I System Structures: Operating System Services, User and Operating-System Interface,
(10 Hrs) system calls, Types of System Calls, system programs, Operating system Design and
Implementation, Operating system structure, Building and Booting an Operating System,
Operating system debugging

Processes: Process Concept, Process scheduling, Operations on processes, Inter-process

communication.
UNIT-II
Threads and Concurrency: Multithreading models, Thread libraries, Threading issues.
(10 Hrs)
CPU Scheduling: Basic concepts, Scheduling criteria, Scheduling algorithms, Multiple
processor scheduling.

Page 29 of 45
 Synchronization Tools: The Critical Section Problem, Peterson’s Solution, Mutex Locks,
UNIT-III Semaphores, Monitors, Classic problems of Synchronization.
(10 Hrs) Deadlocks: system Model, Deadlock characterization, Methods for handling Deadlocks,
Deadlock prevention, Deadlock avoidance, Deadlock detection, Recovery from Deadlock.

Memory-Management Strategies: Introduction, Contiguous memory allocation, Paging,

Structure of the Page Table, Swapping.
UNIT-IV
Virtual Memory Management: Introduction, Demand paging, Copy-on-write, Page
(10 Hrs)
replacement, Allocation of frames, Thrashing
Storage Management: Overview of Mass Storage Structure, HDD Scheduling.

File System: File System Interface: File concept, Access methods,

Directory Structure; File system Implementation: File-system structure, File-system
UNIT-V Operations, Directory implementation, Allocation method, Free space management;
(10 Hrs) File-System Internals: File-System Mounting, Partitions and Mounting, File Sharing.
Protection: Goals of protection, Principles of protection, Protection Rings, Domain of
protection, Access matrix.

Textbooks:
1. Operating System Concepts, Silberschatz A, Galvin P B, Gagne G, 10th Edition, Wiley, 2018.
2. Modern Operating Systems, Tanenbaum A S, 4th Edition, Pearson, 2016

Reference Books:
1. Operating Systems -Internals and Design Principles, Stallings W, 9th edition, Pearson, 2018
Operating Systems: A Concept Based Approach, D.M Dhamdhere, 3rd Edition, McGraw- Hill,
2.
2013

e-Resources
1. https://nptel.ac.in/courses/106/106/106106144/
2. http://peterindia.net/OperatingSystems.html

Page 30 of 45
Course Code Category L T P C C.I.E. S.E.E. Exam
B23CS2202 PC 3 -- - 3 30 70 3 Hrs.

ADVANCED DATA STRUCTURES & ALGORITHM ANALYSIS

(Common to CSE, AIML, CSG & CSIT)

Course Objectives:
1. Provide knowledge on advanced data structures frequently used in Computer Science domain.
2. Develop skills in algorithm design techniques popularly used.
3. Understand the use of various data structures in the algorithm design.

Course Outcomes: At the end of the course Students will be able to,
Knowledge
S.No Outcome
Level
1. Use advanced data structures to organize data and solve connectivity problems. K3
2. Analyze the time complexity of Divide and Conquer based algorithms. K4
3. Apply Greedy and Backtracking strategies to solve computational problems. K3
4. Use Dynamic programming strategy to solve optimization problems. K3
5. Determine solutions for combinatorial optimization problems. K3

SYLLABUS
Trees :
AVL Trees – Creation, Insertion, Deletion operations,
UNIT-I Red-Black Trees – Creation, Insertion, Deletion operations,
(12Hrs) Heap Trees (Priority Queues) – Min and Max Heaps, Operations and Applications.
Graphs: Terminology, Representations, Basic Search and Traversals, Connected and Bi-
connected Components, Euler circuits.

Introduction to Algorithm Analysis, Space and Time Complexity analysis, Asymptotic

Notations.
UNIT-II
Divide and Conquer: The General Method, Quick Sort, Merge Sort, Strassen’s matrix
(08 Hrs)
multiplication, Convex Hull, Time complexity analysis of divide and conquer
algorithms.

Greedy Method: General Method, Job Sequencing with deadlines, Knapsack Problem,
UNIT-III Minimum cost spanning trees, Single Source Shortest Paths.
(10 Hrs) Backtracking: General Method, 8-Queens Problem, Sum of Subsets problem, Graph
Coloring, 0/1 Knapsack Problem.

Page 31 of 45
 Dynamic Programming: General Method, All pairs shortest paths, Single Source
UNIT-IV
Shortest Paths – General Weights (Bellman Ford Algorithm), Optimal Binary Search
(10 Hrs)
Trees, 0/1 Knapsack, String Editing, Traveling Salesperson problem.

Branch and Bound: The General Method, 0/1 Knapsack Problem, Travelling
Salesperson problem.
UNIT-V
NP Hard and NP Complete Problems: Basic Concepts, Cook’s theorem.
(10 Hrs)
NP Hard Graph Problems: Clique Decision Problem (CDP), Chromatic Number
Decision Problem (CNDP), Traveling Salesperson Decision Problem (TSP).

Textbooks:
Data Structures and Algorithm Analysis in C, Mark Allen Weiss, 2nd Edition ,Pearson Edu
1.
Publishers, 2007.
Computer Algorithms/C++ Ellis Horowitz, Sartaj Sahni, Sanguthevar Rajasekaran ,2nd
2.
Edition University Press,2008.
Reference Books:
Fundamentals of Data Structures in C++, Horowitz Ellis, Sahni Sartaj, Mehta, Dinesh, 2nd
1.
Edition, Universities Press, 2008.
Data Structures and Algorithms: Concepts, Techniques and Applications – G.A.V.Pai, 1st
2.
Edition Tata Mc Graw Hill Publishers,2017.
Data Structures and program design in C, Robert Kruse, 2nd Edition, ,Pearson Education
3.
Asia,2006.
An introduction to Data Structures with applications, Trembley& Sorenson,2nd Edition, Mc
4.
Graw Hill,2010.
The Art of Computer Programming, Vol.1: Fundamental Algorithms, Donald E Knuth,
5.
Addison- Wesley, 1997.

e-Resources
1. https://www.tutorialspoint.com/advanced_data_structures/index.asp
2. http://peterindia.net/Algorithms.html

Page 32 of 45
Course Code Category L T P C C.I.E. S.E.E. Exam
B23CS2203 PC 3 -- -- 3 30 70 3 Hrs.

SOFTWARE ENGINEERING
(For CSE)

Course Objectives: The objectives of this course are to introduce

1. Software life cycle models, Software requirements and SRS document.
2. Project Planning, quality control and ensuring good quality software.
Software Testing strategies, use of CASE tools, Implementation issues, validation & verification
3.
procedures.

Course Outcomes: At the end of the course Students will be able to,
Knowledge
S. No. Outcome
Level
Determine the suitable software life cycle model for a given
1. K3
application/problem
Use UML modelling for analyzing and specifying the proposed system for a
2. K3
given application/problem
3. Apply software designing principles for designing the proposed system K3
Describe the approaches for software reliability, quality management and
4. K2
testing
5. Summarize project progress using project management techniques K2

SYLLABUS
Introduction: Evolution, Software development projects, Exploratory style of software
developments, Emergence of software engineering, Notable changes in software
development practices, Computer system engineering.
UNIT-I
Software Life Cycle Models: Basic concepts, Waterfall model and its extensions, Rapid
(10 Hrs)
application development, Spiral model.
Agility: Agility and the Cost of Change, Agile Process, Extreme Programming (XP),
Other Agile Process Models.

Requirements Analysis And Specification: Requirements gathering and analysis,

Software Requirements Specification (SRS), Formal system specification.
UNIT-II
Object Modelling using UML: Basic Object-Orientation Concepts, Unified Modelling
(10 Hrs)
Language, UML Diagrams, Use Case Model, Class Diagrams, Interaction Diagrams,
Activity Diagrams and State Chart Diagram.

UNIT-III Software Design: Overview of the design process, How to characterize a good software
(12 Hrs) design? Layered arrangement of modules, Cohesion and Coupling. Approaches to

Page 33 of 45
 software design.
Function-Oriented Software Design: Overview of SA/SD methodology, Structured
analysis, Developing the DFD model of a system, Structured design.
User Interface Design: Characteristics of a good user interface, Basic concepts, Types of
user interfaces, Fundamentals of component-based GUI development, and user interface
design methodology.

Coding And Testing: Coding, Code review, Software documentation, Testing, Black-box
testing, White-Box testing, Debugging, Program analysis tools, Integration testing, Testing
UNIT-IV object-oriented programs, System testing.
(10 Hrs) Software Reliability And Quality Management: Software reliability, Statistical testing,
Software quality, Software quality management system, ISO 9000. SEI Capability
maturity model. Few other important quality standards, and Six Sigma.

Computer-Aided Software Engineering (Case): CASE and its scope, CASE

environment, CASE support in the software life cycle, other characteristics of CASE tools,
towards second generation CASE Tool, and Architecture of a CASE Environment.
Software Maintenance: Characteristics of software maintenance, Software reverse
UNIT-V
engineering, and Software maintenance process models and Estimation of maintenance
(8 Hrs)
cost, Metrics for project size estimation, Project estimation techniques, Empirical
Estimation techniques, COCOMO, Halstead’s software science, risk management
Software Reuse: Reuse- definition, introduction, reason behind no reuse so far, Basic
issues in any reuse program, a reuse approach, and Reuse at organization level.

Textbooks:
1. Fundamentals of Software Engineering, Rajib Mall, 5th Edition, PHI.
Software Engineering A practitioner’s Approach, Roger S. Pressman, 9th Edition, Mc-Graw
2.
Hill International Edition.
Reference Books:
1. Software Engineering, Ian Sommerville, 10th Edition, Pearson.
2. Software Engineering, Principles and Practices, Deepak Jain, Oxford University Press.

e-Resources
1. https://nptel.ac.in/courses/106/105/106105182/
https://infyspringboard.onwingspan.com/web/en/app/toc/lex_auth_01260589506387148827_sh
2.
ared/overview
https://infyspringboard.onwingspan.com/web/en/app/toc/lex_auth_013382690411003904735_s
3
hared/overview

Page 34 of 45
Course Code Category L T P C C.I.E. S.E.E. Exam
B23CS2204 PC -- -- 3 1.5 30 70 3 Hrs.

OPERATING SYSTEMS LAB

(For CSE)

Course Objectives:
1 Provide insights into system calls, file systems, semaphores,
Develop and debug CPU Scheduling algorithms, page replacement algorithms, thread
2
implementation
3 Implement Bankers Algorithms to Avoid the Dead Lock

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

Knowledge
S.No Outcome
Level
1 Master UNIX system calls for developing robust system-level applications. K3
Analyze CPU scheduling and memory management techniques to optimize
2 K4
system performance.
Implement Banker's Algorithm to ensure deadlock avoidance in concurrent
3 K3
systems.

SYLLABUS
1 Practicing of Basic UNIX Commands.
Write programs using the following UNIX operating system calls
2
fork, exec, getpid, exit, wait, close, stat, opendir and readdir
3 Simulate UNIX commands like cp, ls, grep, etc.,
Simulate the following CPU scheduling algorithms
4
a) FCFS b) SJF c) Priority d) Round Robin
Control the number of ports opened by the operating system with
5
a) Semaphore b) Monitors.
6 Implement concurrent execution of threads using pthreads library.
7 Implement producer-consumer problem using Semaphores.
Implement the following memory allocation methods for fixed partition
8
a) First fit b) Worst fit c) Best fit
Simulate the following page replacement algorithms
9
a) FIFO b) LRU c) LFU
10 Simulate Paging Technique of memory management.
11 Implement Bankers Algorithm for Dead Lock avoidance and prevention
Simulate the following file allocation strategies
12
a) Sequential b) Indexed c) Linked

Page 35 of 45
 13 Download and install nachos operating system and experiment with it

Reference Books:
1 Operating System Concepts, Silberschatz A, Galvin P B, Gagne G, 10th Edition, Wiley, 2018.
2 Modern Operating Systems, Tanenbaum A S, 4th Edition, Pearson, 2016
3 Operating Systems -Internals and Design Principles, Stallings W, 9th edition, Pearson, 2018

Page 36 of 45
Course Code Category L T P C C.I.E S.E.E. Exam
B23CS2205 PC -- -- 3 1.5 30 70 3 Hrs.

ADVANCED DATA STRUCTURES & ALGORITHM ANALYSIS LAB

(Common to CSE, AIML, CSG & CSIT)

Course Objectives:
1 Acquire practical skills in constructing and managing Data structures.
2 Apply the popular algorithm design methods in problem-solving scenarios.

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

Knowledge
S.No Outcome
Level
1 Demonstrate the basic operations of advanced trees. K3
2 Apply graph traversal techniques to solve connectivity problems. K3
3 Analyze the performance of sorting algorithms for various inputs. K4
4 Apply different algorithm strategies to find solutions for various problems. K3

SYLLABUS
Construct an AVL tree for a given set of elements which are stored in a file. And implement
1 insert and delete operation on the constructed tree. Write contents of tree into a new file
using in-order.
Construct Min and Max Heap using arrays, delete any element and display the content of the
2
Heap.
Implement BFT and DFT for given graph, when graph is represented by
3
a) Adjacency Matrix b) Adjacency Lists
4 Write a program for finding the bi-connected components in a given graph.
Implement Quick sort and Merge sort and observe the execution time for various input sizes
5
(Average, Worst and Best cases).
Compare the performance of Single Source Shortest Paths using Greedy method when the
6
graph is represented by adjacency matrix and adjacency lists.
7 Implement Job sequencing with deadlines using Greedy strategy.
8 Implement N-Queens Problem Using Backtracking.
9 Use Backtracking strategy to solve 0/1 Knapsack problem.
10 Write a program to solve 0/1 Knapsack problem Using Dynamic Programming.
11 Implement Travelling Sales Person problem using Branch and Bound approach.

Reference Books
Data Structures and Algorithm Analysis in C, Mark Allen Weiss, 2nd Edition ,Pearson Edu
1
Publishers,2002

Page 37 of 45
 Computer Algorithms/C++ Ellis Horowitz, Sartaj Sahni, Sanguthevar Rajasekaran 2nd
2
Edition University Press,2008
Data Structures and program design in C, Robert Kruse, 2nd Edition, Pearson Education
3
Asia,2006.

E-Resources
1. https://www.tutorialspoint.com/advanced_data_structures/index.asp
2. http://peterindia.net/Algorithms.html
3. https://github.com/GDSC-KIIT/DSA-Resource?stab=readme-ov-file
4. https://www.geeksforgeeks.org/design-and-analysis-of-algorithms/?ref=lbp
5. https://www.cs.usfca.edu/~galles/visualization/Algorithms.html

Page 38 of 45
Course Code Category L T P C C.I.E. S.E.E. Exam
B23CS2206 SEC 0 1 2 2 30 70 3 Hrs.

FULL STACK DEVELOPMENT – 1

(Common to CSE, AIML, CSG, CSIT & CIC)

Course Objectives: The main objectives of the course are to

1 Make use of HTML elements and their attributes for designing static web pages
2 Build a web page by applying appropriate CSS styles to HTML elements
3 Experiment with Java Script to develop dynamic web pages and validate forms

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

Knowledge
S.No Outcome
Level
1 Use HTML to implement static web pages K3
2 Apply Cascading style sheets to style HTML documents K3
3 Use Java Script to implement dynamic web pages K3

SYLLABUS
HTML Lists, Links and Images
a) Write a HTML program, to explain the working of lists.
Note: It should have an ordered list, unordered list, nested lists and ordered list in an
unordered list and definition lists.
b) Write a HTML program, to explain the working of hyperlinks using<a> tag and href, target
attributes.
1 c) Create a HTML document that has your image and your friend’s image with a specific
height and width. Also when clicked on the images it should navigate to their respective
profiles.
d) Write a HTML program, in such a way that, rather than placing large images on a page, the
preferred technique is to use thumbnails by setting the height and width parameters to
something like to 100*100 pixels. Each thumbnail image is also a link to a full sized
version of the image. Create an image gallery using this technique
HTML Tables and Forms
a) Write a HTML program, to explain the working of tables. (usetags: <table>, <tr>, <th>,
<td> and attributes: border, row span, col span)
b) Write a HTML program, to explain the working of tables by preparing a timetable. (Note:
2 Use <caption> tag to set the caption to the table & also use cellspacing, cellpadding,
border, rowspan, colspan etc.).
c) Write a HTML program, to explain the working of forms by designing Registration
form.(Note: Include text field, password field, number field, date of birth field, check
boxes, radio buttons, list boxes using <select>&<option> tags, <text area> and two buttons

Page 39 of 45
 ie: submit and reset. Use tables to provide a better view).
d) Write a HTML program, that makes use of <article>, <aside>, <figure>, <figcaption>,
<footer>, <header>, <main>, <nav>, <section>, <div>, <span>tags.
e) Write a HTML program, to embed audio and video into HTML webpage.
Cascading Style Sheets, Selector forms
Write a program to apply different types of selector forms
i. Simple selector (element, id, class, group, universal)
3 ii. Combinator selector (descendant, child, adjacent sibling, general sibling)
iii. Pseudo-class selector
iv. Pseudo-element selector
v. Attribute selector
Types of CSS, CSS with Color, Background, Font, Text and CSS Box Model
a) Write a program to apply different types (or levels of styles or style specification formats) -
inline, internal, external styles to HTML elements. (Identify selector, property and value).
b) Write a program to demonstrate the various ways you can reference a color in CSS.
c) Write a CSS rule that places a background image halfway down the page, tilting it
horizontally. The image should remain in place when the user scrolls up or down.
d) Write a program using the following terms related to CSS font and text:
i. font-size
ii. font-weight
4
iii. font-style
iv. text-decoration
v. text-transformation
vi. text-alignment
e) Write a program, to explain the importance of CSS Box model using
i. Content
ii. Border
iii. Margin
iv. padding
Applying JavaScript-internal and external, I/O, Type Conversion
a) Write a program to embed internal and external Java Script in a webpage.
5 b) Write a program to explain the different ways for taking input and displaying output.
c) Create a webpage which uses prompt dialogue box to ask a voter for his name and age.
Display the information in table format along with either the voter can vote or not
JavaScript Pre-defined and User-defined Objects
a) Write a program using document object properties and methods.
b) Write a program using window object properties and methods.
6 c) Write a program using math object properties and methods.
d) Write a program using string object properties and methods.
e) Write a program using regex object properties and methods.
f) Write a program using date object properties and methods.
JavaScript Conditional Statements and Loops
7
a) Write a program which asks the user to enter three integers, obtains the numbers from the

Page 40 of 45
 user and outputs HTML text that displays the larger number followed by the words
“LARGER NUMBER” in an information message dialog. If the numbers are equal, output
HTML text as “EQUAL NUMBERS”.
b) Write a program to display week days using switch case.
c) Write a program to print 1 to 10 numbers using for, while and do-while loops.
d) Write a program to print data in object using for-in, for-each and for-of loops.
e) Develop a program to determine whether a given number is an ‘ARMSTRONG
NUMBER’ or not. (Eg: 153 is an Armstrong number, since sum of the cube of the digits is
equal to the number i.e., 13+ 53+ 33=153).
f) Write a program to display the denomination of the amount deposited in the bank in terms
of 100’s, 50’s, 20’s, 10’s, 5’s, 2’s& 1’s. (Eg: If deposited amount is Rs.163, the output
should be 1-100’s, 1-50’s, 1- 10’s, 1-2’s & 1- 1’s)
Java Script Functions and Events
a) Design a HTML having a text box and four buttons named Factorial, Fibonacci, Prime, and
Palindrome. When a button is pressed an appropriate function should be called to display
i. Factorial of that number
ii. Fibonacci series up to that number
iii. Prime numbers up to that number
8
iv. Is it palindrome or not
b) Write a program to validate the following fields in a registration page
i. Name (start with alphabet and followed by alphanumeric and the length should not
be less than 6 characters)
ii. Mobile(onlynumbersandlength10digits)
iii. E-mail (should contain form at like [email protected])
9 Mini Project
Reference Books:
1 Programming the World Wide Web, 7th Edition, Robet W Sebesta, Pearson, 2013.
Web Programming with HTML5, CSS and JavaScript, John Dean, Jones& Bartlett Learning,
2
2019 (Chapters 1-11).
Pro MERN Stack: Full Stack Web App Development with Mongo, Express, React, and Node,
3
Vasan Subramanian, 2nd edition, APress, O’Reilly.
Web Links:
1 https://www.w3schools.com/html
2 https://www.w3schools.com/css
3 https://www.w3schools.com/js/

Page 41 of 45
Course Code Category L T P C C.I.E. S.E.E. Exam
B23CS2207 ES 1 -- 2 2 30 70 3 Hrs.

DESIGN THINKING & INNOVATION

(Common to all Programmes of Engineering)

Course Objectives:
1. Bring awareness on innovative design and new product development.
2. Explain the basics of design thinking.
3. Familiarize the role of reverse engineering in product development.
4. Train how to identify the needs of society and convert into demand.
5. Introduce product planning and product development process.

Course Outcomes: After completion of this course, students will be able to

Knowledge
S.No Outcome
Level
1. Define the concepts related to design thinking. K1
2. Explain the fundamentals of Design Thinking and innovation. K2
3. Apply the design thinking techniques for solving problems in various sectors. K3
4. Analyse to work in a multidisciplinary environment. K4
5. Evaluate the value of creativity. K5

SYLLABUS
Introduction to elements and principles of Design, basics of design-dot, line, shape, form as
UNIT-I
fundamental design components. Principles of design. Introduction to design thinking,
(10Hrs)
history of Design Thinking, New materials in Industry.

Design thinking process (empathize, analyze, idea & prototype), implementing the process
in driving inventions, design thinking in social innovations. Tools of design thinking -
UNIT-II person, costumer, journey map, brainstorming, product development.
(10 Hrs) Activity: Every student presents their idea in three minutes, Every student can present
design process in the form of flow diagram or flow chart etc. Every student should explain
about product development.

Art of innovation, Difference between innovation and creativity, role of creativity and
innovation in organizations. Creativity to Innovation. Teams for innovation, Measuring the
UNIT-III
impact and value of creativity.
(10 Hrs)
Activity: Debate on innovation and creativity, Flow and planning from idea to innovation,
Debate on value-based innovation.

Problem formation, introduction to product design, Product strategies, Product value,

UNIT-IV
Product planning, product specifications. Innovation towards product design Case studies.
(10 Hrs)
Activity: Importance of modeling, how to set specifications, Explaining their own product

Page 42 of 45
 design.

Design Thinking applied in Business & Strategic Innovation, Design Thinking principles
that redefine business – Business challenges: Growth, Predictability, Change, Maintaining
Relevance, Extreme competition, Standardization. Design thinking to meet corporate needs.
UNIT-V
Design thinking for Startups. Defining and testing Business Models and Business Cases.
(10 Hrs)
Developing & testing prototypes.
Activity: How to market our own product, about maintenance, Reliability and plan for
startup.

Textbooks:
1. Tim Brown, Change by design, 1/e, Harper Bollins, 2009.
2. Idris Mootee, Design Thinking for Strategic Innovation, 1/e, Adams Media, 2014.
Reference Books:
1. David Lee, Design Thinking in the Classroom, Ulysses press, 2018.
2. Shrrutin N Shetty, Design the Future, 1/e, Norton Press, 2018.
William lidwell, Kritinaholden, &Jill butter, Universal principles of design, 2/e, Rockport
3.
Publishers, 2010.
4. Chesbrough.H, The era of open innovation, 2003.

e-Resources:
1. https://nptel.ac.in/courses/110/106/110106124/
2. https://nptel.ac.in/courses/109/104/109104109/
3. https://swayam.gov.in/nd1_noc19_mg60/preview
4. https://onlinecourses.nptel.ac.in/noc22_de16/preview

Page 43 of 45
 Course Code Category L T P C C.I.E. S.E.E. Exam
B23MC2201 MC 2 -- -- -- 30 -- --

ENGLISH PROFICIENCY
(Common to CSE, CE, ECE, EEE, CIC, CSD).
Course Outcomes: After completion of this course, students will be able to
Knowledge
S No Outcome
Level
1. Interpret IELTS & TOEFL listening comprehension texts. K2
Demonstrate essential speaking skills in academic, professional, and real-life
2. K2
contexts.
3. Interpret the written discourse by applying effective reading strategies. K2
4. Construct coherent and cohesive paragraphs, e-mails, letters, and essays. K3

SYLLABUS
Listening Skills
UNIT-I Listening as a receptive skill
Listening skills for IELTS, TOEFL, Duolingo, PTE, and other competitive examinations.

Speaking Skills
JAM/ Extempore
UNIT-II
Debate / Group Discussion
Presentation Skills

Reading Skills
Types of Reading (Intensive and Extensive Reading, Skimming, Scanning)
UNIT-III
Reading/Summarizing News Paper Articles

Writing Skills
Essay Writing (Argumentative, Analytical and Descriptive essays for GRE, TOEFL &
IELTS)
UNIT-IV
E-Mail / Letter Writing
Resume
Writing

Integrated Language Skills

UNIT-V
Listening Skills for Speaking and Writing Reading Skills for Writing and Speaking

Text Books:
1. Interchange (5th edition) by Jack C.Richards, CUP, 2017.
Reference Books:

Page 44 of 45
 Fundamentals of Technical Communication (1st edition) by Meenakshi Raman, Sangeeta Sharma
1.
of OUP, 2014.
2. The Oxford Guide to Writing and Speaking (3rd edition) by John Seely OUP, 2013.
3. Effective Technical Communication (2nd edition) by M. Ashraf Rizwi. TataMcGrawhill, 2017.

e-Resources:
1 BBC Learning English - Learn English with BBC Learning English - Homepage
2 Grammar | Learn English (britishcouncil.org)
3 Duolingo English Test
4 IELTS Test Preparation Materials - Videos, Practice tests, Articles and More (idp.com)

Page 45 of 45