Go to login Go to sub menu Go to text
  • Type MOOC course
  • Period Always open
  • hr Study freely
  • Course approval method Automatic approval

Instructor Introduction

  • 문일철

    KAIST 산업 및 시스템 공학과 교수(2011.9~ )

Lecture plan

★강의 수강
  1. Chapter 0: 강좌 시작 전 꼭 확인해 주세요!
    1. 수료기준, 게시판 등 강좌 학습 방법 소개
  2. Chapter 1 Priority Queue and Heap
    1. Priority Queue
    1. Implementation & performance of Priority Queue
    1. Balanced Tree
    1. Binary Heap for Priority Queue
    1. Reference Structure of Binary Heap
    1. Insert Operation of Binary Heap
    1. Delete Operation of Binary Heap
    1. Complexity of Priority Queue and Heap Sort
  3. Chapter 2 Application 2 : Genetic Algorithm
    1. Difficult Problem
    1. Genetic Algorithm
    1. Traveling Salesman Problem
    1. Terminology and Structure of Genetic Algorithm
    1. Encoding
    1. Selection
    1. Crossover
    1. Mutation
    1. Substitution and Execution
  4. Chapter 3 Sorting
    1. O(N^2) Sorting
    1. Merge Sort
    1. Heap Sort
    1. Quick Sort
    1. Counting Sort
    1. Radix Sort
  5. Chapter 4 Hashing
    1. Limit of Divide and Conquer
    1. Hash Table
    1. Hash Function
    1. Examples of Hash Function
    1. Collision Resolution of Hashing
    1. Deletion in Hash Table
    1. Managing the Size of Hash Table
  6. Chapter 5 Graph and Dijkstra's algorithm
    1. Graph
    1. Representation of Graph
    1. Traversing Problem - DFS and BFS
    1. Shortest Path Problem - Dijkstra's Algorithm (1)
    1. Shortest Path Problem - Dijkstra's Algorithm (2)
    1. Minimum Spanning Tree Problem - Prim's Algorithm
  7. Chapter 6 Application 3 : Network Analysis
    1. Social Network
    1. Centrality
    1. K-Clique and Newman Clustering
    1. Visualization of Network Structure
  8. ★강의 수강 후 의견을 부탁드리겠습니다.★
    1. 강의에 대한 별점을 매겨주세요. 여러분의 의견이 많은 도움이 됩니다.

Additional Info

본 강좌는 Python3 를 기반으로 진행되는 강좌 입니다.
기초적인 내용부터 시작하기 때문에, 누구나 수강할 수 있는 강좌입니다.