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

  • 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 ...
  • Print All Combinations of a Number as a Sum of Candidate Numbers
    S ource P roblem Given a target number, and a series of candidate numbers, print out all combinations, so that the sum of candidate numbers ...
  • Largest Binary Search Tree (BST) in a Binary Tree
    Source Problem Given a binary tree, find the largest Binary Search Tree (BST), where largest means BST with largest number of nodes in it. T...
  • suffix tree
    Source1 Source2 Suffix Tree Applications Suffix Trees can be used to solve a large number of string problems that occur in text-editing,...
  • Rat in a Maze
    Source A Maze is given as N*N binary matrix of blocks where source block is the upper left most block i.e., maze[0][0] and destination block...
  • Searching for Patterns
    Source Given a text txt[0..n-1] and a pattern pat[0..m-1] , write a function search(char pat[], char txt[]) that prints all occurrences of ...
  • 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 ...
  • Regular Expression Matching
    Source Implement regular expression matching with support for ‘.’ and ‘*’. ‘.’ Matches any single character. ‘*’ Matches zero or more of ...
  • Reader write lock without any priority
    #include <pthread.h> enum locktype{     READER =0,     WRITER }; typedef struct QNode {     locktype  _type;     struct QNod...
  • 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...

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.