JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY KAKINADA

KAKINADA – 533 003, Andhra Pradesh, India

B.Tech CSBS (R23- IInd YEAR COURSE STRUCTURE & SYLLABUS)

B.Tech. – II Year I Semester

S.No. Category Title L T P Credits
1 BS & H Discrete Mathematics & 3 0 0 3
Graph Theory
2 BS & H Universal human values – 2 1 0 3
understanding harmony and
Ethical human conduct
3 Engineering Science Digital Logic & Computer 3 0 0 3
Organization
4 Professional Core Advanced Data Structures & 3 0 0 3
Algorithm Analysis
5 Professional Core Object Oriented 3 0 0 3
Programming Through Java
6 Professional Core Advanced Data Structures 0 0 3 1.5
and Algorithms Lab
7 Professional Core Object Oriented 0 0 3 1.5
Programming Through Java
Lab
8 Skill Enhancement Python programming 0 1 2 2
Course
9 Audit Course Fundamental of Economics 2 0 0 0

Total 16 2 8 20
 JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY KAKINADA
KAKINADA – 533 003, Andhra Pradesh, India
B.Tech CSBS (R23- IInd YEAR COURSE STRUCTURE & SYLLABUS)

B.Tech.– II Year II Semester

S.No. Category Title L T P Credits
1 Management Course- I Financial Management 2 0 0 2

2 Engineering Science/ Probability & Statistics 3 0 0 3

Basic Science
3 Professional Core Operating Systems 3 0 0 3

4 Professional Core Database Management 3 0 0 3

Systems
5 Professional Core Software Engineering 3 0 0 3

6 Professional Core Operating Systems & 0 0 3 1.5

Software Engineering Lab
7 Professional Core Database Management 0 0 3 1.5
Systems Lab
8 Skill Enhancement Full Stack development – 1 0 1 2 2
course
Design Thinking& 1 0 2 2
9 BS&H
Innovation
Total 15 1 10 21
Mandatory Community Service Project Internship of 08 weeks duration during summerVacation
 JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY KAKINADA
KAKINADA – 533 003, Andhra Pradesh, India
B.Tech CSBS (R23-COURSE STRUCTURE & SYLLABUS)

II Year I Semester L T P C
3 0 0 3
DISCRETE MATHEMATICS AND GRAPH THEORY
Course Objectives:
 To introduce the students to the topics and techniques of discrete methods and
combinatorial reasoning.
 To introduce a wide variety of applications. The algorithmic approach to the solution
of problems is fundamental in discrete mathematics, and this approach reinforces the
close ties between this discipline and the area of computer science.
Course Outcomes: At the end of the course students will be able to

1. Build skills in solving mathematical problems (L3)

2. Comprehend mathematical principles and logic (L4)
3. Demonstrate knowledge of mathematical modeling and proficiency in using
mathematical software (L6)
4. Manipulate and analyze data numerically and/or graphicallysing appropriate Software
(L3)
5. How to communicate effectively mathematical ideas/results verbally or in writing
(L1)

UNIT–I: Mathematical Logic:

Propositional Calculus: Statements and Notations, Connectives, Well Formed Formulas,
Truth Tables, Tautologies, Equivalence of Formulas, Duality Law, Tautological Implications,
Normal Forms, Theory of Inference for Statement Calculus, Consistency of Premises,
Indirect Method ofProof, Predicate Calculus: Predicates, Predicative Logic, Statement
Functions, Variables and Quantifiers, Free and Bound Variables, Inference Theory for
Predicate Calculus.
UNIT-II: Set Theory:

Sets: Operations on Sets, Principle of Inclusion-Exclusion, Relations: Properties, Operations,

Partition and Covering, Transitive Closure, Equivalence, Compatibility and Partial Ordering,
Hasse Diagrams, Functions: Bijective, Composition, Inverse, Permutation, and Recursive
Functions, Lattice and its Properties.

UNIT-III: Combinatorics and Recurrence Relations:

Basis of Counting, Permutations, Permutations withRepetitions, Circular and Restricted

Permutations, Combinations, RestrictedCombinations, 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
 JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY KAKINADA
KAKINADA – 533 003, Andhra Pradesh, India
B.Tech CSBS (R23-COURSE STRUCTURE & SYLLABUS)

UNIT-IV: Graph Theory:

Basic Concepts, Graph Theory and its Applications, Subgraphs, Graph Representations:
Adjacency and Incidence Matrices, Isomorphic Graphs, Paths and Circuits, Eulerian and
Hamiltonian Graphs,

Unit-V: Multi Graphs

Multigraphs, Bipartite and Planar Graphs, Euler’s Theorem, Graph Colouring and Covering,
Chromatic Number, Spanning Trees, Prim’s and Kruskal’s Algorithms, BFS and DFS
Spanning Trees.

TEXT BOOKS:
1. Discrete Mathematical Structures with Applications to Computer Science, J. P.
Tremblay and P. Manohar, Tata McGraw Hill.
2. Elements of Discrete Mathematics-A Computer Oriented Approach, C. L.Liu and D.
P. Mohapatra, 3rd Edition, Tata McGraw Hill.
3. Theory and Problems of Discrete Mathematics, Schaum’s Outline Series, Seymour
Lipschutz and Marc Lars Lipson, 3rd Edition, McGraw Hill.

REFERENCE BOOKS:
1. Discrete Mathematics for Computer Scientists and Mathematicians, J. L.Mott, A.
Kandel and T. P. Baker, 2nd Edition, Prentice Hall of India.
2. Discrete Mathematical Structures, Bernand Kolman, Robert C. Busby andSharon
Cutler Ross, PHI.
3. Discrete Mathematics, S. K. Chakraborthy and B.K. Sarkar, Oxford, 2011.
4. Discrete Mathematics and its Applications with Combinatorics and GraphTheory, K.
H. Rosen, 7th Edition, Tata McGraw Hill.

II Year I Semester L T P C
2 1 0 3

UNIVERSAL HUMAN VALUES – UNDERSTANDING HARMONY AND

 JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY KAKINADA
KAKINADA – 533 003, Andhra Pradesh, India
B.Tech CSBS (R23-COURSE STRUCTURE & SYLLABUS)

ETHICAL HUMAN CONDUCT

Course Objectives:
 To help the students appreciate the essential complementary between 'VALUES' and
'SKILLS' to ensure sustained happiness and prosperity which are the core aspirations
of all human beings.
 To facilitate the development of a Holistic perspective among students towards life
and profession as well as towards happiness and prosperity based on a correct
understanding of the Human reality and the rest of existence. Such holistic
perspective forms the basis of Universal Human Values and movement towards
value-based living in a natural way.
 To highlight plausible implications of such a Holistic understanding in terms of
ethical human conduct, trustful and mutually fulfilling human behaviour and mutually
enriching interaction with Nature.

Course Outcomes:
 Define the terms like Natural Acceptance, Happiness and Prosperity (L1, L2)
 Identify one’s self, and one’s surroundings (family, society nature) (L1, L2)
 Apply what they have learnt to their own self in different day-to-day settings in
real life (L3)
 Relate human values with human relationship and human society. (L4)
 Justify the need for universal human values and harmonious existence (L5)
 Develop as socially and ecologically responsible engineers (L3, L6)

Course Topics
The course has 28 lectures and 14 tutorials in 5 modules. The lectures and tutorials are of 1-
hour duration. Tutorial sessions are to be used to explore and practice what has been
proposed during the lecture sessions.
The Teacher’s Manual provides the outline for lectures as well as practice sessions. The
teacher is expected to present the issues to be discussed as propositions and encourage the
students to have a dialogue.

UNIT I Introduction to Value Education (6 lectures and 3 tutorials for practice

session)
Lecture 1: Right Understanding, Relationship and Physical Facility (Holistic
Development and the Role of Education)
Lecture 2: Understanding Value Education
Tutorial 1: Practice Session PS1 Sharing about Oneself
Lecture 3: self-exploration as the Process for Value Education
Lecture4: Continuous Happiness and Prosperity – the Basic Human
Aspirations
Tutorial 2: Practice Session PS2 Exploring Human Consciousness
Lecture 5: Happiness and Prosperity – Current Scenario
Lecture 6: Method to Fulfill the Basic Human Aspirations
Tutorial 3: Practice Session PS3 Exploring Natural Acceptance
 JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY KAKINADA
KAKINADA – 533 003, Andhra Pradesh, India
B.Tech CSBS (R23-COURSE STRUCTURE & SYLLABUS)

