Introduction to Data Structures & Algorithm

1. PROGRAMMING PRINCIPLE

1.1. 7 Key Issues in Programming

1.1.1. 1. Modularity 2. Style 3. Modifiability 4. Ease of Use 5. Fail-safe programming 6. Debugging 7. Testing

2. PROGRAMMING PARADIGM

2.1. System Requirement Process

2.1.1. 1. System Requirements• 2. Analysis 3. Design 4. Coding 5. System Testing 6. Maintenance

3. DATA STRUCTURE

3.1. Data Structure: a way of storing data in a computer so that it can be used efficiently

3.2. Operations to the Data Structure: 1.Traversing- access and process every data in data structure at least once 2. Searching – search for a location of data 3. Insertion – insert item in the list of data 4. Deletion - delete item from a set of data 5. Sorting – sort data in certain order 6. Merging – merge multiple group of data

3.3. Structured Data Types

3.3.1. Linked Data Structure

3.3.1.1. Linear Data Structure with restriction

3.3.1.1.1. Stack

3.3.1.1.2. Queue

3.3.1.2. Linear Data Structure with no restriction

3.3.1.2.1. consists of a sequence of nodes, each containing arbitrary data fields and one or two references ("links") pointing to the next and/or previous nodes

3.3.1.3. Non-linear Data Structure

3.3.1.3.1. Binary Tree

3.3.1.3.2. Graph

4. ALGORITHM

4.1. 1. A step-by-step method to performing a task within a fixed period of time 2. Often operate on a collection of data, which is stored in a structured way in the computer memory (Data Structure) 3. Problem solving using logic

4.1.1. Sequential

4.1.2. Selection

4.1.3. Repetition (Looping)