Tutorialspoint.dev
Welcome To Tutorialspoint.dev
Officially launched 18th May 2019
Digital Electronics & Logic Design GATE CS

Read-Only Memory (ROM) Classification and Programming

Read-Only Memory (ROM) is the primary memory unit of any computer system along with the Random Access Memory (RAM), but unlike RAM, in ROM, the binary information is ...
Software Engineering

Software Engineering Extreme Programming (XP)

Extreme programming (XP) is one of the most important software development framework of Agile models. It is used to improve software quality and responsive to custome...

Dynamic Programming

12 Dynamic Programming Please wait while the activity loads. If this activity does not load...
Bit Magic Competitive Programming Bit Magic

Bit Tricks for Competitive Programming

In competitive programming or in general some problems seems difficult but can be solved very easily with little bit magic. We have discussed some tricks in below pre...
Dynamic Programming Dynamic Programming

How to solve a Dynamic Programming Problem ?

Dynamic Programming (DP) is a technique that solves some particular type of problems in Polynomial Time. Dynamic Programming solutions are faster than exponential bru...
Dynamic Programming Dynamic Programming

Optimal Substructure Property in Dynamic Programming DP-2

As we discussed in Set 1, following are the two main properties of a problem that suggest that the given problem can be solved using Dynamic programming: 1) Overlapp...
Bit Magic Dynamic Programming Dynamic Programming

Bitmasking and Dynamic Programming Set-2 (TSP)

In this post, we will be using our knowledge of dynamic programming and Bitmasking technique to solve one of the famous NP-hard problem “Travelling Salesman Pr...
Dynamic Programming Fibonacci Dynamic Programming

Overlapping Subproblems Property in Dynamic Programming DP-1

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 com...
Dynamic Programming NPHard Dynamic Programming

Vertex Cover Problem Set 2 (Dynamic Programming Solution for Tree)

A vertex cover of an undirected graph is a subset of its vertices such that for every edge (u, v) of the graph, either ‘u’ or ‘v’ is in ve...
Dynamic Programming Dynamic Programming

Dynamic Programming High-effort vs. Low-effort Tasks Problem

You are given n days and for each day (di) you could either perform a high effort tasks (hi) or a low effort tasks (li) or no task with the constraint that you can ch...

Subscribe to Our Newsletter