Verified Documents at York University

Browse the full collection of course materials, past exams, study guides and class notes for EECS 1520 - Computer Use: Fundamentals at York University verified by our community.
PROFESSORS
All Professors
All semesters
Amir Chinael
fall
2
Andriy Pavlovych
fall
12
Andriy
fall
19

Verified Documents for Andriy Pavlovych

Class Notes

Taken by our most diligent verified note takers in class covering the entire semester.
EECS 1520 Lecture Notes - Lecture 2: Jacquard Loom, Wilhelm Schickard, Blaise Pascal
2375
EECS 1520 Lecture Notes - Lecture 3: Eniac, John Vincent Atanasoff, Konrad Zuse
Claude shannon (1961-2001: 1937: introduced the app of the boolean logic in creating digital computing machines, 1(cid:1013)4(cid:1012): pu(cid:271)lis
2246
EECS 1520 Lecture Notes - Lecture 4: Apollo Program, Keypunch, Jack Kilby
Univac i: first commercial general-purpose computer, delivered in 1951, used to forecast the 1952 us presidential election, starting in the 1950s, comp
4180
EECS 1520 Lecture Notes - Lecture 5: Digital Data, Megabit, Probability Distribution
2258
EECS 1520 Lecture Notes - Lecture 6: Positional Notation, Natural Number, 5,6,7,8
Numbers: natural numbers, 0 and any number obtained by repeatedly adding one to it, ex. 100, 0, 45654, 32: negative number, values less than 0, indi(ci
2305
EECS 1520 Lecture 7: REPRESENTING NUMBERS 2
Arithmetic in binary: there are only 2-digit symbols in binary-0 and 1, adding in binary is like adding in decimal with the following exceptions, in de
2211
EECS 1520 Lecture Notes - Lecture 8: Octal, Binary Number, Junkers F.13
Short forms of binary: hexadecimal (base of 16, 4-bit) Using base 16 and 4-bit patterns is more effective. Since there are only 10 numeric digits, 6 le
5105
EECS 1520 Lecture Notes - Lecture 9: Radix Point, Decimal Mark, Scientific Notation
Fractions: binary to decimal ( 1 0 . Fractional part: (. 1 1)2 = 0. 75 (repeated division or standard decimal-to-binary conversion) (repeated multiplic
4111
EECS 1520 Lecture Notes - Lecture 11: Huffman Coding, Extended Ascii, Compression Ratio
2135
EECS 1520 Lecture Notes - Lecture 12: Binary Tree, Huffman Coding
Coded as: 1011110110111101001100100: this is where you need the prefix property. If we used a fixed-size bit string to represent each character (ex. 8
5170
EECS 1520 Lecture Notes - Lecture 13: Audio Codec, Compression Ratio, Huffman Coding
2162
EECS 1520 Lecture Notes - Lecture 14: Bit Rate, Joint Photographic Experts Group, Lossless Compression
Representing colour: colour is typically represented using the rgb colour model, three integers (in the range of 0-255) describe the amount of red, gre
5288