Academic Regulations VR-24 for B.Tech.

(Full time)
Department of Computer Science and Engineering
CYBER SECURITY
4 Years B.Tech. 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
(CYBER SECURITY)
(Applicable from the academic year 2025-26 onwards)

B.Tech.–II Year I Semester

Course Course
S. No Category Code Title L T P Credits
1 BS Discrete Mathematics & Graph Theory 3 0 0 3
Universal Human Values–
2 HSMC Understanding Harmony & Human 2 1 0 3
Ethical Conduct
3 ES Digital Logic & Computer Organization 3 0 0 3
Advance Data Structures & Algorithm
4 PC Analysis 3 0 0 3
Object-Oriented Programming Through
5 PC Java 3 0 0 3
Advanced Data Structures and Algorithm
6 PC 0 0 3 1.5
Analysis Lab

7 PC Object Oriented Programming Through 0 0 3 1.5

Java Lab
8 0 1 2 2
SEC Python programming
9 Audit Course Environmental Science 2 0 0 -
Total 15 2 10 20

Dr G. Jaya Suma Dr K. Venkata Rao Dr CH Ramesh

University Nominee Subject Expert Subject Expert

Dr C. Divakar Dr K. Venkata Krishna Dr P. Lalitha Kumari

Subject Expert Subject Expert Chair Person, BOS

Dr.A S C Tejaswini Kone Mr P Gopi Ms K.V. Saranya Bhavya

Internal Member Industry Nominee Alumni Member
 Department of Computer Sciences and Engineering
(Cyber Security)
(Applicable from the academic year 2025-26 onwards) B.Tech.–II Year II Semester

Course Course
S. No. Category Code Title L T P Credits
Managerial Economics and
BS Financial Analysis Business 2 0 0 2
1 Environment Organizational
Behavior
2 HSMC Number Theory & Applications 3 0 0 3
3 ES Operating Systems 3 0 0 3

4 PC Database Management Systems 3 0 0 3

5 PC Computer Networks 3 0 0 3

6 PC Computer Networks Lab 0 0 3 1.5

7 PC Database Management Systems Lab 0 0 3 1.5

8 SEC Full Stack Development-1 0 1 2 2

9 Audit Course Design Thinking & Innovation 1 0 2 2

Total 15 1 12 21
Mandatory Community Service Project Internship of 08 weeks duration during summer vacation

Dr G. Jaya Suma Dr K. Venkata Rao Dr CH Ramesh

University Nominee Subject Expert Subject Expert

Dr C. Divakar Dr K. Venkata Krishna Dr P. Lalitha Kumari

Subject Expert Subject Expert Chair Person, BOS

Dr.A S C Tejaswini Kone Mr P Gopi Ms K.V. Saranya Bhavya

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

ADVANCED DATA STRUCTURES & ALGORITHM ANALYSIS

Course Objectives:

The main objectives of the courses to

 Provide knowledge on advance data structures frequently used in Computer Science domain
 Develop skills in algorithm design techniques popularly used
 Understand the use of various data structures in the algorithm design

Course Outcomes:
After completion of the course, students will be able to
CO1: Illustrate advanced tree data structures and their applications. (L2)
CO2: Understand graph data structures, traversals, and their contextual applications. (L2)
CO3: Use data structures in the design and implementation of algorithms. (L3)
CO4: Recommend suitable data structures based on the problem requirements. (L4)
CO5: Analyze algorithms in terms of time and space complexities. (L4)

UNIT–I:
Introduction to Algorithm Analysis, Space and Time Complexity analysis, Asymptotic Notations.
AVL Trees– Creation, Insertion, Deletion operations and Applications B-Trees – Creation, Insertion,
Deletion operations and Applications

UNIT–II:
Heap Trees(Priority Queues)–Min and Max Heaps, Operations and Applications Graphs –
Terminology, Representations, Basic Search and Traversals, Connected Components and Bi
connected Components, applications Divide and Conquer: The General Method, Quick Sort, Merge
Sort, Strassen‘ matrix multiplication, Convex Hull

UNIT–III:
Greedy Method: General Method, Job Sequencing with deadlines, Knapsack Problem, Minimum cost
spanning trees, Single Source Shortest Paths Dynamic Programming: General Method, All pairs
shortest paths, Single Source Shortest Paths– General Weights (Bellman Ford Algorithm), Optimal
Binary Search Trees, 0/1 Knapsack, String Editing, Travelling Salesperson problem

UNIT–IV:
Backtracking: General Method, 8-Queens Problem, Sum of Subsets problem, Graph Coloring, 0/1
Knapsack Problem Branch and Bound: The General Method,0/1KnapsackProblem, Travelling Sales
person problem

UNIT – V:
NPH ard and NP Complete Problems: Basic Concepts, Cook‘s theorem NP Hard Graph Problems:
Clique Decision Problem (CDP), Chromatic Number Decision Problem (CNDP), Traveling
Salesperson Decision Problem (TSP) NP Hard Scheduling Problems: Scheduling Identical Processors,
Job Shop Scheduling
 Text books:
1. Fundamentals of Data Structures in C++,Horowitz, Ellis; Sahni, Sartaj; Mehta, Dinesh,2nd
Edition Universities Press, 2008.
2. Computer Algorithms in C++, Ellis Horowitz, SartajSahni, Sanguthevar Rajasekaran,2nd
Edition University Press, 2008.

Reference Books:
1. Data Structures and program design in C, Robert Kruse, 2e,Pearson Education Asia, 2006
2. An introduction to Data Structures with applications, Trembley & Sorenson, 2e, McGraw Hill,
2017
3. The Art of Computer Programming, Vol.1: Fundamental Algorithms, Donald E Knuth,
Addison- Wesley, 1997.
4. DataStructuresusingC&C++:Langsam,Augenstein&Tanenbaum,Pearson,1995
5. Algorithms + Data Structures & Programs, N. Wirth, PHI, 1988.
6. Fundamentals of Data Structures in C++: Horowitz Sahni & Mehta, Galgottia Pub, 1984.
7. Data structures in Java, Thomas Standish, Pearson Education Asia, 1941.

