Presentation on Data Structure

1. ATOMIC REACTOR 1.0

2. Members of Atomic Reactor
1. A. N. M. JUBAER--162-15-7850
2. TANVIR HOSSEN BAPPY--162-15-7706
3. MD. SHAHBUDDIN EMON--162-15-7789
4. MD. IMRUL HASAN ASHIK--162-15-7723
5. ABDULLAH-AL-AZMI—162-15-7959

3. BASICS OF DATA STRUCTURE IN C

4. Data structures are used to store data in a computer in an
organized form. Any data structure is designed to
organize data to suit a specific purpose so that it can be
accessed and worked with in appropriate ways. In C language
Different types of data structures are; Array, Stack, Queue,
Linked List, Tree.

5. ARRAY
An Array is a collection of similar data type value in a single
variable. An array is a derived data type in C, which is
constructed from fundamental data type of C language.

6. • A one-dimensional array is like a list; A two
dimensional array is like a table.
• Some texts refer to one-dimensional arrays
as vectors, two-dimensional arrays as matrices.

8. STACK
Stack is linear data structure. In stack addition of new data
item and deletion of already existing data item is done from
only one end, known as top. Working of stack on the basis
of Last-in-First-out (LIFO) principal, it means last entered
item remove first.

9. Stack Operation
 In stack data structure mainly perform two operation; push and pop
 pop: In case of stack deletion of any item from stack is called pop.
 push: In case of stack Insertion of any item in stack is called push.

10. QUEUE
Queue is work on the principal of First-In-First-Out (FIFO), it
means first entered item remove first. Queue have two end
front and rear, from front you can insert element and from
rear you can delete element.

11. A common example of queue is movie theater ticket counter,
there first person who stand in front of ticket window take
ticket first and remove from line and new person always stand
in line from end.

12. LINKED LIST
Linked list is a special type of data structure where all data
elements are linked to one another. Linked list is the
collection of nodes and every nodes contains two parts data
part and address part.

13. ADVANTAGES OF LINKED LIST
 Linked List is Dynamic data Structure.
 You can change size of Linked List during program run time.
 Insertion and Deletion Operations are Easier, you can insert any node
at any place and also delete any node easily..
 No memory wastage , I.e no need to pre-allocate memory
 Faster Access time , can be expanded in constant time without
memory overhead
 You can easily implement Linear Data Structures such as Stack , Queue
using Linked list

14. TREE
A tree is a (possibly non-linear) data structure made up of
nodes or vertices and edges without having any cycle. The
tree with no nodes is called the null or empty tree. A tree that
is not empty consists of a root node and potentially many
levels of additional nodes that form a hierarchy.

15. A tree has following general properties:
 One node is distinguished as a root;
 Every node (exclude a root) is connected by a directed
edge from exactly one other node; A direction is: parent -> children

16. END OF SLIDES
THANK YOU ALL.