| |
 |
˹ѧÊ×èÍà¡ÕèÂǡѺâ¤Ã§ÊÃéÒ§¢éÍÁÙÅ áÅÐÍÑÅ¡ÍÃÔ·ÖÁ |  |
| |
»ÃѺ»Ãا : 2552-06-16 (˹ѧÊ×Í 6 àÅèÁ)
[1] ¹ÔÃظ ÍÓ¹ÇÂÈÔÅ»ì,
"â¤Ã§ÊÃéÒ§¢éÍÁÙÅ : ¡ÒÃà¢Õ¹â»Ãá¡ÃÁáÅСÒûÃÐÂØ¡µì",
ºÃÔÉÑ· ´Ç§¡ÁÅÊÁÑ ¨Ó¡Ñ´., ¡Ãا෾Ï, 2548.
1. ·º·Ç¹àÃ×èͧµÑÇá»Ã¡Ñ¹ÍÕ¡¤ÃÑé§
2. Êᵡ (Stack)
3. ¤ÔÇ (Queue)
4. ÅÔ§¤ìÅÔʵì (Linked List)
5. ÅÔ§¤ìÅÔʵìẺ¤Ùè (Double Linked List)
6. ¡Òäé¹ËÒ (Searching)
7. ¡ÒÃàÃÕ§ÅӴѺ (Sorting)
8. ¡ÒÃàÃÕ§ÅӴѺ¢Ñé¹ÊÙ§ (Advanced Sorting)
9. µé¹äÁé (Tree)
10. áΪà·àºÔÅ (Hash Table)
se-ed.com
| |
[2] Guy J.Hale, Richard J.Easton,
"Applied Daa Structures Using Pascal",
D.C.Heath and Company. Canada. 2530.
1. Introduction
2. Linked Lists
3. Stacks, Queues, and Other Linked Lists
4. Elementary Searching and Sorting Techniques
5. Recursion
6. Introduction to Trees
7. More Trees
8. Advanced Sorting Techniques
9. Files
10. Introduction to Graphs
amazon.com
| |
[3] âÍÀÒÊ àÍÕèÂÁÊÔÃÔǧÈì,
"â¤Ã§ÊÃéÒ§¢éÍÁÙÅ (Data Structures) à¾×èÍ¡ÒÃÍ͡Ẻâ»Ãá¡ÃÁ¤ÍÁ¾ÔÇàµÍÃì",
ºÃÔÉÑ· «ÕàÍç´ÂÙपÑè¹ ¨Ó¡Ñ´., ¡Ãا෾Ï, 2549.
1. ¾×é¹°Ò¹¡ÒÃÍ͡Ẻâ»Ãá¡ÃÁ (Fundamental of Program Design)
2. ¤ÇÒÁÃÙéàº×éͧµé¹ (Introduction)
3. ÍÒÃìàÃÂì (Array)
4. ÅÔ§¡ìÅÔʵì (Linked Lists)
5. Êáµç¡ (Stack)
6. ¤ÔÇ (Queues)
7. ·ÃÕ (Trees)
8. ¡ÃÒ¿ (Graphs)
9. ¡ÒÃàÃÕ§ÅӴѺ¢éÍÁÙÅ (Sorting)
10. ¡Òäé¹ËÒ¢éÍÁÙÅ (Searching)
se-ed.com
| |
[4] ÇÔÇѲ¹ì ÍÀÔÊÔ·¸ÔìÀÔâ, ÍÁà ÁØÊÔ¡ÊÒÃ,
"â¤Ã§ÊÃéÒ§¢éÍÁÙÅ (Data Structures)",
ºÃÔÉÑ· àÍ-ºØê¤ ´ÔÊ·ÃÔºÔǪÑè¹ ¨Ó¡Ñ´., ¡Ãا෾Ï, 2548.
1. â¤Ã§ÊÃéÒ§¢éÍÁÙÅàº×éͧµé¹ (Structure)
2. ÍÒÃìàÃÂì (Array)
3. àäÍÃì´ (Record)
4. ¾Í¹ìàµÍÃì áÅÐÅÔ§¤ì-ÅÔʵì (Pointer & Linked-list)
5. Êᵡ (Stack)
6. ¤ÔÇ (Queue)
7. â¤Ã§ÊÃéÒ§·ÃÕ (Tree Structure)
8. â¤Ã§ÊÃéÒ§¢éÍÁÙÅẺ¡ÃÒ¿ (Graph Structure)
9. ¡ÒèѴàÃÕ§¢éÍÁÙÅ (Sorting)
10. ¡Òäé¹ËÒ¢éÍÁÙÅ (Searching)
se-ed.com
| |
[5] à¹ÃÁÔµ ªØÁÊÒ ³ ÍÂظÂÒ,
"àÃÕ¹ÃÙéâ¤Ã§ÊÃéÒ§¢éÍÁÙÅáÅÐÍÑÅ¡ÍÃÔ·ÖÁ´éÇ Java",
ºÃÔÉÑ· «ÕàÍç´ÂÙपÑè¹ ¨Ó¡Ñ´., ¡Ãا෾Ï, 2550.
1. ÍÒÃìàÃÂìáÅСÒäé¹ËÒ
2. Linked-List
3. Stack áÅÐ Queue
4. Recursion
5. ¡ÒèѴàÃÕ§¢éÍÁÙÅ
6. Binary Tree
7. Self-Balanced Binary Search Trees
8. Skip Lists
9. 2 - 3 - 4 Tree
10. Hash Table
11. Graph
se-ed.com
| |
[6] ¢¹ÔÉ°Ò ¹ÒÁÕ,
"â¤Ã§ÊÃéÒ§¢éÍÁÙÅáÅÐÍÑÅ¡ÍÃÔ·ÖÁ",
ºÃÔÉÑ· äÍ´Õ«Õ ÍԹ⿠´ÔÊ·ÃÔºÔÇàµÍÃì à«ç¹àµÍÃì ¨Ó¡Ñ´., ¡Ãا෾Ï, 2548.
1. ÃÙé¨Ñ¡¡Ñºâ¤Ã§ÊÃéÒ§¢éÍÁÙÅáÅÐÍÑÅ¡ÍÃÔ¸ÖÁ
2. ¡ÒÃÇÔà¤ÃÒÐËì»ÃÐÊÔ·¸ÔÀÒ¾¢Í§ÍÑÅ¡ÍÃÔ·ÖÁ
3. ÊÑÅѡɳì Asymptotic
4. Êᵡ (Stack) áÅФÔÇ (Queue)
5. ÅÔ§¤ìÅÔʵì (Linked List)
6. ·ÃÕ (Tree)
7. ÎÕ¾ (Heap)
8. Disjoint Set (ÍÑÅ¡ÍÃÔ¸ÖÁ Union/Find)
9. ¡Òäé¹ËÒ¢éÍÁÙÅ (Searching)
10. Hashing
11. ¡ÒÃàÃÕ§ÅӴѺ¢éÍÁÙÅ (Sorting)
12. Graph
se-ed.com
| |