0/1 Knapsack - How is it NP Complete?

Knapsack problem is called Weakly NP complete or pseudo-polynomial. Time complexity of solving it is - O(n*W) .The value of W is linear but the length of W is exponential - length in terms of bits. Pseudo polynomial means - running time is a polyno...