JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY KAKINADA

KAKINADA – 533 003, Andhra Pradesh, India

CSE (IoT and CYBER SECURITY INCLUDING BCT)
(R23-IInd YEAR COURSE STRUCTURE & SYLLABUS)

B.Tech.– II Year I Semester

S.No. Category Title L T P Credits
Discrete Mathematics & Graph 3 0 0 3
1 BS&H
Theory
Universal human values – 2 1 0 3
2 BS&H understanding harmony and
Ethical human conduct
Digital Logic & Computer 3 0 0 3
3 Engineering Science
Organization
Advanced Data Structures 3 0 0 3
4 Professional Core
&Algorithms Analysis
Analys
Object Oriented Programming 3 0 0 3
5 Professional Core
Through Java
Advanced Data Structures and 0 0 3 1.5
6 Professional Core
Algorithm
Algorithms Analysis Lab
Object Oriented Programming 0 0 3 1.5
7 Professional Core
Through Java Lab
Skill Enhancement Python programming 0 1 2 2
8
Course
9 Audit Course Environmental Science 2 0 0 0
Total 16 2 8 20
 JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY KAKINADA
KAKINADA – 533 003, Andhra Pradesh, India
CSE (IoT and CYBER SECURITY INCLUDING BCT)
(R23-IInd YEAR COURSE STRUCTURE & SYLLABUS)

B.Tech.– II Year II Semester

S.No. Category Title L T P Credits

Managerial Economics and 2 0 0 2
1 Management Course- I
Financial Analysis
Engineering Science/ Number Theory & 3 0 0 3
2 Applications
Basic Science
3 Professional Core Operating Systems 3 0 0 3
Database Management 3 0 0 3
4 Professional Core
Systems
5 Professional Core Computer Networks 3 0 0 3
Computer Networks & 0 0 3 1.5
6 Professional Core
Operating SystemsLab
Database Management 0 0 3 1.5
7 Professional Core
Systems Lab
8 SkillEnhancement course Full Stack development-1 0 1 2 2
DesignThinking
9 BS&H 1 0 2 2
&Innovation
Total 15 1 10 21
Mandatory Community Service Project Internship of 08 weeks duration during summer
Vacation
 JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY KAKINADA
KAKINADA – 533 003, Andhra Pradesh, India
CSE (IoT and CYBER SECURITY INCLUDING BCT)
(R23-IInd YEAR 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 tot
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 graphic
graphicallysing
allysing 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,
gies, 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
bles and Quantifiers, Free and Bound Variables, Inference Theory for
Predicate Calculus.
UNIT-II: Set Theory:
Sets: Operations on Sets, Principle of Inclusion-Exclusion,
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:
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
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
CSE (IoT and CYBER SECURITY INCLUDING BCT)
(R23-IInd YEAR 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
rtite 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 P.
Tremblay and P. Manohar, Tata McGraw Hill.
2. Elements of Discrete Mathematics
Mathematics-AA 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.
 JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY KAKINADA
KAKINADA – 533 003, Andhra Pradesh, India
CSE (IoT and CYBER SECURITY INCLUDING BCT)
(R23-IInd YEAR COURSE STRUCTURE & SYLLABUS)

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

UNIVERSAL HUMAN VALUES – UNDERSTANDING HARMONY AND

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
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
society nature) (L1, L2)
 Apply what they have learnt to their own self in different day-to-day
day 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 existenc
existencee (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 11-
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
 JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY KAKINADA
KAKINADA – 533 003, Andhra Pradesh, India
CSE (IoT and CYBER SECURITY INCLUDING BCT)
(R23-IInd YEAR COURSE STRUCTURE & SYLLABUS)

Tutorial 1: Practice Session PS1 Sharing about Oneself

Lecture 3: self-exploration
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

UNIT II Harmony in the Human Being (6 lectures and 3 tutorials for practice sess
session)
Lecture 7: Understanding Human being as the Co-existence
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
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 Feeling
Feelings, Justice in Human-to-Human
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
self-regulation
regulation and Mutual Fulfilment among
the Four Orders of Nature
Tutorial 10: Practice Session PS10 Exploring the Four Orders
Orders of Nature
Lecture 21: Realizing Existence as Co
Co-existence at All Levels
 JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY KAKINADA
KAKINADA – 533 003, Andhra Pradesh, India
CSE (IoT and CYBER SECURITY INCLUDING BCT)
(R23-IInd YEAR COURSE STRUCTURE & SYLLABUS)

Lecture 22: The Holistic Perception of Harmony in Existence

Tutorial 11: Practice Session PS11 Exploring Co
Co-existence
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
Production Systems and Management
Models-Typical
Typical Case Studies
Lecture 28: Strategies for Transition towards Value
Value-based
based Life and Profession
Tutorial 14: Practice Session PS14 Exploring Steps of Transition towards
Universal Human Order

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
oring 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
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
 JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY KAKINADA
KAKINADA – 533 003, Andhra Pradesh, India
CSE (IoT and CYBER SECURITY INCLUDING BCT)
(R23-IInd YEAR COURSE STRUCTURE & SYLLABUS)

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,
Bagaria A Foundation Course in Human Values and Professional
Ethics,, 2nd Revised Edition, Excel Books, New Delhi, 2019. ISBN 978
978-93-87034
87034-47-1
b. The Teacher’s Manual
R R Gaur, R Asthana, G P Bagaria,
Bagaria,Teachers’
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 D 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)
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
iscussing 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 self-reflection
reflection and self-
self
exploration.

Scenarios may be used to initiate discussion. The student is encouraged to take up ”ordinary”
situations rather than” extra-ordinary”
ordinary” situations. Such observations and their analyses are
shared and discussed with other students and faculty mentor, in a group sitting.
 JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY KAKINADA
KAKINADA – 533 003, Andhra Pradesh, India
CSE (IoT and CYBER SECURITY INCLUDING BCT)
(R23-IInd YEAR COURSE STRUCTURE & SYLLABUS)

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 8 day Faculty Development
Program on Universal Human Values is deemed essential.

Online Resources:
1. https://fdp-si.aicte-india.org/UHV
india.org/UHV-
II%20Class%20Notes%20&%20Handouts/UHV%20Handout%201
II%20Class%20Notes%20&%20Handouts/UHV%20Handout%201-
Introduction%20to%20Value%20
Introduction%20to%20Value%20Education.pdf
2. https://fdp-si.aicte-india.org/UHV
india.org/UHV-
II%20Class%20Notes%20&%20Handouts/UHV%20Handout%202
II%20Class%20Notes%20&%20Handouts/UHV%20Handout%202-
Harmony%20in%20the%20Human%20Being.pdf
the%20Human%20Being.pdf
3. https://fdp-si.aicte-india.org/UHV
india.org/UHV-
II%20Class%20Notes%20&%20Handouts/UHV%20Handout%203
II%20Class%20Notes%20&%20Handouts/UHV%20Handout%203-
Harmony%20in%20the%20Family.pdf
%20the%20Family.pdf
4. https://fdp-si.aicte-india.org/UHV%201%20Teaching%20Material/D3
india.org/UHV%201%20Teaching%20Material/D3-
S2%20Respect%20July%2023.pdf
5. https://fdp-si.aicte-india.org/UHV
india.org/UHV-
II%20Class%20Notes%20&%20Handouts/UHV%20Handout%205
II%20Class%20Notes%20&%20Handouts/UHV%20Handout%205-
Harmony%20in%20the%20Nature%20and%20Existence.pdf
6. https://fdp-si.aicte-india.org/download/FDPTeachingMaterial/3
india.org/download/FDPTeachingMaterial/3-days%20FDP
days%20FDP-
SI%20UHV%20Teaching%20Material/Day%203%20Handouts/UHV%203D%20D3
20UHV%20Teaching%20Material/Day%203%20Handouts/UHV%203D%20D3-
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
0Teaching%20Material/UHV%20II%20Lecture%2023-
0Teaching%20Material/UHV%20II%20Lecture%2023
25%20Ethics%20v1.pdf
8. https://www.studocu.com/in/document/kiet
udocu.com/in/document/kiet-group-of-institutions/universal
institutions/universal-human-
values/chapter-5-holistic--understanding-of-harmony-on-professional-ethics/62490385
ethics/62490385
9. https://onlinecourses.swayam2.ac.in/aic
https://onlinecourses.swayam2.ac.in/aic22_ge23/preview
 JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY KAKINADA
KAKINADA – 533 003, Andhra Pradesh, India
CSE (IoT and CYBER SECURITY INCLUDING BCT)
(R23-IInd YEAR COURSE STRUCTURE & SYLLABUS)

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

DIGITAL LOGIC & COMPUTER ORGANIZATION

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: BinaryNumbers, Fixed Point Representation.
Floating Point Representation. Number base
conversions, Octal and Hexadecimal Numbers, components,
Signed binary numbers, Binary codes Digital Logic Circuits-I:
Circuits
Basic Logic Functions, Logic gates, universal logicgates,
Minimization of Logic expressions.
K-Map Simplification, Combinational Circuits, Decoders,
Multiplexers

UNIT – II:
Digital Logic Circuits
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
Arithmetic: Addition and Subtraction of Signed Numbers,
Design of Fast Adders, Multiplication of Positive Numbers, Signed-
Signed
operand Multiplication,Fast Multiplication, Integer Division, Floating-
Floating
Point Numbers and Operations.
Processor Organization: Fundamental Concepts, Execution of a
Complete Instruction, Multiple-Bus
Multiple Bus Organization, Hardwire Control
and Multiprogrammed Control
JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY KAKINADA
KAKINADA – 533 003, Andhra Pradesh, India
CSE (IoT and CYBER SECURITY INCLUDING BCT)
(R23-IInd YEAR COURSE STRUCTURE & SYLLABUS)

UNIT – IV:
The Memory Organization: Basic Concepts, Semiconductor RAM
Memories, Read-Only
Only Memories, Speed, Size and Cost, Cache
Memories, Performance Considerations, Virtual Memories, Memory
Management Requirements,Secondary Storage

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

Textbooks:
1. Computer Organization, Carl Hamacher, Zvonko
Vranesic, SafwatZaky, 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
CSE (IoT and CYBER SECURITY INCLUDING BCT)
(R23-IInd YEAR COURSE STRUCTURE & SYLLABUS)

II Year I Semester L T P C
3 0 0 3
ADVANCED DATA STRUCTURES & ALGORITHMS
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
algorithmdesign

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),
gorithm), 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

