R-19 Syllabus for CSE. JNTUK w. e. f.

2019-20

JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY: KAKINADA

KAKINADA – 533 003, Andhra Pradesh, India

DEPARTMENT OF COMPUTER SCIENCE & ENGINEERING

III Year – I SEMESTER

S.No Course Courses L T P Credits

Code
1 CS3101 Data Warehousing and Data Mining 3 0 0 3
2 CS3102 Computer Networks 3 0 0 3
3 CS3103 Compiler Design 3 0 0 3
4 CS3104 Artificial Intelligence 3 0 0 3
5 PE3101 Professional Elective- I 3 0 0 3
1. Computer Graphics
2. Principles of Programming Languages
3. Advanced Data Structures
4. Software Testing Methodologies
5. Advanced Computer Architecture
6 CS3105 Computer Networks Lab 0 0 2 1
7 CS3106 AI Tools & Techniques Lab 0 0 3 1.5
8 CS3107 Data Mining Lab 0 0 3 1.5
9 MC3101 Employability Skills -II* 2 0 0 0
Total 17 0 8 19
*Internal Evaluation through Seminar / Test for 50 marks

III Year – II SEMESTER

S.No Course Courses L T P Credits

Code
1 CS3201 Web Technologies 3 0 0 3
2 CS3202 Distributed Systems 3 0 0 3
3 CS3203Design and Analysis of Algorithms 3 0 0 3
4 PE3201Professional Elective -II 3 0 0 3
(NPTEL/SWAYAM)
Duration: 12 Weeks Minimum
*Course/subject title can’t be repeated
5 OE3201 Open Elective- I (Inter Disciplinary) 3 0 0 3
6 HS3201 Managerial Economics and Financial 3 0 0 3
Accountancy
7 CS3204 Web Technologies Lab 0 0 4 2
9 PR3201 Industrial Training / Skill Development 0 0 0 1
Programmes / Research Project in higher
learning institutes
Total 18 0 4 21
 R-19 Syllabus for CSE. JNTUK w. e. f. 2019-20

JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY: KAKINADA

KAKINADA – 533 003, Andhra Pradesh, India

DEPARTMENT OF COMPUTER SCIENCE & ENGINEERING

L T P C
III Year – II Semester
3 0 0 3
WEB TECHNOLOGIES
Course Objectives:
From the course the student will learn
x Translate user requirements into the overall architecture and implementation of new
systems and Manage Project and coordinate with the Client
x Write backend code in PHP language and Writing optimized front end code HTML and
JavaScript
x Understand, create and debug database related queries and Create test code to validate the
applications against client requirement
x Monitor the performance of web applications & infrastructure and Troubleshooting web
application with a fast and accurate a resolution
Course Outcomes:
x Illustrate the basic concepts of HTML and CSS & apply those concepts to design static
web pages
x Identify and understand various concepts related to dynamic web pages and validate them
using JavaScript
x Outline the concepts of Extensible markup language & AJAX
x Develop web Applications using Scripting Languages & Frameworks
x Create and deploy secure, usable database driven web applications using PHP and RUBY
UNIT I
HTML: Basic Syntax, Standard HTML Document Structure, Basic Text Markup, Html styles,
Elements, Attributes, Heading, Layouts, Html media, Iframes Images, Hypertext Links, Lists,
Tables, Forms, GET and POST method, HTML 5, Dynamic HTML.
CSS: Cascading style sheets, Levels of Style Sheets, Style Specification Formats, Selector Forms,
The Box Model, Conflict Resolution, CSS3.
UNIT II
Javascript - Introduction to Javascript, Objects, Primitives Operations and Expressions, Control
Statements, Arrays, Functions, Constructors, Pattern Matching using Regular Expressions,
Fundamentals of Angular JS and NODE JS Angular Java Script- Introduction to Angular JS
Expressions: ARRAY, Objects, Strings, Angular JS Form Validation & Form Submission.
Node.js- Introduction, Advantages, Node.js Process Model, Node JS Modules, Node JS File
system, Node JS URL module, Node JS Events.
UNIT III
Working with XML: Document type Definition (DTD), XML schemas, XSLT, Document object
model, Parsers - DOM and SAX.
AJAX A New Approach: Introduction to AJAX, Basics of AJAX, XML Http Request Object,
AJAX UI tags, Integrating PHP and AJAX.
UNIT IV
PHP Programming: Introduction to PHP, Creating PHP script, Running PHP script. Working with
variables and constants: Using variables, Using constants, Data types, Operators. Controlling
program flow: Conditional statements, Control statements, Arrays, functions.
 R-19 Syllabus for CSE. JNTUK w. e. f. 2019-20

JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY: KAKINADA

KAKINADA – 533 003, Andhra Pradesh, India

DEPARTMENT OF COMPUTER SCIENCE & ENGINEERING

UNIT V
Web Servers- IIS (XAMPP, LAMP) and Tomcat Servers. Java Web Technologies-Introduction to
Servlet, Life cycle of Servlet, Servlet methods, Java Server Pages.
Database connectivity – Servlets, JSP, PHP, Practice of SQL Queries.
Introduction to Mongo DB and JQuery.
Web development frameworks – Introduction to Ruby, Ruby Scripting, Ruby on rails –Design,
Implementation and Maintenance aspects.
Text Books:
1) Programming the World Wide Web, 7th Edition, Robet W Sebesta, Pearson, 2013.
2) Web Technologies, 1st Edition 7th impression, Uttam K Roy, Oxford, 2012.
3) Pro Mean Stack Development, 1st Edition, ELad Elrom, Apress O’Reilly, 2016
4) Java Script & jQuery the missing manual, 2nd Edition, David sawyer mcfarland, O’Reilly,
2011.
5) Web Hosting for Dummies, 1st Edition, Peter Pollock, John Wiley & Sons, 2013.
6) RESTful web services, 1st Edition, Leonard Richardson, Ruby, O’Reilly, 2007.
Reference Books:
1) Ruby on Rails Up and Running, Lightning fast Web development, 1st Edition, Bruce
Tate, Curt Hibbs, Oreilly, 2006.
2) Programming Perl, 4th Edition, Tom Christiansen, Jonathan Orwant, O’Reilly, 2012.
3) Web Technologies, HTML, JavaScript, PHP, Java, JSP, XML and AJAX, Black book, 1st
Edition, Dream Tech, 2009.
4) An Introduction to Web Design, Programming, 1st Edition, Paul S Wang, Sanda S Katila,
Cengage Learning, 2003.
 R-19 Syllabus for CSE. JNTUK w. e. f. 2019-20

JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY: KAKINADA

KAKINADA – 533 003, Andhra Pradesh, India

DEPARTMENT OF COMPUTER SCIENCE & ENGINEERING

L T P C
III Year – II Semester
3 0 0 3
DISTRIBUTED SYSTEMS
Course Objectives:
x To understand the foundations of distributed systems.
x To learn issues related to clock Synchronization and the need for global state in distributed
systems
x To learn distributed mutual exclusion and deadlock detection algorithms
x To understand the significance of agreement, fault tolerance and recovery protocols in
Distributed Systems
x To learn the characteristics of peer-to-peer and distributed shared memory systems
Course Outcomes:
At the end of the course, the students will be able to:
x Elucidate the foundations and issues of distributed systems
x Illustrate the various synchronization issues and global state for distributed systems
x Illustrate the Mutual Exclusion and Deadlock detection algorithms in distributed systems
x Describe the agreement protocols and fault tolerance mechanisms in distributed systems
x Describe the features of peer-to-peer and distributed shared memory systems
UNIT I
Distributed Systems: Definition, Relation to computer system components, Motivation, Relation
to parallel systems, Message-passing systems versus shared memory systems, Primitives for
distributed communication, Synchronous versus asynchronous executions, Design issues and
challenges.
A model of distributed computations: A distributed program, A model of distributed executions,
Models of communication networks, Global state, Cuts, Past and future cones of an event, Models
of process communications.
Logical Time: A framework for a system of logical clocks, Scalar time, Vector time, Physical
clock synchronization: NTP.
UNIT II
Message Ordering & Snapshots: Message ordering and group communication: Message ordering
paradigms, Asynchronous execution with synchronous communication, Synchronous program
order on an asynchronous system, Group communication, Causal order (CO), Total order. Global
state and snapshot recording algorithms: Introduction, System model and definitions, Snapshot
algorithms for FIFO channels.
UNIT III
Distributed Mutex & Deadlock: Distributed mutual exclusion algorithms: Introduction –
Preliminaries – Lamport‘s algorithm – Ricart-Agrawala algorithm – Maekawa‘s algorithm –
Suzuki–Kasami‘s broadcast algorithm. Deadlock detection in distributed systems: Introduction –
System model – Preliminaries – Models of deadlocks – Knapp‘s classification – Algorithms for
the single resource model, the AND model and the OR model.
UNIT IV
Recovery & Consensus: Check pointing and rollback recovery: Introduction – Background and
definitions – Issues in failure recovery – Checkpoint-based recovery – Log-based rollback
 R-19 Syllabus for CSE. JNTUK w. e. f. 2019-20

JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY: KAKINADA

KAKINADA – 533 003, Andhra Pradesh, India

DEPARTMENT OF COMPUTER SCIENCE & ENGINEERING

recovery – Coordinated check pointing algorithm – Algorithm for asynchronous check pointing
and recovery. Consensus and agreement algorithms: Problem definition – Overview of results –
Agreement in a failure – free system – Agreement in synchronous systems with failures.
UNIT V
Peer-to-peer computing and overlay graphs: Introduction – Data indexing and overlays – Chord –
Content addressable networks – Tapestry.
Distributed shared memory: Abstraction and advantages – Memory consistency models –Shared
memory Mutual Exclusion.
Text Books:
1) Distributed Systems Concepts and Design, George Coulouris, Jean Dollimore and Tim
Kindberg, Fifth Edition, Pearson Education, 2012.
2) Distributed computing: Principles, algorithms, and systems, Ajay D Kshemkalyani and
Mukesh Singhal, Cambridge University Press, 2011.
Reference Books:
1) Distributed Operating Systems: Concepts and Design, Pradeep K Sinha, Prentice Hall of
India, 2007.
2) Advanced concepts in operating systems. Mukesh Singhal and Niranjan G. Shivaratri,
McGraw-Hill, 1994.
3) Distributed Systems: Principles and Paradigms, Tanenbaum A.S., Van Steen M.,Pearson
Education, 2007.
e-Resources:
1) https://nptel.ac.in/courses/106/106/106106168/
 R-19 Syllabus for CSE. JNTUK w. e. f. 2019-20

JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY: KAKINADA

KAKINADA – 533 003, Andhra Pradesh, India

DEPARTMENT OF COMPUTER SCIENCE & ENGINEERING

L T P C
III Year – II Semester
3 0 0 3
DESIGN AND ANALYSIS OF ALGORITHMS
Course Objectives:
x To provide an introduction to formalisms to understand, analyze and denote time
complexities of algorithms
x To introduce the different algorithmic approaches for problem solving through
numerous example problems
x To provide some theoretical grounding in terms of finding the lower bounds of algorithms
and the NP-completeness
Course Outcomes:
x Describe asymptotic notation used for denoting performance of algorithms
x Analyze the performance of a given algorithm and denote its time complexity using
the asymptotic notation for recursive and non-recursive algorithms
x List and describe various algorithmic approaches
x Solve problems using divide and conquer, greedy, dynamic programming, backtracking
and branch and bound algorithmic approaches
x Apply graph search algorithms to real world problems
x Demonstrate an understanding of NP- Completeness theory and lower bound theory
UNIT I
Introduction: Algorithm Definition, Algorithm Specification, performance Analysis, Performance
measurement, Asymptotic notation, Randomized Algorithms.
Sets & Disjoint set union: introduction, union and find operations.
Basic Traversal & Search Techniques: Techniques for Graphs, connected components and
Spanning Trees, Bi-connected components and DFS.
UNIT II
Divide and Conquer: General Method, Defective chessboard, Binary Search, finding the
maximum and minimum, Merge sort, Quick sort.
The Greedy Method: The general Method, container loading, knapsack problem, Job sequencing
with deadlines, minimum-cost spanning Trees.
UNIT III
Dynamic Programming: The general method, multistage graphs, All pairs-shortest paths, single-
source shortest paths: general weights, optimal Binary search trees, 0/1 knapsack, reliability
Design, The traveling salesperson problem, matrix chain multiplication.
UNIT IV
Backtracking: The General Method, The 8-Queens problem, sum of subsets, Graph coloring,
Hamiltonian cycles, knapsack problem.
Branch and Bound: FIFO Branch-and-Bound, LC Branch-and-Bound, 0/1 Knapsack problem,
Traveling salesperson problem.
UNIT V
NP-Hard and NP-Complete problems: Basic concepts, Cook’s Theorem.
String Matching: Introduction, String Matching-Meaning and Application, NaÏve String Matching
Algorithm, Rabin-Karp Algorithm, Knuth-Morris-Pratt Automata, Tries, Suffix Tree.
 R-19 Syllabus for CSE. JNTUK w. e. f. 2019-20

JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY: KAKINADA

KAKINADA – 533 003, Andhra Pradesh, India

DEPARTMENT OF COMPUTER SCIENCE & ENGINEERING

