1. (a) What do you mean by Data abstraction?
(b) Di\ufb00erence between \u201cC structure\u201d and \u201cC++ structure\u201d.
(c) Di\ufb00rence between a \u201cassignment operator\u201d and a \u201ccopy constructor\u201d.
mean? Where would we use it?
(b) How do we throw polymorphically?
(c) When we throw this object, how many times will it be copied?
5. Develop a class for hash table using linear probing and neverUsed concept to handle an erase operation. Write complete C++ code for all the methods. Include a method to reorganize the table when (say) 60% of the empty buckets have never used equal to false. The reorganization should move pairs around as necessary and leave a properly con\ufb01gured hash table in which neverUsed is true for every empty bucket.
8. (a) Solve the following 0/1 Knapsack Problem using dynamic programming
n=4, m=30, (w1 , w2 , w3 , w4) = (10,15,6,9) and
(p1 , p2 , p3 , p4) = (2,5,8,1).
This action might not be possible to undo. Are you sure you want to continue?