DSA_1_UIU

Hey, folks!

This repository will be immensely helpful if you are taking a Data Structure and Algorithm-I course or practicing DSA-1 topics. This brief article is here to help you become familiar with its contents.

How This Repository Can Help You

• Quick Reference: The repository can serve as a quick reference guide. You can easily find relevant code for DSA topics, saving time on online resource searches.
• You will know which problems I solved before any of my exams; this will help you get an idea about the exam.
• You are getting more understandable code.
• Coding Practice: You can use the code for coding practice. You can modify and experiment with the code to reinforce your understanding of DSA topics.
• Transition to C++: It will help you transition from C to C++; this code can be an excellent resource to help you get up to speed with the language.

Table of Contents

First of all, you have seen 3 folders.

• Class(LAB)

  It is not necessary for you. [Contains some lab codes]

• DSA_LAB_EXAM_Question_Solve

  • AnotherSecAssignment 1
  • CT_1
  • CT_2_SEC_C
  • CT_2_Section_A
  • MID_SEC_B
  • MID_SEC_C
  • MID_SEC_E_Spring_23
  • Online_3_Summer23_Sec_E
  • Summer23_Final_
  • Summer23_LAB_assignment_2_TREE_GRAPH_BFS_DFS
  • AnotherSecAssignment 2

Hopefully, you can determine the contents of the next folder from its name.

• DSA_TOPICS

  • Application
    • Evaluation_of_Postfix_Expression__.cpp
    • Infix_To_postfix.cpp
  • BinarySearch
  • BubbleSort
  • Counting Sort
  • Disjoint_Set
  • Graph
    • BFS
    • DFS
    • Learned
    • Problems -Backtracking__Rat_in_a_Maze.cpp -Lecture40_RatinaMazeProblem.cpp
    • ShortestPath_using_BFS.cpp
  • Heap
  • Heap_Sort.cpp
  • Heapify_Finction_topToBottom_and_bottomToTop.cpp
  • Max_Heapify_Simulation_TopToBottom_approach.cpp
  • Min-heap.cpp - Insertion Sort - LinearSearch - LinkedList
  • Circular_Linked_List
  • Double_Linked_List
  • Problems
  • Single_Linked_list - MergeSort - Offline_DSA1_SEC_E_Summer23 - Queues
  • Circular_Queue_Using_Array.cpp
  • Problems - QuickSort - Recursion_TOH
  • Tower_of_hanoi.cpp - SelectionSort

• Stack

  • Problems
    • Implement_Stack_using_Queues_.cpp
    • Reverse_a_stack_using_recursion__.cpp
    • Two_Stack_using_One_array.cpp
    • stack_link_list_and_palindrome.cpp

• Topological_Sort

  • Using_BFS_kahnsAlgo_.cpp
  • Using_DFS_.cpp

• Tree

  • Binary_Search_Tree_(BST)
    • Conduct_Tree
      • Conduct_BST_from_preOrder.cpp
      • Conduct_Tree_from_Inorder_and_Preorder.cpp
    • Deletion_in_BST.cpp
    • Find_Minimum_and_Maximum_value.cpp
    • Predecessor.cpp
    • Search_in_BST.cpp
    • Successor_.cpp
    • Transplant_in_BST.cpp
  • Build_Tree.cpp
  • Build_tree_from_levelOrder.cpp
  • Noman
    • Insert.cpp
    • delete.cpp
  • Problems
    • Count_All_Nodes.cpp
    • Count_Leaf_Nodes.cpp
    • Depth_of_a_tree_.cpp
    • Diameter_Of_a_tree.cpp
    • Height_of_a_tree.cpp
    • Sum_of_Nodes.cpp
  • Traversal
    • In_Order_traversal_.cpp
    • Level_Order_traversal_.cpp
    • Post_Order_Traversal.cpp
    • Pre_Order_Traversal_.cpp

Used Shortcuts

If you are reading my code for the first time maybe you will find some unknown little shortcuts (Predefined), I use in my every code, so to get similar with it you just need to see the below codes. It's very simple, you can also use these tricks on your code to write code faster. All codes are written in C++. Don't worry if you don't know this language if you know C Programming that will be enough for you to understand every topic.

• sometimes you will find these 2 lines at the beginning of my code

  //        ****************  Author:  Tashin.Parvez       *************************\
  //        ****************  Updated:    18-08-23     *************************\

    You will find every topic code with accompanying comments with it.

## Used Shortcuts
If you are reading my code for the first time maybe you will find some unknown little shortcuts (Predefined), I use in my every code, so to get similar with it you just need to see the below codes. It's very simple, you can also use these tricks on your code to write code faster. All codes are written in C++. Don't worry if you don't know this language if you know C Programming that will be enough for you to understand every topic. 

- sometimes you will find these 2 lines at the beginning of my code
```bash
  //        ****************  Author:  Tashin.Parvez       *************************\
  //        ****************  Updated:    18-08-23     *************************\

this line came when I used my code template which is saved on my device.

• The include bits/stdc++.h is a header file that we use in our code to include all the standard libraries[C++].

• CRACKED I use this instead of return 0;

  [Nothing but this my code different from others, you can say it's my signature]

• using namespace std; In C++, we use it to make our code shorter and easier to read. It lets us use standard C++ functions and objects without having to type std:: before each one. It's like a shortcut that saves us time and makes our code cleaner.

• I write null instead of writing NULL. [Why? Well, when writing code quickly, I sometimes forget to use all capital letters for "NULL" To avoid segmentation errors I use null and it's predefined.]

How to save this repository?

• In the top-right corner of the page, click Fork.

Viewing this repository on your profile

• In the top-right corner of the page, click Star.

Author

• @TashinParvez