Syllabus for B. E.

V Semester 2021 – 2022

CURRICULUM
FOR THE ACADEMIC YEAR 2021-2022

DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING

B.E. V SEMESTER

POOJYA DODDAPPA APPA COLLEGE OF ENGINEERING

(An autonomous college under VTU)
KALABURAGI

1
 Syllabus for B. E. V Semester 2021 – 2022

SCHEME OF TEACHING FOR V SEMESTER - 2021-2022

B.E. (COMPUTER SCIENCE AND ENGINEERING)

Code No. Course Teaching Hours/Week Examination

Lecture Tutorial Practical CIE SEE Total Credits

19CS51 Python Programming 4 0 0 50 50 100 4
Finite Automata and
19CS52 4 0 0 50 50 100 4
Formal Language
Data Base Management
19CS53 4 0 0 50 50 100 4
System
Software Engineering
19CS54 3 0 0 50 50 100 3
and Testing
19CS55 Artificial Intelligence 3 0 0 50 50 100 3
Recruitment Process
19HU01 2 0 0 50 50 100 1
training - I
Python Programming
19CSL51 0 0 2 50 50 100 1
Lab
Data Base Management
19CSL52 0 0 2 50 50 100 1
System Lab
Web Application
19CSL53 0 2 2 50 50 100 2
Development Lab
Total 20 2 6 450 450 900 23

2
 AUTONOMOUS SYLLABUS FOR B.E V SEMESTER 2021-2022

Course Title: PYTHON PROGRAMMING

Subject Code : 19CS51 Credit : 4 CIE: 50
Number of Lecture Hours/Week 4 Hrs SEE: 50
Total Number of Lecture Hours 52 SEE Hours: 03
Prerequisites: Knowledge about programming languages like C or C++ and Oops concepts.
Course Objectives:
 To know the basics of algorithmic problem solving
 To read and write simple Python programs.
 To develop Python programs with conditionals and loops.
 To define Python functions and call them.
 To use Python data structures –- lists, tuples, dictionaries.
 To do input/output with files in Python.
