Most Recent

Facebook

OBJECT ORIENTED PROGRAMMING USING JAVA LAB
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/

netaji gandi Sunday, February 8, 2026
OBJECT ORIENTED PROGRAMMING USING JAVA

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

netaji gandi
Data Structures Lab Experiments VR-23 2025-26
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

netaji gandi
Data Structures

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

netaji gandi
Smart India Hackathon (SIH) 2025: Complete Guide with Problem Statements, Timeline & Idea PPT Template

 

Smart India Hackathon (SIH) 2025: Complete Guide with Problem Statements, Timeline & Idea PPT Template

Smart India Hackathon (SIH) 2025: Complete Guide with Problem Statements, Timeline & Idea PPT Template

Lets CodeSeptember 8, 2025

If you’re a student in India who’s into coding, tech, or just loves solving real-world problems, the Smart India Hackathon (SIH) is something you don’t want to miss.

It’s not just another coding competition, it’s one of the biggest platforms where students can showcase their skills, solve meaningful challenges, and actually build things that make an impact. Since its start in 2017, SIH has grown into the world’s largest open innovation platform, with over 1.3 million students participating across editions.

What’s SIH All About?

Imagine this: you and your team are coding away or building a gadget for 36 hours straight, no sleep, just pure energy, trying to crack real problems like improving rural healthcare or making cities greener. That’s what Smart India Hackathon (SIH) is all about.

It’s a nationwide innovation marathon, powered by the Ministry of Education and AICTE, where students work on problem statements (PS) given by government bodies (think Indian Railways, DRDO) and big industry names (like Tata, MathWorks, and more).

The spirit? “No problem is too big. No idea is too small.” It’s about bold ideas, teamwork, and turning classroom knowledge into something that can actually change lives.

There are two main tracks:

 Software Edition → Apps, AI, websites, digital tools.

Educational software solutions

Hardware Edition → IoT devices, robots, physical prototypes.

And the best part? It’s open to everyone, undergrads, postgrads, even PhD students, from tech or non-tech backgrounds. No prior hackathon experience needed, just curiosity and passion.

Winners can bag up to ₹1 lakh, get mentorship from experts, and sometimes even see their solutions rolled out by the government. Pretty exciting, right?

How SIH Became a Big Deal

It began with 28,000+ teams coding software solutions. Now? It’s a beast, with 600,000+ teams in 2024 alone. Here’s the journey in a quick table:

Educational software solutions

YearWhat Went DownHow Many Showed UpTracks
2017First-ever SIH; software focus28,000+ teamsSoftware
2018Added hardware; smart cities vibe100,000+Both
2019AI/IoT took off; 1,000+ PS1.5 lakh+Both
2020Went virtual (COVID); disaster management wins200,000+Both
2021Hybrid mode; sustainability focus400,000+Both
2022
Educational software solutions
Huge turnout; AYUSH ministry wins500,000+Both
2023Infra monitoring tools; Thapar Institute killed it600,000+Both
2024PM Modi joined virtually; cybersecurity ruled600,000+ teamsBoth
20258th edition; 2,877+ PS; still rollingTBD (gonna be huge)Both

Each year ups the ante, with more problems and bigger impact, all tied to making India self-reliant (Atmanirbhar Bharat).

Some Crazy Stats

SIH is massive. Check these numbers:

  • 13,91,884+ students have joined the fun.
  • 12,800+ alumni are now in startups or big tech.
  • 6,497 institutes—from IITs to small colleges—are in.
  • 2,877+ problem statements tackled over the years.
  • 133 startups born from SIH ideas.

These stats aren’t just for show—they’ve led to real stuff, like AI tools for farmers or smart city tech saving energy.

SIH 2025: What’s Happening Now (As of Sep 9, 2025)

SIH 2025 started on August 25 with problem statements dropping via a live stream. Colleges are buzzing with internal hackathons, and even though the registration deadline was Sep 6, your college’s SPOC can still nominate teams till September 30. So, there’s still a shot to jump in!

What Problems Are We Solving?

There are 2,877+ problem statements from 100+ orgs—ministries, PSUs, and corporates. Themes are super varied:

  • Healthcare: APIs for traditional medicine (like NAMASTE with ICD-11).
  • Agriculture: AI for crop health (PS SIH25099 from MathWorks).
  • Smart Cities: 3D road modeling (SIH25100).
  • Sustainability: Saving energy or managing waste.
  • Education: Digital learning tools.
  • Defense: Cybersecurity hacks.
  • Social Good: Disaster response, accessibility.

Download the full list (Excel or PDF) at sih.gov.in/sih2025PS. Unofficial sites like sih2025.vercel.app help you sort them by theme.

The Timeline (Don’t Sleep on This!)

Here’s the schedule:

  • Aug 25: Problem statements dropped.
  • Sep 6: Team registrations closed (but check with your SPOC).
  • Sep 8–20: Internal hackathons.
  • Sep 30: Extended deadline for idea submissions/nominations.
  • Late Sep–Oct: National shortlisting.
  • Dec 2025: 36-hour grand finale at nodal centers (dates TBD).

Official guidelines: SIH2025-Guidelines-College-SPOC.pdf. X is lit with updates—NIT Sikkim’s got 45 teams, CGU Odisha extended their internal to Sep 8. Tamil Nadu’s slacking on submitting PS but their students are all in. Oh, and the SIH site’s Twitter link was broken—classic!