Online Learning Resources:

1. https://www.tutorialspoint.com/advanced_data_structures/index.asp
2. http://peterindia.net/Algorithms.html
1. https://www.youtube.com/playlist?list=PLDN4rrl48XKpZkf03iYFl-O29szjTrs_O

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 0 1 0 1 3 3
CO2 3 2 2 2 2 0 0 0 0 1 0 1 3 3
CO3 3 3 3 3 2 0 0 0 0 1 0 1 3 3
CO4 3 3 3 3 3 0 0 0 0 1 0 1 3 3
CO5 3 3 3 3 3 0 0 0 0 1 0 1 3 3
Avg 3.0 2.6 2.6 2.6 2.4 0 0 0 0 1.0 0 1.0 3.0 3.0

Dr G. Jaya Suma Dr K. Venkata Rao Dr CH Ramesh

University Nominee Subject Expert Subject Expert

Dr C. Divakar Dr K. Venkata Krishna Dr P. Lalitha Kumari

Subject Expert Subject Expert Chair Person, BOS

Dr.A S C Tejaswini Kone Mr P Gopi Ms K.V. Saranya Bhavya

Internal Member Industry Nominee Alumni 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, 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 fundamentals including OOP principles, control flow, data handling, and
program structure (L2)
CO2: Implement OOP features, constructor overloading, recursion, static/final attributes, this
keyword, and access control (L3)
CO3: Implement arrays using OOP concepts and use arrays as vectors (L3)
CO4: Demonstrate Java Packages, Exception Handling, I/O, and File Handling for real-world
applications (L3)
CO5: Design and develop applications using strings, multithreading, JDBC, and JavaFX (L5)

UNIT-I:
Object Oriented Programming: Basic concepts, Principles, Program Structure in Java:
Introduction, Writing Simple Java Programs, Elements or Tokens in Java Programs, Java
Statements, Command Line Arguments, User Input to Programs, Escape Sequences Comments,
Programming Style.
Data Types, Variables, and Operators: Introduction, Data Types in Java, Declaration of Variables,
Data Types, Type Casting, Scope of Variable Identifier, Literal Constants, Symbolic Constants,
Formatted Output with printf() Method, Static Variables and Methods, Attribute Final
Introduction to Operators, Precedence and Associativity of Operators, Assignment Operator
(=), Basic Arithmetic Operators, Increment (++) and Decrement (- -) Operators, Ternary
Operator, Relational Operators, Boolean Logical Operators, Bitwise Logical Operators.
Control Statements: Introduction, if Expression, Nested if Expressions, if–else Expressions,
Ternary Operator? Switch Statement, Iteration Statements, while Expression, do–while Loop, for
Loop, Nested for Loop, for–Each for Loop, Break Statement, 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.
Java I/O and File: Java I/O API, standard I/O streams, types, Byte streams, Character streams,
Scanner class, Files in Java (Text Book 2)

UNIT-V:
String Handling in Java: Introduction, Interface Char Sequence, Class String, Methods for
Extracting Characters from Strings, Comparison, Modifying, Searching, Class String Buffer.
Multi-threaded Programming: Introduction, Need for Multiple Threads, Multithreaded
Programming for Multi-core Processor, Thread Class, Main Thread- Creation of New Threads,
Thread States, Thread Priority-Synchronization, Deadlock and Race Situations, Inter-thread
Communication - Suspending, Resuming, and Stopping of Threads.
Java Database Connectivity: Introduction, JDBC Architecture, Installing MySQL and MySQL
Connector/J, JDBC Environment Setup, Establishing JDBC Database Connections, Result Set
Interface
Java FX GUI: Java FX Scene Builder, Java FX App Window Structure, displaying text and
image, event handling, laying out nodes in scene graph, mouse events (Text Book 3)
 Text Books:
1. JAVA one step ahead, Anitha Seth, B.L.Juneja, 1e,Oxford, 2017.
2. Joy with JAVA, Fundamentals of Object Oriented Programming, Debasis Samanta,
Monalisa Sarma, Cambridge, 2023.
3. Java 9 for Programmers, Paul Deitel, Harvey Deitel,4th Edition, Pearson, 2018.

References Books:
1. The Complete Reference Java, Herbert Schildt, 11th edition, TMH, 2019.
2. Introduction to Java programming, Y Daniel Liang,7th Edition, Pearson, 2008.

Online Resources:
1. https://nptel.ac.in/courses/106/105/106105191/
2. https://infyspringboard.onwingspan.com/web/en/app/toc/lex_auth_0128804645476188163
47_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 2 2 0 0 0 0 1 0 1 2 2
CO2 3 3 3 3 2 0 0 0 0 1 0 1 2 2
CO3 3 2 2 2 2 0 0 0 0 1 0 1 3 3
CO4 3 3 3 3 2 0 0 0 0 1 0 1 3 3
CO5 3 3 3 3 3 0 0 0 0 1 0 1 3 3
Avg 3.0 2.6 2.6 2.6 2.2 0 0 0 0 1.0 0 1.0 2.6 2.6

Dr G. Jaya Suma Dr K. Venkata Rao Dr CH Ramesh

University Nominee Subject Expert Subject Expert

Dr C. Divakar Dr K. Venkata Krishna Dr P. Lalitha Kumari

Subject Expert Subject Expert Chair Person, BOS

Dr.A S C Tejaswini Kone Mr P Gopi Ms K.V. Saranya Bhavya

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

ADVANCED DATA STRUCTURES & ALGORITHMS ANALYSIS LAB

