Fifth Assignment Spring 2011 CS502 5
Posted on Monday, 04 July 2011
in SPRING2011
You are bound to answer the following queries relating to Polynomial time/space algorithms:
Read 806 times
4th Assignment Spring 2011 CS502
Posted on Sunday, 26 June 2011
in SPRING2011
What technique has been discussed in this paper for string pattern matching and its benefit? 1.5
Read 588 times
Third Assignment Spring 2011 CS502
Posted on Sunday, 26 June 2011
in SPRING2011
Consider the chain matrix multiplication for 4 matrices:
A1 . A2 . A3 . A4
(5×6) (6×3) (3×7) (7×10)
Compute the cost table m in the dynamic programming algorithm for the chain matrix
multiplication
A1 . A2 . A3 . A4
(5×6) (6×3) (3×7) (7×10)
Compute the cost table m in the dynamic programming algorithm for the chain matrix
multiplication
Read 252 times
Spring 2011 CS502 2
Posted on Friday, 06 May 2011
in SPRING2011
Question# 1 (10)
After analyzing the pseudo code for an algorithm following recurrence relation have been developed you are required to solve this recurrence relation using iterative method and make proper assumptions for final solution and give answer at end in asymptotic form.
Read 763 times
Spring 2011 CS502 1
Posted on Sunday, 10 April 2011
in SPRING2011
Guidelines
RULES FOR CALCULATING TIME COMPLEXITY AND BIG-OH
Rule 00
Normally these formulas are very handy:
If x y = z then y z x = log
RULES FOR CALCULATING TIME COMPLEXITY AND BIG-OH
Rule 00
Normally these formulas are very handy:
If x y = z then y z x = log
Read 619 times