My Today's paper:
Total Q are 26
mostly quizes are from past papers
From Moaz n Tariq hanif Files
subjective:
1: Draw a binary tree for this order of matrix multiplication.(A1(A2A3))(A4A5)
2: How we maintain Heap property?
3:How to construct an optimal solution for o/1 knapsack problem?
4:How can we avoid exponential running time of o/1 knapsack problem using dynamic programming?
5: Illustrate how radix works on the folloing words:
COW,DOG,SEA,RUG,ROW,MOB,BOX,TAB
baqi yaad nahi
best of luck
Total Q are 26
mostly quizes are from past papers
From Moaz n Tariq hanif Files
subjective:
1: Draw a binary tree for this order of matrix multiplication.(A1(A2A3))(A4A5)
2: How we maintain Heap property?
3:How to construct an optimal solution for o/1 knapsack problem?
4:How can we avoid exponential running time of o/1 knapsack problem using dynamic programming?
5: Illustrate how radix works on the folloing words:
COW,DOG,SEA,RUG,ROW,MOB,BOX,TAB
baqi yaad nahi
best of luck