2005Çг⵵ 2Çб⠼ö¾÷°èȹ¼­ --  °ú¸ñ¸í : µ¥ÀÌÅÍ ±¸Á¶


´ã´ç±³¼ö : ¼ÛÈ«¿±, Á¦2°øÇаü 612È£, ÀüÈ­ 2123-4861

E-mail : hysong@yonsei.ac.kr     Homepage : http://coding.yonsei.ac.kr


¼ö°­´ë»ó : Àü±âÀüÀÚ°øÇкΠ3Çгâ

°ú¸ñÁ¾º° : Àü°ø ¼±Åà (Àü°ø ±âÃÊÇÙ½É)

°­Àǽð£ : ÁÖ´ç 3½Ã°£(È­78, ¸ñ7, B004)  (¿¬½À ¸ñ11, B004)

¿¬½ÀÁ¶±³ : ¿ÀÇö¿µ(¼®»ç 1Çбâ hy.oh@coding.yonsei.ac.kr) ¿¬±¸½Ç B613, ±¸³»ÀüÈ­ 7771


¼ö¾÷¸ñÇ¥ :

1. C¾ð¾î¸¦ »ç¿ëÇÏ¿© Àü»êÇÁ·Î±×·¥À» ÀÛ¼ºÇϱâ À§ÇÑ Abstract Data Type¿¡ ´ëÇÏ¿© °øºÎÇÑ´Ù.

2. À̸¦ ÀÌ¿ëÇÑ ´Ù¾çÇÑ ±âº» ¾Ë°í¸®Áò(Algorithm)ÀÇ ¼³°è(Design) ¹× Çؼ®(Analysis)¿¡ ´ëÇÏ¿© °øºÎÇÑ´Ù.

3. Àü»ê°úÇÐ ¹× ÄÚµùÀÌ·ÐÀÇ ±âÃÊ°¡ µÇ´Â ÀÌ»ê¼öÇÐ(Discrete Mathematics) ü°è¿¡ ´ëÇÏ¿© ¼Ò°³ÇÑ´Ù.

±³Àç :

[1] Mark A. Weiss, Data Structures and Algorithm Analysis in C, 2nd edition, 1997

[2] Others

¼ºÀûÆò°¡ :

Áß°£+±â¸»½ÃÇè:   20Á¡ + 20Á¡ = 40Á¡

HW          :   10Á¡ × 9ȸ = 90Á¡

Ãâ¼®    :   ¨ç 100%Ãâ¼® = 10Á¡,  ¨è 1ȸ~3ȸ ¹«´Ü°á¼® = 0Á¡, ¨é 4ȸ ÀÌ»ó ¹«´Ü°á¼® = FÇÐÁ¡

ÇÐÁ¡ºÐÆ÷

ÇÐÁ¡

A+

A0

A-

B+

B0

B-

C

D

F

ºÐÆ÷

5%

10%

10%

15%

10%

10%

25%

15%

¼ö°­»ýÀ¯ÀÇ»çÇ×

  1. ¼ö¾÷½Ã°£ Áß ÈÞ´ëÀüÈ­ÀÇ Àü¿øÀ» ²¨¾ßÇÕ´Ï´Ù. º§¼Ò¸®/Áøµ¿ÀÌ ¿ï¸®¸é °ð¹Ù·Î °­ÀǽÇÀ» ³ª°¡ÁÖ¼¼¿ä.
  2. ¼ö¾÷½Ã°£ Áß ÀÏüÀÇ Àâ´ãÀ» ±ÝÇÕ´Ï´Ù. Àâ´ãÀ» ¿øÇÏ¸é °­ÀÇ½Ç ¹ÛÀ¸·Î ³ª°¡ÁÖ¼¼¿ä.
  3. À§ÀÇ ÇÐÁ¡ºÐÆ÷´Â »ó´ëÆò°¡ÀÇ °á°úÀÔ´Ï´Ù.
  4. HW/º¸°í¼­ Á¦Ã⸶°¨Àº ¼ö¾÷½Ã°£ ½ÃÀÛÀÔ´Ï´Ù. ´Ê°Ô ¼ö¾÷¿¡ µµÂøÇÏ¸é ¸¶°¨ÀÌ Áö³­ °Ì´Ï´Ù. ¹Þ¾Æ´Þ¶ó°í ¶¼¾²Áö ¸¶¼¼¿ä.
  5. ºÒ°¡ÇÇÇÏ°Ô °á¼®ÇÑ °æ¿ì ´ÙÀ½ ¼ö¾÷½Ã°£±îÁö »çÀ¯¼­¸¦ Á¦ÃâÇϼ¼¿ä. »çÀ¯¼­°¡ Á¦ÃâµÇÁö ¾ÊÀº °æ¿ì ¹«´Ü°á¼®ÀÌ µÇ¸ç, ¹«´Ü°á¼® 4ȸºÎÅÍ FÇÐÁ¡À» ¹Þ½À´Ï´Ù.
  6. ¸ðµç HW¿¡¼­ ÇÁ·Î±×·¥À» Á÷Á¢ °æÇèÇØ¾ß ÇÕ´Ï´Ù. µ¿·á¼ö°­»ýÀÇ ÇÁ·Î±×·¥À» Ä«ÇÇÇÏ´Â °æ¿ì ¾î´À °ÍÀÌ ¿øº»ÀÌ°í ¾î´À °ÍÀÌ Ä«ÇǺ»ÀÎÁö ±¸ºÐÀÌ ºÒ°¡´ÉÇϹǷΠÇØ´çÀÚ 2¸íÀÇ ¼ö°­»ý ¸ðµÎ¿¡°Ô FÇÐÁ¡À» ºÎ¿©ÇÕ´Ï´Ù.
  7. HW/º¸°í¼­ Á¦Ã⠽à À¯ÀÇ»çÇ×:

  8. º» °úÁ¦ÀÇ °á°ú´Â µ¿·á ¼ö°­»ýÀÇ ÇÁ·Î±×·¥À» Ä«ÇÇÇÏÁöµµ ±×¸®°í ÂüÁ¶ÇÏÁö ¾Ê¾ÒÀ½À» ¾à¼ÓÇÕ´Ï´Ù. À§ÀÇ ³»¿ëÀÌ »ç½ÇÀÌ ¾Æ´Ñ °æ¿ì ¼ºÀûÆò°¡ »ó ¾î¶°ÇÑ ºÒÀÌÀ͵µ °¨¼öÇÕ´Ï´Ù.       ¼­¸í:                         



