Network profile

dulaj sanjaya

Reputation

239

Next privilege

250 Rep.

View close votes

4/5

0 posts edited

0 helpful flags

19 votes cast

4	can we solve dynamic knapsack problem using Memoization approach?
3	Is it possible to produce different shortest path trees using bellman ford and Dijkstra algorithm?
2	Is It possible to change the side of 0 and 1 in Huffman tree?
2	Identity of object in OOP
1	modify Dijkstra's algorithm to compute shortest path only for the vertex which is no more than three edges away from the start vertex

View more →

This user has no recent positive reputation changes

View more →

1	Why is fail[1] in KMP Algorithm always 0?
1	Why is this flow a max flow?
0	Stereotype in UML
-1	“In object-oriented programming, the program is organized around its data”

This user has not participated in any tags

63	Distributed vs parallel computing