UNIT II Harmony in the Human Being (6 lectures and 3 tutorials for practice session)
Lecture 7: Understanding Human being as the Co-existence of the self and the
body.
Lecture 8: Distinguishing between the Needs of the self and the body
Tutorial 4: Practice Session PS4 Exploring the difference of Needs of self and
body.
Lecture 9: The body as an Instrument of the self
Lecture 10: Understanding Harmony in the self
Tutorial 5: Practice Session PS5 Exploring Sources of Imagination in the self
Lecture 11: Harmony of the self with the body
Lecture 12: Programme to ensure self-regulation and Health
Tutorial 6: Practice Session PS6 Exploring Harmony of self with the body

UNIT III Harmony in the Family and Society (6 lectures and 3 tutorials for practice
session)
Lecture 13: Harmony in the Family – the Basic Unit of Human Interaction
Lecture 14: 'Trust' – the Foundational Value in Relationship
Tutorial 7: Practice Session PS7 Exploring the Feeling of Trust
Lecture 15: 'Respect' – as the Right Evaluation
Tutorial 8: Practice Session PS8 Exploring the Feeling of Respect
Lecture 16: Other Feelings, Justice in Human-to-Human Relationship
Lecture 17: Understanding Harmony in the Society
Lecture 18: Vision for the Universal Human Order
Tutorial 9: Practice Session PS9 Exploring Systems to fulfil Human Goal

UNIT IV Harmony in the Nature/Existence (4 lectures and 2 tutorials for practice

session)
Lecture 19: Understanding Harmony in the Nature
Lecture 20: Interconnectedness, self-regulation and Mutual Fulfilment among
the Four Orders of Nature
Tutorial 10: Practice Session PS10 Exploring the Four Orders of Nature
Lecture 21: Realizing Existence as Co-existence at All Levels
Lecture 22: The Holistic Perception of Harmony in Existence
Tutorial 11: Practice Session PS11 Exploring Co-existence in Existence.

UNIT V Implications of the Holistic Understanding – a Look at Professional Ethics (6

lectures and 3 tutorials for practice session)
Lecture 23: Natural Acceptance of Human Values
Lecture 24: Definitiveness of (Ethical) Human Conduct
Tutorial 12: Practice Session PS12 Exploring Ethical Human Conduct
Lecture 25: A Basis for Humanistic Education, Humanistic Constitution and
Universal Human Order
Lecture 26: Competence in Professional Ethics
Tutorial 13: Practice Session PS13 Exploring Humanistic Models in Education
Lecture 27: Holistic Technologies, Production Systems and Management
Models-Typical Case Studies
Lecture 28: Strategies for Transition towards Value-based Life and Profession
Tutorial 14: Practice Session PS14 Exploring Steps of Transition towards
Universal Human Order
 JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY KAKINADA
KAKINADA – 533 003, Andhra Pradesh, India
B.Tech CSBS (R23-COURSE STRUCTURE & SYLLABUS)

Practice Sessions for UNIT I – Introduction to Value Education

PS1 Sharing about Oneself
PS2 Exploring Human Consciousness
PS3 Exploring Natural Acceptance

Practice Sessions for UNIT II – Harmony in the Human Being

PS4 Exploring the difference of Needs of self and body
PS5 Exploring Sources of Imagination in the self
PS6 Exploring Harmony of self with the body

Practice Sessions for UNIT III – Harmony in the Family and Society
PS7 Exploring the Feeling of Trust
PS8 Exploring the Feeling of Respect
PS9 Exploring Systems to fulfil Human Goal

Practice Sessions for UNIT IV – Harmony in the Nature (Existence)

PS10 Exploring the Four Orders of Nature
PS11 Exploring Co-existence in Existence

Practice Sessions for UNIT V – Implications of the Holistic Understanding – a Look at

Professional Ethics
PS12 Exploring Ethical Human Conduct
PS13 Exploring Humanistic Models in Education
PS14 Exploring Steps of Transition towards Universal Human Order

READINGS:
Textbook and Teachers Manual
a. The Textbook
R R Gaur, R Asthana, G P Bagaria, A Foundation Course in Human Values and Professional
Ethics, 2nd Revised Edition, Excel Books, New Delhi, 2019. ISBN 978-93-87034-47-1
b. The Teacher’s Manual
R R Gaur, R Asthana, G P Bagaria,Teachers’ Manual for A Foundation Course in Human
Values and Professional Ethics, 2nd Revised Edition, Excel Books, New Delhi, 2019. ISBN
978-93-87034-53-2

Reference Books
1. JeevanVidya: EkParichaya, A Nagaraj, JeevanVidyaPrakashan, Amarkantak, 1999.
2. Human Values, A.N. Tripathi, New Age Intl. Publishers, New Delhi, 2004.
3. The Story of Stuff (Book).
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 – PanditSunderlal
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)
 JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY KAKINADA
KAKINADA – 533 003, Andhra Pradesh, India
B.Tech CSBS (R23-COURSE STRUCTURE & SYLLABUS)

13. Gandhi - Romain Rolland (English)

Mode of Conduct:
Lecture hours are to be used for interactive discussion, placing the proposals about the topics
at hand and motivating students to reflect, explore and verify them.
Tutorial hours are to be used for practice sessions.
While analyzing and discussing the topic, the faculty mentor’s role is in pointing to essential
elements to help in sorting them out from the surface elements. In other words, help the
students explore the important or critical elements.
In the discussions, particularly during practice sessions (tutorials), the mentor encourages the
student to connect with one’s own self and do self-observation, self-reflection and self-
exploration.

Scenarios may be used to initiate discussion. The student is encouraged to take up ”ordinary”
situations rather than” extra-ordinary” situations. Such observations and their analyses are
shared and discussed with other students and faculty mentor, in a group sitting.

Tutorials (experiments or practical) are important for the course. The difference is that the
laboratory is everyday life, and practical are how you behave and work in real life.
Depending on the nature of topics, worksheets, home assignment and/or activity are included.
The practice sessions (tutorials) would also provide support to a student in performing actions
commensurate to his/her beliefs. It is intended that this would lead to development of
commitment, namely behaving and working based on basic human values.
It is recommended that this content be placed before the student as it is, in the form of a basic
foundation course, without including anything else or excluding any part of this content.
Additional content may be offered in separate, higher courses. This course is to be taught by
faculty from every teaching department, not exclusively by any one department.
Teacher preparation with a minimum exposure to at least one 8-day Faculty Development
Program on Universal Human Values is deemed essential.

Online Resources:
1. https://fdp-si.aicte-india.org/UHV-
II%20Class%20Notes%20&%20Handouts/UHV%20Handout%201-
Introduction%20to%20Value%20Education.pdf

2. https://fdp-si.aicte-india.org/UHV-
II%20Class%20Notes%20&%20Handouts/UHV%20Handout%202-
Harmony%20in%20the%20Human%20Being.pdf
3. https://fdp-si.aicte-india.org/UHV-
II%20Class%20Notes%20&%20Handouts/UHV%20Handout%203-
Harmony%20in%20the%20Family.pdf
4. https://fdp-si.aicte-india.org/UHV%201%20Teaching%20Material/D3-
S2%20Respect%20July%2023.pdf
5. https://fdp-si.aicte-india.org/UHV-
II%20Class%20Notes%20&%20Handouts/UHV%20Handout%205-
Harmony%20in%20the%20Nature%20and%20Existence.pdf
 JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY KAKINADA
KAKINADA – 533 003, Andhra Pradesh, India
B.Tech CSBS (R23-COURSE STRUCTURE & SYLLABUS)

6. https://fdp-si.aicte-india.org/download/FDPTeachingMaterial/3-days%20FDP-
SI%20UHV%20Teaching%20Material/Day%203%20Handouts/UHV%203D%20D3-
S2A%20Und%20Nature-Existence.pdf
7. https://fdp-si.aicte-
india.org/UHV%20II%20Teaching%20Material/UHV%20II%20Lecture%2023-
25%20Ethics%20v1.pdf
8. https://www.studocu.com/in/document/kiet-group-of-institutions/universal-human-
values/chapter-5-holistic-understanding-of-harmony-on-professional-ethics/62490385
9. https://onlinecourses.swayam2.ac.in/aic22_ge23/preview
 JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY KAKINADA
KAKINADA – 533 003, Andhra Pradesh, India
B.Tech CSBS (R23-COURSE STRUCTURE & SYLLABUS)

L T P C
II Year I Semester 3 0 0 3

DIGITAL LOGIC & COMPUTERORGANIZATION

Course Objectives:

The main objectives of the course is to