Text Books:
1) Ellis Horowitz, Sartaj Sahni, Sanguthevar Rajasekaran, “ Fundamentals of Computer
Algorithms”, 2nd Edition, Universities Press.
2) Harsh Bhasin, “ Algorithms Design & Analysis”, Oxford University Press.
Reference Books:
1) Horowitz E. Sahani S: “Fundamentals of Computer Algorithms”, 2 nd Edition, Galgotia
Piblications, 2008.
2) S. Sridhar, “Design and Analysis of Algorithms”, Oxford University Press.
e-Resources:
1) http://nptel.ac.in/courses/106101060/
 R-19 Syllabus for CSE. JNTUK w. e. f. 2019-20

JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY: KAKINADA

KAKINADA – 533 003, Andhra Pradesh, India

DEPARTMENT OF COMPUTER SCIENCE & ENGINEERING

L T P C
III Year – II Semester
3 0 0 3
PROFESSIONAL ELECTIVE -II

(NPTEL/SWAYAM) Course
Duration: 12 Weeks Minimum
*Course/subject title can’t be repeated

12 Weeks NPTEL Courses by NPTEL/SWAYAM courses

1) Introduction to Industry 4.0 and Industrial Internet of Things

2) AI: Knowledge Representation and Reasoning
3) Synthesis of Digital Systems
4) Privacy and Security in Online Social Media
5) Block chain architecture design and use cases
6) Machine Learning for Engineering and Science Applications
7) Randomized Algorithms
8) Parallel Algorithms
9) Hardware Security

Note: The courses listed here are just few examples. The student can take courses offered in CSE
discipline which are 12 weeks minimum duration.
 R-19 Syllabus for CSE. JNTUK w. e. f. 2019-20

JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY: KAKINADA

KAKINADA – 533 003, Andhra Pradesh, India

DEPARTMENT OF COMPUTER SCIENCE & ENGINEERING

L T P C
III Year – II Semester
3 0 0 3
OPEN ELECTIVE -I

Note: The student has to take any one open elective course offered in the other departments (or)
SWAYAM/NPTEL courses offered by other than parent department. (12 week minimum).
Given below are some of the courses offered by NPTEL/SWAYAM

Electronics & Communication Engineering Mathematics

1) Information Coding Theory 1) Optimization Techniques

2) VLSI Design 2) Computational Number Theory and
3) Signals & Systems Cryptography
4) Digital Signal Processing
Electrical and Electronics Engineering Civil Engineering

1) Networking Analysis 1) Intelligent transportation engineering

2) Fuzzy Sets, Logic and Systems & Applications 2) Remote Sensing and GIS
3) Energy Management Systems and SCADA 3) Engineering Mechanics
4) Industrial Safety Engineering 4) City and Metropolitan Planning
5) Sustainable Materials and Green
Buildings
Mechanical Engineering

1) Industrial Automation and Control

2) Robotics
3) CAD
4) Mechatronics And Manufacturing Automation
5) Non Conventional Energy Resources
 R-19 Syllabus for CSE. JNTUK w. e. f. 2019-20

JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY: KAKINADA

KAKINADA – 533 003, Andhra Pradesh, India

DEPARTMENT OF COMPUTER SCIENCE & ENGINEERING

L T P C
III 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.
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.

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)
 R-19 Syllabus for CSE. JNTUK w. e. f. 2019-20

JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY: KAKINADA

KAKINADA – 533 003, Andhra Pradesh, India

DEPARTMENT OF COMPUTER SCIENCE & ENGINEERING

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.
TEXT BOOKS:
A R Aryasri, Managerial Economics and Financial Analysis, The McGraw – Hill companies.

REFERENCES:
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-19 Syllabus for CSE. JNTUK w. e. f. 2019-20

JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY: KAKINADA

KAKINADA – 533 003, Andhra Pradesh, India

DEPARTMENT OF COMPUTER SCIENCE & ENGINEERING

L T P C
III Year – II Semester
0 0 4 2
WEB TECHNOLOGIES LAB
Course Objectives:
From the course the student will
x Learn the core concepts of both the frontend and backend programming course
x Get familiar with the latest web development technologies
x Learn all about PHP and SQL databases
x Learn complete web development process
Course Outcomes:
By the end of the course the student will be able to
x Analyze and apply the role of languages like HTML, CSS, XML
x Review JavaScript, PHP and protocols in the workings of the web and web applications
x Apply Web Application Terminologies, Internet Tools, E – Commerce and other web
services
x Develop and Analyze dynamic Web Applications using PHP & MySql
x Install & Use Frameworks
List of Experiments:
1) Design the following static web pages required for an online book store web site:

(a) HOME PAGE:

