Cloud computing has been a buzz around the world for a long time and AWS is one of the top cloud providers. Before I delve into details let’s take a pause and learn a little about what the cloud is all about. Alright, I will simply summarize the cloud. Earlier, if we needed to host […]
‘The blog is my first priority of all!’ It might be true and might not be but what we are concerned about here is the word priority. It is simple in English and in any language meaning putting them first ahead of all. In order to do that we should be aware that why we […]
From our earlier posts, we are aware of what a heap is and how basic operations are performed on a heap. One of the basic operations is deletion. Have we ever given a thought to utilizing the deletion operation to execute some other operation? To be honest, even I didn’t know it for some time. […]
Have you heard of ‘heap of grass’? How is it arranged? The bottom will be of larger width compared to the top, of course, the science. We can relate that to our topic, Heap data structure. We have learned about binary trees and their representation in an array and a Linked List. This heap data […]
Earlier we have learned about Linked List and one of its types Doubly Linked List. Also, we have gone through how binary trees are represented using arrays. If you aren’t aware, you can check them out from the links provided in the “References and Recommendations” section. So, here we shall discuss how to represent binary […]
If I am not wrong, we had an introduction and implementation of Linked List in the earlier posts! If you have not gone through it yet, the links are provided in the section, “Reference and Recommendations”. So, taking the discussion of linked lists a little ahead we will now raise a question. Can there be […]
This post contains operations on Linked List such as Creation, Insertion, Deletion, Concatenation, and Reversing. It also includes a downloadable file containing all the codes implemented as one.
From basic English, we are aware of the difference between linear and non-linear. In simple terms, linear means straight, and non-linear mean the opposite i.e. not straight. Similarly, data structures are divided into linear and non-linear. Linear Data Structure: The data elements are arranged in a linear order where each and every element is attached […]
In the earlier posts, we have learned about trees and some its types. If not remembering, check it out! Theoretically, it is fine. But how will we represent them and make sense while actually coding them? Let’s clear our way. Representation of Binary Trees using Arrays: From the above figure, we can conclude that it […]
I am pretty sure that we all have seen trees, at least in cartoons! Let us fill a questionnaire regarding the details of a tree. Which is the most vital part of a tree? Or the other way, where does a tree start growing? Root, obviously.What does a tree have connecting to the roots, directly […]
I hope we all have been in a line to pick our order at the cafe or restaurant. Technically, that line is a queue. Who will be served first? The one first in the queue or the later one? Well yes, the first one of course! What do you observe in a queue? First come […]
Have you been to a restaurant or any food services? Let’s be more friendly. Have you been to a street food stall? Imagine the two situations, the presence of a crowd and a few people. Will the delivery rate be the same? Will he supply the orders in the same way in both scenarios? Of […]
When someone called you on phone, have you experienced any voice breaks? This happens very often. Well, this can be related to our topic. UDP or User Datagram protocol is also a transport layer protocol that works less dominant compared to TCP (Transmission Control Protocol). It is used less but has its own importance. Let’s […]
We have learned how data is transmitted between the network devices or across the networks. One of the most applied models is OSI (Open Systems Interconnection). If you are unaware of the network model, we got you covered. We know that the transport layer is layer 4 and just above the network layer. What happens […]
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, […]
Techprodezza 