Course Objectives: The objectives of the courses to

 Acquire practical skills in constructing and managing Data structures
 Apply the popular algorithm design methods in problem-solving scenarios

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

CO1: Design and develop programs solving real-world problems using popular algorithm
design methods. (L5)
CO2: Demonstrate and implement operations on non-linear data structures like AVL trees, B-
trees, heaps, and graphs. (L3)
CO3: Critically assess design choices and implementation strategies of algorithms and data
structures. (L5)
CO4: Utilize and compare data structures and algorithms to optimize solutions and evaluate
performance. (L4)

Experiments covering the Topics:

 Operations on AVL trees, B- Trees, Heap Trees
 Graph Traversals
 Sorting techniques
 Finding Bi connected component sina graph
 Shortest path algorithms using greedy Method
 0/1Knapsack Problem using Dynamic Programming and Back tracking
 Travelling Sales person problem using Branch and Bound
 N- Queens Problem using Back tracking
 Job Sequencing using Branch and Bound

Sample Programs:
1. Construct an AVL tree for a given set of elements that are stored in a file. And
implement insert and delete operations on the constructed tree. Write the contents of
tree into a new file using in-order.
2. ConstructB-Treeanorderof5withasetof100randomelementsstoredinarray. Implement
searching, insertion and deletion operations.
3. Construct Min and Max Heap using arrays, delete any element and display the content of
the Heap.
4. Implement BFT and DFT for given graph, when graphis represented by
a) Adjacency Matrix b)Adjacency Lists

5. Write a program for finding the bi connected components in a given graph.

6. Implement Quick sort and Merge sort and observe the execution time for various
input sizes (Average, Worst and Best cases).
7. Compare the performance of Single Source Shortest Paths using Greedy method when the
graph is represented by adjacency matrix and adjacency lists.
8. Implement Job Sequencing with dead lines using Greedy strategy.
 9. Write a program to solve 0/1 Knapsack problem Using Dynamic Programming.
10. Implement N-Queens Problem Using Back tracking.
11. Use Back tracking strategy to solve 0/1 Knapsack problem.
12. Implement Travelling Sales Person problem using Branch and Bound approach.

Reference Books:
1. Fundamentals of Data Structures in C++, Horowitz Ellis, Sahni Sartaj, Mehta, Dinesh, 2nd
Edition, Universities Press, 2006.
2. Computer Algorithms /C++Ellis Horowitz, Sartaj Sahni, Sanguthevar Rajasekaran,2nd
Edition, University Press, 2008.
3. Data Structures and program design in C, Robert Kruse,1e, Pearson Education Asia, 1997.
4. An introduction to Data Structures with applications, Trembley & Sorenson, McGraw
Hill, 1984

Online Learning Resources:

1. http://cse01-iiith.vlabs.ac.in/
2. http://peterindia.net/Algorithms.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 3 3 3 3 0 0 0 0 1 0 1 2 2
CO2 3 2 3 2 2 0 0 0 0 1 0 1 3 3
CO3 3 3 3 3 3 0 0 0 0 1 0 1 3 3
CO4 3 3 3 3 3 0 0 0 0 1 0 1 3 3
Avg 3.0 2.75 3.0 2.75 2.75 0.0 0.0 0.0 0.0 1.0 0.0 1.0 2.75 2.75

Dr G. Jaya Suma Dr K. Venkata Rao Dr CH Ramesh

University Nominee Subject Expert Subject Expert

Dr C. Divakar Dr K. Venkata Krishna Dr P. Lalitha Kumari

Subject Expert Subject Expert Chair Person, BOS

Dr.A S C Tejaswini Kone Mr P Gopi Ms K.V. Saranya Bhavya

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

OBJECT-ORIENTED PROGRAMMING THROUGH JAVA LAB

Course Objectives:
The aim of this courses to

● Practice object-oriented programming in the Java programming language

● implement Classes, Objects, Methods, Inheritance, Exception, Runtime
Polymorphism, User defined Exception handling mechanism
● Illustrate inheritance, Exception handling mechanism, JDBC connectivity
● Construct Threads, Event Handling, implement packages, Java FXGUI
Course Outcomes:
After completion of the course, students will be able to
CO1: Demonstrate understanding of Java syntax including data types, control structures,
methods, classes, and objects. (L2)
CO2: Apply OOP principles like encapsulation, inheritance, polymorphism, abstraction, and
exception handling to solve programming problems. (L3)
CO3: Familiarize with Java libraries and APIs including Collections Framework, Java I/O,
JDBC, threads, and utility classes. (L2)
CO4: Design graphical user interface (GUI) applications proficiently using JavaFX. (L3)

Experiments covering the Topics:

● Object Oriented Programming fundamentals-data types, control structures
● Classes, methods, objects, Inheritance, polymorphism,
● Exception handling, Threads, Packages, Interfaces
● Files,I/Ostreams, JavaFXGUI

Sample Experiments:

Exercise–1:
1. Write a JAVA program to display default value of all primitive data type of JAVA
2. Write a java program that display the roots of a quadratic equation a x2+bx=0. Calculate
the discriminate D and basing on value of D, describe the nature of root.

Exercise-2
1. Write a JAVA program to search for an element in a given list of elements using binary
search mechanism.
2. Write a JAVA program to sort for an element in a given list of elements using bubble sort
3. Write a JAVA program using String Buffer to delete, remove character.

Exercise-3
1. Write a JAVA program to implement class mechanism. Create a class, methods andinvoke
them inside main method.
2. Write a JAVA program implements method overloading.
3. Write a JAVA program to implement constructor.
4. Write a JAVA program to implement constructor over loading.
 Exercise-4
1. Write a JAVA program to implement Single Inheritance
2. Write a JAVA program to implement multi level Inheritance
3. Write a JAVA program for abstract class to find areas of different shapes

