Answer: object that persist set of values and operations as behavior
Explanation: Abstract data types(ADT)are those object value which are dependent upon the collection of the values and collection of the operations.The organization of the data object is not specified in ADT but the operations that are to be carried out are defined in it.
The implementation individuality displayed by the ADT and hiding of the representation or design makes it abstract.
Answer:
True
Explanation:
<u>Algorithm for push function</u>
The method of placing data on a stack is called a push operation.
It involves these steps −
- Check that the stack is complete.
- If the stack is complete, it will cause an error .
- Increases top to point next empty room if the stack is not complete.
- Adds the data component to the place of the stack where top is pointing.
<u>Algorithm for Insertfirst function</u>
- Create a new Link with provided data.
- Point New Link to old First Link.
- Point First Link to this New Link.
As we can see that in both algorithms ,we are inserting data to a new nodes and incrementing/pointing to a new node for inserting data.Both algorithms uses the same approach.
Answer:
By Using the Greedy- Activity- Selection algorithm
Explanation:
The Greedy- Activity- Selection algorithm in this case involves
First finding a maximum size set S1, of compatible activities from S for the first lecture hall.
Then using it again to find a maximum size set S2 of compatible activities from S - S1 for the second hall.
This is repeated till all the activities are assigned.
It requires θ(n2) time in its worse .
