Introduce shortest path algorithms(Korean)Wonjae Kim
Introduce shortest path algorithms(Korean) in Hongik University.
1. Bellman-Ford
2. Dijkstra
3. Floyd-Warshall
Extra) A*
In this slide, Source of graph images is stackexchange
1. http://cs.stackexchange.com/questions/18138/dijkstra-algorithm-vs-breadth-first-search-for-shortest-path-in-graph
2. http://cs.stackexchange.com/questions/14248/what-is-the-significance-of-negative-weight-edges-in-a-graph
If it is a problem or can be, Let me know it ( wonjaek36@gmail.com )
Introduce shortest path algorithms(Korean)Wonjae Kim
Introduce shortest path algorithms(Korean) in Hongik University.
1. Bellman-Ford
2. Dijkstra
3. Floyd-Warshall
Extra) A*
In this slide, Source of graph images is stackexchange
1. http://cs.stackexchange.com/questions/18138/dijkstra-algorithm-vs-breadth-first-search-for-shortest-path-in-graph
2. http://cs.stackexchange.com/questions/14248/what-is-the-significance-of-negative-weight-edges-in-a-graph
If it is a problem or can be, Let me know it ( wonjaek36@gmail.com )
1. 2015-1 통신공학 중간 고사(100)
Communication Engineering
Date: 2015-04-22
1. 다음과 같은 신호(Signal)의 특성을 계산하라. (40)
① 에너지(Energy) (10)
204162)4()(
1
0
2
0
1
22
dtdtdttgEg
② 전력(Power) (10)
에너지는 유한하고 주기(T)는 무한대이므로 전력은 0이다.
③ g(t)를 단위 계단 함수(Unit Step Function)로 표현(10)
)1(2)(6)1(4)( tutututg
④ g(t)의 미분(10)
)1(2)(6)1(4)( ttttg
dt
d
2. 다음과 같은 주기 신호의 푸리에 급수(Fourier Series)를 구하라. (40)
① sin과 cos을 이용한 푸리에 급수 (20)