CST383 - Week 5

CST383 - Week 5

This week we learned about how to prepare data for intro machine learning techniques. This week was rather difficult for me to understand how to properly create KNN classifiers, so I went online to find some supplementary material to help me. One resource that made it a lot easier for me to understand was this video: 

The homework was good practice for me to work with, but I'll have to practice more to get the hang of creating classifiers! 

Comments

Post a Comment

Popular posts from this blog

CST300 - Week 4

Week 4 has been busy! I have gotten work done a lot later than I would have liked. Part 1: Education Goals My educational goals would be to expand my knowledge about Javascript. The most tangible project to put this in practice would be to create a simple interactable website, possibly using React as a frontend. One of my ideas for a capstone project would be to create a website for a tabletop game I am developing, so the practice would be great for it.   The first step would be to learn about networking -- CST311: Intro to Computer Networking and CST336: Internet Programming would be where I hone these skills. Before these classes, I would like to create a single-task web app as a practice. It would have a starting list of about 20 items, and allow the user to arrange them into 6 specific item slots, like a digital pin board. Then, once I am in these classes, I will look back at this project and see what I can do differently or what I have learned since then.   My web develop...
Read more

CST334 - Week 6

Week 6 Reflection This week, we learned more about semaphores, and the bugs that are commonly faced in concurrency, such as deadlocks.  Semaphores are a synchronization primitive that has a modifiable integer value. The behavior of the semaphore is determined by this value. They can be used as both locks and condition variables for concurrency.  sem_wait() and sem_post() are used to interact with a semaphore. sem_wait() waits for a condition to be met, while sem_post() increments the value of the semaphore, then wakes a waiting thread. If a semaphore's value is negative, this number is equal to the number of waiting threads. For example, -4 equals four waiting threads, incrementing by 1 will change it to -3, waking one thread and now resulting in three waiting threads. Concurrency creates bugs that are difficult or costly to fix correctly. Non-deadlock bugs include atomicity violations and order violations. Atomicity violations occur when instructions that sho...
Read more

CST334 - Week 2

Weekly Reflection, Week 2 I feel a lot more confident in my understanding of C now! From what we've covered in class: CPU scheduling is important to optimizing processing times. Scheduling makes use of two metrics: turnaround time and response time. Turnaround time is how long it takes for a process to complete from when it first entered the schedule. Response time is how long it takes for a process to begin its first run from when it first entered the schedule. The main schedule patterns we've seen are First In, First Out (FIFO and its related schedule Last in First Out or LIFO), Shortest Job First (SJF), Shortest Time-to-Completion First (STCF), and Round Robin (RR). FIFO chooses the first process entered and completes it, then to the second-most process entered, etc. LIFO chooses the last entered process (the tail end) and completes it, then to the second-last process entered, etc. SJF prioritizes jobs with the shortest duration and completes them first.  STCF prioritizes jo...
Read more