UNIT – V:
NP Hard and NP Complete Problems: Basic Concepts, Cook’s theorem.
 JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY KAKINADA
KAKINADA – 533 003, Andhra Pradesh, India
CSE (IoT and CYBER SECURITY INCLUDING BCT)
(R23-IInd YEAR COURSE STRUCTURE & SYLLABUS)

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, Ellis;
Sahni,Sartaj; Mehta, Dinesh, 2nd Edition Universities Press
2. Computer Algorithms in C++, Ellis Horowitz, Sartaj Sah
nd
ni,Sanguthevar Rajasekaran, 2 Edition University Press

Reference Books:
1. Data Structures and program design in C, Robert Kruse,Pearson
Education 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:

1. https://www.tutorialspoint.com/advanced_data_structures/inde
x.asp
2. http://peterindia.net/Algorithms.html
 JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY KAKINADA
KAKINADA – 533 003, Andhra Pradesh, India
CSE (IoT and CYBER SECURITY INCLUDING BCT)
(R23-IInd YEAR 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 defining
classes, 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
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,
ion, if Expression, Nested if Expressions, if–else
if else Expressions,
Ternary Operator ?:, Switch Statement, Iteration Statements, while Expression, do–while
do Loop,
for Loop, Nested for Loop, For–Each
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 Value
and by Reference, Keyword this.
Methods: Introduction, Defining Methods, Overloaded Methods, Overloaded Constructor
Methods, Class Objects as Parameters in Methods, Access Control, Recursive Methods,
Nesting of Methods, Overriding Methods, Attributes Final and Static.
 JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY KAKINADA
KAKINADA – 533 003, Andhra Pradesh, India
CSE (IoT and CYBER SECURITY INCLUDING BCT)
(R23-IInd YEAR COURSE STRUCTURE & SYLLABUS)

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
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,
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, AutoAuto-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 Throw
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
MultithreadedProgramming for Multi
Multi-core Processor, Thread Class, Main Thread-
Thread Creation of
New Threads, Thread States, Thread Priority-Synchronization, Deadlock and Race
Situations, Inter-threadCommunication - Suspending, Resuming, and Stopping of Threads.
Java Database Connectivity: Introduction, JDBC Architecture, Installing MySQL and
MySQL Connector/J, JDBC Environment Setup, Establishing JDBC Database Connections,
ResultSet Interface
Java FX GUI: Java FX Scene Builder, Java FX App Window Structure, displaying text and
 JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY KAKINADA
KAKINADA – 533 003, Andhra Pradesh, India
CSE (IoT and CYBER SECURITY INCLUDING BCT)
(R23-IInd YEAR COURSE STRUCTURE & SYLLABUS)

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:
https://nptel.ac.in/courses/106/105/106105191/
https://infyspringboard.onwingspan.com/web/en/app/toc/
tps://infyspringboard.onwingspan.com/web/en/app/toc/lex_auth_012880464547618
lex_auth_012880464547618
816347_shared/overview
 JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY KAKINADA
KAKINADA – 533 003, Andhra Pradesh, India
CSE (IoT and CYBER SECURITY INCLUDING BCT)
(R23-IInd YEAR 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
problem scenarios
Experiments covering the Topics:
 Operations on AVL trees, B 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

Sample Programs:
1. Constructct 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 tree
into a new file using in-order.
order.
2. Construct B-Tree
Tree an order of 5 with a set of 100 random ele
elements
ments stored in array.
Implement searching, insertion and deletion operations.
3. Construct Min and Max Heap using arrays, delete any element and display the content
of 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
input sizes (Average, Worst and Best cases).
cases)
7. Compare the performance of Single Source Shortest Paths using Greedy method when
the 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
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
CSE (IoT and CYBER SECURITY INCLUDING BCT)
(R23-IInd YEAR 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, 2nd
Edition, University Press
3. Data Structures and program
rogram design in C, Robert Kruse, Pearson Education Asia
4. An introduction to Data Structures with applications, Trembley & Sorenson, McGraw
Hill

Online Learning Resources:

1. http://cse01-iiith.vlabs.ac.in/
iiith.vlabs.ac.in/
2. http://peterindia.net/Algorithms.html
p://peterindia.net/Algorithms.html
 JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY KAKINADA
KAKINADA – 533 003, Andhra Pradesh, India
CSE (IoT and CYBER SECURITY INCLUDING BCT)
(R23-IInd YEAR COURSE STRUCTURE & SYLLABUS)

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

OBJECT ORIENTED PROGRAMMING THROUGH 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
fundamentals- data types, control structures
 Classes, methods, objects, Inheritance, polymorphism,
 Exception handling, Threads, Packages, Interfaces
 Files, I/O streams,
treams, JavaFX GUI

Sample 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 the
discriminate D and basing
ng 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 binary
search mechanism.
b) Write a JAVA program to sort for an element in a given list of elements using bubble
bubbl 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 invoke
them 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.

Exercise - 4
a) Write a JAVA program to implement Single Inheritance
b) Write a JAVA program to implement multilevel Inheritance
c) Write a JAVA program for abstract class to find areas of different shapes
 JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY KAKINADA
