Name: xxxxxxxxxxxxxxxxxxxxxxxxx
Math 216 Discrete Structures (2) Homework: Logic II 50
1. (10) (1.6: 6) Use a direct proof to show that the product of two odd integers is odd. Let a, b be odd integers. Then we can write a = 2x + 1 and b = 2y + 1 for some

Arithmetic Circuits
Didnt I learn how to do addition in the second grade? UNC courses arent what they used to be.
01011 +00101 10000
Finally; time to build some serious functional blocks
Well need a lot of boxes
Comp 411 Fall 2009
10/14/09
L9 Arithmetic C

Assemblers and Compilers
Long, long, time ago, I can still remember How mnemonics used to make me smile. And I knew that with just the opcode names that I could play those assembly games and maybe hack some programs for a while. But Comp 411 made me shive

Stacks and Procedures
I forgot, am I the Caller or Callee? Dont know. But, if you PUSH again Im gonna POP you.
Support for High-Level Language constructs are an integral part of modern computer organization. In particular, support for subroutines, procedu

Fundamental Questions
Duality, Universality, and Computability
Q. What is a general-purpose computer? Q. Are there limits on the power of digital computers? Q. Are there limits on the power of machines we can build?
Pioneering work in the 1930s. Hilbert,

Overview
What is CS 101? Broad and technical introduction to programming and pertinent areas of Computer Science. Prerequisites: None - the course is intended to be accessible to all students
What is CS 101-E? Separate section of CS101 intended for stud

Why Programming?
1.1 Your First Program
Idealized computer. "Please simulate the motion of a system of N heavenly bodies, subject to Newton's laws of motion and gravity." Prepackaged software solutions. Great, if it does exactly what you need. Computer pr

Arrays
1.4 Arrays
This lecture. Store and manipulate huge quantities of data. Array. Indexed sequence of values of the same type. Examples. 52 playing cards in a deck. 14 thousand undergrads at UVa. 1 million characters in a book. 10 million audio samples

Overview
4.1 - 4.2 Analysis of Algorithms
Analysis of algorithms. Framework for comparing algorithms and predicting performance. Scientific method. Observe some feature of the universe. Hypothesize a model that is consistent with observation. Predict even