|
|
15110
SUMMER SESSION ONE - 2013
|
Fast Links: Exam Information | Course Schedule & Readings
Practice Written Exams: The links below lead you to exams that were given during the Fall 2011 semester. Since these exams were 50 minutes each, they don't align directly to our course. Additionally, a few topics may be slightly different than topics we've covered. Use these exams only as guidelines to the level of difficulty and the style of questions you might see on your exams. Your 80-minute exams will likely have a different number of problems to solve instead of 5 and the point distribution will be different. Use the information shown below your exam date to determine which Fall 2011 questions to review for your exam.
Fall 2011 Exam 1,
Sample Answers
Fall 2011 Exam 2,
Sample Answers,
Circuit for Problem 4b
Fall 2011 Exam 3,
Sample Answers
Summer Session One - Exam Schedule:
Written Exam 1: Tuesday, June 4
Practice Problems: Fall 2011 Exam 1 (all problems), Fall 2011 Exam 2 (#3 only).
Sample Answers: Written Exam 1
Lab Exam 1: Monday, June 10
Ruby Reference Sheet for Lab Exam 1 - you do not need to bring this to the exam, you will get a new copy
Lab Exam Instructions - you will get these instructions at the start of the exam
Written Exam 2: Tuesday, June 18
Practice Problems: Fall 2011 Exam 2 (#1, #2, #4, #5), Fall 2011 Exam 3 (#1, #5a).
Sample Answers: Written Exam 2
Lab Exam 2: Tuesday, June 25
Ruby Reference Sheet for Lab Exam 2 - you do not need to bring this to the exam, you will get a new copy
Final Exam: Thursday, June 27 (4:30 Part I) and Friday, June 28 (10:30 Part II)
Part I covers the first three weeks of the course (history of computing through data representation)
Part II covers the second three weeks of the course (computer organization through future of computing)
For extra help with some of the topics in Part II, look at the following
practice problems:
Fall 2011 Exam 3 (#2, #3, #4, #5b without the first three fill-in-the-blanks)
Please note that Part II will include questions on artificial intelligence,
computability and (possibly) the future of computing which are not on
the practice exams.
You must take all exams at the times they are given. NO MAKEUPS FOR EXAMS will be allowed except for acceptable documented circumstances (e.g. major illness, death in immediate family, university-sanctioned event with verification from advisor/coach, etc.).
| DATES | TOPICS | CHAPTER |
| 5/20 |
Course Introduction, Computational Thinking LightBot |
|
| 5/21 |
A Brief History of Computation from Babbage to the World Wide Web |
1 |
| 5/21, 5/22 |
An Introduction to Programming using Ruby variables, types, statements, functions |
2 |
| 5/23, 5/24 |
Algorithms loops, conditionals, GCD, Sieve of Eratosthenes |
3 |
| 5/28, 5/29 |
Computation using Iteration using arrays, linear search, selection sort, order of complexity |
4 |
| 5/30, 5/31 |
Recursive Thinking binary search, merge sort, fractals, and other recursive algorithms |
5 |
| 6/3, 6/5 |
Data Organization lists, stacks, queues, hash tables, trees and graphs |
6 |
| 6/6, 6/7 |
Data Representation integers, text, images, sound and compression |
7 |
| 6/10, 6/11 |
Computer Organization Boolean logic, CPU layers as abstractions, instructions as data and data as instructions |
8 |
| 6/12, 6/13 |
Randomness in Computation random number generators, shuffling, games with random numbers, cellular automata |
9 |
| 6/14, 6/17 |
Concurrency sorting networks, pipelining, and mulitasking |
|
| 6/19, 6/20 |
The Internet design of the Internet, network layers as abstractions, security/RSA |
|
| 6/20 |
Simulations graphics in Ruby, N-body simulation |
|
| 6/21, 6/24 |
Artificial Intelligence ELIZA and the Turing Test, games (search space and heuristics), Watson and machine learning |
10 |
| 6/25, 6/26 |
Computability: The Limits of Computation Map coloring and the traveling salesperson, P vs. NP, The halting problem |
12 |
| 6/27 |
The Future of Computing, Course Wrap-Up Quantum computing, computing with DNA |
