Lecture Data Structures & Algorithms: Chapter 0 - Introduction presented what is Data Structures and other content. Invite you to read the lecture. | Data Structures & Algorithms 1 Introduction 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. 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. 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 Basic Data Structures Structures include Condensed lists Linked lists Stack, Queue Binary trees and others What is Algorithm? A computable set of steps to achieve a desired result Relationship to Data Structure Example: Find an element, Sort list . | Data Structures & Algorithms 1 Introduction 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. 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. 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 Basic Data Structures Structures include Condensed lists Linked lists Stack, Queue Binary trees and others What is Algorithm? A computable set of steps to achieve a desired result Relationship to Data Structure Example: Find an element, Sort list . | Data Structures & Algorithms 1 Introduction 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. 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. 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 Basic Data Structures Structures include Condensed lists Linked lists Stack, Queue Binary trees and others What is Algorithm? A computable set of steps to achieve a desired result Relationship to Data Structure Example: Find an element, Sort list END | Data Structures & Algorithms 1 Introduction 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. 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. 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 Basic Data Structures Structures include Condensed lists Linked lists Stack, Queue Binary trees and others What is Algorithm? A computable set of steps to achieve a desired result Relationship to Data Structure Example: Find an element, Sort list END
