1.1 Prepare for given work according to relevant legislation, workhealth and safety (WHS) regulations, codes and standards1.2 Arrange site access according to required procedure1.3 Review existing network design documentation to ensure it iscurrent and complete1.4 Select components and network elements required to be installedto meet the technical requirements1.5 Contact vendors and service suppliers to obtain specifications andavailability of identified components1.6 Develop plans, with prioritised tasks and contingencyarrangements, for installation of components with minimum disruptionto client1.7 Liaise with appropriate person to obtain approval for the plans,including security clearance and timing Document Preview:

ASSESSMENT TASKS TC ” ASSESSMENT ” ICTTEN416 Install, configure and test an internet protocol network Assessment Summary Read all the instructions below before attempting the assessment task. Assessment tasks are tools used to determine if you have the knowledge and skills to complete tasks to industry standards within the workplace. Your trainer/assessor will help you throughout this task and it is your responsibility to provide enough evidence to justify a competent decision by the trainer/assessor. If you do not understand the questions or what is required, ask your trainer/assessor for assistance. For group assessments, all students are to contribute to the assessment tasks. You are allowed to work in groups up to a maximum of four people. You are to complete all tasks by the due date and assessments must have a coversheet attached. If you think you do not have enough time to complete the tasks by the due date, discuss with the trainer/assessor the reasons of why you cannot submit on time. Writing your responses When answering questions, ensure that your answers are detailed enough to so the assessor can draw a conclusion that you have the knowledge and/or skills to demonstrate competency. Handwritten answers must be written in blue or black pen. When producing reports, ensure that your project has a title page, table of contents, page numbers, reference list, ensuring that your answers thoroughly match the questions asked. Answer all questions in your own words to avoid plagiarism. Plagiarism is copying someone else’s work or ideas and saying that it your own work. Sources of work must be properly referenced, outlining the source of your ideas. Penalties may include having to resubmit the assessment task again, repeating the Unit of competency, or for repeat plagiarism, expulsion from Abbey Business College. Marking of Assessments On submission of your assessment will be marked for a result of either Satisfactory (S) or Not Yet Satisfactory (NYS)….

Attachments:

ictten416–as….docx

"Looking for a Similar Assignment? Get Expert Help at an Amazing Discount!"

1.1  Background & history of Apple Watch (120 words)

1.2  Vision/goals of Apple Watch (120 words)

1.3  Product portfolio of Apple Watch (130 words)

1.4  Milestones and important events of Apple Watch (130 words)

1.5 Summary of 1.1, 1.2, 1.3 & 1.4 (300 words)

Total words – 800 words

Harvard referencing. (follow VU guide)

At least 5 references

"Looking for a Similar Assignment? Get Expert Help at an Amazing Discount!"

1.3 If a household’s income falls from R20 000 to R17 000 and its consumption falls from R18 000 to R15 000, then its: a) marginal propensity to consume is –0,67. b) marginal propensity to consume is 0,88. c) marginal propensity to consume is 0,20. d) marginal propensity to save is zero. e) marginal propensity to save is 0,12.

"Looking for a Similar Assignment? Get Expert Help at an Amazing Discount!"

1.2 Different costing methods: A number of costing methods are used by various types of organisations and the industries, in order to ascertain the cost of the products. However, Meeks and Swann (2009) acknowledged that the method to be considered by the business entities depends on the nature of production and the type of output. Different costing methods could be categorised as follows: Job-order costing: According to Bedford et al. (2008), the job order costing method is concerned with the findings about the costs associated with each job or work order. The method is often used by the customer oriented firms like the service organisation as well as the industry.

Attachments:

job-card.docx

"Looking for a Similar Assignment? Get Expert Help at an Amazing Discount!"

