Articles, Blog , , , , , , , , , , , , , , 0 Comments

Hello friends.welcome to GeeksforGeeks .today we are going to learn worst fit algorithm for memory management. What is worst fit.Worst Fit allocates a process to the partition which is largest sufficient among the freely available partitions available in the main memory. Given block sizes and process size we need to find which block is assigned

Read More

Articles, Blog , , , , , , , , , , , , , , , , , , , , 100 Comments

Arduinos! I’m going to talk about what they are, what they can do, and the basics of how to set one up to do simple things like make an LED dimming circuit, control the speed of motors, and even make a simple oscilloscope. So what is an Arduino? I’m sure you’ve heard about these things

Read More

Articles, Blog , , , , , , , , 2 Comments

So a useful thing to know about a social network is whether everything is connected to everything else or whether there’s some subset of nodes that’s isolated from the main body of nodes. To put it in another way: whether any given pair of nodes in the network can communicate by passing messages from friend

Read More

Articles, Blog , , , , , , , , , , 0 Comments

Let me show you an interesting application of random numbers. You know what pi is. It’s the area of a circle with radius one, and of course, there are formulas for computing pi to any desired precision, but that’s no fun. We’ll compute pi by shooting darts. Specifically, we’ll throw random darts into the square.

Read More

Articles, Blog , , , , , , , , 0 Comments

To make some of the issues, we’re going to be talking about simpler. We’re going to focus in on some sense very simple kinds of problems. Problems that take inputs just like what we’ve been looking at. Be the graph or less, whatever happens to be and processes that to get an answer, and the

Read More

Articles, Blog , , , , , , , , 2 Comments

This brings us to a slightly more interesting problem called the Top K Problem. Here’s the idea. Imagine we’ve got our list of values L, and there’s n values in the list. We can compute the max or the second max, the second largest, just like we’ve been doing, but in some sense, it doesn’t

Read More

Articles, Blog , , , , , , , , , , , , 1 Comment

I’ve always had a passion for computing, and Prague College seemed like the perfect place to further my studies, and the lecturers and students when I visited the Open Day were all very friendly. It feels great to be at a small private institution in the heart of Prague. It’s a lovely school with great

Read More

Articles, Blog , , , , , , , , , , , , , , 2 Comments

Hello friends.welcome to GeeksforGeeks. Today we are going to learn first fit algorithm for memory management. What is first fit.In the first fit, partition is allocated which is first sufficient from the top of Main Memory. Given block sizes and process size we need to find which block is assigned to which process under first

Read More

Articles, Blog , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , 98 Comments

Hello World! It’s Siraj and let’s make our own language translator using TensorFlow Today there are about 6,800 different languages spoken across the world and in an increasingly globalised world nearly every culture has interactions with every other culture in some way that means there are an incalculable number of translation requirements every second of

Read More

Articles, Blog , , , , , , , , , , 37 Comments

Prim’s algorithm for computing the minimum spanning tree of a graph. Now, let’s start off with some basic definitions. What is a spanning tree? A spanning tree is a subgraph that has the same vertex set as the original graph and is also a tree which means that it must be connected and must not

Read More