알고리즘응용

건국대학교
김원준

페이스북 트위터 카카오톡 네이버밴드 링크복사

주제분류

공학 >컴퓨터ㆍ통신 >컴퓨터공학
강의학기

2016년 1학기

조회수

7,927
평점

3/5.0 (2)

강의계획서

Study for computer programming technique, basic data structure, stack, queue, linked list, tree, graph, and apply algorithm analysis approach, Greedy method, divide and conquer, dynamic programming, searching and parallel algorithm, NP-problems, etc., to improve practical ability through implementing various application programming.

수강안내 및 수강신청
※ 수강확인증 발급을 위해서는 수강신청이 필요합니다

Revisit C programming

차시별 강의

1.	Revisit C programming	Revisit : pointers and arrays (the heart of the C programming)
2.	Data structure (1)	Linked list and its variants
3.	Data structure (2)	Stack and queue with the linked list
4.	Data structure (3)	Understanding tree structures and its applications
5.	Sorting algorithms	Practice with various sorting algorithms (insertion, bubble, quick, and so on)
6.	Searching algorithms (1)	Introduction to searching algorithms (sequential and binary searching)
7.	Searching algorithms (2)	Tree-based searching algorithms (binary tree, red-black tree, etc.)
8.	Algorithm in computer vision	computer vision; Object detection-HOGgles, Demo video:Hand tracking