Academic Regulations VR-24 for B.Tech.

(Full time)

Department of Computer Science and Engineering

4 Years B.Tech. (Computer Science and Engineering)

COURSE STRUCTURE (2025-26)

(Effective for students admitted into I Year from Academic Year

2024-2025 onwards
&
B.Tech. (Lateral Entry Scheme)
(Effective for the students admitted into II Year through Lateral Entry
Scheme from the Academic Year 2025-2026 onwards)
Department of Computer Sciences and Engineering (Applicable from the
Academic Year 2025-26 onwards)
Proposed Course Structure B.Tech.–II Year I Semester

II Year I Semester

S. No Course Course Title L T P Credits

Category Code
1 BS Mathematical Foundations of 3 0 0 3
Computer Science
Universal Human Values– 2 1 0 3
2 HSMC Understanding Harmony & Human
Ethical Conduct
3 ES Digital Logic & Computer Organization 3 0 0 3
4 PCC Software Engineering 3 0 0 3
5 PCC Object-Oriented Programming Through 3 0 0 3
Java
6 PCC CASE Tools Lab 0 0 3 1.5
PCC Object Oriented Programming 0 0 3 1.5
7
Through Java Lab
8 SEC Python Programming 0 1 2 2
9 Audit Environmental Science 2 0 0 -
Course
Total 16 2 8 20

Dr. G. Jaya Suma Dr. K. Venkata Rao Dr. C H Ramesh

University Nominee Subject Expert Subject Expert

Dr. C. Divakar Dr. A.S.C. Tejaswini Kone Dr. K. Venkata Krishna

Subject Expert Chairperson, BOS Subject Expert

Mr. P Gopi Ms.K.V.Saranya Bhavya Dr. P. Lalitha Kumari

Industry Nominee Alumni Member Internal Member
 Department of Computer Sciences and Engineering (Applicable from the
Academic Year 2025-26 onwards)
Proposed Course Structure B.Tech.–II Year II Semester

II Year II Semester
S. Course Course Title L T P Credits
No Category Code
Management Managerial Economics and 2 0 2
1 Elective1 Financial Analysis
2 Basic Science Probability &Statistics 3 0 0 3
3 PCC Operating Systems 3 0 0 3
4 PCC Database Management Systems 3 0 0 3
5 PCC Formal Languages and Automata 3 0 0 3
Theory
6 PCC Operating Systems Lab 0 0 3 1.5
7 PCC Database Management Systems Lab 0 0 3 1.5
8 SEC Full Stack Development–I 0 1 2 2
9 BS&H Design Thinking &Innovation 1 0 2 2
Total 14 2 10 21
Mandatory Community Service Project Internship of 08weeks duration summer vacation

Dr. G. Jaya Suma Dr. K. Venkata Rao Dr. C H Ramesh

University Nominee Subject Expert Subject Expert

Dr. C. Divakar Dr. A.S.C. Tejaswini Kone Dr. K. Venkata Krishna

Subject Expert Chairperson, BOS Subject Expert

Mr. P Gopi Ms.K.V.Saranya Bhavya Dr. P. Lalitha Kumari

Industry Nominee Alumni Member Internal Member
 L T P C
II Year – I Semester
3 0 0 3

SOFTWARE ENGINEERING

Course Objectives:
The objectives of this course are to introduce
 Software lifecycle models, Software requirements and SRS document.
 Project Planning, quality control and ensuring good quality software.
 Software Testing strategies, use of CASE tools, Implementation issues, validation &
verification procedures.

Course Outcomes:
After completion of the course, students will be able to

CO1: Understand the evolution of software development, life cycle models, and emergence
of software engineering as a discipline. (L2)
CO2: Understand CASE tools, software maintenance, reverse engineering, and reuse
strategies at project and organizational levels. (L2)
CO3: Apply project estimation, risk management, and requirement specification using
models like COCOMO and software metrics. (L3)
CO4: Analyze coding and testing techniques and evaluate software quality using frameworks
like ISO 9000 and Six Sigma. (L5)
CO5: Design software systems using function-oriented methods, agile practices, and GUI
design principles. (L6)

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

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

UNIT-III:
Software Design: Overview of the design process, how to characterize a good software
design? Layered arrangement of modules, Cohesion and Coupling. Approaches to software
design.
Agility: Agility and the Cost of Change, Agile Process, Extreme Programming (XP), Other
Agile Process Models, Tool Set for the Agile Process (Text Book 2)
 Function-Oriented Software Design: Overview of SA/SD methodology, Structured
analysis, Developing the DFD model of a system, Structured design, Detailed design, and
Design Review.
User Interface Design: Characteristics of a good user interface, Basic concepts ,Types of
user interfaces, Fundamentals of component-based GUI development, and user interface
design methodology

UNIT-IV:
Coding And Testing: Coding, Code review, Software documentation, Testing, Black-box
testing, White-Box testing, Debugging, Program analysis tools, Integration testing, testing
object-oriented programs, Smoke testing, and some general issues associated with testing.
Software Reliability and Quality Management: Software reliability. Statistical testing,
Software quality, Software quality management system, ISO 9000. SEI Capability Maturity
Model. Few other important quality standards and Six Sigma.

UNIT-V:
Computer-Aided Software Engineering (Case): CASE and its scope, CASE environment,
CASE support in the software life cycle, other characteristics of CASE tools, Towards second
generation CASE Tool, and Architecture of a CASE Environment.
Software Maintenance: Characteristics of software maintenance, Software reverse
engineering, and Software maintenance process models, and Estimation of maintenance cost.
Software Reuse: Reuse-definition, introduction, reason behind no reuses so far, Basic issues
in any reuse program, A reuse approach, and Reuse at the organization level.

Textbooks:
1. Fundamentals of Software Engineering, Rajib Mall, 5th Edition, PHI, 2018.
2. Software Engineering AP Practitioner‟s Approach, Roger S. Pressman,9th Edition,
McGraw-Hill International Edition, 2023.

Reference Books:
1. Software Engineering, Ian Sommerville, 10th Edition, Pearson, 2016.
2. Software Engineering, Principles and Practices, Deepak Jain, Oxford University
Press, 2016.
E-Resources:
1) https://nptel.ac.in/courses/106/105/106105182/
2) https://infyspringboard.onwingspan.com/web/en/app/toc/lex_auth_0126058950638714
8827_shared/overview
https://infyspringboard.onwingspan.com/web/en/app/toc/lex_auth_01338269041100390473
5_shared/overview

