Detailed Java GUI-Based Micro Project Problem Statements

### Group 1 – Project Problem Statement

**Project Title:** Develop a GUI-based Java project using **AWT**, **Swing**, and **Applet**
that incorporates the following features:

WAP to print the sum of cubes of the first N natural numbers.

WAP to find the sum of all odd numbers in an array.
WAP to implement an algorithm to check if two strings are permutations of each other.
WAP to check if a number is a Narcissistic number (sum of its own digits raised to the
power of the number of digits).
WAP to implement a function to find the longest increasing subsequence in an array.
WAP to implement a function that returns the factorial of a number using recursion.
WAP to implement a basic voting system.
WAP to print a diamond pattern of stars.
WAP to print a number pyramid pattern.
WAP to check if a given string is a valid palindrome without using built-in functions.
WAP to implement a simple stopwatch using loops and sleep function.
WAP to check if a number is a power of two.
.
WAP to generate Gray code sequences.
WAP to implement a simple search engine for a list of strings.
WAP to implement a basic digital clock display.
WAP to find the longest common subsequence (LCS) of two strings.
WAP to count the number of zeros in a sparse matrix.
WAP to implement a simple rock-paper-scissors game.
WAP to implement a function to find the kth largest element in an array.
WAP to implement a basic text-based chatbot.
WAP to find the sum of digits of a number in its binary form.
WAP to count the number of pairs in an array whose sum equals a given value.
WAP to print the sum of the first N odd numbers using recursion.
WAP to check if a number is a power of two.
WAP to check if a given matrix is a magic square.
WAP to implement a simple reminder notification system.
WAP to generate all possible subsets of a given sum.
WAP to find all prime numbers between two given numbers using recursion.
WAP to implement a simple interest calculator.
WAP to implement the counting sort algorithm.

Page 1 of 38
 WAP to check if a given number is prime.
WAP to generate the Tribonacci series up to N terms.
WAP to generate binary strings of length N without consecutive 1s.
WAP to check if a number is a Smith number.
WAP to find the largest number that can be formed from a given set of digits.
WAP to check if a number is a palindrome using a non-recursive approach.

**Project Overview:**
Design and implement a Java-based application that allows users to:
- Perform various operations related to the above-listed features.
- Ensure that the GUI is user-friendly and intuitive.
- Handle both successful and erroneous inputs gracefully.

**Functional Requirements:**
- **AWT:**
- Create input forms using AWT components such as TextField, Label, Button, Checkbox, and
Choice.
- Use ActionListener and other event handlers to process user inputs.

- **Swing:**
- Display data using JTable and JTextArea.
- Create a navigation menu using JMenuBar.
- Provide dialog boxes (JOptionPane) for alerts and messages.

- **Applet:**
- Create graphical visualizations (e.g., charts or diagrams).
- Ensure that the applet window resizes dynamically.

**Technical Requirements:**
- Use **exception handling** to manage runtime errors.
- Implement **multithreading** to manage parallel tasks (e.g., loading data while the user
interacts with the app).
- Apply **data validation** to prevent incorrect inputs.
- Ensure proper **code documentation** and **modularization**.

**Evaluation Criteria:**
- Code quality and maintainability.
- User Interface and ease of use.
- Performance and responsiveness.
- Error handling and recovery.
- Completeness of features listed above.

Page 2 of 38
### Group 2 – Project Problem Statement
**Project Title:** Develop a GUI-based Java project using **AWT**, **Swing**, and **Applet**
that incorporates the following features:

WAP to find the union of two arrays.

WAP to find if a number is a perfect cube using recursion.
WAP to find the most frequent character in a string.
WAP to implement a basic spell checker.
WAP to find the sum of the first N triangular numbers.
WAP to find the most frequent character in a string.
WAP to generate a sequence of Twin Primes up to a given range.
WAP to find the first duplicate element in an array.
WAP to find the number of trailing zeroes in a binary representation of a number.
WAP to find the number of divisors of a number without using loops.
WAP to rotate a given matrix 90 degrees clockwise.
WAP to check if a given number is a power of three.
WAP to check if a number is divisible by 3, 5, or both.
WAP to check if a number is a Fibonacci number using a mathematical formula.
WAP to find the sum of all XOR pairs in an array.
WAP to check if a number is divisible by 11.
WAP to print an Inverted Number Pyramid.
WAP to find the maximum sum subarray in an array.
WAP to print the multiplication table of 9.
WAP to find the sum of squares of the first N numbers divisible by 4.
WAP to check if a number is a binary palindrome.
WAP to implement a depth-first search (DFS) algorithm.
WAP to find the sum of the first N prime numbers.
WAP to find the nth number in the Padovan sequence.
WAP to check if a given string is a valid anagram of another string.
WAP to implement a basic calculator with addition, subtraction, multiplication, and
division.
WAP to generate a basic summary report of a given text.
WAP to check if a number is an Emirp number.
WAP to implement Tower of Hanoi.
WAP to check if a number is a narcissistic number.
WAP to find the highest power of 2 less than or equal to N.
WAP to find the sum of the first N odd numbers using recursion.
WAP to check if a number is a Mersenne prime.
WAP to implement the shell sort algorithm.

Page 3 of 38
 WAP to check if a number is a sum of two squares.
WAP to count the number of trailing zeros in the factorial of a number.
WAP to find the difference between the sum of squares and square of sum of the first N
natural numbers.

**Project Overview:**
Design and implement a Java-based application that allows users to:
- Perform various operations related to the above-listed features.
- Ensure that the GUI is user-friendly and intuitive.
- Handle both successful and erroneous inputs gracefully.

**Functional Requirements:**
- **AWT:**
- Create input forms using AWT components such as TextField, Label, Button, Checkbox, and
Choice.
- Use ActionListener and other event handlers to process user inputs.

- **Swing:**
- Display data using JTable and JTextArea.
- Create a navigation menu using JMenuBar.
- Provide dialog boxes (JOptionPane) for alerts and messages.

- **Applet:**
- Create graphical visualizations (e.g., charts or diagrams).
- Ensure that the applet window resizes dynamically.

**Technical Requirements:**
- Use **exception handling** to manage runtime errors.
- Implement **multithreading** to manage parallel tasks (e.g., loading data while the user
interacts with the app).
- Apply **data validation** to prevent incorrect inputs.
- Ensure proper **code documentation** and **modularization**.

**Evaluation Criteria:**
- Code quality and maintainability.
- User Interface and ease of use.
- Performance and responsiveness.
- Error handling and recovery.
- Completeness of features listed above.

---

Page 4 of 38
### Group 3 – Project Problem Statement
**Project Title:** Develop a GUI-based Java project using **AWT**, **Swing**, and **Applet**
that incorporates the following features:

WAP to reverse an array using recursion.

WAP to calculate the sum of digits of a number raised to the power of 7.
WAP to check if a number is a perfect number.
WAP to remove all duplicates from a sorted array.
WAP to calculate the factorial of a number using a recursive function.
WAP to find the missing number in a given sequence.
WAP to check if a string contains only letters.
WAP to print all prime numbers less than N using recursion.
WAP to check if an array can be rearranged to form a palindrome.
WAP to find the sum of prime numbers in an array.
WAP to generate a sequence of triangular numbers.
WAP to find the largest number that can be formed from a given set of digits.
WAP to generate a random password of a given length with alphanumeric characters.
WAP to check if a number is a Circular Prime.
WAP to find the largest palindrome in a string.
WAP to find the number of trailing zeros in the binary representation of a factorial.
WAP to count the number of set bits in a number.
WAP to count the number of prime numbers in an array.
WAP to print a butterfly number pattern.
WAP to implement an algorithm to find the longest palindromic substring in a string.
WAP to check if two strings are anagrams of each other.
WAP to convert a given number to Roman numeral.
WAP to find the sum of the squares of the first N natural numbers.
WAP to build a Weather App
WAP to simulate a banking system with basic functionalities.
WAP to implement a currency conversion program.
WAP to check if a given string is a valid palindrome with spaces ignored.
WAP to print the first N numbers in the Lucas sequence.
WAP to calculate the sum of the first N non-negative integers.
WAP to build a Tic-Tac-Toe Game
WAP to reverse words in a sentence while keeping their order intact.
WAP to print a pyramid of stars with each row starting from 1 up to N.
WAP to find the nth Fibonacci number using dynamic programming.
WAP to implement the Sieve of Eratosthenes to generate prime numbers up to N.
WAP to check if a number is a Kaprekar number.