MODULES Teaching Hours
Module I
DATA, EXPRESSIONS, STATEMENTS:
Python interpreter and interactive mode; values and types: int, float, boolean,
string, and list; variables, expressions, statements, tuple assignment,
precedence of operators, comments; modules and functions, function definition 10 Hrs
and use, flow of execution, parameters and arguments; Illustrative programs:
exchange the values of two variables, circulate the values of n variables,
distance between two points.
Module II
CONTROL FLOW, FUNCTIONS 9
Conditionals: Boolean values and operators, conditional (if), alternative (if-
else), chained conditional (if-elif-else); Iteration: state, while, for, break,
continue, pass; Fruitful functions: return values, parameters, local and global 10 Hrs
scope, function composition, recursion; Strings: string slices, immutability,
string functions and methods, string module; Lists as arrays. Illustrative
programs: square root, gcd, exponentiation, sum an array of numbers, linear
search, binary search.
Module III
LISTS, TUPLES, DICTIONARIES, OBJECT AND CLASSES
Lists: list operations, list slices, list methods, list loop, mutability, aliasing,
cloning lists, list parameters; Tuples: tuple assignment, tuple as return value;
Dictionaries: operations and methods; advanced list processing - list 11 Hrs
comprehension. File handling and exception handlings. Objects and Classes,
Classes and Functions, Classes and Methods, Inheritance.
Module IV
NumPy: Introduction to NumPy: Understanding Data Types in Python, The
Basics of NumPy Arrays, Computation on NumPy Arrays: Universal 11 Hrs
Functions, Aggregations: Min, Max, and Everything In Between, Computation
on Arrays: Broadcasting, Comparisons, Masks, and Boolean Logic, Fancy
Indexing, Sorting Arrays, Structured Data: NumPy's Structured Arrays.
3
Visualization with Matplotlib: Simple Line Plots, Simple Scatter Plots,
Visualizing Errors, Density and Contour Plots, Histograms, Binnings and
Density.
Module V
Pandas: Data Manipulation with Pandas, Introducing Pandas Objects, Data
Indexing and Selection, Operating on Data in Pandas, Handling Missing Data, 10 Hrs
Hierarchical Indexing, Combining Datasets: Concat and Append, Combining
Datasets: Merge and Join, Aggregation and Grouping, Pivot Tables,
Vectorized String Operations, Working with Time Series, High-Performance
Pandas: eval() and query().
Question paper pattern:
The question paper will have ten questions.
There will be 2 questions from each module, covering all the topics from a module.
The students will have to answer 5 full questions, selecting one full question from each module.
TEXT BOOKS:
1. Allen B. Downey, ``Think Python: How to Think Like a Computer Scientist’’, 2nd edition, Updated
for Python 3, Shroff/O’Reilly Publishers, 2016 (http://greenteapress.com/wp/think- python/).
(For Modules I, II and III).
2. Jake Vanderplas, “Python Data Science Handbook”, O’Reilly Publications, ISBN: 9781491912058,
2016. (For Module IV and V).
3. Bharti Motwani, “Data Analytics using Python”, Wiley , 2020.
REFERENCES:
1. Charles Dierbach, “Introduction to Computer Science using Python: A Computational
Problem-Solving Focus, Wiley India Edition, 2013.
2. John V Guttag, “Introduction to Computation and Programming Using Python’’, Revised
and expanded Edition, MIT Press , 2013
3. Kenneth A. Lambert, “Fundamentals of Python: First Programs”, CENGAGE Learning,
2012.
4. Paul Gries, Jennifer Campbell and Jason Montojo, “Practical Programming: An
Introduction to Computer Science using Python 3”, Second edition, Pragmatic
Programmers,LLC,2013.
5. Robert Sedgewick, Kevin Wayne, Robert Dondero, “Introduction to Programming in
Python: An Inter-disciplinary Approach, Pearson India Education Services Pvt. Ltd., 2016.
6. Timothy A. Budd, “Exploring Python”, Mc-Graw Hill Education (India) Private Ltd.,, 2015.
Course outcomes: On completion of the course, the student will have the ability to:
Course CO # Course Outcome (CO)
Code
CO1 Demonstrate the basics of Python programming.
CO2 Compose a Python program using control statement and functions.
19CS51 Represent compound data using Python data structure and demonstrate
CO3
the use of OOPs concepts in python programming.
CO4 Applying NumPy for Data science applications.
CO5 Demonstrate the use of Pandas.

4
Course Title: FINITE AUTOMATA AND FORMAL LANGUAGE
Subject Code :19CS52 Credit : 4 CIE: 50
Number of Lecture Hours/Week 04 Hrs(Theory ) SEE: 50
Total Number of Lecture Hours 52 SEE Hours:
03
Pre-requisites: Mathematical Foundations of Computer Science
Course objectives:
 To gain an understanding of automata theory principles
 Familiarize applications of automata theory in compiler construction and text processing.
Modules Teaching
Hours
Module-I
Introduction to finite automata: Introduction to Finite Automata, The central
concepts of Automata theory; Deterministic finite automata, Nondeterministic
finite automata, An application of finite automata, Finite automata with Epsilon- 11 Hrs
transitions.
Module-II
Regular expressions, Regular languages and Properties: Regular expressions;
Finite Automata and Regular Expressions; Applications of Regular Expressions.
Regular languages and properties: Regular languages; Proving languages not to
be regular languages, Closure properties of regular languages. 10 Hrs

Module-III
Properties of regular languages contd. , Context free grammars: Decision
properties of regular languages, Equivalence and minimization of automata.
Context-free grammars and languages: Context –free grammars; Parse trees; 10 Hrs
Applications; Ambiguity in grammars and Languages.
Module-IV

Pushdown automata: Definition of the Pushdown automata; The languages of a

PDA; Equivalence of PDA’s and CFG’s; Deterministic Pushdown Automata. 11
Properties of context-free languages: Normal forms for CFGs; The pumping lemma hrs
for CFGs; Closure properties of CFL.
Module-V
Introduction to Turing machine: Problems that Computers cannot solve; The
turning machine; Programming techniques for Turning Machines; Extensionsto
the basic Turning Machines; Turing Machine and Computers. 10 Hrs
Undecideability: A Language that is not recursively enumerable; An Undecidable
problem that is RE; Post’s Correspondence problem; Other undecidable problems.

5
Question paper pattern:
The question paper will have ten questions.
There will be 2 questions from each module, covering all the topics from a module.
The students will have to answer 5 full questions, selecting one full question from each module.
Text books:
1. Introduction to Automata Theory, Languages and Computation – John E. Hopcroft, Rajeev
Motwani, Jeffrey D.Ullman:, 3rd Edition, Pearson education, 2007.
Reference Books:
1. Raymond Greenlaw, H.JamesHoove, Morgan Kaufmann, Fundamentals of the Theory of
Computation: Principles and Practice –, 1998.
2. John C Martin, Introduction to Languages and Automata Theory –3rd Edition, TataMcGraw-
Hill, 2007.
3. Daniel I.A. Cohen, Introduction to Computer Theory –2nd Edition, John Wiley & Sons,2004.
4. Thomas A. Sudkamp,An Introduction to the Theory of Computer Science, Languages and
Machines –3rdEdition, Pearson Education, 2006.

Course outcomes:
On completion of the course, the student will have the ability to:
Course CO # Course Outcome (CO)
Code
CO1 Design Deterministic and non Deterministic finite automata for a
givenlanguage and identify related applications in text processing.
CO2 Construct Regular expressions for given language
and describe properties of regular language.
19CS52 CO3 Develop Context Free Grammar and illustrate with its applications
CO4 Design PDA, discuss equivalence of CFG and PDA and explain
properties of Context Free Languages.
CO5 Discuss Turing machine and its variants and the notion of undecidability.

6
Course Title: DATABASE MANAGEMENT SYSTEM
Subject Code : 19CS53 Credit :4 CIE: 50
Number of Lecture Hours/Week 4 hrs (Theory) SEE: 50
Total Number of Lecture Hours 52 SEE Hours: 03
Prerequisites: knowledge of C, C++ Programming Principles, Data Structures
Course Objectives:
 Learn and practice data modelling using entity relationship and developing database design
 Understand the use of SQL
 Understand the functional dependency and Normalization Techniques.
 Understand the online transaction processing and recovery methods.
MODULES Teaching Hours
Module I
Introduction: An example, Characteristics of Database approach, Actors on the
screen, Workers behind the scene, Advantages of using DBMS approach, A brief
history of database applications, when not to use a DBMS. Data models, schemas and 10 Hours
instances, Three-schema architecture and data independence, Database languages and
interfaces. Entity-Relationship Model: Using High-Level Conceptual Data Models for
Database Design, An Example Database Application, Entity Types, Entity Sets,
Attributes and Keys, Relationship types, Relationship Sets, Roles and Structural
Constraints, Weak Entity Types, Refining the ER Design, ER Diagrams, Naming
Conventions and Design Issues, Relationship types of degree higher than two,
Subclasses, Super Classes and Inheritance, Specialization and
Generalization.Relational Model: Relational Model Concepts, Relational Model
Constraints and Relational Database Schemas.
Module II
Introduction to SQL: The SQL Language, The Role of SQL, SQL Features and
Benefits, SQL and Networking (Centralized Architecture, File Server Architecture,
Client/Server Architecture, Multi-Tier Architecture) The Relational Data Model:
Tables, Primary Keys, Relationships, Foreign Keys, SQL Basics: Data Types,
Constants, Expressions, Built-in Functions, Missing Data (NULL Values), Row Alias,
Literals. SQL Commands: DDL Statements: Create, Alter, Drop, Truncate Tables,
DML Statements: Insert, Update and Delete, DCL Statements: GRANT, REVOKE
TCL Statements: COMMITT, ROLBACK, SAVEPOINT, Simple Queries: The
SELECT Statement, The SELECT Clause, FROM Clause, WHERE Clause, SQL
Operators :Arithmetic, Comparison, Logical operations on columns, Other 12 hours
Operators: BETWEEN AND, LIKE, IS NULL, IN Compound Search Conditions
(AND, OR, and NOT), Order by Clause: Sorting Query Results, Combining Query
Results (UNION) *,Unions and Sorting *, Joins: Simple Joins (Equi-Joins), Natural
Join, Joins with Row Selection Criteria, Multiple Matching Columns, Table Aliases,
OUTER JOINS :, Left and Right Outer Joins *, Inner Joins in SQL2 *Aggregate
Functions: Column Functions: SUM() computes the total of a column. • AVG()
computes the average value in a column. • MIN() finds the smallest value in a column.
• MAX() finds the largest value in a column. • COUNT() counts the number of values
in a column. • COUNT(*) counts rows of query results, Grouped Queries (GROUP BY
Clause).
Module III
Database Design - 1: Informal Design Guidelines for Relation Schemas, Functional
7
Dependencies, And Normal Forms Based on Primary Keys, General Definitions of 10 Hours
Second and Third Normal Forms, Boyce-Code Normal Form. Database Design – 2:
Properties of Relational Decompositions, Algorithms for Relational Database Schema
Design, Multivalued Dependencies and Fourth Normal Form, Join Dependencies and
Fifth Normal Form, Inclusion Dependencies, Other Dependencies and Normal Forms.
Module IV
Transaction Processing Concepts: Introduction to Transaction Processing, 12
Transaction and System Concepts, Desirable Properties of Transactions, 10 Hours
Characterizing Schedules Based on Recoverability, Characterizing Schedules Based on
Serializability, Transaction Support in SQL. Concurrency Control Techniques: Two-
Phase Locking Techniques for Concurrency Control, Concurrency Control Based on
Timestamp Ordering, Multiversion Concurrency Control Techniques, Validation
Concurrency Control Techniques, Granularity of Data items and Multiple Granularity
Locking, Using Locks for Concurrency Control in Indexes.
Module V
Database Recovery Techniques : Recovery Concepts, Recovery Techniques Based
on Deferred Update, Recovery Techniques Based on Immediate Update, Shadow
Paging, The ARIES Recovery Algorithm, Recovery in Multi database Systems, 10 Hours
Database Backup and Recovery from Catastrophic Failures. Database Security and
Authorization: Introduction to Database Security Issues, Discretionary Access Control
Based on Granting and Revoking Privileges, Mandatory Access Control and Role-
Based Access Control for Multilevel Security, Introduction to Statistical Database
Security, Introduction to Flow Control, Encryption and Public Key Infrastructures.
Question paper pattern:
The question paper will have ten questions.
There will be 2 questions from each module, covering all the topics from a module.
The students will have to answer 5 full questions, selecting one full question from each module.
Text books:
1. Fundamentals of Database Systems - Elmasri and Navathe, 5th Edition,Addison- Wesley, 2007
2. SQL – The Complete Reference- James R Groff, Paul N.Weinberg and Andrew J.Oppel, 3 rd
Edition,Mc-Graw Hill, 2009. (Module-II)
Reference Books:
1. Data Base System Concepts- Silberschatz, Korth and Sudharshan, 5 th Edition, Mc-Graw Hill, 2006.
2. Database Management Systems -Raghu Ramakrishnanand Johannes Gehrke – 3rd Edition. McGraw-
Hill, 2003.
3. An Introduction to Database Systems - C.J. Date, A. Kannan, S. Swamynatham, 8 th Edition, Pearson
Education, 2006.
Course outcomes:
On completion of the course, the student will have the ability to:
Course CO # Course Outcome (CO) Blooms
Code Level
CO1 Express the fundamentals and applications of data base management
system. C2
CO2 Implement and Interact database with SQL statements. C3
Design data base by applying ER diagram, relational model, functional
CO3
dependency and Normalization Techniques
C4
19CS53 Illustrate the basic issues of transaction processing and concurrency
CO4
control.
C2
CO5 Demonstrate different recovery techniques and security issues. C3

8
Course Title: SOFTWARE ENGINEERING AND TESTING
Subject Code : 19CS54 Credits : 3 CIE: 50
Number of Lecture 3 SEE: 50
Hours/Week
Total Number of Lecture 42 SEE Hours: 03
Hours
Prerequisites: Any programming language
Course objectives:
 Acquire knowledge of software development life cycle
 Understand methodologies for designing the software
 Describe the development of efficient and cost effective software.
 Gain knowledge of Software Testing process.
 Perform various software testing and measurement.
MODULES Teaching Hours
Module – I
Overview: Introduction: FAQ's about software engineering, Professional and
ethical responsibility.
Software Processes: Software Processes: Models, Process iteration, Process
activities, The Rational Unified Process, Computer-Aided Software
Engineering. 08 Hrs
Requirements: Software Requirements: Functional and Non-functional
requirements, User requirements, System requirements, Interface specification,
and The software requirements document.
Module - II
Software Design: Architectural Design: Architectural design decisions, System
organization, Modular decomposition styles, Control styles. Object- Oriented
design: Objects and Object Classes, An Object-Oriented design process, Design
evolution, Introduction to UML Diagram, Case study DEVELOPMENT: Rapid 09 Hrs
Software Development: Agile methods, Extreme programming, Rapid
application development, Software prototyping.
Module - III
Verification And Validation: Verification and Validation: Planning, Software
inspections, Automated static analysis, Verification and formal methods.
Management: Managing People: Selecting staff, Motivating people, Managing
people, The People Capability Maturity Model. 08 Hrs
Software Cost Estimation: Productivity, Estimation techniques.
Module – IV
A Perspective on Testing, Examples: Basic definitions, Test cases, Insights
from a Venn diagram, Identifying test cases, Error and fault taxonomies, Levels
of testing. Examples: Generalized pseudo code, The triangle problem, The Next
Date function, The commission problem, The SATM (Simple Automatic Teller 09 Hrs
Machine) problem, The currency converter, Saturn windshield wiper. Boundary
Value Testing: Boundary value analysis, Robustness testing, Worst-case
testing, Special value testing, Examples, Random testing, Guidelines for
Boundary value Testing.

9
 Module – V
Path Testing: DD paths, Test coverage metrics, Basis path testing, guide lines
and observations. Define/Use testing, Slice-based testing, Guidelines and
observations. 08 Hrs
Levels of Testing: Traditional view of testing levels, Alternative life-cycle
models, The SATM system, Separating integration and system testing.
Integration Testing: A closer look at the SATM system,Decomposition-based
Integration, call graph-based Integration.
Question paper pattern:
The question paper will have ten questions.
There will be 2 questions from each module, covering all the topics from a module.
The students will have to answer 5 full questions, selecting one full question from each module.
Text book:
1. Software Engineering – Ian Somerville, 10th Edition, Pearson Education,2016.
2. Software Testing, A Craftsman’s Approach - Paul C. Jorgensen:, 4 th Edition, Auerbach
Publications,2013.
Reference Books:
1. Software Engineering:A Practitioners Approach - Roger S. Pressman, 7th Edition,
McGraw-Hill,2007.
2. Software Engineering Theory and Practice - Shari Lawrence Pfleeger, Joanne M.Atlee,
3rd Edition, Pearson Education,2006.
3. Software Engineering Principles and Practice - Waman S Jawadekar, Tata McGraw Hill,
2004.
4. Object Oriented System Development using UML, Ali Bahrami , MaGrawHill, 1999
Course outcomes:
On completion of the course, the student will have the ability to:
Course CO # Course Outcome (CO)
Code
CO1 Describe software engineering process to account for quality
issues and non-functional requirements.
CO2 Translate specification into a design, and then realize that design
practically, using an appropriate software engineering
methodology.
19CS54 CO3 Develop, maintain and evaluate large-scale software systems, To produce
efficient, reliable, robust and cost-effective software solutions
CO4 Discuss the fundamental principles of Software Testing with lifecycle
and essential functional test methods.
CO5 Perform Basic test design and measurement techniques.

10
Course Title: ARTIFICIAL INTELLIGENCE
Subject Code : 19CS55 Credit :03 CIE: 50
Number of Lecture Hours/Week 3 Hrs SEE: 50
Total Number of Lecture Hours 42 SEE Hours: 03
Prerequisites: Discrete Mathematics
Course Objectives:
 To Apply a given AI technique to a given concrete problem
 To Implement non-trivial AI techniques in a relatively large system
 To understand uncertainty and Problem solving techniques.
 To understand various symbolic knowledge representation to specify domains and reasoning
tasks of a situated software agent.
 To understand different logical systems for inference over formal domain representations, and
trace how a particular inference algorithm works on a given problem specification.
 To understand various learning techniques and agent technology.

MODULES Teaching Hours

Module I
What is Artificial Intelligence: The AI Problems, The Underlying assumption,
What is an AI Technique? The Level of the model, Criteria for success.
Problems, problem spaces, and search: Defining, the problem as a state space 09 Hrs
search, Production systems, Problem characteristics, Production system
characteristics, Issues in the design of search programs.

Module II

Heuristic search techniques: Generate-and-test, Hill climbing, Best-first

search, Problem reduction, Mean-ends analysis. 08 Hrs
Knowledge representation issues: Representations and mappings, Approaches
to knowledge representation, Issues in knowledge representation, the frame
problem.

Module III
Using predicate logic: Representing simple facts in logic, representing
instance and ISA relationships, Computable functions and predicates,
Resolution, Natural Deduction 08 Hrs
Representing Knowledge Using Rules: Procedural versus Declarative
knowledge, Logic programming, forward versus backward reasoning,
matching, control knowledge.

Module IV

Symbolic Reasoning Under Uncertainty: Introduction to nonmonotonic

11
reasoning, Logic for nonmonotonic reasoning, Implementation Issues,
Augmenting a problem-solver, Implementation: Depth-first search, 09 Hrs
Implementation: Breadth-first search.

Statistical Reasoning: Probability and bayes Theorem, Certainty factors and

rule-based systems, Bayesian Networks, Dempster-Shafer Theory, Fuzzy logic.

Module V
Text Analysis and Mining: Introduction, Language Models, Text
Classification, Information Retrieval, Information Extraction, Statistical 08 Hrs
Natural Language Processing, Cross- Lingual Natural Language Processing,
Spell Checking, Speech Recognition.
Expert System and Applications: Expert System, Knowledge Representation,
Expert System Shells, Knowledge Acquisition of an Expert system,
Applications of expert Systems, Examples of Expert Systems,Problem Solving
Examples.
Question paper pattern:
The question paper will have ten questions.
There will be 2 questions from each module, covering all the topics from a module.
The students will have to answer 5 full questions, selecting one full question from each module.
TEXT BOOKS:
1. Elaine Rich and Kevin Knight, “Artificial Intelligence”, Tata McGraw-Hill, 3rd Edition 2008
2. LavikaGoel, “Artificial Intelligence concepts and Applications”, Wiley Emerging
Technology Series 2021 by Wiley India Pvt.Ltd.
REFERENCES:
1. Nils J. Nilsson, “Artificial Intelligence: A new Synthesis”, Harcourt Asia Pvt. Ltd.
2. George F. Luger, “Artificial Intelligence-Structures and Strategies for Complex Problem
Solving”, Pearson Education/ PHI.

Course outcomes:
On completion of the course, the student will have the ability to:
Course CO # Course Outcome (CO)
Code
Discuss artificial intelligence techniques, problem and heuristic search
CO1
algorithm
Apply knowledge representation techniques and predicate Logic rules to
CO2
solve reasoning programs.
Apply various symbolic reasoning under uncertainty in intelligent system
19CS55 CO3 development as well as understand the importance of maintaining intelligent
systems.
CO4 Discuss various learning methods using probabilistic models.
Design and develop Natural Language Processing and Expert System
CO5 applications.

12
Course Title: PYTHON PROGRAMMING LAB
Subject Code : 19CSL51 Credit : 1 CIE: 50
Number of Practical Hours/Week/batch 2 Hrs SEE: 50
SEE Hours: 03
Pre-requisites: Knowledge of C and (or) C++ programming language, Concepts of Object
oriented programming.
Course Objectives:
• Write, test, and debug simple Python programs.
• Implement Python programs with conditionals and loops.
• Develop Python programs step-wise by defining functions and calling them.
• Use Python lists, tuples, dictionaries for representing compound data.
• Read and write data from/to files in Python
I. Practice programs
1. Write a python program to add two numbers.
2. Check a number is positive/negative.
3. Find largest number among three numbers.
4. Store numbers in a array and find average of numbers.
II Exercise Programs (for Lab IA and SEE lab exams)
A. Programs on Python built-in data structures
1. Create a list and perform the following operations:
Insert, remove, append, length, pop, show elements, remove all elements.
2. Create a dictionary and apply the following methods:
Print all the dictionary items, Get the value of the specified key , update values, get
values , get keys.
3. Create a tuple and perform the following methods:
Find the length of tuple, Find the item, Access items, Find the number of times a
specified value occurs in tuple.
B. Programs using Functions:
4. Write a program to check the given string is palindrome or not.
5. Write a program to find the Factorial of a given number.
6. Write a program to check equality of two lists by passing List as argument to function
defined.
7. Write a program to double a given number and add two numbers using lambda().
8. Write a program for map() function to double all the items in the list.
9. Write a program to find sum of the numbers for the elements of the list by using reduce()

C) Exception handling
10. Demonstrate a python code to print try, except and finally block statements.

