Robert’s blog

Here’s the plan. We are on week 13.

With regard to the Introduction to Programming II course, I have completed everything that is required of me up until week 14, scissors and editable shape tools included. However, tha scissors tool needs some tweaking. I’ve been asked to write a log on the progress I’ve been making to hand out with the final assignment, so I should be taking special care so as not to forget to include important details.

I’ve also made this Gantt chart to organize the features I need to be delivering by the end of the course and I think I am currently doing alright. I will probably not make any changes to the application until next week since I am exhausted - I’ve been doing lots of coding and I’ve written lots of documentation because the midterms’s deadline was yesterday.

With regard to Discrete Mathematics, things are not looking as pristine. I need to solve weeks 7 and 8 problem set, weeks 9 and 10 problem set. I also need to watch the videos from weeks 10 to 13 and solve the questionnaires in each section. I’ve noticed that I have some peer-graded assignments that I could not complete from week 10… Let’s hope it doesn’t have a negative impact on my final mark… It says ungraded so it probably won’t.

Consequently, this is the list of thing I need to do in order to get back to speed:

• Add to the calendar the reminder for the next live lectures.
• Print weeks 13 and 14 problem set.
• Fix scissors tool.
• Solve weeks 7 and 8 problem set.
• Watch week 10 lectures and Aziza’s webinar.
• Solve weeks 9 and 10 problem set.
• Watch week 11 lectures and Aziza’s webinar.
• Watch week 12 lectures and Aziza’s webinar.
• Solve weeks 11 and 12 problem set.
• Watch week 13 lectures and Aziza’s webinar.
• Hand in the peer-graded assignment on induction and recursion.

From that long list. Today I’ll be taking a look at:

• Solve weeks 7 and 8 problem set.
• Watch week 10 lectures and Aziza’s webinar.

I probably won’t finish any of the two, but I need to start somewhere.

Ok, midterms are over.

I’m quite exhausted ngl, and on top of that I need to catch up with the material covered in the past two weeks. However, I think I did great on both assignments.

As for today, I think that I will device a plan on how to get back to speed. I will also print the problem sets I should have solved. Those exercises might be a good way of resuming my studies.

Yesterday was the first day of week 7 of the semester, which implies I should start revising the material on predicate logic for my discrete mathematics course. Before moving on, however, I have yet to complete a peer-graded assignment that is due next week. I also need to start revising the material for this week on data visualisation for my Introduction to Programming II course.

Moreover, today I’ll be attending the first lecture on financial investment principles that I signed up to last week so I’ll be taking a look a the notes prior to that. And I must not forget about my health. I will have to hit the gym sometime throughout the day.

Consequently, I’ll be tackling these tasks today:

• Hand in the peer-graded assignment on propositional logic.

• Start revising the material on predicate logic.

• Attend the lecture on financial investment principles.

• Train legs.

• Go for a walk.

I came to the realisation that I now longer have as much time as I did when I was a full-time student, and so, I decided to skip the last two items on this list.

• pp.12 exercises 1–4.

• pp.13 exercises 5, 6, 8 (a, b, d, e, g and h), 9 (a, b, c and h), 10, 11, 13 and 14.

• pp.14: exercises 22–23.

• pp.15 exercises 32-37.

• pp.35: exercises 9, 30, 31 and 34.

However, since the problem set has key exercises that the tutors wants us to do, I tackled those ones during the past weekend.

• Problem set on propositional logic.

I also started writing myself a cheat-sheet with all the key pieces of information I need to remember during the test.

Today I continued solving the exercises I had for this week. More precisely I solved pp.14: exercises 22–23. Consequently, this is how my TO-DO list is currently looking like:

• pp.12 exercises 1–4.

• pp.13 exercises 5, 6, 8 (a, b, d, e, g and h), 9 (a, b, c and h), 10, 11, 13 and 14.

• pp.14: exercises 22–23.

• pp.15 exercises 32-37.

• pp.35: exercises 9, 30, 31 and 34.

I had serious trouble identifying the hypotheses and the conclusion in the statements and therefore I’ll write down the annotations I’ve made here. These are the rules to identify which is “p” (hypotheses), and which is “q” (conclusion) in conditional statements.

• If p, then q.
• If p, q.
• p is sufficient for q.
• q if p.
• q when p.
• A necessary condition for p is q.
• q unless ¬p.
• p implies q.
• p only if q.
• A sufficient condition for q is p.
• q whenever p.
• q is necessary for p.
• q follows from p.

For bi-conditional statements:

• p iff q.
• If p then q, and conversely.
• p is necessary and sufficient for q.