Java Programming
Time: 0900 ~ 1200, Saturday and Sunday
Location: Room 223A, 德田館
``Java is C++ without the guns, knives, and clubs.''
-- James Gosling, co-inventor of Java (1955-)
Course Description
To the students,
This course is designed for the students who want to learn Java programming without any experiences before. We will start with the very beginning of program design and the fundamental concepts of how the programs execute the instructions. You are expected to be capable to implement your idea with Java independently after 30 hours of lectures. Furthermore, I wish you could learn other programming languages without suffering from starting over.
Enjoy your coding time.
- Textbook
- References
- Java
- Java in a Nutshell, Benjamin J Evans and David Flanagan, 6/e, 2014
- Introduction to Java Programming: Comprehensive Version, Y. Daniel Liang, 10/e, 2014
- Java: The Complete Reference, Herbert Schild, 9/e, 2014
- Effective Java, Joshua Bloch, 2/e, 2008
- Java Performance: The Definitive Guide, Scott Oaks, 2014
- Data structures and algorithms
- Object-oriented design
- Network programming
- Eclipse
- Additional readings
- 為什麼要學各種程式語言, NiwaSho Lin, 2012.11.21
- 資深開發者給後輩的七個 Coding 學習心得, TechOrange, 2013.11.29
- 大企業都在用哪些程式語言?圖解程式語言編年史, T客邦, 2013.12.16
- 如何成為一個偉大的開發者?, TechOrange, 2014.6.20
- 前蘋果高層史丹佛畢典演講:想換工作,別在辦公室等著別人幫你下決定, TechOrange, 2014.7.7
- 沒神奇公式和捷徑,這11步驟就是成為頂尖Coder的必備條件, TechOrange, 2014.7.9
- 高生產力工程師的兩個特徵:聰明、懶惰, INSIDE, 2014.7.14
- 笑傲「演算法」江湖的獨孤九劍, INSIDE, 2014.8.14
- Google工程師親授:菜鳥開發者一定要投資的十大標的, TechOrange, 2014.9.17
- 在美國,寫什麼程式收入最高?答案是:Java, T客邦, 2014.10.9
- 我們之前說錯了嗎?Coding 竟不是新世代必備能力, TechOrange, 2015.2.6
- code 海無涯,不想溺斃就快抓緊這 6 個緊急救生圈吧!, TechOrange, 2015.5.26
- 程式初學者的失落之鑰 - “Computational Thinking”, 程式教育的唐吉訶德, 2015.6.2
- Computational thinking and thinking about computing, Jeannette M Wing, 2008.10.28
- Related courses
The major topics covered in the short course, time permitting, are listed below for your reference.
- Overview: preliminary knowledge of computer science, installation of Eclipse
- Data types and identifiers
- Operators
- Control structures: selections, iterations
- Classes and objects
- Methods and recursions
- Program design and analysis of algorithms: UML, O-notation
- Inheritance
- Polymorphism
- Interfaces
- Generics
- Exception handling
- File input and output
- Multi-threaded programming
- GUI by Swing
- Fundamentals of network programming
- Applets, servlets, and JSP
- 2015.5.30
- 2015.5.31
- 2015.6.6
- 2015.6.7
- Problem 1: Estimating pi by Monte Carlo. You may try various sample size: 10^3, 10^4, 10^5, 10^6 , and 10^7 to observe the convergence rate.
- Problem 2: Bisection method. The target function is f(x) = x^3 - x - 2. The approximate root is around 1.521xxxx when [a, b] = [1, 2] and e = 10^-9.
(Please email the source codes to my email address, which can be found in the first lecture note.)
- 2015.6.13
- 2015.6.14
- Problem 3: GCD by a loop and recursion. Write two programs which return the greatest common divisor of a and b. You may assume a >= b for simplicity. One is to use a loop and the other by recursion.
- Problem 4: Multiplication of two matrices. Let A be any l-by-m matrix and B be any m-by-n matrix for some integers l,m,n. Write a program which calculates the multiplication of two matrices. You may use random matrices for A and B for self-testing.
- Problem 5: Tower of Hanoi. Write a program which performs the famous problem, Tower of Hanoi.
- 2015.6.27
- 2015.6.28, hw#3
- 2015.7.4
- 2015.7.5, solution
Sample Codes
As a beginner, avoid to copy but write the code on your own.
- Estimating pi by Monte Carlo
- Bisection method for root finding
- GCD by a loop and recursion
- Matrix multiplication
- Tower of Hanoi
Grading Policy
- Programming Assignments (40 points)
- Final Exam (60 points)
You will get the certificate for this course if you acquire more than 60 points in total.