Self-test: Data Structure Definition 1) A Dataset Structure Definition: a) Is a set of descriptor concepts, associated with a set of data
10 jui 2013 · The development of global Data Structure Definitions (DSDs) by the SDMX consortium and 2 similar efforts by individual SDMX sponsor
Good programmers worry about data structures and their relationships définition dynamique en deux temps (déclaration, allocation) : #include
particular organization of data is called a data structure The structure definition associated with keyword typedef is called Type-Defined Structure
DEFINITION: A max-heap is a binary tree structure with the following properties: • The tree is complete or nearly complete • The key value of each node is
an array to represent the stack, and then define the appropriate indexing operations to perform pushing and popping Selecting a data structure to match the
From the above definition, it is clear that the operations in data structure involve higher -level abstractions such as, adding or deleting an item from a
Hemant Jain, “Problem Solving in Data Structures and Algorithms using Python: programming The functional definition of a data structure is known as ADT
A data structure is a specialized format for organizing and storing data General data The definition of ADT only mentions what
Definition Data Structure is a representation of the logical relationship existing between individual Non-Primitive data structure :- The data structure that are
design of proper SDMX Data Structure Definitions The SDMX Statistical Working Group (SWG) was entrusted with the task of developing such guidelines and
PDF document for free
- PDF document for free
![[PDF] DATA STRUCTURE [PDF] DATA STRUCTURE](https://pdfprof.com/EN_PDFV2/Docs/PDF_3/71770_3DATASTRUCTURE.pdf.jpg)
71770_3DATASTRUCTURE.pdf
DATA STRUCTURE
Elementary Data Organization
Data:- data can be defined as a representation of facts, concepts or instructions in a formalized manner suitable for communication, interpretation or processing by human or electronic machine. Data is represented with the help of characters like alphabets(A-Z , a-z), digits(0-9) or special character(+,- ,*,&,? Etc.) . Data may be a single value or it may be a set of values, must be organized in a particular fashion.
Data Item:- A set of characters which are used
together to represent a specific data element e.g. name of a student in a class is represented by the data item NAME.
Types of data items:-
(i)Elementary data items:- these data items can not be further sub divided. For exp. SID (ii)Group data items:- These data items can be further sub-divided into elementary data items. For example Date. Date may be divided into days, months and years.
Record:- record is a collection of related data
items e.g. a payroll record for an employee contains data fields such as name, age, qualification, sex, basic pay, DA, HRA, PF etc.
Or a student record.
Name Roll no Class Marks
Anu 4999 BCA 850
File:- File is a collection of logically related
records e.g. a payroll file might consist of the employee pay records for a company.
Introduction
to
Data Structure
Definition
Data Structure is a representation of the logical relationship existing between individual elements of data. Or A Data structure is a way of organizing all data items that considers not only the elements stored but also their relationship to each other. or
A data structure is a class of data that can
characterized by its organization and the operations that are defined on it. Hence
Data Structure= Organized Data + Allowed
Operations
Data structure mainly specifies the following four things:- i) Organization of data ii) Accessing methods iii) Degree of associativity iv) Processing alternatives for information
Classification of Data Structure
Data Structure
Primitive Data
Structure
Integer Float Character Pointer
Non-Primitive
Arrays List
Linear Lists
Stacks Queues
Non-Linear
Lists
Graphs Trees
Files
Primitive Data Structure :- The data structure that are atomic or indivisible are called primitive. Example are integer, real, float, Boolean and characters. Non-Primitive data structure :- The data structure that are not atomic are called non primitive or composite. Examples are records, arrays and strings. These are more sophisticated. The non primitive data structures emphasize on structuring f a group of homogenous or heterogeneous data items.
B) Linear Data Structure :- In a linear data
structure, the data items are arranged in a linear sequence. Example is array. Non Linear data structure :- In a non-linear data structure, the data items are not in sequence. Example is tree.
C) Homogenous Data Structure :- In
homogenous data structure, all the elements are of same type. Example is array. Non Homogenous Data Structure :- in non homogenous structures, all the elements are may or may not be of the same types. Example is records. D) Static Data Structure :- Static structures are ones whose sizes and structures, associated memory location are fixed at compile time. Dynamic Data Structure :- Dynamic structures are ones which expand or shrink as required during the program execution and there associate memory location change.
Description of various
Data Structures
Create
Selection
Deletion
Updation
other Operations
Searching
Sorting
Merging
Operations on data structure
Arrays:- An array is defined as a set of finite
number of homogenous elements or data items. It means an array can contain one type of data only, either all integers, all floating point numbers or all characters.3
Exp:- int a[10]
Array declaration -
int a [10]
Data Type Variable
name
Size of
array
Concepts of array:
The individual element of an array can be accessed by specifying name of the array, followed by index or subscript inside square bracket. Exp. to access the 10th element statement will be a[9]. The first element of the array has index zero[0]. So in an array of 10 elements the first array will be a[0] and last a[9] The elements of array will always be stored in consecutive memory location.
The size of an array can be calculate by this
equation (upper bound- lower bound )+1 (9-0)+1 Arrays can always be read or written through loop. In case of one dimensional array it required one loop for reading and one loop for writing and in case of two dimensional array it requires two loops for each operation.
1.Creation of an array
2.Traversing of an array
3.Insertion of new elements
4.Deletion of required elements
5.Modification of an element
6.Merging of arrays
Operation performed on array
Lists:- A list can be defined as a collection of
variable number of data items. List are the most commonly used non-primitive data structures.
An element of list must contain at least two
fields, one for storing data or information and other for storing address of next element. Head aman riya neha
Information
Field Pointer Field
Stack :- A stack is also an ordered collection of elements like array but it has a special feature that deletion and insertion of elements can be done only from one end, called the top of the stack.
It is a non primitive data structure.
It is also called as last in first out type of data structure(LIFO).
Exp. Train, stack of trays etc.
At the time of insertion or removal of an
element base of stack remains same.
Insertion of element is called Push
Deletion of element is called Pop
1.Static implementation (using array)
2.Dynamic implementation(using pointer)
Stack implementation
Queue :- Queues are first in first out type of
data structures. In a queue new elements are added to the queue from one end called rear end and the elements are always removed from other end called the front end.
10 30 70 80 90 95 97
Front Rear
New elements are added to the queue from
one end called REAR end
Elements are always removed from other end
called front end
Exp. : queue of railway reservation.
FIFO
1.Static implementation (using array)
2.Dynamic implementation(using pointer)
Queue Implementation
Trees:- A tree can be defined as finite set of data items. Tree is non-linear type of data structure in which data items are arranged in a sorted sequence. Trees represent the hierarchical relationship between various elements.
GROW A
B C
D E F G
ROOT
SUBTREE
1.There is a special data item at the top of
hierarchy called the Root of the tree
2.The remaining data items called the subtree.
3.The tree always grows in length towards
bottom in data structure.
Graphs :- Graph is a mathematical non-linear
data structure capable of representing many kinds of physical structures. It has found applications in diverse fields like geography, chemistry and engineering sciences.
1.Directed Graph
2.Non-directed Graph
3.Connected Graph
4.Non-Connected Graph
5.Simple Graph
6.Multi Graph
Types of Graphs
Memory Allocation in C
A memory management technique determines how
memory should be allocated to the variables declared in the program. There are two technique for memory management.
1.Compile time or Static memory allocation technique.
2.Run time or Dynamic memory allocation technique.
1.Static memory allocation technique :- Using this
technique memory is reserved by the compiler for variables declared in the program.
The required amount of memory is allocated to
the program element(identifiers name which include variable name, function name, program name etc.) at the start of the program.
Memory to be allocated to the variable is
fixed and is determined by the compiler at the compile time.
Exp:- if it is a single integer variable it
allocates two bytes, array of 10 integer it allocates 20 bytes and for a float it is 4 bytes... . . . .
2. Dynamic memory allocation technique:- the
concept of dynamic or run time memory allocation helps us to overcome this problem in arrays, as well as allows us to be able to get the required chunk of memory at run-time.
Dynamic memory allocation gives flexibility for
programmer.
Efficient use of memory by allocating the
required amount of memory whenever needed.
Dynamic allocation
and De-allocation functions in C
1.malloc()
2.calloc()
3.free()
4.realloc()
malloc() Function The user should explicitly give the block size it requires for the use The malloc() function is like a request to the RAM of the system to allocate memory If the request is granted returns a pointer to the first block of that memory
Type of the pointer it returns is void, it means
we can assign it any type of pointer if malloc function fails to allocate the required amount of memory, it returns a NULL
Malloc() function is available in header
file
malloc(number of elements*size of each element) exp. Int ptr*
Ptr = malloc(10*sizeof(int));
Type cast
Int ptr*
Ptr = (int*)malloc(10*sizeof(int))
Struct student
{ int rrn; Char name[20];
Float per;
}; Struct student *st_ptr;
Memory allocation to data structure
Memory allocation
st_ptr = (struct student*) malloc (sizeof(struct student)); When this statement is executed a contiguous block of memory of size Int = 2 bytes
Char = 20 bytes
Float = 4 bytes
Total = 26 bytes
Int *ptr;
Ptr = (int *) malloc(5*sizeof(int));
If(ptr==null)
{ Printf(͞the reƋuired amount of memory is not
Data Structures Documents PDF, PPT , Doc