Course Program
Outcomes Specific
Program Outcomes(POs)
(COs) Outcomes
(PSOs)
PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2
CO1 3 2 0 0 0 0 0 0 0 1 0 0 2 2
CO2 2 2 0 0 2 0 0 0 0 1 0 0 2 2
CO3 3 3 3 2 2 0 0 0 0 1 0 0 2 3
CO4 2 2 3 2 2 0 0 0 0 1 0 0 2 3
CO5 3 2 3 2 3 0 0 0 0 2 0 0 2 3
Avg 2.6 2.2 1.8 1.2 1.8 0 0 0 0 1.2 0 0 2.0 2.6
 Dr. G. Jaya Suma Dr. K. Venkata Rao Dr. C H Ramesh
University Nominee Subject Expert Subject Expert

Dr. C. Divakar Dr. A.S.C. Tejaswini Kone Dr. K. Venkata Krishna

Subject Expert Chairperson, BOS Subject Expert

Mr. P Gopi Ms.K.V.Saranya Bhavya Dr. P. Lalitha Kumari

Industry Nominee Alumni Member Internal Member
 L T P C
II Year – I Semester
3 0 0 3

OBJECT-ORIENTED PROGRAMMING THROUGH JAVA

Course Objectives:
The learning objectives of this course are to:
 Identify Java language components and how they work together in applications
 Learn the fundamentals of object-oriented programming in Java, including defining
classes, invoking methods, and using class libraries. Learn how to extend Java classes
with inheritance and dynamic binding, and how to use exception handling in Java
applications
 Understand how to design applications with thread sin Java. Understand how to use
Java APIs for program development

Course Outcomes:
After completion of the course, students will be able to

CO1: Understand Java basics including OOP, control flow, data handling, and structure. (L2)
CO2: Apply OOP features like overloading, recursion, static/final, this, and access control. (L3)
CO3: Implement arrays and vectors using OOP concepts. (L3)
CO4: Demonstrate Java Packages, Exceptions, I/O, and File Handling. (L3)
CO5: Design Java apps using Strings, Multithreading, JDBC, and JavaFX. (L6)

UNIT-I
Object Oriented Programming: Basic concepts, Principles, Program Structure in Java:
Introduction, Writing Simple Java Programs, Elements or Tokens in Java Programs, Java
Statements, Command Line Arguments, User Input to Programs, Escape Sequences,
Comments, Programming Style.
Data Types, Variables, and Operators: Introduction, Data Types in Java, Declaration of
Variables, Data Types, Type Casting, Scope of Variable Identifier, Literal Constants,
Symbolic Constants, Formatted Output with Printf () Method, Static Variables and Methods,
Using Attribute Final.

Introduction to Operators, Precedence and Associatively 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, and 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 Throw able,
Unchecked Exceptions, Checked Exceptions.
JavaI/O and File: Java I/O API, standard I/O streams, types, Byte streams, Character
streams, Scanner class, Files in Java (Text Book 2)

UNIT-V
String Handling in Java: Introduction, Interface Char Sequence, Class String, Methods for
Extracting Characters from Strings, Comparison, Modifying, Searching; Class String Buffer.
Multithreaded Programming: Introduction, Need for Multiple Threads, Multithreaded
Programming for Multi-core Processors, 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 FX GUI: JavaFX Scene Builder, Java FX App Window Structure, displaying text and
image, event handling, laying out nodes in scene graph, mouse events(Textbook 3)

Text Books:

1) Java: One ahead, Anitha Seth, B.L. Juneja, Oxford.1st edi, 2017.
2) Joy with JAVA, Fundamentals of Object-Oriented Programming, Debasis Samanta,
Monalisa Sarma, Cambridge, 2023.
3) Java for Programmers, Paul Deitel, Harvey Deitel, 4th Edition, Pearson, 2018.
 References Books:
1) The Complete Reference Java, Herbert Schildt, 11th Edition, TMH, 2018.
2) Introduction to Java programming, Y Daniel Liang, Pearson ,7thEdition, 2008.

Online Resources:
1) https://nptel.ac.in/courses/106/105/106105191/
2) https://infyspringboard.onwingspan.com/web/en/app/toc/lex_auth_0128804645476188
16347_shared/overview

Course Program
Outcomes Specific
Program Outcomes(POs)
(COs) Outcomes
(PSOs)
PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2
CO1 3 2 0 0 1 0 0 0 0 1 0 0 2 2
CO2 3 2 2 0 2 0 0 0 0 1 0 0 2 2
CO3 3 2 2 0 2 0 0 0 0 1 0 0 2 2
CO4 3 2 3 1 2 0 0 0 0 1 0 0 2 3
CO5 3 2 3 1 3 0 0 0 0 2 0 0 2 3
Avg 3.0 2.0 2.0 0.4 2.0 0.0 0.0 0.0 0.0 1.2 0.0 0.0 2.0 2.4

Dr. G. Jaya Suma Dr. K. Venkata Rao Dr. C H Ramesh

University Nominee Subject Expert Subject Expert

Dr. C. Divakar Dr. A.S.C. Tejaswini Kone Dr. K. Venkata Krishna

Subject Expert Chairperson, BOS Subject Expert

Mr. P Gopi Ms.K.V.Saranya Bhavya Dr. P. Lalitha Kumari

Industry Nominee Alumni Member Internal Member
 L T P C
II Year – I Semester
0 0 3 1.5
CASE TOOLS LAB
Course Objectives
1. To have hands on experience in developing a software project by using various software
engineering principles and methods in each of the phases of software development.
2. Ability to generate a high-level design of the system from the software requirements
3. Will have experience and/or awareness of testing problems and will be able to develop a
simple testing report

Course Outcomes:
Students will be able to achieve & demonstrate the following Cos on completion of the
course-based learning
CO1: Translate end-user needs into system and software requirements. (L3)
CO2: Write detailed requirements for system components. (L3)
CO3: Implement system components from detailed designs. (L5)
CO4: Create high-level system design from software requirements. (L6)
List of Experiments:
Do the following g 8 exercises for any two projects given in the list of sample projects or any
other projects:
1) Development of problem statement.
2) Preparation of Software Requirement Specification Document, Design Documents and
Testing Phase related documents.
3) Preparation of Software Configuration Management and Risk Management related
documents.
4) Study and usage of any Design phase CASE tool
5) Performing the Design by using any Design phase CASE tools.
6) Develop test cases for unit testing and integration testing
7) Develop test cases for various white box and black box testing techniques.

List of Projects:
1. Passport automation System
2. Book Bank.
3. Online Exam Registration
4. Stock Maintenance System
5. Online course reservation system
6. E-ticketing
7. Software Personnel Management System
8. Credit-Card Processing
9. E-book management System.
10. Recruitment system
 Text Books:
1. Software Engineering, A Practitioner‟s Approach- Roger S. Pressman,6th Edition,
McGraw-Hill International Edition, 2004.
2. Software Engineering- Sommerville,7th Edition, Pearson Education, 2004.
3. The Unified Modeling Language user guide by Grady Booch, James Rumbaugh, Ivar
Jacobson, Pearson Education, 1999.

Course Program
Outcomes Specific
Program Outcomes(POs)
(COs) Outcomes
(PSOs)
PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2
CO1 3 2 3 2 2 0 0 0 1 1 0 0 3 2
CO2 3 2 3 2 2 0 0 0 1 1 0 0 3 2
CO3 3 3 3 2 3 0 0 0 1 2 0 0 3 3
CO4 3 3 3 2 3 0 0 0 1 2 0 0 3 3
Avg 3.0 2.5 3.0 2.0 2.5 0.0 0.0 0.0 1.0 1.5 0.0 0.0 3.0 2.5

Dr. G. Jaya Suma Dr. K. Venkata Rao Dr. C H Ramesh

University Nominee Subject Expert Subject Expert

Dr. C. Divakar Dr. A.S.C. Tejaswini Kone Dr. K. Venkata Krishna

Subject Expert Chairperson, BOS Subject Expert

Mr. P Gopi Ms.K.V.Saranya Bhavya Dr. P. Lalitha Kumari

Industry Nominee Alumni Member Internal Member
 L T P C
II Year – I Semester
0 0 3 1.5

OBJECT-ORIENTED PROGRAMMING THROUGH JAVA LAB

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

Course Outcomes:
After completion of the course, students will be able to

CO1: Demonstrate understanding of Java syntax, data types, control structures, and OOP
basics. (L2)
CO2: Apply OOP principles and exception handling to solve problems. (L3)
CO3: Use Java libraries, threads, Collections, I/O, JDBC, and utilities. (L3)
CO4: Design GUI applications using JavaFX. (L6)

Experiments covering the Topics:

 Object Oriented Programming fundamentals types, control structures

 Classes, methods, objects, Inheritance, polymorphism,
 Exception handling, Threads, Packages, Interfaces
 Files, I/O streams, Java FXGUI

List of Experiments:
Exercise–1:
a) Write a JAVA program to display default value of all primitive data type of JAVA
b) Writeajavaprogramthatdisplaytherootsofaquadraticequationax2+bx=0.Calculate the
discriminate D and basing on value of D, describe the nature of root.
Exercise-2
a) Write a JAVA program to search for an element in 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 String Buffer to delete, remove character.

Exercise-3
a) Write a JAVA program to implements class mechanism. Create a class, methods and
invokes them inside main method.
b) Write a JAVA program implements method overloading.
c) Write a JAVA program to implements constructor.
d) Write a JAVA program to implements constructor overloading
Exercise-4
a) Write a JAVA program to implements Single Inheritance
b) Write a JAVA program to implements multilevel Inheritance
c) Write a JAVA program for abstract class to find areas of different shapes

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

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

Exercise-7
a) Write a JAVA program that creates threads by extending Thread class. First thread display
“Good Morning” every 1 second, these cond thread displays “Hello“every 2 seconds and the
third display “Welcome” every 3 seconds, (Repeat the same by implementing Runnable)
b) Write a program illustrating is Alive and join ()
c) Writ a Program illustrating Daemon Threads.
d) Write a JAVA program for the Producer-Consumer Problem

Exercise–8
a) Write a JAVA program that import and use the user defined packages
b) Without writing any code, build a GUI that display text in label and image in an Image
View (use JavaFX)
c) Build a Tip Calculator app using several JavaFX components and learn how to respond to
user interactions with the GUI

References Books:

1. P.J. Deitel, H.M. Deitel, “Java for Programmers”, Pearson Education, PHI,4th
Edition, 2007.
2. P. Radha Krishna, “Object-Oriented Programming through Java”, Universities
Press, 2nd Edition, 2007
3. Bruce Eckel, “Thinking in Java”, Pearson Education, 4th Edition, 2006.
4. Sachin Malhotra, Saurabh Chaudhary, “Programming in Java”, Oxford University
Press, 5th Edition, 2010.

Online Learning Resources:

https://java-
iitd.vlabs.ac.in/http://peterindia.net/JavaFiles.html
 Course Program
Outcomes Specific
Program Outcomes(POs)
(COs) Outcomes
(PSOs)
PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2
CO1 3 2 2 2 2 0 0 0 1 1 0 0 3 2
CO2 3 3 3 2 2 0 0 0 1 1 0 0 3 3
CO3 3 3 3 2 3 0 0 0 1 1 0 0 3 3
CO4 3 2 3 2 3 0 0 0 1 2 0 0 3 3
Avg 3.0 2.5 2.75 2.0 2.5 0.0 0.0 0.0 1.0 1.25 0.0 0.0 3.0 2.75

Dr. G. Jaya Suma Dr. K. Venkata Rao Dr. C H Ramesh

University Nominee Subject Expert Subject Expert

Dr. C. Divakar Dr. A.S.C. Tejaswini Kone Dr. K. Venkata Krishna

Subject Expert Chairperson, BOS Subject Expert

Mr. P Gopi Ms.K.V.Saranya Bhavya Dr. P. Lalitha Kumari

Industry Nominee Alumni Member Internal Member
 L T P C
II Year – I Semester
0 1 2 2
PYTHON PROGRAMMING
(Skill Enhancement Course)
Course Objectives:
The main objectives of the course are to
• Introduce core programming concepts of Python programming language.
• Demonstrate about Python data structures like Lists, Tuples, Sets and dictionaries
• Implements Functions, Modules and Regular Expressions in Python Programming
and to create practical and contemporary applications using these
Course Outcomes:
After completion of the course, students will be able to
CO1: Define Python basics, data types, functions, modules, exceptions, and data structures like
lists and sets. (L1)
CO2: Apply Python to solve computational problems and manipulate strings. (L3)
CO3: Implement OOP principles in Python using classes, inheritance, and encapsulation. (L3)
CO4: Create applications using Python libraries like JSON, XML, NumPy, and pandas. (L6)

UNIT-I:
History of Python Programming Language, Thrust Areas of Python, Installing Anaconda
Python Distribution, Installing and Using Jupyter Notebook.
Parts of Python Programming Language: Identifiers, Keywords, Statements and
Expressions, Variables, Operators, Precedence and Associativity, Data Types, Indentation,
Comments, Reading Input, Print Output, Type Conversions, the type () Function and Is Operator,
Dynamic and Strongly Typed Language.
Control Flow Statements: if-statement, if-else statement, if...elseif…else-Nested if
statement, while Loop, for Loop, continue and break Statements, Catching Exceptions Using
try and except Statement.

List of Experiments:
1. Write a program to find the largest element among three Numbers.
2. Write a Program to display all prime numbers within an interval
3. Write a program to swap two numbers without using a temporary variable.
4. Demonstrate the following Operators in Python with suitable examples.
i) Arithmetic Operators ii) Relational Operators iii) Assignment Operators iv)
Logical Operators v) Bitwise Operators vi) Ternary Operator vii) Membership
Operators viii) Identity Operators
5. Write a program to add and multiply complex numbers
6. Write a program to print multiplication table of a given number.

UNIT-II:
Functions: Built-In Functions, Commonly Used Modules, Function Definition and Calling
the function, return Statement and void Function, Scope and Lifetime of Variables, Default
Parameters, Keyword Arguments, *args and **kwargs, Command Line Arguments.
Strings: Creating and Storing Strings, Basic String Operations, Accessing Characters in
String by Index Number, String Slicing and Joining, String Methods, and Formatting Strings.
Lists: Creating Lists, Basic List Operations, Indexing and Slicing in Lists, Built-In Functions
Used on Lists, List Methods, del Statement.
List of Experiments:
1. Write a program to define a function with multiple return values.
2. Write a program to define a function using default arguments.
3. Write a program to find the length of the string without using any library functions.
4. Write a program to check if the substring is present in a given string or not.
5. Write a program to perform the given operations on a list:
i. Addition ii. Insertion iii. slicing
6. Write a program to perform any 5 built-in functions by taking any list.

UNIT-III:
Dictionaries: Creating Dictionary, Accessing and Modifying key: value Pairs in
Dictionaries, Built-In Functions Used on Dictionaries, Dictionary Methods, del Statement.
Tuples and Sets: Creating Tuples, Basic Tuple Operations, tuple () Function, Indexing and
Slicing in Tuples, Built-In Functions Used on Tuples, Relation between Tuples and Lists,
Relation between Tuples and Dictionaries, using zip () Function, Sets, Set Methods, Frozen
set.
List of Experiments:
1. Write a program to create tuples (name, age, address, college) for at least two members
and concatenate the tuples and print the concatenated tuples.
2. Write a program to count the number of vowels in a string (No control flow allowed).
3. Write a program to check if a given key exists in a dictionary or not.
4. Write a program to add a new key-value pair to an existing dictionary.
5. Write a program to sum all the items in a given dictionary.

UNIT-IV:
Files: Types of Files, Creating and Reading Text Data, File Methods to Read and Write Data,
Reading and Writing Binary Files, Pickle Module, Reading and Writing CSV Files, Python
OS and OS path Modules.
Object-Oriented Programming: Classes and Objects, Creating Classes in Python, Creating
Objects in Python, Constructor Method, Classes with Multiple Objects, Class Attributes Vs
Data Attributes, Encapsulation, Inheritance, Polymorphism.
Sample Experiments:
1. Write a program to sort words in a file and put them in another file. The output files
should have only lower-case words, so any upper-case words from source must be
lowered.
2. Python program to print each line of a file in reverse order.
3. Python program to compute the number of characters, words and lines in a file.
4. Write a program to create, display, append, insert and reverse the order of the items in
the array.
5. Write a program to add, transpose and multiply two matrices.
 6. Write a Python program to create a class that represents a shape. Include methods to
calculate its area and perimeter. Implements subclasses for different shapes like
circle, triangle, and square.

UNIT-V:
Introduction to Data Science: Functional Programming, JSON and XML in Python, NumPy
with Python, Pandas.
List of Experiments:
1. Python program to check whether a JSON string contains complex objector not.
2. Python Program to demonstrate NumPy arrays creation using array () function.
3. Python program to demonstrate use of n dim, shape, size, d-type.
4. Python program to demonstrate basic slicing, integer and Boolean indexing.
5. Python program to find min, max, sum, cumulative sum of array
6. Create a dictionary with at least five key sand each key represent value as a list where
this list contains at least ten values and convert this dictionary as a pandas data frame
And explore the data through the data frame as follows:
a. Apply head () function to the pandas data frame
b. Perform various data selection operations on Data Frame
7. Select any two columns from the above data frame, and observe the change in one
attribute with respect to other attribute with scatter and plot operations in
matplotlib

Reference Books:
1. Introduction to Python Programming, Gowri Shankar S, Veena A. , CRC Press, 2019.
2. Python Programming, S Sridhar, J Indumathi, VMHariharan,2nd Edition, Pearson, 2024
3. Introduction to Programming Using Python, Y. Daniel Liang, Pearson, 2017.

Online Learning Resources/Virtual Labs:

1. https://www.coursera.org/learn/python-for-applied-data-science-ai
2. https://www.coursera.org/learn/python?specialization=python#syllabus

Course Program
Outcomes Specific
Program Outcomes(POs)
(COs) Outcomes
(PSOs)
PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2
CO1 3 2 2 2 1 0 0 0 1 1 0 0 3 2
CO2 3 3 3 2 2 0 0 0 1 1 0 0 3 3
CO3 3 3 3 2 3 0 0 0 1 1 0 0 3 3
CO4 3 2 3 2 3 0 0 0 1 2 0 0 3 3
Avg 3.0 2.5 2.75 2.0 2.25 0.0 0.0 0.0 1.0 1.25 0.0 0.0 3.0 2.75
 Dr. G. Jaya Suma Dr. K. Venkata Rao Dr. C H Ramesh
University Nominee Subject Expert Subject Expert

Dr. C. Divakar Dr. A.S.C. Tejaswini Kone Dr. K. Venkata Krishna

Subject Expert Chairperson, BOS Subject Expert

Mr. P Gopi Ms.K.V.Saranya Bhavya Dr. P. Lalitha Kumari

Industry Nominee Alumni Member Internal Member
 L T P C
II Year – II Semester
3 0 0 3

OPERATING SYSTEMS
Course Objectives:
The main objectives of the course are to make student
 Understand the basic concepts and principles of operating systems, including process
management, memory management, file systems, and Protection
 Make use of process scheduling algorithms and synchronization techniques to achieve
better computer system performance.
 Illustrate different conditions for dead lock and their possible solutions.

Course Outcomes:
After completion of the course, students will be able to
CO1: Understand OS basics, functions, services, and design issues. (L2)
CO2: Differentiate processes, tasks, threads, IPC, and CPU scheduling. (L4)
CO3: Analyze concurrency, synchronization, and deadlock solutions. (L4)
CO4: Analyze memory management techniques and evaluate performance. (L5)
CO5: Create suitable file management and protection techniques. (L6)

UNIT-I
Operating Systems Overview: Introduction, Operating system functions, Operating systems
operations, Computing environments, Free and Open-Source Operating Systems System
Structures: Operating System Services, User and Operating-System Interface, system calls,
Types of System Calls, system programs, Operating system Design and Implementation,
Operating system structure, Building and Booting an Operating System, Operating system
debugging

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

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

UNIT-IV
Memory-Management Strategies: Introduction, Contiguous memory allocation, Paging,
Structure of the Page Table, Swapping
Virtual Memory Management: Introduction, Demand paging, Copy-on-write, Page
replacement, Allocation of frames, Thrashing Storage Management: Overview of Mass
Storage Structure, HDD Scheduling.
 UNIT-V
File System: File System Interface: File concept, Access methods, Directory Structure;
File system Implementation: File-system structure, File-system Operations, Directory
implementation, Allocation method, Free space management; File-System Internals: File-
System Mounting, Partitions and Mounting, File Sharing.
Protection: Goals of protection, Principles of protection, Protection Rings, Domain of
protection, Access matrix.

Textbooks:
1. Operating System Concepts, Silber‟s chatz A, Galvin P B, Gagne G,10th Edition,
Wiley, 2018.
2. Modern Operating Systems, Tanenbaum A S,4thEdition, Pearson, 2016

Reference Books:
1. Operating Systems -Internals and Design Principles, Stallings W, 9thEdition, Pearson,
2018
2. Operating Systems: A Concept Based Approach ,D. M Dhamdhere,3rdEdition,
McGraw- Hill, 2013

Online Learning Resources:

1. https://nptel.ac.in/courses/106/106/106106144/
2. http://peterindia.net/OperatingSystems.html

Course Program
Outcomes Specific
Program Outcomes(POs)
(COs) Outcomes
(PSOs)
PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2
CO1 3 2 2 1 1 0 0 0 1 1 0 0 2 2
CO2 3 3 3 2 2 0 0 0 1 1 0 0 2 3
CO3 3 3 3 3 3 0 0 0 1 1 0 0 2 3
CO4 3 3 3 3 3 0 0 0 1 1 0 0 2 3
CO5 3 2 2 2 2 0 0 0 1 1 0 0 2 2
Avg 3.0 2.6 2.6 2.2 2.2 0 0 0 1.0 1.0 0 0 2.0 2.6

Dr. G. Jaya Suma Dr. K. Venkata Rao Dr. C H Ramesh

University Nominee Subject Expert Subject Expert

Dr. C. Divakar Dr. A.S.C. Tejaswini Kone Dr. K. Venkata Krishna

Subject Expert Chairperson, BOS Subject Expert

Mr. P Gopi Ms.K.V.Saranya Bhavya Dr. P. Lalitha Kumari

Industry Nominee Alumni Member Internal Member
 L T P C
II Year – II Semester
3 0 0 3

DATABASE MANAGEMENTSYSTEMS

Course Objectives:
The main objectives of the course is to
 Introduce database management systems and to give a good formal foundation on the
relational model of data and usage of Relational Algebra
 Introduce the concepts of basic SQL as a universal Database language
 Demonstrate the principles behind systematic data base design approaches by
covering conceptual design, logical design through normalization
 Provide an overview of the physical design of a database system, by discussing
Database indexing techniques and storage techniques

Course Outcomes:
After completion of the course, students will be able to

CO1: Understand DBMS basics including file systems, models, architecture, and ER model. (L2)
CO2: Analyze relational model, SQL commands, relational algebra, and calculus. (L4)
CO3: Construct SQL/Relational Algebra queries for CRUD, joins, views, and aggregation. (L3)
CO4: Discuss functional dependency and normalization with examples. (L2)
CO5: Describe transaction processing, concurrency control, and indexing. (L2)
UNIT-I:
Introduction: Database system, Characteristics (Database Vs File System), Database Users,
Advantages of Database systems, Database applications. Brief introduction of different Data
Models; Concepts of Schema, Instance and data independence; Three tier schema architecture
for data independence; Database system structure, environment, Centralized and Client
Server architecture for the database. Entity Relationship Model: Introduction, Representation
of entities, attributes, entity set, relationship, relationship set, constraints, sub classes, super
class, inheritance, specialization, generalization using ER Diagrams.

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

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

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

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

