Answer:
In Python:
def sumLastPart(n,thelist):
sumlast = 0
lent = len(thelist)
lastN = lent - n
for i in range(lastN,lent):
sumlast+=thelist[i]
return sumlast
Explanation:
This defines the function
def sumLastPart(n,thelist):
This initializes the sum to 0
sumlast = 0
This calculates the length of the list
lent = len(thelist)
This calculates the index of the last n digit
lastN = lent - n
This iterates through the list and adds up the last N digits
<em> for i in range(lastN,lent):</em>
<em> sumlast+=thelist[i]</em>
This returns the calculated sum
return sumlast
12,831 is the answer but if you care for the work then here it is:
Since its a percent then its a certain percentage of the whole. Therefore you take 13,650 x 94% or 0.94 which will give you the answer of the amount of people that are familiar with it.
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:
Awww what happened? Sometimes its hard for me to keep a promise.
Explanation:
