ผลต่างระหว่างรุ่นของ "Ske algo lab-61"
ไปยังการนำทาง
ไปยังการค้นหา
Jittat (คุย | มีส่วนร่วม) |
Jittat (คุย | มีส่วนร่วม) ล (Ske algo lab ถูกเปลี่ยนชื่อเป็น Ske algo lab-61) |
||
| (ไม่แสดง 13 รุ่นระหว่างกลางโดยผู้ใช้คนเดียวกัน) | |||
| แถว 2: | แถว 2: | ||
* The class on Aug, 6th will start at 14:00. | * The class on Aug, 6th will start at 14:00. | ||
* Please add yourself to the Facebook group. | * Please add yourself to the Facebook group. | ||
| + | |||
| + | == Graders == | ||
| + | |||
| + | * [https://elab.cpe.ku.ac.th/elab2/ Elab2] | ||
| + | * [http://adtlab.secondtrain.org/grader Grader] | ||
| + | |||
| + | == Assignments == | ||
| + | * [[Adt_lab/Ad_hoc_problems_1|Ad hoc problems]] | ||
== Core Materials == | == Core Materials == | ||
| แถว 7: | แถว 15: | ||
* Quick introduction to C/C++ programming | * Quick introduction to C/C++ programming | ||
| + | ** elab2 [https://elab.cpe.ku.ac.th/elab2/lab/37/240/ Lab1 Introduction to C++] | ||
| + | ** Notes: [[ske algo lab/lab 1 notes|notes]] | ||
* Pointers and dynamic memory allocation, arrays | * Pointers and dynamic memory allocation, arrays | ||
| + | ** [[Adt_lab/pointers|Notes]] | ||
| + | * [[Algo_lab/running times|Measuring running times]] | ||
| + | * [[Algo_lab/linked lists|Linear data structures (1): lists]] | ||
* Objects and classes | * Objects and classes | ||
| − | |||
* Sorting | * Sorting | ||
| − | * Binary search trees | + | * Linear data structures (2): lists, stacks, queues |
| − | * | + | * [[Algo_lab/bst|Binary search trees]] |
| + | * Other abstract data types: set and map | ||
| + | * Standard data structure library: STL | ||
| + | ** [[Adt_lab/stl_examples]] | ||
| + | ** [[Adt_lab/stl_sets_and_maps]] | ||
* Graphs | * Graphs | ||
* Graph searching: DFS, BFS | * Graph searching: DFS, BFS | ||
| − | * | + | ** [[adt lab/adjlist and bfs|Example code for reading graphs & find levels with bfs]] |
| − | * | + | ** Other example [[Psl/adjlist|Reading graphs into adjacency lists + DFS]] |
* Greedy algorithms | * Greedy algorithms | ||
* Divide and conquer algorithms | * Divide and conquer algorithms | ||
| + | |||
== Resources == | == Resources == | ||
* You may want to install a compiler on your notebook: [[C++ compilers|Notes on C++ compilers]]. You can also use various on-line C++ shell in the beginning, but it will be very hard and slow to debug when you have to work with bigger test data and more complex problems. | * You may want to install a compiler on your notebook: [[C++ compilers|Notes on C++ compilers]]. You can also use various on-line C++ shell in the beginning, but it will be very hard and slow to debug when you have to work with bigger test data and more complex problems. | ||
* C++ Tutorials: [http://www.cplusplus.com/doc/tutorial/ cplusplus.com], [http://www.tutorialspoint.com/cplusplus/ tutorialspoint.com], [http://www.sololearn.com/Course/CPlusPlus/ sololearn.com] | * C++ Tutorials: [http://www.cplusplus.com/doc/tutorial/ cplusplus.com], [http://www.tutorialspoint.com/cplusplus/ tutorialspoint.com], [http://www.sololearn.com/Course/CPlusPlus/ sololearn.com] | ||
| + | * [[Adt_lab|ADT Lab course]] | ||
รุ่นแก้ไขปัจจุบันเมื่อ 02:44, 23 สิงหาคม 2562
Announcements
- The class on Aug, 6th will start at 14:00.
- Please add yourself to the Facebook group.
Graders
Assignments
Core Materials
These are the list of topics we cover. You will write C/C++ programs to solve various programming/algorithmic tasks to learn these concepts.
- Quick introduction to C/C++ programming
- elab2 Lab1 Introduction to C++
- Notes: notes
- Pointers and dynamic memory allocation, arrays
- Measuring running times
- Linear data structures (1): lists
- Objects and classes
- Sorting
- Linear data structures (2): lists, stacks, queues
- Binary search trees
- Other abstract data types: set and map
- Standard data structure library: STL
- Graphs
- Graph searching: DFS, BFS
- Greedy algorithms
- Divide and conquer algorithms
Resources
- You may want to install a compiler on your notebook: Notes on C++ compilers. You can also use various on-line C++ shell in the beginning, but it will be very hard and slow to debug when you have to work with bigger test data and more complex problems.
- C++ Tutorials: cplusplus.com, tutorialspoint.com, sololearn.com
- ADT Lab course