Textbooks:
1) Database Management Systems, Raghuram Krishnan, Johannes Gehrke, 3rd Edition,
TMH, 2003 (For Chapters 2, 3, 4)
2) Database System Concepts, Silber Schatz, Korth, Sudarshan, 5th Edition, TMH, 2005
(For Chapter 1 and Chapter 5)

Reference Books:
1) Introduction to Database Systems, C J Date, Pearson, 8th Edition,2008
2) Database Management System, Ramez Elmasri, Shamkant B.Navathe,
Pearson6thEdition, 2010
3) Database Principles Fundamentals of Design Implementation and Management, 10th
Edition, Corlos Coronel, Steven Morris, Peter Robb, Cengage Learning, 2022

Web-Resources:
1) https://nptel.ac.in/courses/106/105/106105175/
2) https://infyspringboard.onwingspan.com/web/en/app/toc/lex_auth_0127580666728202
2456_shared/overview
Course Program
Outcomes Specific
Program Outcomes(POs)
(COs) Outcomes
(PSOs)
PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2
CO1 3 2 2 1 1 0 0 0 1 1 0 0 2 2
CO2 3 3 3 3 2 0 0 0 1 1 0 0 2 3
CO3 3 3 3 2 2 0 0 0 1 1 0 0 2 3
CO4 2 2 2 1 1 0 0 0 1 1 0 0 2 2
CO5 2 2 2 1 1 0 0 0 1 1 0 0 2 2
Avg 2.6 2.4 2.4 1.6 1.4 0 0 0 1.0 1.0 0 0 2.0 2.4
 Dr. G. Jaya Suma Dr. K. Venkata Rao Dr. C H Ramesh
University Nominee Subject Expert Subject Expert

Dr. C. Divakar Dr. A.S.C. Tejaswini Kone Dr. K. Venkata Krishna

Subject Expert Chairperson, BOS Subject Expert

Mr. P Gopi Ms.K.V.Saranya Bhavya Dr. P. Lalitha Kumari

Industry Nominee Alumni Member Internal Member
 L T P C
II Year – II Semester
3 0 0 3

FORMAL LANGUAGES AND AUTOMATA THEORY

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

Course Outcomes:
By the end of the course students can
CO1: Understand fundamental concepts and design of deterministic and non-deterministic finite
automata. (L2)
CO2: Understand automata theory concepts including regular expressions, PDA, Turing machines,
and NP. (L2)
CO3: Apply regular expressions and grammars to automata design. (L3)
CO4: Analyze concepts of automata and formal languages. (L4)
CO5: Create FSMs, regular languages, PDAs, and Turing machines. (L6)

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.

UNIT-IV
Pushdown Automata, Definition, Model, Graphical Notation, Instantaneous Description,
 Language Acceptance of Pushdown Automata, Design of Pushdown Automata, Deterministic
and Non – 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.

Textbooks:
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. Mishap and
N. Chandrasekharan, 3rd Edition, PHI, 2007

Reference Books:
1) Elements of Theory of Computation, Lewis H.P. & Papadimition C.H., Pearson /PHI, 2010
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/

Course Program
Outcomes Specific
Program Outcomes(POs)
(COs) Outcomes
(PSOs)
PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2
CO1 3 2 2 1 1 0 0 0 0 1 0 0 2 2
CO2 3 2 2 1 1 0 0 0 0 1 0 0 2 2
CO3 3 3 3 2 2 0 0 0 0 1 0 0 2 3
CO4 3 3 3 3 3 0 0 0 0 1 0 0 2 3
CO5 3 3 3 3 3 0 0 0 0 1 0 0 2 3
Avg 3.0 2.6 2.6 2.0 2.0 0 0 0 0 1.0 0 0 2.0 2.6
 Dr. G. Jaya Suma Dr. K. Venkata Rao Dr. C H Ramesh
University Nominee Subject Expert Subject Expert

Dr. C. Divakar Dr. A.S.C. Tejaswini Kone Dr. K. Venkata Krishna

Subject Expert Chairperson, BOS Subject Expert

Mr. P Gopi Ms.K.V.Saranya Bhavya Dr. P. Lalitha Kumari

Industry Nominee Alumni Member Internal Member
 L T P C
II Year – II Semester
0 0 3 1.5

OPERATING SYSTEMS LAB

Course Objectives:
The main objectives of the course are to
 Provide insights into system calls, file systems, semaphores,
 Develop and debug CPU Scheduling algorithms, page replacement algorithms, thread
implementation
 Implements Bankers Algorithms to Avoid the Dead Lock

Course Outcomes:
After completion of the course, students will be able to
CO1: Understand and develop application programs using Unix system calls. (L3)
CO2: Apply various CPU scheduling algorithms. (L3)
CO3: Solve synchronization problems in operating systems. (L3)
CO4: Analyze and implement OS concepts like deadlock, file, and memory management. (L5)
Experiments covering the Topics:
 UNIX fundamentals, commands & system calls
 CPU Scheduling algorithms, thread processing
 IPC, semaphores, monitors, deadlocks
 Page replacement algorithms, file allocation strategies
 Memory allocation strategies

List of Experiments:

1. Practicing of Basic UNIX Commands.

2. Write programs using the following UNIX operating system calls
fork, exec, getpid, exit, wait, close, stat, open-dir and read-dir
3. Simulate UNIX commands like cp, ls, grep, etc.,
4. Simulate the following CPU scheduling algorithms
a) FCFS b) Sift) Priority d) Round Robin
5. Control the number of ports opened by the operating system with
a) Semaphore b) Monitors.
6. Write a program to illustrate the concurrent execution of threads using the threads
library.
7. Write a program to solve the producer-consumer problem using Semaphores.
8. Implements the following memory allocation methods for fixed partition
a) First fit b) Worst fit c) Best fit
9. Simulate the following page replacement algorithms
a) FIFO b) LRU c) LFU
10. Simulate the Paging Technique of memory management.
11. Implements Bankers Algorithm for deadlock avoidance and prevention
12. Simulate the following file allocation strategies
a) Sequential b) Indexed c) Linked
 Reference Books:
1. Operating System Concepts, Silberschatz A, Galvin PB, GagneG,10th Edition, Wiley,
2018.
2. Modern Operating Systems, Tanenbaum A S, 4th Edition, Pearson, 2016
3. Operating Systems-Internals and Design Principles, Stallings W,9th Edition, Pearson,
2018
4. Operating Systems: A Concept Based Approach, D.M Dhamdhere,3rd Edition,
McGraw- Hill, 2013

Online Learning Resources:

1. https://www.cse.iitb.ac.in/~mythili/os/
2. http://peterindia.net/OperatingSystems.html

Course Program
Outcomes Specific
Program Outcomes(POs)
(COs) Outcomes
(PSOs)
PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2
CO1 3 2 2 1 1 0 0 0 0 1 0 0 2 2
CO2 3 2 2 2 2 0 0 0 0 1 0 0 2 2
CO3 3 3 3 2 2 0 0 0 0 1 0 0 2 3
CO4 3 3 3 3 3 0 0 0 0 1 0 0 2 3
Avg 3.0 2.5 2.5 2.0 2.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 2.0 2.5

Dr. G. Jaya Suma Dr. K. Venkata Rao Dr. C H Ramesh

University Nominee Subject Expert Subject Expert

Dr. C. Divakar Dr. A.S.C. Tejaswini Kone Dr. K. Venkata Krishna

Subject Expert Chairperson, BOS Subject Expert

Mr. P Gopi Ms.K.V.Saranya Bhavya Dr. P. Lalitha Kumari

Industry Nominee Alumni Member Internal Member
 L T P C
II Year – II Semester
0 0 3 1.5

DATABASE MANAGEMENT SYSTEMS LAB

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

Course Outcomes:
After completion of the course, students will be able to
CO1: Utilize DDL, DML, and DCL commands effectively in a database environment. (L3)
CO2: Construct and execute queries to manipulate and retrieve data. (L3)
CO3: Analyze requirements to design Procedures, Functions, Cursors, and Triggers for
automation. (L4)
CO4: Establish database connectivity using JDBC. (L3)

Experiments covering the topics:

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

List of Experiments:
1. Creation, altering and dropping 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, INTERSECT, 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, l-pad, r-pad, l-trim, r-trim, lower, upper, initcap, length, sub-
str and in-str), date functions (Sysdate,nextday, addmonths, lastday, months-between,
least, greatest, trunc, round, tochar, todate)
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 SAVE
POINT in PL/SQL block.
6. Develop a program that includes the features NESTED IF, CASE and CASE
expression. The program can be extended using the NULLIF and COALESCE
functions.
 7. Program development using WHILE LOOPS, numeric FOR LOOPS, nested loops
using ERROR Handling, BUILT –IN Exceptions, USE defined Exceptions, RAISE-
APPLICATION ERROR.
8. Programs development using creation of procedures, passing parameters IN and 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.
13. Write a Java program that connects to a data base using JDBC
14. Write a Java program to connect to a data base using JDBC and insert values into it
15. Write a Java program to connect to a data base using JDBC and delete values from it

Reference Books:

1. Oracle: The Complete Reference by Oracle Press,2009

2. "Database Systems Using Oracle”, Nilesh Shah, PHI,2007
3. “Introduction to SQL”, Rick FV anderLan‟s Fourth Edition, Pearson Education, 2007
4. “Database Systems”, Ramez Elmasri, Shamkant, B. Navathe, Pearson Education, 6th
Edition, 2013.
5. Database Principles Fundamentals of Design Implementation and Management,
10thEdition, Carlos Coronel, Steven Morris, Peter Robb, Cengage Learning, 2022

Online Learning Resources:

1. http://www.scoopworld.in

2. http://vlabs.iitb.ac.in/vlabs-dev/labs/dblab/index.php

Course Program
Outcomes Specific
Program Outcomes(POs)
(COs) Outcomes
(PSOs)
PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2
CO1 3 2 3 2 2 0 0 0 0 1 0 0 3 2
CO2 3 3 3 2 2 0 0 0 0 1 0 0 3 2
CO3 3 3 3 3 3 0 0 0 0 1 0 0 3 3
CO4 3 2 3 2 3 0 0 0 0 1 0 0 3 3
Avg 3.0 2.5 3.0 2.25 2.5 0.0 0.0 0.0 0.0 1.0 0.0 0.0 3.0 2.5
 Dr. G. Jaya Suma Dr. K. Venkata Rao Dr. C H Ramesh
University Nominee Subject Expert Subject Expert

Dr. C. Divakar Dr. A.S.C. Tejaswini Kone Dr. K. Venkata Krishna

Subject Expert Chairperson, BOS Subject Expert

Mr. P Gopi Ms.K.V.Saranya Bhavya Dr. P. Lalitha Kumari

Industry Nominee Alumni Member Internal Member
 L T P C
II Year – II Semester
0 1 2 2

FULL STACK DEVELOPMENT–1

(Skill Enhancement Course)
Course Objectives:
The main objectives of the course are to
 Make use of HTML elements and their attributes for designing static Web Pages
 Build webpage by applying appropriate CSS styles to HTML elements
 ExperimentwithJavaScripttodevelopdynamicwebpagesandvalidateforms

Course Outcomes:
CO1: Build HTML web pages using various tags. (L3)
CO2: Apply CSS styling to web pages. (L3)
CO3: Develop JavaScript concepts to create interactive web pages. (L3)
CO4: Create interactive HTML forms using event-driven JavaScript. (L6)

Experiments covering the Topics:

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

List of Experiments:

1. Lists, Links and Images

a. Write a HTML program, to explain the working of lists.
Note: It should have an ordered list, unordered list, nested lists and ordered list in an
unordered list and definition lists.
b. Write a HTML program, to explain the working of hyperlinks using <a> tag and h-ref,
target Attributes.
c. Create a HTML document that has your image and your friend‟s image with a specific
height and width. Also when clicked on the images it should navigate to their respective
profiles.
d. Write a HTML program, in such a way that, rather than placing large images on a page,
the preferred technique is to use thumbnails by setting the height and width parameters to
something like 100*100 pixels. Each thumbnail image is also a link to a full-size version
of the image. Create an image gallery using this technique