Exercise-5
1. Write a J AVA program give example for ―super‖ keyword.
2. Write a JAVA program to implement Interface. What kind of Inheritance can be
achieved?
3. WriteaJAVA programthat implementsRuntimepolymorphism

Exercise-6
1. Write a JAVA program that describes exception handling mechanism
2. Write a JAVA program Illustrating Multiple catch clauses
3. Write a JAVA program for creation of Java Built-in Exceptions
4. Write a JAVA program for creation of User Defined Exception

Exercise-7
1. Write a JAVA program that creates threads by extending Thread class. First thread display
―Good Morning ―every 1 sec, the second thread displays ―Hello ―every 2 seconds and the
third display ―Welcome‖ every 3 seconds, (Repeat the same by implementing Runnable)
2. Write a program illustrating is Alive and join ()
3. Write a Program illustrating DaemonThreads.
4. Write a JAVA program Producer Consumer Problem

Exercise–8
1. Write a JAVA program that import and use the user defined packages
2. With out writing any code, build a GUI that display text in label an damage in an Image
View (use Java FX)
3. Build a Tip Calculate or app using several Java FX component sand learn how to respond
to user interactions with the GUI

Exercise–9
1. Write a java program that connects to a data base using JDBC
2. Write a java program to connect to a data base using JDBC and insert values into it.
3. Write a java program to connect to a data base using JDBC and delete values from it

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 0 1 0 1 2 2
CO2 3 3 3 3 2 0 0 0 0 1 0 1 3 3
CO3 3 2 2 2 2 0 0 0 0 1 0 1 2 2
CO4 3 3 3 3 2 0 0 0 0 1 0 1 3 3
Avg 3.0 2.5 2.5 2.5 2.0 0.0 0.0 0.0 0.0 1.0 0.0 1.0 2.5 2.5
 Dr G. Jaya Suma Dr K. Venkata Rao Dr CH Ramesh
University Nominee Subject Expert Subject Expert

Dr C. Divakar Dr K. Venkata Krishna Dr P. Lalitha Kumari

Subject Expert Subject Expert Chair Person, BOS

Dr.A S C Tejaswini Kone Mr P Gopi Ms K.V. Saranya Bhavya

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

PYTHON PROGRAMMING
(Skill Enhancement Course)

Course Objectives:
The main objectives of the course are to

• Introduce core programming concepts of Python programming language.

• Demonstrate about Python data structures like Lists, Tuples, Sets and dictionaries
• Implement Functions, Modules and Regular Expressions in Python Programming and
to create practical and contemporary applications using these

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

CO1: Showcase adept command of Python syntax including variables, data types, control structures,
functions, modules, and exception handling. (L3)
CO2: Apply Python programming concepts to solve diverse computational problems. (L3)
CO3: Understand and apply OOP principles in Python including classes, inheritance, polymorphism,
and encapsulation. (L3)
CO4: Become proficient in using Python libraries and frameworks such as JSON, XML, NumPy, and
pandas. (L3)
CO5: Exhibit competence in implementing and manipulating fundamental Python data structures like
lists, tuples, sets, and dictionaries. (L3)

UNTI-I:
History of Python Programming Language, Thrust Areas of Python, Installing Anaconda Python
Distribution, Installing and Using Jupyter Notebook Parts of Python Programming Language:
Identifiers, Keywords, 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...elif…else, Nested if statement, while Loop, for Loop,
continue and break Statements, Catching Exceptions Using try and except Statement.

Sample Experiments:

1. Write a program to find the largest element among three Numbers.

2. Write a Program to display all prime numbers with in 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 Callingthe
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 inString by Index
Number, String Slicing and Joining, String Methods, Formatting Strings. Lists: Creating Lists,
Basic List Operations, Indexing and Slicing in Lists, Built-In Functions Used on Lists, List
Methods, del Statement.

Sample Experiments:
1. Write a program to define a function with multiple return values.
2. Write a program to define a function using default arguments.
3. Write a program to find thelength ofthe string without using any library functions.
4. Write a program to check if the sub string 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.

Sample Experiments:
1. Write a program to create tuples (name, age, address, college) for atleast 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 addanewkey- 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 TextData, File Methods to Read and Write Data,
Reading and Writing Binary Files, Pickle Module, Reading and Writing CSV Files, Pythons
and so. 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 file
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. Implement subclasses for different shapes like circle,
triangle, and square.

UNIT-V:
Introduction to Data Science: Functional Programming, JSON and XML in Python, NumPy
with Python, Pandas.
Sample Experiments:
1. Python program to check whether a JSON string contains complex object or not.
2. Python Program to demonstrate NumPy arrays creation using array() function.
3. Python program to demonstrate use of ndim, shape, size, d type.
4. Python program to demonstrate basics licing ,integer and Boolean indexing.
5. Python program to find min, max, sum, and cumulative sum of array
6. Create a dictionary with at least five keys and each key represent value as a list where
this list contains at least ten values and convert this dictionary as a pandas data frame
and explore the data through 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, Gowrishankar S,Veena A.,CRC Press., 2018
2. Python Programming, S Sridhar, J Indumathi, V M Hariharan, 2ndEdition, Pearson,
2024
3. Introduction to Programming Using Python, Y.Daniel Liang, Pearson, 2012.

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 2 0 0 0 0 1 0 1 2 2
CO2 3 2 2 2 2 0 0 0 0 1 0 1 2 2
CO3 3 3 3 3 2 0 0 0 0 1 0 1 3 3
CO4 3 2 3 2 2 0 0 0 0 1 0 1 2 2
CO5 3 3 3 3 2 0 0 0 0 1 0 1 3 3
Avg 2.8 2.4 2.6 2.4 2.0 0 0 0 0 1.0 0 1.0 2.4 2.4
 Dr G. Jaya Suma Dr K. Venkata Rao Dr CH Ramesh
