ผลต่างระหว่างรุ่นของ "01204212-59"

จาก Theory Wiki
ไปยังการนำทาง ไปยังการค้นหา
แถว 4: แถว 4:
  
 
* The book for the course: [https://www.gitbook.com/book/jittat/dsbook-concrete-to-abstract/details Data Structures] (more material as we go)
 
* The book for the course: [https://www.gitbook.com/book/jittat/dsbook-concrete-to-abstract/details Data Structures] (more material as we go)
 +
 +
== Topic list ==
 +
* 11-sep:
 +
* 18-sep:
 +
* 25-sep:
 +
* 1-sep:
 +
* 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:
  
 
== Tasks ==
 
== Tasks ==

รุ่นแก้ไขเมื่อ 10:11, 21 กันยายน 2559

This is the course materials for 01204212 Abstract Data Types and Problem Solving, section 450.

Materials

Topic list

  • 11-sep:
  • 18-sep:
  • 25-sep:
  • 1-sep:
  • 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:

Tasks

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.