Syllabus
Ȩ ] [ Syllabus ] Schedule ] Archive ] HW ] HW/Test Results ]

¡¡

30030(01): ÀڷᱸÁ¶ (Data Structure) 2009/Fall

 °­Àǽð£: ¼ö2,3 ¸ñ7 ; °­ÀǽÇ: 19-B108

Professor
Prerequisite Knowledge
  • Any programming experience
  • Object-Oriented Programming
Course Description A data structure consists of a base storage method (e.g., an array) and one or more algorithms that are used to access or modify that data. To gain insight into the data structure, students will be required to do programming projects in Java. 
Course Objective Learning basic internal properties of data structures.
Learning how to use data structures.
Course Outline
  1. Java fundamentals
  2. Using Eclipse (Java IDE)
  3. Abstract Data Type (ADT)
  4. Recursion
  5. List
  6. Stack, Queue, Table, Tree, Graph
Text Text: Collins, Data Structure and the Java Collections Framework, 2nd Edition, McGraw-Hill, 2005 (http://www.mhhe.com/collins)
Reference To Be announced

ÀÎÅÍ³Ý ÀÚ·á

¼ºÀû Æò°¡ ¼ö½Ã ÄûÁî(80%), ¼ö½Ã°úÁ¦(20%) 
°øÇÐÀÎÁõ PO1.(Áö½ÄÀÀ¿ë)¼öÇÐ, ±âÃʰúÇÐ, °øÇÐÀÇ Áö½Ä°ú Á¤º¸±â¼úÀ» ÀÀ¿ëÇÒ ¼ö ÀÖ´Â ´É·Â

PO2.(ºÐ¼®½ÇÇè)ÀڷḦ ÀÌÇØÇÏ°í ºÐ¼®ÇÒ ¼ö ÀÖ´Â ´É·Â ¹× ½ÇÇèÀ» °èȹÇÏ°í ¼öÇàÇÒ ¼ö ÀÖ´Â ´É·Â

PO3.(¼³°è´É·Â)Çö½ÇÀû Á¦ÇÑÁ¶°ÇÀ» ¹Ý¿µÇÏ¿© ½Ã½ºÅÛ, ¿ä¼Ò, °øÁ¤À» ¼³°èÇÒ ¼ö ÀÖ´Â ´É·Â

PO4.(¹®Á¦Çذá)°øÇÐ ¹®Á¦µéÀ» ÀνÄÇϸç, À̸¦ °ø½ÄÈ­Çϰí ÇØ°áÇÒ ¼ö ÀÖ´Â ´É·Â

PO5.(½Ç¹«´É·Â)°øÇÐ ½Ç¹«¿¡ ÇÊ¿äÇÑ ±â¼ú, ¹æ¹ý, µµ±¸µéÀ» »ç¿ëÇÒ ¼ö ÀÖ´Â ´É·Â

¡¡

¡¡

¡¡
¡¡
¸Ç À§·Î À̵¿
¡¡