cst 370 week 7

this week we learned a ton of new algorithms. we learned counting sort, which I think is pretty cool, and a lot of dynamic programming. Dynamic programming is solving small subproblems to help the algorithm be more efficient. We also learned about Floyd/warshall shortest path, and the greedy approach. The greedy approach is pretty simple compared to the others. I enjoyed this week as I like solving little graphing problems and matrix problems.

Comments

Post a Comment

Popular posts from this blog

Week 2 Journal Post

Image
 Part 1 One thing that I am good at is knowing when I am capable of studying at 100%. If I am not rested and capable of comprehending what I am studying, I know to put it away for another day or later after I eat or get rest. Another thing I do well is that I revise my schedule when changes need to occur. If my coach or teacher changes or cancels a practice or class, I know I can readjust my schedule as I'll have more free time or less time to study and I plan accordingly. Last thing I do well is that I get the main point easily. I can pinpoint the main idea in a paragraph to make studying easier. Things I am not good at include studying anywhere. Mentally I can not focus if I am not in my room by myself. I need to be able to utilize libraries or study spaces to get the most effectiveness of studying. I also read out loud or move my lips when studying. I thought it was beneficial but now I know it is not and will be more conscious to just read in my head what I am studying. And las...
Read more

CST 334 Week 7

This week in week 7 in CST 334, we learned about file systems IO devices, and persistent storage management. We learned that files serve as a key abstraction provided by the operating system. They are linear arrays of bytes stored on a disk permanently. The files are organized into directories which form a hierarchical structure that maps human readable file names to lower level identifiers like inode numbers. To implement a file system you need to manage various on disk structures like data blocks, nodes, allocation bitmaps, and a superblock that has high level info about the file system. inodes also store metadata like file size, ownership and block pointers. we then saw file systems layouts like system V file system, which has a centralized node table, and then the Berkeley Fast File System, FFS, which improves performance by grouping related data and meta data into cylinder groups. And to support large files nodes use techniques like multi level indexing through indirect pointers. ...
Read more

Week 1: About CSUMB and Online Learning Strategies

Image
This week we learned a little bit of the history of CSUMB as well as information about the School of Computing and Design. It is cool to know in 1984 the school grew out of Fort Old. Not only that but in the SCD you can get a minor in "Communication Design" and "Computer Science and Information Systems." With starting our journey online, we also reviewed key strategies to succeed in online learning. Some tips to stay ahead are to plan study times, connect with classmates, ask questions when you need help, and to check in to the class page frequently. Staying up to date with the course is important as you could miss an assignment or an email that you need.  This week's assignments were pretty easy and a smooth start to the year. A few quizzes about videos, and then creating a LinkedIn and Blogger account, and uploading a video on an introduction to ourselves. There was also an outline to complete which is good as my English skills are lacking as I have not taken ...
Read more