An array of integers named parkingTickets has been declared and initialized to the number of parking tickets given out by the city police each day since the beginning of the current year.
Explanation:
- A variable named ndays has been declared and initialized to hold the size of the array.
- The first element of the array contains the number of tickets given on January 1; the last element contains the number of tickets given today.
- A variable named mostTickets has been declared, along with a variable k.
- If today were January 18, ndays would have the value 18; if today were February 3, ndays would have the value 34
mostTickets=0;
for (k=0; k< ndays; k++)
{
if (parkingTickets[k]>mostTickets) mostTickets=parkingTickets[k];
}
This sounds like a multiple choice answer can I have 4 choices to pick?
I don’t understand please speak English
Answer:
MAC Addresses (Destination and Source MAC address)
Explanation:
A switch has 3 primary functions:
- Forward frames
- Learn addresses
- Avoid loops
An Ethernet frame has the header, data and trailer and there are two specific fields in the header that helps the switch to know where to send data in future transmissions.
- destination MAC address
- source MAC address
every Ethernet frame has this and when the frame hits a switch or any device, any device can look at it ( an Ethernet frame ) and know where it is suppose to go and where it came from.
Every switch has a MAC address table where it stores MAC addresses of different computers on the network.
Example:
When a PC1 sends a frame to PC2 through a switch, the switch looks at the header of the Ethernet frame for the source mac address and adds the source MAC address to its MAC address table and also the port that it came through.
simply put:
A switch looks at the source MAC address to see if it knows it already, if it does. Great! no need to add it again to it's address table.
If it doesn't, it adds it's source address and the port that the frame came from.
This basically how the switch populates its MAC address table.
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.