Page 5 of 38
 WAP to find the longest common subsequence of two strings.
WAP to find the highest number divisible by both 3 and 5.

**Project Overview:**
Design and implement a Java-based application that allows users to:
- Perform various operations related to the above-listed features.
- Ensure that the GUI is user-friendly and intuitive.
- Handle both successful and erroneous inputs gracefully.

**Functional Requirements:**
- **AWT:**
- Create input forms using AWT components such as TextField, Label, Button, Checkbox, and
Choice.
- Use ActionListener and other event handlers to process user inputs.

- **Swing:**
- Display data using JTable and JTextArea.
- Create a navigation menu using JMenuBar.
- Provide dialog boxes (JOptionPane) for alerts and messages.

- **Applet:**
- Create graphical visualizations (e.g., charts or diagrams).
- Ensure that the applet window resizes dynamically.

**Technical Requirements:**
- Use **exception handling** to manage runtime errors.
- Implement **multithreading** to manage parallel tasks (e.g., loading data while the user
interacts with the app).
- Apply **data validation** to prevent incorrect inputs.
- Ensure proper **code documentation** and **modularization**.

**Evaluation Criteria:**
- Code quality and maintainability.
- User Interface and ease of use.
- Performance and responsiveness.
- Error handling and recovery.
- Completeness of features listed above.

---

Page 6 of 38
### Group 4 – Project Problem Statement
**Project Title:** Develop a GUI-based Java project using **AWT**, **Swing**, and **Applet**
that incorporates the following features:

WAP to find the next higher number with the same set of digits.
WAP to implement an algorithm to check if two strings are anagrams of each other
without using extra space.
WAP to print an Alternating 1-0 pattern.
WAP to print all numbers from 1 to N which are divisible by both 2 and 3.
WAP to search for an element using ternary search.
WAP to implement a random number generator without using built-in functions.
WAP to find the maximum difference between any two elements in an array.
WAP to print the number of trailing zeros in the factorial of a given number.
WAP to check if a number is a Carmichael number.
WAP to implement a function to find the longest common prefix among a list of strings.
WAP to rotate an array to the right by K positions.
WAP to find the smallest prime number greater than a given number.
WAP to implement the sieve of Eratosthenes algorithm without using arrays.
WAP to check if a matrix is a symmetric matrix.
WAP to divide a number by 2 without using / operator.
WAP to implement a simple chatbot.
WAP to check if a given number is a power of 4.
WAP to find the number of digits in a given number using recursion.
WAP to count the number of 1s in the binary representation of a number.
WAP to find the kth smallest element in an array.
WAP to convert a decimal number to binary without using built-in functions.
WAP to find all prime numbers within a given range.
WAP to find the sum of the digits of the first N Fibonacci numbers.
WAP to find the median of an unsorted array.
WAP to calculate the sum of all divisors of a number.
WAP to check if a given matrix is a magic square.
WAP to find the sum of squares of the digits of a number.
WAP to find the next smallest palindrome greater than the given number.
WAP to toggle a specific bit in a number.
WAP to print the first N numbers in the Tribonacci series.
WAP to find the next palindrome number greater than the given number.
WAP to check if a string is a pangram.
WAP to find the number of inversions in an array.
WAP to check if a given number is a "Happy Number."

Page 7 of 38
 WAP to rearrange an array in an alternating positive and negative number order.
WAP to check if a number is a valid Kaprekar number.
WAP to find all the prime factors of a number.

**Project Overview:**
Design and implement a Java-based application that allows users to:
- Perform various operations related to the above-listed features.
- Ensure that the GUI is user-friendly and intuitive.
- Handle both successful and erroneous inputs gracefully.

**Functional Requirements:**
- **AWT:**
- Create input forms using AWT components such as TextField, Label, Button, Checkbox, and
Choice.
- Use ActionListener and other event handlers to process user inputs.

- **Swing:**
- Display data using JTable and JTextArea.
- Create a navigation menu using JMenuBar.
- Provide dialog boxes (JOptionPane) for alerts and messages.

- **Applet:**
- Create graphical visualizations (e.g., charts or diagrams).
- Ensure that the applet window resizes dynamically.

**Technical Requirements:**
- Use **exception handling** to manage runtime errors.
- Implement **multithreading** to manage parallel tasks (e.g., loading data while the user
interacts with the app).
- Apply **data validation** to prevent incorrect inputs.
- Ensure proper **code documentation** and **modularization**.

**Evaluation Criteria:**
- Code quality and maintainability.
- User Interface and ease of use.
- Performance and responsiveness.
- Error handling and recovery.
- Completeness of features listed above.

---

Page 8 of 38
### Group 5 – Project Problem Statement
**Project Title:** Develop a GUI-based Java project using **AWT**, **Swing**, and **Applet**
that incorporates the following features:

WAP to find the intersection of two arrays.

WAP to print a pattern of numbers in reverse triangle form.
WAP to check if a number is a Recurring Decimal number.
WAP to check if a string is a valid palindrome using a two-pointer technique.
WAP to check if a number is a sum of consecutive prime numbers.
WAP to print a Hollow Pyramid pattern.
WAP to check if a given Sudoku board is valid.
WAP to print the sum of the first N prime numbers using a loop.
WAP to check if a string contains only digits.
WAP to print a Hollow Right-Angled Triangle.
WAP to print a matrix in spiral order.
WAP to count the number of vowels and consonants in a given string.
WAP to convert a decimal number to a binary number.
WAP to find the sum of digits of a number without using a loop.
WAP to find the number of prime divisors of a number.
WAP to generate the first N Fibonacci numbers without using loops.
WAP to generate all prime factors of a given number.
WAP to generate all possible palindromic substrings from a string.
WAP to simulate a Digital Clock
WAP to check if a given string is a valid IPv4 address.
WAP to rotate a matrix by 90 degrees clockwise.
WAP to check if a number is a power of 5.
WAP to find the greatest odd divisor of a given number.
WAP to check if two strings are equal without using built-in methods.
WAP to check if a given number is a perfect square without using sqrt function.
WAP to generate a sequence of Happy numbers.
WAP to check if two strings are anagrams.
WAP to check if a string follows a given pattern.
WAP to calculate the power of a number without using the [Link] function.
WAP to calculate the nth Fibonacci number using Binet's formula.
WAP to find the second largest number in an array.
WAP to print the Fibonacci series up to N terms using a bottom-up approach.
WAP to print a Diamond Pattern using loops.
WAP for a To-Do List Application
WAP to find the maximum sum of a contiguous subarray (Kadane’s Algorithm).

Page 9 of 38
 WAP to check if a number is a Kaprekar number.

**Project Overview:**
Design and implement a Java-based application that allows users to:
- Perform various operations related to the above-listed features.
- Ensure that the GUI is user-friendly and intuitive.
- Handle both successful and erroneous inputs gracefully.

