R-20 Syllabus for CSE, JNTUK w. e. f.

2020 – 21

JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY KAKINADA

KAKINADA – 533 003, Andhra Pradesh, India

DEPARTMENT OF COMPUTER SCIENCE & ENGINEERING

COURSE STRUCTURE AND SYLLABUS

For UG –R20

B. TECH - COMPUTER SCIENCE & ENGINEERING

(Applicable for batches admitted from 2020-2021)

JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY KAKINADA

KAKINADA - 533 003, Andhra Pradesh, India

 R-20 Syllabus for CSE, JNTUK w. e. f. 2020 – 21

JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY KAKINADA

KAKINADA – 533 003, Andhra Pradesh, India

DEPARTMENT OF COMPUTER SCIENCE & ENGINEERING

II Year – I SEMESTER
Course
S. No Courses L T P Credits
Code
1 BS Mathematics III 3 0 0 3
2 CS Object Oriented Programming through C++ 3 0 0 3
3 CS Operating Systems 3 0 0 3
4 CS Software Engineering 3 0 0 3
5 CS Mathematical Foundations of Computer Science 3 0 0 3
6 CS Object Oriented Programming through C++ Lab 0 0 3 1.5
7 CS Operating Systems Lab 0 0 3 1.5
8 CS Software Engineering Lab 0 0 3 1.5
Skill oriented Course - I
Applications of Python-NumPy OR
9 SO 0 0 4 2
2) Web Application Development Using
Full Stack -Frontend Development – Module-I
10 MC Constitution of India 2 0 0 0
Total Credits 21.5

II Year – II SEMESTER
Course
S. No Courses L T P Credits
Code
1 BS Probability and Statistics 3 0 0 3
2 CS Database Management Systems 3 0 0 3
3 CS Formal Languages and Automata Theory 3 0 0 3
4 ES Java Programming 3 0 0 3
5 HS Managerial Economics and Financial Accountancy 3 0 0 3
6 CS Database Management Systems Lab 0 0 2 1
7 CS R Programming Lab 0 1 2 2
8 ES Java Programming Lab 0 0 3 1.5
Skill Oriented Course - II
Applications of Python-Pandas OR
9 SO 2) Web Application Development Using 0 0 4 2
Full Stack -Frontend Development –Module-II
Total Credits 21.5
10 Minor Operating Systems$ 3 0 2 3+1
11 Honors Any course from the Pool, as per the opted track 4 0 0 4
$- Integrated Course
 R-20 Syllabus for CSE, JNTUK w. e. f. 2020 – 21

JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY KAKINADA

KAKINADA – 533 003, Andhra Pradesh, India

DEPARTMENT OF COMPUTER SCIENCE & ENGINEERING

III B. Tech – I Semester

S.No Course Code Courses Hours per week Credits
L T P C
1 PC Computer Networks 3 0 0 3
2 PC Design and Analysis of Algorithms 3 0 0 3
3 PC Data Warehousing and Data Mining 3 0 0 3
Open Elective-I
Open Elective / Open Electives offered by other departments/
4 3 0 0 3
Job Oriented Optimization in Operations Research
(Job oriented course)
Professional Elective-I
Artificial Intelligence
5 PE Software Project Management 3 0 0 3
Distributed Systems
Advanced Unix Programming
6 PC Data Warehousing and Data Mining Lab 0 0 3 1.5
7 PC Computer Networks Lab 0 0 3 1.5
Skill Oriented Course – III
1. Animation course: Animation Design OR
8 SO 0 0 4 2
2.Continuous Integration and Continuous
Delivery using DevOps
9 MC Employability Skills-I 2 0 0 0
Summer Internship 2 Months
10 PR (Mandatory) after second year (to be 0 0 0 1.5
evaluated during V semester
Total credits 21.5
11 Minor Database Management Systems$ 3 0 2 3+1
Any course from the Pool, as per the opted
12 Honors 4 0 0 4
track
$- Integrated Course
 R-20 Syllabus for CSE, JNTUK w. e. f. 2020 – 21

JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY KAKINADA

KAKINADA – 533 003, Andhra Pradesh, India

DEPARTMENT OF COMPUTER SCIENCE & ENGINEERING

III B. Tech – II Semester

Course
S.No Courses Hours per week Credits
Code
L T P C
1 PC Machine Learning 3 0 0 3
2 PC Compiler Design 3 0 0 3
3 PC Cryptography and Network Security 3 0 0 3
Professional Elective-II
1.Mobile Computing
2.Big Data Analytics
4 PE 3 0 0 3
3.Object Oriented Analysis and
Design
4.Network Programming
Open Open Elective-II
Elective Open Electives offered by other
5 3 0 0 3
/Job departments/
Oriented MEAN Stack Development (Job Oriented)
6 PC Machine Learning using Python Lab 0 0 3 1.5
7 PC Compiler Design Lab 0 0 3 1.5
8 PC Cryptography and Network Security Lab 0 0 3 1.5
Skill Oriented Course - IV
1.Big Data:Spark OR
9 SO 2.MEAN Stack Technologies-Module I 0 0 4 2
(HTML 5, JavaScript, Node.js, Express.js
and TypeScript)
10 MC Employability skills-II 2 0 0 0
Total credits 21.5
Industrial/Research Internship(Mandatory) 2 Months during summer vacation
11 Minor Data Structures and Algorithms$ 3 0 2 3+1
Any course from the Pool, as per the opted
12 Honors 4 0 0 4
track
Minor course through SWAYAM - - - 2
$- Integrated Course
 R-20 Syllabus for CSE, JNTUK w. e. f. 2020 – 21

JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY KAKINADA

KAKINADA – 533 003, Andhra Pradesh, India

DEPARTMENT OF COMPUTER SCIENCE & ENGINEERING

IV B. Tech –I Semester
S.No Course Code Course Title Hoursperweek Credits
L T P C
Professional Elective-III
1.Cloud Computing
1 PE 2.Neural Networks and Soft Computing 3 0 0 3
3.Ad-hoc and Sensor Networks
4.Cyber Security & Forensics
Professional Elective-IV
1. Deep Learning Techniques
2 PE 2. Social Networks & Semantic Web 3 0 0 3
3. Computer Vision
4.MOOCS-NPTEL/SWAYAM%
Professional Elective-V
1.Block-Chain Technologies
3 PE 2.Wireless Network Security 3 0 0 3
3.Ethical Hacking
4.MOOCS-NPTEL/SWAYAM%
Open Elective-III
Open Elective
4 Open Electives offered by other departments/ 3 0 0 3
/Job Oriented
API and Microservices (Job Oriented Course)
Open Elective-IV
Open Elective Open Electives offered by other departments/
5 3 0 0 3
/Job Oriented Secure Coding Techniques (Job Oriented
Course)
Universal Human Values 2: Understanding
6 HS 3 0 0 3
Harmony
1.PYTHON: Deep Learning OR
2.MEAN Stack Technologies-Module II-
7 SO 0 0 4 2
Angular JS and MongoDB OR
3.APSSDC offered Courses
Industrial/Research Internship 2 months
8 PR (Mandatory) after third year (to be 0 0 0 3
evaluated during VII semester
Total credits 23
Software Engineering$ / any other from PART-
11 Minor 3 0 2 3+1
B (For Minor)
Any course from the Pool, as per the opted
12 Honors 4 0 0 4
track
Minor course through SWAYAM - - - 2
$- Integrated Course
% - MOOC Course
 R-20 Syllabus for CSE, JNTUK w. e. f. 2020 – 21

JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY KAKINADA

KAKINADA – 533 003, Andhra Pradesh, India

DEPARTMENT OF COMPUTER SCIENCE & ENGINEERING

IV B. Tech –II Semester

S.No Course Code Course Title Hours per week Credits
L T P C
1 Project Major Project Work, Seminar Internship - - - 12
Total credits 12

Note:
1. For integrated courses: Theory and laboratory exams will be conducted separately, and the
student concern will get credits if successfully completes both theory and laboratory. Only external
exam will be conducted for Laboratory component. Credit based weightage shall be considered
while awarding the grade.
2. For MOOC courses: Based on the students interest, student can register and complete a 12 week
course one year in advance, by prior information to the concern.
 R-20 Syllabus for CSE, JNTUK w. e. f. 2020 – 21

JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY KAKINADA

KAKINADA – 533 003, Andhra Pradesh, India

DEPARTMENT OF COMPUTER SCIENCE & ENGINEERING

SUGGESTED COURSES FOR HONORS PROGRAM

POOL1- AI & ML POOL2- Systems Engineering

1. Mathematics for Machine Learning 1. Internet of Things
2. Text Mining and Time Series Analysis 2. Data Communications and Information
3. Natural Language Processing Coding Theory
4. Reinforcement Learning 3. Service Oriented Architectures
4. Design of Secure Protocols
5. Network Coding

POOL3- Information Security POOL4 – Data Science

1. Data Visualization
1. Principles of Cyber Security 2. Statistical Foundations for Data Science
2. Computational Number Theory 3. Mining Massive Data Sets
3. Cryptanalysis 4. Medical Image Data Processing
4. Elliptic Curve Cryptography
5. Introduction to Quantum Computing
and Quantum Cryptography
6. Public Key Infrastructure and
Trust Management
7. Information Security Analysis and
Audit
6. Cloud and IoT Security
7. Web Security
8. Block Chain Architecture Design and
Use Cases
 R-20 Syllabus for CSE, JNTUK w. e. f. 2020 – 21

JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY KAKINADA

KAKINADA – 533 003, Andhra Pradesh, India

DEPARTMENT OF COMPUTER SCIENCE & ENGINEERING

SUGGESTED COURSES MINOR ENGINEERING IN CSE

Note:
1. Any THREE courses need to be studied from PART-A.
2. Any ONE course need to be studied from PART-B.
3. TWO, NPTEL courses of EIGHT week duration covering a total of 4 credits (offered by CSE
Department only), Student can register at any time after the completion of II B.Tech. I Sem.
4. Students can pursue suggested MOOC Courses via NPTEL from II B.Tech II Sem and onwards,
by prior information to the concern.

Eligibility for Minor in CSE:

PART A
Course available
S.No Subject L-T-P Credits NPTEL Link
in NPTEL
https://onlinecourses.sw
1 Operating Systems 3-0-2 4 Operating Systems ayam2.ac.in/cec21_cs20
/preview
https://onlinecourses.sw
Data Structures
ayam2.ac.in/cec22_cs10
Programming, Data
Data Structures and /preview
2 3-0-2 4 Structures and
Algorithms https://onlinecourses.npt
Algorithms using
el.ac.in/noc22_cs26/pre
Python
view
https://onlinecourses.sw
Software
3 Software Engineering 3-0-2 4 ayam2.ac.in/cec21_cs21
Engineering
/preview
https://onlinecourses.sw
4 Computer Networks 3-0-2 4 Computer Networks ayam2.ac.in/cec22_cs05
/preview
Data Base
https://onlinecourses.npt
Database Management Management
5 3-0-2 4 el.ac.in/noc22_cs51/pre
Systems System (noc22-
view
cs51)
PART B
Course
S.No Subject L-T-P Credits available in NPTEL Link
NPTEL
Physics through https://onlinecourses.
1 Computational Thinking 4-0-0 4 Computational nptel.ac.in/noc22_ph
Thinking 12/preview
Object Oriented Programming
2 3-0-2 4
through JAVA
https://onlinecourses.
Data Analytics
3 Data Analytics using Python 3-0-2 4 nptel.ac.in/noc22_cs
with Python
8/ preview
Artificial 1. https://onlinecour
Intelligence: ses.nptel.ac.in/no
4 Artificial Intelligence 4-0-0 4 Knowledge c22_cs56/previe
Representation w
And Reasoning 2. https://onlinecour
 R-20 Syllabus for CSE, JNTUK w. e. f. 2020 – 21

JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY KAKINADA

KAKINADA – 533 003, Andhra Pradesh, India

DEPARTMENT OF COMPUTER SCIENCE & ENGINEERING

(noc22-cs02), ses.swayam2.ac.i
An Introduction to n/cec21_cs08/pre
Artificial view
Intelligence
(noc22-cs56),
AI: Constraint
Satisfaction
(noc22-cs06)
5 Unix and Shell Programming 3-0-2 4
1. https://onlinecour
Cloud Computing
ses.nptel.ac.in/no
and Distributed
c22_cs18/previe
Systems (noc22-
w
6 Cloud Computing 4-0-0 4 cs18),
2. https://onlinecour
Cloud
ses.nptel.ac.in/no
computing(noc22-
c22_cs20/previe
cs20)
w
 R-20 Syllabus for CSE, JNTUK w. e. f. 2020 – 21

JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY KAKINADA

KAKINADA – 533 003, Andhra Pradesh, India

DEPARTMENT OF COMPUTER SCIENCE & ENGINEERING

Open Electives to be offered by CSE for other Branches:

Open Elective-I: Open Elective-II:
1. Data Structures 1. Python Programming
2. Object Oriented Programming through 2. Web Technologies
JAVA 3. Soft Computing
3. Data Base Management Systems 4. Distributed Computing
4. Computer Graphics 5. AI and ML for Robotics
5. Advanced UNIX Programming 6. Computer Networks
6. Computer Organization and Architecture 7. Big Data Analytics
7. Operating Systems 8. Computational Tools

Open Elective-III: Open Elective-IV:

1. AI Tools & Techniques 1. MEAN Stack Technologies
2. Image Processing 2. Deep Learning Techniques
3. Information Security 3. Cloud computing with AWS
4. Mobile Application Development 4. Block Chain Technologies
5. Data Science 5. Cryptography & Network Security
6. Cyber Security 6. Introduction to Machine Learning
7. Introduction to Internet of Things 7. Machine Learning with Python
 R-20 Syllabus for CSE, JNTUK w. e. f. 2020 – 21

JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY KAKINADA

KAKINADA – 533 003, Andhra Pradesh, India

DEPARTMENT OF COMPUTER SCIENCE & ENGINEERING

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

Course Objectives:
x To familiarize the students with the foundations of probability and statistical methods
x 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
● Classify the concepts of data science and its importance (L4) or (L2)
● Interpret the association of characteristics and through correlation and regression tools
(L4)
● Make use of the concepts of probability and their applications (L3)
● Apply discrete and continuous probability distributions (L3)
● Design the components of a classical hypothesis test (L6)
● 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 (spread or variance) – Skewness
Kurtosis.

UNIT II
Correlation and Curve fitting: Correlation – correlation coefficient – rank correlation –
regression coefficients and properties – regression lines – Method of least squares – Straight
line – parabola – Exponential – Power curves.

UNIT III
Probability and Distributions: Probability – Conditional probability and Baye’s theorem –
Random variables – Discrete and Continuous random variables – Distribution function –
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) – Central limit theorem (without proof) – Introduction to t,
F 2 and F-distributions – Point and Interval estimations – Maximum error of estimate.
 R-20 Syllabus for CSE, JNTUK w. e. f. 2020 – 21

JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY KAKINADA

KAKINADA – 533 003, Andhra Pradesh, India

DEPARTMENT OF COMPUTER SCIENCE & ENGINEERING

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 – Tests concerning one
mean and two means (Large and Small samples) – Tests on proportions.

Text Books:
1) Miller and Freund’s, Probability and Statistics for Engineers,7/e, Pearson, 2008.
2) S. C. Gupta and V.K. Kapoor, Fundamentals of Mathematical Statistics, 11/e, Sultan
Chand & Sons Publications, 2012.

Reference Books:
1) Shron L. Myers, Keying Ye, Ronald E Walpole, Probability and Statistics Engineers
and the Scientists,8th Edition, Pearson 2007.
2) Jay l. Devore, Probability and Statistics for Engineering and the Sciences, 8th Edition,
Cengage.
3) Sheldon M. Ross, Introduction to probability and statistics Engineers and the
Scientists, 4th Edition, Academic Foundation, 2011.
4) Johannes Ledolter and Robert V. Hogg, Applied statistics for Engineers and Physical
Scientists, 3rd Edition, Pearson, 2010.
 R-20 Syllabus for CSE, JNTUK w. e. f. 2020 – 21

JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY KAKINADA

KAKINADA – 533 003, Andhra Pradesh, India

DEPARTMENT OF COMPUTER SCIENCE & ENGINEERING

L T P C
II Year – II Semester
3 0 0 3
DATABASE MANAGEMENT SYSTEMS

Course Objectives:
x To introduce about database management systems
x To give a good formal foundation on the relational model of data and usage of Relational
Algebra
x To introduce the concepts of basic SQL as a universal Database language
x To demonstrate the principles behind systematic database design approaches by covering
conceptual design, logical design through normalization
x To provide an overview of physical design of a database system, by discussing Database
indexing techniques and storage techniques

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

x Describe a relational database and object-oriented database

x Create, maintain and manipulate a relational database using SQL
x Describe ER model and normalization for database design
x Examine issues in data storage and query processing and can formulate appropriate solutions
x Outline the role and issues in management of data such as efficiency, privacy, security, ethical
responsibility, and strategic advantage

UNIT I
Introduction: Database system, Characteristics (Database Vs File System), Database Users(Actors on
Scene, Workers behind the scene), 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 Server architecture for the database.

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 BASIC SQL: Simple Database schema, data types, table definitions (create, alter),
different DML operations (insert, delete, update), basic SQL querying (select and project) using
where clause, arithmetic & logical operations, SQL functions(Date and Time, Numeric, String
conversion).

UNIT III
Entity Relationship Model: Introduction, Representation of entities, attributes, entity set, relationship,
relationship set, constraints, sub classes, super class, inheritance, specialization, generalization using
ER Diagrams. SQL: 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.
 R-20 Syllabus for CSE, JNTUK w. e. f. 2020 – 21

JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY KAKINADA

KAKINADA – 533 003, Andhra Pradesh, India

DEPARTMENT OF COMPUTER SCIENCE & ENGINEERING

UNIT IV
Schema Refinement (Normalization): Purpose of Normalization or schema refinement, concept of
functional dependency, normal forms based on functional dependency(1NF, 2NF and 3 NF), concept
of surrogate key, Boyce-codd normal form(BCNF), Lossless join and dependency preserving
decomposition, Fourth normal form(4NF), Fifth Normal Form (5NF).

UNIT V
Transaction Concept: Transaction State, Implementation of Atomicity and Durability, Concurrent
Executions, Serializability, Recoverability, Implementation of Isolation, Testing for Serializability,
Failure Classification, Storage, Recovery and Atomicity, Recovery algorithm.
Indexing Techniques: B+ Trees: Search, Insert, Delete algorithms, File Organization and Indexing,
Cluster Indexes, Primary and Secondary Indexes , Index data Structures, Hash Based Indexing: Tree
base Indexing ,Comparison of File Organizations, Indexes and Performance Tuning

Text Books:
1) Database Management Systems, 3/e, Raghurama Krishnan, Johannes Gehrke, TMH
2) Database System Concepts,5/e, Silberschatz, Korth, TMH

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

e-Resources:
1) https://nptel.ac.in/courses/106/105/106105175/
2) https://www.geeksforgeeks.org/introduction-to-nosql/
 R-20 Syllabus for CSE, JNTUK w. e. f. 2020 – 21

JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY KAKINADA

KAKINADA – 533 003, Andhra Pradesh, India

DEPARTMENT OF COMPUTER SCIENCE & ENGINEERING

L T P C
II Year – II Semester
3 0 0 3
FORMAL LANGUAGES AND AUTOMATA THEORY

Course Objectives:
x To learn fundamentals of Regular and Context Free Grammars and Languages
x To understand the relation between Regular Language and Finite Automata and
machines
x To learn how to design Automata’s and machines as Acceptors, Verifiers and
Translators
x To understand the relation between Contexts free Languages, PDA and TM
x To learn how to design PDA as acceptor and TM as Calculators

Course Outcomes:
By the end of the course students can
x Classify machines by their power to recognize languages.
x Summarize language classes & grammars relationship among them with the help of
Chomsky hierarchy
x Employ finite state machines to solve problems in computing
x Illustrate deterministic and non-deterministic machines
x Quote the hierarchy of problems arising in the computer science

UNIT I
Finite Automata: Need of Automata theory, Central Concepts of Automata Theory,
Automation, Finite Automation, Transition Systems, Acceptance of a String, DFA, Design of
DFAs, NFA, Design of NFA, Equivalence of DFA and NFA, Conversion of NFA into DFA,
Finite Automata with Є-Transitions, Minimization of Finite Automata, Finite Automata with
output-Mealy and Moore Machines, Applications and Limitation of Finite Automata.

UNIT II
Regular Expressions, Regular Sets, Identity Rules, Equivalence of two RE, Manipulations of
REs, Finite Automata and Regular Expressions, Inter Conversion, Equivalence between FA
and RE, Pumping Lemma of Regular Sets, Closure Properties of Regular Sets, Grammars,
Classification of Grammars, Chomsky Hierarchy Theorem, Right and Left Linear Regular
Grammars, Equivalence between RG and FA, Inter Conversion.

UNIT III
Formal Languages, Context Free Grammar, Leftmost and Rightmost Derivations, Parse
Trees, Ambiguous Grammars, Simplification of Context Free Grammars-Elimination of
Useless Symbols, Є-Productions and Unit Productions, Normal Forms-Chomsky Normal
Form and Greibach Normal Form, Pumping Lemma, Closure Properties, Applications of
Context Free Grammars.
 R-20 Syllabus for CSE, JNTUK w. e. f. 2020 – 21

JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY KAKINADA

KAKINADA – 533 003, Andhra Pradesh, India

DEPARTMENT OF COMPUTER SCIENCE & ENGINEERING

UNIT IV
Pushdown Automata, Definition, Model, Graphical Notation, Instantaneous Description,
Language Acceptance of Pushdown Automata, Design of Pushdown Automata, Deterministic
and Non – Deterministic Pushdown Automata, Equivalence of Pushdown Automata and
Context Free Grammars, Conversion, Two Stack Pushdown Automata, Application of
Pushdown Automata.

UNIT V
Turning Machine: Definition, Model, Representation of TMs-Instantaneous Descriptions,
Transition Tables and Transition Diagrams, Language of a TM, Design of TMs, Types of
TMs, Church’s Thesis, Universal and Restricted TM, Decidable and Un-decidable Problems,
Halting Problem of TMs, Post’s Correspondence Problem, Modified PCP, Classes of P and
NP, NP-Hard and NP-Complete Problems.

Text Books:
1) Introduction to Automata Theory, Languages and Computation, J. E. Hopcroft, R.
Motwani and J. D. Ullman, 3rd Edition, Pearson, 2008
2) Theory of Computer Science-Automata, Languages and Computation, K. L. P. Mishra
and N. Chandrasekharan, 3rd Edition, PHI, 2007

Reference Books:
1) Elements of Theory of Computation, Lewis H.P. & Papadimition C.H., Pearson /PHI
2) Theory of Computation, V. Kulkarni, Oxford University Press, 2013
3) Theory of Automata, Languages and Computation, Rajendra Kumar, McGraw Hill,
2014

e-Resources:
1) https://nptel.ac.in/courses/106/104/106104028/
 R-20 Syllabus for CSE, JNTUK w. e. f. 2020 – 21

JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY KAKINADA

KAKINADA – 533 003, Andhra Pradesh, India

DEPARTMENT OF COMPUTER SCIENCE & ENGINEERING

L T P C
II Year – II Semester
3 0 0 3
JAVA PROGRAMMING

Course Objectives:
The learning objectives of this course are:

x To identify Java language components and how they work together in applications
x To learn the fundamentals of object-oriented programming in Java, including defining
classes, invoking methods, using class libraries.
x To learn how to extend Java classes with inheritance and dynamic binding and how to
use exception handling in Java applications
x To understand how to design applications with threads in Java
x To understand how to use Java APIs for program development
Course Outcomes:

By the end of the course, the student will be

x Able to realize the concept of Object Oriented Programming & Java Programming
Constructs
x Able to describe the basic concepts of Java such as operators, classes, objects,
inheritance, packages, Enumeration and various keywords
x Apply the concept of exception handling and Input/ Output operations
x Able to design the applications of Java & Java applet
x Able to Analyze & Design the concept of Event Handling and Abstract Window
Toolkit

UNIT I
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.
 R-20 Syllabus for CSE, JNTUK w. e. f. 2020 – 21

JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY KAKINADA

KAKINADA – 533 003, Andhra Pradesh, India

DEPARTMENT OF COMPUTER SCIENCE & ENGINEERING

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

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, try-with-resources, Catching Subclass
Exception, Custom Exceptions, Nested try and catch Blocks, Rethrowing Exception, Throws
Clause.
 R-20 Syllabus for CSE, JNTUK w. e. f. 2020 – 21

JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY KAKINADA

KAKINADA – 533 003, Andhra Pradesh, India

DEPARTMENT OF COMPUTER SCIENCE & ENGINEERING

UNIT V
String Handling in Java: Introduction, Interface Char Sequence, Class String, Methods for
Extracting Characters from Strings, Methods for Comparison of Strings, Methods for
Modifying Strings, Methods for Searching Strings, Data Conversion and Miscellaneous
Methods, Class String Buffer, Class String Builder.

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 Connections,
ResultSet Interface, Creating JDBC Application, JDBC Batch Processing, JDBC Transaction
Management

Text Books:

1) JAVA one step ahead, Anitha Seth, B.L.Juneja, Oxford.

2) The complete Reference Java, 8th edition, Herbert Schildt, TMH.
References Books:

1) Introduction to java programming, 7th edition by Y Daniel Liang, Pearson

2) Murach's Java Programming, Joel Murach
e-Resources:
1) https://nptel.ac.in/courses/106/105/106105191/
2) https://www.w3schools.com/java/java_data_types.asp
 R-20 Syllabus for CSE, JNTUK w. e. f. 2020 – 21

JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY KAKINADA

KAKINADA – 533 003, Andhra Pradesh, India

DEPARTMENT OF COMPUTER SCIENCE & ENGINEERING

L T P C
II Year – II Semester
3 0 0 3
MANAGERIAL ECONOMICS AND FINANCIAL ACCOUNTANCY

Course Objectives:
x The Learning objectives of this paper are to understand the concept and nature of
Managerial Economics and its relationship with other disciplines and also to understand
the Concept of Demand and Demand forecasting
x To familiarize about the Production function, Input Output relationship, Cost-Output
relationship and Cost-Volume-Profit Analysis
x To understand the nature of markets, Methods of Pricing in the different market
structures and to know the different forms of Business organization and the concept of
Business Cycles
x To learn different Accounting Systems, preparation of Financial Statement and uses of
different tools for performance evaluation
x Finally, it is also to understand the concept of Capital, Capital Budgeting and the
techniques used to evaluate Capital Budgeting proposals

Course Outcomes:

x The Learner is equipped with the knowledge of estimating the Demand and demand
elasticities for a product
x The knowledge of understanding of the Input-Output-Cost relationships and estimation
of the least cost combination of inputs
x The pupil is also ready to understand the nature of different markets and Price Output
determination under various market conditions and also to have the knowledge of
different Business Units
x The Learner is able to prepare Financial Statements and the usage of various
Accounting tools for Analysis
x The Learner can able to evaluate various investment project proposals with the help of
capital budgeting techniques for decision making

UNIT I
Introduction to Managerial Economics and demand Analysis: Definition of Managerial Economics –
Scope of Managerial Economics and its relationship with other subjects –Concept of Demand, Types
of Demand, Determinants of Demand- Demand schedule, Demand curve, Law of Demand and its
limitations- Elasticity of Demand, Types of Elasticity of Demand and Measurement- Demand
forecasting and Methods of forecasting, Concept of Supply and Law of Supply.

UNIT II
Theories of Production and Cost Analyses: Theories of Production function- Law of Variable
proportions-Isoquants and Isocosts and choice of least cost factor combination-Concepts of Returns to
scale and Economies of scale-Different cost concepts: opportunity costs, explicit and implicit costs-
Fixed costs, Variable Costs and Total costs –Cost –Volume-Profit analysis-Determination of
Breakeven point(problems)-Managerial significance and limitations of Breakeven point.
 R-20 Syllabus for CSE, JNTUK w. e. f. 2020 – 21

JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY KAKINADA

KAKINADA – 533 003, Andhra Pradesh, India

DEPARTMENT OF COMPUTER SCIENCE & ENGINEERING

UNIT III
Introduction to Markets, Theories of the Firm & Pricing Policies: Market Structures: Perfect
Competition, Monopoly, Monopolistic competition and Oligopoly – Features – Price and Output
Determination – Managerial Theories of firm: Marris and Williamson’s models – other Methods of
Pricing: Average cost pricing, Limit Pricing, Market Skimming Pricing, Internet Pricing: (Flat Rate
Pricing, Usage sensitive pricing) and Priority Pricing, Business Cycles : Meaning and Features –
Phases of a Business Cycle. Features and Evaluation of Sole Trader, Partnership, Joint Stock
Company – State/Public Enterprises and their forms.

UNIT IV
Introduction to Accounting & Financing Analysis: Introduction to Double Entry System, Journal,
Ledger, Trail Balance and Preparation of Final Accounts with adjustments – Preparation of Financial
Statements-Analysis and Interpretation of Financial Statements-Ratio Analysis – Preparation of Funds
flow and cash flow analysis (Problems)

UNIT V
Capital and Capital Budgeting: Capital Budgeting: Meaning of Capital-Capitalization-Meaning of
Capital Budgeting-Time value of money- Methods of appraising Project profitability: Traditional
Methods (pay back period, accounting rate of return) and modern methods(Discounted cash flow
method, Net Present Value method, Internal Rate of Return Method and Profitability Index)
Text Books:

1) A R Aryasri, Managerial Economics and Financial Analysis, The McGraw – Hill

companies.
Reference Books:

1) Varshney R.L, K.L Maheswari, Managerial Economics, S. Chand & Company Ltd.
2) JL Pappas and EF Brigham, Managerial Economics, Holt, R & W; New edition edition
3) N.P Srinivasn and M. SakthivelMurugan, Accounting for Management, S. Chand & Company
Ltd.
4) MaheswariS.N,AnIntroduction to Accountancy, Vikas Publishing House Pvt Ltd
5) I.M Pandey, Financial Management , Vikas Publishing House Pvt Ltd
6) V. Maheswari, Managerial Economics, S. Chand & Company Ltd.
 R-20 Syllabus for CSE, JNTUK w. e. f. 2020 – 21

JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY KAKINADA

KAKINADA – 533 003, Andhra Pradesh, India

DEPARTMENT OF COMPUTER SCIENCE & ENGINEERING

L T P C
II Year – II Semester
0 0 2 1
DATABASE MANAGEMENT SYSTEMS LAB

Course Objectives:
This Course will enable students to

x Populate and query a database using SQL DDL/DML Commands

x Declare and enforce integrity constraints on a database
x Writing Queries using advanced concepts of SQL
x Programming PL/SQL including procedures, functions, cursors and triggers

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

x Utilize SQL to execute queries for creating database and performing data
manipulation operations
x Examine integrity constraints to build efficient databases
x Apply Queries using Advanced Concepts of SQL
x Build PL/SQL programs including stored procedures, functions, cursors and triggers
List of Exercises:

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, 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 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.
 R-20 Syllabus for CSE, JNTUK w. e. f. 2020 – 21

JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY KAKINADA

KAKINADA – 533 003, Andhra Pradesh, India

DEPARTMENT OF COMPUTER SCIENCE & ENGINEERING

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 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 and non-
indexing techniques.

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
 R-20 Syllabus for CSE, JNTUK w. e. f. 2020 – 21

JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY KAKINADA