KAKINADA – 533 003, Andhra Pradesh, India
CSE (IoT and CYBER SECURITY INCLUDING BCT)
(R23-IInd YEAR COURSE STRUCTURE & SYLLABUS)

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
Built-in Exceptions
d) Write
ite 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
rd 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 JavaFX)
c) Build a Tip Calculator app using several JavaFX components and learn how to respond to
userr interactions with the GUI
 JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY KAKINADA
KAKINADA – 533 003, Andhra Pradesh, India
CSE (IoT and CYBER SECURITY INCLUDING BCT)
(R23-IInd YEAR 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
and to 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, Stat Statements
ements and Expressions,
Variables, Operators, Precedence and Associativity, Data Types, Indentation, Comments,
Reading Input, Print Output, Type Conversions, the type () Function and Is Operator,
Dynamic and Strongly Typed Language.
Control Flow Statements: s: if statement, if-else
if else statement, if...elif…else, Nested if statement,
while Loop, for Loop, continue and break Statements, Catching Exceptions Using try and
except Statement.

Sample Experiments:
1. Write a program to find the largest element among three Numbers.
N
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
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.
Strings:
ings: 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
Built-In Functions
 JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY KAKINADA
KAKINADA – 533 003, Andhra Pradesh, India
CSE (IoT and CYBER SECURITY INCLUDING BCT)
(R23-IInd YEAR COURSE STRUCTURE & SYLLABUS)

Used on Lists, List Methods, del Statement.

Sample 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 bbuilt-in functions by taking any list.

UNIT-III:
Dictionaries: Creating Dictionary, Accessing and Modifying key:value Pairs in Dictionaries,
Built-In
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
In Functions Used on Tuples, Relation between Tuples and Lists,
Relation between Tuples and Dictionaries, Using zip() Function, Sets, Set Methods,
Frozenset.
Sample Experiments:
1. Write
te 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
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
Reading Text Data, File Methods to Read and Write Data,
Reading and Writing Binary Files, Pickle Module, Reading and Writing CSV Files, Python
os and os.path Modules.
Object-Oriented
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.

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
lower words, so any upper-casecase 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, displa
display,
y, append, insert and reverse the order of the items
 JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY KAKINADA
KAKINADA – 533 003, Andhra Pradesh, India
CSE (IoT and CYBER SECURITY INCLUDING BCT)
(R23-IInd YEAR COURSE STRUCTURE & SYLLABUS)

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

Sample 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
hrough 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 attri
attribute
bute 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
Programm Using Python, Y. Daniel Liang, Pearson.

Online Learning Resources/Virtual Labs:

1. https://www.coursera.org/learn/python
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
CSE (IoT and CYBER SECURITY INCLUDING BCT)
(R23-IInd YEAR COURSE STRUCTURE & SYLLABUS)

II Year I Semester L T P C
ENVIRONMENTAL SCIENCE 2 0 0 0

CourseObjectives:
● To make the students to ge tawareness on environment
● To understand the importance of protecting natural resources, ecosystems for future
generations and pollution causes due to the day to day activities of human life
● To save earth from the inventions by the engineers.

CourseOutcomes:
● Grasp multidisciplinary nature of environmental studies and various renewable and
non-renewable
renewable resources.
● Understand flow and bio
bio-geo-chemical cycles and ecological pyramids.
● Understand various causes of pollution and solid waste management and related
preventive measures.
● About the rainwater harvesting, watershed management, ozone layer depletion and
waste landreclamation.
● Casus of population explosion, value education and welfare programmes.

UNIT–I
Multidisciplinary Nature Of Environmental Studies: – Definition, Scope and Importance –
Need forPublicAwareness.
Natural Resources:Renewable and non-renewable
non resources – Natural resources and
associated problems – Forest resources – Use and over – exploitation, deforestation, case
studies – Timberextraction – Mining, dams and other effects on forest and tribal people –
Water resources – Use andover utilization of surface aand ground water – Floods, drought,
conflicts over water, dams – benefits and problems–Mineral Mineral resources:Use and
exploitation, environmental effects of extracting and using mineral resources, case studies
studies–
Food resources:World food problems, changes caused by by agriculture and overgrazing,
effects of modern agriculture, fertilizerfertilizer-pesticide
pesticide problems, water logging,
salinity,casestudies.–Energy
Energy resources:

UNIT–II
Ecosystems: Concep to fan ecosystem.
ecosystem.–Structure
Structure and function of an ecosystem
ecosystem–Producers,
consumers and decomposers – Energy flow in the ecosystem – Ecological succession –
Food chains, food webs and ecological pyramids pyramids–Introduction,
Introduction, types, characteristic
features, structure and function of the following ecosystem:
a. Forest ecosystem.
b. Grassl and ecosystem
c. Desert ecosystem
 JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY KAKINADA
KAKINADA – 533 003, Andhra Pradesh, India
CSE (IoT and CYBER SECURITY INCLUDING BCT)
(R23-IInd YEAR COURSE STRUCTURE & SYLLABUS)

d. Aquatic ecosystems (ponds, streams, lakes, rivers, oceans, estuaries)

Biodiversity And Its Conservation: Introduction Definition: genetic, species and ecosystem
diversity–Bio-geographical
geographical classification of India
India–Value
Value of biodiversity: consumptive
consum use,
Productive use, social, ethical, aesthetic and option values – Biodiversity at global,
National and locallevels – India as a mega-diversity
mega nation – Hot-sports
sports of biodiversity –
Threats to biodiversity: habitat loss,poaching of wildlife, man-wildlife
man dlife conflicts
conflicts–
Endangered and endemic species of India –Conservation of biodiversity:In-situand
situand Ex
Ex-situ
conservation of biodiversity.
UNIT–III
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. Thermal pollution
g. Nuclear hazards
Solid Waste Management: Causes, effects and control measures of urban and industrial
wastes – Roleof an individual in prevention of pollution – Pollution case studies – Disaster
management:
anagement: floods,earthquake,cycloneandlandslides.

UNIT–IV
Social Issues and the Environment: From Unsustainable to Sustainable development
development–
Urban problems related to energy – Water conservation, rain water harvesting, watershed
management –Resettlement and d rehabilitation of people; its problems and concerns. Case
studies – Environmental ethics: Issues and possible solutions
solutions–Climate
Climate change, global
warming, acidrain, ozone layer depletion, nuclear accidents and holocaust. Case Studies –
Wastel and reclamation. – Consumerism and waste products. – Environment Protection
Act. – Air (Prevention and Control of Pollution) Act. –Water
Water (Prevention and control of
Pollution) Act–Wild
Wild life Protection Act Act–Forest Conservation Act–Issues
Issues involved
inenforcement of environment
nt allegislation–Public
allegislation awareness.

UNIT–V
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
Education and
d Child Welfare
Welfare–Role of
information Technology in Environment and human healthhealth–Case
Case studies. Field Work:Visit
to a local area to document environmental assets River/ forest grassland/ hill/ mountain –
Visit to a local polluted site site-Urban/Rural/Industrial/Agricultural
gricultural Study of common
plants,insects, and birds–river,
river, hills lopes,etc..
 JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY KAKINADA
KAKINADA – 533 003, Andhra Pradesh, India
CSE (IoT and CYBER SECURITY INCLUDING BCT)
(R23-IInd YEAR COURSE STRUCTURE & SYLLABUS)

Text books:
1. Text book of Environmental Studies for Undergraduate Courses ErachBharucha for
University Grants Commission,Universities Press.
2. Palaniswamy,“Environmental Studies”,Pearson education
3. S.AzeemUnnisa,“Environmental Studies”Academic Publishing Company
4. K.RaghavanNambiar,“Text book of Environmental Studies for Undergraduate
Courses as per UGC model syllabus”, Scitech Publications (India), Pvt.Ltd.
Reference Books:
1. DeekshaDaveandE.SaiBabaReddy, “Text book of Environmental Science”,Cengage
Publications.
2. M.AnjiReddy,“Text book of Environmental Sciences and
Technology”,BSPublication.
3. J.P.Sharma,Comprehensive Environmental studies,Laxmi publications.
4. J.GlynnHenryandGaryW
J.GlynnHenryandGaryW.Heinke,“Environmental Sciences and
Engineering”,Prentice Hall of India Private limited
5. G.R.Chatwal,“A Text Book of Environmental Studies”Himalaya Publishing House
6. Gilbert M.Masters and WendellP.Ela,“Introduction to Environmental Engineering
and Science,Prentice
entice Hall of India Private limited.
 JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY KAKINADA
KAKINADA – 533 003, Andhra Pradesh, India
CSE (IoT and CYBER SECURITY INCLUDING BCT)
(R23-IInd YEAR COURSE STRUCTURE & SYLLABUS)

L T P C
II Year II Semester 2 0 0 2

MANAGERIAL ECONOMICS AND FINANCIAL ANALYSIS

Course Objectives:
● To inculcate the basic knowledge of micro economics and financial accounting
● To make the students learn how demand is estimated for different products, input-
input
out put relationship for optimizing production and cost
● To Know the Various types of market structure and pricing methods and strategy
● To give an overview on investment appraisal methods to promote the students to
learn how to plan long-terminvestment
terminvestment decisions.
● To provide fundamental skills on accounting and to explain the process of
preparing financial statements.

Course Outcomes:
● Define the concepts related to Managerial Economics, financial
financial accounting and
management.
● Understand the fundament also fEconomicsviz., Demand, Production, cost, revenue
and markets
● Apply the Concept of Production costand revenues for effective Business decision
● Analyze how to invest their capital and maximize returns
● Evaluate the capital budgeting techniques
● Develop the accounting statements and evaluate the financial performance of
businessentity.

UNIT-I
Managerial Economics: Introduction – Nature, meaning, significance, functions, and
advantages. Demand-Concept,
Concept, Function,Law of Demand - Demand Elasticity
Elasticity- Types –
Measurement. Demand Forecasting
Forecasting- Factors governing Forecasting, Methods. Managerial
Economics and Financial Accounting and Management.

UNIT-II
Production and Cost Analysis: Introduction – Nature, meaning, significance, functions and
advantages. Production Function–
Function Least-cost combination– Short run and long run
Production Function- Isoquants and Isocosts, MRTS -Cobb-Douglas
Douglas Production Function -
Laws of Returns - Internal and External Economies of scale.Cost & Break-Even
Even Analysis -
Cost concepts and Cost behaviour
behaviour- Break-Even Analysis (BEA) -Determination
Determination of Break
Break-
Even Point (Simple Problems)
Problems)-Managerial
Managerial significance and limitations ofBreak
ofBreak-
EvenAnalysis.
 JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY KAKINADA
