|Office Location:||MacQuarrie Hall 217|
|Telephone:||Please use email|
|Email:||firstname.lastname@example.org Or contact me through Piazza|
|Office Hours:||TuTh 2:45 - 3:15 or on Piazza anytime|
|Class Days/Time:||TuTh 12:00PM - 1:15PM|
|Prerequisites:||Previous programming experience in a language other than Java.|
|Final:||Wednesday, May 24 0945-1200 (regular classroom)|
|Tentative Exam date:||Mar 21|
Introduction to the Java programming language and libraries. Topics include fundamental data types and control structures, object-oriented programming, string processing, input/output, and error handling. Use of Java libraries for mathematics, graphics, collections, and for user interfaces.
For the official catalog description, please visit the online catalog at http://info.sjsu.edu/web-dbgen/catalog/courses/CS049J.html
|Title||Big Java Early Objects 6/e.|
Upon successful completion of this course, students should be able to:
This is a 3 unit/15-week class, so you should expect to spend at least 135 hours per semester or 9 hours per week on this class. Many students need to spend much more time.
For full credit on your assignments, you need to follow established Java coding conventions that we will cover in class.
Also your code must be formatted. You can click Source -> Correct Indentation in Eclipse.
Your grade for the course is based on the mid-term , the finals, the homework, and participation. Grades are calculated by weighting the scores as defined above. I do not curve grades.
|At least||Letter Grade|
Note that “All students have the right, within a reasonable time, to know their academic scores, to review their grade-dependent work, and to be provided with explanations for the determination of their course grades.” See University Policy F13-1 at http://www.sjsu.edu/senate/docs/F13-1.pdf for more details."
All homework and exams must be your own individual work. It is OK to have general discussions about homework assignments, or read other material for inspiration. You may never copy anything from anyone without attribution. This means if you find code on Stackoverflow or another web site, you need to give the URL where you found the code in a comment at the top of your class so that I can look at it if necessary. You may copy from the textbook, the labs, or anything we do in class without attribution. For homeworks and exams, you may not copy anything from any other student at all, and you may not collaborative produce results in pairs or teams. Your work must be entirely your own.
It is never okay to give your completed code to another student before the due date.
A first incident of cheating will result in a 0 on that assignment or exam. A second incident will result in a failure for the class.
(a) An ability to apply knowledge of computing and mathematics to solve problems
(b) An ability to analyze a problem, and identify and define the computing requirements appropriate to its solution
(c) An ability to design, implement, and evaluate a computer-based system, process, component, or program to meet desired needs
(i) An ability to use current techniques, skills, and tools necessary for computing practice
(j) An ability to apply mathematical foundations, algorithmic principles, and computer science theory in the modeling and design of computer-based systems in a way that demonstrates comprehension of the trade-offs involved in design choices
(k) An ability to apply design and development principles in the construction of software systems of varying complexity
Add Policy: I will not give out any add codes this semester.
Publicly Viewable Work: Your class work (including homework, exam, and project work) may be viewable by other students of this course. Your grades will not be viewable by others.
Copyright of Materials: All materials created by the instructor for this course, including lectures, handouts, homeworks, exams, solutions, projects, and so on, are copyrighted property of the instructor. You may transcribe lectures or copy course materials for the use of yourself and other students registered in this course. You may not sell or give transcriptions of lectures or copies of course materials to others without the prior written consent of the instructor.
|2||2||31-Jan||Ch 1: 1.3-1.5 & Ch 2: 2.1-2.6||hw0||Objects|
|3||2-Feb||Ch 2: 2.7 - 2.10||hw01||objects, graphics|
|3||4||7-Feb||Ch 3: 3.1-3.5||hw02||Classes|
|5||9-Feb||Ch 3: 3.6 -3.8||hw03||classes & graphics|
|4||6||14-Feb||Ch 4: 4.1-4.3||hw04||Data types, I/O|
|7||16-Feb||Ch 4: 4.5||Data type, Strings|
|5||8||21-Feb||Ch 5: 5.1-5.4, 5.7||hw05||if|
|9||23-Feb||Ch 6: 6.1, 6.3-6.5, 6.7-6.9||hw06||loops - random|
|10||2-Mar||Ch 7: 7.1-7.3||hw07||arrays|
|7||11||7-Mar||Ch7: 7.6||2D arrays|
|12||9-Mar||Ch 7: 7.7||hw08||array lists|
|8||13||14-Mar||Ch 8: 8.1-8.3 & Ch 12: 12.1-12.3||hw09||Static methods|
|14||16-Mar||Ch 8: 8.4-8.5||object oriented design|
|15||23-Mar||Ch 9: 9.1-9.3||hw10||inheritence|
|Spring Break Mar 27 - Mar 31|
|10||16||4-Apr||Ch 9: 9.4||hw11|
|17||6-Apr||Ch 9: 9.5|
|11||18||11-Apr||Ch 10: 10.1-10.3||hw12||Interface|
|19||13-Apr||Ch 10: 10.4-10.6||Comparator|
|12||20||18-Apr||Ch 11: 11.1 - 11.2||hw13||I/O|
|21||20-Apr||Ch 11: 11.3 - 11.4|
|13||22||25-Apr||Ch 14: Ch 15: 15.1||hw14||Collections Framework|
|23||27-Apr||Ch 15: 15.2||LinkedList|
|14||24||2-May||Ch 15: 15.3||hw 15||Set|
|25||4-May||Ch 15: 15.4||hw16||Maps|
|15||26||9-May||Ch 15: 15.5 - 15.6||hw17||stacks and queues|
|27||11-May||finish up & review|
|Final: Wednesday, May 24 0945-1200|