KAKINADA – 533 003, Andhra Pradesh, India

DEPARTMENT OF COMPUTER SCIENCE & ENGINEERING

L T P C
II Year – II Semester
0 1 2 2
R PROGRAMMING LAB

COURSE OBJECTIVES:

• To learn statistical programming, computation, graphics, and modeling,

• To learn Writing functions and use R in an efficient way,
• To learn about basic types of statistical models

COURSE OUTCOMES:

At the end of this course, students will be able to:

• Access online resources for R and import new function packages into the R
workspace
• Import, review, manipulate and summarize data-sets in R
• Explore data-sets to create testable hypotheses and identify appropriate statistical tests
• Perform appropriate statistical tests using R
• Create and edit visualizations with R

1) Write a R program to take input from the user (name and age) and display the values.
Also print the version of R installation.
2) Write a R program to get the details of the objects in memory.
3) Write a R program to create a sequence of numbers from 20 to 50 and find the mean of
numbers from 20 to 60 and sum of numbers from 51 to 91.
4) Write a R program to create a simple bar plot of five subjects marks.
5) Write a R program to get the unique elements of a given string and unique numbers of
vector.
6) Write a R program to create three vectors a,b,c with 3 integers. Combine the three
vectors to become a 3×3 matrix where each column represents a vector. Print the content
of the matrix.
7) Write a R program to create a 5 x 4 matrix , 3 x 3 matrix with labels and fill the matrix
by rows and 2 × 2 matrix with labels and fill the matrix by columns.
8) Write a R program to combine three arrays so that the first row of the first array is
followed by the first row of the second array and then first row of the third array.
9) Write a R program to create a two-dimensional 5x3 array of sequence of even integers
greater than 50.
10) Write a R program to create an array using four given columns, three given rows, and
two given tables and display the content of the array.
11) Write a R program to create an empty data frame.
12) Write a R program to create a data frame from four given vectors.
13) Write a R program to create a data frame using two given vectors and display the
duplicated elements and unique rows of the said data frame.
14) Write a R program to save the information of a data frame in a file and display the
information of the file.
 R-20 Syllabus for CSE, JNTUK w. e. f. 2020 – 21

JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY KAKINADA

KAKINADA – 533 003, Andhra Pradesh, India

DEPARTMENT OF COMPUTER SCIENCE & ENGINEERING

15) Write a R program to create a matrix from a list of given vectors.

16) Write a R program to concatenate two given matrices of same column but different rows.
17) Write a R program to find row and column index of maximum and minimum value in a
given matrix.
18) Write a R program to append value to a given empty vector.
19) Write a R program to multiply two vectors of integers type and length 3.
20) Write a R program to find Sum, Mean and Product of a Vector, ignore element like NA
or NaN.
21) Write a R program to list containing a vector, a matrix and a list and give names to the
elements in the list.
22) Write a R program to create a list containing a vector, a matrix and a list and give names
to the elements in the list. Access the first and second element of the list.
23) Write a R program to create a list containing a vector, a matrix and a list and remove the
second element.
24) Write a R program to select second element of a given nested list.
25) Write a R program to merge two given lists into one list.
26) Write a R program to create a list named s containing sequence of 15 capital letters,
starting from ‘E’.
27) Write a R program to assign new names "a", "b" and "c" to the elements of a given list.
28) Write a R program to find the levels of factor of a given vector.
29) Write a R program to create an ordered factor from data consisting of the names of
months.
30) Write a R program to concatenate two given factor in a single factor.
 R-20 Syllabus for CSE, JNTUK w. e. f. 2020 – 21

JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY KAKINADA

KAKINADA – 533 003, Andhra Pradesh, India

DEPARTMENT OF COMPUTER SCIENCE & ENGINEERING

L T P C
II Year – II Semester
0 0 3 1.5
JAVA PROGRAMMING LAB

Course Objectives:
The aim of this lab is to

x Practice programming in the Java

x Gain knowledge of object-oriented paradigm in the Java programming language
x Learn use of Java in a variety of technologies and on different platforms

Course Outcomes:
By the end of the course student will be able to write java program for

x Evaluate default value of all primitive data type, Operations, Expressions, Control-
flow, Strings
x Determine Class, Objects, Methods, Inheritance, Exception, Runtime Polymorphism,
User defined Exception handling mechanism
x Illustrating simple inheritance, multi-level inheritance, Exception handling
mechanism
x Construct Threads, Event Handling, implement packages, developing applets
Exercise - 1 (Basics)

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 on value of D, describe the nature of root.

c) Five Bikers Compete in a race such that they drive at a constant speed which may or may
not be the same as the other. To qualify the race, the speed of a racer must be more than the
average speed of all 5 racers. Take as input the speed of each racer and print back the speed
of qualifying racers.
Exercise - 2 (Operations, Expressions, Control-flow, Strings)

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 sort

c) Write a JAVA program to sort for an element in a given list of elements using merge sort.

d) Write a JAVA program using StringBuffer to delete, remove character.

 R-20 Syllabus for CSE, JNTUK w. e. f. 2020 – 21

JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY KAKINADA

KAKINADA – 533 003, Andhra Pradesh, India

DEPARTMENT OF COMPUTER SCIENCE & ENGINEERING

Exercise - 3 (Class, Objects)

a) Write a JAVA program to implement class mechanism. Create a class, methods and invoke
them inside main method.

b) Write a JAVA program to implement constructor.

Exercise - 4 (Methods)

a) Write a JAVA program to implement constructor overloading.

b) Write a JAVA program implement method overloading.

Exercise - 5 (Inheritance)

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 - 6 (Inheritance - Continued)

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?

Exercise - 7 (Exception)

a) Write a JAVA program that describes exception handling mechanism

b) Write a JAVA program Illustrating Multiple catch clauses

Exercise – 8 (Runtime Polymorphism)

a) Write a JAVA program that implements Runtime polymorphism

b) Write a Case study on run time polymorphism, inheritance that implements in above
problem
Exercise – 9 (User defined Exception)

a) Write a JAVA program for creation of Illustrating throw

b) Write a JAVA program for creation of Illustrating finally
c) Write a JAVA program for creation of Java Built-in Exceptions
d) d)Write a JAVA program for creation of User Defined Exception
Exercise – 10 (Threads)

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)
 R-20 Syllabus for CSE, JNTUK w. e. f. 2020 – 21

JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY KAKINADA

KAKINADA – 533 003, Andhra Pradesh, India

DEPARTMENT OF COMPUTER SCIENCE & ENGINEERING

b) Write a program illustrating isAlive and join ()

c) Write a Program illustrating Daemon Threads.

Exercise - 11 (Threads continuity)

a) Write a JAVA program Producer Consumer Problem

b) Write a case study on thread Synchronization after solving the above producer consumer
problem
Exercise – 12 (Packages)

a) Write a JAVA program illustrate class path

b) Write a case study on including in class path in your os environment of your package.

c) Write a JAVA program that import and use the defined your package in the previous
Problem
Exercise - 13 (Applet)

a) Write a JAVA program to paint like paint brush in applet.

b) Write a JAVA program to display analog clock using Applet.

c) Write a JAVA program to create different shapes and fill colors using Applet.
Exercise - 14 (Event Handling)

a) Write a JAVA program that display the x and y position of the cursor movement using
Mouse.

b) Write a JAVA program that identifies key-up key-down event user entering text in a
Applet.
 R-20 Syllabus for CSE, JNTUK w. e. f. 2020 – 21

JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY KAKINADA

KAKINADA – 533 003, Andhra Pradesh, India

DEPARTMENT OF COMPUTER SCIENCE & ENGINEERING

L T P C
II Year - II Semester Skill Oriented Course- II
0 0 4 2
APPLICATIONS OF PYTHON-Pandas

Course Objectives:
The objective of this lab is to understand the fundamentals of the Pandas library in Python
and how it is used to handle data and also develop basic skills in data analysis and
visualization

Course Outcomes:

By the end of this lab the student is able to

x Use Pandas to create and manipulate data structures like Series and DataFrames.
x Work with arrays, queries, and dataframes
x Query DataFrame structures for cleaning and processing and manipulating files
x Understand best practices for creating basic charts

Perform the following:

1) Pandas Installation

2) Creating DataFrames

Exercises:

A) Pandas DataSeries:

1) Write a Pandas program to create and display a one-dimensional array-like object

containing an array of data using Pandas module.
2) Write a Pandas program to convert a Panda module Series to Python list and it's type.
3) Write a Pandas program to add, subtract, multiple and divide two Pandas Series.
4) Write a Pandas program to convert a NumPy array to a Pandas series.
Sample Series:
NumPy array:
[10 20 30 40 50]
Converted Pandas series:
0 10
1 20
2 30
3 40
4 50
dtype: int64

B) Pandas DataFrames:
 R-20 Syllabus for CSE, JNTUK w. e. f. 2020 – 21

JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY KAKINADA

KAKINADA – 533 003, Andhra Pradesh, India

DEPARTMENT OF COMPUTER SCIENCE & ENGINEERING

Consider Sample Python dictionary data and list labels:

exam_data = {'name': ['Anastasia', 'Dima', 'Katherine', 'James', 'Emily', 'Michael',
'Matthew', 'Laura', 'Kevin', 'Jonas'],
'score': [12.5, 9, 16.5, np.nan, 9, 20, 14.5, np.nan, 8, 19],
'attempts': [1, 3, 2, 3, 2, 3, 1, 1, 2, 1],
'qualify': ['yes', 'no', 'yes', 'no', 'no', 'yes', 'yes', 'no', 'no', 'yes']}
labels = ['a', 'b', 'c', 'd', 'e', 'f', 'g', 'h', 'i', 'j']

1) Write a Pandas program to create and display a DataFrame from a specified

dictionary data which has the index labels.
2) Write a Pandas program to change the name 'James' to 'Suresh' in name column of the
DataFrame.
3) Write a Pandas program to insert a new column in existing DataFrame.
4) Write a Pandas program to get list from DataFrame column headers.
5) Write a Pandas program to get list from DataFrame column headers.

C) Pandas Index:

1) Write a Pandas program to display the default index and set a column as an Index in a
given dataframe.
2) Write a Pandas program to create an index labels by using 64-bit integers, using
floating-point numbers in a given dataframe.

D) Pandas String and Regular Expressions:

1) Write a Pandas program to convert all the string values to upper, lower cases in a
given pandas series. Also find the length of the string values.
2) Write a Pandas program to remove whitespaces, left sided whitespaces and right sided
whitespaces of the string values of a given pandas series.
3) Write a Pandas program to count of occurrence of a specified substring in a
DataFrame column.
4) Write a Pandas program to swap the cases of a specified character column in a given
DataFrame.

E) Pandas Joining and merging DataFrame:

1) Write a Pandas program to join the two given dataframes along rows and assign all
data.
2) Write a Pandas program to append a list of dictioneries or series to a existing
DataFrame and display the combined data.
3) Write a Pandas program to join the two dataframes with matching records from both
sides where available.

F) Pandas Time Series:

1) Write a Pandas program to create

a) Datetime object for Jan 15 2012.
 R-20 Syllabus for CSE, JNTUK w. e. f. 2020 – 21

JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY KAKINADA

KAKINADA – 533 003, Andhra Pradesh, India

DEPARTMENT OF COMPUTER SCIENCE & ENGINEERING

b) Specific date and time of 9:20 pm.

c) Local date and time.

d) A date without time.

e) Current date.

f) Time from a datetime.

g) Current local time.

2) Write a Pandas program to create a date from a given year, month, day and another
date from a given string formats.
3) Write a Pandas program to create a time-series with two index labels and random
values. Also print the type of the index.

G) Pandas Grouping Aggregate:

Consider dataset:

school class name date_Of_Birth age height weight address

S1 s001 V Alberto Franco 15/05/2002 12 173 35 street1

S2 s002 V Gino Mcneill 17/05/2002 12 192 32 street2

S3 s003 VI Ryan Parkes 16/02/1999 13 186 33 street3

S4 s001 VI Eesha Hinton 25/09/1998 13 167 30 street1

S5 s002 V Gino Mcneill 11/05/2002 14 151 31 street2

S6 s004 VI David Parkes 15/09/1997 12 159 32 street4

1) Write a Pandas program to split the following dataframe into groups based on school
code. Also check the type of GroupBy object.
2) Write a Pandas program to split the following dataframe by school code and get
mean, min, and max value of age for each school.
H) Pandas Styling:

1) Create a dataframe of ten rows, four columns with random values. Write a Pandas
program to highlight the negative numbers red and positive numbers black.
2) Create a dataframe of ten rows, four columns with random values. Write a Pandas
program to highlight the maximum value in each column.
3) Create a dataframe of ten rows, four columns with random values. Write a Pandas
program to highlight dataframe's specific columns.
 R-20 Syllabus for CSE, JNTUK w. e. f. 2020 – 21

JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY KAKINADA

KAKINADA – 533 003, Andhra Pradesh, India

DEPARTMENT OF COMPUTER SCIENCE & ENGINEERING

I) Excel:

1) Write a Pandas program to import excel data into a Pandas dataframe.

2) Write a Pandas program to find the sum, mean, max, min value of a column of file.
J) Plotting:

1) Write a Pandas program to create a horizontal stacked bar plot of opening, closing
stock prices of any stock dataset between two specific dates.
2) Write a Pandas program to create a histograms plot of opening, closing, high, low
stock prices of stock dataset between two specific dates.
3) Write a Pandas program to create a stacked histograms plot of opening, closing, high,
low stock prices of stock dataset between two specific dates with more bins.

K) Pandas SQL Query:

1) Write a Pandas program to display all the records of a student file.

2) Write a Pandas program to select distinct department id from employees file.
 R-20 Syllabus for CSE, JNTUK w. e. f. 2020 – 21

JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY KAKINADA

KAKINADA – 533 003, Andhra Pradesh, India

DEPARTMENT OF COMPUTER SCIENCE & ENGINEERING

L T P C
II Year - II Semester Skill Oriented Course- II
0 0 4 2
WEB APPLICATION DEVELOPMENT USING FULL STACK
Frontend Development – Module -II

Course Objectives:

The objective of this lab is to build strong foundation of JavaScript which will help developer
to apply JavaScript concepts for responsive web frontend development

Course Outcomes:

By the end of this lab the student is able to

x develop of the major Web application tier- Client side development

x participate in the active development of cross-browser applications through JavaScript
x Develop JavaScript applications that transition between states

Perform experiments related to the following concepts:

1) Introduction to JavaScript
2) Applying JavaScript (internal and external)
3) Understanding JS Syntax
4) Introduction to Document and Window Object
5) Variables and Operators
6) Data Types and Num Type Conversion
7) Math and String Manipulation
8) Objects and Arrays
9) Date and Time
10) Conditional Statements
11) Switch Case
12) Looping in JS
13) Functions
 R-20 Syllabus for CSE, JNTUK w. e. f. 2020 – 21

JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY KAKINADA

KAKINADA – 533 003, Andhra Pradesh, India

DEPARTMENT OF COMPUTER SCIENCE & ENGINEERING

MINOR COURSES

PART –B
 R-20 Syllabus for CSE, JNTUK w. e. f. 2020 – 21

JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY KAKINADA

KAKINADA – 533 003, Andhra Pradesh, India

DEPARTMENT OF COMPUTER SCIENCE & ENGINEERING

L T P C
PART B Minor Course
4 0 0 4
COMPUTATIONAL THINKING

Course Objective:
x The subject is aimed at students with little or no programming experience.
x It aims to provide students with an understanding of the role computation can play in solving
problems.
x It also aims to help students, regardless of their major, to feel justifiably confident of their ability
to write small programs that allow them to accomplish useful goals.

Course Outcomes:
After studying this course, Student should be able to:
1. Describe the skills that are involved in computational thinking
2. Demonstrate the concepts of Boolean Logic and Software Development.
3. Analyze the concepts of algorithmic thinking as modeling and abstraction as encapsulation.
4. Illustrate the distinctive nature of data organization, White box and Black box testing.
5. Student will be aware of a range of applications of computational thinking in different disciplines,
Authentication and authorization.

