OBJECT ORIENTED PROGRAMMING USING JAVA LAB

netaji gandi Sunday, February 8, 2026
Edit
Java Programming Lab Experiments VR-23 2025-26

Java Programming Lab Experiments

Experiment 1: Fibonacci Sequence

  1. The Fibonacci sequence is defined by the following rule. The first 2 values in the sequence are 1, 1.
  2. Every subsequent value is the sum of the 2 values preceding it.
  3. Write a Java Program that uses both recursive and non recursive functions to print the nth value of the Fibonacci sequence.
Download Experiment 1

Experiment 2: Prime Numbers

  1. Write a Java Program that prompts the user for an integer.
  2. Print out all the prime numbers up to that Integer.
Download Experiment 2

Experiment 3: Palindrome String

  1. Write a Java Program that checks whether a given string is a palindrome or not.
  2. Example: MALAYALAM is a palindrome.
Download Experiment 3

Experiment 4: Sorting Names

  1. Write a Java Program for sorting a given list of names in ascending order.
Download Experiment 4

Experiment 5: Runtime Polymorphism

  1. Write a Java Program that illustrates how runtime polymorphism is achieved.
Download Experiment 5

Experiment 6: Packages Demonstration

  1. Write a Java Program to create and demonstrate packages.
Download Experiment 6

Experiment 7: StringTokenizer Integers

  1. Write a Java Program, using StringTokenizer class.
  2. Read a line of integers and display each integer.
  3. Display the sum of all integers.
Download Experiment 7

Experiment 8: File Information & FileInputStream

  1. Read a file name from the user.
  2. Display whether the file exists.
  3. Display whether the file is readable or writable.
  4. Display the type of file and the length of the file in bytes.
  5. Display the contents using FileInputStream class.
Download Experiment 8

Experiment 9: File Character, Line, Word Count

  1. Write a Java Program that displays the number of characters, lines and words in a text file.
Download Experiment 9

Experiment 10: Simple Calculator (GUI)

  1. Write a Java Program that works as a simple calculator.
  2. Use a grid layout to arrange buttons for digits and + - * / % operations.
  3. Add a text field to display the result.
Download Experiment 10

Experiment 11: Mouse Events

  1. Write a Java Program for handling mouse events.
Download Experiment 11

Experiment 12: Thread Life Cycle

  1. Write a Java Program demonstrating the life cycle of a thread.
Download Experiment 12

Experiment 13: Pie Chart GUI

  1. Write a Java Program that lets users create Pie charts.
  2. Design your own user interface using Swings and AWT.
Download Experiment 13

Experiment 14: Queue with User Defined Exception

  1. Write a Java Program to implement a Queue.
  2. Use user defined Exception Handling.
  3. Make use of throw and throws.
Download Experiment 14

Web Resources

  1. https://www.iitk.ac.in/esc101/05Aug/tutorial/information/resources.html
  2. https://labex.io/skilltrees/java
  3. https://docs.oracle.com/javase/tutorial/index.html
  4. https://introcs.cs.princeton.edu/java/home/
Responsive colorful Java lab syllabus page
netaji gandi Sunday, February 8, 2026
- 0 comments
OBJECT ORIENTED PROGRAMMING USING JAVA

netaji gandi
Edit

Object Oriented Programming with Java

I Year – II Semester

UNIT–I

Basics of Object Oriented Programming (OOP):Need for OO paradigm , A way of viewing world- Agents, responsibility, messages, methods, classes and instances, class hierarchies (Inheritance), method binding, overriding and exceptions, summary of OOP concepts, coping with complexity, abstraction mechanisms. Java Basics: Data types, variables, scope and lifetime of variables, arrays, operators, expressions, control statements, type conversion and costing, simple java program, classes and objects- concepts of classes, objects, constructors methods, access control, this keyword, garbage collection, overloading methods and constructors, parameter passing, recursion, string handling.

Download Unit I

UNIT–II

Inheritance: Hierarchical abstractions, Base class object, subclass, subtype, substitutability, forms of inheritance- specialization, specification, construction, extension, limitation, combination, benefits of inheritance costs of inheritance. Member access rules, super uses, using final with inheritance, polymorphism, abstract classes.Packages and Interfaces: Defining, Creating and Accessing a package, Understanding CLASSPATH, Importing packages, differences between classes and interfaces, defining an interface, Implementing interface, applying interfaces variables in interface and extending interfaces.

Download Unit II

UNIT–III

Exception handling and Multithreading: Concepts of exception handling, benefits of exception handling, Termination or resumptive models, exception hierarchy, usage of try, catch, throws and finally, built in exceptions, creating own exception subclasses. Differences between multithreading and multitasking, thread lifecycle, creating threads, synchronizing threads, daemon threads, thread groups.

Download Unit III

UNIT–IV

Event Handling: Events, Event sources, Event classes, Event Listeners, Delegation event model, handling mouse and keyboard events, Adapter classes, inner classes. The AWT class hierarchy, user-interface components- labels, button, canvas, scrollbars, text components, check box, checkbox groups, choices, list panes, scroll pane, dialogs, menu bar, graphics, layout manager, layout manager types- boarder, grid, flow, card and grid bag.

Download Unit IV

UNIT-V

Swings: Introduction, limitations of AWT, MVC architecture, components, containers, exploring swing- JFrame and JComponent, Icons and Labels, text fields, buttons-The JButton class, Check boxes, Radio Buttons, Combo boxes, Tabbed panes, Scroll panes, Trees and Tables

Download Unit V

Text Books & Reference Books

