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

  • 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/p...
  • The Kth element in the sorted arrays
    source P roblem: E asy: Given 2 sorted arrays of size n, give an efficient algorithm to find the kth largest number. S olution: Over...
  • Median of Two Sorted Arrays
    Source There are two sorted arrays A and B of size m and n respectively. Find the median of the two sorted arrays. The overall run time ...
  • Searching a 2D Sorted Matrix Part I
    Source Problem Write an efficient algorithm that searches for a value in an n x m table (two-dimensional array). This table is sorted alon...
  • How does gdb work ? part 1
    Source : http://www.alexonlinux.com/ How debugger works Introduction In this article, I’d like to tell you how real debugger works. What ha...
  • Are array members deeply copied?
    Source In C/C++, we can assign a struct (or class in C++ only) variable to another variable of same type. When we assign a struct variable...
  • Computer Binomial Coefficient
    Source Following are common definition of  Binomial Coefficients . 1) A  binomial coefficient  C(n, k) can be defined as the coefficient...
  • Computer Networks course online
    Source 40 videos Total length: 39 hours Description: Lecture Series on Computer Networks by Prof. S.Ghosh,Department of Computer Science ...
  • Implement strstr() to Find a Substring in a String
    Source Problem Write C code to implement the strstr (Search for a substring) function. Do not use any system library such as strlen .
  • 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. ...

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.