4/3/2023 Individual Review Ticket

[emmaxshen]

• [x] MCQ Test 4 + Reflection Score 50/50 (with help!)

Learning moments

1 Processors

• Think of each process as a grocery item and each processor as a checkout person
• If allow 50 and 60 seconds both through 2 checkouts at same time, the 50 seconds is finished first and now the 30 seconds goes in the same checkout. By this time the 60 seconds is done
• Therefore the minimum possible time for ALL 3 items is 80 seconds

2 Routing

• Wires transmit data

5 Subdomains --> subdomain of example.com is about.example.com

6

• Data is broken apart into packets and is all sent to destination not in order, but then is reassembled there

8 Networking

• About networking, distributed computing (multiple computers)

Memory vs storage on computer

• Memory - temporary data storage that CPU needs to access quickly
• Storage - long term data storage that persists even when computer is turned off

12 Affect ability of program to process large data sets

• Lines of code don’t dictate how long program takes, only types of code

27 Lossless compression

Lossy

• Reduces file size by removing as much data as possible
• Advantage: Data elimination, size reduction
• Disadvantage: reduce image quality, not as noticeable if balanced compression ratio, can NOT restore to original form Lossless
• Doesn’t remove any critical data but strips metadata and such
• Advantage: Doesn’t degrade picture quality, Can restore to original format without data loss
• Answer Choice B is NOT an example of lossless transformation bc data is being lost. You are reducing data from knowing each RGB value to finding the average for gray scale
• Answer Choice C is correct because same format and size but colors and brightness are inverted, it can be easily reversed back

28 #-bit integers

System bits

• 32-bit → can process integer up to 2^32
• 64-bit → can process integer up to 2^64

33 Single binary digit

• B: because when you divide whole number by 2 answer is either 0 or 1. Ex. 7 % 2 = 1 or 8 % 2 = 0

36 Heuristic technique

• Heuristic technique → trial & error, educated thumb. Not best solution but adequate in limited amount of time

37 reasonable time for algorithm

• What is considered a “reasonable” time?

41 Take out negative values

• Most effective for spreadsheet

43 Not benefit of procedural abstraction

• Know college board rubric expectations / meaning
• Procedural abstraction → eliminate redundancy and encourage code reusabillity, breaking down complex program into smaller procedures

47 Binary Search

• Binary search: find target value in SORTED array
• With each interaction, half of values eliminated
• Log2 (n) → O(log(n))--> round up bc can’t examine fraction of element
• 10,000 / 2^15 → what math behind this….

[emmaxshen]

• [ ] Questions answered and interesting work in Hashmaps, Parallel Computing, or Space/Time Analysis. This can be related to the project (0.6)
  1. Parallel Processing
• [x] AP Classroom Video
• [x] List Comprehension Example
  2. Data Structures: Hashmaps, Sets, Hash tables, Hashing and Collisions
• [x] Answer all Qs in Code Segments
• [x] Create a diagram/comparison illustration (Canva) - What are the pro and cons of using this data structure? (Dictionary vs List)
• [x] Expand upon code given to you, possible improvements in comments
• [x] Build own album showing features of a python dictionary