• provide students with a comprehensive understanding of digital logic
design
principles and computer organization fundamentals
• Describe memory hierarchy concepts
• Explain input/output (I/O) systems and their interaction with theCPU,
memory, and peripheral devices

UNIT – I
Data Representation: Binary Numbers, Fixed Point Representation. Floating
Point Representation. Number base conversions, Octal and Hexadecimal
Numbers, components, Signed binary numbers, Binary codes Digital Logic
Circuits-I: Basic Logic Functions, Logic gates, universal logic gates,
Minimization of Logic expressions. K-Map Simplification, Combinational
Circuits, Decoders, Multiplexers

UNIT – II
Digital Logic Circuits-II: Sequential Circuits, Flip-Flops, Binary counters,
Registers, Shift Registers, Ripple counters Basic Structure of Computers:
Computer Types, Functional units, Basic operational concepts, Bus structures,
Software, Performance, multiprocessors and multi computers, Computer
Generations, Von- Neumann Architecture

UNIT – III
Computer Arithmetic: Addition and Subtraction of Signed Numbers, Design of
Fast Adders, Multiplication of Positive Numbers, Signed-operand Multiplication,
Fast Multiplication, Integer Division, Floating-Point Numbers and Operations
Processor Organization: Fundamental Concepts, Execution of a Complete
Instruction, Multiple-Bus Organization, Hardwired Control and Multi
programmed Control

UNIT – IV
The Memory Organization: Basic Concepts, Semiconductor RAM Memories,
Read-Only Memories, Speed, Size and Cost, Cache Memories, Performance
Considerations, Virtual Memories, Memory Management Requirements,
Secondary Storage
 JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY KAKINADA
KAKINADA – 533 003, Andhra Pradesh, India
B.Tech CSBS (R23-COURSE STRUCTURE & SYLLABUS)

UNIT – V
Input / Output Organization: Accessing I/O Devices, Interrupts, Processor
Examples, Direct Memory Access, Buses, Interface Circuits, Standard I/O
Interfaces

Text books:
1. Computer Organization, Carl Hamacher, Zvonko Vranesic, Safwat Zaky,
6th edition, McGraw Hill
2. Digital Design, 6th Edition, M. Morris Mano, Pearson Education.
3. Computer Organization and Architecture, William Stallings, 11thEdition,
Pearson.

Reference Books:
1. Computer Systems Architecture, M.Moris Mano, 3rdEdition, Pearson
2. Computer Organization and Design, David A. Paterson, John L. Hennessy,
Elsevier
3. Fundamentals of Logic Design, Roth, 5thEdition, Thomson

Online Learning Resources:

1. https://nptel.ac.in/courses/106/103/106103068/
 JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY KAKINADA
KAKINADA – 533 003, Andhra Pradesh, India
B.Tech CSBS (R23-COURSE STRUCTURE & SYLLABUS)

L T P C
II Year I Semester 3 0 0 3

ADVANCED DATA STRUCTURES& ALGORITHM ANALYSIS

Course Objectives:
The main objectives of the course is to
 Provide knowledge on advance data structures
frequently used inComputer Science domain
 Develop skills in algorithm design techniques popularly used
 Understand the use of various data structures in the algorithm
design

UNIT – I:
Introduction to Algorithm Analysis, Space and Time Complexity analysis,
Asymptotic Notations. AVL Trees – Creation, Insertion, Deletion
operations and Applications. B. Trees – Creation, Insertion, Deletion
operations and Applications

UNIT – II:
Heap Trees (Priority Queues) – Min and Max Heaps, Operations and
Applications. Graphs – Terminology, Representations, Basic Search and
Traversals, Connected Components and Biconnected Components,
applications. Divide and Conquer: The General Method, Quick Sort,
Merge Sort, Strassen’s matrix multiplication, Convex Hull

UNIT – III:
Greedy Method: General Method, Job Sequencing with deadlines, Knapsack
Problem, Minimum cost spanning trees, Single Source Shortest Paths
Dynamic Programming: General Method, All pairs shortest paths, Single
Source Shortest Paths– General Weights (Bellman Ford Algorithm), Optimal
Binary Search Trees, 0/1 Knapsack, String Editing, Travelling Salesperson
problem

UNIT – IV:
Backtracking: General Method, 8-Queens Problem, Sum of Subsets
problem, Graph Coloring, 0/1 Knapsack Problem.
Branch and Bound: The General Method, 0/1 Knapsack Problem,
Travelling Salesperson problem
 JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY KAKINADA
KAKINADA – 533 003, Andhra Pradesh, India
B.Tech CSBS (R23-COURSE STRUCTURE & SYLLABUS)
UNIT – V:
NP Hard and NP Complete Problems: Basic Concepts, Cook’s theorem.
NP Hard Graph Problems: Clique Decision Problem (CDP), Chromatic
Number Decision Problem (CNDP), Traveling Salesperson Decision
Problem (TSP). NP Hard Scheduling Problems: Scheduling Identical
Processors, Job Shop Scheduling

Textbooks:
1. Fundamentals of Data Structures in C++, Horowitz, lis;
Sahni,Sartaj; Mehta, Dinesh, 2nd Edition Universities
Press
2. Computer Algorithms in C++, Ellis Horowitz, Sartaj Sahni,
nd
Sanguthevar Rajasekaran, 2 Edition University Press

Reference Books:
1. Data Structures and program design in C, Robert Kruse,
PearsonEducation Asia
2. An introduction to Data Structures with
applications,Trembley &Sorenson, McGraw Hill
3. The Art of Computer Programming, Vol.1: Fundamental
Algorithms,Donald E Knuth, Addison-Wesley, 1997.
4. Data Structures using C & C++: Langsam, Augenstein &
Tanenbaum,Pearson, 1995
5. Algorithms + Data Structures & Programs:, N.Wirth, PHI
6. Fundamentals of Data Structures in C++: Horowitz Sahni
&Mehta,Galgottia Pub.
7. Data structures in Java:, Thomas Standish, Pearson Education Asia

Online Learning Resources:

https://www.tutorialspoint.com/advanced_data_structures/index.asp
http://peterindia.net/Algorithms.html
 JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY KAKINADA
KAKINADA – 533 003, Andhra Pradesh, India
B.Tech CSBS (R23-COURSE STRUCTURE & SYLLABUS)
II Year I Semester L T P C
3 0 0 3

OBJECT ORIENTED PROGRAMMING THROUGH JAVA

Course Objectives:
The learning objectives of this course are to:
 identify Java language components and how they work together in applications
 learn the fundamentals of object-oriented programming in Java,
including definingclasses, invoking methods, using class libraries.
 learn how to extend Java classes with inheritance and dynamic binding and
how to useexception handling in Java applications
 understand how to design applications with threads in Java
 understand how to use Java APIs for program development

UNIT I
Object Oriented Programming: Basic concepts, Principles, Program Structure in
Java: Introduction, Writing Simple Java Programs, Elements or Tokens in Java
Programs, Java Statements, Command Line Arguments, User Input to Programs,
Escape Sequences Comments,Programming Style.
Data Types, Variables, and Operators :Introduction, Data Types in Java,
Declaration of Variables, Data Types, Type Casting, Scope of Variable Identifier,
Literal Constants, Symbolic Constants, Formatted Output with printf() Method,
Static Variables and Methods, Attribute Final, Introduction to Operators,
Precedence and Associativity of Operators, Assignment Operator ( = ), Basic
Arithmetic Operators, Increment (++) and Decrement (- -) Operators, Ternary
Operator, Relational Operators, Boolean Logical Operators, Bitwise Logical
Operators.

Control Statements: Introduction, if Expression, Nested if Expressions, if–else

Expressions, Ternary Operator ?:, Switch Statement, Iteration Statements, while
Expression, do–while Loop, for Loop, Nested for Loop, For–Each for Loop, Break
Statement, Continue Statement.

UNIT II
Classes and Objects: Introduction, Class Declaration and Modifiers, Class
Members, Declaration of Class Objects, Assigning One Object to Another, Access
Control for Class Members, Accessing Private Members of Class, Constructor
Methods for Class, Overloaded Constructor Methods, Nested Classes, Final Class
and Methods, Passing Arguments by Valueand by Reference, Keyword this.
Methods: Introduction, Defining Methods, Overloaded Methods, Overloaded
Constructor Methods, Class Objects as Parameters in Methods, Access Control,
 JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY KAKINADA
KAKINADA – 533 003, Andhra Pradesh, India
B.Tech CSBS (R23-COURSE STRUCTURE & SYLLABUS)
Recursive Methods, Nesting of Methods, Overriding Methods, Attributes Final and
Static.