UNIT I:
Introduction: Computers, Computational Thinking, Abacus to Machine, The First Software, The First
Modern Computer, Moore’s Law, Real-World Information Becomes Computable Data, Information
and Data, Converting Information into Data, Data Capacity, Data Compression

UNIT II:
Logic: Boolean Logic, Applications of Propositional Logic, Solving Problems, Logical Reasoning,
Decomposition: Software Design, Decomposition: Other Uses, Abstraction: Class Diagrams, Abstraction:
Use Case Diagrams

UNIT III:
Algorithmic Thinking: Algorithms, Software and Programming, Languages, Actions, Modeling
Solutions: Activity Diagrams, Selection in Activity Diagrams, Repetition in Activity Diagrams, Control
Abstraction in Activity Diagrams, States and State Diagrams, Behavior in State Diagrams,

UNIT IV:
Data Organization: Names, Lists, Graphs, Hierarchies, Algorithmic Thinking: Von Neumann
Architecture, Spreadsheets, Text Processing, Patterns, Computer Errors, Software Correctness,
Verification, Software Testing, White Box Testing, Black Box Testing with Equivalence Partitioning,
Boundary Value Analysis
UNIT V:
Concurrent Activity: Parallelism or Concurrency, Scheduling, Sorting Networks, Information Security:
Security, Foundations, Common Forms of Cybercrime, Secure- Step 1: Authenticate, Secure- Step 2:
Authorization, All a Matter of Risk
 R-20 Syllabus for CSE, JNTUK w. e. f. 2020 – 21

JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY KAKINADA

KAKINADA – 533 003, Andhra Pradesh, India

DEPARTMENT OF COMPUTER SCIENCE & ENGINEERING

Text Book:
1. David Riley, Kenny A. Hunt, Computational Thinking for the Modern Problem Solver, 2014.
2. G Venkatesh, Madhavan Mukund, Computational Thinking: A Primer for Programmers and Data
Scientists, 2021.

Reference Books:
1. Paolo Ferragina, Fabrizio Luccio, Computational Thinking: First Algorithms, then coding, Springer,
2018.
2. Karl Beecher, computational thinking: A beginner's guide to problem-solving and programming, 2017.

NPTEL Link: Physics through Computational Thinking:

https://onlinecourses.nptel.ac.in/noc22_ph12/preview
 R-20 Syllabus for CSE, JNTUK w. e. f. 2020 – 21

JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY KAKINADA

KAKINADA – 533 003, Andhra Pradesh, India

DEPARTMENT OF COMPUTER SCIENCE & ENGINEERING

L T P C
PART B Minor Course
3 0 2 4
OBJECT ORIENTED PROGRAMMING THROUGH JAVA

Course Objectives:
The learning objectives of this course are:
x To identify Java language components and how they work together in applications
x To learn the fundamentals of object-oriented programming in Java, including defining classes,
invoking methods, using class libraries.
x To learn how to extend Java classes with inheritance and dynamic binding and how to use exception
handling in Java applications
x Practice programming in the Java
x Gain knowledge of object-oriented paradigm in the Java programming language

Course Outcomes:
By the end of the course, the student will be
x Evaluate default value of all primitive data type, Operations, Expressions, Control- flow, Strings
x Determine Class, Objects, Methods, Inheritance, Exception, Runtime Polymorphism, User defined
Exception handling mechanism
x Illustrating simple inheritance, multi-level inheritance, Exception handling mechanism
x Construct Threads, Event Handling, implement packages, developing applets

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

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-
 R-20 Syllabus for CSE, JNTUK w. e. f. 2020 – 21

JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY KAKINADA

KAKINADA – 533 003, Andhra Pradesh, India

DEPARTMENT OF COMPUTER SCIENCE & ENGINEERING

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, Random Class, Time Package, Formatting for Date/Time in Java,
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, try-with-resources, Catching Subclass Exception, Custom Exceptions, Nested try
and catch Blocks, Rethrowing Exception, Throws Clause.

UNIT V
String Handling in Java: Introduction, Interface Char Sequence, Class String, Methods for Extracting
Characters from Strings, Methods for Comparison of Strings, Methods for Modifying Strings, Methods
for Searching Strings, Data Conversion and Miscellaneous Methods, Class String Buffer, Class String
Builder.

List of Experiments:

Exercise - 1 (Basics)
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 on value of D, describe the nature of root.

Exercise - 2 (Operations, Expressions, Control-flow, Strings)

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 sort
c) Write a JAVA program using StringBuffer to delete, remove character.

Exercise - 3 (Class, Objects)

a) Write a JAVA program to implement class mechanism. Create a class, methods and invoke them
inside main method.
b) Write a JAVA program to implement constructor.

Exercise - 4 (Methods)
a) Write a JAVA program to implement constructor overloading.
b) Write a JAVA program implement method overloading.

Exercise - 5 (Inheritance)
a) Write a JAVA program to implement Single Inheritance
b) Write a JAVA program to implement multi level Inheritance
 R-20 Syllabus for CSE, JNTUK w. e. f. 2020 – 21

JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY KAKINADA

KAKINADA – 533 003, Andhra Pradesh, India

DEPARTMENT OF COMPUTER SCIENCE & ENGINEERING

Exercise - 6 (Inheritance - Continued)

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?

Exercise - 7 (Exception)
a) Write a JAVA program that describes exception handling mechanism
b) Write a JAVA program Illustrating Multiple catch clauses

Exercise – 8 (Runtime Polymorphism)

Write a JAVA program that implements Runtime polymorphism

Exercise – 9 (User defined Exception)

a) Write a JAVA program for creation of Illustrating throw
b) Write a JAVA program for creation of Illustrating finally

Text Books:
1) JAVA one step ahead, Anitha Seth, B.L.Juneja, Oxford.
2) The complete Reference Java, 8th edition, Herbert Schildt, TMH.

References Books:
1) Introduction to java programming, 7th edition by Y Daniel Liang, Pearson
2) Murach's Java Programming, Joel Murach

e-Resources:
1) https://nptel.ac.in/courses/106/105/106105191/
2) https://www.w3schools.com/java/java_data_types.asp
 R-20 Syllabus for CSE, JNTUK w. e. f. 2020 – 21

JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY KAKINADA

KAKINADA – 533 003, Andhra Pradesh, India

DEPARTMENT OF COMPUTER SCIENCE & ENGINEERING

L T P C
PART B Minor Course
3 0 2 4
DATA ANALYTICS USING PYTHON
 R-20 Syllabus for CSE, JNTUK w. e. f. 2020 – 21

JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY KAKINADA

KAKINADA – 533 003, Andhra Pradesh, India

DEPARTMENT OF COMPUTER SCIENCE & ENGINEERING

L T P C
PART B Minor Course
4 0 0 4
ARTIFICIAL INTELLIGENCE

Course Objectives: The student will be able to

x Know the methodology of Problem solving
x Implement basic AI algorithms
x Design and carry out an empirical evolution of different algorithms on a problem formalization

Course Outcomes (COs): At the end of the course, student will be able to
x Understand the fundamental concepts in Artificial Intelligence
x Analyze the applications of search strategies and problem reductions
x Apply the mathematical logic concepts.
x Develop the Knowledge representations in Artificial Intelligence.
x Explain the Fuzzy logic systems.

UNIT I:
Introduction to artificial intelligence: Introduction ,history, intelligent systems, foundations of AI,
applications, tic-tac-tie game playing, development of AI languages, current trends in AI.

UNIT II:
Problem solving: state-space search and control strategies: Introduction, general problem solving,
characteristics of problem
Search Strategies: exhaustive searches, heuristic search techniques, iterative-deepening A*, constraint
satisfaction

UNIT III:
Logic concepts: Introduction, propositional calculus, proportional logic, natural deduction system,
axiomatic system, semantic tableau system in proportional logic, predicate logic

UNIT IV:
Knowledge representation: Introduction, approaches to knowledge representation, knowledge
representation using semantic network, extended semantic networks for KR
Advanced knowledge representation techniques: Introduction, conceptual dependency theory, script
structure.

UNIT V:
Expert system and applications: Introduction phases in building expert systems, expert system versus
traditional systems, rule-based expert systems blackboard systems truth maintenance systems, application
of expert systems, list of shells and tools.

Text Books:
1. Artificial Intelligence, Saroj Kaushik, CENGAGE Learning,
2. Artificial intelligence, A modern Approach , 2nd ed, Stuart Russel, Peter Norvig, PEA
3. Artificial Intelligence, Rich, Kevin Knight, Shiv Shankar B Nair, 3rd ed, TMH
4. Introduction to Artificial Intelligence, Patterson, PHI
 R-20 Syllabus for CSE, JNTUK w. e. f. 2020 – 21

JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY KAKINADA

KAKINADA – 533 003, Andhra Pradesh, India

DEPARTMENT OF COMPUTER SCIENCE & ENGINEERING

Reference Books:
1. Artificial intelligence, structures and Strategies for Complex problem solving, -George F Lugar, 5th
ed, PEA
2. Introduction to Artificial Intelligence, Ertel, Wolf Gang, Springer
3. Artificial Intelligence, A new Synthesis, Nils J Nilsson, Elsevier
 R-20 Syllabus for CSE, JNTUK w. e. f. 2020 – 21

JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY KAKINADA

KAKINADA – 533 003, Andhra Pradesh, India

DEPARTMENT OF COMPUTER SCIENCE & ENGINEERING

L T P C
PART B Minor Course
3 0 2 4
UNIX AND SHELL PROGRAMMING

Course Objectives:
Understating the shell commands, shell programming, system calls of files and processes, signals, inter-
process communication concepts and programming, TCP and UDP.

Course Outcomes: After finishing this course student will be able to:
x Gain good knowledge on Unix commands and awareness of shell programming
x Know about different system calls for files and directories
x Ability to know the working of processes and signals
x Application of client server program for IPC
x Knowledge about socket programming

UNIT-I:
Introduction, Architecture of unix, Responsibilities of shell, unix file system, vi editor. Unix commands:
Some Basic Commands, file utilities, process utilities, text processing utilities, network utilities, disk
utilities, backup utilities , Security by file permissions.

UNIT-II:
Shell Programming: shell variables, The Export command, The Profile File a Script Run During starting,
The First Shell Script, The read command, Positional Parameters, The $? Variable , Knowing the exit
Status- More about the Set Command, The Exit command, Branching Control Structures, Loop Control
Structures, The Continue and Break Statement- The Expr Command, Performing Integer Arithmetic- Real
Arithmetic in Shell Programs- The here Document(<<), The Sleep Command, Debugging Scripts, The
Script command, The Eval command, The Exec Command, Sample programs.

UNIT-III:
Files - Introduction, file descriptors, open, creat, read, write, close, lseek, dup2, file status information-stat
family, file and record locking- fcntl function, file permissions - chmod, fchmod, file ownership-chown,
lchown, links-soft and hard links-symlink, link, unlink.

UNIT IV:
Directories-Creating, removing and changing Directories-mkdir, rmdir, chdir, obtaining current working
directory-getcwd, Directory contents, Scanning Directories-opendir, readdir, closedir, rewinddir
functions.

UNIT V:
Process Control: process identifiers, fork function, vfork function, exit function, wait and waitpid
functions, exec functions, user identification. Signals: signal handling using signal function, kill and raise,
alarm, pause, abort and sleep functions.

List of Experiments:
1) a) Study of Unix/Linux general purpose utility command list: man,who,cat, cd, cp, ps, ls, mv, rm,
mkdir, rmdir, echo, more, date, time, kill, history, chmod, chown, finger, pwd, cal, logout,
shutdown.
b) Study of vi editor
c) Study of Bash shell, Bourne shell and C shell in Unix/Linux operating system
d) Study of Unix/Linux file system (tree structure)
 R-20 Syllabus for CSE, JNTUK w. e. f. 2020 – 21

JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY KAKINADA

KAKINADA – 533 003, Andhra Pradesh, India

DEPARTMENT OF COMPUTER SCIENCE & ENGINEERING

e)Study of .bashrc, /etc/bashrc and Environment variables.

2) Write a C program that makes a copy of a file using standard I/O, and system calls
3) Write a C program to emulate the UNIX ls –l command.
4) Write a C program that illustrates how to execute two commands concurrently with a command
pipe. Ex: - ls –l | sort
5) Implementation of fork (), wait (), exec() andexit (), System calls

Text Books:
4. Unix the ultimate guide, 3rd edition, Sumitabha Das, TMH.
5. Advanced programming in the Unix environment by W. Richard Stevens.
6. Unix network programming by W. Richard Stevens.

Reference Books:
1. Introduction to Unix and shell programming, Venkateshmurhty
2. Unix and shell programming by B.M. Harwani, OXFORD university press.
 R-20 Syllabus for CSE, JNTUK w. e. f. 2020 – 21

JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY KAKINADA

KAKINADA – 533 003, Andhra Pradesh, India

DEPARTMENT OF COMPUTER SCIENCE & ENGINEERING

L T P C
PART B Minor Course
4 0 0 4
CLOUD COMPUTING

Course Objectives:
x To explain the evolving computer model caned cloud computing.
x To introduce the various levels of services that can be achieved by cloud.
x To describe the security aspects in cloud.
x To motivate students to do programming and experiment with the various cloud computing
environments.

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

x Illustrate the key dimensions of the challenge of Cloud Computing
x Classify the Levels of Virtualization and mechanism of tools.
x Analyze Cloud infrastructure including Google Cloud and Amazon Cloud.
x Create Combinatorial Auctions for cloud resource and design scheduling algorithms for computing
cloud
x Assess control storage systems and cloud security, the risks involved its impact and develop cloud
application

UNIT I:
Systems Modeling, Clustering and Virtualization: Scalable Computing over the Internet-The Age of
Internet Computing, Scalable computing over the internet, Technologies for Network Based Systems,
System models for Distributed and Cloud Computing, , Performance, Security and Energy Efficiency

UNIT II:
Virtual Machines and Virtualization of Clusters and Data Centers: Implementation Levels of
Virtualization, Virtualization Structures/ Tools and Mechanisms, Virtualization of CPU, Memory and I/O
Devices, Virtual Clusters and Resource Management, Virtualization for Data-Center Automation.

UNIT III:
Cloud Platform Architecture: Cloud Computing and Service Models, Public Cloud Platforms, Service
Oriented Architecture, Programming on Amazon AWS and Microsoft Azure

UNIT IV:
Cloud Resource Management and Scheduling: Policies and Mechanisms for Resource Management,
Applications of Control Theory to Task Scheduling on a Cloud, Stability of a Two Level Resource
Allocation Architecture, Feedback Control Based on Dynamic Thresholds. Coordination of Specialized
Autonomic Performance Managers, Resource Bundling, Scheduling Algorithms for Computing Clouds-
Fair Queuing, Start Time Fair Queuing.

UNIT V:
Storage Systems: Evolution of storage technology, storage models, file systems and database, distributed
file systems, general parallel file systems. Google file system.

Text Books:
3. Distributed and Cloud Computing, Kai Hwang, Geoffry C. Fox, Jack J. Dongarra MK Elsevier.
4. Cloud Computing, Theory and Practice, Dan C Marinescu, MK Elsevier.
 R-20 Syllabus for CSE, JNTUK w. e. f. 2020 – 21

JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY KAKINADA

KAKINADA – 533 003, Andhra Pradesh, India

DEPARTMENT OF COMPUTER SCIENCE & ENGINEERING

Reference Books:
4. Cloud Computing, A Hands on approach, ArshadeepBahga, Vijay Madisetti, University Press
5. Cloud Computing, A Practical Approach, Anthony T Velte, Toby J Velte, Robert Elsenpeter,
TMH
6. Mastering Cloud Computing, Foundations and Application Programming, Raj Kumar Buyya,
Christen vecctiola, S Tammaraiselvi, TMH
 R-20 Syllabus for CSE, JNTUK w. e. f. 2020 – 21

JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY KAKINADA

KAKINADA – 533 003, Andhra Pradesh, India

DEPARTMENT OF COMPUTER SCIENCE & ENGINEERING

Suggested Courses for Honors Program

 R-20 Syllabus for CSE, JNTUK w. e. f. 2020 – 21

JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY KAKINADA

KAKINADA – 533 003, Andhra Pradesh, India

DEPARTMENT OF COMPUTER SCIENCE & ENGINEERING

L T P C
II Year - II Semester Honors Course
4 0 0 4
MATHEMATICS FOR MACHINE LEARNING
(AI & ML)

Course Objectives:
The main objectives of this course is to make student understand and apply the basic mathematical
concepts that are essential for machine learning algorithms

Course Outcomes:
By the end of the course, the student will be able to
x understand the basic notions of machine learning and of the related basic mathematical tools;
x comprehend the basic concepts and techniques of convex optimization
x have a good knowledge of the statistical and computational properties of some well
known machine learning algorithms;
x implement machine learning algorithms on synthetic and real data sets using mathematical concepts
like linear algebra, probability and calculus

UNIT-I
Linear Algebra: Systems of Linear Equations, Matrices, Solving Systems of Linear Equations, Vector
Spaces, Linear Independence, Basis and Rank, Linear Mappings, Affine Spaces

UNIT-II
Analytic Geometry: Norms, Inner Products, Lengths and Distances, Angles and Orthogonality,
Orthonormal Basis, Orthogonal Complement, Inner Product of Functions, Orthogonal Projections,
Rotations

UNIT-III
Matrix Decompositions: Determinant and Trace, Eigenvalues and Eigenvectors, Cholesky Decomposition,
Eigendecomposition and Diagonalization, Singular Value Decomposition, Matrix Approximation, Matrix
Phylogeny

UNIT-IV
Vector Calculus : Differentiation of Univariate Functions, Partial Differentiation and Gradients, Gradients
of Vector-Valued Functions, Gradients of Matrices, Useful Identities for Computing Gradients,
Backpropagation and Automatic Differentiation, Higher-Order Derivatives, Linearization and Multivariate
Taylor Series

UNIT-V
Probability and Distributions: Construction of a Probability Space, Discrete and Continuous Probabilities,
Sum Rule, Product Rule, and Bayes’ Theorem, Summary Statistics and Independence, Gaussian
Distribution, Conjugacy and the Exponential Family, Change of Variables/Inverse Transform
Continuous Optimization: Optimization Using Gradient Descent, Constrained Optimization and Lagrange
Multipliers, Convex Optimization

Text Books:
1. “Mathematics for Machine Learning”, Marc Peter Deisenroth, A. Aldo Faisal and Cheng Soon
Ong, Cambridge University Press.
2. The Elements of Statistical Learning: Data Mining, Inference, and Prediction, 2 nd Edition, Trevor
Hastie, Robert Tibshirani, Jerome Friedman, Springer 2017.
 R-20 Syllabus for CSE, JNTUK w. e. f. 2020 – 21

JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY KAKINADA

KAKINADA – 533 003, Andhra Pradesh, India

DEPARTMENT OF COMPUTER SCIENCE & ENGINEERING

Reference Books:
1. Machine Learning: An Applied Mathematics Introduction, Paul Wilmott, Panda Ohana Publishing
2019.
 R-20 Syllabus for CSE, JNTUK w. e. f. 2020 – 21

JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY KAKINADA

KAKINADA – 533 003, Andhra Pradesh, India

DEPARTMENT OF COMPUTER SCIENCE & ENGINEERING

L T P C
Honors Course
4 0 0 4
TEXT MINING AND TIME SERIES ANALYSIS
(AI & ML)

Course Objectives: This course will cover the major techniques for mining and analyzing text data to
discover interesting patterns, extract useful knowledge, and support decision making, with an emphasis on
statistical approaches that can be generally applied to arbitrary text data in any natural language with no or
minimum human effort. Develop the skills needed to do empirical research in fields operating with time
series data sets. The course aims to provide students with techniques and receipts for estimation and
assessment of quality of economic models with time series data.

Course Outcomes:
After completing the course Student will be able to:
x Student will be aware of fundamental concepts of text mining, unsupervised information
extraction.
x Student will be aware of text clustering algorithms like feature selection, distance-based clustering
and latent semantic indexing.
x Student will be aware of Text classification algorithm and text mining techniques.
x Student should aware of all the characteristics of time series and measures of dependencies.
x Student will be able to understand the ARIMA Models.

UNIT I:
Introduction to Text Mining: Introduction, Algorithms for Text Mining, Information Extraction from
Text: Introduction, Named Entity Recognition, Relation Extraction, Unsupervised Information Extraction.
Text Summarization Techniques: Extractive Summarization, Topic Representation Approaches, Influence
of Context, Indicator Representation and Machine Learning for Summarization.

UNIT II:
Text Clustering Algorithms: Introduction, Feature Selection and Transformation Methods for Text
Clustering, Distance-Based Clustering Algorithms, Word and Phrase-based Clustering, Probabilistic
Document Clustering and Topic Modelling. Dimensionality Reduction and Topic Modelling: Latent
Semantic Indexing, Topic Models and Dimension Reduction.

UNIT III:
Text Classification Algorithms: Introduction, Feature Selection for Text Classification, Decision Tree
Classifiers, Rule-based Classifier, Probabilistic and Naïve Bayes Classifiers, Linear Classifier, Proximity-
based Classifier, Meta-Algorithms for Text Classification, Probabilistic Models for Text Mining: Mixture
models, Stochastic Processes in Bayesian Nonparametric Models, Graphical Models.

UNIT IV:
Characteristics of Time Series: Introduction, Nature of Time Series Data, Time Series Statistical
Models, Measures of Dependence: Autocorrelation and Cross-Correlation, Stationary Time Series, Time
Series Regression and Exploratory Data Analysis: Classical Regression, Exploratory Data Analysis,
Smoothing.
 R-20 Syllabus for CSE, JNTUK w. e. f. 2020 – 21

JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY KAKINADA

KAKINADA – 533 003, Andhra Pradesh, India

DEPARTMENT OF COMPUTER SCIENCE & ENGINEERING

UNIT V:
ARIMA Models: Introduction, Autoregressive Moving Average Models, Difference Equations,
Autocorrelation and Partial Autocorrelation, Building ARIMA Models, Multiplicative Seasonal ARIMA
Models, Spectral Analysis and Filtering: Cyclical Behaviour and Periodicity, Spectral Density,
Periodogram and Discrete Fourier Transform, Nonparametric and Parametric Spectral Estimation, Linear
Filters, Dynamic Fourier Analysis and Wavelets.

Text Books:
1. Charu C. Aggarwal, Chengxing Zhai, “Mining Text Data”, Kluver Academic Publishers, Springer,
2012.
2. Robert H. Shumway and David S. Stoffer, “Time Series Analysis and Its Applications with R
Examples”, Springer, 2016.

Reference Books:
1. James D. Hamilton, Time Series Analysis, Princeton University Press, 2004.
2. Avishek Pal and PKS Prakash, Practical Time Series Analysis, Birmingham - Mumbai, 2017.
3. Box, G.E.P., G.M. Jenkins and G.C. Reinsel. n Time Series Analysis, Forecasting, and Control,
3rd ed. Englewood Cliffs, NJ: Prentice Hall, 1994.
4. Chan, N.H. Time Series: Applications to Finance. 2002, New York: Wiley.
5. Fuller, W.A. Introduction to Statistical Time Series, 2 nd ed. New York: Wiley, 1996.
 R-20 Syllabus for CSE, JNTUK w. e. f. 2020 – 21

JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY KAKINADA

KAKINADA – 533 003, Andhra Pradesh, India

DEPARTMENT OF COMPUTER SCIENCE & ENGINEERING

L T P C
Honors Course
4 0 0 4
NATURAL LANGUAGE PROCESSING
(AI & ML)

Course Objectives:
x This course introduces the fundamental concepts and techniques of natural language processing
(NLP).
x Students will gain an in-depth understanding of the computational properties of natural languages
and the commonly used algorithms for processing linguistic information.
x The course examines NLP models and algorithms using both the traditional symbolic and the
more recent statistical approaches.
x Enable students to be capable to describe the application based on natural language processing and
to show the points of syntactic, semantic and pragmatic processing.

Course Outcomes: After completion of this course

x Demonstrate a given text with basic Language features
x To design an innovative application using NLP components
x Explain a rule based system to tackle morphology/syntax of a language
x To design a tag set to be used for statistical processing for real-time applications
x To compare and contrast the use of different statistical approaches for different types of NLP
applications.

UNIT I:
Introduction :Origins and challenges of NLP, Language Modeling: Grammar-based LM, Statistical LM,
Regular Expressions, Finite-State Automata, English Morphology, Transducers for lexicon and rules,
Tokenization, Detecting and Correcting Spelling Errors, Minimum Edit Distance.

UNIT II:
Word Level Analysis: Unsmoothed N-grams, Evaluating N-grams, Smoothing, Interpolation and Backoff
– Word Classes, Part-of-Speech Tagging, Rule-based, Stochastic and Transformation-based tagging,
Issues in PoS tagging, Hidden Markov and Maximum Entropy models.

UNIT III:
Syntactic Analysis : Context-Free Grammars, Grammar rules for English, Treebanks, Normal Forms for
grammar, Dependency Grammar, Syntactic Parsing, Ambiguity, Dynamic Programming parsing, Shallow
parsing, Probabilistic CFG, Probabilistic CYK, Probabilistic Lexicalized CFGs, Feature structures,
Unification of feature structures

UNIT IV:
Semantics And Pragmatics: Requirements for representation, First-Order Logic, Description Logics,
Syntax-Driven Semantic analysis, Semantic attachments, Word Senses, Relations between Senses,
Thematic Roles, selectional restrictions, Word Sense Disambiguation, WSD using Supervised, Dictionary
& Thesaurus, Bootstrapping methods, Word Similarity using Thesaurus and Distributional methods.

UNIT V:
Discourse Analysis And Lexical Resources : Discourse segmentation, Coherence, Reference
Phenomena, Anaphora Resolution using Hobbs and Centering Algorithm, Coreference Resolution,
Resources: Porter Stemmer, Lemmatizer, Penn Treebank, Brill’s Tagger, WordNet, PropBank, FrameNet,
Brown Corpus, British National Corpus (BNC).
 R-20 Syllabus for CSE, JNTUK w. e. f. 2020 – 21

JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY KAKINADA

KAKINADA – 533 003, Andhra Pradesh, India

DEPARTMENT OF COMPUTER SCIENCE & ENGINEERING

Text Books:
1. Daniel Jurafsky, James H. Martin, Speech and Language Processing: An Introduction to Natural
Language Processing, Computational Linguistics and Speech, Pearson Publication, 2014.
2. Steven Bird, Ewan Klein and Edward Loper, Natural Language Processing with Python, First
Edition, OReilly Media, 2009.

Reference Books:
1. Breck Baldwin, Language Processing with Java and LingPipe Cookbook, Atlantic Publisher, 2015.
2. Richard M Reese, Natural Language Processing with Java, OReilly Media, 2015.
3. Nitin Indurkhya and Fred J. Damerau, Handbook of Natural Language Processing, Second,
Chapman and Hall/CRC Press, 2010. Edition
4. Tanveer Siddiqui, U.S. Tiwary, Natural Language Processing and Information Retrieval, Oxford
University Press, 2008.
 R-20 Syllabus for CSE, JNTUK w. e. f. 2020 – 21

JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY KAKINADA

KAKINADA – 533 003, Andhra Pradesh, India

DEPARTMENT OF COMPUTER SCIENCE & ENGINEERING

L T P C
Honors Course
4 0 0 4
REINFORCEMENT LEARNING
(AI & ML)

Course Objectives:
By the end of the class students should be able to:
x Define the key features of reinforcement learning that distinguishes it from AI and non-interactive
machine learning.
x Given an application problem (e.g. from computer vision, robotics, etc), decide if it should be
formulated as a RL problem; if yes be able to define it formally (in terms of the state space, action
space, dynamics and reward model), state what algorithm (from class) is best suited for addressing it
and justify your answer.

Course Outcomes:
By the end of this course, students should be able to do the following:
1. Learn how to define RL problems like Tic-Tac-Toe, Multi-arm.
2. Student will be able to understand the finite markov decision processes.
3. Student will be to Understand Monte Carlo Methods and how it is work with tabular methods to
solve classical control problems
4. Student should aware of Eligibility Traces and Understand how to find with approximate
solutions.
5. Explore imitation learning tasks and solutions
6. Recognize current advanced techniques and applications in RL

UNIT I:
Reinforcement Learning Problem: Introduction, Elements of Reinforcement Learning, Limitations and
Scope, Tic-Tac-Toe, Multi-arm Bandits: n-Armed Bandit Problem, Action-Value Methods, Incremental
Implementation, Tracking Nonstationary Problem, Optimistic Initial Values, Upper-Confidence-Bound
Action Selection, Gradient Bandit, Associative Search.

UNIT II:
Finite Markov Decision Processes: Agent-Environment Interface, Markov Property, Markov Decision
Processes, Value Functions, Optimal Value Functions, Optimality and Approximation, Dynamic
Programming: Policy- Evaluation, Improvement, Iteration, Value Iteration, Asynchronous Dynamic
Programming, Generalized Policy Iteration, Efficiency of Dynamic Programming.

UNIT III:
Monte Carlo Methods: Monte Carlo- Prediction, Estimation of Action Values, Control, Control without
Exploring Start, Temporal- Difference learning: TD Prediction, Advantages of TD Prediction Methods,
Optimality of TD(0), Sarsa: On-Policy TD Control, Q-Learning, Games, Afterstates.

UNIT IV:
Eligibility Traces: n-Step TD Prediction, Forward and Backward View of TD(λ), Equivalences of
Forward and Backward Views, saras(λ), Watkin’s Q(λ), Off-policy Eligibility Traces using Important
Sampling, Variable λ.

UNIT V:
Planning and Learning with Tabular Methods: Models and Planning, Integrating Planning, Acting and
Learning, Prioritized Sweeping, Full vs. Sample Backups, Trajectory Sampling, Heuristic Search, Monte
Carlo Tree Search.
 R-20 Syllabus for CSE, JNTUK w. e. f. 2020 – 21

JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY KAKINADA

KAKINADA – 533 003, Andhra Pradesh, India

DEPARTMENT OF COMPUTER SCIENCE & ENGINEERING

Text Book:
1. Rich S. Sutton, Andrew G. Barto, Reinforcement Learning: An Introduction, Second Edition, MIT
Press, 2015.
2. Boris Belousov, Hany Abdulsamad, Pascal Klink, Simone parisi, Reinforcement Learning Algorithms:
Analysis and Applications, 1st Edition, Springer, 2021.

Reference Books:
1. Phil Winder, Reinforcement Learning: Industrial Applications of Intelligent Agent, 1st Edition,
O’Reilly, 2020.
2. Kyriakos G. Vamvoudakis, Yan Wan, Frank, L. Lewis, Derya Cansever, Handbook of Reinforcement
Learning and Control, 1st Edition, Springer, 2021.

NPTEL Link: Reinforcement Learning: https://onlinecourses.nptel.ac.in/noc22_cs34/preview

 R-20 Syllabus for CSE, JNTUK w. e. f. 2020 – 21

JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY KAKINADA

KAKINADA – 533 003, Andhra Pradesh, India

DEPARTMENT OF COMPUTER SCIENCE & ENGINEERING

L T P C
II Year - II Semester Honors Course
4 0 0 4
INTERNET OF THINGS
(Systems Engineering)

