tHe puZZlingG wOrlD

A collection of "interesting" data structure and algorithm questions

Saturday, June 4, 2011

Dynamic programming references

http://www.cs.uiuc.edu/class/fa08/cs573/lectures/05-dynprog.pdf
http://www.csee.ogi.edu/class/cs532/10.pdf
http://web.iiit.ac.in/~avidullu/pdfs/dynprg/Dynamic%20Programming%20Lesson.pdf
http://www.youtube.com/watch?v=V5hZoJ6uK-s
http://geeksforgeeks.org/?p=12635
http://geeksforgeeks.org/?p=12819
Posted by Nimesh Bhagat at 9:20 PM
Email ThisBlogThis!Share to XShare to FacebookShare to Pinterest

No comments:

Post a Comment

Newer Post Older Post Home
Subscribe to: Post Comments (Atom)

Total Pageviews

SUBSCRIBE TO

Posts
Atom
Posts
Comments
Atom
Comments

Popular Posts

  • Matrix Chain Multiplication
    Source Given a sequence of matrices, find the most efficient way to multiply these matrices together.  The problem is not actually to per...
  • How does gdb work ? part 2
    The magic behind INT 3 BACK TO TOC It is time to dig a bit into subject that is not adored by most of the programmers and that is assembler ...
  • Saving a Binary Search Tree to a File
    Source Describe an algorithm to save a Binary Search Tree (BST) to a file in terms of run-time and disk space complexity. You must be ab...
  • Normalize a path by removing redundant separators and resolving up-level references
    Write a function to normalize a path by removing redundant separators and resolving up-level references.  I.e., given "/foo/bar//./ba...
  • Computer Binomial Coefficient
    Source Following are common definition of  Binomial Coefficients . 1) A  binomial coefficient  C(n, k) can be defined as the coefficient...
  • Top and Bottom Halves
    Source 10.4. Top and Bottom Halves One of the main problems with interrupt   handling is how to perform lengthy tasks within a handle r ...
  • Print all interleavings of given two strings
    Source Given two strings str1 and str2, write a function that prints all interleavings of the given two strings. You may assume that all ...
  • Compute the minimum or maximum of two integers without branching / operators
    Source On some rare machines where branching is expensive, the below obvious approach to find minimum can be slow as it uses branching. ...
  • Part 2: How inheritance, encapsulation and polymorphism work in C++
    Source What if we try something even more complicated BACK TO TOC The thing is that you can’t. Lets say we try to create even more complica...
  • Understanding “extern” keyword in C
    Source Understanding “extern” keyword in C July 19, 2009 I’m sure that this post will be as interesting and informative t...

Blog Archive

  • ►  2012 (21)
    • ►  March (6)
    • ►  February (6)
    • ►  January (9)
  • ▼  2011 (59)
    • ►  December (9)
    • ►  November (3)
    • ►  October (2)
    • ►  September (1)
    • ►  August (15)
    • ►  July (6)
    • ▼  June (8)
      • Time complexity
      • Program to count number of set bits in an (big) array
      • A binary tree problem - Populating next right poin...
      • Print Edge Nodes (Boundary) of a Binary Tree
      • A Boolean Array Puzzle
      • Distance Maximizing Problem
      • Dynamic programming references
      • The ugly number
    • ►  April (1)
    • ►  March (14)

About Me

Nimesh Bhagat
View my complete profile

Followers

Subscribe To

Posts
Atom
Posts
Comments
Atom
Comments
Simple theme. Theme images by luoman. Powered by Blogger.