University Nominee Subject Expert Subject Expert

Dr C. Divakar Dr K. Venkata Krishna Dr P. Lalitha Kumari

Subject Expert Subject Expert Chair Person, BOS

Dr.A S C Tejaswini Kone Mr P Gopi Ms K.V. Saranya Bhavya

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

Course Objectives:

The main objectives of the courses to make student

 Understand the basic concepts and principles of operating systems, including process
management, memory management, file systems, and Protection
 Make use of process scheduling algorithms and synchronization techniques to achieve
better performance of a computer system.
 Illustrate different conditions for dead lock and their possible solutions.

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

CO1: Describe basics of operating systems and mechanisms for process, thread management,
and communication. (L2)
CO2: Understand core OS concepts including process management, memory management, file
systems, and protection. (L2)
CO3: Apply process scheduling algorithms and synchronization techniques to improve system
performance. (L3)
CO4: Illustrate deadlock conditions and evaluate possible solutions. (L3)
CO5: Analyze memory management techniques and allocation policies. (L4)

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 andImplementation,
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 Con currency: Multi-threading 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.

Text Books:
1. Operating System Concepts, SilberschatzA, Galvin PB, Gagne G, 10thEdition, Wiley,
2018.
2. Modern Operating Systems, TanenbaumA 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.MDhamdhere,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 2 2 0 0 0 0 1 0 1 2 2
CO2 3 2 2 2 2 0 0 0 0 1 0 1 2 2
CO3 3 3 3 3 2 0 0 0 0 1 0 1 3 3
CO4 3 3 3 3 2 0 0 0 0 1 0 1 3 3
CO5 2 2 3 3 3 0 0 0 0 1 0 1 3 3
Avg 2.8 2.4 2.6 2.6 2.2 0 0 0 0 1.0 0 1.0 2.6 2.6

Dr G. Jaya Suma Dr K. Venkata Rao Dr CH Ramesh

University Nominee Subject Expert Subject Expert

Dr C. Divakar Dr K. Venkata Krishna Dr P. Lalitha Kumari

Subject Expert Subject Expert Chair Person, BOS

Dr.A S C Tejaswini Kone Mr P Gopi Ms K.V. Saranya Bhavya

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

DATABASE MANAGEMENT SYSTEMS

Course Objectives:
The main objectives of the course is to

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

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

CO1: Understand the basic concepts of database management systems. (L2)

CO2: Analyze database scenarios and use ER model for conceptual design. (L4)
CO3: Utilize SQL proficiently to solve diverse query challenges. (L3)
CO4: Employ normalization techniques to improve database structure. (L3)
CO5: Assess and implement transaction processing, concurrency control, and recovery
protocols. (L4)

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
relationship, implementation of key and integrity constraints, nested queries, sub queries,
grouping, aggregation, ordering, implementation of different types of joins, view(updatable
and non-updatable), relational set operations.
 UNIT-IV:
Schema Refinement (Normalization): Purpose of Normalization or schema refinement,
concept of functional dependency, normal forms based on functional dependency Lossless
join and dependency preserving decomposition, (1NF, 2NF and 3 NF), concept of surrogate
key, Boyce-Coded 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, time stamp 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:

Text Books:
1) Database Management Systems, 3rd edition, Raghurama Krishnan, Johannes Gehrke,
TMH, 2002 (For Chapters 2, 3, 4)
2) Data base System Concepts, 5thedition, Silberschatz, Korth, Sudarsan, TMH,
2005 (For Chapter 1 and Chapter 5)

Reference Books:
1) Introduction to Data base Systems, CJ Date, 8thedition, Pearson, 2003.
2) Data base Management System Ramez Elmasri, Shamkant B. Navathe, 6thedition,
Pearson, 2010.
3) Database Principles Fundamentals of Design Implementation and Management,
Corlos Coronel, Steven Morris, Peter Robb, 10th edition, Cengage Learning, 2022

Online Learning 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 2 2 0 0 0 0 1 0 1 2 2
CO2 3 2 3 2 2 0 0 0 0 1 0 1 3 3
CO3 3 3 3 2 2 0 0 0 0 1 0 1 2 2
CO4 3 3 3 3 2 0 0 0 0 1 0 1 2 2
CO5 3 2 3 3 2 0 0 0 0 1 0 1 3 3
Avg 3.0 2.4 2.8 2.4 2.0 0 0 0 0 1.0 0 1.0 2.4 2.4
 Dr G. Jaya Suma Dr K. Venkata Rao Dr CH Ramesh
University Nominee Subject Expert Subject Expert

Dr C. Divakar Dr K. Venkata Krishna Dr P. Lalitha Kumari

Subject Expert Subject Expert Chair Person, BOS

Dr.A S C Tejaswini Kone Mr P Gopi Ms K.V. Saranya Bhavya

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

COMPUTER NETWORKS
Course Objectives:
The main objectives of the courses to

 To understand the different types of networks

 To discuss the software and hardware components of a network
 To develop an understanding the principles of computer networks.
 To familiarize with OSI model and the functions of layered structure.
 To explain networking protocols, algorithms and design perspectives

Course Outcomes:
After completion of the course, students will be able to
CO1: Identify software and hardware components of a computer network. (L2)
CO2: Explain the functionality of each layer in a computer network. (L2)
CO3: Identify and analyze flow control, congestion control, and routing issues. (L4)
CO4: Analyze and interpret the effectiveness of routing protocols. (L4)
CO5: Choose appropriate transport protocols based on application requirements. (L4)

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

