Data Structures   Data Structures – Introduction
Course Description●    The course covers concepts, algorithms and    applications of data structures: stacks, queues,    t...
Course Requirements●    Course Prerequisite     ●         Introduction to Programming 2●    Programming Tools (for the ass...
Course Outline●    Basic Concepts and Notations    –   Problem Solving Process    –   Properties of an Algorithm    –   Ad...
Course Outline●    Stacks    –   Sequential Allocation    –   Linked Representation    –   Application: Infix to Postfix F...
Course Outline●    Queues    –   Sequential Representation    –   Linked Representation    –   Circular Queues    –   Appl...
Course Outline●    Binary Trees    –   Definitions and Related Concepts    –   Types of Binary Trees    –   Binary Tree Tr...
Course Outline●    Trees    –   Definitions and Related Concepts    –   Algorithms for Tree Operations    –   Natural Corr...
Course Outline●    Graphs    –   Definition and Related Concepts    –   Representation of Graphs    –   Graph Traversals: ...
Course Outline●    Lists     –   Definitions and Related Concepts     –   Representation of Lists     –   Singly Linked Li...
Course Outline●    Tables    –   Definitions and Related Concepts    –   Searching and Sequential Tables●    Binary Search...
Course Outline●    Hash Table and Hashing Techniques    –   Definitions and Related Concepts    –   Simple Hashing Techniq...
Upcoming SlideShare
Loading in …5
×

MELJUN CORTES Jedi slides data st-chapter00-introduction

630 views

Published on

MELJUN CORTES Jedi slides data st-chapter00-introduction

0 Comments
1 Like
Statistics
Notes
  • Be the first to comment

No Downloads
Views
Total views
630
On SlideShare
0
From Embeds
0
Number of Embeds
4
Actions
Shares
0
Downloads
22
Comments
0
Likes
1
Embeds 0
No embeds

No notes for slide

MELJUN CORTES Jedi slides data st-chapter00-introduction

  1. 1. Data Structures Data Structures – Introduction
  2. 2. Course Description● The course covers concepts, algorithms and applications of data structures: stacks, queues, trees, graphs, lists, tables and heaps, binary search trees and hash tables.● Duration ● 16 weeks (3 hours/week)● Methodology ● In-class lectures and take-home programming exercises Data Structures – Introduction
  3. 3. Course Requirements● Course Prerequisite ● Introduction to Programming 2● Programming Tools (for the assignments) ● Java 2 Platform Standard Edition Development Kit 5.0 Update 1 or higher (JDK 5.0, version 1.5.0_01 or higher) ● NetBeans IDE 5.5 runs on the J2SE JDK 5.0 (JavaTM 2 JDK, Standard Edition) ● consists of the Java Runtime Environment plus developers tools for compiling, debugging, and running applications written in the JavaTM language Data Structures – Introduction
  4. 4. Course Outline● Basic Concepts and Notations – Problem Solving Process – Properties of an Algorithm – Addressing Methods – Mathematical Functions – Complexity of Algorithms Data Structures – Introduction
  5. 5. Course Outline● Stacks – Sequential Allocation – Linked Representation – Application: Infix to Postfix Form● Advanced Topic on Stacks – Multiple Stacks using One-Dimensional Array – Memory Reallocation Strategy for Multiple Stacks using Garwicks Algorithm Data Structures – Introduction
  6. 6. Course Outline● Queues – Sequential Representation – Linked Representation – Circular Queues – Application: Topological Sorting Data Structures – Introduction
  7. 7. Course Outline● Binary Trees – Definitions and Related Concepts – Types of Binary Trees – Binary Tree Traversals – Application of Binary Tree Traversals – Heap and the Heapsort Algorithm Data Structures – Introduction
  8. 8. Course Outline● Trees – Definitions and Related Concepts – Algorithms for Tree Operations – Natural Correspondence: Binary Tree Representation of Trees – Forest Traversal – Sequential Representation of Forests – Arithmetic Tree Representations – Applications: Trees and the Equivalence Problem Data Structures – Introduction
  9. 9. Course Outline● Graphs – Definition and Related Concepts – Representation of Graphs – Graph Traversals: DFS And BFS – Minimum Cost Spanning Trees: Prim’s and Kruskal’s Algorithms – Shortest Path Problems: Dijkstra’s and Floyd’s Algorithms Data Structures – Introduction
  10. 10. Course Outline● Lists – Definitions and Related Concepts – Representation of Lists – Singly Linked Lists – Circular Lists – Doubly-Linked Lists● Advanced Topics on Lists – Application: Polynomial Arithmetic – Dynamic Storage Allocation(Sequential-Fit and Buddy System) Data Structures – Introduction
  11. 11. Course Outline● Tables – Definitions and Related Concepts – Searching and Sequential Tables● Binary Search Trees – Binary Search Trees – AVL Trees Data Structures – Introduction
  12. 12. Course Outline● Hash Table and Hashing Techniques – Definitions and Related Concepts – Simple Hashing Technique: Prime Number Division Method – Dynamic Hashing Data Structures – Introduction

×