Skip to main content

Introduction to Data Structures and Algorithms

Page 1

INTRODUCTION TO DATA STRUCTURES and Algorithms KNOW MORE

@bharatamgyanam


INTRODUCTION TO DATA SRTUCTURE The data structure is a method of collecting and organizing data so that we can perform operations on it effectively. Data Structure is the process of rendering data elements in terms of some relationship in order to improve organization and storage. For example, we have some information about a programmer named "Happy" who is 23 years old. In this case, "Happy" is of the String data type, and 23 is of the integer data type. If you're familiar with Object-Oriented programming concepts, you'll recognize that a class does the same thing: it collects various types of data under a single entity. The only difference is that data structures and algorithms provide techniques for efficiently accessing and manipulating data.

BHARATAM GYANAM | PAGE 2


WHAT IS AN ALGORITHM? An algorithm is a finite set of instructions or logic written to perform a specific predefined task. The core logic (solution) of a problem, which can be expressed either as an informal high-level description as pseudocode or using a flowchart, is expressed as an algorithm. Every Algorithm must have the following characteristics: 1. Input- The algorithm should receive 0 or more inputs from outside sources. 2. Output- At least one output should be obtained. 3. Definiteness- Each step of the algorithm should be well-defined and clear. 4. Finite- The algorithm should have a finite number of steps. 5. Correctness- Each step of the algorithm must produce a valid result.

BHARATAM GYANAM | PAGE 3


As previously stated, anything that can store data is referred to as a data structure; thus, they are classifieds into 2 major categories: 1. Primitive Data Structures 2. Non-Primitive Data Structures

TYPES OF DATA STRUCTURES Primitive Data Structures Integers, floats, Booleans, Chars, and so on are all data structures. They are referred to as Primitive Data Structures. 1. Integers 2. Floats 3. Booleans 4. Chars, etc BHARATAM GYANAM | PAGE 4


LAST WORDS Non-Primitive Data Structures The List of Non-Primitive Data Structures are stated below: 1. Linked List 2. Tree 3. Graph 4. Stack 5. Queue

CONTACT US www.bharatamgyanam.com contact@bharatamgyanam.com

LINK TO BLOG

BHARATAM GYANAM | PAGE 5


Turn static files into dynamic content formats.

Create a flipbook
Introduction to Data Structures and Algorithms by Bharatam Gyanam - Issuu