2015년 10월 22일 목요일

[OOP] 자바 튜터링을 받을 학생 4명을 모집합니다. (매진)

자바 튜터링 2기 학생을 모집합니다. (1기는 완료됨) ^^

[대상]

- 현재 내 자바 수업 듣는 학생들 (분반 상관없음)

[혜택]

- 대학원생들이 자바 숙제와 관련된 도움을 받을 수 있습니다.
  (예를 들어 오목 게임 GUI 만들기 등과 같은 숙제에 소스 제공 및 프로그래밍 테크닉
 에 대한 도움을 카톡 혹은 연구실에 오면 직접 친절하게 가르쳐 드립니다.)

- 방학 기간 동안 안드로이드 기반 스마트 폰 프로그래밍에 대한  튜터링도 해줍니다: 해당 대학원생들은 산업체에서 많은 프로그래밍 경험을 한 실력이 뛰어나고, 성격도 좋아요

[제출 서류]

재학 증명서와 성적 증명서


=======================================================





2015년 10월 14일 수요일

(Updated on Oct. 14) [OOP - Take home midterm exam] Due: Oct. 16, 2015

[Note] Develop your own algorithm!! Do not use the algorithm shown in the document as attached here!!
[Rule]
Only close 3 X 3 (Sam-Sam) is not allowed, such as
( ooo
    o
    o   )
Open 3 X 3 is allowed, such as
(ooNoStoneo
                o
                o)
If you have already implemented the rule that open 3 X 3 is not allowed, that's O.K. Thus, you don't have to modify your OMOK game.)
4 X 3 (Sa-Sam) is allowed
4 X 4 (Sa Sa) is allowed

The rule is simple, be the first to get an unbroken row of only five pieces horizontally, vertically or diagonally to win the game .


(An unbroken of more than five pieces is allowed but it is not a wining strategy!!)

20% of midterm exam
(Note: Written midterm exam (80%) + Take-home exam (20%) = Midterm exam (100%))

Implement 2-player OMOK game using the OMOK game source as attached here.

OMOK stone symbol for the 1st player: O
OMOK stone symbol for the 2nd player: X

The OMOK board size is 19 X 19 dimensions

No GUI (Graphic User Interface) is required. Just text-based OMOK game is enough this time.

We may improve the OMOK game step by step.
The final version of OMOK game will be an online version of one-to-one OMOK game.

Omok Source (A new version of file has been uploaded on Oct. 12, which removes redundant homework problems that we have already done the other day)


2015년 10월 12일 월요일

[OOP] Homework 7 (Due Oct. 30)

If you get homework 6 done with a recursive method, your homework will be like this:
=> Just check out if a given string is Slimp or not in a non-recursive method.

Otherwise,
=> Just check out if a given string is Slimp or not in a recursive method.



[OOP] Review list for the midterm exam

[1] Study examples including source codes we discussed by Oct. 7
[2] Study homework problems including OMOK game
[3] Study recursive problems we have discussed so far (by Oct. 7)
[4] Study how to find regular pattern regarding to integer numbers
[5] Study the difference between call by value and call by reference in terms of single or multiple dimensional array
[6] Visibility modifiers addressed on the Lecture Notes entitled with "Objects and classes"

[Midterm week, no class on Oct. 21]

Wish you good luck~

[Probability] Review list for the midterm exam

[1] Study examples and two pieces of homework we discussed by Oct. 7
[2] Study some examples related to antenna placement strategies
[3] Study the birthday problem
[4] Study stock investment shown in homework

[Midterm week, no class on Oct. 21]

Wish you good luck~

2015년 10월 5일 월요일

[OOP] File Exception Sample Codes

Sample Codes

[O-O Java] HW 6 (Due: October 16, 2015) - a new version (including a sample version of incomplete recursion~)

HW 6

Just check out if a given string is Slimp or not!!
You don't have to do Slurpy test!! - It is too much of homework~

Someone got already done with this homework in a recursive version.
It is O.K with a recursive version.
A recursive approach will be may easier than a non-recursive approach.

However, please try it with a non-recursive version.

Can we do this homework version with a non-recursive version?
Really, Huh?

If you don't want to use the state machine, that's O.K.
Maybe you can use several "pattern match methods" found by googling!!

However, I want you to do this homework for yourself (But it is not mandatory)

My point is that there is "No Restriction" with this homework..
Give it a try with this homework.

Enjoy yourself with this homework!!

(Probably in a non-recursive version,

[1] The number of "AB" or "AE" or "AD" in a string is the same as the number of "C" in the end part of the string.
[2] When you get to 'C', you need to check out how many 'C' is required to verify the given string is Slimp or not.)

[PS] The sample code included in the word file as attached here is not a correct working code. It is a just reference code for your homework!!

(Updated on Oct. 5, 2015)