INTRODUCTION TO DATA STRUCTURES AND ALGORITHMS Presented by: Bharatam Gyanam
U C D T O I R O T N N I 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.
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. 1. Input- The algorithm should receive 0 or more inputs from outside sources. 2. Output- At least one output should be obtained.
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.
NON-PRIMITIVE DATA STRUCTURES The List of Non-Primitive Data Structures are stated below: 1. Linked List 2. Tree 3. Graph 4. Stack
CONTACT US www.bharatamgyanam.com contact@bharatamgyanam.com
LINK TO BLOG