Difference between revisions of "IB Computer Science 2"

From WLCS
 
Line 1: Line 1:
== Monday (1/30/11) ==
+
== [[IBCS2 - Archives]] ==
'''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:'''
 
* NSF Field Trip
 
* 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]]
 

Latest revision as of 08:28, 13 September 2023