ผลต่างระหว่างรุ่นของ "Ske algo lab-61"

จาก Theory Wiki
ไปยังการนำทาง ไปยังการค้นหา
แถว 7: แถว 7:
  
 
* 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]]
 
* Pointers and dynamic memory allocation, arrays
 
* Pointers and dynamic memory allocation, arrays
 
* Objects and classes
 
* Objects and classes
แถว 19: แถว 21:
 
* 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]

รุ่นแก้ไขเมื่อ 19:33, 5 สิงหาคม 2561

Announcements

  • The class on Aug, 6th will start at 14:00.
  • Please add yourself to the Facebook group.

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
  • Pointers and dynamic memory allocation, arrays
  • Objects and classes
  • Linear data structures: lists
  • Sorting
  • Binary search trees
  • Stacks, queues
  • Graphs
  • Graph searching: DFS, BFS
  • Other abstract data types: set and map
  • Standard data structure library: STL
  • Greedy algorithms
  • Divide and conquer algorithms

Resources