today's news
|
Course Information : Fall 2016
Final Options
Dec 20, Tuesday, Gladfelter 13, 3:30 - 5:30
Syllabus
Instructor
Schedule
M 5:30 - 8:00 pm Tuttleman Learning Center 0302
W 5:30 -
7:20 pm SERC 357
Office: SERC 353, Main Campus
1925 N. 12 St.
Philadelphia, PA 19122-1801
Office phone: TBA (Please use email for the primary contact)
Office hour
Teaching assistant: If you have any technical problem or any
question on your grading and comments of your homework, please contact
Robert Zahorchak at tuf33757[at]temple[dot]edu. Other issues please refere to the
instructor.
Tutor: Information can be found at this link.
Weekly Homework:
Due by Friday 11:59 pm every time, check the exact submission date in the table of course materials.
Detailed work - Assignment will be available at this site after each class on Monday around 10:30 pm.
Types of work - exercises in class, and practice problem posted online as homework assignment.
Submission - via email (please check with TA in the lab class)
Course materials
(For the clarification of workload, please email to your instructor,
Dr. Zhen Jiang)
Topics | Class presentation | Homework assignment | Outline of lab class |
Introduction to environment and basic I/O (warm up 1) |
Homework Pre1 Part A: You must finish the following work but no submission is needed.
Homework Pre1 Part B.
Now, you must have a taste of heavy load in this class. |
Lab 1 on 8/31:
|
|
Decision (warm up 2) | if, if-else, condition, nested, switch |
Homework Pre 2 Part A: Finish the following work but no
submission is needed.
Homework Pre 2 Part B.
Now, you must have a complete learning of how to build decision making statement, from knowing the excution of decision making statement, to building it with operator, the entire boolean expression, the solution for true/false case problem, and the one for mulitple choice problem. Sample quiz and its solution |
Lab 2 on 9/7:
|
Loop | for, while, do-while |
Homework 1 Part A (no need for any submission in this part):
Homework 1 Part B: please submit the following work before Friday 9/9, 11:59 pm. Now, you must have a complete view of how a loop problem can be executed and what is its results (in both memory and printout screen). Homework 2 Part B: please submit the following work before Friday 9/16, 11:59 pm.
Now, you must have a complete view of how to develop a loop program. |
Lab 3 on 9/14:
|
Array | arrays, multi-dimensional arrays, and loop |
Homework 3 Part A: Review the declaration and usage of array:
Homework 3 Part B: please finish the following work before Friday 9/23, 11:59 pm.
Now, you must have a view of how to use the sequence of 1st, 2nd, 3rd ... iterations to implement the access/use of 1st, 2nd, 3rd ... elements in an array. Do not forget new and delete, no ( ) needed for array.length.
|
Lab 4 on 9/21:
|
Text processing |
char
and String
and |
Homework 4 Part A: Finish the following work but no
submission is needed.
Homework 4 Part B: Please submit the work for the practice problem (pdf, doc) to Blackboard System before Friday 9/30, 11:59 pm.
Now, you must have the knowledge of the search (indexOf), replacement (indexOf, subString), comparison (equals), charAt, length (do not forget to add "(" and ")"), and other useful method-calls. Homework 5: Please submit the work for the practice problem (pdf, doc) to Blackboard System before Friday 10/14, 11:59 pm. |
Lab 5 on 9/28:
Lab 6 on 10/5:
|
Midterm 1 | Test and solution |
Check list (doc) for our 1st midterm test. One A4 size cheat sheet (double side) is allowed to bring to the test. The test is mainly on Loop.
|
Lab 7 on 10/12 : Midterm test, 120 minutes. |
Object & Class |
class, object, field, and UML representation |
Lab 8 on 10/19:
|
|
Method | program decomposition and development of method |
Homework 6 Part A: Finish the following work but no
submission is needed.
Homework 6 Part B: Practice problem on method (pdf,
doc).
Please submit
by Friday 11/4,11:59pm. Now, you must have a complete view of how the computer calls a (static) method (from inside or outside of the class where it is defined) and the scope of variables declared inside this method (including array), from tracing the program with a nested call, the overloading, and the parameter(s). Students you should be able to apply the procedural decomposition and achieve the method signature in some simple situations. Homework 7: Practice problem on Method Development (pdf, doc). Please submit the following work by Friday 11/11, 11:59 pm.
Now, you must have a tast of decomposition in coding the (static) method. It is a space and timing issue, for so many lines of code occupying the computer memory to support a call from any time in the excution when it is needed. The efficieny of such a support relies on how widely and how many different cases you had considered in the decomposition (generalzing the procedural abstraction). |
Lab 9 on 10/26 and 11/2.
Lab 10 on 11/9.
|
Attribute: Field | various types of data and their access |
Homework 8 Part A: Finish the following work but no
submission is needed. Materials are under this
link.
Homework 8 Part B: Practice problem on instance method (pdf,
doc).
Please submit the following work by Friday 11/18, 11:59 pm.
What is the difference between instance method call and static method call? How to develop instance method to support multiple file project? Why do we need constructor, accessor, and mutator, and how to implement them? |
Lab 11 on 11/16.
|
Solving problems | search and sorting |
Homework 9: Practice problem on
search and sorting (pdf,
doc).
Please submit
by Friday 12/9, 11:59 pm. |
Lab 12 on 12/30:
|
Midterm 2 | Test and solution |
Midterm test 2, on Monday Dec. 5th. One A4 size cheat sheet (double side) is allowed to bring to the test. |
Lab 13 on:
|
GUI support | Polymorphism and interfaces | Homework 10: Practice problem on inheritance (pdf, doc). | |
Final |
Final Test Review. This exam is close book and you CANNOT use any calculator, cell phone, etc. But you may use one 8.5x11 inch sheet of notes that you have written. You may use both sides. |
|