Skip to content

omnidox/Java_Data_Structures

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

4 Commits
 
 
 
 

Repository files navigation

Java Data Structures

This repository contains various Java implementations and demonstrations of data structures. The code is organized into different modules, each focusing on a specific topic or data structure.

Modules Overview:

1. CSIT_503_m1_arraybag

  • ArrayBag.java: Implementation of an array-based bag.
  • BagInterface.java: Interface for the bag data structure.
  • Item.java: Represents an item object.
  • OnlineShopper.java: Demonstrates the use of the ArrayBag.

2. CSIT_503_m2_submission

  • Palindrome_tester3.java: A program to test if a given string is a palindrome.

3. CSIT_503_module_1

  • BagInterface.java: Interface for the bag data structure.
  • Item.java: Represents an item object.
  • LinkedBag.java: Implementation of a linked bag.
  • LinkedBag1.java: Another version of the linked bag.
  • LinkedBagDemo1.java: Demonstrates the use of the LinkedBag.
  • Project1.java: Project related to the module.

4. M7_packages (TreePackage)

  • BinaryNode.java: Represents a binary node.
  • BinaryTree.java: Implementation of a binary tree.
  • BinaryTreeInterface.java: Interface for the binary tree.
  • EmptyTreeException.java: Exception for an empty tree.
  • TreeInterface.java: General tree interface.
  • TreeIteratorInterface.java: Interface for tree iterators.
  • TreeTester.java: Demonstrates the use of the tree package.

5. csit_503_M1_submission

  • BagInterface.java: Interface for the bag data structure.
  • LinkedBag.java: Implementation of a linked bag.
  • Project1.java: Project related to the module.

6. csit_503_m3_practice

  • AlgoCompare.java: Compares different algorithms.
  • MeasureTimeExampleJava.java: Measures the execution time of Java code.

7. csit_503_m3_submission

  • Module_3_loops.java: Demonstrates loops in Java.
  • Module_3_loops_v2.java: Another version of the loop demonstration.

8. m4_p1_submission

  • MergeSort.java: Implementation of the merge sort algorithm.
  • QuickSort.java: Implementation of the quick sort algorithm.
  • QuickSort2.java: Another version of the quick sort.

9. m5 submission

  • EmptyQueueException.java: Exception for an empty queue.
  • LinkedQueue.java: Implementation of a linked queue.
  • QueueInterface.java: Interface for the queue data structure.
  • RadixSort.java: Implementation of the radix sort algorithm.

10. m6_Submission

  • ArrList.java: Implementation of an array list.
  • ListClient.java: Demonstrates the use of the list implementations.
  • ListInterface.java: Interface for the list data structure.
  • VecList.java: Implementation of a vector list.

About

Assignments from data_structures course.

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published

Languages