MIT OpenCourseWare


» ¶i¶¥·j´M
 ½Òµ{­º­¶
 ±Ð¾Ç¤jºõ
 ±Ð¾Ç®Éµ{
 ¬ÛÃö¾\Ū¸ê®Æ
 ½Ò°óÁ¿½Z
 §@·~
 ´úÅç
 °Q½×¸s²Õ

§@·~


¥»­¶Â½Ä¶¶i«×

¿O¸¹»¡©ú

¼f©w¡G«\©ºªZ(²¤¶¨Ã±H«H)
¼f©w²¤¶¡G
¤¤µØ¤j¾Ç¸ê¤u¨t°Æ±Ð±Â
­Ó¤H±Mªø¡Gºtºâªk(algorithms)¡BÂ÷´²¼Æ¾Ç(discrete mathematics)¡B¹Ï½×(graph theory)¤ÎµL½uºô¸ô(wireless networks) ¡C

½Ķ¡G¹ù¬@(²¤¶¨Ã±H«H)
½s¿è¡G¦¶¾ÇùÚ(²¤¶¨Ã±H«H)

¦b²ßÃD¶°ùةҤޥΪº¾\Ū§÷®Æ©M²ßÃD¬O¥Ñ½Ò¥»¡mºtºâªk¾É½×¡n¡A²Ä¤Gª©¤º¨ú±oªº¡A( ¸Ô²Óªº¸ê°T½Ð°Ñ¦Ò http://mitpress.mit.edu/algorithms/ )¡C The readings and problems referenced in the problem sets are from the course textbook, Introduction to Algorithms, 2nd Edition, by Cormen, Leiserson, Rivest, and Stein (see http://mitpress.mit.edu/algorithms/ for more information).


§@·~ µª®×
²ßÃD 1 (PDF) (PDF)
²ßÃD 2 (PDF) (PDF)
²ßÃD 3 (PDF) (PDF)
²ßÃD 4 (PDF) (PDF)
²ßÃD 5 (PDF) (PDF)
²ßÃD 6 (PDF) (PDF)
²ßÃD 7 (PDF) (PDF)
²ßÃD 8 (PDF) (PDF)
²ßÃD 8 ªº½d¨Ò (PDF) -
²ßÃD 9 (PDF) (PDF)
²ßÃD 10 (PDF) (PDF)

MIT Home
Massachusetts Institute of Technology Terms of Use Privacy