CLASS PARTICIPATION:
Class attendance and a flow of questions are essential to the learning process. Attendance will be recorded each class. Participation constitutes awareness of the assignments, participation in discussion forum questions asked by instructor and/or students, staying on task with the class lecture or topics covered for the period, and non-disruptive behavior. At the end of the semester, up to 5% of your grade may be based on your attendance/participation at the instructor’s discretion.
Note that questions are encouraged, especially if you don’t understand. Remember, the word “dumb” literally means unspoken, so the only dumb questions are the ones you do not ask.
GRADE BREAKDOWN:
5 Quizzes (at 40 points each) 200
10 Lab/Homework Assignments (at 10 points each) 100
1 Midterm 100
Project #1 100
Project #2 200
Comprehensive Final Exam 300
Bonus Points for Attendance/Participation up to instructor’s choice
GRADING SCALE:
A+: 970+ A: 930-969 A-: 900-929 B+: 870-899 B: 830-869 B-: 800-829
C+: 770-799 C: 730-769 C-: 700-729 D+: 670-699 D: 630-669 D-: 600-629 F: 0-599
The instructor reserves the right to adjust the scales for the class.
PROPOSED SCHEDULE:
The following schedule is only tentative and is subject to change. We may skip some of the sections if it takes longer than planned to fully discuss and understand the topic.
Mon. Jan. 11: Lecture 1: Introduction to Computers and Computer History (Sect. 1.1 and Appendix E)
Wed. Jan. 13: Lecture 2: Windows terminology; System Development Life Cycle (Sect. 1.2, 1.3, and Appendix F)
Mon. Jan. 18: Martin Luther King Jr. Holiday – no classes
Wed. Jan. 20: Lecture 3: Program planning (Sect. 1.4)
Mon. Jan. 25: Quiz #1; Lecture 4: Developing your first program (Sect. 2.1, part of Sect. 2.2)
Wed. Jan. 27: Lecture 5: More on the Visual Basic Toolbox (Sect. 2.2 continued)
Mon. Feb. 1: Lecture 6: Handling Events (Sect. 2.3)
Wed. Feb. 3: Lecture 7: Handling Numbers (Sect. 3.1)
Mon. Feb. 8: Quiz #2; Lecture 8: Handling Strings (Sect. 3.2)
Wed. Feb. 10: Lecture 9: Input and Output (Sect. 3.3)
Mon. Feb. 15: Lecture 10: Relational Operations; If blocks (Sect. 4.1, 4.2)
Wed. Feb. 17: Lecture 11: Select Case Blocks (Sect. 4.3)
Mon. Feb. 22: Lecture 12: Sub Procedures (Sect. 5.1, 5.2)
Wed. Feb. 24: Quiz #3; Lecture 13: Functions (Sect. 5.3)
Mon. Mar. 1: Lecture 14: Do Loops (Sect. 6.1, 6.2)
Wed. Mar. 3: Lecture 15: For … Next … (Sect. 6.3, 6.4)
Mon. Mar. 8: Lecture 16: Arrays (Sect. 7.1, 7.2)
Wed. Mar. 10: Midterm; Lecture 17: Arrays II (Sect. 7.3, 7.4)
Mon. Mar. 15: Lecture 18: Arrays III (Sect. 7.5, 7.6)
Wed. Mar. 17: Project #1 due; Lecture 19: Sequential Files (Sect. 8.1, 8.2)
Mon. Mar. 22: Spring Break – No class
Wed. Mar. 24: Spring Break – No class
Mon. Mar. 29: Lecture 20: [Case Study (Sect. 8.3)]
Wed. Mar. 31: Quiz #4; Lecture 21: List and Combo Boxes (Sect. 9.1)
Mon. Apr. 5: Lecture 22: Other Controls (Sect. 9.2)
Wed. Apr. 7: Lecture 23: Other Objects and Graphics (Sect. 9.3, 9.4)
Mon. Apr. 12: Lecture 24: Introduction to Databases (Sect. 10.1)
Wed. Apr. 14: Quiz #5; Lecture 25: SQL (Sect. 10.2)
Mon. Apr. 19: Lecture 26: Object Oriented Programming (Sect. 11.1)
Wed. Apr. 21: Lecture 27: OOP, Part II (Sect. 11.2, 11.3)
Mon. Apr. 26: Project #2 due; Lecture 28: Debugging Your Program (Sect. App. D)
Mon. May 3: 5:30pm – Comprehensive Final Exam
Note: This course schedule is subject to change at the discretion of the instructor due to time constraints
GENERAL REQUIREMENTS:
· Students are encouraged to attend all lectures, which may include material that is not directly taken from the text. If a student misses a lecture, he/she is still responsible for the material covered.
· In case if you miss a class, you should call one of your classmates for help and information.
· Attendance and participation in class may be used to decide borderline grades.
· Each student is expected to do his/her own work. For a first offense, a student caught collaborating/cheating in any way will receive a zero for the exam/project/lab/quiz. In the event of a second offense, the student may receive an F for the course and may be subject to stronger actions.
· Note: Submissions that are alike in a substantive way (not due to coincidence) will be considered cheating by ALL parties involved. Be sure to protect yourself by storing your files in private directories and retrieving printouts promptly.
· All graded material that a student receives should be saved in a safe place until after the term has ended and he/she has received and accepts his/her final grade. The instructor is only human and may accidentally make mathematical errors in calculating the grades.
PROGRAMMING PROJECTS:
· There will be two programming projects assigned throughout the term. Project 1 is worth 100 points (10% of your grade), and Project 2 is worth 200 points (20% of your grade).
· Questions regarding programming projects will be discussed primarily in “office hours”.
· Programming projects are to be written in Visual Basic 2008.
· Programs are graded as follows:
Program successfully compiles: 20%
Program contains adequate documentation/comments: 10%
Program runs without any errors/crashing occuring: 10%
Program’s GUI is pleasing to the eye: 10%
Program returns expected results: 50%
Bonus points may be given to programs that include additional features.
· Projects must be received by the beginning of class on the dates specified. Projects submitted after that time will be graded as late submissions.
· Projects (all files) can be either e-mailed to me as attachments to lwest@ius.edu, your OnCourse dropbox, and/or submitted to me via a CD or DVD or USB thumb drive. I would recommend that any disks or drives be in an envelope or case with your name on it so that I can return it to the right person.