[go: up one dir, main page]
Scribd
Upload
8 views1 page

Data Structures & Algorithms Guide

The document provides an overview of Data Structures (DS) and Algorithms, defining DS as a method to store and organize data, and algorithms as step-by-step instructions for problem-solving. It categorizes data structures into linear (e.g., arrays, linked lists, stacks, queues) and non-linear (e.g., trees, graphs), and outlines types of algorithms such as sorting, searching, and graph algorithms. Additionally, it defines an array as a container for storing multiple values in a single entity.

Uploaded by

zadaammahamut
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
8 views1 page

Data Structures & Algorithms Guide

The document provides an overview of Data Structures (DS) and Algorithms, defining DS as a method to store and organize data, and algorithms as step-by-step instructions for problem-solving. It categorizes data structures into linear (e.g., arrays, linked lists, stacks, queues) and non-linear (e.g., trees, graphs), and outlines types of algorithms such as sorting, searching, and graph algorithms. Additionally, it defines an array as a container for storing multiple values in a single entity.

Uploaded by

zadaammahamut
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 1

Data Structure & Algorithm

1. Data Structures (DS)?


A way to Store and Organize data in a computer
2. Algorithm
A step-by-step set of operations or instructions designed to solve a particular problem or
perform a specific task.
3. Types of DS
 Linear Data Structures:
 Arrays: Collection of elements stored in contiguous memory.
 Linked Lists: Elements connected by pointers.
 Stacks: LIFO structure (Last In, First Out).
 Queues: FIFO structure (First In, First Out).
 Non-Linear Data Structures
 Trees: A hierarchical structure with a root and nodes.
 Graphs: Set of vertices connected by edges.
4. Types of Algorithms
 Sorting Algorithms: Used to arrange elements in a particular order (e.g., Quick
Sort, Merge Sort, Bubble Sort).
 Searching Algorithms: Used to find an element in a data structure (e.g., Binary
Search, Linear Search).
 Graph Algorithms: Used to traverse and analyse graphs (e.g., Depth First Search
(DFS), Breadth First Search (BFS)).
5. Define Array
Is a Container used to Store Multiple Value in a single
6.

You might also like