Computers and Technology
Objective: To provide you with an opportunity to demonstrate the required performance elements for this unit. A signed observation by either an approved third party or the assessor will need to be included in this activity as proof of completion. This activity will enable you to demonstrate the following performance evidence also this activity will enable you to demonstrate the following skills, as well: > Reading Writing > Numeracy > Oral communication > Navigate the world of work Interact with others Get the work done. I Answer the activity in as much detail as possible, considering your organisational requirements. 1. Throughout the duration of this unit, produce a diary documenting your performance of the following tasks within the workplace or in the learning environment 1. applying relevant legislation and workplace procedures 2 communicating effectively with others when managing a transport and logistics business unit 3. completing documentation related to managing a transport and logistics business unit 4. implementing contingency plans 5. modifying activities depending on operational contingencies, risk situations and environments 6. monitoring work activities in terms of planned schedule 7. operating and adapting to differences in equipment in accordance with standard operating procedures & operating electronic communications equipment to required protocol 9. prioritising work and coordinating self and others in relation to business activities 10. reading and interpreting operational data, regulatory requirements, market intelligence, finance, budgetary information, and business policies relevant to managing a transport and logistics business unit 11. reporting and/or rectifying identified problems promptly, in accordance with regulatory requirements and workplace procedures 12. working collaboratively with others when managing a transport and logistics business unit 13. working systematically with required attention to detail without injury to self or others, or damage to goods or equipment. For each diary entry, you should provide a description of the situation as well as the action you have taken to complete the task. Where possible, a signed observation will be required as evidence of completion
Basic HopSets [Recommended] = Consider an arbitrary weighted n-node graph G (V, E, w) where w : E R+ indicates the weight of the edges. For two nodes s, t V, let dist(s, t) denote the smallest total weight among all paths that connect s and t. Moreover, define the shortest-path hop-distance of s and t to be the smallest h such that there is a path with weight dist(s, t) and only h hops, connecting s and t. We define the Shortest-Path Hop-Diameter (SPHD) of the graph to be the maximum shortest-path hop-distance for any pair of vertices s and t. In general, a graph might have a large SPHD, even if all nodes are within few hops of each other (think of a wheel graph with heavy weights on the spokes and light weights around the wheel). Working with graphs of smaller SPHD is much easier, in many computational settings. Prove that if for each node v, we add weighted edges to its closest k nodes (breaking ties arbitrarily) with weight equal to the shortest path between u and that node, we obtain a graph that preserves pair-wise distances, while having SPHD at most 4n/k. Hint: yn nwted ogbe won on ai 919dt tdt 9v19ado bas dqsg won odt ni dtq Ismitqo ns 92 .dtsq aidt to asbon ovitiano-non to risq
dentify and protect the critical sections of the adder, multiplier and degrouper functions with a posix mutex. try to keep your critical sections as small as possible. tip: man pthread mutex lock, pthread mutex unlock, pthread mutex init, ... check the return values of these functions for errors. print a brief error message on stderr and exit your program with exit failure if one of them fails. use the provided function printerrorandexit(). next, identify and protect the critical sections of the reader and sentinel functions, as well. your code should now be immune to synchronization errors (e.g., race conditions, data corruption).Q6: Is a new mutex, separate from what you have in Step 3, required to correctly implement this behavior? Why or why not?Q7: Why is it important, even on single-processor machines, to keep the critical sections as small as possible?Q8: Why is spin-waiting without yielding usually inefficient?Q9: When might spin-waiting without yielding or blocking actually be *more* efficient?Q10: You have to supply an initial value when creating a semaphore. Which value should you use to mimic the default functionality of a mutex? What would happen if you specified a larger value?