UNIT III
Arrays: Introduction, Declaration and Initialization of Arrays, Storage of Array in
Computer Memory, Accessing Elements of Arrays, Operations on Array Elements,
Assigning Array to Another Array, Dynamic Change of Array Size, Sorting of
Arrays, Search for Values in Arrays, Class Arrays, Two-dimensional Arrays, Arrays
of Varying Lengths, Three-dimensional Arrays, Arrays as Vectors.
Inheritance: Introduction, Process of Inheritance, Types of Inheritances, Universal
Super Class-Object Class, Inhibiting Inheritance of Class Using Final, Access
Control and Inheritance, Multilevel Inheritance, Application of Keyword Super,
Constructor Method and Inheritance, Method Overriding, Dynamic Method
Dispatch, Abstract Classes, Interfaces and Inheritance.
Interfaces: Introduction, Declaration of Interface, Implementation of Interface,
Multiple Interfaces, Nested Interfaces, Inheritance of Interfaces, Default Methods in
Interfaces, Static Methods in Interface, Functional Interfaces, Annotations.

UNIT IV
Packages and Java Library: Introduction, Defining Package, Importing Packages
and Classes into Programs, Path and Class Path, Access Control, Packages in Java
SE, Java.lang Package and its Classes, Class Object, Enumeration, class Math,
Wrapper Classes, Auto-boxing and Auto-unboxing, Java util Classes and Interfaces,
Formatter Class, Random Class, Time Package, Class Instant (java.time.Instant),
Formatting for Date/Time in Java, Temporal Adjusters Class, Temporal Adjusters
Class.
Exception Handling: Introduction, Hierarchy of Standard Exception Classes,
Keywords throws and throw, try, catch, and finally Blocks, Multiple Catch Clauses,
Class Throwable, Unchecked Exceptions, Checked Exceptions.
Java I/O and File: Java I/O API, standard I/O streams, types, Byte streams,
Character streams,Scanner class, Files in Java (Text Book 2)

UNIT V
String Handling in Java: Introduction, Interface Char Sequence, Class String,
Methods for Extracting Characters from Strings, Comparison, Modifying, Searching;
Class String Buffer. Multithreaded Programming: Introduction, Need for Multiple
Threads Multithreaded Programming for Multi-core Processor, Thread Class, Main
Thread- Creation of New Threads, Thread States, Thread Priority-Synchronization,
Deadlock and Race Situations, Inter-thread Communication - Suspending, Resuming,
and Stopping of Threads.
Java Database Connectivity: Introduction, JDBC Architecture, Installing MySQL
and MySQL Connector/J, JDBC Environment Setup, Establishing JDBC Database
 JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY KAKINADA
KAKINADA – 533 003, Andhra Pradesh, India
B.Tech CSBS (R23-COURSE STRUCTURE & SYLLABUS)
Connections, ResultSet Interface
Java FX GUI: Java FX Scene Builder, Java FX App Window Structure, displaying
text and image, event handling, laying out nodes in scene graph, mouse events
(Text Book 3)

Text Books:
1) JAVA one step ahead, Anitha Seth, B.L.Juneja, Oxford.
2) Joy with JAVA, Fundamentals of Object Oriented Programming, Debasis
Samanta,Monalisa Sarma, Cambridge, 2023.
3) JAVA 9 for Programmers, Paul Deitel, Harvey Deitel, 4th Edition, Pearson.

References Books:
1) The complete Reference Java, 11th edition, Herbert Schildt, TMH
2) Introduction to Java programming, 7th Edition, Y Daniel Liang, Pearson

Online Resources:
1) https://nptel.ac.in/courses/106/105/106105191/
2)https://infyspringboard.onwingspan.com/web/en/app/toc/lex_auth_01288046454761
8816347_shared/overview
 JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY KAKINADA
KAKINADA – 533 003, Andhra Pradesh, India
B.Tech CSBS (R23-COURSE STRUCTURE & SYLLABUS)

II Year I Semester L T P C
0 0 3 1.5
ADVANCED DATA STRUCTURES &ALGORITHM ANALYSIS LAB
Course Objectives:
The objectives of the course is to
 acquire practical skills in constructing and managing Data structures
 apply the popular algorithm design methods in problem-solving scenarios

Experiments covering the Topics:

 Operations on AVL trees, B-Trees, Heap Trees
 Graph Traversals
 Sorting techniques
 Minimum cost spanning trees
 Shortest path algorithms
 0/1 Knapsack Problem
 Travelling Salesperson problem
 Optimal Binary Search Trees
 N-Queens Problem
 Job Sequencing
Experiments:
1. Construct an AVL tree for a given set of elements which are stored in a
file. And implement insert and delete operation on the constructed tree.
Write contents of treeinto a new file using in-order.
2. Construct B-Tree an order of 5 with a set of 100 random elements
stored in array. Implement searching, insertion and deletion operations.
3. Construct Min and Max Heap using arrays, delete any element and display
the contentof the Heap.
4. Implement BFT and DFT for given graph, when graph is represented by
a) Adjacency Matrix b) Adjacency Lists
5. Write a program for finding the biconnected components in a given graph.
6. Implement Quick sort and Merge sort and observe the execution time for
various inputsizes (Average, Worst and Best cases).
7. Compare the performance of Single Source Shortest Paths using Greedy
method whenthe graph is represented by adjacency matrix and adjacency
lists.
8. Implement Job Sequencing with deadlines using Greedy strategy.
9. Write a program to solve 0/1 Knapsack problem Using Dynamic Programming.
10. Implement N-Queens Problem Using Backtracking.
11. Use Backtracking strategy to solve 0/1 Knapsack problem.
12. Implement Travelling Sales Person problem using Branch and Bound approach.
JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY KAKINADA
KAKINADA – 533 003, Andhra Pradesh, India
B.Tech CSBS (R23-COURSE STRUCTURE & SYLLABUS)
Reference Books:
1. Fundamentals of Data Structures in C++, Horowitz Ellis, Sahni Sartaj,
Mehta, Dinesh, 2nd Edition, Universities Press
2. Computer Algorithms/C++ Ellis Horowitz, Sartaj Sahni, Sanguthevar
Rajasekaran, 2ndEdition, University Press
3. Data Structures and program design in C, Robert Kruse, Pearson Education Asia
4. An introduction to Data Structures with applications, Trembley & Sorenson,
McGrawHill

Online Learning Resources:

1. http://cse01-iiith.vlabs.ac.in/
2. http://peterindia.net/Algorithms.html
 JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY KAKINADA
KAKINADA – 533 003, Andhra Pradesh, India
B.Tech CSBS (R23-COURSE STRUCTURE & SYLLABUS)

II Year I Semester L T P C
0 0 3 1.5

OBJECT ORIENTED PROGRAMMINGTHROUGH JAVA LAB

Course Objectives:
The aim of this course is to
 Practice object oriented programming in the Java programming language
 implement Classes, Objects, Methods, Inheritance, Exception, Runtime
Polymorphism, User defined Exception handling mechanism
 Illustrate inheritance, Exception handling mechanism, JDBC connectivity
 Construct Threads, Event Handling, implement packages, Java FX GUI

Experiments covering the Topics:

 Object Oriented Programming fundamentals- data types, control structures
 Classes, methods, objects, Inheritance, polymorphism,
 Exception handling, Threads, Packages, Interfaces
 Files, I/O streams, JavaFX GUI

Experiments:
Exercise – 1:
a) Write a JAVA program to display default value of all primitive data type of JAVA
b) Write a java program that display the roots of a quadratic equation ax2+bx=0.
Calculate thediscriminate D and basing on value of D, describe the nature of root.

Exercise - 2
a) Write a JAVA program to search for an element in a given list of elements
using binarysearch mechanism.
b) Write a JAVA program to sort for an element in a given list of elements using bubble
sort
c) Write a JAVA program using StringBuffer to delete, remove character.

Exercise - 3
a) Write a JAVA program to implement class mechanism. Create a class, methods
and invokethem inside main method.
b) Write a JAVA program implement method overloading.
c) Write a JAVA program to implement constructor.
d) Write a JAVA program to implement constructor overloading.
 JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY KAKINADA
KAKINADA – 533 003, Andhra Pradesh, India
B.Tech CSBS (R23-COURSE STRUCTURE & SYLLABUS)
Exercise - 4
a) Write a JAVA program to implement Single Inheritance
b) Write a JAVA program to implement multi level Inheritance
c) Write a JAVA program for abstract class to find areas of different shapes