D) Programs on File handling

11. Write a python program to open and write, “hello world” into a text file and then append
the same file with the text, “hi python programming” for the existing file.
E) Working with OS, Calender Module
12. Write a python program to get python version and check the access permissions of file.
13. Write a python program to display a particular month of a year using calendar module
and also all the months of the year.
13
F) Packages
14. Write a python program to create a package and use it in another program.

G) Object oriented Python Programming

15. Write a program to find sum of all the elements of a number list using class and methods
16. Write a program to demonstrate inheritance.
17. Write a program to demonstrate method overloading in python.

H) Working with Numpy

18. Write a program using a numpy module to create an array and check the following:
1. Type of array
2. Axes of array
3. Shape of array
4. Type of elements in array
19. Write a program using a numpy module to create an array and check the following:
1. List with type float
2. 3*4 array with all zeros
20. Write a program using a numpy module to :
1. Reshape 3X4 array to 2X2X3 array
2. Create Sequence of integers from 0 to 30 with steps of 5
3. Flatten array
4. Create Constant value array of complex type
I) Working with Pandas
21. Write a python program to concatenate the data frames with two different objects
22. Write a python code to read a csv file using pandas module and print the first and last
five lines of a file.

J) Working with Matplotlib

23. Write a python program to demonstrate data visualization through plotting facilities
available in matplotlib library on some sample data.
Question paper pattern: For SEE , two programs from the Exercise programs list will be asked.
Course outcomes:
On completion of the course, the student will have the ability to:
Course CO # Course Outcome (CO)
Code
CO1 Use Python lists, tuples, dictionaries for representing compound data.
CO2 Develop modular python programs by defining functions, exception and
file handling.
19CSL51 CO3 Demonstrate programming with system modules.
CO4 Implement programs with object oriented concepts.
CO5 Develop program to utilize Numpy and Pandas libraries for data analysis
and visualize data with matplotlib library.

