Introduction to Data Structures and Algorithms

1- This is for placement prep, all the topics are covered according to placement prep.
2- Prerequisite languages → C/C++.

Data structures and algorithms are two different things

Data STructures: Arrangement of data in main memory(RAM) so that they(data intems) can be used efficiently in memory.
- Examples → Arrays, linked list, stack, queue etc.
Algorithms → Sequence of steps on data using efficient data structures to solve a given problem.
- Example: Sorting an array.

Other terminology

Database → Collection of information in permanent storage(HDD,SDD) for faster retrival and updation.

Data warehousing → Management of huge amount of legacy data for better analysis.

Legacy data → which is not that relevant so can't keep it in main memory so it is stored in another place called legacy data.

Big Data → Analysis of too large or complex data which cannot be dealth with traditional data processing application.

Data structures and algorithms are nothing new. If you have done programming in any language like C you must have used Arrays → a data structure and some sequence of processing steps to solve a problem → algorithm.

Memory Layout Of C programs

When the program starts, its code is copied to the main memroy.
Stack holds the memory occupied by the functions.
Heap contains the data which is requested by the program as dynamic memory.
Initialized and uninitialized data segments hold initialized and uninitialized global variables respectively.