DSA 1

Data Structure and Algorithm (DSA)

A branch of computer science that deals with creating machine-efficient and optimized computer programs.

Data Structures

Refers to the storage and organization of data.

Algorithm

Refers to the step-by-step procedure to solve a problem.

Stack Data Structure

It is like a pile of plates placed on top of each other. Element can be accessed only after accessing the previous elements.

Queue Data Structure

A linear data structure in which the elements are arranged based on FIFO (First In, First Out) rule.

Graph Data Structure

A graph is a network of interconnected items. Each item is known as a node and the connection between them is known as the edge.

Shortest Path Finding Algorithms

Deal with finding the shortest oath in a graph. Applications such as Google Maps used this class of algorithms.

Linear Data Structure

A classification of data structure whereas, elements are arranged in one dimension.

Linear Data Structure

Data structure examples such as lists, stack, and queue.

Non-Linear Data Structure

A classification of data structure whereas, elements are arranged in one-many, many-one, and many-any directions.

Non-Linear Data Structure

Data structure examples such as tree, graph, and table.

Array

A collection of data items stored at contiguous memory locations.

Linked Lists

A linear data structure whereas, elements are not stored at a contiguous location and linked using pointers.

Hashing Data Structure

It is designed to use a special function called the Hash Function which is used to map a given value with a particular key for faster access of elements.

Abstract Data Types (ADT)

A type/class for objects whose behavior is defined by a set of values and a set of operations.

Abstraction

The process of providing only the essentials and hiding the details.

abstract

It is called ________ because it gives an implementation-independent view.

List ADT

Data is generally stored in key sequence in a list which has a head structure consisting of count, pointers, and address of compare function needed to compare data in the list

Stack ADT

A LIFO (Last In First Out) ADT that instead of data being stored in each node, the pointer to data is stored.

Queue ADT

This ADT follows basic design of the stack abstract data type.

Abstraction, Better Conceptualization, and Robust

What are the three features of ADT?