**Functional Requirements:**
- **AWT:**
- Create input forms using AWT components such as TextField, Label, Button, Checkbox, and
Choice.
- Use ActionListener and other event handlers to process user inputs.

- **Swing:**
- Display data using JTable and JTextArea.
- Create a navigation menu using JMenuBar.
- Provide dialog boxes (JOptionPane) for alerts and messages.

- **Applet:**
- Create graphical visualizations (e.g., charts or diagrams).
- Ensure that the applet window resizes dynamically.

**Technical Requirements:**
- Use **exception handling** to manage runtime errors.
- Implement **multithreading** to manage parallel tasks (e.g., loading data while the user
interacts with the app).
- Apply **data validation** to prevent incorrect inputs.
- Ensure proper **code documentation** and **modularization**.

**Evaluation Criteria:**
- Code quality and maintainability.
- User Interface and ease of use.
- Performance and responsiveness.
- Error handling and recovery.
- Completeness of features listed above.

---

Page 10 of 38
### Group 6 – Project Problem Statement
**Project Title:** Develop a GUI-based Java project using **AWT**, **Swing**, and **Applet**
that incorporates the following features:

WAP to rearrange an array such that even numbers appear before odd numbers.
WAP to implement a function to check if an array contains a pair whose sum equals a
given target number.
WAP to find the minimum difference between any two elements in an array.
WAP to check if a number is a Palindromic Prime.
WAP to find the single non-repeating element in an array of duplicates.
WAP to implement the Dijkstra’s algorithm for shortest path in a graph.
WAP to print all possible decimal sequences of length N.
WAP to print an Hourglass pattern.
WAP to find the largest subarray sum in an array of integers.
WAP to count the number of vowels and consonants in a given string.
WAP to generate a sequence of happy numbers up to N terms.
WAP to find the smallest prime number greater than a given number.
WAP to generate the first N prime numbers using the Sieve of Eratosthenes.
WAP to calculate the sum of diagonal elements of a matrix.
WAP to check if a given year is a leap year.
WAP to find the determinant of a matrix.
WAP to solve Sudoku using backtracking.
WAP to find the kth smallest element in an unsorted array.
WAP to check if a given number is a prime number using a sieve approach.
WAP to generate the first N numbers in the Fibonacci sequence using dynamic
programming.
WAP to multiply two numbers using bitwise operators.
WAP to count the number of pairs in an array whose sum is equal to a given number.
WAP to find the number of prime numbers in a given range.
WAP to check if a number is a Factorial Prime.
WAP to find the next number in a Fibonacci-like sequence.
WAP to implement the heap sort algorithm.
WAP to check if a number is a Harshad (Niven) number.
WAP to generate a sequence of Harshad numbers.
WAP to find the sum of digits of a number raised to the power of 8.
WAP to find the kth smallest element in an array.
WAP to check if a number is a Fibonacci prime.
WAP to find the number of prime factors of a given number.
WAP to check if a number is a Keith number.

Page 11 of 38
 WAP to find the number of primes between two given numbers using a recursive method.
WAP to implement a heap data structure.
WAP to find the factorial of a number using an iterative method.

**Project Overview:**
Design and implement a Java-based application that allows users to:
- Perform various operations related to the above-listed features.
- Ensure that the GUI is user-friendly and intuitive.
- Handle both successful and erroneous inputs gracefully.

**Functional Requirements:**
- **AWT:**
- Create input forms using AWT components such as TextField, Label, Button, Checkbox, and
Choice.
- Use ActionListener and other event handlers to process user inputs.

- **Swing:**
- Display data using JTable and JTextArea.
- Create a navigation menu using JMenuBar.
- Provide dialog boxes (JOptionPane) for alerts and messages.

- **Applet:**
- Create graphical visualizations (e.g., charts or diagrams).
- Ensure that the applet window resizes dynamically.

**Technical Requirements:**
- Use **exception handling** to manage runtime errors.
- Implement **multithreading** to manage parallel tasks (e.g., loading data while the user
interacts with the app).
- Apply **data validation** to prevent incorrect inputs.
- Ensure proper **code documentation** and **modularization**.

**Evaluation Criteria:**
- Code quality and maintainability.
- User Interface and ease of use.
- Performance and responsiveness.
- Error handling and recovery.
- Completeness of features listed above.

---

### Group 7 – Project Problem Statement

**Project Title:** Develop a GUI-based Java project using **AWT**, **Swing**, and **Applet**

Page 12 of 38
that incorporates the following features:

WAP to print all Armstrong numbers between 1 and N.