UNIT-II:
The Data Link Layer: Guided Transmission Media, Persistent Storage, Twisted Pairs,
Coaxial Cable, Power Lines, Fiber Optics, Data Link Layer Design Issues, Services Provided
To The Network Layer, Framing Error Control, Flow Control, Error Detection And
Correction, Error-Correcting Codes, Error-Detecting Codes, Elementary Data Link
Protocols, Initial Simplifying Assumptions Basic Transmission And Receipt, Simplex
Link-Layer Protocols, Improving Efficiency, Bidirectional Transmission, Multiple
Frames In Flight, Examples Of Full-Duplex, Sliding Window Protocols, The Channel
Allocation Problem, Static Channel Allocation, Assumptions For Dynamic Channel
Allocation, Multiple Access Protocols, Aloha, Carrier Sense Multiple Access Protocols,
Collision-Free Protocols, Limited Contention Protocols, Wireless LAN Protocols,
Ethernet, Classic Ethernet Physical Layer, Classic Ethernet Mac Sub layer Protocol,
Ethernet Performance, Switched Ethernet, Fast Ethernet, Giga bit Ethernet, 10-
Gigabit Ethernet, 40-And100-Gigabit Ethernet, Retrospective On Ethernet.
UNIT-III:
The Network Layer: Network Layer Design Issues, Store-And-Forward Packet Switching,
Services Provided To The Transport Layer, Implementation Of Connectionless Service,
Implementation Of Connection-Oriented Service, Comparison Of Virtual-Circuit And
Datagram Networks, Routing Algorithms In A Single Network, The Optimality Principle,
Shortest Path Algorithm, Flooding, Distance Vector Routing, Link State Routing,
Hierarchical Routing Within a Network, Broadcast Routing, Multicast Routing, Anycast
Routing, Traffic Management at The Network Layer, The Need for Traffic Management:
Congestion, Approaches To Traffic Management, Internetworking, Internetworks: An
Overview, How Networks differ, Connecting Heterogeneous Networks, Connecting
Endpoints Across Heterogeneous Networks, Internetwork Routing: Routing Across Multiple
Networks Supporting Different Packet Sizes: Packet Fragmentation, The Network Layer In
The Internet, The IP Version 4 Protocol, IP Addresses, IP Version 6, Internet Control
Protocols, Label Switching and MPLS, OSPF—An Interior Gateway Routing Protocol,
BGP—The Exterior Gateway Routing Protocol, Internet Multicasting.

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

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

Text Books:

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

Edition, 2015

Reference Books:

1. Data Communications and Networking, Behrouz A. Forouzan, 5thEdition, McGraw

Hill Publication, 2017.
2. ―Computer Networking: A Top-Down Approach‖, James F. Kurose, Keith W. Ross,
6th edition, Pearson, 2019.
3. ―Networks for Computer Scientists and Engineers‖, Youlu Zheng,S hakilA kthar,
Oxford Publishers, 2016.
 Online Learning Resources:
https://nptel.ac.in/courses/106105183/25http://www.nptelvid
eos.in/2012/11/computer-networks.html
https://nptel.ac.in/courses/106105183/3

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 0 1 0 1 2 2
CO2 3 2 3 2 2 0 0 0 0 1 0 1 2 2
CO3 3 3 3 3 2 0 0 0 0 1 0 1 3 3
CO4 3 3 3 3 2 0 0 0 0 1 0 1 3 3
CO5 2 2 3 3 3 0 0 0 0 1 0 1 3 3
Avg 2.8 2.4 2.8 2.6 2.2 0 0 0 0 1.0 0 1.0 2.6 2.6

Dr G. Jaya Suma Dr K. Venkata Rao Dr CH Ramesh

University Nominee Subject Expert Subject Expert

Dr C. Divakar Dr K. Venkata Krishna Dr P. Lalitha Kumari

Subject Expert Subject Expert Chair Person, BOS

Dr.A S C Tejaswini Kone Mr P Gopi Ms K.V. Saranya Bhavya

Internal Member Industry Nominee Alumni Member
 L T P C
II Year – II Semester
0 0 3 1.5
COMPUTER NETWORKS LAB
Course Objectives:
 To understand the different types of networks
 To discuss the software and hard ware components of a network
 To enlighten the working of networking commands supported by operating system
 To impart knowledge of Network simulator2/3
 To familiarize the use of networking functionality supported by JAVA
 To familiarize with computer networking tools.

Course Outcomes:
CO1: Understand the working of wired and wireless networks. (L2)
CO2: Develop scripts to simulate wired and wireless networks. (L3)
CO3: Analyze data traffic using network analysis tools. (L4)
CO4: Develop Java programs and utilize networking commands proficiently for client-server
communication and network troubleshooting. (L3)
List of Activities/ Experiments:

1. Study different types of Network cables (Copper and Fiber) and prepare cables
(Straight and Cross) to connect Two or more systems. Use crimping tool to connect
jacks. Use LAN tester to connect the cables. - Install and configure Network Devices:
HUB, Switch and Routers. Consider both manageable and non-manageable switches.
Do the logical configuration of the system. Set the bandwidth of different ports. -
Install and Configure Wired and Wireless NIC and transfer files between systems in
Wired LAN and Wireless LAN. Consider both adhoc and infrastructure mode of
operation.
2. Work with the commands Ping, Tracert, Ipconfig, pathing, telnet, ftp, getmac, ARP,
Hostname, Nbtstat, netdiag, and Ns lookup
3. Find all the IP addresses on your network. Unicast, Multicast, and Broadcast on your
network.
4. Use Packet tracer software to build network topology and configure using Distance
vector routing protocol.
5. Use Packet tracer software to build network topology and configure using Link State
routing protocol.
6. Using JAVARMI Write a program to implement Basic Calculator.
7. Implement a Chatting application using JAVA TCP and UDP sockets.