Exercise - 5
a) Write a JAVA program give example for “super” keyword.
b) Write a JAVA program to implement Interface. What kind of Inheritance can be
achieved?
c) Write a JAVA program that implements Runtime polymorphism

Exercise - 6
a) Write a JAVA program that describes exception handling mechanism
b) Write a JAVA program Illustrating Multiple catch clauses
c) Write a JAVA program for creation of Java Built-in Exceptions
d) Write a JAVA program for creation of User Defined Exception

Exercise - 7
a) 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, (Repeat the
same by implementing Runnable)
b) Write a program illustrating is Alive and join ()
c) Write a Program illustrating Daemon Threads.
d) Write a JAVA program Producer Consumer Problem

Exercise – 8
a) Write a JAVA program that import and use the user defined packages
b) Without writing any code, build a GUI that display text in label and image in an
ImageView (use Java FX)
c) Build a Tip Calculator app using several Java FX components and learn how to
respond touser interactions with the GUI
 JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY KAKINADA
KAKINADA – 533 003, Andhra Pradesh, India
B.Tech CSBS (R23-COURSE STRUCTURE & SYLLABUS)

II Year I Semester L T P C
0 1 2 2
PYTHON PROGRAMMING
(Skill Enhancement Course)
Course Objectives:
The main objectives of the course are to
• Introduce core programming concepts of Python programming language.
• Demonstrate about Python data structures like Lists, Tuples, Sets and
dictionaries
• Implement Functions, Modules and Regular Expressions in Python
Programming andto create practical and contemporary applications using
these

UNTI-I:
History of Python Programming Language, Thrust Areas of Python, Installing
Anaconda Python Distribution, 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, the type ()
Function and Is Operator, Dynamicand 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, Catching
Exceptions Using try and except Statement.

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
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
6. Write a program to print multiplication table of a given number.

UNIT-II:
Functions: 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.
 JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY KAKINADA
KAKINADA – 533 003, Andhra Pradesh, India
B.Tech CSBS (R23-COURSE STRUCTURE & SYLLABUS)

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.

Experiments:
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.

UNIT-III:
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.

Experiments:
1. Write a program to create tuples (name, age, address, college) for at least
two membersand 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.
UNIT-IV:
Files: Types of Files, Creating and Reading Text Data, File Methods to Read and
Write Data, Reading and Writing Binary Files, Pickle Module, Reading and Writing
CSV Files, Python osand os.path Modules.

Object-Oriented Programming: Classes and Objects, Creating Classes in Python,

 JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY KAKINADA
KAKINADA – 533 003, Andhra Pradesh, India
B.Tech CSBS (R23-COURSE STRUCTURE & SYLLABUS)
Creating Objects in Python, Constructor Method, Classes with Multiple Objects,
Class Attributes Vs Data Attributes, Encapsulation, Inheritance, Polymorphism.
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.
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 inthe 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.
UNIT-V:
Introduction to Data Science: Functional Programming, JSON and XML in Python,
NumPy with Python, Pandas.

Experiments:
1. Python program to check whether a JSON string contains complex object or not.
2. Python Program to demonstrate NumPy arrays creation using array () function.
3. Python program to demonstrate use of ndim, shape, size, dtype.
4. Python program to demonstrate basic slicing, integer and Boolean indexing.
5. Python program to find min, max, sum, cumulative sum of array
6. Create a dictionary with at least five keys and each key represent value as a
list where this list contains at least ten values and convert this dictionary as
a pandas data frame and explore the data through the data frame as follows:
a) Apply head () function to the pandas data frame
b) Perform various data selection operations on Data Frame
7. Select any two columns from the above data frame, and observe the change
in one attribute with respect to other attribute with scatter and plot
operations in matplotlib
Reference Books:
1. Gowri shankar S, Veena A., Introduction to Python Programming, CRC Press.
2. Python Programming, S Sridhar, J Indumathi, V M Hariharan, 2nd Edition,
Pearson,2024
3. Introduction to Programming Using Python, Y. Daniel Liang, Pearson.
Online Learning Resources/Virtual Labs:
1. https://www.coursera.org/learn/python-for-applied-data-science-ai
2. https://www.coursera.org/learn/python?specialization=python#syllabus
 JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY KAKINADA
KAKINADA – 533 003, Andhra Pradesh, India
B.Tech CSBS (R23-COURSE STRUCTURE & SYLLABUS)
II Year I Semester L T P C
2 0 0 0
FUNDAMENTAL OF ECONOMICS
Objectives:
 To gain basic knowledge in Economics and understand the concept of management at
the macro and micro level.
 Understand the basic concepts of economics at the macro and micro level.
 Conceptualize the basic principles of management.

UNIT I :
Periods Fundamentals of Economics: Wealth, Welfare and Scarce Definitions of
Economics; Micro and Macro Economics; Demand- Law of Demand, Elasticity of Demand,
Types of Elasticity and Factors determining price elasticity of Demand - Law of Diminishing
Marginal Utility.

UNIT II
Periods Forms of Business Organizations: Features, merits and demerits of Sole
Proprietorship, Partnership and Joint Stock Company- Public Enterprises and their types.

UNIT III
Periods Introduction to Management: Functions of Management- Taylor’s Scientific
Management; Henry Fayol’s Principles of Management; Human Resource Management –
Basic functions of Human Resource Management (in brief). Production Management:
Production Planning and Control, Plant Location, Break-Even Analysis- Assumptions,
limitations and applications.

UNIT IV
Periods Financial Management: Types of Capital: Fixed and Working Capital and Methods
of Raising Finance; Final Accounts- Trading Account, Statement of Profit and Loss and
Balance Sheet (simple problems)

UNIT V
Periods Marketing Management and Entrepreneurship: Marketing Management:
Functions of marketing and Distribution Channels. Entrepreneurship: Definition,
Characteristics and Functions of an Entrepreneuship

TEXT BOOKS
1. .S.N.Maheswari, SK Maheswari, Financial Accounting Fifth Edition, Vikas
Publishing House Pvt. Ltd., New Delhi, 2012
2. S.C. Sharma and Banga T. R., Industrial Organization & Engineering Economics,
khanna Publications, Delhi-6, 2006
3. .A.R.AryaSri, Managerial Economics and Financial Analysis, TMH Publications, new
Delhi, 2014
 JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY KAKINADA
KAKINADA – 533 003, Andhra Pradesh, India
B.Tech CSBS (R23-COURSE STRUCTURE & SYLLABUS)

II Year II Semester L T P C
2 0 0 2
FINANCIAL MANAGEMENT
Course Outcomes:
Students will be able to

 Understand the fundamental concepts of financial management

 Appreciate basic concepts such as time value of money, cost of
capital, risk andreturn, working capital management, capital
budgeting etc.
 Leverage the concept for deciding financial angle of IT projects

UNIT - I
Introduction : Introduction to Financial Management - Goals of the firm -
Financial Environments. Time Value of Money : Simple and Compound Interest
Rates, Amortization, Com puting more that once a year, Annuity Factor.

UNIT - II
Valuation of Securities : Bond Valuation, Preferred Stock Valuation , Common
Stock Valuation, Concept of Yield and YTM. Risk & Return: Defining Risk and
Return, Using Probability Distributions to Measure Risk, Attitudes Toward Risk,
Risk and Return in a Portfolio Context, Diversification, The Capital Asset Pricing
Model (CAPM)

UNIT - III
Operating & Financial Leverage: Operating Leverage, Financial Leverage, Total
Leverage, Indifference Analysis in leverage study. Cost of Capital : Concept ,
Computation of Specific Cost of Capital for Equity - Preference – Debt, Weighted
Average Cost of Capital – Factors affecting Cost of Capital 4L.
UNIT-IV
Capital Budgeting : The Capital Budgeting Concept & Process - An Overview,
Generating Investment Project Proposals, Estimating Project, After Tax Incremental
Operating Cash Flows, Capital Budgeting Techniques, Project Evaluation and
Selection – Alternative Methods Working Capital Management: Overview,
Working Capital Issues, Financing Current Assets (Short Term and Long Term-
Mix), Combining Liability Structures and Current Asset Decisions, Estimation of
Working Capital.
 JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY KAKINADA
KAKINADA – 533 003, Andhra Pradesh, India
B.Tech CSBS (R23-COURSE STRUCTURE & SYLLABUS)
UNIT – V
Cash Management: Motives for Holding cash, Speeding Up Cash Receipts,
Slowing Down Cash Payouts, Electronic Commerce, Outsourcing, Cash Balances
to maintain, Factoring. Accounts Receivable Management: Credit & Collection
Policies, Analyzing the Credit Applicant, Credit References, Selecting optimum
Credit period. 4L