KAKINADA – 533 003, Andhra Pradesh, India
CSE (IoT and CYBER SECURITY INCLUDING BCT)
(R23-IInd YEAR COURSE STRUCTURE & SYLLABUS)

UNIT-III
Businesss Organizations and Markets: Introduction–Nature, Nature, meaning, significance,
functions and advantages.Forms of Business Organizations
Organizations- Sole Proprietary - Partnership -
Joint Stock Companies - Public Sector Enterprises.Types of Markets - Perfect and Imperfect
Competition - Features of Perfect Competition Monopoly-MonopolisticCompetition
Monopoly MonopolisticCompetition–
Oligopoly-Price-Output
Output Determination-Pricing
Determination Methods and Strategies
UNIT-IV
Capital Budgeting: Introduction – Nature, meaning, significance, functions and advantages.
Typess of Working Capital,Components, Sources of ShortShort-term and Long-term
term Capital,
Estimating Working capital requirements. Capital Budgeting
Budgeting–Features,
Features, Proposals, Methods
and Evaluation. Projects– Pay Back Method ,Accounting Rate of Return(ARR) Net Present
Value(NPV)Internal
e(NPV)Internal Rate Return(IRR)
Method (sample problems)

UNIT-V
Financial Accounting and Analysis: Introduction – Nature, meaning, significance, functions
and advantages. Concepts and Conventions
Conventions-Double-Entry
Entry Book Keeping, Journal, Ledger,
Trial Balance-Final
Final Accounts (Trading Account, Profit and Loss Account and Balance Sheet
with simple adjustments).Financial Analysis-Analysis
Analysis Analysis and Interpretation of Liquidity
Ratios,Activity Ratios,and Capital structure Ratios and Profitability.

