pif x=9 then y else zwhere pif e1 then e2 else e3 is the equivalent…

Question Answered step-by-step pif x=9 then y else zwhere pif e1 then e2 else e3 is the equivalent… pif x=9 then y else zwhere pif e1 then e2 else e3 is the equivalent contingent: it acts correspondingly tothe standard prohibitive in that if e1evaluates to legitimate or false, it yields e2then again e3 as fitting; nevertheless, evaluation of e2 and e3 happens at the same time with e1to license the pif construct alsoto end with the value of e2 when e2 and e3both end with identical characteristics (whether or not e1 figures forever).Comment quickly how your seriousness property for f1 would change if theincrease returned zero without evaluating the other dispute in the eventthat one dispute were zero. [7 marks]Let g, h1 and h2 be twofold limits and audit the importance of limitplan:It has been remarked that “cerebrum networks are the second most ideal approach to figuringessentially anything.” Discuss this, resolving the going with issues: expressiveness;computational adequacy; hypothesis; antipathy for uproar; straightforwardness (theability to sort out why a given outcome regard is pushed); the usage of prior data;whether mind networks fulfill our prerequisites for a comprehensive computational theoryof learning. 9 SecurityShamir’s three-pass show engages Alice to impart something explicit m to Bob in thefollowing way:Figure out this show, communicating the restriction on m and the significant shortcoming.[10 marks]It is suggested that the encryption movement m → mkx be displaced with a provablysecure encryption movement, specifically a one-time pad. How should this impact theshow’s security? [10 marks]10 Natural Language ProcessingDepict three tremendous differentiations between programming vernaculars and customarylingos. [8 marks]What issues do these differentiations present for tries to fabricate programs that”get it” a trademark language? [12 marks]5 [TURN OVERCST.96.9.611 Information Theory and CodingConsider a quiet basic correspondence channel whose move speed is 10,000 Hz.An indication of range 1 second is moved past such a channel. We wish to addressthis industrious sign definitively, at all spots in its one-second range, using just arestricted overview of certified numbers got by assessing the potential gains of the sign at discrete,infrequent minutes. What is the length of the briefest summary of such discretetests expected to guarantee that we get each of the information in thesignal and can recover it unequivocally from this once-over of tests? [5 marks]Name, portray numerically, and sketch a plot of the limit you would need to useto recover absolutely the interminable sign conveyed, using just such arestricted overview of discrete irregular instances of it. [5 marks]Consider a noisy basic correspondence channel of bandwidth Ω, which is aggravatedby added substance white Gaussian disturbance whose power appalling thickness is N0. Consistentsignals are sent across such a channel, with ordinary conveyed power P(portrayed by their typical change). What is as far as possible, in bits persecond, of such a channel?Show that there is positively no possibility of picking by computations whether a general register machine program with code p will end when started with early on data of 0 in each register. [10 marks] Show that there is anything but a possibility picking by estimation whether the reasonable individual will be printed over the range of a general Turing machine computation. [10 marks] Note: any standard kind of the undecidability result for the general completion issue may be acknowledged, yet should be communicated clearly. 11 Complexity Theory Explain how to measure the size of an issue in multifaceted nature speculation. [3 marks] What is inferred by decreasing one issue to another? [4 marks] Given that the Boolean Satisfiability Problem is NP-gotten done, show that the Hamiltonian Circuit Problem for undirected outlines is moreover NP-complete(a) Briefly depict the update exercises maintained by truly significant line.[2 marks](b) Explain the data structure known as a heap and portray how a stack can beexecuted using an essential straight square of memory. [2 marks](c) Describe, and measure the costs of, strategy to(I) find the parent and any kind of future family of a given center point; [2 marks](ii) implant something else into an ongoing burden; [2 marks](iii) eradicate the most noteworthy thing from a non-void store. [2 marks]Section B5 Foundations of Computer Science(a) Describe how dormant records, which have maybe interminable length, can beexecuted in ML. Show your reaction by presenting a limit thatrecognizes (somewhere around one) unresponsive records and conveys another drowsy summary. [6 marks](b) A lazy twofold tree either is empty or is a branch containing an imprint and two sluggishtwofold trees, maybe to endless significance. Present a ML datatype to addresslazy matched trees. [2 marks](c) Present a ML work that makes a lazy twofold tree whose imprints consolidateall of the entire numbers, including the negative numbers. [3 marks](d) Present a ML work that recognizes a drowsy matched tree and makes a listlesslist that contains the tree’s imprints overall.The goal is to have all of the white tiles aside of the general large number of dull tiles and to achievethis basically cost. The last spot of the unfilled space isn’t huge.(a) Represent the issue using the going with data depiction plans:(I) creation structure rules [5 marks](ii) a semantic association [5 marks]In one sentence, portray the different emphases of these two plans.[1 mark](b) State two likely heuristics to help with handling this issue. [2 marks](c) For a coordinator to handle this enigma, what chairmen (for instance orchestrating exercises) wouldbe required? [7 marks]3 [TURN OVERCST.93.12.48 DatabasesDepict the social model of data. [4 marks]What is suggested by a candidate key? [2 marks]Sort out what it means for a social data model to be presented in(a) Third Normal Form (3NF) [5 marks](b) Fourth Normal Form (4NF) [5 marks]for every circumstance illustrating your reaction with a sensible model data model.In what conditions could it not be sensible to hold social data as shown bythese average designs? [4 marks]9 Introduction to Functional ProgrammingContemplate the ML definitionsfun N f x = x;fun P a k f x = f a (k f x);fun Q k l f x = k f (l f x);fun W a k = Q k (P a N);fun R k = k W N;Accept further that K and L have ML implications of the constructionval K = P a1 (P a2 . . . (P PC based insight N) . . . );val L = P b1 (P b2 . . . (P bj N) . . . );In parts (b) to (d) under, expect that f and x are sporadic ML identifiers ofsensible sort for the explanation containing them.(a) State the ML kinds of N and P. [3 marks](b) What does the explanation K f x evaluate to? [3 marks](c) What does the enunciation Q K L f x survey to? [4 marks](d) What does the explanation R K f x evaluate to? [10 marks]4CST.93.12.510 Computation TheoryShow that there is in no way, shape or form a possibility picking by computations whether a general registermachine program with code p will end when started with early on data of 0 ineach register. [10 marks]Show that there is no possibility of picking by estimation whether the reasonable individual willbe printed over the range of a general Turing machine estimation. [10 marks]Note: any standard kind of the undecidability result for the general halting issuemay be normal, but should be communicated obviously.11 Complexity TheoryClear up how for measure the size of an issue in multifaceted design theory. [3 marks]What is inferred by decreasing one issue to another? [4 marks]Taking into account that the Boolean Satisfiability Problem is NP-gotten done, show that theHamiltonian Circuit Problem for undirected graphs is furthermore NP-complete.[13 marks]12 Professional Practice and EthicsHow is it that protection could be perceived from (a) secret, (b) arrangement, and(c) anonymity? Is there a right to security?A puzzle, or one-individual game, can be tended to in ML by two limits:• a next-state work, which maps a state to a summary of possible next states, and• a victories work, which returns substantial expecting the given state thinks about a triumph.A clear model is a question that has states containing positive numbers, a nextstate work that maps n to [n+ 2, n+ 5], and a “wins” work that benefits substantialon the off chance that n = 10. We can win if we start from n = 2 anyway not from n = 7.(a) Code a polymorphic datatype ‘a question, to address an enigma by the arrangements ofa next-state work and a victories work. [2 marks](b) Briefly contrast significance first request, extensiveness first pursuit and iterative creatingas systems for handling such conundrums. [6 marks](c) Write a limit significance that recognizes a conundrum, a state and a significance limit. Itshould use significance first pursuit to choose if the conundrum can be handledfrom the given state inside the given significance limit. [6 marks](d) Write a limit extensiveness that recognizes a puzzle and a state. It should useextensiveness first chase to choose if the puzzle can be handled from thegiven state. [6 marks]All code ought to be sorted out clearly. You could acknowledge that any fundamental ML dataplans or limits are available.4CST.2008.1.5Region C7 Operating Systems(a) What is report metadata? [2 marks](b) Explain with the aide of a layout how record metadata is managed in:(I) the Unix record structure; [4 marks](ii) the FAT32 record structure; [4 marks](iii) the NTFS record structure. [4 marks](c) An expert prescribes using non-erratic flicker memory to store COVER ALL QUESTIONS  Computer Science Engineering & Technology C++ Programming DLI 10123 Share QuestionEmailCopy link Comments (0)