Answer:
Instance variables can be declared anywhere inside a class.
Although there isn't any rule to declare instance variables before methods, and they can be declared anywhere in the class, they cannot be declared inside method definitions of class.
///////////////////////////////////////////////////////////////////////////////////////////////////////////
<em>By convention class names begin with an uppercase letter, and method and variable names begin with a lowercase letter.</em> - True.
<em>Instance variables exist before methods are called on an object, while the methods are executing and after the methods complete execution.</em> - True.
<em>A class normally contains one or more methods that manipulate the instance variables that belong to particular objects of the class.</em> - True
Answer: Coaxial Cable got its name as "coaxial cable" as it has two physical layer of channel in same cable axis.
Explanation: Coaxial cable is the cable that is basically composed of copper and shield of other materials.They have two physical channels and having a insulating layer between them and the outer layer serving as the ground layer. Both the channel of physical layer have the same axis that why it is termed as "coaxial".These cables are commonly used in the cable televisions , sometimes in telephone line etc.
Answer: True
Explanation:
Subset sum problem and Knapsack problem can be solved using dynamic programming.
In case of Knapsack problem there is a set of weights associative with objects and a set of profits associated with each object and a total capacity of knapsack let say C. With the help of dynamic programming we try to include object's weight such that total profit is maximized without fragmenting any weight of objects and without exceeding the capacity of knapsack, it is also called as 0/1 knapsack problem.
Similar to knapsack problem, in subset sum problem there is set of items and a set of weights associated with the items and a capacity let say C, task is to choose the subset of items such that total sum of weights associated with items of subset is maximized without exceeding the total capacity.
On the basis of above statements we can say that subset sum problem is generalization of knapsack problem.