14
 Course Title: Database Management System Lab
Subject Code : 19CSL52 Credit : 1 CIE: 50
Number of Practical
2 Hrs SEE: 50
Hours/Week/batch
SEE Hours: 03
Pre-requisites: Knowledge of C, C++ Programming Principles, Data Structures
Course Objectives:
The student should be made to:
 Learn to create and use a database
 Be familiarized with a query language
 Have hands on experience on DDL Commands
 Have a good understanding of DML Commands and DCL commands
 Familiarize advanced SQL queries.
 Be Exposed to different applications.
LIST OF EXPERIMENTS:
Part-A
1. Draw E-R diagram and convert entities and relationships to relation table for a given
scenario.
2. Perform the following: Viewing all databases, Creating a Database, Viewing all Tables in a
Database.
3. Creating Tables (With and Without Constraints), Inserting/Updating/Deleting Records in a
Table, Saving (Commit) and Undoing (rollback).
4. Perform the following: Altering a Table, Dropping/Truncating/Renaming Tables, Backing
up / Restoring a Database.
5. For a given set of relation schemes, create tables and perform the following Simple
Queries, Simple Queries with Aggregate functions, Queries with Aggregate functions
(group by and having clause), Queries involving- Date Functions, String Functions , Math
Functions Subqueries- With IN clause, With EXISTS clause
6. For a given set of relation tables perform the following: a. Creating Views (with and
without check option), Dropping views, Selecting from a view
7. Write a Pl/SQL program using FOR loop to insert ten rows into a database table.
8. Illustrate how you can embed PL/SQL in a high-level host language such as C/Java and
demonstrates how a banking debit transaction might be done.
9. Given an integer i, write a PL/SQL procedure to insert the tuple (i, 'xxx') into a given
relation.
10. Write a PL/SQL block that handles all types of exceptions.

