• 3 Pages 05ml3
    05ml3

    School: Rutgers

    Lecture 5: Machine Language CS105: Great Insights in Computer Science Michael L. Littman, Fall 2006 Recap Using logic gates, we know how to do a bunch of things with bits: - test equality - if-then-else gate - select one bit from a set (universal g

  • 1 Page final-sample
    Final-sample

    School: Rutgers

    Final practice CS105: Great Insights in Computer Science Michael L. Littman, Fall 2007 Rules 20 questions, 10 pts each Keep at least one empty seat between you and everyone else. Please write your answers directly on the pages. You may use your

  • 3 Pages ch8
    Ch8

    School: Rutgers

    Chapter 8: Computers That Learn And Adapt CS105: Great Insights in Computer Science More Than A Program Usually, we think a program is something written by an experienced person. Often, the program isnt complete without experience of its own. Exa

  • 3 Pages chR
    ChR

    School: Rutgers

    Review Chapters 0 to 9 CS105: Great Insights in Computer Science 0: Magic in the Stone Computers are everywhere creating new capabilities. Computer science is the study of "reduction": making complex out of simple. Skill: Reading barcodes. 1: Nu

  • 1 Page ch5
    Ch5

    School: Rutgers

    Chapter 5: Algorithms and Heuristics CS105: Great Insights in Computer Science Here's Where We Stand In the last chapter, we asked and answered some philosophical questions about computation. Before that, we discussed how a computer could be creat

  • 3 Pages 06subs
    06subs

    School: Rutgers

    Lecture 6: Subroutines & Recursion CS105: Great Insights in Computer Science Michael L. Littman, Fall 2006 Recap: Reduction Level software libraries high-level language machine language logic gates basic logic gates physical bits Examples graphics,

  • 1 Page ch3-part1
    Ch3-part1

    School: Rutgers

    Chapter 3: Programming CS105: Great Insights in Computer Science The Vector We can build (or at least imagine!) lots of circuits. We can even think about state machines that use circuits to do various things over time. Were headed towards using t

  • 1 Page 11sorting
    11sorting

    School: Rutgers

    Lecture 11: Sorting Algorithms CS105: Great Insights in Computer Science Michael L. Littman, Fall 2006 Sorting Algorithms Another name for the lecture is Google II. Sorting is a great topic in CS: relatively simple extremely important illustrat

  • 15 Pages 15random
    15random

    School: Rutgers

    Lecture 15: Randomness CS105: Great Insights in Computer Science Michael L. Littman, Fall 2006 Voting Machines Average of List Let's say we've got a list of n small integers (n = 10,000,000,000, for example). We want to know the average value of

  • 1 Page ch3
    Ch3

    School: Rutgers

    Chapter 3: Programming CS105: Great Insights in Computer Science The Vector We can build (or at least imagine!) lots of circuits. We can even think about state machines that use circuits to do various things over time. Were headed towards using t

  • 3 Pages midterm-sample
    Midterm-sample

    School: Rutgers

    Midterm (Sample) CS105: Great Insights in Computer Science Michael L. Littman, Fall 2007 Rules Please write your answers directly on the pages. You may use your notes, your book, a calculator. You may not discuss the test with anyone else, includ

Back to course listings