DOWNLOAD MANUAL FOR JAVA PROGRAMMIN LAB,IT2305 LAB MANUAL,IT2305 JAVA PROGRAMMING,JAVA PROGRAMMING IT2305 LAB MANUAL.
1. Develop a Java package with simple Stack and Queue classes. Use JavaDoccomments for documentation.
2. Design a class for Complex numbers in Java. In addition to methods for basicoperations on complex numbers, provide a method to return the number of activeobjects created.
3. Design a Date class similar to the one provided in the java.util package.
4. Develop with suitable hierarchy, classes for Point, Shape, Rectangle, Square, Circle,Ellipse, Triangle, Polygon, etc. Design a simple test application to demonstratedynamic polymorphism.
5. Design a Java interface for ADT Stack. Develop two different classes that implementthis interface, one using array and the other using linked-list. Provide necessaryexception handling in both the implementations.
6. Write a Java program to read a file that contains DNA sequences of arbitrary lengthone per line (note that each DNA sequence is just a String). Your program shouldsort the sequences in descending order with respect to the number of 'TATA'subsequences present. Finally write the sequences in sorted order into another file.
7. Develop a simple paint-like program that can draw basic graphical primitives indifferent dimensions and colors. Use appropriate menu and buttons.
8. Develop a scientific calculator using even-driven programming paradigm of Java.
9. Develop a template for linked-list class along with its methods in Java.
10. Design a thread-safe implementation of Queue class. Write a multi-threadedproducer-consumer application that uses this Queue class.
11. Write a multi-threaded Java program to print all numbers below 100,000 that areboth prime and fibonacci number (some examples are 2, 3, 5, 13, etc.). Design athread that generates prime numbers below 100,000 and writes them into a pipe.Design another thread that generates fibonacci numbers and writes them to anotherpipe. The main thread should read both the pipes to identify numbers common toboth.
12. Develop a multi-threaded GUI application of your choice.
1. Develop a Java package with simple Stack and Queue classes. Use JavaDoccomments for documentation.
2. Design a class for Complex numbers in Java. In addition to methods for basicoperations on complex numbers, provide a method to return the number of activeobjects created.
3. Design a Date class similar to the one provided in the java.util package.
4. Develop with suitable hierarchy, classes for Point, Shape, Rectangle, Square, Circle,Ellipse, Triangle, Polygon, etc. Design a simple test application to demonstratedynamic polymorphism.
5. Design a Java interface for ADT Stack. Develop two different classes that implementthis interface, one using array and the other using linked-list. Provide necessaryexception handling in both the implementations.
6. Write a Java program to read a file that contains DNA sequences of arbitrary lengthone per line (note that each DNA sequence is just a String). Your program shouldsort the sequences in descending order with respect to the number of 'TATA'subsequences present. Finally write the sequences in sorted order into another file.
7. Develop a simple paint-like program that can draw basic graphical primitives indifferent dimensions and colors. Use appropriate menu and buttons.
8. Develop a scientific calculator using even-driven programming paradigm of Java.
9. Develop a template for linked-list class along with its methods in Java.
10. Design a thread-safe implementation of Queue class. Write a multi-threadedproducer-consumer application that uses this Queue class.
11. Write a multi-threaded Java program to print all numbers below 100,000 that areboth prime and fibonacci number (some examples are 2, 3, 5, 13, etc.). Design athread that generates prime numbers below 100,000 and writes them into a pipe.Design another thread that generates fibonacci numbers and writes them to anotherpipe. The main thread should read both the pipes to identify numbers common toboth.
12. Develop a multi-threaded GUI application of your choice.
