Data Structure
01635(01, 02), Fall 2007

1. Class Informations

  • ±³°ú¸ñ¸í : ÀڷᱸÁ¶(Data Structure)
  • À̼ö±¸ºÐ : Àü°ø¼±ÅÃ(01635-01/02)
  • °­Àǽð£ : (01ºÐ¹Ý)¿ù7/8,¸ñ3±³½Ã; (02ºÐ¹Ý)È­5/6,¸ñ2±³½Ã.
  • ¿¬¶ôó : kkman@sangji.ac.kr, (Tel)033-730-0486
  • ȨÆäÀÌÁö : http://pltech.sangjicom.ac.kr
  • 2. Syllabus

    3. Course Description

    ÃÖ±Ù ¼ö½Ê³â µ¿¾È °¡Àü ¹× Àü»ê±â±â´Â Áö¼ÓÀûÀ¸·Î ¹ß´ÞÇϰí ÀÖ°í, ¾ÕÀ¸·Î Àΰ£ÀÇ »î ¿¡ ¾ø¾î¼­´Â ¾È µÉ Áß¿ëÇÑ ÇʼöǰÀ¸·Î °Åµì³ª°í ÀÖ´Ù. ÀÌ·¯ÇÑ ´Ù¾çÇÑ ±â±âµéÀº °¢°¢ ÀÇ ¸ñÀû¿¡ ¸Â°Ô ±¸µ¿µÇ¾î¾ß ÇÏ´Â ¿î¿ë ÇÁ·Î±×·¥ÀÌ ³»ÀåµÇ¾î ÀÖ¾î ±¸ÇöµÈ ¾Ë°í¸®Áò¿¡ µû¶ó µ¿ÀÛÀ» ¼öÇàÇÏ°Ô µÈ´Ù. ÀڷᱸÁ¶¶õ ÀÌ·¯ÇÑ ¾Ë°í¸®ÁòÀ» ±¸ÇöÇϱâ À§ÇÑ ±âº» ´ÜÀ§ ·Î½á ¾ó¸¶¸¸Å­ ±¸Á¶È­µÇ¾ú´À³Ä, ÃÖÀûÈ­ µÇ¾ú´À³Ä, ¶Ç´Â À̽ļºÀÌ ¶Ù¾î³ª´À³Ä¿¡ µû¶ó ¾Ë°í¸®ÁòÀÇ ¼öÇà¼Óµµ ¹× È¿À²¼º¿¡ ¿µÇâÀ» ¹ÌÄ¡°Ô µÈ´Ù. ¼ÒÇÁÆ®¿þ¾î °³¹ßÀÚ ¶Ç´Â Àü »ê °ü·Ã Àü°øÀÚµéÀº È¿À²ÀûÀÎ ¾Ë°í¸®ÁòÀ» ÀÛ¼ºÇϱâ À§Çؼ­ ÀڷᱸÁ¶ ±¸ÃàÀÇ Ã¼°èÀû ÀÎ ±³À°ÀÌ ÇÊ¿äÇÒ »Ó¸¸ ¾Æ´Ï¶ó ´Ù¾çÇÑ °³¹ß ȯ°æÀ̳ª °³¹ß ¾ð¾î¿¡ µû¶ó¼­ »óÀÌÇÑ ±¸ Çö ¹æ½Ä¿¡ ÀͼúÇØÁú Çʿ䰡 ÀÖ´Ù.

  • ÀڷᱸÁ¶ÀÇ ±âº»ÀûÀÎ °³³äÀÌ ±³À° Çʿ伺¿¡ ´ëÇØ ÀÌÇØÇÑ´Ù.
  • ¼±Çü ÀڷᱸÁ¶¿Í ºñ¼±Çü ÀڷᱸÁ¶ÀÇ °³³ä ¹× Ư¡À» ÀÌÇØÇÑ´Ù.
  • ¾Ë°í¸®ÁòÀÇ ¼º´ÉÀ» ºñ±³ÇÒ ¼ö ÀÖ´Â ¹æ¹ýÀ» ½ÀµæÇÑ´Ù.
  • ¼±Çü/ºñ¼±Çü ÀڷᱸÁ¶¸¦ C ¶Ç´Â(or) C++ ¶Ç´Â(or) Java ¾ð¾î¸¦ ÀÌ¿ëÇÏ¿© ±¸ÇöÇÑ´Ù.
  • ¼±Çü/ºñ¼±Çü ÀڷᱸÁ¶¸¦ Ȱ¿ëÇÏ¿© ¼Ò±Ô¸ð ÇÁ·ÎÁ§Æ®¸¦ ¿Ï¼º ÇÑ´Ù.
  • 4. Textbooks and Recommend Papers ( Under Construction )

  • ÀڷᱸÁ¶·Ð(Data Structure with JAVA Language), ¼ÛÁÖ¼®/¼­¼ºÈÆ, »çÀÌÅØ¹Ìµð¾î, 2006.
  • Java¸¦ ÀÌ¿ëÇÑ ÀڷᱸÁ¶, ³ª¿¬¹¬ ¿Ü, È«¸ª°úÇÐÃâÆÇ»ç, 2004.
  • C¾ð¾î·Î ¹è¿ì´Â ¾Ë°í¸®Áò, ÀÌÀç±Ô, ¼¼È­ÃâÆÇ»ç, 2002.
  • ÀڷᱸÁ¶½Ç½À, ÀüÀα¹/¹Úµ¿±Ô, È«¸¦°úÇÐÃâÆÇ»ç, 2002
  • 5. Evaluations

  • Áß°£°í»ç(30%), ±â¸»°í»ç(30%), °úÁ¦¹°(30%), Ãâ¼® ¹× ±âŸ(10%)
  • Áß°£ ¶Ç´Â ±â¸»°í»ç °á½Ã : FÇÐÁ¡
  • ±âÁؽ𣠹̴Þ(°á¼®) : F ÇÐÁ¡
  • º»°­Á´ »ó´ëÆò°¡ : A ÇÐÁ¡(20%ÀÌÇÏ), BÇÐÁ¡(30%), C-FÇÐÁ¡(50%)
  • 6. Lecture Note

  • 1 Week(08/27/2007 ~ 08/31/2007) : Introduction
  • °­ÀÇÀÚ·á : Course Introduction
  • º¸Á¶ÀÚ·á : ¼ö¾÷°èȹ¼­ Âü°í
  • °úÁ¦¹° : ¼ö°­»ýÀº ´ã´ç±³¼ö(kkman@sangji.ac.kr)¿¡°Ô E-¸ÞÀÏ(Çйø, À̸§, °­Àǽð£)À» º¸³»¼¼¿ä..
  • 2 Week(09/03/2007 ~ 09/07/2007) : [ÀڷᱸÁ¶/¾Ë°í¸®Áò/¾Ë°í¸®Áò ¼º´ÉÆò°¡]
  • °­ÀÇÀÚ·á : Chap. 1 : ÀڷᱸÁ¶
  • ½Ç½ÀÀÚ·á : ¾øÀ½.
  • Homework(1) : Homework1 --> Closed
  • 3 Week(09/10/2007 ~ 09/14/2007) : Array
  • °­ÀÇÀÚ·á : Chap. 3 : ¹è¿­(array)
  • º¸Á¶ÀÚ·á(1) : Chap. 3 : ±¸Á¶Ã¼&Æ÷ÀÎÅÍ
  • º¸Á¶ÀÚ·á(2) : Chap. 3 : ±³Àç¼Ò½º
  • Homework(2) : Homework2 --> Closed
  • Homework Sample(2) Solution(C) : Sample Solution in C
  • Homework Sample(2) Solution(C++) : Sample Solution in C++
  • Homework Sample(2) Solution(Java) : Sample Solution in Java
  • Homework Sample(2) Solution(etc) : Evaluation sample
  • 4 Week(09/17/2007 ~ 09/21/2007) : Linkrd list
  • °­ÀÇÀÚ·á : Chap 4. : ¿¬°á ¸®½ºÆ®
  • ½Ç½ÀÀÚ·á : ±³Àç 4Àå ¼Ò½º ¾ÐÃà(±èÁ¾¹«) in Java.
  • °úÁ¦¹° : Homework3
  • Homework#3 Sample Solution(in C) : Sample Solution in C(±è´Ù¿µ)
  • Homework#3 Sample Solution(in C) : Sample Solution in C(±èÁ¾¹«)
  • 5 Week(09/24/2007 ~ 09/28/2007) : Stack
  • °­ÀÇÀÚ·á : Chap 5. : Stack
  • ½Ç½ÀÀÚ·á : ±³Àç 5Àå ¼Ò½º ¾ÐÃà(±èÁ¾¹«) in Java.
  • °úÁ¦¹° : Homework4 <-- New
  • 9¿ù 24ÀÏ(¿ù)/25ÀÏ(È­), Ãß¼® ¿¬ÈÞ °ü°è·Î ÈÞ°­ÇÕ´Ï´Ù.
  • 6 Week(10/01/2007 ~ 10/05/2007 ) : Queue
  • °­ÀÇÀÚ·á : Chap 5. Queue
  • Q&A lists: ±³Àç 5Àå ¼Ò½º ¾ÐÃà(±èÁ¾¹«)in Java.
  • °úÁ¦¹° : Homework5 <-- New
  • 7 Week(10/08/2007 ~ 10/12/2007 ) : Ž»ö(Search)-1
  • °­ÀÇÀÚ·á : Chap. 6 : Search
  • ½Ç½ÀÀÚ·á : ±³Àç 6Àå ¼Ò½º ¾ÐÃà(±èÁ¾¹«) in Java.
  • °úÁ¦¹° : ...Homework#6
  • 8 Week : Áß°£°í»ç
  • 2007³â 10¿ù 18ÀÏ(¸ñ) 2, 3±³½Ã; ¹ÎÁÖ°ü-101(01ºÐ¹Ý), ¹ÎÁÖ°ü-102(02ºÐ¹Ý)
  • Áß°£°í»ç °á°ú¸¦ È®ÀÎÇÒ ¼ö ÀÖ½À´Ï´Ù.(¿¬±¸½Ç)
  • 9 Week(10/22/2007 ~ 10/26/2007 ) : Á¤·Ä(Sorting)-1
  • °­ÀÇÀÚ·á : Chap. 7 : Sorting(1)
  • ½Ç½ÀÀÚ·á : ±³Àç 7Àå ¼Ò½º ¾ÐÃà(±èÁ¾¹«) in Java.
  • °úÁ¦¹° : Homework#7
  • °úÁ¦¹° : Sort Input Data
  • 10 Week(10/29/2007 ~ 11/02/2007 ) : Á¤·Ä(Sorting)-2
  • °­ÀÇÀÚ·á : Chap. 8 : Sorting(2)
  • ½Ç½ÀÀÚ·á : ...
  • °úÁ¦¹° : Homework#8
  • °úÁ¦¹° : Sort Input Data
  • 11 Week(11/05/2007 ~ 11/09/2007 ) : Àç±Í(recursive, ¼øÈ¯(resursion)
  • °­ÀÇÀÚ·á : Chap. 9 : ¼øÈ¯(recursion)
  • ½Ç½ÀÀÚ·á : None
  • 12 Week(11/12/2007 ~ 11/16/2007 ) : Æ®¸®(Tree)-1
  • °­ÀÇÀÚ·á : Chap. 10 : Tree-1
  • ½Ç½ÀÀÚ·á : Homework#9 <-- NEW
  • 13 Week(11/19/2007 ~ 11/23/2007 ) : Æ®¸®(Tree)-2
  • °­ÀÇÀÚ·á : Chap. 11 : Tree-2
  • Âü°íÀÚ·á : AVL Tree
  • ½Ç½ÀÀÚ·á : Homework#9 <-- NEW
  • 14 Week(11/26/2007 ~ 11/30/2007 ) : ÇØ½¬ ¹× Èü(Hash and Heap)
  • °­ÀÇÀÚ·á : Chap. 12 Heap & Chap 13. Heap
  • Âü°íÀÚ·á : Hash Âü°í ÀÚ·á(Ãâ·Â)
  • Âü°íÀÚ·á : Heap Âü°í ÀÚ·á(Ãâ·Â)
  • °úÁ¦¹° : Homework#10 <-- NEW
  • 15 Week(12/03/2007 ~ 12/07/2007 ) : ±×·¡ÇÁ(Graph)
  • °­ÀÇÀÚ·á : Chap. 14, 15 : Graph - ÃÖÁ¾
  • Âü°íÀÚ·á : Graph Âü°í ÀÚ·á(Ãâ·Â)...
  • °úÁ¦¹° : Homework#11 <-- NEW
  • 16 Week(12/10/2007 ~ 12/14/2007 ) : ±â¸»°í»ç, Á¾°­
  • ±â¸»°í»ç :
  • ±â¸» °úÁ¦¹° Á¦Ãâ :
  • ¼ºÀû °ø°í
  • ÃÖÁ¾ ¼ºÀû Àü»ê ÀÔ·Â : 2007³â 12¿ù 21ÀÏ(±Ý), ¼ºÀû ¹®ÀÇ/º¯°æ ºÒ°¡)
  • 7. Useful Links


    Last updated by KO Kwangman at 2:00pm on Nov-14, 2007.