Text Book
1. Chandra, Prasanna - Financial Management - Theory & Practice, Tata McGraw
Hill.

References Books :
1. Srivastava, Misra: Financial Management, OUP
2. Van Horne and Wachowicz : Fundamentals of Financial Management,
Prentice Hall/Pearson Education.
 JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY KAKINADA
KAKINADA – 533 003, Andhra Pradesh, India
B.Tech CSBS (R23-COURSE STRUCTURE & SYLLABUS)

II Year II Semester L T P C
3 0 0 3
PROBABILITY AND STATISTICS

Course Objectives:
• To familiarize the students with the foundations of probability and statistical
methods
• To impart probability concepts and statistical methods in various applications
Engineering
Course Outcomes: Upon successful completion of this course, the student should be able to
1. Classify the concepts of data science and its importance (L2)
2. Interpret the association of characteristics and through correlation and regression tools
(L4)
3. Apply discrete and continuous probability distributions (L3)
4. Design the components of a classical hypothesis test (L6)
5. Infer the statistical inferential methods based on small and large sampling tests (L4)

Unit – I: Descriptive statistics and methods for data science:

Data science – Statistics Introduction – Population vs Sample –Collection of data – primary
and secondary data – Type of variable: dependent and independent Categorical and
Continuous variables – Data visualization – Measures of Central tendency – Measures of
Variability – Skewness – Kurtosis.

UNIT – II: Correlation and Regression:

Correlation – Correlation coefficient – Rank correlation.

Linear Regression: Straight line – Multiple Linear Regression - Regression coefficients and
properties – Curvilinear Regression: Parabola – Exponential – Power curves.

UNIT – III: Probability and Distributions:

Probability– Conditional probability and Baye’s theorem – Random variables – Discrete and
Continuous random variables – Distribution functions – Probability mass function,
Probability density function and Cumulative distribution functions – Mathematical
Expectation and Variance – Binomial, Poisson, Uniform and Normal distributions.

UNIT – IV: Sampling Theory:

Introduction – Population and Samples – Sampling distribution of Means and Variance
(definition only) – Point and Interval estimations – Maximum error of estimate – Central
limit theorem (without proof) – Estimation using t, and F-distributions.
UNIT – V: Tests of Hypothesis:
Introduction – Hypothesis – Null and Alternative Hypothesis – Type I and Type II errors –
Level of significance – One tail and two-tail tests – Test of significance for large samples and
Small Samples: Single and difference means – Single and two proportions – Student’s t- test,
 JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY KAKINADA
KAKINADA – 533 003, Andhra Pradesh, India
B.Tech CSBS (R23-COURSE STRUCTURE & SYLLABUS)

F-test, -test.

Text Books:
• Miller and Freund’s, Probability and Statistics for Engineers,7/e, Pearson, 2008.

• S. C. Gupta and V.K. Kapoor, Fundamentals of Mathematical Statistics, 11/e,

Sultan Chand & Sons Publications, 2012.

Reference Books:
• Shron L. Myers, Keying Ye, Ronald E Walpole, Probability and Statistics
Engineers and the Scientists,8th Edition, Pearson 2007.
• Jay l. Devore, Probability and Statistics for Engineering and the Sciences, 8th
Edition, Cengage.
• Sheldon M. Ross, Introduction to probability and statistics Engineers and the
Scientists, 4th Edition, Academic Foundation, 2011.
• Johannes Ledolter and Robert V. Hogg, Applied statistics for Engineers and
Physical Scientists, 3rd Edition, Pearson, 2010.
 JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY KAKINADA
KAKINADA – 533 003, Andhra Pradesh, India
B.Tech CSBS (R23-COURSE STRUCTURE & SYLLABUS)

II Year II Semester L T P C
OPERATING SYSTEMS 3 0 0 3

Course Objectives:
The main objectives of the course is to make student
 Understand the basic concepts and principles of operating systems,
including processmanagement, memory management, file systems, and
Protection
 Make use of process scheduling algorithms and synchronization techniques
to achievebetter performance of a computer system.
 Illustrate different conditions for deadlock and their possible solutions.

UNIT - I
Operating Systems Overview: Introduction, Operating system functions,
Operating systems operations, Computing environments, Free and Open-Source
Operating Systems System Structures: Operating System Services, User and
Operating-System Interface, 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

UNIT - II
Processes: Process Concept, Process scheduling, Operations on processes, Inter-
process communication. Threads and Concurrency: Multithreading models,
Thread libraries, Threading issues. CPU Scheduling: Basic concepts, Scheduling
criteria, Scheduling algorithms, Multiple processor scheduling.

UNIT – III
Synchronization Tools: The Critical Section Problem, Peterson’s Solution, Mutex
Locks, Semaphores, Monitors, Classic problems of Synchronization. Deadlocks:
system Model, Deadlock characterization, Methods for handling Deadlocks,
Deadlock prevention, Deadlock avoidance, Deadlock detection, Recovery from
Deadlock.

UNIT - IV
Memory-Management Strategies: Introduction, Contiguous memory allocation,
Paging, Structure of the Page Table, Swapping. Virtual Memory Management:
Introduction, Demand paging, Copy-on-write, Page replacement, Allocation of
frames, Thrashing. Storage Management: Overview of Mass Storage Structure,
HDD Scheduling.
 JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY KAKINADA
KAKINADA – 533 003, Andhra Pradesh, India
B.Tech CSBS (R23-COURSE STRUCTURE & SYLLABUS)
UNIT - V
File System: File System Interface: File concept, Access methods, Directory
Structure; File system Implementation: File-system structure, File-system
Operations, Directory implementation, Allocation method, Free space management;
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.

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

Online Learning Resources:

1. https://nptel.ac.in/courses/106/106/106106144/
2. http://peterindia.net/OperatingSystems.html
 JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY KAKINADA
KAKINADA – 533 003, Andhra Pradesh, India
B.Tech CSBS (R23-COURSE STRUCTURE & SYLLABUS)

II Year II Semester L T P C
DATABASE MANAGEMENT SYSTEMS 3 0 0 3
Course Objectives:
The main objectives of the course is to

 Introduce database management systems and to give a good formal

foundation on therelational model of data and usage of Relational Algebra
 Introduce the concepts of basic SQL as a universal Database language
 Demonstrate the principles behind systematic database design approaches
by coveringconceptual design, logical design through normalization
 Provide an overview of physical design of a database system, by discussing
Databaseindexing techniques and storage techniques
UNIT I:
Introduction: Database system, Characteristics (Database Vs File System), Database
Users, Advantages of Database systems, Database applications. Brief introduction
of different Data Models; Concepts of Schema, Instance and data independence;
Three tier schema architecture for data independence; Database system structure,
environment, Centralized and Client Serverarchitecture for the database.
Entity Relationship Model: Introduction, Representation of entities, attributes,
entity set, relationship, relationship set, constraints, sub classes, super class,
inheritance, specialization, generalization using ER Diagrams.

UNIT II:
Relational Model: Introduction to relational model, concepts of domain, attribute,
tuple, relation, importance of null values, constraints (Domain, Key constraints,
integrity constraints) and their importance, Relational Algebra, Relational Calculus.
BASIC SQL: Simple Database schema, data types, table definitions (create, alter),
different DML operations (insert, delete, update).

UNIT III:
SQL: Basic SQL querying (select and project) using where clause, arithmetic &
logical operations, SQL functions (Date and Time, Numeric, String
conversion).Creating tables with relationship, implementation of key and integrity
constraints, nested queries, sub queries, grouping, aggregation, ordering,
implementation of different types of joins, view(updatable and non-updatable),
relational set operations.

UNIT IV:
Schema Refinement (Normalization):Purpose of Normalization or schema
 JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY KAKINADA
KAKINADA – 533 003, Andhra Pradesh, India
B.Tech CSBS (R23-COURSE STRUCTURE & SYLLABUS)
refinement, concept of functional dependency, normal forms based on functional
dependency Lossless join and dependency preserving decomposition, (1NF, 2NF
and 3 NF), concept of surrogate key, Boyce- Codd normal form(BCNF), MVD,
Fourth normal form(4NF), Fifth Normal Form (5NF).

UNIT V:
Transaction Concept: Transaction State, ACID properties, Concurrent Executions,
Serializability, Recoverability, Implementation of Isolation, Testing for
Serializability, lock based, time stamp based, optimistic, concurrency protocols,
Deadlocks, Failure Classification, Storage, Recovery and Atomicity, Recovery
algorithm.
Introduction to Indexing Techniques: B+ Trees, operations on B+Trees, Hash Based
Indexing:

