DDC 2423 DATA STRUCTURE Main text: Gilberg & Farouzan; Data Structure : A Pseudocode Approach with C++, Thomson, ISBN 0-534-95216-x

LEARNING OUTCOMES By the end of the course, students should be able to: Describe the essential concepts and theories of data structures. Apply abstract data types and write algorithms for linear list data structure and non-linear list data structures. Describe and use common sorting and searching methods as well as recursion. Design and build applications in linear list data structure including linked list, stack and queue using C++ language. Present or show the group project works.

CHAPTER 1: Introduction to Basic Concepts CHAPTER 2: List and Linked List CHAPTER 3: Stack CHAPTER 4: Queue CHAPTER 5: Recursion CHAPTER 6: Trees CHAPTER 7: Searching CHAPTER 8: Graph CHAPTER 9: Sorting

Introduction to Basic Concepts CHAPTER 1 Introduction to Basic Concepts

Pseudocode, Algorithm Header, Algorithm Analysis An English-like representation of the code required for an algorithm. Part English and part structured code. ALGORITHM HEADER Describes the parameter and lists any pre- and postconditions. IMPORTANT! Because often the programmer using the algorithms sees only the header information, not the complete algorithm. The header information must be complete enough.

Pseudocode, Algorithm Header, Algorithm Analysis Purpose, Conditions, and Return Purpose - A short statement about what the algorithm does. - Need to only describe the general algorithm processing, and should not attempt to describe all of the processing. Conditions - Two types: Precondition and Postcondition - Precondition: lists any precursor requirements for the parameters. - Postcondition: identifies any action taken and the status of any output parameters. Return - If there is any value to be returned. - Often there is none and no return condition is needed.

Pseudocode, Algorithm Header, Algorithm Analysis The analysis examines only those points that need to be emphasized or that may require some clarification. Programming statement constructs consists of sequence, selection, and loop. Sequence: a series that do not alter the execution path within an algorithm. Example statements such as assign, and add. Selection: evaluate one or more alternatives. If the alternatives are true, one path is taken. If the alternatives are false, a different path is taken. Example, if and else statements. Loop: iterates a block of code. Example, while loop.

The Abstract Data Types (ADT) History of programming concepts Spaghetti Code Modular Programming Object-oriented Programming

Atomic and Composite Data, Data Type Atomic Data Data that we choose to consider as a single, nondecomposable entity. Atomic Data Type: a set of atomic data having identical properties. It is defined by a set of values and a set of operations that act on the values. Composite Data The opposite of Atomic Data. Can be broken out into subfields that have meaning.

Atomic and Composite Data, Data Type Data Structure An aggregation of atomic and composite data type into a set with defined relationships. Structure: a set of rules that hold the data together. Data structures that at least can be used to support a list are an array, a linked list, or a file. Abstract Data Type (ADT) A data declaration packaged together with the operations that are meaningful on the data type. The used for all programmers. Consists of a set of definitions that allow programmers to use the functions while hiding the implementation.