0/1 Knapsack Problem

We have seen the problem of a thief in the earlier posts, Fractional Knapsack problem. If you haven’t, check it out now. From the fractional Knapsack problem, we are aware that things can be partitioned and taken according to the profit. But from the heading itself one can understand that in the 0/1 Knapsack problem, […]

Dynamic Programming

“Dude! Can you count this money?” Assuming the money given consists completely of 100 rupee notes, let’s say it summed up to 1900. Now, I have given you a one hundred rupee note. How much is it now, in total? 2000? Did you count all the money again or just added one hundred to the […]

Backtracking

How many of you wanted to be seated at the corners of your bench or table during school? Well, I preferred it. Why so? It would be easy for me to rush out of the class when the final bell rang. Those days were awesome. Why are we supposed to remember those golden days here? […]

Subnetting

Imagine: “I have written a letter to my friend working in a large company in the department, say x. When I sent my letter, I mentioned his office address and it had reached the destination. Now, as it is a large company it includes numerous departments. When my letter reaches his office, the administrator or […]

Selective Repeat Protocol

We have already learned about Go Back N, one of the sliding window protocols. If you are not aware, here you go. Now, we shall look into one more implementation of sliding window protocol, i.e. Selective Repeat. Selective Repeat: The method used in Go Back N is cumulative acknowledgment to acknowledge the packets. Now, selective […]

Go Back N

We have roamed on the ground floor of the sliding window protocol in the earlier post. If you haven’t gone through it, here is the route. There are two major sliding window protocols. Now, we shall look at the implementation of one of the sliding window protocols, GoBackN. Go Back N (GBN): The sender window […]