Skip to content

kamran-nizamani/DSA

Folders and files

NameName
Last commit message
Last commit date

Latest commit

Β 

History

5 Commits
Β 
Β 
Β 
Β 
Β 
Β 
Β 
Β 

Repository files navigation

DSA.GIT

❯ Kamran Khan

Built with the tools and technologies:


πŸ“– Table of Contents
  1. πŸ“ Overview
  2. πŸ‘Ύ Features
  3. πŸ“‚ Repository Structure
  4. 🧩 Modules
  5. πŸš€ Getting Started 5.1. πŸ”– Prerequisites 5.2. πŸ“¦ Installation 5.3. πŸ€– Usage 5.4. πŸ§ͺ Tests
  6. πŸ“Œ Project Roadmap
  7. 🀝 Contributing
  8. πŸŽ— License
  9. πŸ™Œ Acknowledgments

πŸ“ Overview

❯ REPLACE-ME


πŸ‘Ύ Features

❯ REPLACE-ME


πŸ“‚ Repository Structure

└── DSA.git/
    β”œβ”€β”€ Assignment Dsa
    β”‚   β”œβ”€β”€ Assignment 2. pdf
    β”‚   └── DSA Assignemnt 1.pdf
    β”œβ”€β”€ Labs
    β”‚   β”œβ”€β”€ Lab1
    β”‚   β”‚   β”œβ”€β”€ Bounderis.java
    β”‚   β”‚   β”œβ”€β”€ Duplicatin.java
    β”‚   β”‚   β”œβ”€β”€ EvenOdd.java
    β”‚   β”‚   β”œβ”€β”€ NLArray.java
    β”‚   β”‚   β”œβ”€β”€ WordAndEmailCounter.java
    β”‚   β”‚   └── desktop.ini
    β”‚   β”œβ”€β”€ Lab2
    β”‚   β”‚   β”œβ”€β”€ LinkedListLength.java
    β”‚   β”‚   β”œβ”€β”€ LinkedListSearch.java
    β”‚   β”‚   └── desktop.ini
    β”‚   β”œβ”€β”€ lab3
    β”‚   β”‚   β”œβ”€β”€ DoubleLinkedListUSinTail.java
    β”‚   β”‚   β”œβ”€β”€ DoublyLinkedListCycleDetector.java
    β”‚   β”‚   β”œβ”€β”€ Doublylinkedlist.java
    β”‚   β”‚   └── desktop.ini
    β”‚   β”œβ”€β”€ lab4
    β”‚   β”‚   β”œβ”€β”€ ArrQueue.java
    β”‚   β”‚   β”œβ”€β”€ Queue.java
    β”‚   β”‚   β”œβ”€β”€ QueueTwoStack.java
    β”‚   β”‚   β”œβ”€β”€ Stack.java
    β”‚   β”‚   β”œβ”€β”€ StackLinked.java
    β”‚   β”‚   β”œβ”€β”€ StackQueue.java
    β”‚   β”‚   β”œβ”€β”€ Stackarr.java
    β”‚   β”‚   └── desktop.ini
    β”‚   β”œβ”€β”€ lab5
    β”‚   β”‚   β”œβ”€β”€ BalancedBrackets.java
    β”‚   β”‚   β”œβ”€β”€ FirstLetter.java
    β”‚   β”‚   β”œβ”€β”€ InfixToPostfix.java
    β”‚   β”‚   └── ReverseOder.java
    β”‚   β”œβ”€β”€ lab6
    β”‚   β”‚   β”œβ”€β”€ InsertionSort.java
    β”‚   β”‚   β”œβ”€β”€ SortingFour.java
    β”‚   β”‚   β”œβ”€β”€ Task1.java
    β”‚   β”‚   β”œβ”€β”€ TwoSum.java
    β”‚   β”‚   └── mergeSort.java
    β”‚   └── lab7
    β”‚       β”œβ”€β”€ AsscendingDes.java
    β”‚       β”œβ”€β”€ Factorial.java
    β”‚       β”œβ”€β”€ Fibonnci.java
    β”‚       β”œβ”€β”€ OneDArr.class
    β”‚       β”œβ”€β”€ OneDArr.java
    β”‚       └── PrintLinked.java
    β”œβ”€β”€ README.md
    └── partice lab task
        β”œβ”€β”€ ADFirst.class
        β”œβ”€β”€ ADFirst.java
        β”œβ”€β”€ App.java
        β”œβ”€β”€ ArrQueue$Node.class
        β”œβ”€β”€ ArrQueue.class
        β”œβ”€β”€ Arrays.java
        β”œβ”€β”€ BasicSorting.java
        β”œβ”€β”€ Double.java.java
        β”œβ”€β”€ DoubleLinkedList$Node.class
        β”œβ”€β”€ DoubleLinkedList.class
        β”œβ”€β”€ DoubleLinkedList.java
        β”œβ”€β”€ DoubleLinkedListUSinTail$Node.class
        β”œβ”€β”€ DoubleLinkedListUSinTail.class
        β”œβ”€β”€ DoublyLinkedListCycleDetector$DoublyListNode.class
        β”œβ”€β”€ DoublyLinkedListCycleDetector.class
        β”œβ”€β”€ DoublyListNode.java
        β”œβ”€β”€ Dupl.java
        β”œβ”€β”€ Duplicatin.class
        β”œβ”€β”€ EvenOdd.java
        β”œβ”€β”€ FirstSingleLetter.java
        β”œβ”€β”€ InfixToPostfix.class
        β”œβ”€β”€ Lin$Node.class
        β”œβ”€β”€ Lin.class
        β”œβ”€β”€ Lin.java
        β”œβ”€β”€ Linked.class
        β”œβ”€β”€ Linked.java
        β”œβ”€β”€ LinkedL.class
        β”œβ”€β”€ LinkedL.java
        β”œβ”€β”€ LinkedList.class
        β”œβ”€β”€ LinkedListLength$LinkedList.class
        β”œβ”€β”€ LinkedListLength$Node.class
        β”œβ”€β”€ LinkedListLength.class
        β”œβ”€β”€ LinkedListSearch$LinkedList.class
        β”œβ”€β”€ LinkedListSearch$Node.class
        β”œβ”€β”€ LinkedListSearch.class
        β”œβ”€β”€ Main.class
        β”œβ”€β”€ Main.java
        β”œβ”€β”€ NLArray.class
        β”œβ”€β”€ Node.class
        β”œβ”€β”€ Node.java
        β”œβ”€β”€ Queue$Node.class
        β”œβ”€β”€ Queue.class
        β”œβ”€β”€ Queue.java
        β”œβ”€β”€ QueueDouble.java
        β”œβ”€β”€ ReadLineExample.java
        β”œβ”€β”€ Recursive.java
        β”œβ”€β”€ Reverse.java
        β”œβ”€β”€ ReverseOder$Node.class
        β”œβ”€β”€ ReverseOder.class
        β”œβ”€β”€ ReverseOrder.java
        β”œβ”€β”€ Reversed$Node.class
        β”œβ”€β”€ Reversed.class
        β”œβ”€β”€ Reversed.java
        β”œβ”€β”€ SeparateEvenAndOdd.class
        β”œβ”€β”€ cl.txt
        β”œβ”€β”€ class QueueLink.java
        β”œβ”€β”€ example.txt
        └── lab6
            β”œβ”€β”€ Queue$Node.class
            β”œβ”€β”€ Queue.class
            β”œβ”€β”€ Queue.java
            β”œβ”€β”€ SingleL.java
            └── mergeSort.class

