Data Structures and Algorithms Introduction. Introduction Prerequisites Basic Computer Programming Language Discreet Mathematics.

Presentasi berjudul: "Data Structures and Algorithms Introduction. Introduction Prerequisites Basic Computer Programming Language Discreet Mathematics."— Transcript presentasi:

1 Data Structures and Algorithms Introduction

2 Introduction Prerequisites Basic Computer Programming Language Discreet Mathematics

3 Introduction Objective Students can arrange ADT specification as linked-list, stack, queue, tree, & graph Students can choose and arrange effective data structure then implement ADT in programming language Students can use ADT to solve programming problems Students can work in team

4 Introduction The Syllabi Data Abstraction Link List –List with Array –Double Link List –Circular List Stacks –Stack with Array –Stack with List Queues –Queue with Array –Queue with List Algorithms –Sorting –Searching Trees –Binary Tree –Binary Search Trees –Balanced Trees Graph –Depth First –Breadth First –Minimum Spanning Tree –Shortest Path

5 Introduction References Data Structure Using C aron M. Tanembaum, Yediyah Langsam, and Moshe J. Augenstain Prentice Hall The Art of Computer programming Vol 1 & 3 Donald E. Knut Addison Wesley

6 Introduction Class Contract Schedule –Thursday 7:30 – 9.10 –Time tolerance 15 minutes, late 5 minutes Assignment –Assistance –Final Project Grading –Assignment: 40 % –Mid Test: 20 % –Final Test: 40 %