Part-B
1. Consider the following relations:
Student (snum: integer, sname: string, major: string, level: string, age: integer)
Class (name: string, meets at: string, room: string, d: integer)
Enrolled (snum: integer, cname: string)
Faculty (fid: integer, fname: string, deptid: integer)

Write the following queries in SQL. No duplicates should be printed in any of the answers.
i. Find the names of all Juniors (level = JR) who are enrolled in a class taught by Prof. Harshith
ii. Find the names of all classes that either meet in room R128 or have five or more Students
15
enrolled.
iii. Find the names of all students who are enrolled in two classes that meet at the same time.
iv. Find the names of faculty members who teach in every room in which some class is taught.
v. Find the names of faculty members for whom the combined enrollment of the courses that they
teach is less than five.

2. The following relations keep track of airline flight information:

Flights (no: integer, from: string, to: string, distance: integer, Departs: time, arrives: time, price:
real)
Aircraft (aid: integer, aname: string, cruisingrange: integer)
Certified (eid: integer, aid: integer)
Employees (eid: integer, ename: string, salary: integer)
Note that the Employees relation describes pilots and other kinds of employees as well; Every pilot
is certified for some aircraft, and only pilots are certified to fly.
Write each of the following queries in SQL.
i. Find the names of aircraft such that all pilots certified to operate them have salaries more than
Rs.80, 000.
ii. For each pilot who is certified for more than three aircrafts, find the eid and the maximum
cruisingrange of the aircraft for which she or he is certified.
iii. Find the names of pilots whose salary is less than the price of the cheapest route from
Bengaluru to Frankfurt.
iv. For all aircraft with cruisingrange over 1000 Kms, .find the name of the aircraft and the average
salary of all pilots certified for this aircraft.
v. Find the names of pilots certified for some Boeing aircraft.
vi. Find the aids of all aircraft that can be used on routes from Bengaluru to New Delhi.

