TCP Timers, a Data Structures Test, and an Unexpected Algorithm Revision

Friday was a relatively relaxed day compared to some of my recent study sessions. I completed a two-hour Computer Networks lecture, took my second Data Structures test, and discovered that I needed to revisit a few algorithm concepts.

I also managed to leave the office a little early, although the reason I gave my manager wasn't exactly the real one. More on that later.

What I Studied Today

I completed a two-hour lecture on TCP timer management in Computer Networks.

The lecture covered the different timers used in TCP during data transfer. I focused particularly on the timeout timer and the role of timers in managing communication between the sender and receiver.

I had already worked on TCP connection establishment and termination in my earlier preparation, so this lecture helped me continue with the broader topic of TCP.

I completed the lecture during the morning and around my commute between home and office. It was a useful way to fit some study time into a regular workday.

Data Structures Test 2: 11 Out of 25

At night, I took my second Data Structures test.

I scored 11 out of 25 marks.

Here is the breakdown:

• Correct answers: 8
• Incorrect answers: 1
• Skipped questions: 6

The score was lower than I had hoped for, especially because the test was labelled as a Data Structures subject test.

However, when I opened it, I found some questions from Algorithms as well. These included time complexity, Big Theta, Big Omega, and other asymptotic notation concepts.

I hadn't revised those algorithm topics recently, so I wasn't completely comfortable with all the questions.

Still, I decided to complete the test rather than close it just because some questions were unfamiliar.

And honestly, I think that was worth doing.

Revisiting Algorithm Complexity

One useful thing about the test was that it reminded me of some concepts I had not been actively using.

I have done quite a bit of programming in the past, so basic complexity analysis and Big Omega weren't completely unfamiliar to me.

But the definitions of small-o, small-omega, and small-theta had become a little rusty.

I realised that I needed to revise these concepts before they start costing me marks in future tests.

I also added a note to my Algorithms revision material about identifying the dominant term in a geometric progression.

My takeaway was that the dominant term determines the overall asymptotic behaviour, rather than simply memorising a formula without understanding which term matters.

These are the kinds of small observations I want to preserve in my revision notes so I can revisit them later.

Why I Still Consider the Test Worthwhile

An 11/25 score isn't particularly exciting, but I don't think every test needs to produce a satisfying result to be useful.

This test exposed a gap in my preparation. I was comfortable with some of the underlying programming concepts, but I hadn't revised all the mathematical definitions and notation required for GATE-style questions.

That distinction matters.

I don't want to assume that being comfortable with programming automatically means I'm prepared for every algorithm question in GATE CSE.

The test gave me a reminder that I need to keep the theoretical side of Algorithms fresh as well.

A Little Office Incident

Friday also had a small personal story attached to it.

I left the office at around 5 PM and reached home at approximately 7:30 PM.

I told my manager that I needed to leave early because there was Ganpati Visarjan at my home. The actual reason was that I didn't have any meaningful work left to do, and I didn't want to spend another hour sitting there doing nothing.

So, yes, I lied about the reason.

I know that isn't something to turn into a grand achievement. I simply wanted to use my time differently instead of staying at the office without anything productive to do.

At least I got some time to relax after reaching home.

Weekend Plan: Five Questions from Each Completed Subject

One thing I haven't managed to do this week is my planned daily question practice.

I had set myself a target of solving at least five questions from each completed subject or topic, but I haven't completed that target yet.

So, I'm trying to make up for it over the weekend.

My plan is to use Saturday and Sunday to work through those practice questions while also keeping my upcoming C Programming test in mind.

I have a subject-wise C Programming Test 2 scheduled for Sunday.

I also have some pending notes, particularly in Theory of Computation, which I still need to work on.

I haven't completed these tasks yet, so I'm keeping them as targets rather than pretending they're already done.

What I Realized Today

The biggest takeaway from Friday was that a subject-wise test can still expose gaps from other subjects.

I went into a Data Structures test and ended up revisiting algorithm complexity concepts that I hadn't revised recently.

That was useful, even though the score wasn't what I wanted.

I also realised that I need to make room for regular question practice instead of relying only on lectures and occasional tests.

With my October syllabus deadline approaching, I need to balance completing the remaining topics with keeping the completed ones fresh.

Tomorrow

Saturday is going to be about catching up on practice.

My target is to solve at least five questions from each completed subject or topic across the weekend. I also want to make progress on the pending notes, especially TOC.

Then, on Sunday, I'll take my second subject-wise C Programming test.

I'll see how much of the weekend plan I can actually complete and record the results honestly.

Day 5 complete.