paradigm programming
TRANSCRIPT
Paradi gm_of _Programmi ng
서지혜
DO
Paradi gm of Programmi ng
Paradi gm of Programmi ng
사람들의 견해나 사고를 근본적으로 규정하고 있는 테두리
- ctrl + c & ctrl + v from Wikipedia: 패러다임
Doi ng i s Best 1
가장 편한 언어를 고릅니다 .
Doi ng i s Best 1
구구단 풀기 합니다 .단 종이랑 펜으로
Doi ng i s Best 1
시간 15 분
Doi ng i s Best 1
옆 친구랑 바꾸세요
Doi ng i s Best 1
인간 컴파일러가 되어봅니다 .
Doi ng i s Best 1
구현 기법은 다음 중 무엇 ?1.반복문2.재귀3. Li st Al l
Doi ng i s Best 2
구구단 다시 한번 더이번엔 아까와 다른 기법으로
Doi ng i s Best 2
시간 15 분
Doi ng i s Best 2
옆 친구랑 바꾸세요인간 컴파일러 한번 더
That i s . . .
이미 패러다임을 경험했다
Easy Paradi gms
• Imperat i ve
• OOP
• DDP( Dat a Dri ven Programmi ng)
• AOP( Aspect Ori ent ed
Programmi ng)
• EDP( Event Dri ven Programmi ng)
• Di st ri but ed Programmi ng
Easy Paradi gms
• Declarative Programming
• State Machine
• Functional Programming
• Generic Programming
• Communicating Sequential
Programming
생각하는 도구로써의 프로그래밍
• 생각은 도구를 지배한다
“Paradi gm” of Programmi ng
생각하는 도구로써의 프로그래밍
• 도구가 생각을 지배한다
Paradi gm of Programmi ng
(* 2 (cos 0) (+ 4 6))
Li ngui st i c rel at i vi t y
Paradi gm of Programmi ng
f or i i n ( 2 . . 9) dof or j i n ( 1 . . 9) do
pr i nt i * j end
put send
Paradi gm of Programmi ng
(do ([i 1 (+ i 1)]) [(= i 10)] (do ([j 1 (+ j 1)]) [(= j 10)] (printf "~ax~a=~a~n" i j (* i j))))
Paradi gm of Programmi ng
Paradi gm of Programmi ng
package arabiannight.tistory.com.java.test; public class GugudanClass { public static void main(String[] args) { for(int i = 1; i <= 9; i++) { for(int j=1; j <= 9; j++) { System.out.println(i + " * " + j + " = " + i * j); } System.out.println(); } }}
Paradi gm of Programmi ng
Paradi gm of Programmi ng
publ i c c l ass St r i ngCompar at or i mpl ement s Compar at or { publ i c i nt compar e( Number a, Number b) {
St r i ng x = a. t oSt r i ng( ) ;St r i ng y = b. t oSt r i ng( ) ;i f ( x. compar eTo( y) < 0) ret urn - 1; el se i f ( x. compar eTo( y) > 0) ret urn 1; el se ret urn 0; }
}
Paradi gm of Programmi ng
publ i c c l ass Rever seSt r i ngCompar at or i mpl ement s Compar at or { publ i c i nt compar e( Number a, Number b) {
St r i ng x = a. t oSt r i ng( ) ;St r i ng y = b. t oSt r i ng( ) ;i f ( x. compar eTo( y) > 0) ret urn - 1; el se i f ( x. compar eTo( y) < 0) ret urn 1; el se ret urn 0; }
}
Tree Traversal
2
3
4
5
1
• Tree 를 순회하는 방법• DFS : 1,2,3,4,5• BFS : 1,2,4,3,5
Paradi gm of Programmi ng
http://stackoverflow.com/questions/22873/language-books-
tutorials-for-popular-languages
Paradi gm of Programmi ng
I . ht t p: / / wi k i . zer opage. or g/ wi ki . php/ ToyProbl ems
I I . ht t p: / / en. wi k i pedi a. or g/ wi ki / Li st _of _mul t i -paradi gm_programmi ng_l anguages
III.http://en.wikipedia.org/wiki/List_of_programming_languages_by_type
END