INTRODUCTION TO DATA STRUCTURE USING C

 INTRODUCTION TO DATA STRUCTURE

data structure

It is a way of storing and organizing the data into the memory so that it can be accessed efficiently. In simple language, Data Structures are structures programmed to store ordered data, so that various operations can be performed on it easily. It represents the knowledge of data to be organized in memory. It should be designed and implemented in such a way that it reduces the complexity and increases efficiency.

Abstract Data Type(ADT) 

It is a mathematical /logical model that is used to specify the data and operations that can be performed on data.

ADT = DATA + OPERATIONS (only for understanding purpose)

Types of data structure 

Linear Data Structure: A Linear data structure has data elements arranged sequentially and each member element is connected to its previous and next element. Such data structures are easy to implement as computer memory is also sequential. Examples of linear data structures are List, Queue, Stack, Array, etc.

Non-linear Data Structure: A non-linear data structure has no set sequence of connecting all its elements and each element can have multiple paths to connect to other elements. Such data structures support multi-level storage and often cannot be traversed in a single run. Examples of the non-linear data structure are graphs, trees, etc.


types of data structure

Basic topics using c

Variable:
A variable is a name given to the memory location where data is stored. Arrays:
collection of elements of similar data type which are always stored consecutively. Index:
indexing is used to access the elements of an array. An index is a positive integer value that always starts from zero. The name of an identifier should be valid and logical. Structure:
collection of elements of dissimilar data types.

Function:
It's divided into 2 categories: Library functions and User-defined
functions.
Set/Block of statements which is written the complete the
specific task.
Properties of function:
1. Name of a function
2. Argument list
3. Return type
4. Body of the function

the syntax for function def:
ret_type fun_name(arg_list)
{
 function body
}


Note: before starting with data structure you should have knowledge of programming like c,c++, python, etc








Comments

Post a Comment

Popular posts from this blog

LINEAR DATA STRUCTURE : STACK

Image
 What is a stack? A stack is a linear data structure in which the addition and deletion of data are done from the same end. This end is often referred to as the top of a stack. Last-In-First-Out (LIFO) structure. STACK ADT: DATA: It is a finite sequence of elements of a particular type. (arrays / linked list) OPERATIONS: 1. Initialize a stack. 2. check whether the stack is empty. 3. check whether the stack is full. 4. Insert at the top of stack if a stack is not full. This operation is called Push. 5. Delete a element from the top of stack if it is not empty. This operation is called Pop. 6. Retrieve an element from the top of stack. This operation is called Peek. STACK OPERATION Implementation of Stack: 1. Using Array 2. Using Linked List. Message Passing Methods in C: 1. Pass by Value / Call by Value. 2. Pass by Address / Call by Address. Implementation of a stack using arrays #include<stdio.h>   //pre-processor directive #include<unistd.h> #define MAX 5 str...
Read more