 |
General Information:
Course syllabus
Course: 2h/week
Lab work: 2h/week
Project: 0h/week
Credit points: 5
Grading and workload
Grade in the course will be earned / calculated as follows:
60% Semester activity
- Labs and lectures attendance (10%)
- 2 Tests (30%)
- Lab activity/homework assign. (20 %)
40% Final exam
1. Laboratory attendance
- Attending the labs is not optional: 12 lab sessions should be attended in order to have the total possible attendance points (You can miss two lab sessions without losing points)
2. Homework
- Every week a pre-lab assignment for the following week's lab will be posted on the web.
- The students are expected to work the pre-lab exercises by themselves as homework before the next lab. All homework should be completed before the lab and ready to be defended during the lab.
3. Tests
Two tests are scheduled during the semester. Test grading has an important weight in the final mark.
Note. If sincere effort was made during regular scheduled lab, in order to obtain a better final grade, one missed or poorly done test could be redone.
4. Final examination
The final examination consists of a closed-book multiple choice test with theoretical questions and an open-book, hands-on development of a comprehensive Java program with I/O operations and inheritance relationships between classes.
Prerequisites:
none
|
|
Laboratory Schedule of Topics and Homework
The lab assignments will require knowledge of materials covered by the course lectures. Topic and homework assignment for the next week will be released before or during the weekend.
| Lab.# Week |
Homework/Test & Topic |
Lab. 1
|
HW1.
Program Compilation & Execution, Basic components of Java programs
|
Lab. 2 |
|
Lab. 3 |
|
Lab. 4
|
HW4. Objects and Reference Variables
|
Lab. 5 |
HW5. Expressions and Algorithms |
| Lab. 6 |
|
Lab. 7
|
HW6.Loops, Arrays and Strings
Here is an Introduction to Algorithms and Recursion HW7. Algorithms and Recursion
|
Lab. 8
|
HW7. Algorithms and Recursion
HW8. Defining new classes. Packages
|
Lab. 9
|
HW8. Defining new classes. Packages
|
Lab. 10
|
|
| Lab. 11
|
Inheritance. Abstract classes
(To solve Ex. 1, please, read and eventually solve the Ex. 4 and 5 of the Lab 10)
Ex. 1 ,
Ex. 3 ,
Ex. 4 ,
Ex. 5 |
Lab. 12 |
|
|
| |
|
|
|
|
|
Provisional schedule of lectures
Date/Time |
Lesson Topic |
Fri, 3 Oct.
16h-20h CB020
|
Computer Architecture. Programming Languages. Syntax and semantics |
Mon, 6 Oct.
18h-20hCB020 |
L2.
Syntax & Semantics.
L3
Java Runtime Env. L4. Basic Elements. L5.
Variables.Data Types.
|
Tue, 7 Oct.
18h-20hCB020 |
Expressions. Instructions L6
|
Tue, 14 Oct.
18h-20hCB020 |
Introduction to Object-Orientation. Classes & Objects
L7.
|
Fri, 14 Oct.
16h - 20h CB020
|
|
Sat, 18 Oct.
9h-13h CB020 |
L11.Methods. Static Methods
|
Sat, 15 Nov.
10h - 13h CB020 |
|
Mon, 17 Nov.
18h - 20h CB020 |
Inheritance. Object Class. Wrappers |
Tue, 18 Nov.
18h - 20h CB020 |
|
Fri, 21 Nov.
16h - 20h CB020 |
|
Examinations
1. A student unable to exibit her/his identification document is not accepted for examinations.
Lecture notes
Not available. The students are warmly invited to attend the course's lectures.
Textbooks
Books in English:
1. C. Horstmann, G. Cornell
Core Java 2, Vol. I - Fundamentals: 7/e, Prentice Hall, 2005
2. Deitel & Deitel, Java: How to Program, 6/e, Prentice Hall, 2004.
3. B. Eckel, Thinking in Java, 3/e, Prentice Hall, 2002.
4. www.java.sun.com
Books in Romanian :
5. A. Athanasiu et al., Limbajul Java. O perspectiva pragmatica, Ed. Agora, 1996.
6. S.Tanasa, C.Olaru, S.Andrei, Java de la 0 la expert, Polirom, 2003.
|
|