来自加拿大代写的顾客授权发布的Computer Science，CSC320作业要求片段，我们不会发布CSC320的answer在网站，我们曾经写过CSC320及相关的Computer Science写过很多作业，考试，如果你也需要代写这个课程的作业请联系客服WX:QQ 5757940 ，代写人的代写服务覆盖全球华人留学生，可以为CA的学生提供非常准时精湛的服务，小作业assignment代写、essay代写享适时优惠，project、paper代写、论文代写支持分期付款，网课、exam代考预约时刻爆单中赶紧来撩。
Reminder: The point of homework in this course is to learn by doing. You will not learn this material by copying the solution from somewhere else so don’t waste your time looking for solutions. DO consult the textbook and the lecture notes. You may discuss the homework with other students if you get stuck, but you must write up solutions yourself. Do NOT exchange written material by you or anyone else with other students. Otherwise you may be commiting plagiarism and subject to academic pe ...
本课程中作业的意义在于通过实践来学习。抄袭其他地方的解决方案是学不到这些材料的，所以不要浪费你的时间去寻找解决方案。一定要参考课本和讲义。如果你遇到困难，你可以和其他同学讨论作业，但你必须自己写出解决方案。不要与其他学生交换你或其他人的书面材料。否则，你可能犯有抄袭行为，并受到学术惩罚。
Reminder: The point of homework in this course is to learn by doing. You will not learn this material by copying the solution from somewhere else so don’t waste your time looking for solutions. DO consult the textbook and the lecture notes. You may discuss the homework with other students if you get stuck, but you must write up solutions yourself. Do NOT exchange written material by you or anyone else with other students. Otherwise you may be commiting plagiarism and subject to academic penalty. These questions are copyrighted by the professor and cannot be shared outside the class without permission. Solutions are graded for correctness and clarity. If you write ”No answer” for a question or subpart of a question, you will receive 20% credit for recognizing that you don’t know the answer. Due Sunday November 28. Late assignments due Monday Nov 29 with 15% penalty. (1) Partition-P&N Input: a set of integers {s1, s2, ..., sn} at least one of which is negative and one of which is positive. Output: Yes iff the integers can be partitioned into two sets, each of which sums to the same number We wish to give a reduction from PARTITION-P&N to PARTITION with only positive integers. i. Prof V says: f first determines m, the smallest (negative) number in the input and then f maps each si to si + |m|. (NOTE: I corrected this to add an extra 1; ok if they didn’t catch this and ended up with a 0 number. ) ii. Prof B says: g maps each number si to its absolute value, |si|. a) For each of f and g, prove that this is a reduction, or give a counterexample to show it isn’t. b) Using PARTITION, prove that PARTITION-P&N is NP-complete. (2) 3SAT-5 Input: a Boolean formula in CNF with exactly 3 literals per clause Output: Yes iff there are at least five satisfying truth assignments Prove that 3-SAT-5 is NP Complete. (3) The HAMILTONIAN PATH PROBLEM is defined on page 11 in Lecture 15. Use the fact that HAMILTONIAN PATH is NP-complete to show the following prob- lem is NP-complete. 1 2 Input: A directed graph G = (V, E) Output: Yes iff there is a directed cycle in which every node appears exactly once. The next questions use the following problem: k-COLOUR PROBLEM Input: a graph G = (V, E) Output: Yes iff there is a way to colour each node {1, 2., , k} so that no two nodes which are endpoints of the same edge have the same colour. (4) Give a polynomial time reduction from 2-COLOUR to 3-COLOUR and prove it is correct. Does this prove 2-COLOUR is NP-Complete? Why not? (5) Show that k-COLOUR is NP-Complete for any k > 2, using the fact that 3- COLOUR is NP-complete. (6) We’re having a party with k people and we want to do a play reading for a play that has n > k roles. Can we give a proper assignment of roles to people, i.e., so that each role is assigned to exactly one person, and there is no scene in which two or more characters in the same scene are assigned to the same person? k-ROLE-PLAY Input: A play with n roles r1, r2, ..., rn, k people p1, p2, ..., pk to enact it, and s1, s2, ..., sm scenes. Output: Yes, iff there is proper assignment of roles to people. Show this problem is NP-complete using k-COLOUR. Hint: Your play may need to have a lot of scenes
If you are a student from an English-speaking country, please feel free to contact us at [email protected] and we will provide you with an excellent writing service.
为什么选择代写人 代写
作为现存十年的代写服务机构，我们没有任何学术丑闻，我们保护顾客隐私、多元化辅导、写作、越来越多的小伙伴选择代写人为他们解决棘手的各类作业难题，保障GPA，为留学梦助力！ 我们的客服团队及写手老师总是能第一时间响应顾客的各类作业需求，有些人即使有重要的事甚至带伤上场协助考试。Final季，忙的时候一天十几场考试还在继续坚持着，我知道，他们明明可以不用这么辛苦的…但是他们为了坚守承诺，为了另一端屏幕外的那一份期望，他们没有选择退缩、时刻为同学们提供最好的！这么有温度的代写还不添加备用一下？WX/QQ： 5757940
