4190.210 Principles of Programming

Lecture Movies (Fall 2012)

À̱¤±Ù Kwangkeun Yi
¼ÒÇÁÆ®¿þ¾î¹«°áÁ¡ ¿¬±¸¼¾ÅÍ/ ÇÁ·Î±×·¡¹Ö ¿¬±¸½Ç /CSE/ Seoul National University

¸ñÇ¥ Objectives

  

  • ´É·Â. ÀÌ °­ÀÇ´Â ÇлýµéÀÌ ÇÁ·Î±×·¥ ÀÛ¼ºÀÇ ±âº» ¿ø¸®, ±¸¼º ¿ä¼Ò, ÇÁ·Î±×·¡¹Ö ¹ÌÇеîÀ» ½ÀµæÇÏ°Ô ÇÔÀ¸·Î½á, ¼ÒÇÁÆ®¿þ¾î ½Ã½ºÅÛÀÌ µå·¯³»´Â º¹À⼺À» ¼Õ½±°Ô ´Ù·ê ¼ö ÀÖ´Â ´É·Â°ú ÀڽۨÀ» ÀÍÈ÷°Ô ÇÑ´Ù.

  • º¸Æí. ÀÌ °­ÀÇ¿¡¼­ ÀÍÈù ³»¿ëÀº ÀåÂ÷ ¾î¶² ¾ð¾î¸¦ »ç¿ëÇÏ¿© ¼ÒÇÁÆ®¿þ¾î¸¦ ÀÛ¼ºÇÏ´õ¶óµµ À¯¿ëÇϰԵȴÙ. ÀÌ °­ÀÇ´Â Çлýµé¿¡°Ô ƯÁ¤ ¾ð¾î¸¦ °¡¸£Ä¡´Â °ú¸ñ(training)ÀÌ ¾Æ´Ï´Ù. ¸í·áÇÏ°í È¿°úÀûÀ¸·Î »ý°¢ÇÒ ¼ö ÀÖ°Ô ÇÏ´Â ÇÁ·Î±×·¡¹Ö ±³À°(education)À» ¸ñÇ¥·ÎÇÑ´Ù.

  • ´«³ôÀÌ. ÀÌ °­ÀÇ´Â ÇÁ·Î±×·¡¹Ö ±â¼úÀÇ ÇöÀç»Ó ¾Æ´Ï¶ó ¾ÕÀ¸·Î ³ªÅ¸³¯ ¹Ì·¡¿¡ ´ëÇÑ ´«³ôÀ̸¦ °®Ãßµµ·Ï ÇÑ´Ù. ÇÁ·Î±×·¡¹ÖÀº Á¡Á¡ »óÀ§ÀÇ ·¹º§¿¡¼­ ÀÌ·ç¾îÁö°í ÀÖ´Ù. ÇÁ·Î±×·¥ÀÌ ±â°è¸¦ »ç¿ëÇϱâ À§ÇÑ µµ±¸¶ó´Â ½Ã°¢°ú ÇÔ²² ±â°è°¡ ÇÁ·Î±×·¥ ½ÇÇàÀ» À§ÇÑ µµ±¸¶ó´Â ½Ã°¢À» °®Ãßµµ·Ï ÇÑ´Ù.

´Ù·ç´Â ÅäÇÈÀº

  • ±âº»ºÎÇ°°ú Á¶ÇÕ(elements & compound)
  • Àç±Í¿Í ¹Ýº¹(recursion & iteration)
  • ¼Ó³»¿ë °¨Ãß±â(procedural & data abstraction)
  • °èÃþ±¸Á¶·Î ¼Ó³»¿ë °¨Ãß±â(modularity & hierarchy)
  • ¸Â´Â ÇÁ·Î±×·¥ÀÎÁö È®ÀÎÇϱâ(program proof)
  • ŸÀÔÀ¸·Î Á¤¸®+ÀÌÇØÇϱâ(types & typeful programming)
  • °ªÁß½ÉÀÇ ÇÁ·Î±×·¡¹Ö(values & applicative programming)
  • ¹°°ÇÁß½ÉÀÇ ÇÁ·Î±×·¡¹Ö(objects & imperative programming)
  • ¿¹¿Ü»óȲ °ü¸®(exceptions & advanced control)

Part 0

Part 1

Part 2

Part 3

Part 4

 

© Copyright 2012, À̱¤±Ù Kwangkeun Yi