As the semester progresses, information and practice problems will be posted for each exam.

Midterm 1

Midterm 1 is scheduled for Friday, October 8, in class. The exam will be paper-based. No books or calculators are permitted.

Midterm 1 will cover the following topics:

• Algorithms and Flowcharts (but not finite-state machines)

• Java Variables and Expressions

• Java if and else Statements

• Binary Numbers and Other Bases (including hexadecimal and octal)

• Binary Addition

• Two's Complement

• 32-bit Floating-point Representation

Midterm 1 practice exam (solutions)

Solutions to Midterm 1: Form A and Form B

Midterm 2

Midterm 2 is scheduled for Friday, November 12, in class. The exam will be paper-based. No books, notes, or calculators are permitted; the exam paper will include a quick reference for the Pep/7 instruction format.

The Stony Brook Computing Society (SBCS) will hold an exam review on Thursday, November 11, from 7–8 PM in Computer Science 2120.

Midterm 2 will cover the following topics:

• Java loops and String variables

• Computer Organization (CPU components, instruction execution, pipeline stages, and the memory hierarchy)

• Pep/7 Machine Language (decoding and translating instructions)

• Operating Systems (operating system functions, process scheduling, cooperative vs. preemptive multitasking, disk scheduling, disk access time)

• You may also see a question regarding Boolean logic and/or gate diagrams, but this is not guaranteed.

Midterm 2 practice exam (reference sheet) (solutions)

Final Exam

The final exam will take place on Wednesday, December 15, from 2:15–4:45 PM in Javits 100. The exam is cumulative (50% new material, 25% Midterm 1 material, and 25% Midterm 2 material) and will contain approximately 12-15 problems in all.

More specifically, the exam will cover the following topics:

• Converting between bases

• Two's complement

• Boolean gate diagrams

• Pipelining

• CPU process scheduling

• Disk I/O scheduling

• Memory allocation (first-fit, etc., and virtual memory concepts)

• Parsing and Grammars

• Networking (differing functions of IP and TCP,IP addresses,ypes of malware and DOS attacks)

• Java (variables, if, for, while, methods, arrays -- NO STRINGS)

• Floating-point representation in binary (extra-credit, if it appears at all)
• The Banker's Algorithm (extra credit, if it appears at all)

The final exam is closed-book, closed-notes, but each student is permitted to bring and use a single "cheat sheet" that conforms to the following specifications:

• The cheat sheet may not exceed 8.5x11" in size (US Letter)

• You may write or type your notes on both sides of the "cheat sheet"

• You may use any type size you want, so long as you can read it comfortably (eyeglasses and contact lenses are fine, but magnifying glasses are prohibited during the exam)

• I will provide a reference guide for Pep/7 opcodes and binary-hexadecimal equivalences on the exam, so you may safely omit these tables from your "cheat sheet".

Practice exam (solutions)

This page was last modified on 8/26/10