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 […]

Sliding Window Protocol

We have learned how TCP works. It involves a handshake and acknowledgment from the receiver for each packet or the frame received. This procedure looks fine when the transmission is for smaller data. What if there are millions or billions of data packets or frames? In the present Internet transaction era, it is quite possible. […]

Stack in Data Structures

Abstract Data Types: It is a set of classes or types for objects such that their behavior is defined by a set of operations and values. The definition depicts that only operations can be performed but mention neither how these operations work at the ground level nor how the storage space is consumed. The stack […]

Enhanced Merge Sort

What is Merge Sort? Not remembering? We got you covered. Click here to revise Merge sort. Now, we shall look how we can improvise the conventional or traditional approach of Merge sort. Note: This particular article has been derived from a research paper. The reference to the paper is provided at the “Reference and Recommendations” […]

Quick Sort

Let me start with a question. Have you ever been to a school prayer or assembly? How do you stand there? Based on height. When you are asked to arrange among yourselves, students know that one is the tallest and the other is the smallest of all. They stand at both ends. The remaining would […]

Merge sort

“Together we stand, separated we fall!” Will modify this to “Divide and Conquer”. What we require here is, how to divide the given set of elements and merge (conquer) them in order, basically sort. How this division flows and merging done? Let’s get through it. Algorithm: Step 1: Divide the array into sub-arrays until a […]

Binary Search

Imaginary situation: “Assume there was a crime incident at some large building. There is a team of police officers who arrived at the crime scene. They are searching and collecting evidence from different parts of the building.” The question, in our context, is not what the crime is! The relation is how will they search? […]

Network Performance

“Sir, I am unable to join the class as my network connectivity is poor!” A very common conversation during these days (ignoring the facts!). So, when you say your network connectivity is poor it does mean to the performance of the network. Why my network connection is slow? What are the factors affecting speed? Let’s […]