Is it true or wrong to say that an object with zero acceleration has velocity? Either yes or no explicate it with example.
Ans: . The velocity and acceleration of a particle do not depend on each other (however rate of change of velocity with respect to time gives acceleration ) i.e if velocity is zero acceleration may or may not be zero or vice versa.
Consider a simple example when we start a vehicle, initially we have zero velocity but have non-zero acceleration(that is why vehicle will start moving).
2.If we drop a ball from some height above the earth surface the velocity at that instant is zero but acceleration in non zero (gravity) which acts downward. The acceleration would increase the velocity in some time.
Can we say that an object with zero velocity have acceleration?
Either yes or no explicate it with example.
Ans: Yes, an object can have zero velocity and still be accelerating simultaneously.
Consider an object moving in the forward direction. suddenly a force actson it and tries to acceleration the object in the backward direction . when you observe the object, you will find that the object will continue to move forward for some time and then stops momentarily. Then the object will start to move in the backward direction.
Is it wrong or correct to say that, if an object has constant acceleration, it has a constant velocity? Either yes or no explicate it with example.
Ans: An object with a constant acceleration should not be confused with an object with a constant velocity.
If an object is changing its velocity whether by a constant amount or a varying amount then it is an acceleration object. And an object with a constant velocity is not accelerating.
Q.2 Estimate the soccer ball‘s speed immediately after being kicked off if its mass is
As we know acceleration is equal to a =∆𝒗/∆𝒕
Velocity = 256 / 0.5×time
Velocity = 256 / 0.5×1
Velocity = 512km/s
The Linked List ADT
We have been using linked nodes to generate our structures for the Stack ADT and the Queue ADT. Now we will consider the linked list. As we have been using this structure for implementing the previous ADT structures, it is perhaps more constructive to look at a variation of the single linked list (known as the ‘sorted’ linked list).
The idea behind this type of list is that any element we put into the list will have to be put into the correct position by comparing some common value held in each of the nodes. So far the Stack ADT and the Queue ADT did not impose any ordering on the elements we added. If we were looking for a basic linked list, we could use these as the basis for the structure and operations. This is a task you might attempt for yourselves.
Our sorted linked list ADT will consist of the following primitive operations:
We would generally need a display operation for testing purposes to ensure that the elements are being put into the correct locations. However, the Sorted linked list is a linear structure so any processing done on the list has to be carried out in a linear manner. We must access the list through the Start link / pointer and the list has to be accessed/processed in the order that the nodes appear on the list.
As we have previously seen, one of the great advantages of the linked data structure is the ease with which it may be modified. Changing the structure does not involve moving the existing nodes. In order to delete a node we update the link / pointer of the node before it and point / link this to the node after it.