Professional Documents
Culture Documents
EHB208E
1
Grading
Grading Method
Two Midterm Exams: %50
One Homework: %10
Final Exam: %40
2
Bad programmers worry about the code.
Good programmers worry about data
structures and their relationships.”
• Example: library
– is composed of elements
(books)
– Accessing a particular book
requires knowledge of the
arrangement of the books
What will we study?
6
From Data to Information
RAW DATA= 0100 0010 0100 0001 0100 0010 0100 0001
CHAR DATA TYPE (ASCII) = 0100 0010 0100 0001 0100 0010 0100 0001
B A B A
Data = Information
Structure = Organization
Fixed Size
Stacks
One End For Addition And The Other End For Removal
Of Data
Linked List
No Fixed Size
Tree
Consists Of :
• Root Node
• Parent Child Relationship
• Leaf Nodes
Graph
Consists Of:
• Edges
• Vertices
Also known as
Adjacency Matrix
Which Data Structure Is Right For You?