Category: University

The Frustrated Youth > Blogs > University

Understanding The Basics – Dynamic Programming

Dynamic Programming is an algorithmic paradigm that solves a given complex problem by breaking it into subproblems and stores the results of subproblems to avoid computing the same results again. Following are the two main properties of a problem that suggest that the given problem can be solved using Dynamic programming. 1) Overlapping Subproblems 2) […]

What is round robin scheduling in operating system?

The round robin scheduling algorithm is designed especially for time sharing systems. It is similar to First Come First Serve scheduling, but preemption is added to switch between processes. A small unit of time, called a time quantum or time slice, is defined. A time quantum is generally from 10 to 100 milliseconds. The ready […]

What are some concepts/algorithms/data structures that every computer science student should know?

You should be aware of a few basic techniques that occur over and over again in many algorithms: Brute Force Divide and Conquer Greedy Programming Dynamic Programming There are more, but these are a good set to start with. Introductory algorithms classes usually go over several classical problems and algorithms that demonstrate one or more of these […]

The Basic Understanding -Greedy Algorithms

How To Understand In the Game of Chess ,everytime we make a decision about a move, we have to think about the future consequences as well.But in the gsme of Tennis or football, our action is based on current situation, which looks great right at the moment,without bothering about the future consequences. This means in […]

The Knight’s tour problem- Backtracking Algorithm

Backtracking is an algorithmic paradigm that tries different solutions until finds a solution that “works”. Problems which are typically solved using backtracking technique have following property in common. These problems can only be solved by trying every possible configuration and each configuration is tried only once. A Naive solution for these problems is to try […]

N Queen Problem – Backtracking Algorithm

What is backtracking ? In Backtracking algorithms we try to build a solution one step at a time. If at some step it becomes clear that the current path that we are on cannot lead to a solution we go back to the previous step (backtrack) and choose a different path. The Knight’s Tour Problem […]

error: Content is protected !!