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 5 2010 8:14:49
Click here to add notes.
Date tag: February 5 2010 8:12:30
Click here to add notes.
Date tag: February 5 2010 8:9:42
Click here to add notes.
Date tag: February 5 2010 8:9:33
Click here to add notes.
Date tag: February 5 2010 8:2:56
Click here to add notes.
Date tag: February 5 2010 8:2:50
Click here to add notes.
Date tag: February 5 2010 7:58:28
Click here to add notes.
Date tag: February 5 2010 7:58:19
Equivalence relations, reflexive, symmetric, transitive
Date tag: February 5 2010 7:44:26
Euclids theorem
Date tag: February 5 2010 7:44:15
Click here to add notes.
Date tag: February 5 2010 7:42:31
Properties of a divides b, division algorithm, euclidian algorithm, diophantie equations.
Date tag: February 5 2010 7:37:2
Study guide for algebra midterm
Date tag: February 5 2010 6:24:10
Click here to add notes.
Date tag: February 5 2010 6:21:55
Click here to add notes.
Date tag: February 5 2010 6:20:19
Click here to add notes.
Date tag: February 5 2010 6:13:2
BCD to Excess 3 conversion.
Date tag: February 5 2010 6:12:25
Draw the logic circuit and check by analysis or simulation.
Date tag: February 5 2010 6:3:51
Design procedure: For simple combinational circuits determine the number of inputs and outputs, and assign a symbol to each. Then write down a truth table and obtain simplified expressions for each output.
Date tag: February 5 2010 6:1:8
Click here to add notes.
Date tag: February 5 2010 6:0:46
Then eliminate labels of intermediate signals.
Date tag: February 5 2010 5:52:25
Cauchys procedure: Label all gate outputs and write and equation for each gate.
Date tag: February 5 2010 5:50:28
Iron Ring Stag
Date tag: February 5 2010 5:45:35
Combinational circuits.
Date tag: February 5 2010 5:43:0
XNOR on variables is true iff an even number of these variables is true. Kmaps are like those for XOR with 0s and 1s interchanged.
Date tag: February 5 2010 5:41:5
Parity checking
Date tag: February 5 2010 5:37:58
Exclusive or XOR is true iff an odd number of the variables are true.
Date tag: February 4 2010 6:21:29
Click here to add notes.
Date tag: February 4 2010 6:17:40
A queue is a data container that enforces a FIFO policy on adding or removing elements.
Date tag: February 4 2010 6:11:6
The complexity of all operations in this particular implementation is O 1
Date tag: February 4 2010 6:7:23
Click here to add notes.
Date tag: February 4 2010 6:3:59
Click here to add notes.
Date tag: February 4 2010 6:1:18
Click here to add notes.
Date tag: February 4 2010 5:54:49
Click here to add notes.
Date tag: February 4 2010 5:54:39
Click here to add notes.
Date tag: February 4 2010 5:46:9
Click here to add notes.
Date tag: February 4 2010 5:41:45
Click here to add notes.
Date tag: February 4 2010 5:36:14
Top, aka peek, takes a non empty stack and returns but doesn t remove the top element. ie the most recently added element that hasn t been removed. IsEmptySTK takes a stack and returns true iff the stack has no elements.
Date tag: February 4 2010 5:36:4
Make stack creates and returns a new stack for a given list, often the empty list. Push takes a stack and a new element and returns a stack that is the same as the original, except for adding the element on the top. Pop takes a stack, that is non empty, and returns a stack that is the same as the original except that the top element is removed.
Date tag: February 4 2010 5:29:44
Date tag: February 4 2010 5:23:19
A stack is a data container that enforces a LIFO policy on insertion or deletion. Operations are makestack, push, pop, top, isEmpty, size.
Date tag: February 4 2010 5:20:53
Yak shaving
Date tag: February 4 2010 5:20:45
Click here to add notes.
Date tag: February 4 2010 5:15:11
Pez dispenser
Date tag: February 4 2010 5:10:56
ADTs A data container with well defined or recognizable behavior. Each operation has a signature, a pre condition, and a post condition. stack, queue, priority queue, dequeue. The idea of the stack was developed by prof Fritz Baver.
Date tag: February 3 2010 10:5:4
Click here to add notes.
Date tag: February 3 2010 10:4:56
Click here to add notes.
Date tag: February 3 2010 10:4:46
Click here to add notes.
Date tag: February 3 2010 10:4:33
Click here to add notes.
Date tag: February 3 2010 10:4:14
Click here to add notes.
Date tag: February 3 2010 10:4:8
Click here to add notes.
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