8. Hello command is used to know whether the machine at the other end is working or
not. Echo command issued to measure the round-trip time to neighbor. Implement
Hello and Echo commands using JAVA.
9. Using Wireshark perform the following operations:
- Inspect HTTP Traffic
- Inspect HTTP Traffic from a Given IP Address,
- Inspect HTTP Traffic to a Given IP Address,
- Reject Packets to Given IP Address,
- Monitor Apache and My SQL Network Traffic.
10. Install Network Simulator 2/3.Create a wired network using dumb bell topology.
Attach agents, generate both FTP and CBR traffic, and transmit the traffic. Vary the data rates
and evaluate the performance using metrics throughput, delay, jitter and packet loss.
11. Create a static wireless network. Attach agents, generate both FTP and CBR traffic,
 and transmit the traffic. Varythedatarates and evaluate the performance using metric
throughput, delay, jitter and packet loss.
12. Create a mobile wireless network. Attach agents, generate both FTP and CBR traffic,
and transmit the traffic. Varythedatarates and evaluate the performance using metric
throughput, delay, jitter and packet loss.

Reference Books:
1. A Lab-Based Approach‖, Shivendra S.Panwar, Shiwen Mao, Jeong- dong Ryoo, and
YihanLi, ―TCP/IP Essentials: Cambridge University Press, 2004.
2. Cisco Networking Academy Program, Cisco Networking Academy, ―CCNA1 and
CCNA2 Companion Guide‖, 3rd edition, 2003.
3. ―Java Network Programming‖, Elloitte Rusty Harold, 3rd edition, O‘REILLY, 2011.

Online Learning Resources:

1. https://www.netacad.com/courses/packet-tracer-CiscoPacket Tracer.
NsManual,Availableat:https://www.isi.edu/nsnam/ns/ns-documentation.html,2011.
2. https://www.wireshark.org/docs/wsug_html_chunked/-Wireshark.
3. https://nptel.ac.in/courses/106105183/25http://www.nptelvideos.in/2012/11/compu
ter- networks.html
4. https://nptel.ac.in/courses/106105183/3
5. http://vlabs.iitb.ac.in/vlabs-dev/labs_local/computer-networks/labs/explist.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 2 2 2 0 0 0 0 1 0 0 2 2
CO2 3 2 3 2 2 0 0 0 0 1 0 0 2 2
CO3 3 3 3 3 2 0 0 0 0 1 0 0 3 3
CO4 2 2 3 3 3 0 0 0 0 1 0 0 3 3
Avg 2.8 2.25 2.75 2.5 2.25 0.0 0.0 0.0 0.0 1.0 0.0 0.0 2.5 2.5

Dr G. Jaya Suma Dr K. Venkata Rao Dr CH Ramesh

University Nominee Subject Expert Subject Expert

Dr C. Divakar Dr K. Venkata Krishna Dr P. Lalitha Kumari

Subject Expert Subject Expert Chair Person, BOS

Dr.A S C Tejaswini Kone Mr P Gopi Ms K.V. Saranya Bhavya

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

DATA BASE MANAGEMENT SYSTEMS LAB

Course Objectives:

This Course will enable students to

 Populate and query a data base using SQL DDL/ DML Commands
 Declare and enforce integrity constraints on a database
 Writing Queries using advanced concepts of SQL
 Programming PL/SQL including procedures, functions, cursors and triggers

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