The static home page must contain three frames.
Top frame: Logo and the college name and links to Home page, Login page, Registration
page, Catalogue page and Cart page (the description of these pages will be given below).
Left frame: At least four links for navigation, which will display the catalogue of
respective links.
For e.g.: When you click the link “MCA” the catalogue for MCA Books should be
displayed in the Right frame.
Right frame: The pages to the links in the left frame must be loaded here. Initially this
page contains description of the web site.
 R-19 Syllabus for CSE. JNTUK w. e. f. 2019-20

JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY: KAKINADA

KAKINADA – 533 003, Andhra Pradesh, India

DEPARTMENT OF COMPUTER SCIENCE & ENGINEERING

(b) LOGIN PAGE:

(c) CATOLOGUE PAGE:

The catalogue page should contain the details of all the books available in the web site in a
table: The details should contain the following:
1. Snap shot of Cover Page.
2. Author Name.
3. Publisher.
4. Price.
5. Add to cart button.

(d). REGISTRATION PAGE:

Create a “registration form “with the following fields
1) Name (Text field) 2) Password (password field)
3) E-mail id (text field) 4) Phone number (text field)
5) Sex (radio button) 6) Date of birth (3 select boxes)
7) Languages known (check boxes – English, Telugu, Hindi, Tamil)
8) Address (text area)

2) Design a web page using CSS (Cascading Style Sheets) which includes the following: Use
different font, styles:
In the style definition you define how each selector should work (font, color etc.).
 R-19 Syllabus for CSE. JNTUK w. e. f. 2019-20

JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY: KAKINADA

KAKINADA – 533 003, Andhra Pradesh, India

DEPARTMENT OF COMPUTER SCIENCE & ENGINEERING

Then, in the body of your pages, you refer to these selectors to activate the styles

3) Design a dynamic web page with validation using JavaScript.

4) Design a HTML having a text box and four buttons viz Factorial, Fibonacci, Prime, and
Palindrome. When a button is pressed an appropriate javascript function should be called
to display
a. Factorial of that number
b. Fibonacci series up to that number
c. Prime numbers up to that number
d. Is it palindrome or not
5) Write JavaScript programs on Event Handling
a. Validation of registration form
b. Open a Window from the current window
c. Change color of background at each click of button or refresh of a
page
d. Display calendar for the month and year selected from combo box
e. On Mouse over event

6) Write an XML file which will display the Book information which includes the following:
1) Title of the book 2) Author Name 3) ISBN number
4) Publisher name 5) Edition 6) Price
a) Write a Document Type Definition (DTD) to validate the above XML file.
b) Write a XML Schema Definition (XSD) to validate the above XML file.

7) Create Web pages using AJAX.

8) User Authentication:
Assume four users user1, user2, user3 and user4 having the passwords pwd1, pwd2, pwd3
and pwd4 respectively. Write a PHP for doing the following.
1. Create a Cookie and add these four user id’s and passwords to this Cookie.
2. Read the user id and passwords entered in the Login form (week1) and authenticate with
the values (user id and passwords) available in the cookies.
If he is a valid user (i.e., user-name and password match) you should welcome him by name
(user-name) else you should display “You are not an authenticated user ’’.
Use init-parameters to do this.

9) Example PHP program for registering users of a website and login.

10) Install a database (Mysql or Oracle).

Create a table which should contain at least the following fields: name, password, email-
id, phone number (these should hold the data from the registration form).
Write a PHP program to connect to that database and extract data from the tables and
display them. Experiment with various SQL queries.
Insert the details of the users who register with the web site, whenever a new user clicks
the submit button in the registration page (week2).
11) Write a PHP which does the following job:
Insert the details of the 3 or 4 users who register with the web site (week9) by using
 R-19 Syllabus for CSE. JNTUK w. e. f. 2019-20

JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY: KAKINADA

KAKINADA – 533 003, Andhra Pradesh, India

DEPARTMENT OF COMPUTER SCIENCE & ENGINEERING

registration form. Authenticate the user when he submits the login form using the user
name and password from the database (similar to week8 instead of cookies).
12) Implement a Servlet program on request response processing.
13) Implement a Servlet program for Registration Page.
14) Connect to a database using JSP and practice SQL Queries (MySql or Oracle).
 R-19 Syllabus for CSE. JNTUK w. e. f. 2019-20

JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY: KAKINADA

KAKINADA – 533 003, Andhra Pradesh, India

DEPARTMENT OF COMPUTER SCIENCE & ENGINEERING

L T P C
III Year – II Semester
0 0 0 1
Industrial Training / Skill Development Programmes / Research Project in higher learning
institutes

Note: The Industrial Training / Skill Development Programmes / Research Project in higher
learning institutes should be taken during the semester gap between II B.Tech-II Semester and III
B.Tech-I Semester for a period of 4 weeks.