How to Jump In: Your Game Plan

Missed the Sep 6 deadline? If your college is still doing internal hackathons, you’re not out yet. Here’s how to get in:

  1. Who Can Join? Any student (UG, PG, PhD) from an AICTE/UGC-approved college. Teams need 6 members (at least 1 girl is a must for some PS).
  2. How to Start? Bug your college’s SPOC to register on sih.gov.in. Pick a problem statement.
  3. Internal Hackathon: Pitch your idea at your college (happening now—Sep!). Winners go to nationals.
  4. Grand Finale: Shortlisted teams get 36 hours to build and present. Judges care about innovation, feasibility, and impact.
  5. Pro Tips:
    • Use the official PPT template (on the SIH site).
    • Build a working prototype (code + demo = win).
    • Balance studies—AICTE tells colleges to adjust exam schedules.
    • Need teammates? Hit up StudentsHub.tech.

If you’re out for 2025, start prepping for 2026 or join the SIH alumni network.

Sample PPT to Pitch Your SIH Idea

To help you ace your proposal, here’s a sample PPT slide deck structure based on the official SIH template and tips from past winners. It’s designed for a problem statement like SIH25099 (AI-based Crop Health Monitoring) but you can tweak it for any PS. Use PowerPoint or Canva, keep slides clean, and stick to 6 slides max for internal hackathons.

Slide 1: Title Page

  • SMART INDIA HACKATHON 2025
  • Problem Statement ID: SIH25099 – AI-Based Crop Health Monitoring
  • Theme: Agriculture
  • PS Category Software
  • Team ID: [As per portal]
  • Team Name: [Your Team Name]
  • Educational software solutions

Slide 2: Idea Title

AI-Powered Crop Health Monitoring System

  • Detects crop stress (pests, disease, nutrient deficiency) from satellite imagery
  • Provides farmer-friendly dashboard with alerts and recommendations
  • Innovation: Affordable, multilingual, integrates weather + soil data
  • Uniqueness: Offline-ready for rural use, scalable across regions

Slide 3: Technical Approach

  • Tech Stack
    • AI/ML: Python, TensorFlow
    • Backend: Flask
    • Frontend: React
    • Data: Google Earth Engine, Weather APIs
  • Process
    1. Fetch satellite data
    2. Preprocess & train AI models
    3. Detect anomalies in crop health
    4. Generate real-time alerts + dashboard view

📊 Visual Suggestion: Flowchart showing Data → AI Model → Dashboard → Alerts


Slide 4: Feasibility and Viability

  • Feasibility
    • Uses open-source APIs & cloud infra
    • Scalable to multiple crops/regions
  • Challenges
    • Internet gaps in rural areas
    • Data availability & accuracy
  • Solutions
    • Offline mobile mode with sync
    • Partnership with government agri agencies for datasets

Slide 5: Impact and Benefits

  • Target Audience
    • Farmers, NGOs, government agri bodies
  • Benefits
    • 20% increase in crop yield (hypothetical)
    • Reduced losses from pests/disease
    • Cost-effective & easy-to-use system
  • Wider Impact
    • Supports SDG 2: Zero Hunger
    • Aligned with Atmanirbhar Bharat

📊 Visual Suggestion: Infographic with yield % increase and cost reduction


Slide 6: Research and References

  • Research Sources
    • FAO reports on AI in agriculture
    • Google Earth Engine documentation
    • MathWorks resources on crop monitoring
    • IEEE papers on precision farming
  • Similar Solutions Studied
    • IBM Watson Decision Platform for Agriculture
    • Plantix app

Stories That’ll Fire You Up

Past winners are straight-up inspiring:

  • 2024: Rungta College owned the  software track; PM Modi hyped their cybersecurity solutions. Some PS (like SIH1529) had no winners due to incomplete ideas.
  • 2023: Thapar Institute’s infra tool and Shiv Nadar’s bug-hunting app were clutch.
  • 2022: Kerala’s Amal Jyothi College built an AYUSH app; team “AgainstTheCurrent” nailed an Airports Authority PS.
  • 2020: Aaditya Mankar’s team made search-and-rescue tech.
  • Educational software solutions

Real talk: One team spent 4 months prepping, swearing by React and group chats. Another said SIH launched their startup.

Why SIH is a Total Game-Changer

For you: Level up your skills, pimp your resume, network with pros (alumni are at Google, startups). For government: Cheap, fresh solutions, like 50 lakh solar lights from past SIH ideas. For corporates: Scout talent and flex their brand across 6,000+ colleges (MathWorks, anyone?).

Big picture? SIH’s sparked 133 startups, shaped policies (smart classrooms, anyone?), and made India’s innovation scene pop. Downsides? Exam clashes (AICTE’s got your back) or team drama (pick your squad wisely). Worth it? Hell yeah.

At Last

SIH 2025 is your shot to shine. Reach out to your SPOC—nominations are open till Sep 30! If you miss it, prep for 2026 or join the alumni crew. India needs your big ideas.

Must-Have Resources:

netaji gandi Friday, September 12, 2025

OBJECT ORIENTED PROGRAMMING USING JAVA LAB

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