CSCI103 Algorithms and Problem Solving DPIT113 Problem Solving Assignment 2 Due: 11:55 pm August 30th 2020 This assignment contains two parts. The first part relates to logic problems. The second...

These are 2 problems of problem solving .


CSCI103 Algorithms and Problem Solving DPIT113 Problem Solving Assignment 2 Due: 11:55 pm August 30th 2020 This assignment contains two parts. The first part relates to logic problems. The second relates to a problem of selecting from options. Part A: Two logic problems. 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?) b) Extract the terms and assign letters to each of them. c) Restate each of the statements in symbolic form. d) Find the chain of implication and use it to obtain the conclusion. e) State this conclusion in English. 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. Problem 2: i. No tiger ever doubts that he is handsome. ii. An animal, that cannot whistle, is not worth listening to. iii. No animal is quite certain that it is handsome, unless it has a shiny coat. iv. All animals, except tigers, respect their parents. v. No aquatic animal can whistle. vi. An animal with a shiny coat is worth listening to. Part B: An assignment problem. 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. 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. c) Specify the overall volume of traffic captured by Eve. Assignment should be converted to pdf format and submitted via Moodle as ass02.pdf