Textbooks:
1. Varshney &Maheswari:Managerial
eswari:Managerial Economics,Sultan Chand,2013.

Reference Books:
1. Managerial Economics: Principles And Worldwide Applications, 9E (Adaptation) by
Dominick Salvatore and Siddhartha Rastogi
2. Managerial Economics: Principles and Worldwide Applications
by Dominick Salvatore
 JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY KAKINADA
KAKINADA – 533 003, Andhra Pradesh, India
CSE (IoT and CYBER SECURITY INCLUDING BCT)
(R23-IInd YEAR COURSE STRUCTURE & SYLLABUS)

II Year II Semester L T P C
3 0 0 3
NUMBER THEORY AND ITS APPLICATIONS

Course Objectives:
This course enables the students to learn the concepts of number theory and its applications to
information security.
Course Outcomes:
1. Apply the knowledge of GCD and Prime Factorization.
2. Understand principles on congruence
3. Develop the knowledge of congruence applications
4. Understand the finite fields and primality
5. Uevelop various encryption methods and its applications.

UNIT – I: Integers, Greatest common divisors and prime Factorization

The well-ordering property-Divisibility
Divisibility-Representation of integers-Computer
Computer operations with
integers-Prime numbers-Greatest
Greatest common divisors-The
divisors Euclidean algorithm
gorithm -The
fundamental theorem of arithmetic
arithmetic-Factorization
Factorization of integers and the Fermat numbers-Linear
numbers
Diophantine equations
UNIT – II: Congruence:

Introduction to congruence -Linear

Linear congruence
congruence-The
The Chinese remainder theorem-Systems
theorem of
linear congruence
UNIT – III: Applications of Congruence:
Divisibility tests-The
The perpetual calendar-Round-robin
calendar tournaments-Computer
Computer file storage and
hashing functions. Wilson's theorem and Fermat's little theorem
theorem- Pseudo primes-
primes Euler's
theorem- Euler's phi-function- The sum and number of divisors- Perfect numbers and
Mersenne primes.
UNIT – IV: Finite fields & Primality, factoring
Finite fields- quadratic residues and reciprocity
reciprocity-Pseudo primes-rho
rho method
method-Fermat
factorization and factor bases.

UNIT – V: Cryptology
Basic terminology-complexity
complexity theorem
theorem-Character ciphers-Block ciphers-Exponentiation
Exponentiation
ciphers- Public-key
key cryptography
cryptography-Discrete logarithm-Knapsack ciphers- RSA algorithm.

Text Books:
1. Elementary number theory and its applications, Kenneth H Rosen, AT & T
Information systems & Bell laboratories.
2. A course in Number theory & Cryptography, Neal Koblitz, Springer.
 JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY KAKINADA
KAKINADA – 533 003, Andhra Pradesh, India
CSE (IoT and CYBER SECURITY INCLUDING BCT)
(R23-IInd YEAR COURSE STRUCTURE & SYLLABUS)

Reference Books:

1. An Introduction To The Theory Of Numbers, Herbert S. Zuckerman,

Zuckerman Hugh L.
Montgomery, Ivan Niven
Niven, wiley publishers
2. Introduction to Analytic number theory
theory-Tom M Apostol, springer
3. Elementary number theory, VK Krishnan, Universities
Universit press
 JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY KAKINADA
KAKINADA – 533 003, Andhra Pradesh, India
CSE (IoT and CYBER SECURITY INCLUDING BCT)
(R23-IInd YEAR 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 process
management, memory management, file systems, and Protection
 Make use of process scheduling algorithms and synchronization techniques to achieve
better performance of a computer system.
 Illustrate different conditions for deadloc
deadlock and their possible solutions.

UNIT - I
Operating Systems Overview: Introduction, Operating system functions, Operating systems
operations, Computing environments, Free and Open
Open-Source
Source Operating Systems System
Structures: Operating System Services, User and Operating
Operating-System
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
Inter-process
communication. Threads and Concurrency: Multithreading models, Thread libraries,
Threading issues. CPU Scheduling: Basic concepts, Scheduling criteria, Scheduling
Sc
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,
tion, Methods for handling Deadlocks, Deadlock prevention, Deadlock
avoidance, Deadlock detection, Recovery from Deadlock.

UNIT - IV
Memory-Management
Management Strategies: Introduction, Contiguous memory allocation, Paging,
Structure of the Page Table, Swapping. Virtual Memory Management: Introduction,
Demand paging, Copy-on-write,
write, Page replacement, Allocation of frames, Thrashing. Storage
Management: Overview of Mass Storage Structure, HDD Scheduling.

UNIT - V
File System: File System Interface: File concept, Access
Access methods, Directory Structure; File
system Implementation: File-system
File structure, File-system
system Operations, Directory
implementation, Allocation method, Free space management; File File-System
System Internals: File
File-
 JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY KAKINADA
KAKINADA – 533 003, Andhra Pradesh, India
CSE (IoT and CYBER SECURITY INCLUDING BCT)
(R23-IInd YEAR COURSE STRUCTURE & SYLLABUS)

System Mounting, Partitions and Mounting, File Sharing.

Sha 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
Tanen A S, 4th Edition, Pearson , 2016

Reference Books:
Internals and Design Principles, Stallings W, 9th edition, Pearson,
1. Operating Systems -Internals
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
CSE (IoT and CYBER SECURITY INCLUDING BCT)
(R23-IInd YEAR COURSE STRUCTURE & SYLLABUS)

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

DATABASE MANAGEMENT SYSTEMS

Course Objectives:
The main objectives of the course is to
 Introduce database management systems and to give a good formal foundation on the
relational 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 covering
conceptual design, logical design through normalization
 Provide an overview of physical design of a database system, by discussing Database
indexing 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 dat dataa independence; Three tier schema
architecture for data independence; Database system structure, environment, Centralized and
Client Server architecture for the database.
Entity Relationship Model: Introduction, Representation of entities, attributes, enti 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
rtance 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,
nsert, 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),
updatable), relational set operations.

