Overview of Data Structure and Algorithm

DSA LESSON 1

Data Structure and Algorithm

Branch of Computer Science that deals with creating machine-efficient and optimized computer programs.

Data Structure

Storage and organization of data.

Algorithm

Step-by-step procedure to solve a problem.

Stack Data Structure Example

Like a pile of plates; elements accessed in a LIFO manner.

Queue Data Structure Example

Like boarding a bus; follows FIFO principle.

Graph Data Structure Example

Used in social media and maps; nodes represent users and edges represent connections.

Sorting Algorithm

Algorithm used to arrange items systematically.

Shortest Path Finding Algorithm

Algorithm to find the shortest route in a mapping application.

Linear Data Structure

Elements arranged in one dimension; examples include lists, stacks, queues.

Non-Linear Data Structure

Elements arranged in arranged in one-many, many-one, and many-many dimensions; examples include trees, graphs, tables.

Array

Collection of data items stored at contiguous memory locations.

Linked Lists

Elements linked using pointers; not stored at contiguous locations.

Hashing Data Structure

Uses a hash function to map values with particular key for faster access.

Abstract Data Types (ADT)

A type (or class) whose behavior is defined by values and operations, providing an implementation-independent view.

List ADT

Stores data in a key sequence with nodes containing pointers and a count of elements.

Stack ADT

Stores pointers to data; follows LIFO principle.

Queue ADT

Abstract data type that follows the basic design of the stack.

Abstraction, Better Conceptualization, and Robust

Features of ADT