CS371p Spring 2021: Luca Chaves Rodrigues Noronha dos Santos

What did you do this past week?

I centered my past week entirely around the two career fairs that took place within CNS. Everyday spent last week was focused almost primarily on researching companies, writing applications and talking to companies. I learned an immeasurable amount about the industry and I feel almost somewhat empowered by the amount of ambition that I gained.

What’s in your way?

I do not feel like there is a ton in my way at the moment. Spring Break is finally here and so my hopes are that I am capable of realizing all that which I have decided to work on this upcoming week. That said, I might be somewhat anxious that I will not complete everything.

What will you do next week?

Start work on my next game project, continue to send out applications, finish reading my Network Security textbook, devote time to the Allocator project and start taking the first steps to set up a website (learning fullstack).

If you read it, what did you think of the Liskov Substitution Principle?

I have not had the opportunity to read this week’s paper yet.

What was your experience of heap arrays, allocators, and digits iterator? (this question will vary, week to week)

I am and have been fairly familiar with heap arrays. Iterators are something that I had to get a little but more familiar with as a byproduct of working on the last few projects for this class. However, am in depth discussion about allocators is something that I had not had the opportunity to be a part of as far as I can remember. The most similar idea that I had worked with is kernel page allocation for OS. Gladly it seems like there are a lot of overlaps between the two, so I am glad that allocators were not something that I had too much of a hard time grasping.

What made you happy this week?

The satisfaction of accomplishment and the eagerness to continue to work.

What’s your pick-of-the-week or tip-of-the-week?

For those of us working with vectors, specially in the current project, it might seem natural to at some point use the method insert(iterator i, type T). In practice, the method allows you to place an object that matches the vector type at a specified position. Instead of random access indexing, the method uses an iterator as a frame of reference for the location of the insert, and places T right behind the object pointed to by i. Using this method while iterating over the entire vector can thus be tricky, because we end up modifying its values during the iterative process itself. Vectors are stored contiguously in memory, so doing so may leave you with in invalid iterator i, and with a very possible segmentation fault. Insert actually returns the element that has just been placed, so instead you can simply set i equal to the method call, and increment i by one. That way this portion of your code should run error free!!