3. Consider the following database of student enrollment in courses & books adopted for
each course.

STUDENT (regno: string, name: string, major: string, bdate:date)

COURSE (course #:int, cname:string, dept:string)
ENROLL ( regno:string, course#:int, sem:int, marks:int)
BOOK _ ADOPTION (course# :int, sem:int, book-ISBN:int)
TEXT (book-ISBN:int, book-title:string, publisher:string, author:string)
i. Create the above tables by properly specifying the primary keys and the foreign keys.
ii. Enter at least five tuples for each relation.
iii. Demonstrate how you add a new text book to the database and make this book be adopted by
some department.
iv. Produce a list of text books (include Course #, Book-ISBN, Book-title) in the alphabetical order
for courses offered by the „CS‟ department that use more than two books.
v. List any department that has all its adopted books published by a specific publisher.
vi. Generate suitable reports.
vii. Create suitable front end for querying and displaying the results.

4. The following tables are maintained by a book dealer.

AUTHOR (author-id:int, name:string, city:string, country:string)

16
PUBLISHER (publisher-id:int, name:string, city:string, country:string)
CATALOG (book-id:int, title:string, author-id:int, publisher-id:int, category-id:int, year:int,
price:int)
CATEGORY (category-id:int, description:string)
ORDER-DETAILS (order-no:int, book-id:int, quantity:int)
i. Create the above tables by properly specifying the primary keys and the foreign keys.
ii. Enter at least five tuples for each relation.
iii. Give the details of the authors who have 2 or more books in the catalog and the price of the
books is greater than the average price of the books in the catalog and the year of publication is
after 2000.
iv. Find the author of the book which has maximum sales.
v. Demonstrate how you increase the price of books published by a specific publisher by 10%.
vi. Generate suitable reports.
vii. Create suitable front end for querying and displaying the results.

5. Consider the following database for a banking enterprise

BRANCH(branch-name:string, branch-city:string, assets:real)

ACCOUNT(accno:int, branch-name:string, balance:real)
DEPOSITOR(customer-name:string, accno:int)
CUSTOMER(customer-name:string, customer-street:string, customer-city:string)
LOAN(loan-number:int, branch-name:string, amount:real)
BORROWER(customer-name:string, loan-number:int)
i. Create the above tables by properly specifying the primary keys and the foreign keys.
ii. Enter at least five tuples for each relation
iii. Find all the customers who have at least two accounts at the Main branch.
iv. Find all the customers who have an account at all the branches located in a specific city.
v. Demonstrate how you delete all account tuples at every branch located in a specific city.
vi. Generate suitable reports.
vii. Create suitable front end for querying and displaying the results.

6. Consider the following schema for a Library Database:

BOOK(Book_id, Title, Publisher_Name, Pub_Year)

BOOK_AUTHORS(Book_id, Author_Name)
PUBLISHER(Name, Address, Phone)
BOOK_COPIES(Book_id, Programme_id, No-of_Copies)
BOOK_LENDING(Book_id, Programme_id, Card_No, Date_Out, Due_Date)
LIBRARY_PROGRAMME(Programme_id, Programme_Name, Address)
Write SQL queries to
1. Retrieve details of all books in the library – id, title, name of publisher, authors, number of
copies in each Programme, etc.
2. Get the particulars of borrowers who have borrowed more than 3 books, but from Jan 2017 to
Jun 2017.
3. Delete a book in BOOK table. Update the contents of other tables to reflect this data
manipulation
operation.
4. Partition the BOOK table based on year of publication. Demonstrate its working with a simple
query.
17
5. Create a view of all books and its number of copies that are currently available in the Library.

7. Consider the following schema for Order Database:

SALESMAN(Salesman_id, Name, City, Commission)

CUSTOMER(Customer_id, Cust_Name, City, Grade, Salesman_id)
ORDERS(Ord_No, Purchase_Amt, Ord_Date, Customer_id, Salesman_id)
Write SQL queries to
1. Count the customers with grades above Bangalore’s average.
2. Find the name and numbers of all salesman who had more than one customer.
3. List all the salesman and indicate those who have and do not have customers in their cities (Use
UNION operation.)
4. Create a view that finds the salesman who has the customer with the highest order of a day.
5. Demonstrate the DELETE operation by removing salesman with id 1000. All his orders must
also be deleted.

8. Consider the schema for College Database:

STUDENT(USN, SName, Address, Phone, Gender)

SEMSEC(SSID, Sem, Sec)
CLASS(USN, SSID)
COURSE(Subcode, Title, Sem, Credits)
IAMARKS(USN, Subcode, SSID, Test1, Test2, Test3, FinalIA)
Write SQL queries to
1. List all the student details studying in fourth semester ‘C’ section.
2. Compute the total number of male and female students in each semester and in each section.
3. Create a view of Test1 marks of student USN ‘1BI15CS101’ in all Courses.
4. Calculate the FinalIA (average of best two test marks) and update the corresponding table for all
students.
5. Categorize students based on the following criterion:
If FinalIA = 17 to 20 then CAT = ‘Outstanding’
If FinalIA = 12 to 16 then CAT = ‘Average’
If FinalIA< 12 then CAT = ‘Weak’
Give these details only for 8th semester A, B, and C section students.

9. Consider the schema for Company Database:

EMPLOYEE(SSN, Name, Address, Sex, Salary, SuperSSN, DNo)

DEPARTMENT(DNo, DName, MgrSSN, MgrStartDate)
DLOCATION(DNo,DLoc)
PROJECT(PNo, PName, PLocation, DNo)
WORKS_ON(SSN, PNo, Hours)
Write SQL queries to
1. Make a list of all project numbers for projects that involve an employee whose last name is
‘Scott’,
either as a worker or as a manager of the department that controls the project.
2. Show the resulting salaries if every employee working on the ‘IoT’ project is given a 10 percent
raise.
3. Find the sum of the salaries of all employees of the ‘Accounts’ department, as well as the
18
maximum salary, the minimum salary, and the average salary in this department.
4. Retrieve the name of each employee who works on all the projects controlled by department
number 5 (use NOT EXISTS operator).
5. For each department that has more than five employees, retrieve the department number and the
number of its employees who are making more than Rs. 6,00,000.

10. Consider the schema for Employee Database:

EMPLOYEE (employee-name, street, city)

WORKS (employee-name, company-name, salary)
COMPANY (company-name, city)
MANAGES (employee-name, manager-name)
Write SQL queries to
i)Delete all tuples in the works relation for employees of abd.
ii)Give all managers of “abc” a 10 percent raise unless the salary becomes greater than 100,000
iii) Find those companies whose employees earn a higher salary, on average, than the average
salary at “abc”.
iv). Find the company that has the most employees.
v). Find the company that has the smallest payroll.
vi). Find those companies whose employees earn a higher salary, on average,than the average
salary at abc Corporation.
vii) Find all employees who earn more than the average salary of all employees viii) Find all
employees in the database who earn more than each employee of Small Bank Corporation

