Home
Search For Notes
All Search Criteria Are Optional
After:Before:
In Course:
Contains String:
0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114
Date tag: February 12 2010 7:38:41
Strong Induction: Let P of n be a statement that depends on n belonging to the set of positive numbers. If:
Date tag: February 12 2010 6:19:51
2 level carry lookahead
Date tag: February 12 2010 6:18:9
Click here to add notes.
Date tag: February 12 2010 6:15:13
Carry lookahead full adder, carry propogate
Date tag: February 12 2010 6:11:21
Click here to add notes.
Date tag: February 12 2010 6:8:41
Simplification of k maps is done by considering logically adjacent items as geometrically adjacent.
Date tag: February 12 2010 6:6:1
Canonical forms are sums of minterms, and products of maxterms. These terms include 1 literal for each variable.
Date tag: February 12 2010 6:1:47
n bit adder
Date tag: February 12 2010 6:0:22
1 self complementing code for binary digits is Excess 3. We encode each decimal digit by adding 3 to its binary representation, taking the middle 9 of 4 bit codewords.
Date tag: February 12 2010 5:56:17
BCD is not self complementing because we cant get the 9s complement by interchanging 0s and 1s.
Date tag: February 12 2010 5:51:49
To find the negative of a number, take the 2s complement, treating the sign bit like any other. There will be overflow iff the addend and augend have the same sign, and the sum will have the other sign.
Date tag: February 12 2010 5:51:14
Adder subtractor circuit
Date tag: February 12 2010 5:48:0
When adding to A the 2s complement of B, if A is greater than or equal to B, we get the binary representation of A minus B. If A is less than B, we get the 2s complement of B minus A. For signed number we add a sign bit. 0 means nonnegative and 1 means negative.
Date tag: February 12 2010 5:41:36
1s complement: Just change 0s to 1s and vice versa in binary representation of x.
Date tag: February 12 2010 5:41:14
You can implement any boolean function using a set of logic gates. Formalized in terms of boolean algebra, boolean operations correspond to AND,OR, and NOT gates.
Date tag: February 12 2010 5:34:25
Click here to add notes.
Date tag: February 11 2010 6:19:13
Then the universe changed when in the 1970s Bell labs developed C and UNIX at around the same time. C is very simple and very powerful but there is no support for high level abstractions by the programmer. It is also easy to make hard to find bugs.
Date tag: February 11 2010 6:15:51
A brief history of programming languages: In the 1940s to 1950s Programming was done directly in machine language, and later in assembly languages. In the 1950s the first high level languages appeared, such as fortran lisp or cobol. In the 1960s the first elegant languages like pascal or turing were developed.
Date tag: February 11 2010 6:11:1
If we use a queue like implementation when insertions are O 1 then step b is O 1 so enterpq is O k. This is a big win if k is much less than N. But what about leavePQ, in this case. For step a it is O 1. For step b it is O n divided by k, which approached O N if k is much less than N.
Date tag: February 11 2010 6:3:6
Click here to add notes.
Date tag: February 11 2010 6:0:12
Click here to add notes.
Date tag: February 11 2010 5:48:37
Click here to add notes.
Date tag: February 11 2010 5:48:26
Click here to add notes.
Date tag: February 11 2010 5:43:26
ls is a list of pairs of the form val piror where prior is a postive int define struct pq ls pre: q is a PQ, prior is positive int define enterPQ prior val q cond isEmptyPQ q make pq list list val prior prior second first pq ls q make pq cons list val prior pq ls q else make pq cons first pq ls q pq ls enterPQ prior val make pq rest pq ls q q is a non empty PQ define leavePQ q make pq rest pq ls q q is a non empty PQ define first q first first pq ls q
Date tag: February 11 2010 5:21:35
Click here to add notes.
Date tag: February 11 2010 5:17:42
Click here to add notes.
Date tag: February 11 2010 5:8:6
Priority Queue: The idea is that each element has a value plus a priority, which is a positive int. The removal policy is to grab the oldest element that has the lowest, or highest priority. If all elements have the same priority, this is just a normal queue.
Date tag: February 11 2010 5:7:46
ADTs: Data containers with well defined operations for their manipulation. Stacks are a LIFO list. Queues are a FIFO list. For ADT clients random access to elements is not permitted in general. For example changing stack contents is only allowed by calls to push, pop etc, not cons, rest etc.
Date tag: February 10 2010 9:41:23
Click here to add notes.
Date tag: February 10 2010 9:41:15
Click here to add notes.
Date tag: February 10 2010 9:41:6
Click here to add notes.
Date tag: February 10 2010 9:40:56
Click here to add notes.
Date tag: February 10 2010 9:40:44
Click here to add notes.
Date tag: February 10 2010 9:40:8
Click here to add notes.
Date tag: February 10 2010 9:40:0
Click here to add notes.
Date tag: February 10 2010 9:39:51
Calculus 119 tutorial
Date tag: February 10 2010 9:23:47
Click here to add notes.
Date tag: February 10 2010 9:22:29
Click here to add notes.
Date tag: February 10 2010 9:20:19
Click here to add notes.
Date tag: February 10 2010 9:11:37
Click here to add notes.
Date tag: February 10 2010 9:7:5
Click here to add notes.
Date tag: February 10 2010 9:2:40
Click here to add notes.
Date tag: February 10 2010 8:56:34
Click here to add notes.
Date tag: February 10 2010 8:53:29
Click here to add notes.
Date tag: February 10 2010 8:49:27
Click here to add notes.
Date tag: February 10 2010 8:47:8
Click here to add notes.
Date tag: February 10 2010 8:44:37
Click here to add notes.
Date tag: February 10 2010 8:40:59
Use level curves to visualize multivariable surfaces.
Date tag: February 10 2010 8:40:47
Multivariable scalar functions
Date tag: February 10 2010 8:23:25
is that a 2 or a 3
0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114