No cheg and coursehero unlocks please, i need original work

No cheg and coursehero unlocks please, i need original work typed… No cheg and coursehero unlocks please, i need original work typed (a) Control-flow processors use pipelining to improve throughput. What limits throughput in the simple 5-stage pipeline depicted below? [10 marks] instruction decode/ execute memory register fetch register fetch access write back (b) What is the principle of operation of a static data-flow processor and how does it resolve data dependencies? [10 marks] 3 Digital Communication I What is meant by the term flow control? [3 marks] What is meant by the term credit-based flow control? [4 marks] What is meant by start-stop (or XON-XOFF) flow control? [4 marks] A start-stop system is used on a 10 kbps link with a constant delay of 5 ms. How much buffer must a receiver keep in reserve for “stopping time” in order to prevent information loss? [3 marks] Which system is more appropriate to use across the Internet and why? [6 marks] 4 Computer Graphics and Image Processing Explain how a cathode ray tube (CRT) works, including details of how colour is achieved. [8 marks] Describe a run-length encoding scheme for encoding images whose pixels have eight-bit intensity values. [8 marks] Calculate the best possible compression ratio achievable with your scheme and describe the situation(s) in which this ratio would be achieved. [2 marks] Calculate the worst possible compression ratio achievable with your scheme and describe the situation(s) in which this ratio would be achieved. [2 marks] 2 CST.2000.12.3 5 Business Studies What are the differences between profit and loss and cash flow statements? [5 marks] What are the differences between debt and equity finance? [5 marks] What is an option and how might it be valued? [5 marks] Comment on the current prices of high-tech stocks. [5 marks] 6 Comparative Programming Languages Outline how you would implement complex numbers in C++. Your implementation should attempt to make complex numbers look as if they were built into the language by allowing new complex numbers to be declared, initialised, assigned and operated on by the normal arithmetic operators. [13 marks] Discuss to what extent a good C++ compiler could implement your version of complex numbers as efficiently as if they had been a primitive type in the language A priority queue maintains a list of pairs, each consisting of a priority (a naturalnumber) and a name (a text string), sorted into increasing order of priority.Consider the implementation of such a queue as an object in Modula-3. Thisshould have two methods — insert taking a pair as its arguments to be placed atthe appropriate point in the list, and next taking no arguments but removing thefirst pair from the list and returning its text string component.Give type definitions and default method implementations for this queue object. (a) How does a loaded program in a general purpose timesharing computer gainaccess to input and output streams provided by the operating system?[5 marks](b) What happens when the program is ready to receive the next data from akeyboard input stream and no key press is ready? [5 marks](c) A CPU intensive program will tend to run for long periods of time withoutmaking requests of the operating system. What happens to other usersprograms when someone runs a CPU intensive program? [5 marks](d) What can be done for a shared output device such as a printer or plotter toensure civilised results when two or more users try to use it at once? [5 marks]12 System DesignWith modern technology, many pieces of equipment which we would describe as a’computer’ actually contain multiple hardware components, each performing fetchexecute cycles. However not all of these are always intended to be ‘seen’ by theprogrammer as part of the programming model. Define or explain the following:(a) The term microprocessor. [3 marks](b) The term programming model. [3 marks](c) The effects (or lack of them) on the programming model of havingmicroprocessors imbedded in peripheral devices of a computer. [6 marks](d) A programming model of an overt multiprocessor machine. [6 marks](e) What type of system in production today is likely to have exactly onemicroprocessor inside? : Write  Java program that reads a 1D array of integers from standard input and returns it. a program that reads digits and composes them into integers.  What is meant by a functional dependency between sets of attributes in a relationaldatabase schema? What conditions must be satisfied for a relation to be in Boyce-Codd Normal Form (BCNF)? [4 marks]The Department of Transport is implementing plans to tax traffic congestion. From2002, cars will carry approved radio-control units which at first will be used onlyto monitor vehicle movement. In controlled areas sensors identify all vehicles,recording their positions periodically. Amber signs flash when overall traffic flowdrops below some threshold, and vehicles within the controlled area may be finedfor lack of progress.The owner of each vehicle has an account with the Department of Transport; ownerscan transfer funds to ensure that their account is in credit. Once credit is exhaustedthe level of fine increases by a factor 3, and a summons is sent by mail to the vehicleowner’s registered address. In order to maintain proper accounts it is essential tokeep an accurate record of each monitored offence.You are employed to design the relational database that will enforce the scheme,including provision for vehicle and driver registration, monitoring of vehicle offencesand management of vehicle accounts. Describe the schema you propose, statingclearly any assumptions that you make. You need not discuss the calculation of thefines due. [12 marks]Outline the flow of information through the database. T FIFO, LRU, and CLOCK are three page replacement algorithms.(a) Briefly describe the operation of each algorithm. [6 marks](b) The CLOCK strategy assumes some hardware support. What could you do toallow the use of CLOCK if this hardware support were not present? [2 marks](c) Assuming good temporal locality of reference, which of the above threealgorithms would you choose to use within an operating system? Why wouldyou not use the other schemes? [2 marks]What is a buffer cache? Explain why one is used, and how it works. [6 marks]Which buffer cache replacement strategy would you choose to use within anoperating system? Justify your answer. [2 marks]Give two reasons why the buffering requirements for network data are differentfrom those for file systems. [2 marks]Show how to encode a general register machine program and the initial configurationof one of its computations into a pair of natural numbers. [6 marks]Outline the design of a register machine that simulates a general register machinecomputation specified by a single natural number. Your machine should takeappropriate action for all possible inputs.  (a) Describe the differences in complexity and usage between parsimony anddistance phylogenetic methods. Give an example of the usage of both methods.[6 marks](b) Describe the differences in complexity and usage between hierarchical clusteringand the Markov clustering (MCL) algorithm. [5 marks](c) Explain how to identify different gene features using Hidden Markov Modelmethods such as Genescan. [5 marks](d) Explain how you could identify a regulatory network involving a set of genes.[4 mark (a) State the Fermat-Euler theorem, carefully defining any terms that you use.Deduce that 2p = 2 (mod p) for any prime p. [5 marks](b) Explain how this result can be used to show that a number is composite withoutactually finding a factor. Give an example. [3 marks](c) Let Mm = 2m -1 be the mth Mersenne number. Suppose that m is composite.Prove that Mm is composite. [3 marks](d) A composite number m that satisfies 2m = 2 (mod m) is known as apseudo-prime.(i) Suppose that m is prime. Prove that Mm is either prime or a pseudoprime. [3 marks](ii) Suppose that m is a pseudo-prime. Prove that Mm is a pseudo-prime.[3 marks](iii) Deduce that there are infinitely many pseudo-primes. (a) Give the two definitions of the complexity class NP, one using the term Turingmachine and one using the term verifier. [4 marks](b) For each of the following statements, state whether it is true, false or unknown.In each case, give justification for your answer. In particular, if the truthstatement is unknown, state any implications that might follow from it beingtrue or false. [2 marks each](i) 3SAT =P CLIQUE(ii) TSP ? P(iii) NL ? P(iv) PSPACE 6= NPSPACE(c) Let S = {0, 1}. Prove that Ø and {0, 1}* are the only languages in P which arenot complete for P with respect to polynomial-time reductions. (a) State precisely what it means for a language (i) to be co-NP-complete, (ii) tobe in NL and (iii) to be in PSPACE. [6 marks](b) Consider the following two decision problems.Problem 1: Given an undirected graph G = (V, E) with |V | even,does G contain a clique with at least |V |/2 vertices?Problem 2: Given an undirected graph G = (V, E), does G containa clique with at least |V | – 3 vertices?(i) Which of the two problems is in P and which one is NP-complete?[2 marks](ii) For the problem in P, describe a polynomial-time algorithm. [4 marks](iii) For the other problem, prove that it is NP-complete. [8 marks]3 (TURN OVER)CST.2014.6.43 Computation Theory(a) Explain how to code register machine programs P as numbers pPq ? N so thateach e ? N can be decoded to a unique register machine program prog(e).[10 marks](b) Find a number e1 ? N for which prog(e1) is a register machine program forcomputing the function one ? N ? N with one(x) = 1 for all x ? N. [2 marks](c) Why is it important for the theory of computation that the functions involvedin the coding and decoding given in part (a) are themselves register machinecomputable? (You are not required to prove that they are computable.)[2 marks](d) Define what it means for a set of numbers S ? N to be register machine decidable.[2 marks](e) Let ?e ? N*N denote the partial function of one argument computed by theregister machine with program prog(e). Prove that {e ? N | ?e = one} isregister machine undecidable (where one is the function mentioned in part (b)).State carefully any standard results that you use in your proof. [4 marks]Define absolute error, relative error and machine epsilon em. Although em is definedin terms of absolute error, why is it useful as a measurement of relative error?[4 marks]For a floating-point implementation with p = 4, ß = 10, explain the round to evenmethod of rounding using the half-way cases 7.3125, 7.3175 as examples.Now consider p = 4, ß = 2. What is the value of em? What should each of thefollowing numbers be rounded to, using round to even?Computer Science Engineering & Technology Networking DDD 323

How it works

1. Paste your instructions in the instructions box. You can also attach an instructions file
2. Select the writer category, deadline, education level and review the instructions 
3. Make a payment for the order to be assignment to a writer
4.  Download the paper after the writer uploads it 

Will the writer plagiarize my essay?

You will get a plagiarism-free paper and you can get an originality report upon request.

Is this service safe?

All the personal information is confidential and we have 100% safe payment methods. We also guarantee good grades