info…programme Consider the following universe of discourse (UoD)…

Question Answered step-by-step info…programme Consider the following universe of discourse (UoD)… info…programmeConsider the following universe of discourse (UoD) that describes the operation of a company COMUNICA selling telecommunications services: 1. When a customer presents himself at any of COMUNICA’s shops to buy a package of telecommunications services is attended to by a sales person from the Commercial Department (DCo); 2. If the customer is new, with no record in COMUNICASoft application, the sales person will request and analyse the customer information and create customer registration in COMUNICASoft application. 3. The salesman must present to the customer the telecommunication service packages he considers more convenient. If the customer does not accept any of those packages, nothing more happens, and the process ends.4. If the customer decides to buy one of the available telecommunication service packages, the customer If the customer decides to buy one of the telecommunication packages available, the salesman must register this purchase operation in the COMUNICASoft application, consisting in the creation of a telecommunication package with the following information: identificationtelecommunication package with the following information: identification of the telecommunication services package, identification of each of the customers through name, date of birth, the associated associated telephone numbers and total cost.5. The customer should make payment for that amount through an ATM terminal available in the shop. If this operation is not successful, the salesman registers the telecommunication package as suspended and the process ends, which may be resumed at any time.6. If payment is successful, the customer records it in the COMUNICASoft system, prints the telecommunication package form with all the accesses the telecommunication package with all the necessary accesses, which he signs and delivers to the customer, and the process ends successfully.7. The COMUNICASoft application allows any Operations Department (DOp) manager to  and modify telecommunication packages. Each telecommunication package must have a unique name and unique identifier, start and end date, identification of the services involved, price, capacity of each service, and discounts (if applicable).8. The COMUNICASoft application allows any COMUNICA shop assistant to  and modify customer and telecommunication plan records. 9. When a customer registers with COMUNICASoft they will automatically be given a user account identified by email and password (to access the system). A customer can have several telecommunication telecommunication plans which are created over time. 10. A customer can cancel a paid telecommunication plan, if he cancels it up to 10 days before its commencement of the plan. 11. Each customer record includes the customer’s name, VAT (tax identification number), date of birth contact details and e-mail address. 12. A telecom package when created in the system by a DOp manager will be in the pending state. status. 13. The DOp manager is responsible for putting a telecom package in active or cancelled status. in the cancelled state. 14. When a telecommunication package is in the active status, it may be consulted by any commercial or customer with an account in the system. When the number of days of promotion of a telecommunication promotion is 0 (zero) then that telecom package goes to the “Regular tariff” status. regular” status. Finally, when the end date of the offer period of the telecom package is reached it goes to the “Unavailable” state.15. At any time, the customer (as a registered user in the system) may consult and change his general information, may consult their telecommunication plans, with more detailed information about information about the services, and may obtain their consumption.16. At the end of each month the system produces and automatically sends to the COMUNICA DCo manager, via email, a report of the commercial performance of the companyQuestion 1: I need help to make a use case diagram of the COMUNICASoft application using <> or <> associations with informational value Image transcription text< Unit5-TestData463 - Saved . .. Sum:4266.114556 Average: 32.07604929Count: 257 Numerical Cou... Show more... Show moreProgram in R to calculate a variant of the Hamming distance with two key modifications to the standard algorithm. In information theory, the Hamming distance is a measure of the distance between two text strings. This is calculated by adding one to the Hamming distance for each character that is different between the two strings. For example, "kitten" and "mitten" have a Hamming distance of 1. See https://en.wikipedia.org/wiki/Hamming_distance for more information. Modifications to the standard Hamming distance algorithm for the purposes of this exercise include: Add .5 to the Hamming distance if a capital letter is switched for a lower case letter unless it is in the first position.  Examples include:"Kitten" and "kitten" have a distance of 0"kitten" and "KiTten" have a Hamming distance of .5."Puppy" and "POppy" have a distance of 1.5 (1 for the different letter, additional .5 for the different capitalization).Consider S and Z (and s and z) to be the same letter. For example, "analyze" has a distance of 0 from "analyse". Use the program you wrote to score the following strings:"data Science" to "Data Sciency""organizing" to "orGanising""AGPRklafsdyweIllIIgEnXuTggzF" to "AgpRkliFZdiweIllIIgENXUTygSF")b) Explain how a Boolean satisfifiability issue in CNF structure and with n factorscan be changed over to a CSP, likewise having n factors and having an appropriaterequirement for every provision. Outline your response utilizing the 4-variable equation fin (1). [3 marks](c) Explain, again utilizing an imperative comparing to a provision from (1), how generalrequirements can be changed over to double limitations. Give a diagram outliningthe issue from (1) after it has been changed over to a CSP with just twofoldlimitations. [4 marks](d) Explain, how forward actually taking a look at works with regards to an overall CSP. Indeed how doesthis benefifit a CSP solver? [3 marks](e) Using the CSP identical you created for (1), with just paired imperatives,show how forward checking functions utilizing the grouping of tasksx1 = F, x2 = F, x4 = T. [5 marks](f ) How might you expect the arrangement got while applying forward checking tobe affffected assuming limitations were permitted to engender all the more generally? [2 marks]3CST1.2021.6.43Intricacy Theory(a) Defifine the arrangement of Boolean articulations 2CNF and the language 2SAT over them.[2 marks](b) For a Boolean articulation ? in 2CNF, let G(?) be the coordinated diagram with verticesthe factors of ? and their refutation, and with edges (a, b) if, and provided that, thereis a proviso (¬a ? b) or (b ? ¬a) in ?. Note that an edge (a, b) is in G(?) if, andprovided that, so is the edge (¬b, ¬a).Demonstrate that a Boolean articulation ? in 2CNF is unsatisfifiable if, and provided that, thereis a variable x in ? with the end goal that there are ways from x to ¬x and from ¬x to x inG(?). [Hint: Recall that the recommendation (¬P ?Q) is proportionately the ramifications(P Q).] [12 marks](c) Argue concerning if 2SAT is in NL, in P, and in NP. Your response mayutilize the way that NL is shut under complementation. [6 marks]4CST1.2021.6.54Intricacy Theory(a) For an intricacy class C, let co-C = { L | L ? C } and say that C is shut undercomplementation at whatever point C = co-C.Contend with regards to whether the accompanying assertions are valid, bogus, or obscure.(I) All deterministic time intricacy classes are shut under complementation.[3 marks](ii) All non-deterministic time intricacy classes are shut undercomplementation. [3 marks](b) For a planning f : ? ? ? on a letter set ? and a language L ? ?? , defifinef[L] = { f (w) ? ?? | w ? L } where f (a1 · · · an) = f(a1)· · · f(an).Demonstrate that L ? NP infers f[L] ? NP. [4 marks](c) Consider the accompanying choice issue.Q: Given regular numbers m and n in N, and pieces a(k)i,jalso, bk in{0, 1} for 1 ? k ? m and 1 ? I, j ? n, decide if the frameworkof conditions P 1?i,j?n a(k)i,jxi xj = bk (1 ? k ? m) with questionsx1, . . . , xn has a so  Business Finance NEM 452 Share QuestionEmailCopy link Comments (0)