Text Books: 1. Java-The Complete Reference,7/e, Herbert schildt, TMH Reference Books: 1. JAVA: How to program,8/e, Dietal, Dietal, PHI 2. Introduction of programming with JAVA, S.Dean, TMH 3. Introduction to JAVA programming, 6/e, Y.Daniel Liang, Pearson 4. Core Java2, Vol1(Vol2) Fundamentals (Advanced),7/e, Cay.S.Horstmann, Gary Cornell, Pearson 5. Big Java 2,3/e, Cay.S.Horstmann,Wiley 6. Object Oriented Programming through Java, P.Radha Krishna, University Press

Download Books List
Complete official syllabus content preserved exactly as provided.

netaji gandi
- 0 comments
Data Structures Lab Experiments VR-23 2025-26

netaji gandi
Edit
Data Structures Lab Experiments VR-23 2025-26

Data Structures Lab Experiments

Exercise 1: Array Manipulation

  1. Write a program to reverse an array.
  2. C Programs to implement the Searching Techniques – Linear & Binary Search
  3. C Programs to implement Sorting Techniques – Bubble, Selection and Insertion Sort
Download Exercise 1

Exercise 2: Linked List Implementation

  1. Implement a singly linked list and perform insertion and deletion operations.
  2. Develop a program to reverse a linked list iteratively and recursively.
  3. Solve problems involving linked list traversal and manipulation.
Download Exercise 2

Exercise 3: Linked List Applications

  1. Create a program to detect and remove duplicates from a linked list.
  2. Implement a linked list to represent polynomials and perform addition.
  3. Implement a double-ended queue (deque) with essential operations.
Download Exercise 3

Exercise 4: Double Linked List Implementation

  1. Implement a doubly linked list and perform various operations to understand its properties and applications.
  2. Implement a circular linked list and perform insertion, deletion, and traversal.
Download Exercise 4

Exercise 5: Stack Operations

  1. Implement a stack using arrays and linked lists.
  2. Write a program to evaluate a postfix expression using a stack.
  3. Implement a program to check for balanced parentheses using a stack.
Download Exercise 5

Exercise 6: Queue Operations

  1. Implement a queue using arrays and linked lists.
  2. Develop a program to simulate a simple printer queue system.
  3. Solve problems involving circular queues.
Download Exercise 6

Exercise 7: Stack and Queue Applications

  1. Use a stack to evaluate an infix expression and convert it to postfix.
  2. Create a program to determine whether a given string is a palindrome or not.
  3. Implement a stack or queue to perform comparison and check for symmetry
Download Exercise 7

Exercise 8: Binary Search Tree

  1. Implementing a BST using Linked List.
  2. Traversing of BST.
Download Exercise 8

Exercise 9: Hashing

  1. Implement a hash table with collision resolution techniques.
  2. Write a program to implement a simple cache using hashing.
Download Exercise 9

Exercise 10: Graphs

  1. Write a program to implement a graph using BFS
  2. Write a program to implement a graph using DFS
Download Exercise 10

Textbooks

  1. Data Structures and algorithm analysis in C, Mark Allen Weiss, Pearson, 2nd Edition.
  2. Fundamentals of data structures in C, Ellis Horowitz, Sartaj Sahni, Susan Anderson-Freed, Silicon Press, 2008

Reference Books

  1. Algorithms and Data Structures: The Basic Toolbox by Kurt Mehlhorn and Peter Sanders
  2. C Data Structures and Algorithms by Alfred V. Aho, Jeffrey D. Ullman, and John E. Hopcroft
  3. Problem Solving with Algorithms and Data Structures by Brad Miller and David Ranum
  4. Introduction to Algorithms by Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, and Clifford Stein
  5. Algorithms in C, Parts 1-5 (Bundle): Fundamentals, Data Structures, Sorting, Searching, and Graph Algorithms by Robert Sedgewick
Responsive colorful lab syllabus page
netaji gandi
- 0 comments
Data Structures

netaji gandi
Edit

Data Structures

I Year – II Semester

UNIT I

Introduction to Data Structures: Definition and importance of data structures, Abstract data types (ADTs) and their implementation, Overview of time and space complexity analysis of data structures. Searching Techniques: Linear & Binary Search, Sorting Techniques: Bubble sort, Selection sort, Insertion Sort, Quick Sort and Merge Sort.

Download Unit I

UNIT II

Linked Lists: Singly linked lists, representation and operations, doubly linked lists, and circular linked lists, Comparing arrays and linked lists, Applications of linked lists.

Download Unit II

UNIT III

Stacks: Introduction to stacks: properties and operations,recursions implementing stacks using arrays and linked lists, Applications of stacks in expression evaluation, reversing list etc.

Download Unit III

UNIT IV

Queues: Introduction to queues: properties and operations, implementing queues using arrays and linked lists, Applications of queues in priority queue etc. Deques: Introduction to deques (double-ended queues), Operations on deques and their applications. Circular queues: Introduction to Circular queues, Operations on Circular queues, and their applications.

Download Unit IV

UNIT V

Trees & Graphs: Introduction to Trees, Binary Search Tree – Insertion, Deletion & Traversals, Graphs: Definition, applications, Properties, representation of graphs (adjacency & linked adjacency),graph searching methods(DFS & BFS).

Hashing: Brief introduction to hashing and hash functions, Collision resolution techniques: chaining and open addressing.

Hash tables: basic implementation and operations, Applications of hashing in unique identifier generation, caching, etc.

Download Unit V
Complete official syllabus content preserved with colorful design.

netaji gandi
- 0 comments
Subscribe to: Comments ( Atom )

OBJECT ORIENTED PROGRAMMING USING JAVA LAB

Java Programming Lab Experiments VR-23 2025-26 Java Programming Lab Experiments Experiment 1: Fibonacci Sequence The F...