CS 233 Data Structures and Algorithms

1
CS 233Data Structures and Algorithms

• Fall 2004
• CSE, POSTECH

2
What The Course Is About?

• The computer program development process requires
  us to
• represent data in an effective way
• develop a suitable step-by-step procedure
  (algorithm), which can be implemented as a
  computer program
• Effective data representation ? data structures
• Development of a suitable step-by-step procedure
  ? algorithm design methods
• The study of data structures and algorithms is
  fundamental to computer science.

3
Prerequisites

• CS101 CS103
• C or C programming
• Logical and analytical thinking

4
Course Homepage

• http//hpc.postech.ac.kr/cs233
• Announcements, handouts, syllabus, assignments,
  useful links, TA info., etc.
• Two other related web sites
• http//www.cise.ufl.edu/sahni/dsaaj/
• www.cise.ufl.edu/sahni/cop3530

5
Questions?

• Questions related to lectures, concepts, data
  structures, algorithms, exams
• During the class
• Use CS 233 BBS in the course homepage
• Use the office hour
• M1100-1200, Th1430-1530
• Use e-mail jkim_at_postech.ac.kr
• Questions related to assignments, systems,
  compilers, Java programs and syntax.
• Ask the TAs

6
Organization of Text

• Three parts
• Part 1 Chapters 1-4, Background
• Part 2 Chapters 5-17, Data structures
• Part 3 Chapters 18-22, Algorithms
• Each chapter Concepts Applications

7
Evaluation

• Assignments - 15
• Programming Project - 15
• Midterm Exam - 30
• Final Exam - 35
• Class Participation - 5

8
Class Schedule 1st half

• Week 1 Overview of Java, Program performance
  (Chapters 1 2)
• Week 2 Formula-based and linked representations
  (Sections 3.1-3.4)
• Week 3 Linked, indirect addressing, and
  simulated pointer (Sections 3.4-3.7)
• Week 4 Arrays and matrices (Chapter 4)
• Week 5 Stacks (Chapter 5)
• Week 6 Queues (Chapter 6)
• Week 7 Skip lists and hashing (Chapter 7)
• Week 8 Review and Midterm Exam

9
Class Schedule 2nd half

• Week 9 Binary and other trees (Chapter 8)
• Week 10 Priority queues, heap sort, and Huffman
  codes (Chapter 9)
• Week 11 Tournament trees and bin packing
  (Chapter 10)
• Week 12 Search trees, AVL trees (Chapter 11)
• Week 13 Graphs (Chapter 12)
• Week 14 Algorithms I (Chapter 13)
• Week 15 Algorithms II (Chapter 14)
• Week 16 Review and Final exam

10
Java Review

• Birds-eye View
• Structure of a Java Program
• The Java Compiler and Virtual Machine
• Documentation Comments
• Data Types
• Methods
• Exceptions
• Your Very Own Data Type
• Access Modifiers
• Inheritance and Method Overriding
• Currency Revisited
• Defining an Exception Class
• Generic Methods
• Garbage Collection
• Recursion
• Testing and Debugging
• READING Chapter 1