CO1: Utilize DDL, DML, and DCL commands effectively within a database environment. (L3)
CO2: Construct and execute queries and develop application programs using PL/SQL. (L3)
CO3: Analyze requirements and design Procedures, Functions, Cursors, and Triggers to automate tasks
and optimize database functionality. (L4)
CO4: Establish database connectivity using JDBC (Java Database Connectivity). (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

Sample 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, INTERSET, Constraints. Example: - Select the roll number and name of the
student who secured fourth rank in the class.
3. Queries using Aggregate functions (COUNT, SUM, AVG, MAX and MIN), GROUP
BY, HAVING and Creation and dropping of Views.

4. Queries using Conversion functions (tochar, to number and to date), string functions
(Concatenation, lpad, rpad, ltrim, rtrim, lower, upper, initcap, length, sub strand instr),
date functions (Sysdate, next_day, add months, last day, months between, least, greatest,
trunc, round, to_char, to date)

5.
i. Create a simple PL/SQL program which includes declaration section,
executable section and exception–Handling section (Ex. Student marks can be
selected from the table and printed for those who secured first class and an
exception can be raised if no records were found)
 ii. Insert data into student table and use COMMIT, ROLLBACK and
SAVEPOINT in PL/SQL block.
6. Develop a program that includes the features NESTED IF, CASE and CASE
expression. The program can be extended using the NULLIF and COALESCE
functions.
7. Program development using WHILE LOOPS, numeric FOR LOOPS, nested loops
using ERROR Handling, BUILT –IN Exceptions, USE defined Exceptions, RAISE-
APPLICATION ERROR.
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 this arch operation on table using indexing and non-
indexing techniques.
13. Write a Java program that connect sto 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, 1997.

2. "Data base Systems Using Oracle‖, Nilesh Shah,PHI, 2007
3. ―Introduction to SQL‖, Fourth Edition, Rick F Vander Lans, Pearson Education,
2007
4. Data base Systems‖, Ramez Elmasri, Shamkant, B.Navathe,―Pearson Education,
6th Edition, 2013.
5. Data base Principles Fundamentals of Design Implementation and Management,
Corlos Coronel, Steven Morris, Peter Robb, 10thedition, 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 1 2 2
CO2 3 2 3 2 2 0 0 0 0 1 0 1 2 2
CO3 3 3 3 3 2 0 0 0 0 1 0 1 3 3
CO4 2 2 3 3 3 0 0 0 0 1 0 1 3 3
Avg 2.8 2.2 3.0 2.5 2.2 0.0 0.0 0.0 0.0 1.0 0.0 1.0 2.5 2.5
 Dr G. Jaya Suma Dr K. Venkata Rao Dr CH Ramesh
University Nominee Subject Expert Subject Expert

Dr C. Divakar Dr K. Venkata Krishna Dr P. Lalitha Kumari

Subject Expert Subject Expert Chair Person, BOS

Dr.A S C Tejaswini Kone Mr P Gopi Ms K.V. Saranya Bhavya

Internal Member Industry Nominee Alumni 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 a webpage by applying appropriate CSS styles to HTML elements
 Experiment with Java Script to develop dynamic web pages and validate forms

Course Out comes:

CO1: Design websites effectively. (L5)

CO2: Apply styling techniques to web pages. (L3)
CO3: Make web pages interactive using scripting. (L3)
CO4: Design forms for web applications. (L4)
CO5: Choose control structures based on logic requirements. (L3)

Experiments covering the Topics:

 Lists, Links and Images

 HTML Tables, Forms and Frames
 HTML5 and Cascading Style Sheets, Types of CSS
 Select or forms
 CSS with Color, Back ground, Font, Text and CSS Box Model
 Applying Java Script –internal and external, I/O, Type Conversion
 Java Script Conditional Statements and Loops, Pre-defined and User-defined Objects
 Java Script Functions and Events
 Node. js

Sample Experiments:

1. Lists, Links and Images

a. Write a HTML program, to explain the working of lists.
Note: It should have an ordered list, unordered list, nested lists and ordered list in an
unordered list and definition lists.
b. Write a HTML program, to explain the working of hyperlinks using <a> tag and href,
target attributes.
c. Create a HTML document that has your image and your friend‘s image with a specific
height and width. Also when clicked on the images it should navigate to their
respective profiles.
d. Write a HTML program, in such a way that, rather than placing large images on apage,
the preferred technique is to use thumbnails by setting the height and width parameters
to something like to 100*100 pixels. Each thumbnail image is also a link to a full sized
version of the image. Create an image gallery using this technique.
2. HTML Tables, Forms and Frames
a. Write a HTML program, to explain the working of tables.(use tags: <table>, <tr>,
<th>, <td> and attributes: border, 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, cell
padding, border, row span, col span etc.).
c. Write a HTML program, to explain the working of forms by designing Registration
form. (Note: Include text field, password field, number field, date of birth field,
checkboxes, radio buttons, list boxes using <select>&<option> tags, <text area> and
two buttons i.e.: 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 into 3 parts on either direction. (Note: first frame image, second frame
paragraph, third frame hyperlink. 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. Write a program to apply different types (or levels of styles or style specification
formats) - inline, internal, external styles to HTML elements. (identify selector,
property and value).

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

5. CSS with Color, Back ground, 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 back ground image half way down the page, tiltingit
horizontally. The image should remain in place when the user scrolls up or down.
c. Write a program using the following terms related to CSS font and text:
i. font-size ii. font-weight iii. font-style
iv. text-decoration v. text-transformation VI. Text-alignment
d. Write a program, to explain the import acne of CSS Box model using
i. Content ii. Border iii. Margin iv. padding

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

a. Write a program to embed internal and external Java Script in a web page.
b. Write a 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 a voter for his name and age.
Display the information in table format along with either the voter can vote or not
 7. Java Script 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 object by using properties, methods, accessors,
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 thewords
―LARGER NUMBER‖ in an information message dialog. If the numbers are equal,
output HTML text as ―EQUAL NUMBERS‖.
b. Write a program to display week days using switch case.
c. Write a program to print1 to 10numbers usingfor, whileand 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 ‗ARMSTRONG
NUMBER‘ or not. [E.g.: 153 is an Armstrong number, since sum of the cube of the
digits is equal to the number i.e.,13 + 53+ 33 = 153]
f. Write a program to display the denomination of the amount deposited in the bank in
terms of100‘s,50‘s,20‘s,10‘s,5‘s,2‘s& 1‘s.(E.g.: 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 text box and four buttons named Factorial, Fibonacci,
Prime, and Palindrome. When a button is pressed an appropriate function should be
called to display
i. Factorial of that number
ii. Fibonacci series up to that number
iii. Prime numbers up to that number
iv. Isitpalindrome or not
c. Write a program to validate the following fields in a registration page
i. Name (start with alphabet and followed by alphanumeric and the length
should not be less than 6 characters)
ii. Mobile (only numbers and length10 digits)
iii. E-mail (should contain format like xxxxxxx@xxxxxx.xxx)

Text Books:

1. John Dean, Web Programming with HTML5, CSS and Java Script, Jones & Bartlett
Learning, 2019.
 Reference Books:

1. Programming the World Wide Web, Robet W Sebesta,7th Edition, Pearson, 2013.
2. Pro MERN Stack: Full Stack Web App Development with Mongo, Express, React,
and Node, Vasan Subramanian, 2nd edition, A Press, O‘Reilly, 2015.
Online Learning Resources:

https://www.w3schools.com/htmlhttps://www.w3schools.com/
csshttps://www.w3schools.com/js/https://www.w3schools.com
/nodejshttps://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 2 2 2 0 0 0 0 1 0 1 2 2
CO2 3 2 3 2 2 0 0 0 0 1 0 1 2 2
CO3 3 3 3 3 2 0 0 0 0 1 0 1 3 3
CO4 3 3 3 3 2 0 0 0 0 1 0 1 3 3
CO5 2 2 3 3 3 0 0 0 0 1 0 1 3 3
Avg 2.8 2.4 2.8 2.6 2.2 0 0 0 0 1.0 0 1.0 2.6 2.6

Dr G. Jaya Suma Dr K. Venkata Rao Dr CH Ramesh

University Nominee Subject Expert Subject Expert

Dr C. Divakar Dr K. Venkata Krishna Dr P. Lalitha Kumari

Subject Expert Subject Expert Chair Person, BOS

Dr.A S C Tejaswini Kone Mr P Gopi Ms K.V. Saranya Bhavya

Internal Member Industry Nominee Alumni Member