Lecture data structures algorithms chapter 0
Bạn đang xem bản rút gọn của tài liệu. Xem và tải ngay bản đầy đủ của tài liệu tại đây (392.1 KB, 9 trang )
DONG NAI UNIVERSITY OF TECHNOLOGY
Data Structures
&
Algorithms
DONG NAI UNIVERSITY OF TECHNOLOGY
Introduction
DONG NAI UNIVERSITY OF TECHNOLOGY
• What is Data Structures?
– A data structure is defined by
• (1) the logical arrangement of data elements, combined with
• (2) the set of operations we need to access the elements.
DONG NAI UNIVERSITY OF TECHNOLOGY
Atomic Variables
•
•
Atomic variables can only store one value at a time.
int nSum;
float fMark;
A value stored in an atomic variable cannot be subdivided.
DONG NAI UNIVERSITY OF TECHNOLOGY
•
Example: Library
– is composed of elements (books)
– Accessing a particular book requires
knowledge of the arrangement of the
books
– Users access books only through the
librarian
DONG NAI UNIVERSITY OF TECHNOLOGY
Basic Data Structures
•
Structures include
Condensed lists
Linked lists
Stack, Queue
Binary trees
…and others
–
–
–
–
–
DONG NAI UNIVERSITY OF TECHNOLOGY
What is Algorithm?
– A computable set of steps to achieve a desired result
– Relationship to Data Structure
• Example: Find an element, Sort list
DONG NAI UNIVERSITY OF TECHNOLOGY
DONG NAI UNIVERSITY OF TECHNOLOGY
END