1. 1.(2 pt.)The aptly-named Average Hotel has 100 rooms, each belonging to one of 100 guests. After an evening soiree, all of the guests (not thinking straight) randomly select a room to sleep in for that night. Multiple guests might end up in the same room.

   (a) (1 pt.) What is the expected number of guests that end up returning to their own hotel room?

   [We are expecting: A number, and please show your work.]

   (b) (1 pt.) What is the expected number of guests that end up in a room with exactly one other person? (Hint: you may find it easier to count by rooms instead of guests.)
   [We are expecting a mathematical expression like(6)(8)or a number like48, and please show your work.]

   2.(3 pt.)LetUkbe the universe of all strings consisting ofknumeric digits. (0000,0123, and9898are part of universeU4butb000,012,9!9!are not.) Letuidenote theithdigit of a stringu?Ukwhere 0=i

   LetHkbe a family ofkhash functions mapping universeUkto values{0,1,2, . . . ,9}whereh0?Hk hashes all strings according to their first digit. (For all stringsuwhereu0= 0,h0(u) = 0; for all strings uwhereu0= 1,h0(u) = 1; for all stringsuwhereu0= 9,h0(u) = 9.) Likewise,h1?Hkhashes all strings according to their second digit. Generally, for all stringsu?Ukwhereui=x,hi(u) =xfor 0=i

   1. (a) (1 pt.) What is an example of a maximally-sized subsetU3such thatH3is universal for the subset?

      [We are expecting: An example subset.]

   2. (b) (2 pt.) WouldHkbe a good family of hash functions (where “good” is defined as universal) to useforUkfork=3?
      [We are expecting: A short explanation (2-3 sentences) that answers the question.]

2. 3.(Plagiarism detection) (5 pt.)Hash functions are extremely good at what they do. Unsurprisingly, there are many fancier data structures that can be built on top of them. In this problem we will motivate and explore the idea of a “Bloom Filter,” which is one example of a fancier structure built on top of hash functions.

   Suppose you are hired by someone to make a plagiarism detection software for internal use so as to avoid any potentially embarrassing allegations of plagiarism. Specifically, your goal is to make a lightweight (i.e. fast, and relatively low-memory) piece of software that will take a sentence and output one of the following messages: 1) “potentially problematic, please rewrite”, or 2) “fresh like an ocean breeze.” Suppose your goal is the following: if the input sentence is something that you have already seen, you output “potentially problematic” (with probability 1), and if the input is something new, you want to output “fresh” with probability at least 0.99 (its alright if you have a few false-alarms).

1. (a) (1 pt.) First, you decide to use a hash table. You will make a has table that maps a piece of text to a bucket, then scrape the web for all English sentences, and hash each one to your table. Given a new sentence, you will check to see if it hashes to an empty bucket—if so, you will output option “fresh” otherwise you will output “potential plagiarism.” Suppose there are 1 billion unique sentences online. How many buckets will your hash table need to have to have the desired functionality?

   [We are expecting: A number (to the nearest order of magnitude) and one to two sentences of justification.]

2. (b) (2 pt.) You decide that is a little too much space usage, and consider the following approach: you choose 10 hash functions,h1,…,h10that each map sentences to the numbers 1 though 10 billion. You initialize an arrayAof 10 billion bits, initially set to 0. For each sentencesthat you encounter, you computeh1(s),h2(s),…,h10(s), and set the corresponding indices ofAto be 1 (namely you setA[h1(s)]?1, A[h2(s)]?1, . . .). Argue that after processing the 1 billion unique sentences, you expect a (1-1/(10 billion))10 billion˜0.37 fraction of the elements to be 0.

   For this part, feel free to assume that thehiare “idealized” hash functions that map each keys to a uniformly random bucket.
   [We are expecting: A paragraph with your argument.]

(c) (2 pt.) Now, given a sentences, to check if it might be plagiarized, you compute the 10 hashes of s, and check ifA[h1(s)] =A[h2(s)] =. . .=A[h10(s)] = 1. If so, you output “potential problem,” otherwise you output “fresh.” Prove that ifsis actually in your set of 1 Billion sentences, that you will output “potential problem” with probability 1, and that ifsisnotin your set of 1 Billion sentences, you will output “fresh” with probability˜1-(1-0.37)10˜0.99.

Again, feel free to assume that the hash functions are “idealized,” and that the claim of the previous part holds, namely that after processing the 1 Billion sentences, there are 3.7 billion indices in the arrayAwith value 0.
[We are expecting: Informal mathematical justifications for each of the bounds.]

 

"Looking for a Similar Assignment? Get Expert Help at an Amazing Discount!"