|
|
| Line 1: |
Line 1: |
| − | == Monday (2/14/11) == | + | == [[IBCS2 - Archives]] == |
| − | '''Warmup:'''
| |
| − | * Using digital logic & design, draw the simplified logic circuit for the truth table on the board:
| |
| − | *# Write out all the mini-terms for the truth table
| |
| − | *# Write out the full boolean expression using all the mini-terms
| |
| − | *# Simplify the boolean expression as much as possible
| |
| − | *# Draw the logic circuit for the simplified expression
| |
| − | | |
| − | '''Agenda:'''
| |
| − | * Turn in Dossier Criterion C3: Success Of Program
| |
| − | * DLD word problems
| |
| − | *# 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.
| |
| − | *# Create the Boolean table that represents the above logic
| |
| − | *# 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
| |
| − | ** [[Media:DLD.ppt]]
| |
| − | * Dossier Criterion C3: Success Of Program is due Monday (2/14/11)
| |
| − | ** [[Media:CriterionC3_successOfProgram.doc]]
| |
| − | ** Estimated time to completed (~10 minutes)
| |
| − | ** Create a table that lists the 5-6 major criteria for success (take from A2)
| |
| − | * 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:'''
| |
| − | * Saving/Loading a Linked List
| |
| − | * Saving/Loading a Binary Tree
| |
| − | * Digital Logic & Design
| |
| − | ** [[Media:DLD.ppt]]
| |
| − | * Dossier Criterion C2: Handling Errors is due Thursday (2/10/11)
| |
| − | ** [[Media:CriterionC2_handlingErrors.doc]]
| |
| − | | |
| − | == 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
| |
| − | ** [[Media:LogicGates.ppt]]
| |
| − | * File Input/Output - reading and writing to files
| |
| − | ** [[Media:RAFWriteDemo.java]]
| |
| − | ** [[Media:RAFReadDemo.java]]
| |
| − | * Add writing to file to your LinkedList class
| |
| − | *# Add a method named saveToFile(String filename)
| |
| − | *# Open the filename for writing using RandomAccessFile
| |
| − | *# writeUTF() the number of nodes or size of your LinkedList
| |
| − | *# 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:'''
| |
| − | * Get checked off for completing homework ([[Boolean expression exercises]])
| |
| − | * Simply the following ABC' + A'B' + AC' + B'C
| |
| − | | |
| − | '''Agenda:'''
| |
| − | * Return 2nd Quarter Exams
| |
| − | * Field trip forms
| |
| − | * File Input/Output - reading and writing to files
| |
| − | ** [[Media:RAFWriteDemo.java]]
| |
| − | ** [[Media:RAFReadDemo.java]]
| |
| − | * Add writing to file to your LinkedList class
| |
| − | *# Add a method named saveToFile(String filename)
| |
| − | *# Open the filename for writing using RandomAccessFile
| |
| − | *# writeUTF() the number of nodes or size of your LinkedList
| |
| − | *# 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:'''
| |
| − | * NVCC Dual Enrollment
| |
| − | * Turn in Dossier - Criterion B3: Modular Organization (late!)
| |
| − | * Analog/Digital & Errors quiz
| |
| − | * Complete [[File I/O Exercise]] and demo (more time in class next week)
| |
| − | * Complete [[Boolean expression exercises]]
| |
| − | | |
| − | '''Homework:'''
| |
| − | * Complete Dossier sections and CODE
| |
| − | * Complete [[Boolean expression exercises]] #10-15 for Tuesday (1/25/11)
| |
| − | | |
| − | == Wednesday (1/19/11) ==
| |
| − | '''Agenda:'''
| |
| − | * Turn in Dossier - Criterion B3: Modular Organization (due today)
| |
| − | * Analog/Digital & Errors quiz this Friday (1/21/11)
| |
| − | ** [[Media:AnalogDigital.ppt]]
| |
| − | ** [[Media:Errors.ppt]]
| |
| − | * [[Boolean expression exercises]]
| |
| − | * Be sure you've completed the following Criteria
| |
| − | ** A1: Analysis of the Problem - [[Media:CriterionA1_problemAnalysis.doc]]
| |
| − | ** A2: Criteria for Success - [[Media:CriterionA2_criteriaforSuccess.doc]]
| |
| − | ** A3: Prototype Solution - [[Media:CriterionA3_prototypeSolution.doc]]
| |
| − | ** B1: Data Structures - [[Media:CriterionB1_dataStructures.doc]]
| |
| − | ** B2: Algorithms - [[Media:CriterionB2_algorithms.doc]]
| |
| − | ** B3: Modular Organization - [[Media:CriterionB3_modularOrganization.doc]]
| |
| − | ** C1: Good Programming Style - [[Media:CriterionC1_goodProgrammingStyle.doc]]
| |
| − | | |
| − | == Thursday (1/13/11) ==
| |
| − | '''Warmup:'''
| |
| − | * Draw the truth table for the following Boolean expression: ABC + A'B'C' + AC' + A'B'
| |
| − | | |
| − | '''Agenda:'''
| |
| − | * Turn in Dossier - Criterion B2: Algorithms
| |
| − | * Dossier - Criterion B3: Modular Organization due Wednesday (1/19/11)
| |
| − | ** [[Media:CriterionB3_modularOrganization.doc]]
| |
| − | * Analog/Digital & Errors quiz next Friday (1/21/11)
| |
| − | ** [[Media:AnalogDigital.ppt]]
| |
| − | ** [[Media:Errors.ppt]]
| |
| − | * Review Boolean Logic
| |
| − | * Simplifying Boolean expressions
| |
| − | ** [[Media:SimplifyingBooleanExpressions.ppt]]
| |
| − | * Boolean expressions practice
| |
| − | ** [[Boolean expression exercises]]
| |
| − | * Dossier work time
| |
| − | | |
| − | == 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:'''
| |
| − | * Dossier Sections:
| |
| − | ** Dossier - Criterion B1: Data Structures return
| |
| − | ** Dossier - Criterion B2: Algorithms due Thursday (1/13/11)
| |
| − | ** [[Media:CriterionB2 algorithms.doc]]
| |
| − | * Errors!
| |
| − | ** [[Media:Errors.ppt]]
| |
| − | * Introduction to Boolean Logic
| |
| − | ** [[Media:BooleanLogic.ppt]]
| |
| − | | |
| − | == 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:'''
| |
| − | * [https://spreadsheets.google.com/viewform?formkey=dHlCd2dMOGxMc29VU1VuakVDOW5fSHc6MQ Dossier Progress Check]
| |
| − | | |
| − | * 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)
| |
| − | | |
| − | * So what the heck does '''digital''' mean?
| |
| − | ** [[Media:AnalogDigital.ppt]]
| |
| − | | |
| − | * Go through your dossier code and clean it up according to "Good Programming Style"
| |
| − | * C1: Good Programming Style - [[Media:CriterionC1_goodProgrammingStyle.doc]]
| |
| − | | |
| − | == Archives ==
| |
| − | * [[IBCS2 - 1011 - December]]
| |
| − | * [[IBCS2 - 1011 - November]]
| |
| − | * [[IBCS2 - 1011 - October]]
| |
| − | * [[IBCS2 - 1011 - September]]
| |