Course Objectives:
The main objectives of this course are
x Vision and Introduction to Internet of Things (IoT).
x Understand IoT Market perspective.
x Data and Knowledge Management and use of Devices in IoT Technology.
x Understand State of the Art – IoT Architecture.
x Understand Real World IoT Design Constraints, Industrial Automation and Commercial.

Course Outcomes (COs):

At the end of the course, student will be able to
x Explain in a concise manner how the general Internet as well as Internet of Things work.
x Understand constraints and opportunities of wireless and mobile networks for Internet of Things.
x Use basic sensing and measurement and tools to determine the real-time performance of
network of devices.
x Develop prototype models for various applications using IoT technology.

UNIT I:
The Internet of Things: An Overview of Internet of things, Internet of Things Technology, behind IoTs
Sources of the IoTs, M2M Communication, Examples of IoTs, Design Principles For Connected Devices
Internet Connectivity Principles, Internet connectivity, Application Layer Protocols: HTTP, HTTPS,
FTP, Telnet.

UNIT II:
Business Models for Business Processes in the Internet of Things ,IoT/M2M systems LAYERS AND
designs standardizations ,Modified OSI Stack for the IoT/M2M Systems, ETSI M2M domains and High-
level capabilities ,Communication Technologies, Data Enrichment and Consolidation and Device
Management Gateway Ease of designing and affordability

UNIT III:
Design Principles for the Web Connectivity for connected-Devices, Web Communication protocols for
Connected Devices, Message Communication protocols for Connected Devices, Web Connectivity for
connected-Devices.

UNIT IV:
Data Acquiring, Organizing and Analytics in IoT/M2M, Applications /Services /Business Processes,
IOT/M2M Data Acquiring and Storage, Business Models for Business Processes in the Internet Of
Things, Organizing Data, Transactions, Business Processes, Integration and Enterprise Systems.

UNIT V:
Data Collection, Storage and Computing Using a Cloud Platform for IoT/M2M Applications/Services,
Data Collection, Storage and Computing Using cloud platform Everything as a service and Cloud Service
Models, IOT cloud-based services using the Xively (Pachube/COSM), Nimbits and other platforms
Sensor, Participatory Sensing, Actuator, Radio Frequency Identification, and Wireless, Sensor Network
Technology, Sensors Technology, Sensing the World.
 R-20 Syllabus for CSE, JNTUK w. e. f. 2020 – 21

JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY KAKINADA

KAKINADA – 533 003, Andhra Pradesh, India

DEPARTMENT OF COMPUTER SCIENCE & ENGINEERING

Text Books:
1. Internet of Things: Architecture, Design Principles And Applications, Rajkamal, McGraw Hill
Higher Education
2. Internet of Things, A.Bahgya and V.Madisetti, Univesity Press,2015

Reference Books:
1. Designing the Internet of Things, Adrian McEwen and Hakim Cassimally, Wiley
2. Getting Started with the Internet of Things, CunoPfister , Oreilly
 R-20 Syllabus for CSE, JNTUK w. e. f. 2020 – 21

JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY KAKINADA

KAKINADA – 533 003, Andhra Pradesh, India

DEPARTMENT OF COMPUTER SCIENCE & ENGINEERING

L T P C
Honors Course
4 0 0 4
DATA COMMUNICATIONS AND INFORMATION CODING THEORY
(Systems Engineering)

Course Objective:
The objective of this course is to introduce the basic concepts of information theory and coding, including
information, source coding, channel model, channel capacity, channel coding and so on.

Course Outcomes:
The students at the end of the course will be able to:
x Understand and explain the basic concepts of information theory, source coding, channel and
channel capacity, channel coding and relation among them.
x Describe the real life applications based on the fundamental theory.
x Calculate entropy, channel capacity, bit error rate, code rate, steady-state probability and so on.
x Implement the encoder and decoder of one block code or convolutional code using any program
language

UNIT I:
Overview; Basic Concepts - Entropy and Mutual information; Lossless Source Coding – Source entropy
rate; Kraft inequality; Huffman code; Asymptotic equipartition property; Universal coding; Noisy
Channel Coding - Channel capacity

UNIT II:
Random channel codes; Noisy channel coding theorem for discrete memory-less channels; Typical
sequences; Error exponents; Feedback; Continuous and Gaussian channels; Lossy Source Coding - Rate-
Distortion functions; Random source codes; Joint source-channel coding and the separation theorem.

UNIT III:
Source coding- Text, Audio and Speech: Adaptive Huffman Coding, Arithmetic Coding, LZW algorithm
– Audio: Perceptual coding, Masking techniques, Psychoacoustic model, MEG Audio layers I,II,III,
Dolby AC3 - Speech: Channel Vocoder, Linear Predictive Coding

UNIT IV:
Source coding- Image and Video: Image and Video Formats – GIF, TIFF, SIF, CIF, QCIF – Image
compression: READ, JPEG – Video Compression: Principles-I,B,P frames, Motion estimation, Motion
compensation, H.261, MPEG standard

UNIT V:
Error control coding- Block codes: Definitions and Principles: Hamming weight, Hamming distance,
Minimum distance decoding - Single parity codes, Hamming codes, Repetition codes - Linear block
codes, Cyclic codes - Syndrome calculation, Encoder and decoder – CRC Error control coding

Text books:
1. Mark Kelbert(Author), Yuri Suhov, Information Theory and Coding by Example, Cambridge
University Press,2013

Reference books:
1. Simon Haykin and Michael Moher, Communication Systems, 5th Edition, Wiley, 2010
2. T.M. & Thomas, J.A. (2006). Elements of information theory. New York: Wiley.
3. Ad´amek, Foundations of coding, Wiley Interscience, 1991.
4. T. M. Cover and J. A. Thomas, Elements of information theory, Wiley, 1991.
 R-20 Syllabus for CSE, JNTUK w. e. f. 2020 – 21

JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY KAKINADA

KAKINADA – 533 003, Andhra Pradesh, India

DEPARTMENT OF COMPUTER SCIENCE & ENGINEERING

L T P C
Honors Course
4 0 0 4
SERVICE ORIENTED ARCHITECTURES
(Systems Engineering)

Course Objectives:
x To gain understanding of the basic principles of service orientation
x To learn service oriented analysis techniques
x To learn technology underlying the service design
x To learn the concepts such as SOAP, Registering and Discovering Services.

Course Outcomes: At the end of this course, students are expected to gain the following learning:
1. Get the foundations and concepts of service based computing
2. Advocate the importance and means of technology alignment with business
3. Understanding the basic operational model of web services,
4. Gain the knowledge of key technologies in the service oriented computing arena
5. Apply and practice the learning through a real or illustrative project/case study.

UNIT I
Software Architecture: Need for Software Architecture, Objectives of Software Architecture, Types of
Information Technology (IT) Architecture, Architectural Patterns and Styles
Architecting Process for Software Applications: Architectural Considerations, Architecting Process for
Software Applications, Level 0: High-Level Architecture, Level 1: Solution Architecture Detailed Design

UNIT II
SOA and MSA Basics: Service Orientation in Daily Life, Evolution of SOA and MSA Service-oriented
Architecture and Microservices architecture –Drivers for SOA, Dimensions of SOA, Conceptual Model of
SOA, Standards And Guidelines for SOA, Emergence of MSA
Service-Oriented Architecture: Considerations for Enterprise-wide SOA, Strawman Architecture for
Enterprise-wide SOA, Enterprise SOA Reference Architecture, Object-oriented Analysis and Design
(OOAD) Process, Service-oriented Analysis and Design (SOAD) Process

UNIT III
Service-Oriented Applications: Considerations for Service-oriented Applications, Patterns for SOA,
Pattern-based Architecture for Service-oriented Applications, Composite Applications, Composite
Application Programming Model
Service-Oriented Analysis and Design: Need for Models, Principles of Service Design Non-functional
Properties for Services, Design of Activity Services (or Business Services) Design of Data Services,
Design of Client Services, Design of Business Process Services

UNIT IV
Microservices Architecture:
Trend in SOA – Microservices Architecture (MSA): Services Model for Cloud and Mobile Solutions,
API Adoption on the Rise, Challenges and Takeways from SOA Implementations Architecture Trend –
Microservices Architecture, Microservices Architecture in Action
Cloud and MSA:Cloud Services, Hybrid Cloud Services, Considerations for Hybrid Cloud Services,
Cloud Services and MSA, MSA for SMAC Solutions

UNIT V
Mobile and MSA: Mobile Technologies, Types of Mobile Applications, MSA for mobile solutions Case
Study: SOA – Loan Management System (LMS) PoC, MSA – APIary PoC
 R-20 Syllabus for CSE, JNTUK w. e. f. 2020 – 21

JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY KAKINADA

KAKINADA – 533 003, Andhra Pradesh, India

DEPARTMENT OF COMPUTER SCIENCE & ENGINEERING

Text Book:
1. Shankar Kambhampaty, Service - Oriented Architecture & Microservices Architecture, 3ed: For
Enterprise, Cloud, Big Data and Mobile , ISBN: 9788126564064,Wiley.
2. Mark Richards, Microservices vs Service-Oriented Architecture, O’Reilly Media, Inc., 2016.

Reference Books:
1. Thomas Erl, Services-Oriented Architecture: Concepts, Technology and Design, Prentice Hall, 2005.
2. Guido Schmutz, Peter Welkenbach, Daniel Liebhart, Service-Oriented Architecture: An Integration
Blueprint, Packt Publisher, 2010.
 R-20 Syllabus for CSE, JNTUK w. e. f. 2020 – 21

JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY KAKINADA

KAKINADA – 533 003, Andhra Pradesh, India

DEPARTMENT OF COMPUTER SCIENCE & ENGINEERING

L T P C
Honors Course
4 0 0 4
DESIGN OF SECURE PROTOCOLS
(Systems Engineering)

Course Objectives:
The main objective of this course is that to explore various protocols and design of various protocols with
deeper security.

Course Outcomes:
By the end of the course Student will
x Get the exposure to various protocols.
x Gain knowledge on various secure mechanisms through set of protocols.
x Efficiently design new set of protocols.
x Learn Security issues and overcome means with protocols.

UNIT – I:
OSI:ISO Layer Protocols: Application Layer Protocols, TCP/IP, HTTP, SHTTP, LDAP, MIME, POP &
POP3, RMON, SNTP, SNMP. Presentation Layer Protocols, Light Weight Presentation Protocol Session
layer protocols.

UNIT – II:
RPC protocols, transport layer protocols, ITOT, RDP, RUDP, TALI, TCP/UDP, compressed TCP.
Network layer Protocols, routing protocols, border gateway protocol-exterior gateway protocol, internet
protocol IPv4, IPv6, Internet Message Control Protocol, IRDP Transport Layer Security, TSL, SSL, DTLS

UNIT – III :
Data Link layer Protocol, ARP, In ARP, IPCP, IPv6CP, RARP, SLIP .Wide Area and Network Protocols,
ATM protocols, Broadband Protocols, Point to Point Protocols, Other WAN Protocols, security issues.

UNIT – IV:
Local Area Network and LAN Protocols, ETHERNET Protocols, VLAN protocols, Wireless LAN
Protocols, Metropolitan Area Network Protocol, Storage Area Network and SAN

UNIT – V :
Protocols, FDMA, WIFI and WIMAX Protocols, security issues. Mobile IP, Mobile Support Protocol for
IPv4 and IPv6, Resource Reservation Protocol. Multicasting Protocol, VGMP, IGMP, MSDP .Network
Security and Technologies and Protocols, AAA Protocols, Tunneling Protocols, Secured Routing
Protocols, GRE- Generic Routing Encapsulation, IPSEC– Security.

Text Books:
1. Jawin: “Networks Protocols Handbook”, 3rd Edition, Jawin Technologies Inc., 2005.
2. Bruce Potter and Bob Fleck : “802.11 Security”, 1st Edition, O’Reilly Publications, 2002.

Reference Books:
1. Ralph Oppliger :“SSL and TSL: Theory and Practice”, 1st Edition, Arttech House, 2009.
2. Lawrence Harte: “Introduction to CDMA- Network services Technologies and Operations”, 1st Edition,
Althos Publishing, 2004.
3. Lawrence Harte: “Introduction to WIMAX”, 1st Edition, Althos Publishing, 2005
 R-20 Syllabus for CSE, JNTUK w. e. f. 2020 – 21

JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY KAKINADA

KAKINADA – 533 003, Andhra Pradesh, India

DEPARTMENT OF COMPUTER SCIENCE & ENGINEERING

L T P C
Honors Course
4 0 0 4
NETWORK CODING
(Systems Engineering)

Course Objectives:
x Students will gain the understanding of core network programming by using sockets and transport
layer protocols like TCP and UDP
x Students will gain the understanding of inter process communication and implementation of
different forms of IPC in client-server environment
x Students will get an exposure to various application layer protocols which are designed using
sockets and transport layer protocols

Course Outcomes:
By the end of the course, the student will be able to
x Explain the client-server paradigm and socket structures.
x Describe the basic concepts of TCP sockets and TCP echo client-server programs.
x Discuss the UDP sockets and UDP echo client-server programs.
x Explain Socket options and ability to understand IPC
x Apply the applications of sockets and demonstrate skill to design simple applications like FTP,
TELNET etc.

UNIT-I:
Introduction to Network Programming: OSI model, transport layer protocols: TCP, UDP and SCTP,
network architecture: client-server and peer-to-peer systems, Sockets-socket Address structures: IPv4,
IPv6 and Generic-value result arguments, Byte ordering functions, Byte manipulation functions, Address
conversion functions

UNIT-II:
TCP: introduction to TCP, TCP connection establishment and termination TIME_WAIT State.
Elementary TCP sockets, Socket, connect, bind, listen, accept, fork, exec function, concurrent servers,
Close function, read and write functions

UNIT-III:
TCP echo client server program, getsockname and getpeername functions I/O multiplexing: I/O models,
Select function, TCP echo server using select function, shutdown function, Poll function

UNIT-IV:
UDP: Introduction to UDP, difference between TCP and UDP, recvfrom( ) and sendto( ) functions, UDP
echo client server program, UDP echo client server using select function. Socket Options: IPv4 socket
options, IPv6 socket options

UNIT-V:
Socket Options: Generic socket options, TCP socket options. IPC: Introduction to IPC, forms of IPC,
UNIX kernel support for pipes, FIFO, message queues, semaphores and shared memory Network
programming concepts Implementation: FTP, ping, arp, SMTP, TELNET
 R-20 Syllabus for CSE, JNTUK w. e. f. 2020 – 21

JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY KAKINADA

KAKINADA – 533 003, Andhra Pradesh, India

DEPARTMENT OF COMPUTER SCIENCE & ENGINEERING

Text Books:
1. Unix Network programming, the socket networking API, W.Richard Stevens, bill fenner, Andrew
m.rudoff ,PHI.

References Books:
1. Advanced programming in the UNIX environment, W.Richard Stevens, pearson education
 R-20 Syllabus for CSE, JNTUK w. e. f. 2020 – 21

JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY KAKINADA

KAKINADA – 533 003, Andhra Pradesh, India

DEPARTMENT OF COMPUTER SCIENCE & ENGINEERING

L T P C
II Year - II Semester Honors Course
4 0 0 4
PRINCIPLES OF CYBER SECURITY
(Information Security)

Course Objectives:
x To learn threats and risks within context of the cyber security architecture.
x Student should learn and Identify security tools and hardening techniques.
x To learn types of incidents including categories, responses and timelines for response.

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

x Apply cyber security architecture principles.
x Demonstrate the risk management processes and practices.
x Appraise cyber security incidents to apply appropriate response
x Distinguish system and application security threats and vulnerabilities.
x Identify security tools and hardening techniques

UNIT–I:
Introduction to Cyber Security-Cyber security objectives, roles, differences between information
security and cyber security, Cyber security principles-confidentiality, integrity, availability, authentication
and non repudiation

