알고리즘 응용
- 건국대학교
- 김원준
페이스북
트위터
카카오톡
네이버밴드
링크복사
-
- 주제분류
- 공학 >전기ㆍ전자 >전자공학
-
- 강의학기
- 2017년 1학기
-
- 조회수
- 4,640
-
- 평점
- 1/5.0 (2)
- 강의계획서
- 강의계획서
In this class, we learn about a variety of skills, called Algorithm, to resolve a given task in an efficient way. An algorithm is any well-defined computational procedure that takes some values (or a set of values) as input and produces some values (or a set of values) as output.
The algorithm is thus a sequence of computational steps that transform the input into the output. Therefore, it has become an essential technique in the smart-aware field. Students may think about designing and analyzing such algorithms based on C programming in this class.
The algorithm is thus a sequence of computational steps that transform the input into the output. Therefore, it has become an essential technique in the smart-aware field. Students may think about designing and analyzing such algorithms based on C programming in this class.
- 수강안내 및 수강신청
- ※ 수강확인증 발급을 위해서는 수강신청이 필요합니다
Revisit C programming
차시별 강의
| 1. | |
Revisit C programming | Revisit : pointers and arrays (the heart of the C programming) |  |
| 2. | |
Revisit C programming | Revisit : pointers and arrays (the heart of the C programming) | |
| 3. | |
Revisit C programming | Revisit : pointers and arrays (the heart of the C programming) | |
| 4. | |
Data structure (1) | Linked list: simple | |
| 5. | |
Data structure (1) | Linked List: Circular, Doubly | |
| 6. | |
Data structure (1) | Linked list and its variants | |
| 7. | |
Data structure (2) | Stack and queue with the linked list | |
| 8. | |
Data structure (2) | Stack and queue with the linked list | |
| 9. | |
Data structure (3) | Understanding tree structures and its applications | |
| 10. | |
Recursion (1) | Concept of recursion functions and its applications | |
| 11. | |
Recursion (2) | Non-recursive, application | |
연관 자료
