Data Structure
01635(01, 02), Fall 2011

1. Class Informations

  • ±³°ú¸ñ¸í : ÀڷᱸÁ¶(Data Structure)
  • À̼ö±¸ºÐ : Àü°ø¼±ÅÃ(01635-01/02)
  • °­Àǽð£ : Th6 F2,3/T4,5F1
  • ¿¬¶ôó : kkman@sangji.ac.kr, (Tel)033-730-0486
  • ȨÆäÀÌÁö : http://compiler.sangji.ac.kr
  • 2. Syllabus

    3. Course Description

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

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

  • C ¾ð¾î·Î ½±°Ô ¹è¿ì´Â ÀڷᱸÁ¶(°³Á¤ÆÇ), õÀα¹, »ý¸ªÃâÆÇ»ç, 2009.
  • 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: Course Overview
  • °­ÀÇÀÚ·á : Course Overview
  • 2 Week: Sep-05-2011 to Sep-09-2011
  • °­ÀÇÀÚ·á : Data Structures & Algorithms
  • 3 Week: Array, Structure, and Pointer
  • °­ÀÇÀÚ·á : Array, Structure, and Pointer
  • Homework #1 : Homework #1
  • Homework #2 : Homework #2
  • Homework #3 : Homework #3
  • 4 Week: Linked list(1)
  • °­ÀÇÀÚ·á : Linked list
  • Homework #4 : Homework #4
  • Homework #5 : Homework #5
  • 5 Week: Linked list(2)
  • °­ÀÇÀÚ·á : Linked list
  • Homework #4 : Homework #4
  • Homework #5 : Homework #5
  • 6 Week: Linked list(3)
  • °­ÀÇÀÚ·á : Linked list
  • Homework #4 : Homework #4
  • Homework #5 : Homework #5
  • 7 Week: Tree(1)
  • °­ÀÇÀÚ·á : ...
  • Assignment # : ...
  • 8 Week : Áß°£°í»ç : 2011³â 10¿ù 21ÀÏ(±Ý) ¿ÀÀü 10:30.
  • 9 Week: Stack, Queue
  • °­ÀÇÀÚ·á : Stack, Queue
  • Homework #6 : Homework #6
  • Homework #7 : Homework #7
  • 10 Week: Tree
  • °­ÀÇÀÚ·á : Tree
  • Assignment #8 : Homework #8
  • 11 Week: Heap(Prioity Queue)
  • °­ÀÇÀÚ·á : Heap
  • Assignment #8 : Homework #8
  • 12 Week: Sorting(1)
  • °­ÀÇÀÚ·á : Sorting(1)
  • Assignment #9 : Homework #9
  • 13 Week: Sorting(2)
  • °­ÀÇÀÚ·á : Sorting(2)
  • Assignment #9 : Homework #9
  • 14 Week: Graph(1)
  • °­ÀÇÀÚ·á : Graph(1)
  • Assignment #10 : Homeworkk #10
  • 15 Week: Graph(2)
  • °­ÀÇÀÚ·á : Graph(2)
  • Assignment #10 : Homework #10
  • 16 Week: ±â¸»°í»ç, ...
  • 7. Useful Links

  • Âü°íµµ¼­: ⺴¸ð, ¿ì±Õ, Palying with C, ±³º¸¹®°í, 2007
  • GCC Windows version

  • Last updated by KO Kwangman at 2:00pm on Sep-01, 2008.