UNIT–II:
Information Security within Lifecycle Management-Lifecycle management landscape, Security
architecture processes, Security architecture tools, Intermediate lifecycle management concepts, Risks &
Vulnerabilities-Basics of risk management, Operational threat environments, Classes of attacks

UNIT–III:
Incident Response-Incident categories, Incident response, Incident recovery, Operational security
protection-Digital and data assets, ports and protocols, Protection technologies, Identity and access
Management, configuration management

UNIT–IV:
Threat Detection and Evaluation Monitoring-Vulnerability management, Security logs and alerts,
Monitoring tools and appliances, Analysis-Network traffic analysis, packet capture and analysis

UNIT–V:
Introduction to backdoor System and security-Introduction to metasploit, backdoor, demilitarized zone
(DMZ), Digital signature, Brief study on Harding of operating system.

Text Books:
1. NASSCOM: Security Analyst Student Hand Book, Dec 2015
2. Information Security Management Principles, Updated Edition, David Alexander, Amanda
Finch, David Sutton, BCS publishers, June 2013

Reference Books:
1. Cyber Security Fundamentals-Cyber Security, Network Security and Data Governance Security, 2 nd
Edition, ISACA Publishers, 2019
 R-20 Syllabus for CSE, JNTUK w. e. f. 2020 – 21

JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY KAKINADA

KAKINADA – 533 003, Andhra Pradesh, India

DEPARTMENT OF COMPUTER SCIENCE & ENGINEERING

L T P C
Honors Course
4 0 0 4
COMPUTATIONAL NUMBER THEORY
(Information Security)

Course Objectives: This course will focus on designing efficient algorithms (and providing complexity
analysis) for the most important problems from number theory, with major applications in coding theory
and cryptography.

Course Outcomes:
Upon completing the course the student will be able to
x understand with basics of number theory and its applications.
x demonstrate the arithmetic of finite fields, polynomials.
x analyze the elliptic curves, testing and factorization.
x Student will be able to solve the discrete logarithms and large sparse linear systems.
x Student will be able to apply the skills for writing programs of cryptography algorithms.

UNIT I:
Arithmetic of Integers: Basic Arithmetic Operations, GCD, Congruences and Modular Arithmetic,
Linear Congruences, Polynomial Congruences, Quadratic Congruences, Multiplicative Orders, Continued
Fractions, Prime Number Theorem and Riemann Hypothesis, Running Times of Arithmetic Algorithms.

UNIT II:
Arithmetic of Finite Fields: Existence and Uniqueness of Finite Fields, Representation of Finite Fields,
Implementation of Finite Field Arithmetic, Arithmetic of Polynomials: polynomials over Finite Fields,
Finding Roots of Polynomials over Finite Fields, Factoring Polynomials over Finite Fields, Properties of
Polynomials with Integer Coefficients, Factoring Polynomials with Integer Coefficients.

UNIT III:
Arithmetic of Elliptic Curves: Elliptic Curve, Elliptic-Curve Group, Elliptic Curve over Finite Fields,
Pairing on Elliptic Curves,
Elliptic-Curve Point Counting, Primality Testing: Introduction, Probabilistic Primality Testing,
Deterministic Primality Testing, Primality Testing for Number of Special Forms.

UNIT IV:
Integer Factorization: Trial Division, Pollard’s Rho Method, Pollard’s p-1 Method, Dixon’s Method,
CFRAC Method, Quadratic Sieve Method, Cubic Sieve Method, Elliptic Curve Method, Number-Field
Sieve Method, Discrete Logarithms: Square-Root Methods, Algorithms: Prime Fields, Fields of
Characteristic Two, General Extension Fields, Elliptic Curves(ECDLP).

UNIT V:
Large Sparse Linear Systems: Structured Gaussian Elimination, Lanczos Method, Wiedemann Method,
Block Metods

Text Books:
1. Abhijit Das, Computational Number Theory, CRC Hall, 1 st Edition, 2013.
2. T. H. Cormen, C. E. Leiserson, R. Rivest and C. Stein, Introduction to Algorithms, Prentice Hall India,
2nd Edition, 2002.
 R-20 Syllabus for CSE, JNTUK w. e. f. 2020 – 21

JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY KAKINADA

KAKINADA – 533 003, Andhra Pradesh, India

DEPARTMENT OF COMPUTER SCIENCE & ENGINEERING

Reference Books:
1. Victor Shoup, A Computational Introduction to Number Theory and Algebra, 2 nd Edition, Cambridge
Iniversity Press, 2008.
2. R. Lidl and H. Niederreiter, Introduction to finite fields and their applications, Cambridge University
Press, 2021.
3. M. Mignotte, Mathematics for computer algebra, Springer-Verlag, 1992.
 R-20 Syllabus for CSE, JNTUK w. e. f. 2020 – 21

JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY KAKINADA

KAKINADA – 533 003, Andhra Pradesh, India

DEPARTMENT OF COMPUTER SCIENCE & ENGINEERING

L T P C
Honors Course
4 0 0 4
CRYPTANALYSIS
(Information Security)
 R-20 Syllabus for CSE, JNTUK w. e. f. 2020 – 21

JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY KAKINADA

KAKINADA – 533 003, Andhra Pradesh, India

DEPARTMENT OF COMPUTER SCIENCE & ENGINEERING

L T P C
Honors Course
4 0 0 4
ELLIPTIC CURVE CRYPTOGRAPHY
(Information Security)
 R-20 Syllabus for CSE, JNTUK w. e. f. 2020 – 21

JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY KAKINADA

KAKINADA – 533 003, Andhra Pradesh, India

DEPARTMENT OF COMPUTER SCIENCE & ENGINEERING

L T P C
Honors Course
4 0 0 4
INTRODUCTION TO QUANTUM COMPUTING AND QUANTUM
CRYPTOGRAPHY
(Information Security)
 R-20 Syllabus for CSE, JNTUK w. e. f. 2020 – 21

JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY KAKINADA

KAKINADA – 533 003, Andhra Pradesh, India

DEPARTMENT OF COMPUTER SCIENCE & ENGINEERING

L T P C
Honors Course
4 0 0 4
PUBLIC KEY INFRASTRUCTURE AND TRUST MANAGEMENT
(Information Security)

Course objectives:
The course is designed to train the graduates in depth understanding of Public Key Cryptography, Public
key Infrastructure, security credentials and design new or modify existing cryptographic techniques.

Course Outcomes:
Graduates after completing the course shall gain:
x In depth understanding of Public key cryptography and Infrastructure.
x Ability to design and analyze Public Key cryptographic techniques.
x Ability to solve network security issues in real time applications.
x Ability to take up doctoral level research work in security.

UNIT I:
Public key infrastructure: components and architecture. PKI interoperability, deployment and
assessment PKI data structures – certificates, validation, revocation, authentication, cross-certification.
Repository, Certification Authority (CA) and Registration Authority (RA), trusted third party, digital
certificates.

UNIT II:
PKI Services: Authentication, Integrity and Confidentiality, Mechanisms, Secure Communication, Secure
Time Stamping, Non-Repudiation, Privilege Management, Certificate policies, Certificate Authority,
Registration Authority.

UNIT III:
Key and Certificate Management: Key/Certificate Life Cycle Management, Certificate Revocation:
Periodic Public Mechanisms, performance, Scalability and Timeliness, Multiple Key pairs, Key Pair Uses,
Real-World Difficulties, Independent Certificate Management.

UNIT IV:
Trust Models: Strict Hierarchy of Certification Authorities, Distributed Trust Architecture, Web Model,
User-Centric Trust, Cross-Certification, Entity Naming, Certificate Path processing, PKI Information
Dissemination: Repositories and Techniques, private Dissemination, Public and Repositories, In-Band
Protocol Exchange.

UNIT V:
PKI Standards: Introduction, Major Standards Activities, X.509, PKIX, X.500, LDAP, ISO TC68, ANSI
X9f, S/MIME, IPsec, TLS, SPKI, OpenPGP, EDIFACT.

Text Books:
1. Carlisle Adams, Steve Lloyd, Understanding Public-Key Infrastructure: Concepts, Standards, and
Deployment Considerations, Sams, 1999.
2. John R. Vacca, Public Key Infrastructure, Building Trusted Applications and Web Services, Auerbach
Publications, 2004.
 R-20 Syllabus for CSE, JNTUK w. e. f. 2020 – 21

JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY KAKINADA

KAKINADA – 533 003, Andhra Pradesh, India

DEPARTMENT OF COMPUTER SCIENCE & ENGINEERING

Reference Books:
1. Messaoud Benantar, Introduction to the Public Key Infrastructure for the Internet, Pearson Education,
Prentice Hall, 2011.
2. Ashutosh Saxena, Public Key Infrastructure, Tata McGraw Hill.
 R-20 Syllabus for CSE, JNTUK w. e. f. 2020 – 21

JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY KAKINADA

KAKINADA – 533 003, Andhra Pradesh, India

DEPARTMENT OF COMPUTER SCIENCE & ENGINEERING

L T P C
Honors Course
4 0 0 4
INFORMATION SECURITY ANALYSIS AND AUDIT
(Information Security)

Course Objectives:
x Understanding and knowledge of Security Auditing, and introduce the Threats and defense in the
systems.
x Acquiring the knowledge on Evidence collection and evaluation techniques.

Course Outcomes:
At the end of the course, student will be able to
x Illustrate the fundamental concepts of information security and systems auditing
x Analyze the latest trend of computer security threats and defense
x Identify security weaknesses in information systems, and rectify them with appropriate security
mechanisms
x Explain the security controls in the aspects of physical, logical and operational security control and
case studies
x Evaluate the security of information systems

UNIT–I:
Overview of Information System Auditing- Effect of Computers on Internal Controls, Effects of
Computers on Auditing, Foundations of information Systems Auditing, Conducting an Information
Systems Audit.

UNIT–II:
The management Control Framework-I- Introduction, Evaluating the planning Function, Leading
Function, Controlling Function, Systems Development Management Controls, Approaches to Auditing
Systems Development, Normative Models of the Systems Development Process, Evaluating the Major
phases in the Systems Development Process, Programming Management Controls, Data Resource
Management Controls.

UNIT–III:
The Management Control Framework-II- Security Management Controls, Operations management
Controls Quality assurance Management Controls, Case Studies.

UNIT–IV:
Evidence Collection- Audit Software, Code Review, Test Data, and Code Comparison, Concurrent
Auditing techniques, Interviews, Questionnaires, and Control Flowcharts. Performance Management
tools- Case Studies.

UNIT–V:
Evidence Evaluation- Evaluating Asset Safeguarding and Data Integrity, Evaluating System,
Effectiveness, Evaluating System Efficiency, Information Systems Audit and Management: Managing the
Information Systems Audit Function.

Text Book:
1. Information Systems Control and Audit, 1st Edition, Ron Weber, Pearson Education, 2013

Reference Book:
1. Information System Audit and Assurance, D P Dube, TMH, New Delhi, 2008
 R-20 Syllabus for CSE, JNTUK w. e. f. 2020 – 21

JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY KAKINADA

KAKINADA – 533 003, Andhra Pradesh, India

DEPARTMENT OF COMPUTER SCIENCE & ENGINEERING

L T P C
Honors Course
4 0 0 4
CLOUD AND IOT SECURITY
(Information Security)

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

x Discuss about Security Requirements in IoT Architecture
x Explain Random number generation
x Demonstrate Authorization with Publish / Subscribe schemes
x Identify Lightweight and robust schemes for Privacy protection
x Explain about IoT cloud security architecture

UNIT I:
Introduction: Securing Internet of Things: Security Requirements in IoT Architecture, Security in
Enabling Technologies, Security Concerns in IoT Applications. Security Architecture in the Internet of
Things, Security Requirements in IoT, Insufficient Authentication /Authorization, Insecure Access
Control, Threats to Access Control, Privacy, and Availability, Attacks Specific to IoT. Vulnerabilities,
Secrecy and Secret-Key Capacity, Authentication/Authorization for Smart Devices, Transport
Encryption, Attack, Fault trees

UNIT II:
Cryptographic Fundamentals for IoT: Cryptographic primitives and its role in IoT, Encryption and
Decryption, Hashes, Digital Signatures, Random number generation, Cipher suites, key management
fundamentals, cryptographic controls built into IoT messaging and communication protocols.

UNIT III:
Identity & Access Management Solutions for IoT: Identity lifecycle, authentication credentials, IoT
IAM infrastructure, Authorization with Publish / Subscribe schemes and access control

UNIT IV:
Privacy Preservation and Trust Models for IoT: Concerns in data dissemination, Lightweight and
robust schemes for Privacy protection, Trust and Trust models for IoT, self-organizing Things, Preventing
unauthorized access.

UNIT V:
Cloud Security for IoT: Cloud services and IoT, offerings related to IoT from cloud service providers,
Cloud IoT security controls, enterprise IoT cloud security architecture, New directions in cloud enabled
IoT computing

Text Books:
1. Practical Internet of Things Security (Kindle Edition) by Bria Russell, Drew VanDuren

References Books:
1. Securing the Internet of Things, Elsevier
2. Security and Privacy in Internet of Things (IoTs): Models, Algorithms, and Implementations
 R-20 Syllabus for CSE, JNTUK w. e. f. 2020 – 21

JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY KAKINADA

KAKINADA – 533 003, Andhra Pradesh, India

DEPARTMENT OF COMPUTER SCIENCE & ENGINEERING

L T P C
Honors Course
4 0 0 4
WEB SECURITY
(Information Security)

Course Objectives:
x Underlying security principles of the web
x Overview of concrete threats against web applications
x Insights into common attacks and countermeasures
x Current best practices for secure web applications

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

x Demonstrate security concepts, security professional roles, and security resources in the context of
systems and security development life cycle
x Justify applicable laws, legal issues and ethical issues regarding computer crime
x Explain the business need for security, threats, attacks, top ten security vulnerabilities, and secure
software development
x Apply information security policies, standards and practices, the information security blueprint
x Analyze and describe security requirements for typical web application scenario

UNIT–I:
Introduction-A web security forensic lesson, Web languages, Introduction to different web attacks,
Overview of N-tier web applications, Web Servers-Apache, IIS.

UNIT-II:
Securing the Communication Channel- Understanding the dangers of an insecure communication
channel. Practical advice on deploying HTTPS, and dealing with the impact on your application, Insights
into the latest evolutions for HTTPS deployments.

UNIT–III:
Web Hacking Basics- HTTP & HTTPS URL, Web under the Cover Overview of Java security Reading
the HTML source, Applet Security Servlets Security Symmetric and Asymmetric Encryptions, Network
security Basics, Firewalls & IDS.

UNIT–IV:
Securely Handling Untrusted Data-Investigation of injection attacks over time, Understanding the cause
behind both server-side and client-side injection attacks, Execution of common injection attacks, and
implementation of various defenses.

UNIT–V:
Preventing Unauthorized Access-Understanding the interplay between authentication, authorization and
session management. Practical ways to secure the authentication process prevent authorization bypasses
and harden session management mechanisms, Securing Large Applications, Cyber Graffiti.

Text Books:
1. Web Hacking: Attacks and Defense, Latest Edition , McClure, Stuart, Saumil Shah, and Shreeraj
Shah, Addison Wesley, 2003
2. Professional Java Security, 1.3 Edition, Garms, Jess and Daniel Somerfield, Wrox, 2001
 R-20 Syllabus for CSE, JNTUK w. e. f. 2020 – 21

JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY KAKINADA

KAKINADA – 533 003, Andhra Pradesh, India

DEPARTMENT OF COMPUTER SCIENCE & ENGINEERING

L T P C
Honors Course
4 0 0 4
BLOCK CHAIN ARCHITECTURE DESIGN AND USE CASES
(Information Security)

Course Objectives:
By the end of the course, students will be able to
x Understand how block chain systems (mainly Bit coin and Ethereum) work and to
securelyinteract with them,
x Design, build, and deploy smart contracts and distributed applications,
x Integrate ideas from block chain technology into their own projects.