UNIT IV:
Schema Refinement (Normalization):Purpose of Normalizat
Normalization
ion or schema refinement,
concept of functional dependency, normal forms based on functional dependency Lossless
 JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY KAKINADA
KAKINADA – 533 003, Andhra Pradesh, India
CSE (IoT and CYBER SECURITY INCLUDING BCT)
(R23-IInd YEAR COURSE STRUCTURE & SYLLABUS)

join and dependency preserving decomposition, (1NF, 2NF and 3 NF), concept of surrogate
key, Boyce-Codd
Codd normal form(BCNF), MVD, Fourth normal form(4NF),
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
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,
Sudarsan TMH (For
Chapter 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,
Corlos Coronel, 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_012758066672820
22456_shared/overview
 JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY KAKINADA
KAKINADA – 533 003, Andhra Pradesh, India
CSE (IoT and CYBER SECURITY INCLUDING BCT)
(R23-IInd YEAR COURSE STRUCTURE & SYLLABUS)

II Year II Semester L T P C
COMPUTER NETWORKS 3 0 0 3

Course Objectives:
The main objectives of the course is to
 To understand the different types of networks
 To discuss the software and hardware components of a network
 To develop an understanding the principles of computer networks.
 To familiarize with OSI model and the funct
functions of layered structure.
 To explain networking protocols, algorithms and design perspectives

UNIT I:
Introduction:Types
Types of Computer Networks, Broadband Access Networks, Mobile and
Wireless Access Networks, Content Provider Networks, Transit networks, Enterprise
Networks, Network technology from local to global, Personal Area Networks, Local Area
Networks, Home Networks, Metropolitan Area Networks, Wide Area Networks,
Internetworks, Network Protocols, Design Goals, Protocol Layering, Connections and
Reliability,
iability, Service Primitives, The Relationship of Services to Protocols ,Reference Models,
The OSI Reference Model, The TCP/IP Reference Model, A Critique of the OSI Model and
Protocols, A Critique of the TCP/IP Reference Model and Protocols.

UNIT II:
The Data Link Layer: Guided Transmission Media, Persistent Storage, Twisted Pairs,
Coaxial Cable, Power Lines, Fiber Optics, Data Link Layer Design Issues, Services Provided
To The Network Layer, Framing Error Control, Flow Control, Error Detection And
Correction, Error-Correcting
Correcting Codes, Error-Detecting
Error Detecting Codes, Elementary Data Link Protocols,
Initial Simplifying Assumptions Basic Transmission And Receipt, Simplex Link Link-Layer
Protocols, Improving Efficiency, Bidirectional Transmission, Multiple Frames In Flight,
Examples Of Full-Duplex,
Duplex, Sliding Window Protocols, The Channel Allocation Problem,
Static Channel Allocation, Assumptions For Dynamic Channel Allocation, Multiple Access
Protocols, Aloha, Carrier Sense Multiple Access Protocols, Collision-Free
Collision Free Protocols,
Limited-Contention
Contention Protocols, Wireless LAN Protocols, Ethernet, Classic Ethernet Physical
Layer, Classic Ethernet Mac Sublayer Protocol, Ethernet Performance, Switched Ethernet,
Fast Ethernet, Gigabit Ethernet, 10 10-Gigabit Ethernet,40- And 100-Gigabit
Gigabit Ethern
Ethernet,
Retrospective On Ethernet.

UNIT III:
The Network Layer: Network Layer Design Issues, Store-And-Forward
Store Forward Packet Switching,
Services Provided To The Transport Layer, Implementation Of Connectionless Service,
Implementation Of Connection
Connection-Oriented Service, Comparison Of Virtual--Circuit And
 JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY KAKINADA
KAKINADA – 533 003, Andhra Pradesh, India
CSE (IoT and CYBER SECURITY INCLUDING BCT)
(R23-IInd YEAR COURSE STRUCTURE & SYLLABUS)

Datagram Networks, Routing Algorithms In A Single Network, The Optimality Principle,

Shortest Path Algorithm, Flooding, Distance Vector Routing, Link State Routing,
Hierarchical Routing Within a Network, Broadcast Routing,
Routing, Multicast Routing, Anycast
Routing, Traffic Management at The Network Layer, The Need for Traffic Management:
Congestion, Approaches To Traffic Management, Internetworking, Internetworks: An
Overview, How Networks differ, Connecting Heterogeneous Network Networks,
s, Connecting
Endpoints Across Heterogeneous Networks, Internetwork Routing: Routing Across Multiple
Networks Supporting Different Packet Sizes: Packet Fragmentation, The Network Layer In
The Internet, The IP Version 4 Protocol, IP Addresses, IP Version 6, Internet Control
Protocols, Label Switching and MPLS, OSPF
OSPF—An An Interior Gateway Routing Protocol,
BGP—TheThe Exterior Gateway Routing Protocol, Internet Multicasting.

UNIT IV:
The Transport Layer: The Transport Service, Services Provided To The Upper Layers,
Transport Service Primitives, Berkeley Sockets, An Example Of Socket Programming: An
Internet File Server, Elements Of Transport Protocols, Addressing, Connection
Establishment, Connection Release, Error Control And Flow Control, Multiplexing, Crash
Recovery,
ery, Congestion Control, Desirable Bandwidth Allocation, Regulating The Sending
Rate, Wireless Issues, The Internet Transport Protocols: UDP, Introduction To UDP, Remote
Procedure Call, Real-Time
Time Transport Protocols, The Internet Transport Protocols: TCP,
Introduction To TCP, The TCP Service Model, The TCP Protocol, The TCP Segment
Header, TCP Connection Establishment, TCP Connection Release.

UNIT V:
The Application Layer: Electronic Mail, Architecture and Services, The User Agent,
Message Formats, Message Transfer, Final Delivery, The World Wide Web, Architectural
Overview, Static Web Objects, Dynamic Web Pages and Web Applications, HTTP and
HTTPS, Web Privacy, Content Delivery, Content and Internet Traffic, Server Farms and Web
Proxies, Content Delivery Networks,
etworks, Peer
Peer-To-Peer
Peer Networks, Evolution of The Internet.

Text Books:
1. Andrew Tanenbaum, Feamster Wetherall, Computer Networks, 6th Edition, Global
Edition.

Reference Books:
1. Behrouz A. Forouzan, Data Communications and Networking, 5th Edition, McGraw
Hill Publication, 2017.
2. James F. Kurose, Keith W. Ross, “Computer Networking: A Top
Top-Down
Down Approach”,
th
6 edition, Pearson, 2019.
3. Youlu Zheng, Shakil Akthar, “Networks for Computer Scientists and Engineers”,
 JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY KAKINADA
KAKINADA – 533 003, Andhra Pradesh, India
CSE (IoT and CYBER SECURITY INCLUDING BCT)
(R23-IInd YEAR COURSE STRUCTURE & SYLLABUS)

Oxford Publishers, 2016.

Web-Resources:
https://nptel.ac.in/courses/106105183/25
http://www.nptelvideos.in/2012/11/computer
http://www.nptelvideos.in/2012/11/computer-networks.html
https://nptel.ac.in/courses/106105183/3
 JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY KAKINADA
KAKINADA – 533 003, Andhra Pradesh, India
CSE (IoT and CYBER SECURITY INCLUDING BCT)
(R23-IInd YEAR COURSE STRUCTURE & SYLLABUS)

II year II Semester L T P C
0 0 3 1.5
COMPUTER NETWORKS AND OPERATING SYSTEMS LAB
Course Objectives:
 Tounderstandthedifferenttypesofnetworks
 Todiscussthesoftwareandhardwarecomponentsofa network
 Toenlightentheworkingofnetworkingcommandssupportedby operatingsystem
 TofamiliarizetheuseofnetworkingfunctionalitysupportedbyJAVA
 To familiarize with computer networking tools.
tools

Course Outcomes:
After completion of the course, students will be able to
1. Analyze the data traffic using network tools (L4)
2. Understand network commands (L2)
3. Trace different CPU Scheduling algorithms (L2).
4. Implement Bankers Algorithms to Avoid Dead Locks (L3).
5. Evaluate CPU scheduling and Page replacement algorithms (L5).

List of Activities/Experiments (Computer Networks):

1. Study different types of Network cables (Copper and Fiber) and prepare cables
(Straight and Cross) to connect Two or more systems. Use crimping tool to connect
jacks. Use LAN tester to connect the cables.
- Install and configure Network Devices: HUB, Switch and Routers. Consider
both manageable and nonnon-manageable
manageable switches. Do the logical configuration
of the system. Set the bandwidth of different ports.
- Install and Configure Wired and Wireless NIC and transfer files between
systems in Wired LAN and Wireless LAN. Consider both ad adhoc and
infrastructure mode of operation.
2. Work with the commands Ping, Tracert, Ipconfig, pathping, telnet, ftp, getmac, ARP,
Hostname, Nbtstat, netdiag, and Nslookup
3. Use Packet tracer software to build network topology and configure using Distance
vector routing protocol.
4. Use Packet tracer software to build network topology and configure using Link State
routing protocol.
5. Using JAVA RMI Write a program to implement Basic Calculator.
6. Implement a Chatting application using JAVA TCP and UDP sockets.
7. Hello commandmand is used to know whether the machine at the other end is working or
not. Echo command is used to measure the round
round-trip
trip time to the neighbor. Implement
Hello and Echo commands using JAVA.
8. Using Wireshark perform the following operations:
- Inspect HTTP Traffic
 JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY KAKINADA
KAKINADA – 533 003, Andhra Pradesh, India
CSE (IoT and CYBER SECURITY INCLUDING BCT)
(R23-IInd YEAR COURSE STRUCTURE & SYLLABUS)

- Inspect HTTP Traffic from a Given IP Address,

- Inspect HTTP Traffic to a Given IP Address,
- Reject Packets to Given IP Address,
- Monitor Apache and MySQL Network Traffic.
Experiments covering the Topics:
 UNIX fundamentals, commands & system calls c
 CPU Scheduling algorithms, thread processing
 IPC, semaphores, monitors, deadlocks
 Page replacement algorithms, file allocation strategies
 Memory allocation strategies

Sample Experiments:
1. Practicing of Basic UNIX Commands.
2. Write programs using the following UNIX operating system calls
fork, exec, getpid, exit, wait, close, stat, opendir and readdir
3. Simulate the following CPU scheduling algorithms
a) FCFS b) SJF c) Priority d) Round Robin
4. Write a program to solve producer
producer-consumer problem using Semaphores.
5. Implement the following memory allocation methods for fixed partition
a) First fit b) Worst fit c) Best fit
6. Simulate the following page replacement algorithms
a) FIFO b) LRU c) LFU
7. Simulate Paging Technique of memory management.
8. Implement Bankers Algorithm for Dead Lock avoidance

