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: January 15 2010 7:39:13
Integers in different bases.
Date tag: January 15 2010 6:14:37
Ch
Date tag: January 15 2010 6:12:1
If more parity bits are used, and if say only one bit is likely to be corrupted in a given word. It may be possible to determine which bit was corrupted, and therefore to correct the error. Suppose we start with 5 data bits and 3 parity bits. The idea is to use 3 parity bits to represent the position of the corrupted bit.
Date tag: January 15 2010 6:4:3
If parity changes, then some odd number of bits have been corrupted. This is called an error detecting code.
Date tag: January 15 2010 6:0:43
Error detecting code: Bits can be corrupted by noise, changing a 0 to a 1 or vice versa. We can add an extra parity bit. So that, for example, every word has an even number of ones called even parity or every word has an odd number of ones which is odd parity.
Date tag: January 15 2010 5:57:7
Given an n bit Gray code we can construct an n plus one bit by reflection.
Date tag: January 15 2010 5:57:1
Gray code is a code in which only 1 bit changes when going from one word to the next.
Date tag: January 15 2010 5:45:36
Click here to add notes.
Date tag: January 15 2010 5:39:2
BCD is not self complementing
Date tag: January 15 2010 5:38:51
Click here to add notes.
Date tag: January 15 2010 5:34:31
BCD arithmetic: To represent signed numbers, use signed 10s complement. Add a sign digit of 0000 for non negative numbers...
Date tag: January 14 2010 9:46:22
Click here to add notes.
Date tag: January 14 2010 9:40:31
Click here to add notes.
Date tag: January 14 2010 9:39:18
Click here to add notes.
Date tag: January 14 2010 6:40:1
Click here to add notes.
Date tag: January 14 2010 6:19:24
Click here to add notes.
Date tag: January 14 2010 6:17:16
Click here to add notes.
Date tag: January 14 2010 6:12:30
Typical scenarios in scheme.
Date tag: January 14 2010 6:7:35
Recursion is a general technique for solving large problems, typically by breaking down the input until its small enough to solve directly, then combining the smaller results back together.
Date tag: January 14 2010 6:1:32
Click here to add notes.
Date tag: January 14 2010 5:59:6
Click here to add notes.
Date tag: January 14 2010 5:58:57
We will assume that these are errors: Calling first or rest with an atom including the empty list. Calling cons where the second argument is a non list, an empty list is okay.
Date tag: January 14 2010 5:50:13
Basic list operators in scheme.
Date tag: January 14 2010 5:49:58
Click here to add notes.
Date tag: January 14 2010 5:45:50
Lists and scheme: Lists are the fundamental data structs in lisp or scheme. All of their detailed management is done for you by the run time system. Lists are ordered and can contain multiple copies of the same element. Lists can contain lists as elements and can nest as much as you like.
Date tag: January 14 2010 5:45:35
Click here to add notes.
Date tag: January 14 2010 5:41:2
Click here to add notes.
Date tag: January 14 2010 5:33:50
define atom question mark
Date tag: January 14 2010 5:33:42
More predicates: A predicate is a function that evaluates to true or false. By convention scheme predicate names end with a question mark.
Date tag: January 14 2010 5:26:14
Click here to add notes.
Date tag: January 14 2010 5:26:3
Click here to add notes.
Date tag: January 14 2010 5:16:8
Click here to add notes.
Date tag: January 14 2010 5:15:53
Click here to add notes.
Date tag: January 14 2010 5:8:20
Meaning of atoms: Numeric or string constants evaluate to themselves. Some symbols are scheme keywords and other may be given values. Meaning of sexprs or non atoms: They can be function applications or special forms. Note: This is a simplified world view.
Date tag: January 14 2010 5:8:7
Scheme syntax: A sexpr is an tom or list of sexprs. An atom is a numeric or string constant or a symbol
Date tag: January 13 2010 9:19:12
Click here to add notes.
Date tag: January 13 2010 9:15:10
Click here to add notes.
Date tag: January 13 2010 9:10:8
Click here to add notes.
Date tag: January 13 2010 9:5:21
Click here to add notes.
Date tag: January 13 2010 8:57:51
Click here to add notes.
Date tag: January 13 2010 8:51:45
Taylor polynomials are unique. Taylor polynomials centered at x equals 0 are called Maclaurian polynomials. Higher order Taylor polynomials generally give better approximations.
Date tag: January 13 2010 8:46:6
Click here to add notes.
Date tag: January 13 2010 8:44:47
Key point: Newtons Difference formula figures out values of an unknown function from a given points Taylor polynomials take our knowledge about a single point of a given function to find other values of the function.
Date tag: January 13 2010 8:36:19
nth order Taylor polynomial centering at x
Date tag: January 13 2010 8:36:4
Click here to add notes.
Date tag: January 13 2010 8:20:45
Click here to add notes.
Date tag: January 13 2010 8:20:13
Click here to add notes.
Date tag: January 13 2010 8:19:40
Click here to add notes.
Date tag: January 13 2010 8:14:39
Click here to add notes.
Date tag: January 13 2010 8:10:38
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