Mini project (Application Development using :Front end: VB/VC ++/JAVA or Equivalent
Back end: Oracle / SQL / MySQL/ PostGress / DB2 or Equivalent).

a. Inventory Control System.

b. Core Banking system
c. Hospital Management System.
d. Railway Reservation System.
e. Personal Information System.
f. Web Based User Identification System.
g. Timetable Management System.
h. Hotel Management System.
i. Library management
j. Electricity bill.
k. Hostel management.
l. Air reservation
m. Company management system.
n. Student information system.
o. University database system.

Guidelines for implementation of mini project

1. Draw ER Diagram.
2. Convert ER diagram to table/schema.
3. Apply normalization.
4. Design and implementation.
19
 5. Generate report.

Note: Part-A Programs and Mini Projects are to be considered only for CIE
Question paper pattern: For SEE , programs from the Part-B will be asked.
Course outcomes:
On completion of the course, the student will have the ability to:
Course CO # Course Outcome (CO)
Code
CO1 Design and implement a database schema for a given problem domain
CO2 Populate and query a database.
19CSL52 CO3 Create and maintain tables using PL/SQL.
CO4 Design and implement mini project
CO5 Prepare reports.

20
 Course Title: Web Application Development lab
Subject Code :19CSL53 Credit : 2 CIE: 50
Number of Lecture Hours/Week 4 Hrs (integrated) SEE: 50
Total Number of Lecture Hours SEE Hours: 03
Prerequisites: Java Object oriented concepts, Java Basics