Text Books:
1. ShivendraS.Panwar, Shiwen Mao, Jeong Jeong-dong
dong Ryoo, and Yihan Li, “TCP/IP
Essentials:A Lab-Based
Based Approach”, Cambridge University Press, 2004.
Silberschatz A, Galvin P B, Gagne G, 10th Edition,
2. Operating System Concepts, Silberschatz
Wiley, 2018.
Reference Books
1. Cisco Networking Academy, “CCNA1 and CCNA2 Companion Guide”, Cisco
Networking Academy Program, 3rd edition, 2003.
2. Elloitte Rusty Harold, “Java Network Programming”, 3rd edition, O’REILLY,
O’REI 2011.
th
3. Modern Operating Systems, Tanenbaum A S, 4 Edition, Pearson, 2016

Online Learning Resources:

1. https://www.netacad.com/courses/packet
https://www.netacad.com/courses/packet-tracer - Cisco Packet Tracer.
2. Ns Manual, Available at: https://www.isi.edu/nsnam/ns/ns
https://www.isi.edu/nsnam/ns/ns-documentation.html,
documentation.html, 2011.
3. https://www.wireshark.org/docs/wsug_html_chunked/ -Wireshark.
4. https://nptel.ac.in/courses/106105183/25
.ac.in/courses/106105183/25
 JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY KAKINADA