WAP to implement the insertion sort algorithm.
WAP to multiply two matrices.
WAP to find the nth prime number.
WAP to check if a number is a perfect square using recursion.
WAP to calculate the sum of squares of prime numbers up to N.
WAP to implement a simple event scheduler using an array.
WAP to find the HCF (GCD) of two numbers without using recursion.
WAP to find the longest substring of a string with unique characters.
WAP to generate Fibonacci series using recursion.
WAP to check if two arrays are equal without using built-in functions.
WAP to convert binary to decimal manually.
WAP to find the longest increasing subsequence in an array.
WAP to find the next higher number that has the same digits as the given number.
WAP to check if a number is a perfect square without using square root functions.
WAP to generate a random strong password of length N.
WAP to remove vowels from a given string.
WAP to find if a given number is a factorion (equal to the sum of factorial of its digits).
WAP to reverse bits of a given number.
WAP to find all the non-repeating digits in a number.
WAP to check if a number is a perfect power (a number that can be expressed as
WAP to check if a number is a square number using bitwise operators.
WAP to print a half pyramid pattern of stars.
WAP to implement a simple binary search algorithm.
WAP to check if a number is an Armstrong number of any order.
WAP to find the longest common subsequence (LCS) of three strings.
WAP to print all the numbers from 1 to N that are divisible by 3 or 5.
WAP to find the sum of odd digits of a number.
WAP to remove all duplicate elements from an array.
WAP to check if a number is a Trapezoidal number.
WAP to reverse a given number without using loops.
WAP to implement the Euclidean algorithm to find the greatest common divisor.
WAP to implement a simple stopwatch timer using loops.
WAP to generate a random prime number between 1 and N.
WAP to generate all possible subsets of an array of integers.
WAP to find the number of perfect numbers between two given numbers.

**Project Overview:**

Page 13 of 38
Design and implement a Java-based application that allows users to:
- Perform various operations related to the above-listed features.
- Ensure that the GUI is user-friendly and intuitive.
- Handle both successful and erroneous inputs gracefully.

**Functional Requirements:**
- **AWT:**
- Create input forms using AWT components such as TextField, Label, Button, Checkbox, and
Choice.
- Use ActionListener and other event handlers to process user inputs.

- **Swing:**
- Display data using JTable and JTextArea.
- Create a navigation menu using JMenuBar.
- Provide dialog boxes (JOptionPane) for alerts and messages.

- **Applet:**
- Create graphical visualizations (e.g., charts or diagrams).
- Ensure that the applet window resizes dynamically.

**Technical Requirements:**
- Use **exception handling** to manage runtime errors.
- Implement **multithreading** to manage parallel tasks (e.g., loading data while the user
interacts with the app).
- Apply **data validation** to prevent incorrect inputs.
- Ensure proper **code documentation** and **modularization**.

**Evaluation Criteria:**
- Code quality and maintainability.
- User Interface and ease of use.
- Performance and responsiveness.
- Error handling and recovery.
- Completeness of features listed above.

---

### Group 8 – Project Problem Statement

**Project Title:** Develop a GUI-based Java project using **AWT**, **Swing**, and **Applet**
that incorporates the following features:

Page 14 of 38
 WAP to find the maximum value of an array after performing at most one swap.
WAP to find the most frequent digit in a given number.
WAP to generate all permutations of a string.
WAP to check if a number is a Smith number.
WAP to calculate the factorial of a number using iteration and recursion, and compare
their time complexities.
WAP to check if a number is a Kaprekar number.
WAP to count the number of occurrences of a given digit in a number.
WAP to count the number of vowels and consonants in a string.
WAP to remove adjacent duplicate characters from a string.
WAP to find the longest increasing subsequence in a given array.
WAP to implement binary search without recursion.
WAP to check if an array is a permutation of numbers from 1 to N.
WAP to reverse each word in a given sentence.
WAP to find the maximum subarray sum in an array using Kadane’s algorithm.
WAP to generate a random number between two given values.
WAP to find the greatest common divisor of two numbers using recursion.
WAP to find the number of perfect squares between two numbers.
WAP to generate the first N numbers of the Pell series.
WAP to find the LCM of two numbers using the GCD method.
WAP to find the duplicate elements in an array.
WAP to implement the breadth-first search (BFS) algorithm.
WAP to print the first N numbers in the Pell sequence.
WAP to find the longest increasing subsequence in an array.
WAP to check if a number is a Duck number.
WAP to check if two strings are anagrams without using extra space.
WAP to find the sum of the digits of a number raised to any power.
WAP to find the duplicate elements in an array.
WAP to count the number of prime numbers in a given range.
WAP to check if a number is a Harshad number using recursion.
WAP to check if a number is an Armstrong number.
WAP to find the sum of all prime numbers below a given limit.
WAP to count the number of palindromic substrings in a string.
WAP to find the missing number in an array of size N-1.
WAP to check if a number is an Automorphic number.
WAP to implement binary search without recursion.
WAP to print all perfect numbers within a given range.

**Project Overview:**
Design and implement a Java-based application that allows users to:

Page 15 of 38
- Perform various operations related to the above-listed features.
- Ensure that the GUI is user-friendly and intuitive.
- Handle both successful and erroneous inputs gracefully.

**Functional Requirements:**
- **AWT:**
- Create input forms using AWT components such as TextField, Label, Button, Checkbox, and
Choice.
- Use ActionListener and other event handlers to process user inputs.

- **Swing:**
- Display data using JTable and JTextArea.
- Create a navigation menu using JMenuBar.
- Provide dialog boxes (JOptionPane) for alerts and messages.

- **Applet:**
- Create graphical visualizations (e.g., charts or diagrams).
- Ensure that the applet window resizes dynamically.

**Technical Requirements:**
- Use **exception handling** to manage runtime errors.
- Implement **multithreading** to manage parallel tasks (e.g., loading data while the user
interacts with the app).
- Apply **data validation** to prevent incorrect inputs.
- Ensure proper **code documentation** and **modularization**.

**Evaluation Criteria:**
- Code quality and maintainability.
- User Interface and ease of use.
- Performance and responsiveness.
- Error handling and recovery.
- Completeness of features listed above.

---

### Group 9 – Project Problem Statement

**Project Title:** Develop a GUI-based Java project using **AWT**, **Swing**, and **Applet**
that incorporates the following features:

WAP to solve the Cryptarithmetic Puzzle using backtracking.

Page 16 of 38
 WAP to find the sum of proper divisors of a number.
WAP to check if a given string contains only digits.
WAP to find the longest substring without repeating characters using the sliding window
technique.
WAP to check if two strings are permutations of each other.
WAP to check if a number is a Happy number.
WAP to check if a number is a Harshad number using recursion.
WAP to find the saddle point of a matrix.
WAP to check if an array is sorted.
WAP to check if a given string is a pangram.
WAP to check if a number is a strong prime number.
WAP to print an X pattern using asterisks.
WAP to find the longest word in a given sentence.
WAP to implement an algorithm for longest common subsequence (LCS) with dynamic
programming.
WAP to implement a basic Sudoku puzzle validator.
WAP to swap odd and even bits of a number.
WAP to implement a simple text-based game.
WAP to find the longest palindromic subsequence in a string.
WAP to print a pyramid of stars with each row having increasing stars from top to bottom.
WAP to check if a given string is a palindrome using recursion.
WAP to convert a given decimal number into its binary equivalent without using built-in
functions.
WAP to count the number of times a given element appears in an array.
WAP to implement a function to calculate the factorial of a number using iteration.
WAP to check if a number is a Fibonacci number using a mathematical approach.
WAP to generate all possible subsets of a given array.
WAP to find the GCD of two numbers using Euclid's algorithm.
WAP to check if a number is a Fibonacci number without using the series.
WAP to implement a dice-rolling simulator.
WAP to print a square matrix in spiral form.
WAP to check if a number is a Super Prime.
WAP to print a number triangle pattern where each row contains numbers from 1 to row
number.
WAP to find the maximum subarray sum using Kadane's algorithm.
WAP to find the sum of all even digits in a given number.
WAP to calculate the sum of the first N even numbers.
WAP to print the first N Fibonacci numbers without using recursion or loops.
WAP to find the greatest common divisor of two numbers using recursion.

Page 17 of 38
**Project Overview:**
Design and implement a Java-based application that allows users to:
- Perform various operations related to the above-listed features.
- Ensure that the GUI is user-friendly and intuitive.
- Handle both successful and erroneous inputs gracefully.

**Functional Requirements:**
- **AWT:**
- Create input forms using AWT components such as TextField, Label, Button, Checkbox, and
Choice.
- Use ActionListener and other event handlers to process user inputs.

- **Swing:**
- Display data using JTable and JTextArea.
- Create a navigation menu using JMenuBar.
- Provide dialog boxes (JOptionPane) for alerts and messages.

- **Applet:**
- Create graphical visualizations (e.g., charts or diagrams).
- Ensure that the applet window resizes dynamically.

**Technical Requirements:**
- Use **exception handling** to manage runtime errors.
- Implement **multithreading** to manage parallel tasks (e.g., loading data while the user
interacts with the app).
- Apply **data validation** to prevent incorrect inputs.
- Ensure proper **code documentation** and **modularization**.

**Evaluation Criteria:**
- Code quality and maintainability.
- User Interface and ease of use.
- Performance and responsiveness.
- Error handling and recovery.
- Completeness of features listed above.

---

### Group 10 – Project Problem Statement

**Project Title:** Develop a GUI-based Java project using **AWT**, **Swing**, and **Applet**
that incorporates the following features:

WAP to check if a string contains only digits.

WAP to implement a basic weather report generator using random values.

Page 18 of 38
 WAP to check if a number is a Keith number.
WAP to find the number of ways to reach the top of a staircase given that you can climb
either 1 or 2 steps at a time.
WAP to find the sum of cubes of first N numbers.
WAP to print an Arrowhead pattern.
WAP to check if a number is an Achilles number.
WAP to find the number of 1's in the binary representation of a number.
WAP to find the smallest missing positive integer in an array.
WAP to rearrange an array such that even numbers appear before odd numbers.
WAP to calculate the sum of the first N natural numbers without using loops.
WAP to generate a random number between two given values, inclusive.
WAP to generate the first N Catalan numbers.
WAP to find the GCD and LCM of two numbers.
WAP to implement quicksort algorithm.
WAP to find the smallest prime factor of a given number.
WAP to implement the binary search algorithm for a rotated sorted array.
WAP to find the longest substring without repeating characters.
WAP to generate all prime numbers less than a given number.
WAP to check if a number is a Lychrel number.
WAP to find the sum of the digits of a number raised to the power of 9.
WAP to generate the first N prime numbers.
WAP to find the number of digits in the Fibonacci number at position N.
WAP to check if a given IP address is valid.
WAP to find the nth Fibonacci number using dynamic programming.
WAP to check if a number is a narcissistic number.
WAP to find XOR of two numbers without using ^ operator.
WAP to calculate the sum of all proper divisors of a given number.
WAP to generate all valid parentheses combinations of N pairs.
WAP to find the number of perfect squares in the range from A to B.
WAP to calculate the sum of digits of a number recursively.
WAP to generate all possible permutations of a given string.
WAP to check if a number is a perfect number using divisors.
WAP to print the reverse of a string without using built-in functions.
WAP to check if a number is a Trimorphic number.
WAP to check if a number is a Fibonacci number using a mathematical approach.

**Project Overview:**
Design and implement a Java-based application that allows users to:
- Perform various operations related to the above-listed features.
- Ensure that the GUI is user-friendly and intuitive.

Page 19 of 38
- Handle both successful and erroneous inputs gracefully.

**Functional Requirements:**
- **AWT:**
- Create input forms using AWT components such as TextField, Label, Button, Checkbox, and
Choice.
- Use ActionListener and other event handlers to process user inputs.

- **Swing:**
- Display data using JTable and JTextArea.
- Create a navigation menu using JMenuBar.
- Provide dialog boxes (JOptionPane) for alerts and messages.

- **Applet:**
- Create graphical visualizations (e.g., charts or diagrams).
- Ensure that the applet window resizes dynamically.

**Technical Requirements:**
- Use **exception handling** to manage runtime errors.
- Implement **multithreading** to manage parallel tasks (e.g., loading data while the user
interacts with the app).
- Apply **data validation** to prevent incorrect inputs.
- Ensure proper **code documentation** and **modularization**.

**Evaluation Criteria:**
- Code quality and maintainability.
- User Interface and ease of use.
- Performance and responsiveness.
- Error handling and recovery.
- Completeness of features listed above.

---

### Group 11 – Project Problem Statement

**Project Title:** Develop a GUI-based Java project using **AWT**, **Swing**, and **Applet**
that incorporates the following features:

WAP to print the multiplication table of a given number.

WAP to print the even numbers from 1 to N without using loops.

Page 20 of 38
 WAP to swap two numbers without using a third variable.
WAP to check if a number is a Tetranacci number.
WAP to generate a magic square of size N.
WAP to print a sequence of numbers in decreasing order using recursion.
WAP to print a Hollow Square pattern with diagonals.
WAP to reverse the words in a sentence while keeping their order intact.
WAP to implement the quicksort algorithm.
WAP to find the sum of cubes of digits of a number.
WAP to generate the first N Fibonacci numbers using memoization.
WAP to print the sum of all multiples of a number up to N.
WAP to check if a number is a happy number.
WAP to print a Pascal’s Triangle.
WAP to check if a number is an Armstrong number for any number of digits.
WAP to count the occurrences of each character in a string.
WAP to convert a given number to Roman numerals.
WAP to implement a function that finds the first repeating character in a string.
WAP to find the longest common prefix among a set of strings.
WAP to print a pattern of alphabets in reverse order.
WAP to find the missing number in a given array of integers from 1 to N.
WAP to check if two strings are anagrams of each other.
WAP to check if a number is an Armstrong number of any order.
WAP to find the average of the first N prime numbers.
WAP to implement a function that generates the next greater number with the same digits.
WAP to find the first missing positive number in an array of integers.
WAP to reverse a string without using any built-in methods.
WAP to find the product of the digits of a number raised to the power of 5.
WAP to print the first N even Fibonacci numbers.
WAP to check if a string is a valid palindrome without using built-in functions.
WAP to implement a number guessing game with a limited number of guesses.
WAP to print the first N Fibonacci numbers using matrix exponentiation.
WAP to calculate the product of digits of a number raised to any power.
WAP to check if a number is a pronic number (product of two consecutive integers).
WAP to check if a number is a twin prime.
WAP to print the first N Fibonacci numbers using a recursive function.

**Project Overview:**
Design and implement a Java-based application that allows users to:
- Perform various operations related to the above-listed features.
- Ensure that the GUI is user-friendly and intuitive.
- Handle both successful and erroneous inputs gracefully.

Page 21 of 38
**Functional Requirements:**
- **AWT:**
- Create input forms using AWT components such as TextField, Label, Button, Checkbox, and
Choice.
- Use ActionListener and other event handlers to process user inputs.

- **Swing:**
- Display data using JTable and JTextArea.
- Create a navigation menu using JMenuBar.
- Provide dialog boxes (JOptionPane) for alerts and messages.

- **Applet:**
- Create graphical visualizations (e.g., charts or diagrams).
- Ensure that the applet window resizes dynamically.

**Technical Requirements:**
- Use **exception handling** to manage runtime errors.
- Implement **multithreading** to manage parallel tasks (e.g., loading data while the user
interacts with the app).
- Apply **data validation** to prevent incorrect inputs.
- Ensure proper **code documentation** and **modularization**.

**Evaluation Criteria:**
- Code quality and maintainability.
- User Interface and ease of use.
- Performance and responsiveness.
- Error handling and recovery.
- Completeness of features listed above.

---

### Group 12 – Project Problem Statement

**Project Title:** Develop a GUI-based Java project using **AWT**, **Swing**, and **Applet**
that incorporates the following features:

WAP to implement a number guessing game.

WAP to print all unique combinations of elements from an array.
WAP to find the smallest prime factor of a number greater than 1.

Page 22 of 38
 WAP to find the number of set bits (1s) in the binary representation of a number.
WAP to check if a number is a Duck number.
WAP to calculate the product of digits of a number recursively.
WAP to print all Armstrong numbers between 1 and N.
WAP for a Calculator with GUI
WAP to check if a number is a divisor of another number without using modulo operator.
WAP to check if a number is a Square-Free number.
WAP to calculate the sum of digits of a number raised to the power of 2.
WAP to check if a number is a Tech number.
WAP to check if a given number is a perfect cube.
WAP to find the first non-repeating character in a string.
WAP to find the day of the week for a given date.
WAP to find the sum of digits of a number using recursion.
WAP to check if a number is a Spy number.
WAP to print the sum of all elements in a 2D matrix.
WAP to find the sum of the digits of a number raised to the power of 5.
WAP to check if a number is a Fibonacci number using the square root method.
WAP to count the number of vowels and consonants in a string.
WAP to reverse a string using recursion.
WAP to check if a given string is an anagram of a palindrome.
WAP to generate all permutations of numbers in an array.
WAP to check if a number is a digit in the Fibonacci sequence.
WAP to generate the next higher number with the same set of digits.
WAP to find the maximum product of two integers in an array.
WAP to implement the Collatz conjecture.
WAP to count the number of words in a string.
WAP to count the frequency of each word in a string.
WAP to calculate the sum of cubes of digits of a given number.
WAP to implement a function to remove all spaces from a string.
WAP to implement the merge sort algorithm for linked lists.
WAP to check if a number is divisible by 7.
WAP to print a Hollow Diamond pattern.
WAP to check if a string is a palindrome without using built-in functions.

**Project Overview:**
Design and implement a Java-based application that allows users to:
- Perform various operations related to the above-listed features.
- Ensure that the GUI is user-friendly and intuitive.
- Handle both successful and erroneous inputs gracefully.

Page 23 of 38
**Functional Requirements:**
- **AWT:**
- Create input forms using AWT components such as TextField, Label, Button, Checkbox, and
Choice.
- Use ActionListener and other event handlers to process user inputs.

- **Swing:**
- Display data using JTable and JTextArea.
- Create a navigation menu using JMenuBar.
- Provide dialog boxes (JOptionPane) for alerts and messages.

- **Applet:**
- Create graphical visualizations (e.g., charts or diagrams).
- Ensure that the applet window resizes dynamically.

**Technical Requirements:**
- Use **exception handling** to manage runtime errors.
- Implement **multithreading** to manage parallel tasks (e.g., loading data while the user
interacts with the app).
- Apply **data validation** to prevent incorrect inputs.
- Ensure proper **code documentation** and **modularization**.

**Evaluation Criteria:**
- Code quality and maintainability.
- User Interface and ease of use.
- Performance and responsiveness.
- Error handling and recovery.
- Completeness of features listed above.

---

### Group 13 – Project Problem Statement

**Project Title:** Develop a GUI-based Java project using **AWT**, **Swing**, and **Applet**
that incorporates the following features:

WAP to check if a number is a Sophie Germain prime.

WAP to check if two numbers are co-prime.
WAP to implement a simple hash table.
WAP to implement basic text encryption by shifting characters.

Page 24 of 38
 WAP to find the reverse of a string without using built-in methods.
WAP to find if a number is a "Duck number" (starts with zero but isn't zero itself).
WAP to check if a number is a Harshad number.
WAP to generate random numbers within a range without using built-in functions.
WAP to generate a unique random coupon code.
WAP to find the sum of the digits of a number raised to the power of 6.
WAP to find the sum of divisors of a number using a recursive approach.
WAP to check if a number is a Spy number.
WAP to check if the sum of digits of a number is a prime number.
WAP to check if a number is odd or even using bitwise operators.
WAP to calculate the sum of the digits of the nth Fibonacci number.
WAP to transpose a matrix.
WAP to generate a sequence of Triangular numbers.
WAP to generate all prime numbers up to N.
WAP to generate the first N Fibonacci numbers using dynamic programming.
WAP to implement merge sort algorithm.
WAP to find all ways to partition a given number into a sum of integers.
WAP to find the next smaller number with the same set of digits.
WAP to rotate an array by a given number of steps.
WAP to find the longest substring without repeating characters in a string.
WAP to generate Random Passwords
WAP to print a triangle pattern of stars.
WAP to find the smallest number divisible by both 3 and 7.
WAP to check if a given number is a special number (sum of factorials of digits equals the
number).
WAP to generate all prime numbers less than N using a recursive approach.
WAP to find the union of two arrays.
WAP to find the sum of all perfect squares below a given number.
WAP to remove all spaces from a string.
WAP to find the greatest common divisor of two numbers using a recursive function.
WAP to find the nth triangular number using a formula.
WAP to implement a selection sort algorithm.
WAP to find the digital root of a number.

**Project Overview:**
Design and implement a Java-based application that allows users to:
- Perform various operations related to the above-listed features.
- Ensure that the GUI is user-friendly and intuitive.
- Handle both successful and erroneous inputs gracefully.

Page 25 of 38
**Functional Requirements:**
- **AWT:**
- Create input forms using AWT components such as TextField, Label, Button, Checkbox, and
Choice.
- Use ActionListener and other event handlers to process user inputs.

- **Swing:**
- Display data using JTable and JTextArea.
- Create a navigation menu using JMenuBar.
- Provide dialog boxes (JOptionPane) for alerts and messages.

- **Applet:**
- Create graphical visualizations (e.g., charts or diagrams).
- Ensure that the applet window resizes dynamically.

**Technical Requirements:**
- Use **exception handling** to manage runtime errors.
- Implement **multithreading** to manage parallel tasks (e.g., loading data while the user
interacts with the app).
- Apply **data validation** to prevent incorrect inputs.
- Ensure proper **code documentation** and **modularization**.

**Evaluation Criteria:**
- Code quality and maintainability.
- User Interface and ease of use.
- Performance and responsiveness.
- Error handling and recovery.
- Completeness of features listed above.

---

### Group 14 – Project Problem Statement

**Project Title:** Develop a GUI-based Java project using **AWT**, **Swing**, and **Applet**
that incorporates the following features:

WAP to check if a given sequence of numbers is a valid mountain array.

WAP to check if a number is a perfect number.
WAP to find the next number in a Fibonacci-like sequence.
WAP to check if a string is a valid number (integer or decimal).

Page 26 of 38
 WAP to find the maximum product of two numbers in an array.
WAP to find the largest odd factor of a given number.
WAP to check if a given number is a power of 4.
WAP to find the sum of squares of even digits in a number.
WAP to print a pattern of numbers in a pyramid shape.
WAP to check if a number is an Evil number.
WAP to find the frequency of each element in an array.
WAP to implement a recursive function to reverse a string.
WAP to print a pattern of Fibonacci numbers.
WAP to implement Run-Length Encoding for string compression.
WAP to implement a countdown timer from a given time.
WAP to implement the depth-first search (DFS) algorithm.
WAP to generate all possible binary numbers of length N.
WAP to check if a number is a palindrome in both binary and decimal forms.
WAP to find the nth number in the Pell sequence.
WAP to find the number of digits in a given number.
WAP to check if a number is a Fibonacci prime.
WAP to implement the Tower of Hanoi puzzle recursively.
WAP to check if a number is a power of 2.
WAP to find the common elements in two arrays.
WAP to implement a function to reverse the words in a sentence without changing the
order of the words.
WAP to find the lexicographically smallest permutation of a string.
WAP to count the number of distinct substrings of a given string.
WAP to check if a given year is a leap year without using built-in methods.
WAP to find the maximum and minimum elements in an array.
WAP to check if a given string is a valid anagram of a palindrome.
WAP to print the first N numbers in a Collatz sequence.
WAP to check if a number is a Disarium number.
WAP to check if a number is a palindrome using a string-based approach.
WAP to find all permutations of a given string.
WAP to find the XOR of all elements in an array.
WAP to implement a program to count the number of set bits in an integer.

**Project Overview:**
Design and implement a Java-based application that allows users to:
- Perform various operations related to the above-listed features.
- Ensure that the GUI is user-friendly and intuitive.
- Handle both successful and erroneous inputs gracefully.

Page 27 of 38
**Functional Requirements:**
- **AWT:**
- Create input forms using AWT components such as TextField, Label, Button, Checkbox, and
Choice.
- Use ActionListener and other event handlers to process user inputs.

- **Swing:**
- Display data using JTable and JTextArea.
- Create a navigation menu using JMenuBar.
- Provide dialog boxes (JOptionPane) for alerts and messages.

- **Applet:**
- Create graphical visualizations (e.g., charts or diagrams).
- Ensure that the applet window resizes dynamically.

**Technical Requirements:**
- Use **exception handling** to manage runtime errors.
- Implement **multithreading** to manage parallel tasks (e.g., loading data while the user
interacts with the app).
- Apply **data validation** to prevent incorrect inputs.
- Ensure proper **code documentation** and **modularization**.

**Evaluation Criteria:**
- Code quality and maintainability.
- User Interface and ease of use.
- Performance and responsiveness.
- Error handling and recovery.
- Completeness of features listed above.

---

### Group 15 – Project Problem Statement

**Project Title:** Develop a GUI-based Java project using **AWT**, **Swing**, and **Applet**
that incorporates the following features:

WAP to find the longest word in a given sentence.

WAP to generate all possible letter combinations of a phone number.
WAP to print a number in words (up to 999).
WAP to implement a spiral traversal of a matrix.

Page 28 of 38
 WAP to find the most frequent element in an array.
WAP to implement a simple calculator using switch-case.
WAP to find the largest power of 2 less than a given number.
WAP to generate the first N numbers in the Lucas series.
WAP to check if a number is a Krishnamurthy number (sum of the factorials of the digits
equals the number).
WAP to generate all substrings of a given string.
WAP to find the sum of all digits at even places in a given number.
WAP to print the nth Fibonacci number using an iterative approach.
WAP to check if a number is an automorphic number.
WAP to implement a number guess game where the program picks a random number.
WAP to find all unique triplets in an array that sum to zero.
WAP to generate a sequence of abundant numbers.
WAP to find the sum of digits until a single digit is obtained.
WAP to swap the first and last character of a string.
WAP to implement a basic banking system with deposit, withdraw, and balance check.
WAP to generate a sequence of lucky numbers.
WAP to check if a number is a Semi-Prime number.
WAP to convert Roman Numerals to Integer and Vice Versa
WAP to find the nth Fibonacci number using recursion with memoization.
WAP to find the missing number in a given array of consecutive integers.
WAP to print a pattern of Pascal’s Triangle.
WAP to implement a function to convert a string into a character array and reverse it.
WAP to check if a number is divisible by 9 without using the modulo operator.
WAP to find the border elements of a matrix.
WAP to print the Fibonacci series using a while loop.
WAP for a Simple Alarm Clock
WAP to implement breadth-first search (BFS) algorithm.
WAP to find the determinant of a 2x2 matrix.
WAP to check if a number is a Pronic number.
WAP to check if a number is a palindrome using recursion.
WAP to generate all valid IP addresses from a given string.
WAP to check if an array is a subset of another array.

**Project Overview:**
Design and implement a Java-based application that allows users to:
- Perform various operations related to the above-listed features.
- Ensure that the GUI is user-friendly and intuitive.
- Handle both successful and erroneous inputs gracefully.

Page 29 of 38
**Functional Requirements:**
- **AWT:**
- Create input forms using AWT components such as TextField, Label, Button, Checkbox, and
Choice.
- Use ActionListener and other event handlers to process user inputs.

- **Swing:**
- Display data using JTable and JTextArea.
- Create a navigation menu using JMenuBar.
- Provide dialog boxes (JOptionPane) for alerts and messages.

- **Applet:**
- Create graphical visualizations (e.g., charts or diagrams).
- Ensure that the applet window resizes dynamically.

**Technical Requirements:**
- Use **exception handling** to manage runtime errors.
- Implement **multithreading** to manage parallel tasks (e.g., loading data while the user
interacts with the app).
- Apply **data validation** to prevent incorrect inputs.
- Ensure proper **code documentation** and **modularization**.

**Evaluation Criteria:**
- Code quality and maintainability.
- User Interface and ease of use.
- Performance and responsiveness.
- Error handling and recovery.
- Completeness of features listed above.

---

### Group 16 – Project Problem Statement

**Project Title:** Develop a GUI-based Java project using **AWT**, **Swing**, and **Applet**
that incorporates the following features:

WAP to multiply two matrices without using nested loops.

WAP to find the sum of digits of a number raised to any power.
WAP to check if a number is a strong prime number.
WAP to find the next smallest prime greater than a given number.
WAP to find the Nth Fibonacci number using recursion.
WAP to print Floyd’s Triangle.

Page 30 of 38
 WAP to find the minimum element in a rotated sorted array.
WAP to check if a number is an Odious number.
WAP to find the sum of two binary numbers.
WAP to calculate the sum of all elements in a given 2D matrix.
WAP to find the median of two sorted arrays.
WAP to find the sum of all diagonal elements of a matrix.
WAP to implement a basic vending machine simulation.
WAP to check if a number is a perfect number.
WAP to print a pattern of numbers in reverse order in a triangle shape.
WAP to find the sum of the digits of a number raised to the power of 3.
WAP to remove all duplicate characters from a string.
WAP to find the sum of even-position digits in a given number.
WAP to check if a matrix is diagonally dominant.
WAP to find the factorial of a large number using an array.
WAP to print a pattern of numbers in a diamond shape.
WAP to find the intersection of two arrays.
WAP to find the position of the first set bit in a number.
WAP to find the maximum product subarray in an integer array.
WAP to reverse an array without using additional memory.
WAP to convert an uppercase letter to lowercase using bitwise operations.
WAP to find the smallest prime factor of a number.
WAP to generate all valid parentheses combinations for given N pairs.
WAP to multiply a number by 7 using bitwise operations.
WAP to print a triangular number pattern using recursion.
WAP to find the sum of digits of a number raised to the power of 4.
WAP to check if a given string is a valid palindrome, ignoring spaces and punctuation.
WAP to transpose a given matrix.
WAP to calculate the power of a number using recursion.
WAP to generate all possible expressions from a given string of digits.
WAP to reverse the digits of a number using recursion.

**Project Overview:**
Design and implement a Java-based application that allows users to:
- Perform various operations related to the above-listed features.
- Ensure that the GUI is user-friendly and intuitive.
- Handle both successful and erroneous inputs gracefully.

**Functional Requirements:**
- **AWT:**
- Create input forms using AWT components such as TextField, Label, Button, Checkbox, and

Page 31 of 38
Choice.
- Use ActionListener and other event handlers to process user inputs.

- **Swing:**
- Display data using JTable and JTextArea.
- Create a navigation menu using JMenuBar.
- Provide dialog boxes (JOptionPane) for alerts and messages.

- **Applet:**
- Create graphical visualizations (e.g., charts or diagrams).
- Ensure that the applet window resizes dynamically.

**Technical Requirements:**
- Use **exception handling** to manage runtime errors.
- Implement **multithreading** to manage parallel tasks (e.g., loading data while the user
interacts with the app).
- Apply **data validation** to prevent incorrect inputs.
- Ensure proper **code documentation** and **modularization**.

**Evaluation Criteria:**
- Code quality and maintainability.
- User Interface and ease of use.
- Performance and responsiveness.
- Error handling and recovery.
- Completeness of features listed above.

---

### Group 17 – Project Problem Statement

**Project Title:** Develop a GUI-based Java project using **AWT**, **Swing**, and **Applet**
that incorporates the following features:

WAP to find all numbers between two given numbers that are divisible by the sum of their
digits.
WAP to find the second smallest number in an array.
WAP to check if a given number is a strong number (sum of factorials of digits equals the
number).
WAP to check if a matrix is symmetric.
WAP to generate all subsets of a given set.

Page 32 of 38
 WAP to check if a given string is a valid email address.
WAP to find if a number is a pentagonal number.
WAP to count the number of distinct characters in a string.
WAP to calculate the sum of the first N odd Fibonacci numbers.
WAP to find the longest common prefix of an array of strings.
WAP to check if a matrix is an upper triangular matrix.
WAP to find the first perfect number greater than a given number.
WAP to check if a given number is a Lychrel number.
WAP to find the missing number in an arithmetic progression sequence.
WAP to find the second largest element in an array.
WAP to remove all duplicate characters from a given string.
WAP to reverse an array without using any extra array or built-in functions.
WAP to reverse the digits of a number without converting it into a string.
WAP to check if a given number is a perfect cube using recursion.
WAP to find the square root of a number using binary search.
WAP to implement a basic linked list data structure.
WAP to generate a random password with at least one uppercase, lowercase, digit, and
special character.
WAP to find the row with the maximum sum in a matrix.
WAP to find the minimum number of coins needed for a given amount.
WAP to find the sum of the diagonal elements of a 2D matrix.
WAP to extract all numeric values from a given string.
WAP to find the largest prime number smaller than a given number.
WAP to find all palindromic partitions of a string.
WAP to convert Units (Length, Temperature, etc.)
WAP to print a Pyramid of Prime Numbers.
WAP to check if a number is an Automorphic number.
WAP to check if a number is divisible by 6 without using modulo operator.
WAP to find all the factors of a number.
WAP to find the longest increasing subsequence in an array using binary search.
WAP to print the Pascal's triangle up to N rows.
WAP to print a number pattern using nested loops.

**Project Overview:**
Design and implement a Java-based application that allows users to:
- Perform various operations related to the above-listed features.
- Ensure that the GUI is user-friendly and intuitive.
- Handle both successful and erroneous inputs gracefully.

**Functional Requirements:**

Page 33 of 38
- **AWT:**
- Create input forms using AWT components such as TextField, Label, Button, Checkbox, and
Choice.
- Use ActionListener and other event handlers to process user inputs.

- **Swing:**
- Display data using JTable and JTextArea.
- Create a navigation menu using JMenuBar.
- Provide dialog boxes (JOptionPane) for alerts and messages.

- **Applet:**
- Create graphical visualizations (e.g., charts or diagrams).
- Ensure that the applet window resizes dynamically.

**Technical Requirements:**
- Use **exception handling** to manage runtime errors.
- Implement **multithreading** to manage parallel tasks (e.g., loading data while the user
interacts with the app).
- Apply **data validation** to prevent incorrect inputs.
- Ensure proper **code documentation** and **modularization**.

**Evaluation Criteria:**
- Code quality and maintainability.
- User Interface and ease of use.
- Performance and responsiveness.
- Error handling and recovery.
- Completeness of features listed above.

---

### Group 18 – Project Problem Statement

**Project Title:** Develop a GUI-based Java project using **AWT**, **Swing**, and **Applet**
that incorporates the following features:

WAP to find the second largest element in an array.

WAP to solve the N-Queens problem.
WAP to build a Stopwatch
WAP to implement the bubble sort algorithm.
WAP to convert a binary number to a decimal number.
WAP to calculate the sum of squares of odd numbers between 1 and N.
WAP to implement matrix exponentiation.
WAP to check if two strings are rotations of each other.

Page 34 of 38
 WAP to implement the binary search tree operations (insert, delete, search).
WAP to check if two strings are anagrams of each other using sorting.
WAP to find the smallest number that is evenly divisible by all numbers from 1 to N.
WAP to find the smallest prime factor of a given number.
WAP to calculate the average of an array of numbers.
WAP to find the nth triangular number.
WAP to check if a given number is a narcissistic number.
WAP to find the first non-repeating character in a string.
WAP to calculate the sum of the first N Catalan numbers.
WAP to print a pattern of numbers with each row having one more number than the
previous.
WAP to implement a function to count the frequency of each element in an array.
WAP to find the highest common factor of three numbers using recursion.
WAP to find the row with the maximum number of 1s in a binary matrix.
WAP to implement a recursive binary search algorithm.
WAP to check if a number is a valid number for a credit card using Luhn’s algorithm.
WAP to print a Fibonacci series using memoization.
WAP to generate all possible words from a given set of characters.
WAP to check if a number is a pseudoprime.
WAP to find the longest contiguous subarray with sum K.
WAP to find the factorial of a large number using an array.
WAP to count the frequency of each element in an array.
WAP to find the sum of digits of a number raised to a power N.
WAP to print a Zig-Zag pattern of numbers.
WAP to implement a basic ATM system with login, withdrawal, and deposit features.
WAP to implement a basic temperature converter between Celsius, Fahrenheit, and
Kelvin.
WAP to find the sum of all divisors of a given number.
WAP to find the number of times a given digit occurs in a number.
WAP to find the number of vowels and consonants in a string using recursion.

**Project Overview:**
Design and implement a Java-based application that allows users to:
- Perform various operations related to the above-listed features.
- Ensure that the GUI is user-friendly and intuitive.
- Handle both successful and erroneous inputs gracefully.

**Functional Requirements:**
- **AWT:**
- Create input forms using AWT components such as TextField, Label, Button, Checkbox, and
Choice.

Page 35 of 38
 - Use ActionListener and other event handlers to process user inputs.

- **Swing:**
- Display data using JTable and JTextArea.
- Create a navigation menu using JMenuBar.
- Provide dialog boxes (JOptionPane) for alerts and messages.

- **Applet:**
- Create graphical visualizations (e.g., charts or diagrams).
- Ensure that the applet window resizes dynamically.

**Technical Requirements:**
- Use **exception handling** to manage runtime errors.
- Implement **multithreading** to manage parallel tasks (e.g., loading data while the user
interacts with the app).
- Apply **data validation** to prevent incorrect inputs.
- Ensure proper **code documentation** and **modularization**.

**Evaluation Criteria:**
- Code quality and maintainability.
- User Interface and ease of use.
- Performance and responsiveness.
- Error handling and recovery.
- Completeness of features listed above.

---

### Group 19 – Project Problem Statement

**Project Title:** Develop a GUI-based Java project using **AWT**, **Swing**, and **Applet**
that incorporates the following features:

WAP to check if a string contains all the letters of the alphabet.

WAP to create a simple currency converter.
WAP to count the number of bits set to 1 in a binary representation of a number.
WAP to print a Butterfly pattern.
WAP to print the border elements of a given matrix.
WAP to find the longest increasing subsequence in a given string.
WAP to find all the subsets of a given string.
WAP to check if a number is a palindrome without converting it to a string.
WAP to convert a string to title case.

Page 36 of 38
 WAP to find the factorial of a number using recursion.
WAP to check if a string is a rotation of another string.
WAP to print the prime factors of a number.
WAP to implement an exponential search algorithm.
WAP to calculate the sum of cubes of the first N natural numbers.
WAP to check if a given sentence is a valid IPv4 address.
WAP to check if a given array is sorted in non-decreasing order.
WAP to convert Decimal to Binary with GUI
WAP to find the sum of all prime numbers up to N.
WAP to find the highest prime number less than or equal to N.
WAP to find the largest square number less than a given number.
WAP to find the sum of squares of odd numbers in a given range.
WAP to find the largest number formed from a given set of digits.
WAP to capitalize the first letter of each word in a string.
WAP to print the first N prime numbers using a non-looping approach.
WAP to check if a number is divisible by 4.
WAP to check if a given number is a Super Prime.
WAP to check if a given matrix is an identity matrix.
WAP to find the number of trailing zeros in the factorial of a number.
WAP to find the number of perfect numbers less than N.
WAP to swap two numbers without using a third variable.
WAP to check if a number is a Fibonacci number.
WAP to check if a number is a Strong number.
WAP to check if a number is divisible by both 3 and 5.
WAP to find the sum of digits at odd positions in a given number.
WAP to check if a number is a semi-prime (product of two primes).
WAP to implement a simple tic-tac-toe game for two players.

**Project Overview:**
Design and implement a Java-based application that allows users to:
- Perform various operations related to the above-listed features.
- Ensure that the GUI is user-friendly and intuitive.
- Handle both successful and erroneous inputs gracefully.

**Functional Requirements:**
- **AWT:**
- Create input forms using AWT components such as TextField, Label, Button, Checkbox, and
Choice.
- Use ActionListener and other event handlers to process user inputs.

- **Swing:**

Page 37 of 38
 - Display data using JTable and JTextArea.
- Create a navigation menu using JMenuBar.
- Provide dialog boxes (JOptionPane) for alerts and messages.

- **Applet:**
- Create graphical visualizations (e.g., charts or diagrams).
- Ensure that the applet window resizes dynamically.

**Technical Requirements:**
- Use **exception handling** to manage runtime errors.
- Implement **multithreading** to manage parallel tasks (e.g., loading data while the user
interacts with the app).
- Apply **data validation** to prevent incorrect inputs.
- Ensure proper **code documentation** and **modularization**.

**Evaluation Criteria:**
- Code quality and maintainability.
- User Interface and ease of use.
- Performance and responsiveness.
- Error handling and recovery.
- Completeness of features listed above.

---

Page 38 of 38