This website contains the materials you need to successfully complete the history and programming portions of this course.   Contained within the site you will find seven chapters.  These chapters each have a full online text, links to the PowerPoint presentations, assignments, a glossary, and even practice quizzes.

This page will serve as your primary means of obtaining important class information such as announcements and assignments.  You will be expected to check here frequently.

 

PowerPoint Notes:
Please select your chapter

Assignments

Announcements


Previous assignments are listed in the Archives section in the Resources area found in the pull-down menu above.

Minor revisions to this schedule may be announced by your instructor but will not be changed on this page since it is used by several instructors and classes.

Chapter 4-

11/13 - PR 4.4:
Review the Course Text material concerning checkboxes. Complete one portion of the assignment and clean up your errors before moving on to the next. Comment your code carefully.

11/16 - PR 4.5:
This is your final project assignment! Start early!! Use the code from Lab 4.5 and past lab and homework exercises to develop your on-line order form. Be sure to add comments to your code.

Chapter 6-

11/6 - Lab/Demo 6.1:
Your instructor will demonstrate how to use the computer simulator and the PIPPIN assembly language instructions. You must read the on-line text information and instructions carefully. The Help for PIPPIN handout gives you all the information needed to begin using an assembly language.

11/11 - HW 6.1:
All modern computers understand only one language - binary code. You must develop some expertise in moving from the human base-10 world to the computer's base-2 world. This assignment will give you some practice in this area.

11/13 - Lab 6.2:
Your instructor will demonstrate how to use the Rosetta simulator. It is important that you understand how binary instructions are generated from higher-level program code.

11/13 - Lab 6.3:
With this lab, you should make the final connection between high-level programming, binary coding schemes, and the translation process. You will practice converting arithmetic statements written in a JavaScript-like format to binary format. Work through the lab instructions in a step-by-step fashion. Don't be afraid to repeat any steps you dont understand. Ask your instructor questions and use the evening help hours if necessary.

11/20/17 - HW 6.2:
This assignment will require you to bring together the skills you developed in the in-class labs. Read the assignment carefully and submit the required information in the manner required by your instructor.







Chapter 7-

11/20 - Lab 7.1:
This lab will introduce you to Logg-O, an applet that allows you to build circuits using the traditional "gates" discussed in class. Logg-O will be demonstrated in class. Use Logg-O to construct the simple circuits described in 1a - 1f (last paragraph of the lab). The six examples will only require three simple circuits and you can place all three on the same Logg-O panel. This will be done in class so there is nothing to turn in but you will receive credit for completing the lab. If you have any problems, ask your SA or instructor for help.

11/23 - Lab 7.2:
Now you will be asked to build increasingly complex circuits using variants of the basic AND, OR, and NOT gates. Using the procedure for converting truth tables to boolean expressions and logical circuits discussed in class, complete steps 1 and 2 of this lab and save the result to your CS103 folder as LAB722.dat. Start with a clean board and construct the XOR circuit described in step 3 following the same procedure as you used for the NOR circuit. Save this circuit as LAB723.dat. Finally complete steps 4a and 4b. Save 4a as LAB724a.dat and 4b as LAB724b.dat. Show all four circuits to your SA or instructor to receive lab credit.

11/23 - Lab 7.3:
Complete this lab exactly as directed through STEP #2. DO NOT DO STEP #3! The diagram for the One-bit Half Adder is on the handout you received in class. Save the diagram to your CS103 folder as halfadd.dat. Show this circuit to your SA or instructor to receive lab credit. Be prepared to explain how this circuit mimics binary addition.


Minor revisions to this schedule may be announced by your instructor but will not be changed on this page since it is used by several instructors and classes.



Chapter 4-

With this chapter you will be adding JavaScript features that provide additional power to your programs. By monitoring and controlling events, by creating forms that accept and process data from users, and by using arrays to store and manipulate large amounts of data quickly and easily, you will be able to write code that has real-world application. In fact, as you surf the web you should be able to recognize the use of these concepts in commercially prepared pages. As the culmination of your programming experience, you will develop code for your project that acutally provides a service to the user.

Chapter 4 marks the end of your project work. In addition to the usual grading rubric, you will be given an overall grade for your project based on subjective as well as objective criteria. Remember, your project counts toward 15% of your final grade in this course (see course syllabus).


Exam #3-

The third examination is scheduled for Monday, November 16 . It will include all class material covered in Chapter 4. All exam sessions will be held during your regular class time. The course website is closed during all examination sessions.





Chapter 6-

With this unit you will enter an entirely different realm of computer science. How does your computer really work? How does a program you write in JavaScript or HTML actually get executed at the machine level? Chapter 6 will begin to introduce you to the structure and internal workings of your computer. You will explore assembler language coding and binary representations of operations and data. Finally you will get a glimpse of what happens inside the microporcessor of your computer.













Chapter 7-

We now move to the lowest structural level of the computer and relate the binary machine code we looked at in the last module to the simple switch. Using the various types of switches we will build increasingly complex circuits which, in the end, result in a functioning computer.


Thanksgiving Break



Final Exam Schedule-

- Exam times are established by the Registrar and can not be changed. Please do not schedule transportation plans until your last exam has been completed.
- The final exam covers material from the entire semester.

CS103A - Mr. Leslie
Thursday, Dec. 17
1:30 - 4:30 p.m..
CS103B - Mr. Leslie
Friday, Dec. 18
1:30 - 4:30 p.m.
CS103C - Dr. Presser
Tuesday, Dec. 15
8:30 - 11:30 a.m.



Copyright . Gettysburg College Department of Computer Science. All Rights Reserved.