Earn Certificate of completion
Average time to complete 35 days
Pre-requisites: Basics of programming in any language (CPP/Java/Python)
Data structures are used to store data, whereas algorithms are used to solve problems with that data.
Some of the most common data structures are: Arrays, Stacks, Queues, Linked Lists, Graphs and Trees (Binary Tree, Binary Search Tree, AVL Tree, Red Black Tree, B+ Tree, B- Tree).
Two main types of data structures are Linear and Non-linear Data Structures. In the former, the elements are arranged one after the other while in non-linear data structure, the elements are arranged in a hierarchical manner. One element can be related to one or more elements.
Different data structures are stored differently in the memory. Like- All the elements of an array are stored in the continuous piece of memory, while the elements of a linked list can be stored at different places.
There are various sorts of algorithms. Some important algorithms are: Sorting Algorithms, Searching Algorithms, Hashing, Dynamic Programming, String Matching and Parsing, Greedy Algorithm, Brute Force Algorithm, Recursive Algorithm, Backtracking Algorithm, Divide and Conquer Algorithm.
A data structure is a specific location that we can use to store and organize the data, while an algorithm is a step-by-step guide to solve a problem. We can write efficient and optimized computer programs with the help of data structures and algorithm.