🧩 Modules

Labs.lab6
File Summary
TwoSum.java ❯ REPLACE-ME
InsertionSort.java ❯ REPLACE-ME
mergeSort.java ❯ REPLACE-ME
SortingFour.java ❯ REPLACE-ME
Task1.java ❯ REPLACE-ME
Labs.Lab1
File Summary
WordAndEmailCounter.java ❯ REPLACE-ME
Bounderis.java ❯ REPLACE-ME
NLArray.java ❯ REPLACE-ME
Duplicatin.java ❯ REPLACE-ME
EvenOdd.java ❯ REPLACE-ME
Labs.Lab2
File Summary
LinkedListLength.java ❯ REPLACE-ME
LinkedListSearch.java ❯ REPLACE-ME
Labs.lab4
File Summary
Stackarr.java ❯ REPLACE-ME
Queue.java ❯ REPLACE-ME
StackLinked.java ❯ REPLACE-ME
Stack.java ❯ REPLACE-ME
ArrQueue.java ❯ REPLACE-ME
StackQueue.java ❯ REPLACE-ME
QueueTwoStack.java ❯ REPLACE-ME
Labs.lab5
File Summary
FirstLetter.java ❯ REPLACE-ME
ReverseOder.java ❯ REPLACE-ME
InfixToPostfix.java ❯ REPLACE-ME
BalancedBrackets.java ❯ REPLACE-ME
Labs.lab3
File Summary
Doublylinkedlist.java ❯ REPLACE-ME
DoubleLinkedListUSinTail.java ❯ REPLACE-ME
DoublyLinkedListCycleDetector.java ❯ REPLACE-ME
Labs.lab7
File Summary
Factorial.java ❯ REPLACE-ME
OneDArr.java ❯ REPLACE-ME
PrintLinked.java ❯ REPLACE-ME
AsscendingDes.java ❯ REPLACE-ME
Fibonnci.java ❯ REPLACE-ME
Assignment Dsa
File Summary
[Assignment 2. pdf](https://github.com/kamran-nizamani/DSA.git/blob/main/Assignment Dsa/Assignment 2. pdf) ❯ REPLACE-ME
partice lab task
File Summary
[LinkedL.java](https://github.com/kamran-nizamani/DSA.git/blob/main/partice lab task/LinkedL.java) ❯ REPLACE-ME
[Arrays.java](https://github.com/kamran-nizamani/DSA.git/blob/main/partice lab task/Arrays.java) ❯ REPLACE-ME
[DoubleLinkedList.java](https://github.com/kamran-nizamani/DSA.git/blob/main/partice lab task/DoubleLinkedList.java) ❯ REPLACE-ME
[DoublyListNode.java](https://github.com/kamran-nizamani/DSA.git/blob/main/partice lab task/DoublyListNode.java) ❯ REPLACE-ME
[App.java](https://github.com/kamran-nizamani/DSA.git/blob/main/partice lab task/App.java) ❯ REPLACE-ME
[Queue.java](https://github.com/kamran-nizamani/DSA.git/blob/main/partice lab task/Queue.java) ❯ REPLACE-ME
[ReadLineExample.java](https://github.com/kamran-nizamani/DSA.git/blob/main/partice lab task/ReadLineExample.java) ❯ REPLACE-ME
[class QueueLink.java](https://github.com/kamran-nizamani/DSA.git/blob/main/partice lab task/class QueueLink.java) ❯ REPLACE-ME
[Linked.java](https://github.com/kamran-nizamani/DSA.git/blob/main/partice lab task/Linked.java) ❯ REPLACE-ME
[Dupl.java](https://github.com/kamran-nizamani/DSA.git/blob/main/partice lab task/Dupl.java) ❯ REPLACE-ME
[example.txt](https://github.com/kamran-nizamani/DSA.git/blob/main/partice lab task/example.txt) ❯ REPLACE-ME
[Main.java](https://github.com/kamran-nizamani/DSA.git/blob/main/partice lab task/Main.java) ❯ REPLACE-ME
[Double.java.java](https://github.com/kamran-nizamani/DSA.git/blob/main/partice lab task/Double.java.java) ❯ REPLACE-ME
[Lin.java](https://github.com/kamran-nizamani/DSA.git/blob/main/partice lab task/Lin.java) ❯ REPLACE-ME
[EvenOdd.java](https://github.com/kamran-nizamani/DSA.git/blob/main/partice lab task/EvenOdd.java) ❯ REPLACE-ME
[cl.txt](https://github.com/kamran-nizamani/DSA.git/blob/main/partice lab task/cl.txt) ❯ REPLACE-ME
[ADFirst.java](https://github.com/kamran-nizamani/DSA.git/blob/main/partice lab task/ADFirst.java) ❯ REPLACE-ME
[QueueDouble.java](https://github.com/kamran-nizamani/DSA.git/blob/main/partice lab task/QueueDouble.java) ❯ REPLACE-ME
[BasicSorting.java](https://github.com/kamran-nizamani/DSA.git/blob/main/partice lab task/BasicSorting.java) ❯ REPLACE-ME
[ReverseOrder.java](https://github.com/kamran-nizamani/DSA.git/blob/main/partice lab task/ReverseOrder.java) ❯ REPLACE-ME
[FirstSingleLetter.java](https://github.com/kamran-nizamani/DSA.git/blob/main/partice lab task/FirstSingleLetter.java) ❯ REPLACE-ME
[Reversed.java](https://github.com/kamran-nizamani/DSA.git/blob/main/partice lab task/Reversed.java) ❯ REPLACE-ME
[Reverse.java](https://github.com/kamran-nizamani/DSA.git/blob/main/partice lab task/Reverse.java) ❯ REPLACE-ME
[Node.java](https://github.com/kamran-nizamani/DSA.git/blob/main/partice lab task/Node.java) ❯ REPLACE-ME
[Recursive.java](https://github.com/kamran-nizamani/DSA.git/blob/main/partice lab task/Recursive.java) ❯ REPLACE-ME
partice lab task.lab6
File Summary
[SingleL.java](https://github.com/kamran-nizamani/DSA.git/blob/main/partice lab task/lab6/SingleL.java) ❯ REPLACE-ME
[Queue.java](https://github.com/kamran-nizamani/DSA.git/blob/main/partice lab task/lab6/Queue.java) ❯ REPLACE-ME

πŸš€ Getting Started

πŸ”– Prerequisites

Java: version x.y.z

πŸ“¦ Installation

Build the project from source:

  1. Clone the DSA.git repository:
❯ git clone https://github.com/kamran-nizamani/DSA.git
  1. Navigate to the project directory:
❯ cd DSA.git
  1. Install the required dependencies:
❯ mvn clean install

πŸ€– Usage

To run the project, execute the following command:

❯ java -jar target/myapp.jar

πŸ§ͺ Tests

Execute the test suite using the following command:

❯ mvn test

πŸ“Œ Project Roadmap

  • Task 1: Implement feature one.
  • Task 2: Implement feature two.
  • Task 3: Implement feature three.

🀝 Contributing

Contributions are welcome! Here are several ways you can contribute:

Contributing Guidelines
  1. Fork the Repository: Start by forking the project repository to your github account.
  2. Clone Locally: Clone the forked repository to your local machine using a git client.
    git clone https://github.com/kamran-nizamani/DSA.git
  3. Create a New Branch: Always work on a new branch, giving it a descriptive name.
    git checkout -b new-feature-x
  4. Make Your Changes: Develop and test your changes locally.
  5. Commit Your Changes: Commit with a clear message describing your updates.
    git commit -m 'Implemented new feature x.'
  6. Push to github: Push the changes to your forked repository.
    git push origin new-feature-x
  7. Submit a Pull Request: Create a PR against the original project repository. Clearly describe the changes and their motivations.
  8. Review: Once your PR is reviewed and approved, it will be merged into the main branch. Congratulations on your contribution!
Contributor Graph


πŸŽ— License

This project is protected under the SELECT-A-LICENSE License. For more details, refer to the LICENSE file.


πŸ™Œ Acknowledgments

  • List any resources, contributors, inspiration, etc. here.

About

No description, website, or topics provided.

Resources

Stars

2 stars

Watchers

1 watching

Forks

Releases

No releases published

Packages

 
 
 

Contributors

Languages