¼ö¾÷³»¿ë¿ä¾à

ÁÖ

±â°£

³»¿ë¿ä¾à

±³Àç

HW

HWÁ¦Ã⸶°¨

ÇлçÀÏÁ¤

2005-09-01
2005-09-06 

Introduction

Á¦1Àå

HW#1

9/15 ¸ñ ¼ö¾÷½Ã°£

(9.1) °³°­
(9.5 - 9.8) ¼ö°­½ÅûȮÀÎ/º¯°æ

2005-09-08
2005-09-13 

Algorithm Analysis

Á¦2Àå

HW#2

9/22 ¸ñ ¼ö¾÷½Ã°£

(9.14) ÀϹÝÈÞÇÐ Á¢¼ö¸¶°¨

2005-09-15
2005-09-20 

List

Á¦3Àå

HW#3

9/29 ¸ñ ¼ö¾÷½Ã°£

(9.17 - 9.19) Ãß¼®¿¬ÈÞ

2005-09-22
2005-09-27 

Stack and Queue

Á¦3Àå

 

 

 

2005-09-29
2005-10-04 

Tree

Á¦4Àå

HW#4

10/13 ¸ñ ¼ö¾÷½Ã°£

(10.3) °³ÃµÀý

2005-10-06
2005-10-11 

Tree

Á¦4Àå

 

 

(10.7) Çбâ 1/3¼±

2005-10-13
2005-10-18 

Hashing

Á¦5Àå

HW#5

10/27 ¸ñ ¼ö¾÷½Ã°£

 

2005-10-20
2005-10-25 

Áß°£½ÃÇè

 

 

 

(10.20 - 10.26) Áß°£½ÃÇè
(10.26) Çбâ1/2¼±

2005-10-27
2005-11-01 

Priority Queue

Á¦6Àå

HW#6

11/10 ¸ñ ¼ö¾÷½Ã°£

(10.31 - 11.2) ¼ö°­Ã¶È¸±â°£
(10.31 - 11.4) Á¹¾÷½Åû/¿¬±â½Åû

10 

2005-11-03
2005-11-08 

Priority Queue

Á¦6Àå

 

 

 

11 

2005-11-10
2005-11-15 

Sorting

Á¦7Àå

HW#7

11/24 ¸ñ

¼ö¾÷½Ã°£

(11.14) Çбâ 2/3 ¼±

12 

2005-11-17
2005-11-22 

Sorting

Á¦7Àå

 

 

 

13 

2005-11-24
2005-11-29 

Disjoint Sets

Á¦8Àå

HW#8

12/1 ¸ñ ¼ö¾÷½Ã°£

 

14 

2005-12-01
2005-12-06 

Graph Algorithm

Á¦9Àå

HW#9

12/13 È­ ¼ö¾÷½Ã°£

 

15 

2005-12-08
2005-12-13 

Graph Algorithm

Á¦9Àå

 

 

(12.8) Áúº´ÈÞÇÐ Á¢¼ö¸¶°¨

16 

2005-12-15
2005-12-20 

±â¸»½ÃÇè (2 ½Ã°£)

 

 

 

(12.15 - 12.21) ±â¸»½ÃÇè