IB Computer Science 2

From WLCS
Revision as of 12:56, 14 February 2011 by Admin (talk | contribs)

Monday (2/14/11)

Warmup:

  • Using digital logic & design, draw the simplified logic circuit for the truth table on the board:
    1. Write out all the mini-terms for the truth table
    2. Write out the full boolean expression using all the mini-terms
    3. Simplify the boolean expression as much as possible
    4. Draw the logic circuit for the simplified expression

Agenda:

  • Turn in Dossier Criterion C3: Success Of Program
  • DLD word problems
    1. An automated robot is used to cut shapes from steel sheets. If the robot's cutting blade becomes both hot and blunt the robot must stop so that the blade can cool and be resharpened. Sensors S1 (hot state) and S2 (blunt state) are attached to the blade to detect these states. Water from a container is used to keep the blade cool during cutting. If the water level falls below a certain point a sensor S3 detects this state and the robot stops irrespective of the other states. A logic circuit is required to control the robot so that it stops cutting when the appropriate states occur.
    2. Create the Boolean table that represents the above logic
    3. An airplane has an alarm that goes off in emergencies to tell the pilot to land. There are sensors to detect different events on the plane. Engine 1 and 2's sensors, S1 and S2, tell the pilot if they are operational or not. The plane must land if one of the engines fail. If the plane is low on fuel (S1), then the plane must land no matter what.
  • Dossier work time
  • How to take screen shots

Thursday (2/10/11)

Agenda:

  • Turn in Dossier Criterion C2: Handling Errors
  • Digital Logic & Design
  • Dossier Criterion C3: Success Of Program is due Monday (2/14/11)
  • Use rest of time to work on Dossier

Tuesday (2/8/11)

Warmup:

  • What is the binary value of the following hexadecimal number? 001A
  • What is its decimal value?

Agenda:

Friday (2/4/11)

Warmup:

  • Draw an inverter (NOT) gate
  • Draw an OR gate
  • Draw an AND gate
  • Draw the digital circuit to represent: z = AB'C + B'C + AC' + A'B'C + AC'

Agenda:

  • Makeup boolean expressions quiz
  • Digital circuit review
  • Read/Write to file work

Wednesday (2/2/11)

  • NSF Field Trip

Otherwise

  • Continue working on file input and output (see below)

Monday (1/31/11)

Warmup:

  • Take out a clean sheet of paper. Invert your seats and separate.
  • This is a closed-book, closed-person, POP-quiz (hahaha!)
  • Simplify the following boolean expression AND write out its truth table after simplifying
  • A'B'C + AB + A'C + A'B'C + AB'C

Agenda:

  • Return Analog vs. Digital & Errors Quiz
  • NSF Field Trip
  • Introduction to Logic Gates
  • File Input/Output - reading and writing to files
  • Add writing to file to your LinkedList class
    1. Add a method named saveToFile(String filename)
    2. Open the filename for writing using RandomAccessFile
    3. writeUTF() the number of nodes or size of your LinkedList
    4. Create a loop that traverses the LinkedList and writeUTF() all of the nodes' data
  • If you want to add writing to file to a BinaryTree, then you must create recursive saveToFile() and saveToFileSubtree() methods that look like print() and printSubtree()

Tuesday (1/25/11)

Warmup:

Agenda:

  • Return 2nd Quarter Exams
  • Field trip forms
  • File Input/Output - reading and writing to files
  • Add writing to file to your LinkedList class
    1. Add a method named saveToFile(String filename)
    2. Open the filename for writing using RandomAccessFile
    3. writeUTF() the number of nodes or size of your LinkedList
    4. Create a loop that traverses the LinkedList and writeUTF() all of the nodes' data
  • If you want to add writing to file to a BinaryTree, then you must create recursive saveToFile() and saveToFileSubtree() methods that look like print() and printSubtree()

Friday (1/21/11)

Agenda:

Homework:

Wednesday (1/19/11)

Agenda:

Thursday (1/13/11)

Warmup:

  • Draw the truth table for the following Boolean expression: ABC + A'B'C' + AC' + A'B'

Agenda:

Tuesday (1/11/11)

Warmup:

  • What is the decimal value of today's date?
  • What is the ASCII character represented by today's date? (Hint: Use the interwebz)

Agenda:

Friday (1/7/11)

  • 2nd Quarter Exam
  • Complete your dossier code

Monday - Wednesday (1/3/11 - 1/5/11)

Warmup:

  • Convert from hexadecimal to binary: ADD0BEEF
  • Convert from binary to hexadecimal: 111001011100000011011101
  • Assume 8-bit sign-magnitude, convert -13 from decimal to binary
  • Assume 8-bit 2's complement, convert -20 from decimal to binary

Agenda:

  • 2nd Quarter Exam will be Friday (1/7/11)!
    • Basic Java programming
    • Stacks
    • Queues
    • Linked Lists
    • Binary Trees
    • Software Development
    • Big-O algorithm evaluation
    • Binary
    • Hexadecimal
    • Binary Addition
    • Sign-Magnitude Negative Binary Numbers
    • 2's Complement Negative Binary Numbers
    • Binary Subtraction (same as Binary Addition but with 2's complement negative)

Archives

Retrieved from "https://www.paulbui.net/wiki/index.php?title=IB_Computer_Science_2&oldid=7062"