From ME to CS Journey

 So this week we covered the following topics Pseudocode Important Problem Types (sorting, searching) Fundamental Data Structures (linked list, stack, queue)  Graphs Algorithm Analysis framework    It was a good review of topics that I've seen in previous course work and I realize that an essential topic, graphs, is something I need to focus more attention on, since it is very key in developing efficient and effective algorithms.  Before I was told that graphs were important, but for some reason the reasoning never clicked in my head.  I definitely watched various videos online to gain a better understanding and pulled up my old notes from my previous discrete structures course!  

  What went well? Triaging bugs for libreoffice went fairly smooth, though was challenging to figure some bugs since they were features that I didn't even know existed.   What would you improve? Im not sure what I would improve, since it went fairly smooth.  It was difficult on my part because I was traveling during most of it, but the supervisor was very accommodating and worked around each others schedules.  What was the most impactful part? Being able to support the open and free libreoffice office suite.  I was an early benefactor of the software when I was younger when the software was called openoffice.  So it was nice giving back the time :)  What challenges did you face? Scheduling and time do to me traveling during most of it.   What advice do you have for future SL students? Have fun and be curious :).  The fun part was figuring out bugs I had no clue about but was able to walk through steps to figure them out!