Week 03: Bags, Queues, and Stacks

Learning Resources:

• Prescribed Textbook (sub-chapter 1.3)
• Prescribed Textbook companion website
• Lecture Slide (prepared by Robert Sedgewick)
• Lecture Slide (prepared by Boedy)
• Animation: Dijkstra 2 Stack (prepared by Robert Sedgewick)

Tutorial Content:

• Exercises section from Prescribed Textbook (page 161-166)

Self Study:

• Creative Problems section from Prescribed Textbook (page 167-171)

Week 02: Data Abstraction

Learning Resources:

• Prescribed Textbook (sub-chapter 1.2)
• Prescribed Textbook companion website
• Lecture Slide (prepared by Boedy)

Tutorial Content:

• Exercises section from Prescribed Textbook (page 114-116)

Self Study:

• Creative Problems section from Prescribed Textbook (page 117-119)

Week 01: Basic Programming Model

Learning Resources:

• Prescribed Textbook (sub-chapter 1.1)
• Prescribed Textbook companion website
• Lecture Slide (prepared by Boedy)

Tutorial Content:

• Exercises section from Prescribed Textbook (page 54-58)

Self Study:

• Creative Problems section from Prescribed Textbook (page 59-60)
• Experiments section from Prescribed Textbook (page 61-62)

Unit Outline Semester 1, 2013

Algorithms (IS-207)

Semester 1, 2013

Unit Coordinator

Boedy (setia[dot]budi[at]itmaranatha[dot]org; sbudi[at]utas[dot]edu[dot]au; LinkedIn; Twitter)
H08B04, GWM level 8
Maranatha University

Lecturing Staff

Boedy (setia[dot]budi[at]itmaranatha[dot]org)
Consultation time: Friday 08:00am - 09:00am

Prescribed Textbook

Algorithms (4th Edition)
Author: Robert Sedgewick, Kevin Wayne
Publisher: Addison-Wesley Professional (2011)
ISBN: 978-0-321-57351-3

Unit Plan

• Week 01: Basic Programming Model  
• Week 02: Data Abstraction
• Week 03: Bags, Queues, and Stacks
• Week 04: Analysis of Algorithms 
• Week 05: Elementary Sorts
• Week 06: Mergesort  
• Week 07: Quicksort 
• Week 08: Priority Queues
• Week 09: Symbol Tables
• Week 10: Binary Search Trees
• Week 11: Balanced Search Trees
• Week 12: Hash Tables

Supporting Learning Resources

• Textbook companion website
• On-line Course (delivered by Robert Sedgewick and Kevin Wayne from Princeton University)

Prior Knowledge and/or Skills

Students will be expected to have the following (from prerequisite units and / or their own reading):

• Good English (passive). This skill is essential since there will be reading task (refer to the prescribed textbook) in each week as part of self study.
• An understanding of and ability to use basic programming constructs (variable including arrays, assignment operations, arithmetic operations, logical tests, branching flow of control, looping flow of control) in order to run and implement some algorithms.
• Familiar with Java programming language. This skill is essential since all the code examples in this unit are written in Java.

Programming Tools

• Java (jdk)
• Sublime Text 2
• Standard Libraries
• Standard Libraries as External Libraries (Optional for IDE use)
• Eclipse (Optional IDE)
• Netbeans (Optional IDE)
• IntelliJ IDEA (Optional IDE) -> send me an email for the academic license key (1 year - Maranatha Christian University)

Slide

• Introduction