2014-1 µ¥ÀÌÅͱ¸Á¶ (¼ÛÈ«¿±±³¼ö ºÐ¹Ý) hit count: since 2013.12.22
Week |
Dates |
Topic (2014.4.18 ¹öÀü) |
PROJECT |
Semester Calender |
01 |
03.03 – 03.09 |
°ú¸ñ¼Ò°³ C¾ð¾îº¹½À: Pointers |
Project #0 |
(3.3 ¿ù)°³° |
02 |
03.10 – 03.16 |
C¾ð¾îº¹½À: Arrays and Strings |
|
|
03 |
03.17 – 03.23 |
C¾ð¾îº¹½À: Recurssion/File In/Out and more |
|
|
04 |
03.24 – 03.30 |
Project 1 ¼³¸í (2½Ã°£) ¼ö: 1Àå ½ÃÀÛ 1½Ã°£ |
Project #1 |
|
05 |
03.31 – 04.06 |
¿ù: 2Àå 1½Ã°£ ¼ö: Áß°£½ÃÇè (C¾ð¾î º¹½À ºÎºÐ) |
|
(4.2- 4.4) ¼ö°Ã¶È¸ |
06 |
04.07 – 04.13 |
¿ù: 2Àå Algorithm Analysis |
Project #2 |
(4.9) Çбâ 1/3¼± |
07 |
04.14 – 04.20 |
¿ù,¼ö: 3Àå List/Stack/Queue (3½Ã°£) |
Optional Project (Chapter 3) |
¼ö°»ý ¾ó±¼¿Ü¿ì±â ½ÃÇè |
08 |
04.21 – 04.27 |
no class |
|
(4.17 - 4.23) Áß°£½ÃÇè |
09 |
04.28 – 05.04 |
¿ù: 4Àå Trees (1½Ã°£) |
Project #3 (chapter 4) |
|
10 |
05.05 – 05.11 |
¿ù: no class ¼ö: 1½Ã°£ - 4Àå Trees (1½Ã°£ - ³¡) ¼ö: 1½Ã°£ - 6Àå Priority Queue |
Project #4 (chapter 6) |
(5.5 ¿ù)¾î¸°À̳¯ |
11 |
05.12 – 05.18 |
¿ù: 7Àå Sorting (1½Ã°£) |
Project #5 (chapter 7) |
(5.16) Çбâ 2/3 ¼± |
12 |
05.19 – 05.25 |
¿ù: 7Àå Sorting (1½Ã°£) ¼ö: 9Àå Graph Algorithm (2½Ã°£) |
|
|
13 |
05.26 – 06.01 |
9Àå Graph Algorithm (3½Ã°£) |
Project #6 (chapter 9) |
|
14 |
06.02 – 06.08 |
¿ù: 5Àå Hash (1½Ã°£) ¼ö: 8Àå Disjoint Sets (2½Ã°£) |
|
(6.6 ±Ý) ÇöÃæÀÏ |
15 |
06.09 – 06.15 |
EXTRA TOPIC |
Optional Project (chapter 5,8) |
(6.9 - 6.21) ¼ö¾÷ÇÕ´Ï´Ù. |
16 |
06.16 – 06.22 |
No final exam, no class |
|
(6.9 - 6.21) ÀÚÀ²ÇнÀ ¹× ±â¸»½ÃÇè |
2014-1 µ¥ÀÌÅͱ¸Á¶ ¼ö°»ý ¾Ù¹ü (ÃÑ 51¸í - ¼ö°Ã¶È¸ ÀÌÈÄ)
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
LECTURE HOME by Hong-Yeop Song