ÀڷᱸÁ¶ 2011 (1,2¹Ý°øÅë)
Ȩ ] [ Schedule ] Quiz Ds1 ] Quiz Ds2 ]

¡¡

Week Topic Class Material
1 Class Overview ¡¡
2 C Review
  • ÄÄÇ»Åͱ¸Á¶: CPU±¸Á¶(Á¦¾îºÎ/ALU/·¹Áö½ºÅÍ), ¸Þ¸ð¸®±¸Á¶(ÁÖ¼Ò/µ¥ÀÌÅÍ)

  • ÄÄÇ»ÅÍÀÇ ±âº» ±â´É: ¿¬»ê, ¸Þ¸ð¸®Á¢±Ù, ¼ø¼­Á¦¾î

  • ÄÄÇ»ÅÍÇÁ·Î±×·¥ÀÇ ±â´É: ÄÄÇ»Åͱ⺻±â´É¼öÇà, ¿ä¾àÈ­(¶Ç´Â Ãß»óÈ­, ¿©·¯ °³¸¦ ÇÕÃÄ À̸§À» ºÙÀÏ ¼ö ÀÖ´Â ±â´É, ÇÔ¼ö/±¸Á¶Ã¼)

¡¡

¡¡

  • ÇÁ·Î±×·¥ ÀÛ¼º ¼ø¼­

  1. WorkspaceÀÛ¼º(º»ÀÎ Çйø)

  2. Project »ý¼º (°­Àdz¯Â¥)

  3. source file »ý¼º(º»ÀÎ ¼º)

  4. build

  5. execute

  • °úÁ¦ Á¦Ãâ¹æ¹ý

  1. debug Æú´õ »èÁ¦

  2. workspace Àüü Æú´õ ¾ÐÃâ

  3. À̸ÞÀÏ·Î Á¦Ãâ. ¸ÞÀÏ Á¦¸ñÀº Çйø

3 Ãß¼®(ÈÞ°­) ¡¡
4 C Review
5 C Review ¡¡
6 Selection Sort ¡¡

Selection Sort:

Divide and Conquer: ¾î·Á¿î ¹®Á¦¸¦ ¿©·¯ °³ÀÇ ÀÛ°í ½¬¿î ¹®Á¦·Î ³ª´©¾î¼­ °¢°¢ÀÇ ÀÛÀº ¹®Á¦¸¦ ÇØ°áÇÏ¿© °á±¹ ¾î·Á¿î ¹®Á¦¸¦ ÇØ°áÇÏ´Â ¹æ¹ý

7 Selection Sort ¡¡
  • Time Measuring: clock(),
  • Ç¥ÁضóÀ̺귯¸® »ç¿ë¹ý(http://www.cplusplus.com/reference/)
  • Debugger »ç¿ë¹ý
  • Çì´õÆÄÀÏ »ý¼º¹æ¹ý
  • ¿©·¯ ¼Ò½ºÆÄÀÏ·Î ÇÁ·Î±×·¥ ºÐÇÒ ¹æ¹ý
8 Stack using array ¡¡
  • Stack:
    • ÀڷḦ ÀúÀåÇÒ ¼ö ÀÖ´Â °ø°£ (Container)
    • °¡Àå ÃÖ±Ù ÀúÀåÇÑ ÀÚ·á°¡ ³ª¿Â´Ù
    • ½ºÅÿ¬»ê: push(), pop(), isEmpty, isFull()

¡¡

9 Stack using Linked List ¡¡
  • Lifetime of variables (º¯¼ö°ø°£ÀÇ »ý¼º°ú ¼Ò¸ê)
  • const: ¸Å°³º¯¼öÀÇ °ªÀÌ ÇÔ¼ö ³»¿¡¼­ º¯ÇÏÁö ¾ÊÀ½.

¡¡

  • Linked List
  • Review: ±¸Á¶Ã¼, call-by-pointer
¡¡
10 Stack using Linked List ¡¡
  • ¸®ºä: Æ÷ÀÎÅÍ, ±¸Á¶Ã¼, call-by-value
  • Æ÷ÀÎÅÍÀÇ Æ÷ÀÎÅÍ

¡¡

11 Abstract Data Type(ADT) Def) Data Type is a collection of
  1. objects and
  2. operations that act on those objects

Example) data type int

  1. objects: (INT_MIN, ..., -1, 0, 1, 2, ... , INT_MAX)
  2. operations: +, -, *, /, %, etc.

Def) An abstract data type (ADT) is a data type that is organized in such a way that

  1. the specification of the objects separated from the representations
  2. the specification of the operations on the objects is separated from the the implementation of the operations.

Á¤ÀÇ) "µ¥ÀÌÅÍŸÀÔ"Àº ´ÙÀ½ µÎ °¡Áö·Î ±¸¼ºµÈ´Ù.

  1. °´Ã¼µéÀÇ ÁýÇÕ
  2. °´Ã¼¸¦ ´ë»óÀ¸·Î ÇÏ´Â ¿¬»êµéÀÇ ÁýÇÕ

µ¥ÀÌÅÍ Å¸ÀÔÀÇ ¿¹) µ¥ÀÌÅÍŸÀÔ int

  1. °´Ã¼µéÀÇ ÁýÇÕ: {INT_MIN, ..., -1, 0, 1, 2, ... , INT_MAX}
  2. ¿¬»êµéÀÇ ÁýÇÕ: {+, -, *, /, %, ==, &&, ...}

Def) "¿ä¾àµ¥ÀÌÅÍŸÀÔ" (ADT) Àº ´ÙÀ½°ú °°Àº µ¥ÀÌÅÍŸÀÔÀÌ´Ù.

  1. °´Ã¼¿¡ ´ëÇÑ ¼³¸íÀÌ Ç¥Çö¹æ¹ý°ú ºÐ¸®µÊ
  2. ¿¬»ê¿¡ ´ëÇÑ ¼³¸íÀÌ ±¸Çö¹æ¹ý°ú ºÐ¸®µÊ
¡¡
12 Test
13 Queue ¡¡
14 Maze Problem Handouts
15 Tree
  • Definition of Tree
  • Binary Tree, ADT, propterties, representation
  • Infix/postfix/prefix operation
  • Tree Traversal

PPT 11, 12, 13 in Datastructure-HSAF.zip

16 Final Exam
¸Ç À§·Î À̵¿