(c) The three-fifingered inhabitants of the planet Triterra build…

Question Answered step-by-step (c) The three-fifingered inhabitants of the planet Triterra build… (c) The three-fifingered inhabitants of the planet Triterra build base-3 computers.A Triterran named Randal Tryant has found a way of verifying base-3combinational logic. His Ordered Ternary Decision Diagrams (OTDDs) arethe same as a technology used on planet Earth except that all variables andexpressions range over the values 0, 1 and 2 instead of just 0 and 1.(i) Describe how a full ternary decision tree can be reduced to an OTDDwithout regard for effiffifficiency. [2 marks](ii) Sketch an effiffifficient algorithm to convert a ternary expression directly to anOTDD without constructing the full decision tree. For a typical ternaryconnective use modulo-3 multiplication, written as ?. [6 marks](iii) Demonstrate your algorithm by applying it to the ternary expression((i ? i) ? j) ? 2. [3 marks]9[TURN OVERCST.2001.6.1012 Complexity Theory(a) Show that any language that can be accepted by a nondeterministic machinein time f(n) can also be decided by a deterministic machine in space O(f(n)).[4 marks](b) Show that any language that can be accepted by a nondeterministic machinein space f(n) can also be decided by a deterministic machine in timeO(c(f(n)+log n) ), for some constant c. [6 marks](c) Explain what the above results tell us about the inclusion relationships amongthe complexity classes:NL, co-NL, P, NP, PSPACE and NPSPACE[4 marks](d) It has been proved that the graph reachability problem is in co-NL. Whatfurther inclusions can you derive among the above complexity classes usingthis fact? Explain your answer.(a) State what is meant by a directed graph and a strongly connected component.Illustrate your description by giving an example of such a graph with 8 verticesand 12 edges that has three strongly connected components. [5 marks](b) Describe, in detail, an algorithm to perform a depth-fifirst search over such agraph. Your algorithm should attach the discovery and fifinishing times to eachvertex and leave a representation of the depth-fifirst spanning tree embeddedwithin the graph. [5 marks](c) Describe an O(n) algorithm to discover all the strongly connected componentsof a given directed graph and explain why it is correct. You may fifind it usefulto use the concept of the forefather ?(v) of a vertex v which is the vertex, u,with highest fifinishing time for which there exists a (possibly zero length) pathfrom v to u. [10 marks]2 Computer Design(a) What is a data cache and what properties of data access does it exploit?[5 marks](b) What is a direct mapped cache and under what conditions will it exhibit poorperformance? [5 marks](c) Under what circumstances might a word of data in main memory besimultaneously held in two separate fifirst-level cache lines? [5 marks](d) A translation look aside buffffer is a specialised cache. What does it typicallystore and why is it often a factor of 1000 smaller than a data cache? [5 marks]Image transcription textIn this assignment you will use: one-dimensional arrays;strings and various string-handling methods; file input andoutput; console input and output; loops; and … Show more… Show moreImage transcription textGiven the input file CodedMessage. txt containing: Here isa sample run. User input appears as bold underline: EnterMorse Code translation table file path: c: /te… Show more… Show more  Computer Science Engineering & Technology Networking COMPLIT 317 Share QuestionEmailCopy link Comments (0)