ÀڷᱸÁ¶(Data Structure)
µ¥ÀÌÅÍ ¹× µ¥ÀÌÅÍ »çÀÌÀÇ °ü°è¸¦ ±â¾ïÀåÄ¡¿¡ Ç¥Çö, ÀúÀåÇÏ´Â ¹æ¹ýÀ» ¿¬±¸ÇÏ´Â Çй®À¸·Î, ÀڷᱸÁ¶ÀÇ ADT(abstract data type)¸¦ Á¤ÀÇÇÏ°í À̸¦ ±¸ÇöÇϱâ À§ÇÑ ¾Ë°í¸®ÁòÀ» ¼ö¸³, Æò°¡ÇÑ´Ù. ÀڷᱸÁ¶´Â array, linked list, stack, queue, graph, multi- linked list µîÀ» ´Ù·ç¸ç, dynamic memory management ±â¹ý°ú sort/merge µîÀÇ ¾Ë°í¸®Áò¿¡ ´ëÇÏ¿© ¿¬±¸ÇÑ´Ù.
¹®Á¦ÇØ°á±â¹ý(Problem Solving)
ÄÄÇ»ÅÍ°øÇаú °ü·ÃµÈ ¹®Á¦µéÀ» âÀÇÀûÀ¸·Î ÇØ°áÇÏ´Â ¹æ¹ýÀ» ÇнÀÇÏ°í ÇÁ·Î±×·¥ °³¹ß ´É·Â°ú ¾ÆÀ̵ð¾î ¹ßÇ¥ ¹× Åä·Ð ±â¼úÀ» ½ÀµæÇÑ´Ù. º» °ÀÇ¿¡¼´Â C, C++ µîÀÇ °í±Þ ÇÁ·Î±×·¡¹Ö ¾ð¾î¸¦ ÀÌ¿ëÇÏ¿© ´Ù¾çÇÑ ÇÔ¼ö¿Í ±âÃÊÀûÀÎ ÀڷᱸÁ¶, ±âÃÊÀûÀÎ ¾Ë°í¸®Áò ¼³°è ±â¹ý µîÀ» ÇнÀÇÏ°í È¿À²ÀûÀÎ ÇÁ·Î±×·¡¹Ö ±â¼ú ´É·ÂÀ» °³¹ßÇÑ´Ù.
¾Ë°í¸®Áò(Algorithm)
ÄÄÇ»ÅÍ ÇÁ·Î±×·¡¹Ö¿¡ °ü·ÃµÈ ¿©·¯ °¡Áö ¾Ë°í¸®ÁòÀ» ºÐ¼®ÇÏ°í ÀÛ¼ºÇϸç, À̵éÀÇ Complexity, Efficiency, Compatibility µîÀ» ´Ù·é´Ù.
°è»êÀÌ·Ð(Theory of Computation)
°í±Þ ÀڷᱸÁ¶ ¹× ÀÀ¿ë ¾Ë°í¸®Áòµé°ú NP-¿ÏÀü ¹®Á¦µé¿¡ ´ëÇÏ¿© ´Ù·é´Ù.