KAKINADA – 533 003, Andhra Pradesh, India
CSE (IoT and CYBER SECURITY INCLUDING BCT)
(R23-IInd YEAR COURSE STRUCTURE & SYLLABUS)

5. http://www.nptelvideos.in/2012/11/computer
http://www.nptelvideos.in/2012/11/computer-networks.html
6. https://nptel.ac.in/courses/106105183/3
7. http://vlabs.iitb.ac.in/vlabs
http://vlabs.iitb.ac.in/vlabs-dev/labs_local/computer-networks/labs/explist.php
networks/labs/explist.php
8. https://www.cse.iitb.ac.in/~mythili/os/
9. http://peterindia.net/OperatingSystems.html
 JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY KAKINADA
KAKINADA – 533 003, Andhra Pradesh, India
CSE (IoT and CYBER SECURITY INCLUDING BCT)
(R23-IInd YEAR COURSE STRUCTURE & SYLLABUS)

L T P C
II Year II Semester 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
built functions,
 PL/SQL programming- control structures
 Procedures,
rocedures, Functions, Cursors, Triggers,
 Database connectivity- ODBC/JDBC

Sample Experiments:
1. Creation, altering and droping of tables and inserting rows into a table (use constraints
while 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,
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
Handling section (Ex. Student marks can be
selected from the table and printed for those who 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, CAS CASE E and CASE
expression. The program can be extended using the NULLIF and COALESCE
functions.
 JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY KAKINADA
KAKINADA – 533 003, Andhra Pradesh, India
CSE (IoT and CYBER SECURITY INCLUDING BCT)
(R23-IInd YEAR COURSE STRUCTURE & SYLLABUS)

7. Program development using WHILE LOOPS, numeric FOR LOOPS, nested loops
using ERROR Handling, BUILT –IN IN Exceptions, USE defined Exceptions, RAISE-
RAISE
APPLICATION ERROR
ERROR.
8. Programs development using creation of procedures, passing parameters IN and OUT
of PROCEDURES.
9. Program development using creation of stored functions, invoke functions in SQL
Statements and write complex functions.
10. Develop programs using features parameters
parameters in a CURSOR, FOR UPDATE
CURSOR, WHERE CURRENT of clause and CURSOR variables.
11. Develop Programs using BEFORE and AFTER Triggers, Row and Statement
Triggers and INSTEAD OF Triggers

12. Create a table and perform the search operation on table using indexing
indexing and nonnon-
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
CSE (IoT and CYBER SECURITY INCLUDING BCT)
(R23-IInd YEAR COURSE STRUCTURE & SYLLABUS)

II Year II Semester L T P C
0 1 2 2
FULL STACK DEVELOPMENT – 1
(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, PrePre-defined and User-defined
defined Objects
 JavaScript Functions
ctions 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 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 tthumbnail
humbnail 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>, <td> and attributes: border, rowspan, colspan)
 JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY KAKINADA
KAKINADA – 533 003, Andhra Pradesh, India
CSE (IoT and CYBER SECURITY INCLUDING BCT)
(R23-IInd YEAR COURSE STRUCTURE & SYLLABUS)

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.
re 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 ake sure of using “no frame” attribute
such that frames 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>, <di
<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 and value).

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
descendant, child, adjacent sibling, general sibling)
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 page, tilting it
horizontally. 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
text-transformation vi. text-alignment
d. Write a program, to explain the importance of CSS Box model using
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.
 JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY KAKINADA
KAKINADA – 533 003, Andhra Pradesh, India
CSE (IoT and CYBER SECURITY INCLUDING BCT)
(R23-IInd YEAR COURSE STRUCTURE & SYLLABUS)

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
defined and User-defined
User Objects

a. Write a program usingdocument

ngdocument object properties and methods.
b. Write a program using
ng window oobject properties and methods.
c. Write a program usingarray
ngarray object properties and methods.
d. Write a program usingmath
ngmath object properties and methods.
e. Write a program usingstring
ngstring object properties and methods.
f. Write a program usingregex
ngregex object properties and methods.
g. Write a program usingdate
ngdate object properties and methods.
h. Write a program to explain user
user-defined
defined object by using properties, methods, accessors,
constructors and display.

8. JavaScript Conditional Statements and Loops

a. Write a program which asks the 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 do-while
while loops.
d. Write aprogram to print data in object using forfor-in, for-each and for-of
of loops
e. Develop a program to determine whether a gi given
ven 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,
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,
100’s, 11-50’s, 1- 10’s, 1-2’s & 1-1’s)

9. Javascript Functions and Events

a. Design a 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
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 be
called to display
i. Factorial of that number
 JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY KAKINADA
KAKINADA – 533 003, Andhra Pradesh, India
CSE (IoT and CYBER SECURITY INCLUDING BCT)
(R23-IInd YEAR COURSE STRUCTURE & SYLLABUS)

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 length
should not be less than 6 characters)
ii. Mobile (only numbers and length 10 digits)
iii. E-mail
mail (should contain format like [email protected])

10. Node.js
a. Write a program to show the workflow of JavaScript code executable by creating web
server 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
user defined module and show the workflow of
Modularization of application using Node.js

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

Web Links:
https://www.w3schools.com/html
/html
https://www.w3schools.com/css
https://www.w3schools.com/js/
https://www.w3schools.com/nodejs
https://www.w3schools.com/typescript
 JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY KAKINADA
KAKINADA – 533 003, Andhra Pradesh, India
CSE (IoT and CYBER SECURITY INCLUDING BCT)
(R23-IInd YEAR COURSE STRUCTURE & SYLLABUS)

II Year II Semester L T P C
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 product 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
of Design Thinking, New materials iin 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,
rainstorming, 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,
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 princ
principles that
redefine business – Business challenges: Growth, Predictability, Change, Maintaining
Relevance, Extreme competition, Standardization. Design thinking to meet corporate needs.
Design thinking for Startups. Defining and testing Business Models and Business Cases.
Developing & testing prototypes.
 JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY KAKINADA
KAKINADA – 533 003, Andhra Pradesh, India
CSE (IoT and CYBER SECURITY INCLUDING BCT)
(R23-IInd YEAR COURSE STRUCTURE & SYLLABUS)

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