Text Books:
1) Database Management Systems, 3rd edition, Raghurama Krishnan, Johannes
Gehrke,TMH (For Chapters 2, 3, 4)
2) Database System Concepts,5th edition, Silberschatz, Korth, Sudarsan, TMH
(ForChapter 1 and Chapter 5)

Reference Books:
1) Introduction to Database Systems, 8th edition, C J Date, Pearson.
2) Database Management System, 6th edition, Ramez Elmasri, Shamkant B.
Navathe,Pearson
3) Database Principles Fundamentals of Design Implementation and Management,
CorlosCoronel, Steven Morris, Peter Robb, Cengage Learning.

Web-Resources:
1) https://nptel.ac.in/courses/106/105/106105175/
2)
https://infyspringboard.onwingspan.com/web/en/app/toc/lex_auth_01275806667282
022456_shared/overview
 JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY KAKINADA
KAKINADA – 533 003, Andhra Pradesh, India
B.Tech CSBS (R23-COURSE STRUCTURE & SYLLABUS)

II Year II Semester L T P C
3 0 0 3
SOFTWARE ENGINEERING
Course Objectives:
The objectives of this course are to introduce
 Software life cycle models, Software requirements and SRS document.
 Project Planning, quality control and ensuring good quality software.
 Software Testing strategies, use of CASE tools,
Implementationissues, validation & verification procedures.

UNIT I:
Introduction: Evolution, Software development projects, Exploratory style of
software developments, Emergence of software engineering, Notable changes in
software development practices, Computer system engineering. Software Life Cycle
Models: Basic concepts, Waterfall model and its extensions, Rapid application
development, Agile development model, Spiral model.

UNIT II:
Software Project Management: Software project management complexities,
Responsibilities of a software project manager, Metrics for project size estimation,
Project estimation techniques, Empirical Estimation techniques, COCOMO,
Halstead’s software science, risk management. Requirements Analysis And
Specification: Requirements gathering and analysis, Software Requirements
Specification (SRS), Formal system specification, Axiomatic specification,
Algebraic specification, Executable specification and 4GL.

UNIT III:
Software Design: Overview of the design process, How to characterise a good
software design? Layered arrangement of modules, Cohesion and Coupling.
approaches to software design. Agility: Agility and the Cost of Change, Agile
Process, Extreme Programming (XP), Other Agile Process Models, Tool Set for the
Agile Process (Text Book 2) Function-Oriented Software Design: Overview of
SA/SD methodology, Structured analysis, Developing the DFD model of a system,
Structured design, Detailed design, and Design Review. 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.

UNIT IV:
Coding And Testing: Coding, Code review, Software documentation, Testing,
Black-box testing, White-Box testing, Debugging, Program analysis tools,
Integration testing, Testing object-oriented programs, Smoke testing, and Some
 JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY KAKINADA
KAKINADA – 533 003, Andhra Pradesh, India
B.Tech CSBS (R23-COURSE STRUCTURE & SYLLABUS)
general issues associated with testing. 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.

UNIT V:
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
engineering, Software maintenance process models and Estimation of maintenance
cost.
Software Reuse: reuse- definition, introduction, reason behind no reuse so far,
Basic issues in any reuse program, A reuse approach, and Reuse at organisation
level.

Text Books:
Fundamentals of Software Engineering, Rajib Mall, 5th Edition, PHI.
Software Engineering A practitioner’s Approach, Roger S. Pressman, 9th
Edition, Mc-Graw Hill International Edition.

Reference Books:
Software Engineering, Ian Sommerville, 10 t h Edition, Pearson.
Software Engineering, Principles and Practices, DeepakJain,
OxfordUniversity Press.
e-Resources:

1) https://nptel.ac.in/courses/106/105/106105182/
2) https://infyspringboard.onwingspan.com/web/en/app/toc/lex_auth_0126058
95063871 48827_shared/overview
3) https://infyspringboard.onwingspan.com/web/en/app/toc/lex_auth_0133826
90411003 904735_shared/overview
 JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY KAKINADA
KAKINADA – 533 003, Andhra Pradesh, India
B.Tech CSBS (R23-COURSE STRUCTURE & SYLLABUS)

II Year II Semester L T P C
0 0 3 1.5

OPERATING SYSTEMS & SOFTWAREENGINEERING LAB

Course Objectives:
The main objectives of the course are to
 Provide insights into system calls, file systems, semaphores,
 Develop and debug CPU Scheduling algorithms, page replacement
algorithms, threadimplementation
 Implement Bankers Algorithms to Avoid the Dead Lock
 acquire the generic software development skill through various stages of
software lifecycle
 generate test cases for software testing

Experiments covering the Topics:

 UNIX fundamentals, commands & system calls
 CPU Scheduling algorithms, thread processing
 IPC, semaphores, monitors, deadlocks
 Page replacement algorithms, file allocation strategies
 Memory allocation strategies
 Software Requirement Specification, DFD, CFD
 Software estimation, UML diagrams, test case design

Sample Experiments in Operating Systems:

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

Sample Experiments in Software Engineering:

1) Perform the following, for the following experiments:

i. Do the Requirement Analysis and Prepare SRS
ii. Draw E-R diagrams, DFD, CFD and structured charts for the
project.
a. Course Registration System
b. Students Marks Analyzing System
c. Online Ticket Reservation System
d. Stock Maintenance
2) Consider any application, using COCOMO model, estimate the effort.
3) Consider any application, Calculate effort using FP oriented estimation model.
4) Draw the UML Diagrams for the problem a, b, c, d.
5) Design the test cases for e-Commerce application (Flipcart, Amazon)
6) Design the test cases for a Mobile Application (Consider any example from
Appstore)
7) Design and Implement ATM system through UML Diagrams.
 JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY KAKINADA
KAKINADA – 533 003, Andhra Pradesh, India
B.Tech CSBS (R23-COURSE STRUCTURE & SYLLABUS)

II Year II Semester L T P C
0 0 3 1.5

DATABASE MANAGEMENT SYSTEMS LAB

Course Objectives:
This Course will enable students to
 Populate and query a database using SQL DDL/DML Commands
 Declare and enforce integrity constraints on a database
 Writing Queries using advanced concepts of SQL
 Programming PL/SQL including procedures, functions, cursors and triggers,

Experiments covering the topics:

 DDL, DML, DCL commands
 Queries, nested queries, built-in functions,
 PL/SQL programming- control structures
 Procedures, Functions, Cursors, Triggers,
 Database connectivity- ODBC/JDBC

Sample Experiments:
1. Creation, altering and droping of tables and inserting rows into a table (use
constraintswhile creating tables) examples using SELECT command.
2. Queries (along with sub Queries) using ANY, ALL, IN, EXISTS,
NOTEXISTS, UNION, INTERSET, Constraints. Example:- Select the roll
number and name of the student who secured fourth rank in the class.
3. Queries using Aggregate functions (COUNT, SUM, AVG, MAX and MIN),
GROUP BY, HAVING and Creation and dropping of Views.
4. 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 functions (Sysdate, next_day,
add_months, last_day, months_between, least, greatest, trunc, round,
to_char, to_date)
5.
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 for those who
 JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY KAKINADA
KAKINADA – 533 003, Andhra Pradesh, India
B.Tech CSBS (R23-COURSE STRUCTURE & SYLLABUS)
secured first class and an exception can be raised if no records were
found)
ii. Insert data into student table and use COMMIT, ROLLBACK and
SAVEPOINT in PL/SQL block.
6. Develop a program that includes the features NESTED IF, CASE and
CASE expression. The program can be extended using the NULLIF and
COALESCE functions.
7. Program development using WHILE LOOPS, numeric FOR LOOPS, nested
loops using ERROR Handling, BUILT –IN Exceptions, USE defined
Exceptions, RAISE- APPLICATION ERROR.
8. Programs development using creation of procedures, passing parameters IN
and OUTof PROCEDURES.
9. Program development using creation of stored functions, invoke
functions in SQLStatements and write complex functions.
10. Develop programs using features parameters in a CURSOR, FOR
UPDATECURSOR, WHERE CURRENT of clause and CURSOR
variables.
11. Develop Programs using BEFORE and AFTER Triggers, Row and
Statement Triggersand INSTEAD OF Triggers
12. Create a table and perform the search operation on table using indexing
and non-indexing techniques.
13. Write a Java program that connects to a database using JDBC
14. Write a Java program to connect to a database using JDBC and insert values into
it
15. Write a Java program to connect to a database using JDBC and delete values
from it

