AjjaraniCodes_DataStructure

Practice Implementation Project from Ajith Ajjarani for DataStructure & Algorithms, with Best Practices for Java Based Projects

Following, Sample Codes are available

1. DATA

1. 8 Primitive Types of Data : { bool, int, float, long, double, char, short, Byte}

2. Extended Types of Data : {Integer, String, Abstract/Complex}

2. Data, is always stored in DataStructure

Eg : DataStructure -

1. Lists : Duplication of data allowed.
   • Static List : Arrays
   • Dynamic List : LinkedList (Single Linked & Double Linked)
2. Set : Duplication of data NOT allowed
   • HashSet
3. Stacks
4. Queues
5. Maps
   • Hash Maps : Key-Value pair
6. Heaps
7. Tables
8. Matrix
9. Trees
10. Graphs
11. Bags
12. Buffers
13. CSV File

3. CRUD, operations are always done over data

1. CREATE data in Datastructure
2. READ data from Datastructure
3. UPDATE data in Datastructure
4. DELETE data in Datastructure

Above operations are achieved using PUSH & POP Operations

4. Once Data is stored in DataStructure or CRUD is done, Following operations are necessary to effectively utilize data

1. Sorting

   • Ascending
   • Descending
   • Increasing/Decreasing Order

2. Searching

   • Locating the data at certain position in DataStructure

5. Sorting Algorithms

1. Bubble Sort
2. Insertion Sort
3. Merge Sort
4. Quick Sort
5. Selection Sort
6. Bogo Sort
7. CockTailShaker Sort
8. gnome Sort
9. Heap Sort
10. Radix Sort
11. Shell Sort
12. Bucket Sort

6. Search Algorithms

1. Binary Search
2. Linear Search

7. Once, Data is Sorted & Searched - Any Use Case can be done on Data

8. Dynamic Algorithms

1. Fibonacci Series

9. Data TypeCast/Conversion Algorithms

1. Decimal To Binary
2. Decimal To Octal

10. Encyrption/Decryption/Cipher Algorithms