ผลต่างระหว่างรุ่นของ "01204212-59"
ไปยังการนำทาง
ไปยังการค้นหา
Jittat (คุย | มีส่วนร่วม) |
Jittat (คุย | มีส่วนร่วม) |
||
| แถว 11: | แถว 11: | ||
** Sample task: nested comment reporting, iterative solution, recursive solution | ** Sample task: nested comment reporting, iterative solution, recursive solution | ||
* 25-sep: | * 25-sep: | ||
| + | ** List abstract data type | ||
| + | ** Array implementation of lists | ||
| + | ** Linked lists (using only list nodes) | ||
* 1-sep: | * 1-sep: | ||
| + | ** Linked list class | ||
| + | ** Iterator patterns | ||
| + | ** Generic data structures | ||
| + | ** Running time analysis | ||
* 8-sep: | * 8-sep: | ||
** Queues | ** Queues | ||
| แถว 20: | แถว 27: | ||
** Recursive versions of insertion sort and selection sort | ** Recursive versions of insertion sort and selection sort | ||
* 22-sep: | * 22-sep: | ||
| − | ** | + | ** Set and map abstract data types: Set and Map interfaces (with two implementations hash map & tree map) |
** Static sets and maps implementation with binary search | ** Static sets and maps implementation with binary search | ||
รุ่นแก้ไขเมื่อ 10:17, 21 กันยายน 2559
This is the course materials for 01204212 Abstract Data Types and Problem Solving, section 450.
เนื้อหา
Materials
- The book for the course: Data Structures (more material as we go)
Topic list
- 11-sep:
- Sample task: nearest neighbor search, searching in arrays
- 18-sep:
- Sample task: nested comment reporting, iterative solution, recursive solution
- 25-sep:
- List abstract data type
- Array implementation of lists
- Linked lists (using only list nodes)
- 1-sep:
- Linked list class
- Iterator patterns
- Generic data structures
- Running time analysis
- 8-sep:
- Queues
- Stacks
- Implementations of queues and stacks with linked lists
- 15-sep:
- Recursion
- Recursive versions of insertion sort and selection sort
- 22-sep:
- Set and map abstract data types: Set and Map interfaces (with two implementations hash map & tree map)
- Static sets and maps implementation with binary search
Tasks
- Introduction: Nearby Search, Statuses
- Lists: Zooma 1, Zooma 2, Zooma 3
- Stacks and queues: Job queue, Parentheses, Expressions
- Java collections:
- Queues interface Queue<E>, short descriptions and examples
- Stacks class Stack<E>
- Java collections:
- Sorting 1
- Recursive practice 01204212/recur
- Sorting tasks: Integer sorting
- Sets and maps: ID Request, Like count
Homework
- Homework 1 (due: Aug-7): Zooma 2
- Homework 2 (due: Aug-16): Job queue 2, Expressions
- Notes: In this homework, you must use your own implementation of queues and stacks based on our linked list implementation. You can start with stack and queue implementations that use this linked list implementation. Note that a few methods are left out, so you need to write your own version of them.
- How to submit
- Send two separate emails, each for one of the problem
- For each problem, attach all your java files and send me an email with the subject "01204212 homework 2 jobqueue (58xxxxxxxx)" or "01204212 homework 2 expr (58xxxxxxxx)"
Codes
These are codes that you may or may not need.
