ผลต่างระหว่างรุ่นของ "01204212-59"
ไปยังการนำทาง
ไปยังการค้นหา
Jittat (คุย | มีส่วนร่วม) (→Tasks) |
Jittat (คุย | มีส่วนร่วม) (→Tasks) |
||
| แถว 14: | แถว 14: | ||
* Sorting 1 | * Sorting 1 | ||
** Recursive practice [[01204212/recur]] | ** Recursive practice [[01204212/recur]] | ||
| − | ** Sorting tasks: [[01204212/integer sorting|Integer | + | ** Sorting tasks: [[01204212/integer sorting|Integer sorting]] |
== Homework == | == Homework == | ||
รุ่นแก้ไขเมื่อ 13:41, 15 กันยายน 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)
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
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.