Course Outcomes:
At the end of the course, student will be able to
x Demonstrate the foundation of the Block chain technology and understand the
processes inpayment and funding.
x Identify the risks involved in building Block chain applications.
x Review of legal implications using smart contracts.
x Choose the present landscape of Blockchain implementations and Understand Crypto
currency markets
x Examine how to profit from trading crypto currencies.

UNIT I
Introduction, Scenarios, Challenges Articulated, Blockchain, Blockchain Characteristics, Opportunities
Using Blockchain, History of Blockchain.
Evolution of Blockchain : Evolution of Computer Applications, Centralized Applications, Decentralized
Applications, Stages in Blockchain Evolution, Consortia, Forks, Public Blockchain Environments, Type
of Players in Blockchain Ecosystem, Players in Market.

UNIT II
Blockchain Concepts: Introduction, Changing of Blocks, Hashing, Merkle-Tree, Consensus, Mining and
Finalizing Blocks, Currency aka tokens, security on blockchain, data storage on blockchain, wallets,
coding on blockchain: smart contracts, peer-to-peer network, types of blockchain nodes, risk associated
with blockchain solutions, life cycle of blockchain transaction.

UNIT III
Architecting Blockchain solutions: Introduction, Obstacles for Use of Blockchain, Blockchain Relevance
Evaluation Framework, Blockchain Solutions Reference Architecture, Types of Blockchain Applications.
Cryptographic Tokens, Typical Solution Architecture for Enterprise Use Cases, Types of Blockchain
Solutions, Architecture Considerations, Architecture with Blockchain Platforms, Approach for Designing
Blockchain Applications.

UNIT IV
Ethereum Blockchain Implementation: Introduction, Tuna Fish Tracking Use Case, Ethereum
Ecosystem, Ethereum Development, Ethereum Tool Stack, Ethereum Virtual Machine, Smart Contract
Programming, Integrated Development Environment, Truffle Framework, Ganache, Unit Testing,
Ethereum Accounts, MyEtherWallet, Ethereum Networks/Environments, Infura, Etherscan, Ethereum
Clients, Decentralized Application, Metamask, Tuna Fish Use Case Implementation, OpenZeppelin
Contracts
 R-20 Syllabus for CSE, JNTUK w. e. f. 2020 – 21

JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY KAKINADA

KAKINADA – 533 003, Andhra Pradesh, India

DEPARTMENT OF COMPUTER SCIENCE & ENGINEERING

UNIT V
Hyperledger Blockchain Implementation, Introduction, Use Case – Car Ownership Tracking, Hyperledger
Fabric, Hyperledger Fabric Transaction Flow, FabCar Use Case Implementation, Invoking Chaincode
Functions Using Client Application.
Advanced Concepts in Blockchain: Introduction, InterPlanetary File System (IPFS), Zero-Knowledge
Proofs, Oracles, Self-Sovereign Identity, Blockchain with IoT and AI/ML Quantum Computing and
Blockchain, Initial Coin Offering, Blockchain Cloud Offerings, Blockchain and its Future Potential.

Text Books:
1) Ambadas, Arshad Sarfarz Ariff, Sham “Blockchain for Enterprise Application Developers”,
Wiley
2) Andreas M. Antonpoulos, “Mastering Bitcoin: Programming the Open Blockchain” , O’Reilly

Reference Books:
1) Blockchain: A Practical Guide to Developing Business, Law, and Technology Solutions, Joseph
Bambara, Paul R. Allen, Mc Graw Hill.
2) Blockchain: Blueprint for a New Economy, Melanie Swan, O’Reilly

e-Resources:
1) https://github.com/blockchainedindia/resources
 R-20 Syllabus for CSE, JNTUK w. e. f. 2020 – 21

JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY KAKINADA

KAKINADA – 533 003, Andhra Pradesh, India

DEPARTMENT OF COMPUTER SCIENCE & ENGINEERING

L T P C
II Year - II Semester Honors Course
4 0 0 4
DATA VISUALIZATION
(Data Science)

Course Objectives:
The main objective of this course is to make it easier to identify patterns, trends and outliers in large data
sets

Course Outcomes:
On completion of this course, the student will be able to
x Identify and recognize visual perception and representation of data.
x Illustrate about projections of different views of objects.
x Apply various Interaction and visualization techniques.
x Analyze various groups for visualization.
x Evaluate visualizations

UNIT-I:
Introduction to Data Visualizations and Perception: Introduction of visual perception, visual
representation of data, Gestalt principles, Information overload.

UNIT-II :
Visual Representations: Creating visual representations, visualization reference model, visual mapping,
visual analytics, Design of visualization applications.

UNIT-III :
Classification of Visualization Systems: Classification of visualization systems, Interaction and
visualization techniques misleading, Visualization of one, two and multi-dimensional data, text and text
documents.

UNIT-IV :
Visualization of Groups: Visualization of groups, trees, graphs, clusters, networks, software,
Metaphorical visualization. Various visualization techniques, data structures used in data visualization.

UNIT-V :
Visualization of Volumetric Data And Evaluation of Visualizations: Visualization of volumetric data,
vector fields, processes and simulations, Visualization of maps, geographic information, GIS systems,
collaborative visualizations, evaluating visualizations

Text Books:
1. Ward, Grinstein, Keim, Interactive Data Visualization: Foundations, Techniques, and
Applications. Natick, 2nd edition,A K Peters, Ltd 2015.

Reference Books:
1. Tamara Munzner,Visualization Analysis & Design ,1 st edition,AK Peters Visualization Series
2014
2. Scott Murray,Interactive Data Visualization for the Web ,2nd Edition, 2017
 R-20 Syllabus for CSE, JNTUK w. e. f. 2020 – 21

JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY KAKINADA

KAKINADA – 533 003, Andhra Pradesh, India

DEPARTMENT OF COMPUTER SCIENCE & ENGINEERING

L T P C
Honors Course
4 0 0 4
STATISTICAL FOUNDATIONS FOR DATA SCIENCE
(Data Science)

Course Objectives:
The course will introduce the fundamental concepts of probability and statistics required for a program in
data science

Course outcomes:
By the end of the course, the student will be able to
x Use the statistical concepts in the field of data science.
x Employ the techniques and methods related to the area of data science in variety of applications.
x Apply logical thinking to understand and solve the problem in context.
x Explore statistical learning methods and their application to modern problems in science,
industry, and society.
x Build analytics pipelines for regression problems and classification problems

UNIT I:
Basics of Data Science: Introduction; Typology of problems; Importance of linear algebra, statistics and
optimization from a data science perspective; Structured thinking for solving data science problems.

UNIT II:
Probability, Statistics and Random Processes: Probability theory and axioms; Random variables;
Probability distributions and density functions (univariate and multivariate); Expectations and moments;
Covariance and correlation; Statistics and sampling distributions; Hypothesis testing of means,
proportions, variances and correlations; Confidence (statistical) intervals; Correlation functions; White-
noise process

UNIT III:
Probabilistic formulations of prediction problems: Plug-in estimators, empirical risk minimization, Linear
threshold functions, perceptron algorithm, Risk bounds, Concentration inequalities, Uniform
convergence, Rademacher averages; combinatorial dimensions, Convex surrogate losses for
classification, Linear regression, Regularization and linear model selection, Feature Selection
Methods, Cross Validation methods.

UNIT IV:
Game-theoretic formulations of prediction problems, High Dimensional methods, Lasso, Ridge
Regression, Dimensionality Reduction, Minimax strategies for log loss, linear loss, and quadratic loss,
Universal portfolios, Online convex optimization.

UNIT V:
Neural networks: Stochastic gradient methods, Combinatorial dimensions and Rademacher averages,
Hardness results for learning, Efficient learning algorithms.

Text Books:
1. Bendat, J. S. and A. G. Piersol. Random Data: Analysis and Measurement Procedures. 4th Edition.
John Wiley & Sons, Inc., NY, USA, 2010
2. Montgomery, D. C. and G. C. Runger. Applied Statistics and Probability for Engineers. 5th
Edition. John Wiley & Sons, Inc., NY, USA, 2011.
 R-20 Syllabus for CSE, JNTUK w. e. f. 2020 – 21

JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY KAKINADA

KAKINADA – 533 003, Andhra Pradesh, India

DEPARTMENT OF COMPUTER SCIENCE & ENGINEERING

3. James, G., Witten, D., Hastie, T., Tibshirani, R. An Introduction to Statistical Learning with
Applications in R, Springer, 2013.

Reference Books:
1. Hastie, T., Tibshirani, R. and Friedman, J. The Elements of Statistical Learning: Data Mining,
Inference, and Prediction, Second Edition, Springer, 2009.
 R-20 Syllabus for CSE, JNTUK w. e. f. 2020 – 21

JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY KAKINADA

KAKINADA – 533 003, Andhra Pradesh, India

DEPARTMENT OF COMPUTER SCIENCE & ENGINEERING

L T P C
Honors Course
4 0 0 4
MINING MASSIVE DATA SETS
(Data Science)

Course Objective: The course will discuss data mining and machine learning algorithms for analyzing
very large amounts of data. The emphasis will be on MapReduce and Spark as tools for creating parallel
algorithms that can process very large amounts of data.

Course Outcomes:
Upon completion of this course, the student will be able to:
1. Discuss research directions in Mining Massive Datasets, such as similarity search, streaming data,
clustering, and graph mining.
2. Analyze policy, focusing on methods for mining massive datasets and potential policy and
management applications, by synthesizing and summarizing the current state of the art, and facilitating
discussion by posing questions, preliminary conclusions, and ideas to explore.
3. Develop a research project relevant to Mining Massive Datasets and produce a report describing the
project's background, methods, results, and conclusions.
4. Knowledge of basic computer science principles and skills, at a level sufficient to write a reasonably
non-trivial computer program.
5. Good knowledge of Java and Python will be extremely helpful since most assignments will require the
use of Spark

UNIT I:
Data Mining: Data Mining, Statistical Limits on Data Mining, MapReduce: Distributed File Systems,
MapReduce, Algorithms Using MapReduce, Extensions to MapReduce.

UNIT II:
Finding Similar Items: Applications of Near-Neighbor Search, Shingling of Documents, Distance
Measures, Theory of Locality-Senstive Functions, Applications of LSH Hashing.

UNIT III:
Mining Data Streams: Stream Data Model, Sampling Data in Streams, Filtering Streams, Link Analysis:
PageRank, Efficient Computational of PageRank, Link Spam, Hubs and Authorities.

UNIT IV:
Frequent Itemsets: Market-Based Model, Market Based and A-Priori Algorithm, Limited- Pass
Algorithms, Clustering: Introduction, Hierarchical Clustering and K-means Algorithm, CURE Algorithm.

UNIT V:
Dimensionality Reduction: Eigenvalues and Eigenvectors, Principal-Component Analysis, CUR
Decomposition, Large-Scale Machine Learning: Machine Learning Model, Perceptrons, SVM’s, Nearest
Neighbors.

Text Books:
1. Jure Leskovec, Anand Rajaraman, Jeffery D. ULLman, Mining of Massive Datasets, Cambridge
University Press, 2014.
2. Pattern Recognition and Machine Learning. Christopher Bishop. Springer-Verlag New York. 2006.
 R-20 Syllabus for CSE, JNTUK w. e. f. 2020 – 21

JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY KAKINADA

KAKINADA – 533 003, Andhra Pradesh, India

DEPARTMENT OF COMPUTER SCIENCE & ENGINEERING

Reference Books:
1. Machine Learning: A Probabilistic Perspective. Kevin Murphy. MIT Press. 2012
2. The Elements of Statistical Learning: Data Mining, Inference, and Prediction. Trevor Hastie, Robert
Tibshirani, Jerome Friedman. Springer. 2013
 R-20 Syllabus for CSE, JNTUK w. e. f. 2020 – 21

JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY KAKINADA

KAKINADA – 533 003, Andhra Pradesh, India

DEPARTMENT OF COMPUTER SCIENCE & ENGINEERING

L T P C
Honors Course
4 0 0 4
MEDICAL IMAGE DATA PROCESSING
(Data Science)

Course Objectives:
The course will provide the participants with an up-to-date background in current state-of-the-art
in medical imaging and medical image analysis. The aim of the course is to show how to extract, model,
and analyze information from medical data and applications in order to help diagnosis, treatment and
monitoring of diseases through computer science.

Course Outcomes: At the End of the Course:

1. Student will be able to explain the basic concepts of Medical Imaging Technologies, Systems and
Formation Principles.
2. Student will be able to analyze the Medical Image Storage and Processing.
3. Student will be able to visualize the MRI, NMR and Artifacts.
4. Student should expertise the Segmentation and Classification techniques on Medical Image Data.
5. Student will be able to analyze the Nuclear Imaging like PET, SPECT and 3D Images.

UNIT I:
Introduction: Introduction to Medical Imaging Technology, Systems, and Modalities. Brief History,
Importance, Applications, Trends, Challenges. Medical Image Formation Principles: X-Ray physics, X-
Ray generation, Attenuation, Scattering, Dose Basic Principles of CT, Reconstruction Methods,
Artifacts, CT hardware.

UNIT II:
Storage and Processing: Medical Image Storage, Archiving and Communication Systems and Formats
Picture archiving and communication system (PACS); Formats: DICOM Radiology Information Systems
(RIS) and Hospital Information Systems (HIS). Medical Image Processing, Enhancement, Filtering
Basic image processing algorithms Thresholding, contrast enhancement, SNR characteristics;
filtering; histogram modeling.

UNIT III:
Visualization: Medical Image Visualization Fundamentals of Visualization, Surface and
Volume Rendering/Visualization, Animation, Interaction. Magnetic Resonance Imaging (MRI)
Mathematics of MR, Spin Physics, NMR Spectroscopy, Imaging Principles and Hardware, Image
Artifacts.

UNIT IV:
Segmentation And Classification: Medical Image Segmentation, Histogram-Based Methods, Region
Growing and Watersheds, Markov Random Field Models, Active Contours, Model-Based Segmentation.
Multi-Scale Segmentation, Semi-Automated Methods, Clustering-Based Methods, Classification-Based
Methods, Atlas-Guided Approaches, Multi-Model Segmentation. Medical Image Registration Intensity-
Based Methods, Cost Functions, Optimization Techniques.

UNIT V:
Nuclear Imaging: PET and SPECT Ultrasound Imaging Methods, Mathematical Principles, Resolution,
Noise Effect, 3D Imaging, Positron Emission Tomography, Single Photon Emission Tomography,
Ultrasound Imaging, Applications. Medical Image Search and Retrieval Current Technology in Medical
Image Search, Content-Based Image Retrieval, New Trends: Ontologies, Applications, Other Applications
Of Medical Imaging Validation, Image Guided Surgery, Image Guided Therapy, Computer
Aided Diagnosis/Diagnostic Support Systems.
 R-20 Syllabus for CSE, JNTUK w. e. f. 2020 – 21

JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY KAKINADA

KAKINADA – 533 003, Andhra Pradesh, India

DEPARTMENT OF COMPUTER SCIENCE & ENGINEERING

Text Books:
1. Paul Suetens, "Fundamentals of Medical Imaging", Second Edition, Cambridge University Press,
2009.
2. J. Michael Fitzpatrick and Milan Sonka, "Handbook of Medical Imaging, Volume 2. Medical Image
Processing and Analysis", SPIE Publications, 2009.

Reference Books:
1. Kayvan Najarian and Robert Splinter, "Biomedical Signal and Image Processing", Second Edition,
CRC Press, 2005.
2. Geoff Dougherty, "Digital Image Processing for Medical Applications", First Edition,
Cambridge University Press, 2009.
3. Jerry L. Prince and Jonathan Links, "Medical Imaging Signals and Systems", First Edition 1, Prentice
Hall, 2005.
4. John L. Semmlow, "Biosignal and Medical Image Processing", Second Edition, CRC Press, 2008.