Java and Data Structure

Java is a Programming Language Developed By James Gosling . It is included in Bsc-it in 2 Parts -Sem4 and Sem5. In Sem4 the java that are covered include Core Java ,File I/O and Data Structure Concepts like Stacks,Queue,Linked Lists , Hash table,Trees,Graphs,Sorting and Searching Algorithms .

Notes Download : 

All Notes -Here 

Reference Books :
1. An introduction to data structures with applications, second edition, Jean-Paul Tremblay, P Sorenson, Tata- McGrawhill
2. Data Structures with Java, 2nd edition, J Hubbard, Tata-McGrawhill

Java Programs For Bscit :

1 Implement the following
a. Design a java program for type casting different types of variables.
b. Design a Calculator class in java, and implement all the methods required by calculator
operations.
c. Design a java class for method overloading and method overriding.

2 Implement the following
a. Design a java program for different types of inheritance.
b. Design a java class for the use of interface.
c. Design a java class performing string operations.

3 Implement the following
a. Design a class in java to add two complex numbers using constructors.
b. Design a java class for performing all the matrix operations i.e addition, multiplication,
transpose etc.
c. Design a java class for implementing the packages.

4 Implement the following
a. Design a java class for implementing the concept of threading and multithreading.
b. Design a java class for performing all the file-operations.
c. Design a java class for operating the random access files using

5 Implement the following
a. Design a class for sorting the names or numbers in ascending and descending order.
b. Design a java class for implementing the operations of stack.

6. Implement the following
a. Design a class in java for implementing the operations of queue.( insert, delete, display,
exit)
b. Design a class in java for implementing the operations of circular queue.

7. Implement the following
a. Design a class to implement the operations of singly link-list. ( insertion , deletion, sorting, display)
b. Design a class to implement the operations of doubly-linked list.

8. Implement the following
a. Implement the concept of hashing technique and also show its collision avoidance.
b. Design a class to create a tree and also implement the binary search tree.

9. Show the implementation
a. Design a class in java for creating the heap and also show heap sort for it.
b. Design a class in java for implementing selection and insertion sort.

10. Show the implementation for the following
a. Design a class in java for bubble and merge sort.
b. Design a class in java for implementing the graph 

 

For Any Programming Queries and Help Mail us at bscit.cracked999@gmail.com