Text Books/Suggested Reading:

1. Oracle: The Complete Reference by Oracle Press
2. Nilesh Shah, "Database Systems Using Oracle”, PHI, 2007
3. Rick F Vander Lans, “Introduction to SQL”, Fourth Edition, Pearson Education,
2007
 JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY KAKINADA
KAKINADA – 533 003, Andhra Pradesh, India
B.Tech CSBS (R23
(R23-COURSE STRUCTURE & SYLLABUS)

II Year II Semester L T P C
FULL STACK DEVELOPMENT – 1 0 1 2 2
(Skill Enhancement Course)
Course Objectives:
The main objectives of the course are to
 Make use of HTML elements and their attributes for designing static web pages
 Build a web page by applying appropriate CSS styles to HTML elements
 Experiment with JavaScript to develop dynamic web pages and validate forms

Experiments covering the Topics:

 Lists, Links and Images
 HTML Tables, Forms and Frames
 HTML 5 and Cascading Style Sheets, Types of CSS
 Selector forms
 CSS with Color, Background, Font, Text and CSS Box Model
 Applying JavaScript - internal and external, I/O, Type Conversion
 JavaScript Conditional Statements and Loops, Pre-defined and User--defined
Objects
 JavaScript Functions and Events
 Node.js

Sample Experiments:
1. 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.
c. Create a HTML document that has your image and your friend’s image imag 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

2. HTML Tables, Forms and Frames

a. Write a HTML program, to explain the working of tables. (use tags: <table>, <tr>,
<th>,
 JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY KAKINADA
KAKINADA – 533 003, Andhra Pradesh, India
B.Tech CSBS (R23
(R23-COURSE STRUCTURE & SYLLABUS)

<td> and attributes: border, rowspan, colspan)

b. Write a HTML program, to explain the working of tables by preparing a
timetable. (Note: Use <caption> tag to set the caption to the table & also use
cell spacing, cell padding, 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, checkboxes, radio buttons, list boxes using <select>&<option>
tags, <text area> and two buttons ie: submit and reset. Use tables to provide a
better view).
d. Write a HTML program, to explain the working of frames, such that page is to
be divided into 3 parts on either direction. (Note: first frame  image, second
frame  paragraph,third frame  hyperlink. And also make sure of using
“no frame” attribute such thatframes to be fixed).

3. HTML 5 and Cascading Style Sheets, Types of CSS

a. Write a HTML program, that makes use of <article>, <aside>, <figure>,
<figcaption>,
<footer>, <header>, <main>, <nav>, <section>, <div>, <span> tags.
b. Write a HTML program, to embed audio and video into HTML web page.
c. 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 andvalue).

4. Selector forms
a. Write a program to apply different types of selector forms
i. Simple selector (element, id, class, group, universal)
ii. Combinator selector (descendant, child, adjacent sibling, general sibling)
iii. Pseudo-class selector
iv. Pseudo-element
element selector
v. Attribute selector

5. CSS with Color, Background, Font, Text and CSS Box Model
a. Write a program to demonstrate the various ways you can reference a color in
CSS.
b. Write a CSS rule that places a background image halfway down the
page, tilting ithorizontally. The image should remain in place when the user
scrolls up or down.
c. Write a program using the following terms related to CSS font and text:
i. font-size ii. font-weight iii. font-style
iv. text-decoration v. text-transformation vi. text-alignment
d. Write a program, to explain the importance of CSS Box model using
 JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY KAKINADA
KAKINADA – 533 003, Andhra Pradesh, India
B.Tech CSBS (R23
(R23-COURSE STRUCTURE & SYLLABUS)

i. Content ii. Border iii. Margin iv. padding

6. Applying JavaScript - internal and external, I/O, Type Conversion

a. Write a program to embed internal and external JavaScript in a web page.
b. Write a program to explain the different ways for displaying output.
c. Write a program to explain the different ways for taking input.
d. 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

7. 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.
c. Write a program using array object properties and methods.
d. Write a program using math object properties and methods.
e. Write a program using string object properties and methods.
f. Write a program using regex object properties and methods.
g. Write a program using date object properties and methods.
h. Write a program to explain user-defined object by using properties, methods,
accessors,constructors and display.

8. JavaScript Conditional Statements and Loops

a. Write a program which asks the user to enter three integers, obtains the
numbers from the 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
while loops.
d. Write aprogram 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 digitsis 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)

9. Java script Functions and Events

a. Design a appropriate function should be called to display
i. Factorial of that number
 JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY KAKINADA
KAKINADA – 533 003, Andhra Pradesh, India
B.Tech CSBS (R23
(R23-COURSE STRUCTURE & SYLLABUS)

ii. Fibonacci series up to that number

iii. Prime numbers up to that number
iv. Is it palindrome or not
b. 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 becalled to display
i. Factorial of that number
ii. Fibonacci series up to that number
iii. Prime numbers up to that number
iv. Is it palindrome or not
c. Write a program to validate the following fields in a registration page
i. Name (start with alphabet and followed by alphanumeric and
the lengthshould not be less than 6 characters)
ii. Mobile (only numbers and length 10 digits)
iii. E-mail (should contain format like xxxxxxx@xxxxxx.xxx)

10. Node.js
a. Write a program to show the workflow of JavaScript code executable by
creating webserver in Node.js.
b. Write a program to transfer data over http protocolusing http module.
c. Create a text file src.txt and add the following content to it. (HTML, CSS,
Javascript,Typescript, MongoDB, Express.js, React.js, Node.js)
d. Write a program to parse an URL using URL module.
e. Write a program to create an user-defined module and show the workflow
ofModularization of application using Node.js

Text Books:
1. Programming the World Wide Web, 7th Edition, Robet W Sebesta, Pearson, 2013.
2. Pro MERN Stack: Full Stack Web App Development with Mongo, Express,
React, andNode, Vasan Subramanian, 2nd edition, APress, O’Reilly.

Web Links:

https://www.w3schools.com/html
https://www.w3schools.com/css
https://www.w3schools.com/js/
https://www.w3schools.com/nodejs
.com/nodejs
https://www.w3schools.com/typescript
 JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY KAKINADA
KAKINADA – 533 003, Andhra Pradesh, India
B.Tech CSBS (R23
(R23-COURSE STRUCTURE & SYLLABUS)
L T P C
II Year II Semester 1 0 2 2

DESIGN THINKING & INNOVATION

Course Objectives: The objectives of the course are to
 Bring awareness on innovative design and new product development.
 Explain the basics of design thinking.
 Familiarize the role of reverse engineering in product development.
 Train how to identify the needs of society and convert into demand.
 Introduce product planning and proproduct development process.

UNIT – I Introduction to Design Thinking

Introduction to elements and principles of Design, basics of design
design-dot,
dot, line, shape, form as
fundamental design components. Principles of design. Introduction to design thinking, history
off Design Thinking, New materials in Industry.

UNIT - II Design Thinking Process

Design thinking process (empathize, analyze, idea & prototype), implementing the process in
driving inventions, design thinking in social innovations. Tools of design thinking - person,
costumer, journey map, brainstorming, product development
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.

UNIT - III Innovation

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

UNIT - IV Product Design

Problem formation, introduction to product design, Product strategies, Product value, Product
planning, product specifications. Innovation towards product design Case studies.
Activity: Importance of modeling, how to set specifications, Explaining their own product
design.
UNIT – V Design Thinking in Business Processes
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.
Design thinking for Startups. Defini
Defining
ng and testing Business Models and Business Cases.
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.
 JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY KAKINADA
KAKINADA – 533 003, Andhra Pradesh, India
B.Tech CSBS (R23
(R23-COURSE STRUCTURE & SYLLABUS)

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.
3. William lidwell, Kritinaholden, &Jill
&Jill butter, Universal principles of design, 2/e,
Rockport Publishers, 2010.
4. Chesbrough.H, The era of open innovation, 2003.
Online Learning Resources:
 https://nptel.ac.in/courses/110/106/110106124/
 https://nptel.ac.in/courses/109/104/109104109/
 https://swayam.gov.in/nd1_noc19_mg60/preview
 https://onlinecourses.nptel.ac.in/noc22_de16/preview

Course Outcomes:
Blooms
COs Statements
Level
CO1 Define the concepts related to design thinking. L1
CO2 Explain the fundamentals of Design Thinking and innovation. L2
Apply the design thinking techniques for solving problems in
CO3 L3
various sectors.
CO4 Analyse to work in a multidisciplinary environment. L4
CO5 Evaluate the value of creativity. L5