|
|
| Line 1: |
Line 1: |
| − | == Thursday (11/21/13) == | + | == [[IBCS2 - Archives]] == |
| − | '''Agenda:'''
| |
| − | * NVCC Dual Enrollment Testing
| |
| − | * Finish [[Media:BooleanLogic.ppt]]
| |
| − | * Computer Architecture Quiz & Boolean Logic Quiz on Monday (11/25/13)
| |
| − | * Work on IA Project
| |
| − | | |
| − | == Tuesday (11/19/13) ==
| |
| − | <!--'''Warmup:'''
| |
| − | * List the steps of the machine instruction cycle (be sure to describe the roles of the control unit, ALU, and memory)-->
| |
| − | | |
| − | '''Agenda:'''
| |
| − | * NVCC Dual Enrollment
| |
| − | *# Complete the NVCC admission application (obtain your NVCC student ID #)
| |
| − | *# Write your name and NVCC student ID# on the placement sheet
| |
| − | *# Circle and write your scores that place you out of the COMPASS exam
| |
| − | *# Complete the [https://docs.google.com/forms/d/1WrJpl6_PgO8xZ_i0JxjmyuBJUhZGR09QhhdrdRrXYfU/viewform NVCC Student ID# Survey]
| |
| − | * [[Media:CPU_Advanced.ppt]] (This lecture is not in the IB curriculum anymore)
| |
| − | * [[Media:BooleanLogic.ppt]]
| |
| − | * Work on IA Project
| |
| − | | |
| − | == Friday (11/15/13) ==
| |
| − | '''Agenda:'''
| |
| − | * Introduction to Computer Architecture
| |
| − | ** [[Media:ComputerArchitecture.ppt]] (Definitely know this stuff)
| |
| − | | |
| − | == Wednesday (11/13/13) ==
| |
| − | '''Agenda:'''
| |
| − | * Turn in Criterion B: Solution overview (print it out)
| |
| − | * Binary Tree Quiz
| |
| − | * Internal Assessment project updates
| |
| − | * Work on your Internal Assessment (and be able to answer the following questions)
| |
| − | *# What programming language and technologies will you use?
| |
| − | *# What kind of programming environment do you need? (e.g. web server?)
| |
| − | *# How will you write your code on more than one computer? (Source control) (e.g. Git, Dropbox, flashdrive?)
| |
| − | | |
| − | == Friday (11/8/13) ==
| |
| − | '''Agenda:'''
| |
| − | * Binary Tree Quiz on Wednesday (11/13/13)
| |
| − | * Complete Criterion B: Solution overview (due by '''Wednesday 11/13/13''')
| |
| − | ** [[Media:IBCS_InternalAssessmentGuidelines.pdf]]
| |
| − | ** [[Media:IBCS_InternalAssessmentChecklist.doc]]
| |
| − | ** [http://xmltwo.ibo.org/publications/DP/Group4/d_4_comsc_tsm_1201_1/word/Forms.zip IA Forms]
| |
| − | ** [http://ibpublishing.ibo.org/live-exist/rest/app/tsm.xql?doc=d_4_comsc_tsm_1201_1_e&part=4&chapter=5 IA Criteria (Rubric)]
| |
| − | ** [http://ibpublishing.ibo.org/live-exist/rest/app/tsm.xql?doc=d_4_comsc_tsm_1201_1_e&part=4&chapter=7 Example IAs]
| |
| − | ** [[Programming Resources]]
| |
| − | | |
| − | == Wednesday (11/6/13) ==
| |
| − | '''Warmup:'''
| |
| − | # Insert the following into a binary tree: 3, 4, 2, 8, 7, 5
| |
| − | # What is the in-order traversal/output of the binary tree created?
| |
| − | # What is the pre-order traversal/output of the binary tree created?
| |
| − | # What is the post-order traversal/output of the binary tree created?
| |
| − | | |
| − | '''Agenda:'''
| |
| − | * Complete binary tree code walk-through
| |
| − | ** [https://dl.dropboxusercontent.com/u/639140/IB%20Computer%20Science/BinaryTree.py BinaryTree.py]
| |
| − | * Complete the traversal functions of the binary tree
| |
| − | * Test them out and confirm that they are outputting correctly
| |
| − | * Return 1st quarter papers
| |
| − | * Work on Internal Assessment project
| |
| − | * Complete Criterion B: Solution overview (due by '''Wednesday 11/13/13''')
| |
| − | ** [[Media:IBCS_InternalAssessmentGuidelines.pdf]]
| |
| − | ** [[Media:IBCS_InternalAssessmentChecklist.doc]]
| |
| − | ** [http://xmltwo.ibo.org/publications/DP/Group4/d_4_comsc_tsm_1201_1/word/Forms.zip IA Forms]
| |
| − | ** [http://ibpublishing.ibo.org/live-exist/rest/app/tsm.xql?doc=d_4_comsc_tsm_1201_1_e&part=4&chapter=5 IA Criteria (Rubric)]
| |
| − | ** [http://ibpublishing.ibo.org/live-exist/rest/app/tsm.xql?doc=d_4_comsc_tsm_1201_1_e&part=4&chapter=7 Example IAs]
| |
| − | | |
| − | == Friday (11/1/13) ==
| |
| − | '''Warmup:'''
| |
| − | * Insert the following into a binary tree: 3, 4, 2, 8, 7, 5
| |
| − | | |
| − | '''Agenda:'''
| |
| − | * Introduction to Binary Trees
| |
| − | ** [[Media:BinaryTrees.ppt]]
| |
| − | ** [[Media:Recursion.ppt]]
| |
| − | ** Binary Tree Code walk-through
| |
| − | * What does the IB expect you to know about Binary Trees?
| |
| − | ** '''Diagrams and descriptions''' for building, adding, removing, and searching in a binary tree
| |
| − | ** In-order, pre-order, and post-order tree traversals
| |
| − | ** Tracing recursive algorithms
| |
| − | | |
| − | == Archives ==
| |
| − | * [[IBCS2 - 1314 - October]]
| |
| − | * [[IBCS2 - 1314 - September]]
| |