Course Objectives:
● Provide the principles and practical programming skills of developing Internet and
Web applications.
● Enables students to develop skills for client / server programming and database
applications.
EXPERIMENTS
1. Create an XHTML documents to study various HTML tags, style sheets and the tag, Borders,
padding, color, and the tag.
2. Develop a Java Script embedded XHTML file for;
i) Generating Sum of n numbers. Use alert window to display the result.
ii) Determine the roots of Quadratic Equation. Use document. write to produce Output.

3. Develop an XHTML document and corresponding JavaScript file to create four radio buttons that
enables the user to choose information about a specific airplane. The click event is to be used to
trigger a call to alert which presents a brief description of the selected airplane
4. Create a XHTML page for “SEE Exam Registration Form for Students”. The following fields are
required in the form. Use external CSS. Semester (List box), VTU Number(Text box), Student
name(Text Box), Subject code (List box) , Credits (text box), cellno(text box), email(text box).
5. Create a Java Script to validate above form data with appropriate alerts.
6. Create a Java Script to generate Scrolling Banner on web page.
7. i) Write a Perl script to show server information like Server Name, Server Software, server
protocol, CGI Revision etc.
ii) Write a Perl program to accept OS command and to display the output of the command
executed.
iii) Write a Perl program to count number of Visitors visiting the web page using session variable.
Display this count of visitors with proper headings.
8. Write a PHP program to store current data-time in a COOKIE and display the Last visited on‟
date-time on the web page upon reopening the same page.

9. Install, configure, compare and discuss features of any open source web server.
10. Install one of these on your computer, configure and setup a website: Wordpress, Drupal or
Moodle.

11. Write a HTML page by hand which looks like the homepage of this website:
https://www.freecodecamp.org/ or any specified page

21
12. Develop a XHTML document containing four short paragraphs of text, stacked on top of each
other, with only enough of each showing so that the mouse cursor can always be placed over some
part of them. When the cursor is placed over the exposed part of any paragraph, it should rise to the
top to become completely visible.
13. Install mysql-server on your laptop and run AQL queries to do the following: create a database,
create a table, insert rows in a table, fetch rows from a table, delete a row, update a row.

14. On any HTML page (may the the one you wrote for freecodecamp.org type) , include a link for
Login. Write a login page having login/password fields. Write Javascript code to validate the login-
id and password for the following: both are properly formed and at least 6 bytes long; the password
contains at least one special case, one capital and one numeric characters; convert the password into
it's MD5 hash

15. Using PHP and MySQL, develop a program to accept book information viz., Accession Number,
title, authors, edition and publisher from a web page and store the information in a database and to
search for a book with the title specified by the user and to display the search results with proper
headings. Create a webpage with all the knowledge gained from the above exercises. (Example:
develop a department webpage.)

16. Open ended experiment :

Using bootstrap tool develop an e commerce website.

Question paper pattern: For SEE similar question related to the above programs will be
asked.
Course outcomes:
On completion of the course, the student will have the ability to:
CO # Course Outcome (CO)
Course Code
CO1 Describe fundamentals of web programming and introduce the
creation of static webpage using XHTML.
CO2 Create web pages using XHTML and Cascading Style Sheets.
CO3 Design and implement dynamic WebPages with server side
19CSL53 information using Perl.
CO4 Write PHP programs to install configure and setup website.

CO5 Develop database applications using MySQL database with PHP.

22