module 1: computing fundamentals computing notes by niq
Uploaded by lzennniq · 18 October 2026
Preview
Text from the first pages module 1: computing fundamentals 1.1: computer architecture 1. perform calculations using bits, bytes kilobytes etc 1 byte = 8 bits how to rmb:keep making great tacos please everyone the normal one -bi ki kilo = 1000 1024 me mega = 1000^2 1024^2 gi giga = 1000^3 1024^3 te tera = 1000^4 1024^4 pe peta = 1000^5 1024^5 e exa = 1000^6 1024^6 2. describe the function of key components of a computer system processor: processes data and follows instructions central processing unit CPU series of instructions runned by processor is called a program, or simply, software 1.1: computer architecture 1. perform calculations using bits, bytes kilobytes etc 2. describe the function of key components of a computer system 3. types of storage media for secondary storage 4. different input/output interfaces 1.2: data representation converting denary binary hexadecimal numbers how to represent negative denary numbers into binary? eg ‘82ʼ ASCII encoding 1.3: logic gates THE LOGIC GATES NOT AND NAND OR NOR XOR PROPERTIES not given in exam associative distributive de morganʼs theorem double negation module 1: computing fundamentals 1
main memory: stores data and instructions temporarily for immediate use by the processor; volatile random access memory RAM secondary storage: stores large amounts of data that will not be lost when the power supply is interrupted; non- volatile hard drive data bus: transports data between memory and processor; bi-directional address bus: transports required memory location from processor to memory; uni-directional address refers to the position of each byte input: data or instructions that the computer receives output: intermediate or final results produced by the computer usually in the form of processed data 3. types of storage media for secondary storage type magnetic optical solid-state examples hard disk, magnetictape digital versatile discDVD memory cards, solid-state drive SSD durability more vulnerable to damage from: magnetic fields, heat, natural deterioration over time vulnerable to damage from: scratches and natural deterioration over time. more resistant to heat and impact most durable most resistant to: impact and temperature changes portability heaviest and bulkiestout of the three portable due to smallsize and light weight portable due to small size and light weight typical capacity up to terabytes of data up to gigabytes of data up to terabytes of data cost per gigabyte lowest out of the three lower that ssd buthigher than magnetic highest out of the three speed slower than ssd slower than ssd fastest out of the three 4. different input/output interfaces how to rmb: USB = typical computer connecting stuff HDMI = visual stuff PCI express = internal stuff inside devices interface universal serialbus USB high-definitionmultimediainterface HDMI peripheral componentinterconnect express PCIexpress) typical applications powering and/or communicating with external devices like printers, mice, keyboards delivering audio/video data to compatible devices like monitors, TVs communicating with internal expansion cards like graphic cards connectors • usb type a • usb type b • usb type c • usb mini • usb micro • hdmi standard • hdmi mini • hdmi micro • pci-e x1 • pci-e x4 • pci-e x8 • pci-e x16 max. speed NOT NECESSARY BITCH • usb 2.0 480mbit/s • usb 3.2 20 BRO HOW WLD THEY TEST THiS increases with number of lanes (up to x16 • 5.0 4gb/s module 1: computing fundamentals 2
interface universal serialbus USB high-definitionmultimediainterface HDMI peripheral componentinterconnect express PCIexpress) gbit/s • usb 4 80 gbit/s • 6.0 8gb/s • 7.0 16gb/s 1.2: data representation converting denary binary hexadecimal numbers denary to binary divide by 2 until quotient is 0, binary number is remainder read from bottom up denary to hexadecimal divide by 16 untl quotient is 0, convert remainder digits to hexadecimal if > 9, hexadecimal number is remainder read from bottom up binary to denary each position of binary number corresponds to the power minus 1 (idk how to explain in words) of integer 2 eg convert 0100 1101 into denary 64 8 4 1 77 0 1 0 0 1 1 0 0 2^6 0 0 2^3 2^2 0 0 64 0 0 8 4 0 binary to hexadecimal split binary number into sets of four digits, starting from right convert each set into a hexadecimal digit hexadecimal to denary hard to describe but: letʼs convery CB9 to denary 12 16^2 + 11 16^1 + 9 16^0 = 3257 C B 9 12 11 9 16^2 16^1 16^0 hexadecimal to binary for simplicity, convert each hex digit to denary, then to a 4bit binary how to represent negative denary numbers into binary? eg ‘-82ʼ TWOʼs COMPLEMENT convert 82 to its binary form: 0101 0010 flip all 8 bits (add leading zeros in the front if not 8 bits): 1010 1101 add 1 to the binary: 1010 1110 ASCII encoding Use the example of an 8-bit extended ASCII encoding for English text to explain how information can be represented as bits for storage or processing by a computer. American Standard Code for Information Interchange] - A common character encoding method for English characters, including upper-case and lower-case letters 1.3: logic gates module 1: computing fundamentals 3
THE LOGIC GATES NOT outputs the opposite of input; depicted by A̅ AND both inputs must be TRUE to input TRUE, else will output FALSE; depicted by A · B ( · means multiply in math terms) NAND opposite of AND output; depicted by A̅B̅ (pretend they under same line) OR if either oneʼs input is TRUE, will output TRUE; depicted by A B NOR module 1: computing fundamentals 4
opposite of OR output; depicted by A̅+̅B̅ XOR if both inputs are differing, will give TRUE, else itʼll be FALSE; depicted by A ⊕ B PROPERTIES not given in exam associative AND A · B · C A · B · C OR A B + C A + B C XOR A ⊕ B ⊕ C A ⊕ B ⊕ C distributive AND A · B C = A · B + A · C OR A + B · C = A B · A C de morganʼs theorem AND OR module 1: computing fundamentals 5
double negation A̿ = A (two negatives make a positive lol) module 1: computing fundamentals 6
Content continues in the PDF. Download PDF
Related notes
- module 4: networking computing notes by niqNotes/Practices · 2026
- module 2: algorithms and programming computing notes by niqNotes/Practices · 2026
- SST (for revision practice) 2024 S3 Computing EOY P2 QP_FinalExam Papers · 2024
- Computing o level notes Notes/Practices · 2023
- BVSS Prelim P1 MSExam Papers · 2024
- BVSS Prelim P1 CPExam Papers · 2024
- CWSS Prelim P1 CPExam Papers · 2024
- CWSS Prelim P1 MSExam Papers · 2024
- computing notesNotes/Practices
- SST 2024 Prelim Paper 1 Ans [revised for 2025] Exam Papers · 2024
- SST 2024 Prelim Paper 1 [revised for 2025] Exam Papers · 2024
- [Notes for Computing] All Definitions/ TermsNotes/Practices · 2025
- See all Computing notes

