Microsoft Word - Assignment 2-Summer 2022.docxDPIT113 Problem Solving Assignment 2 Due: 11:55 pm December 11, 2022 This assignment contains two parts. The first part relates to logic...

exam at 1 australian timing please dont keep it plagiarised, i need a expert to help me in particualr timing like and i can only give paper at 1 on that day australian time and need it back by 3 in 2 hours


Microsoft Word - Assignment 2-Summer 2022.docx DPIT113 Problem Solving Assignment 2 Due: 11:55 pm December 11, 2022 This assignment contains two parts. The first part relates to logic problems. The second relates to a problem of selecting from options. Part A: A logic problem (10 Marks) The following logic problems involve translating between English and “Logic”. For each problem, you should: a) Identify the universal class. (What do all the terms refer to?) (1 Mark) b) Extract the terms and assign letters to each of them. (3 Marks) c) Restate each of the statements in symbolic form. (3 Marks) d) Find the chain of implication and use it to obtain the conclusion. (2 Marks) e) State this conclusion in English. (2 Marks) The tutorial for week 5/6 provides some necessary background and practice for the first part of this assignment. Problem 1: i. No student, that loves logic, is not clever. ii. No student without a bicycle will solve this puzzle. iii. Students with long hair always love logic. iv. No clever student gets a failing grade. v. No students have bicycles unless they have long hair. à a) Universal class for this question is Students. b)L= that loves logic S= will solve this puzzle H= with long hair C=clever student F= gets a failing grading B= has bicycle c)~(L~C) =. LàC ~(~BàS). = SàB HàL. =. ~Hà~L ~(CàF). =. Cà~F BàH. =. ~Hà~B d) Now drawing the chain as follows:- SàBàHàLàCà~F e)To conclude the chain it summarises to Sà~F which would mean ‘No student who solves this puzzle gets a failing grade’. Part B: An assignment problem. (10 Marks) Eve, an eavesdropper, wants to capture as much communication traffic as possible. She can eavesdrop on a specific channel for at most two hours, contiguously or otherwise, or she will be detected. There are ten channels for her to choose from and she can eavesdrop for a total of 10 hours. Each channel cycles its transmission, but Eve will learn nothing by capturing the same traffic twice. The following table shows all how much traffic is sent across a channel in the specified transmission time. Channel# 1 2 3 4 5 6 7 8 9 10 Overall traffic volume (Mb) 7 15 12 12 4 10 6 80 64 14 Transmission time (Hours) 1 3 3 2 1 4 6 4 16 2 a) Describe how you can determine the greatest volume of traffic Eve can capture, given the constraints of the system. (3 marks) b) Use your method of part a) to determine which channels Eve should eavesdrop on to maximise the traffic captured. Show the details of your working. (6 marks) c) Specify the overall volume of traffic captured by Eve. (1 mark) à a) As we need to determine the greatest volume of traffic Eve can capture, given the constraints of the system, I think using the Greedy approach for this problem would be feasible to get best answers. Through the greedy approach, we can find Eve the best channel first and then goes to second best and the third best and so on for her to learn from every channel she goes to by seeing the best Mb per Hour consumption for each channel. So, in order for her to eavesdrop for 10 hours, we will look at the best Mb per Hour with 2-hour constraint with as much traffic as possible. b) c)Hours total = 1+2+2+1+2+2à10 hours Traffic total for Eve to eavesdrop = 7+10+12+4+40+14à87 mb NOTE: This assignment is marked out of 20. It will be scaled to a mark out of 10 in SMP. Assignments should be converted to pdf format and submitted via Moodle as ass02.pdf Channel# 1 2 3 4 5 6 7 8 9 10 Overall traffic volume (Mb) 7 15 12 12 4 10 6 80 64 14 Transmission time (Hours) 1 3 3 2 1 4 6 4 16 2 MB per hour 7 5 4 6 4 2.5 1 20 4 7 CHANNEL NO HOURS MB 1 1 7 2 2 10 4 2 12 5 1 4 8 2 40 10 2 14