2. HTML Tables, Forms and Frames

a. Write a HTML program, to explain the working of tables.(use tags:<table>,<tr>,<th>,
<td>and attributes :border, row-span, col-span)
b. Write a HTML program, to explain the working of tables by preparing a timetable. (Note:
Use<caption> tag to set the caption to the table & also use cell spacing, cellpadding,
border, row-span, col-span etc.).
c. Write a HTML program to explain the working of forms by designing a registration form.
(Note: Include text field, password field, number field, date of birth field, check boxes,
radio buttons, list boxes using <select>&<option> tags, <text area> and two buttons ie:
submit and reset. Use tables to provide a better view).
d. Write a HTML program, to explain the working of frames, such that page is to be divided
third
frame And also make sure of using “no frame” attribute such that frames to
be fixed).

3. HTML5 and Cascading Style Sheets, Types of CSS

a. Write a HTML program, that makes use of<article>,<aside>,<figure>,<figcaption>,
<footer>,<header>,<main>,<nav>, <section>, <div>,<span>tags.
b. Write a HTML program to embed audio and video into HTML web page.
c. Writeaprogramtoapplydifferenttypes(orlevelsofstylesorstylespecificationformats)
-inline, internal, external styles to HTML elements. (identify selector, property and value).

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

5. CSS with Color, Background, Font, Text and CSS Box Model
a. Write a program to demonstrate the various ways you can reference a color in CSS.
b. Write a CSS rule that places a background image half way down the page, tilting it
horizontally. The image should remain in place when the user scrolls up or down.
c. Write a program using the following terms related to CSS font and text:
i. font-size ii. font-weight iii. font-style
iv.text-decoration text-transformation vi. text-alignment
d. Write program to explain the importance of CSS Box model using
i. Content ii. Border iii. Margin iv. padding

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

a. Write a program to embed internal and external Java Script in a web page.
b. Write program to explain the different ways for displaying output.
c. Write a program to explain the different ways for taking input.
d. Create a webpage which uses prompt dialogue box to ask avoter for his name and age.
Display the information in table format along with either the voter can vote or not

7. JavaScript Pre-defined and User-defined Objects

a. Write a program using document object properties and methods.
b. Write a program using window object properties and methods.
c. Write a program using array object properties and methods.
d. Write a program using math object properties and methods.
e. Write a program using string object properties and methods.
f. Write a program using regex object properties and methods.
g. Write a program using date object properties and methods.
h. Write a program to explain user-defined objects by using properties, methods, assessors,
constructors and display.
8. Java Script Conditional Statements and Loops
a. Write a program which asks the user to enter three integers, obtains the numbers from the
user and outputs HTML text that displays the larger number followed by the words
“LARGERNUMBER” in an information message dialog. If the numbers are equal, output
HTML text as “EQUAL NUMBERS”.
b. Write a program to display week days using switch case.
c. Write a program to print1 to 10numbers using for, while and do-while loops.
d. Write a program to print data in object using for-in, for-each and for-of loops
e. Develop a program to determine whether a given number is an „ARM STRONG
NUMBER‟ or not.[Eg:153 is an Arm-strong number, since sum of the cube of the digits is
equal to the number i.e.,13 + 53+ 33 = 153]
f. Write a program to display the denomination of the amount deposited in the bank in terms
of 100‟s, 50‟s, 20‟s, 10‟s, 5‟s, 2‟s & 1‟s. (Eg: If deposited amount is Rs.163, the output
should be 1-100‟s, 1-50‟s, 1- 10‟s, 1-2‟s & 1-1‟s)
9. Java Script Functions and Events
a. Design a appropriate function should be called to display
i. Factorial of that number
ii. Fibonacci series up to that number
iii. Prime numbers up to that number
iv. Is it palindrome or not
b. Design a HTML having a textbox and four buttons named Factorial, Fibonacci, Prime, and
Palindrome. When a button is pressed an appropriate function should be called to display
i. Factorial of that number
ii. Fibonacci series up to that number
iii. Prime numbers up to that number
iv. Is it palindrome or not
c. Write a program to validate the following fields in registration page
i. Name (start with alphabet and followed by alphanumeric and the length should not
be less than 6 characters)
ii. Mobile(only numbers and length10 digits)
iii. E-mail(should contain format like [email protected])
Textbooks:
1. Web Programming with HTML5, CSS and JavaScript, John Dean, Jones & Bartlett
Learning, 2019.
Reference Books:
1. Programming the World Wide Web, Robet W Sebesta, 7th Edition, Person, 2013.
2. Pro MERN Stack: Full Stack Web App Development with Mongo, Express, React,
and Node, Vasan Subramanian, 2nd Edition, APress, O‟Reilly.
Online Learning Resources:

1. https://www.w3schools.com/html
2. https://www.w3schools.com/css
3. https://www.w3schools.com/js/
4. https://www.w3schools.com/nodejs
5. https://www.w3schools.com/typescript
 Course Program
Outcomes Specific
Program Outcomes(POs)
(COs) Outcomes
(PSOs)
PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2
CO1 3 2 3 2 2 0 0 0 0 1 0 0 3 2
CO2 3 2 3 2 2 0 0 0 0 1 0 0 3 2
CO3 3 2 3 2 2 0 0 0 0 1 0 0 3 3
CO4 3 2 3 2 2 0 0 0 0 1 0 0 3 3
Avg 3.0 2.0 2.75 2.0 2.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 3.0 2.5

Dr. G. Jaya Suma Dr. K. Venkata Rao Dr. C H Ramesh

University Nominee Subject Expert Subject Expert

Dr. C. Divakar Dr. A.S.C. Tejaswini Kone Dr. K. Venkata Krishna

Subject Expert Chairperson, BOS Subject Expert

Mr. P Gopi Ms.K.V.Saranya Bhavya Dr. P. Lalitha Kumari

Industry Nominee Alumni Member Internal Member