SOLVE

sensible to use, and another that would in principle achieve the desired result but which would have significant disadvantages. You may identify standard methods by name and need not describe in detail how they work, but should make it clear what properties the schemes that you identify have that make some of them more appropriate than others. (a) You need to represent some (directed) graphs where when a graph has N vertices it will have around N log N edges. The number of vertices, N, may become quite large. [4 marks] (b) In the process of rendering a graphical image you have already sorted all the objects that have to be drawn with an ordering based on their distance from the viewpoint. Now the image has been changed slightly so that you can start to display the next frame of the video sequence, so all the distances have changed, and you need to sort the objects again. [4 marks] (c) You need to build a table. It will be possible to insert objects into the table or retrieve previously stored ones. The only operation you are permitted to perform on objects is a pair-wise comparison that can tell if two objects are equal and if not indicates an ordering between them. There will be both plenty of insertion operations and plenty of lookups. [4 marks] (d) You need to find the shortest distance (through a directed graph that has lengths associated with each edge) from a nominated source point A to each of a collection of destinations {Bi}. [4 marks] (e) Blocks of material, each identified by a key, are to be stored on a large disc. From time to time new blocks (and associated keys) will need to be added, but mostly you need to service requests where a user submits a key and wants the corresponding information recovered. There is so much data that the disc is fairly full. [4 marks] 4 CST.95.10.5 6 Data Structures and Algorithms A reasonable approximation for the average number of probes to insert a new entry into an open hash table where a fraction of the table is already in use is 1/(1). Suppose that data is stored by initially creating a really tiny hash table (say a vector of size just 8). Entries are added to the table from time to time. Whenever the table becomes 3/4 full a new hash table, twice the size, is created: all existing data is taken out of the old table, and inserted instead into the new one. Thus in general the table that is in use will be between 3/8 and 3/4 full, and looking things up in it will be efficient. Although the above method has good predicted costs for retrieving information stored in the table, there remains some worry that the repeated cost of copying data from smaller to larger tables may be excessive. Suppose that at some stage N items have been inserted and that the very last insertion provoked the copying step. Estimate the ratio between the total number of hash probes performed while building the table and N. How does it compare with the number that would have been used if the table had been built full-sized to start with rather than having to grow stage by stage on the way? [20 marks] [If you really need their values, you may assume that ln(2) = 0.7, ln(3) = 1 and ln(5) = 1.6, but note that you are not expected to perform any arithmetic tedious enough to call for a calculator: a reasonable estimate (for example to within a factor of 1.5) and a justification of how that value was arrived at is what is required.]

grand debate is being planned by a society that has among its members a large number of computer professionals and working programmers. The motion to be put is "That the languages C and C++ should be consigned to outer darkness and their use banned in all serious computer projects". Prepare as your answer to this question a briefing document that could explain to people intending to attend the debate what the major points both for and against C and C++ will be, and the lines of arguments that are liable to be used to show how important they are. You are not required to come down either in favour of or against the languages (but may if you wish). [20 marks]

What varieties of information might an automatic journey agent want to represent? [5 marks] Using the automated travel agent for instance, outline 5 issues linked with knowledge representation. [10 marks] Would an expert system be a appropriate technique for imposing an automated journey agent? [5 marks] 7 Neural Computing Illustrate how stochasticity can be used in synthetic neural networks to clear up, at least in an asymptotic feel, problems that could in any other case be intractable. Name at least two such stochastic engines, describe the role of stochasticity in each, and perceive the styles of problems that such synthetic neural gadgets seem able to resolve. [10 marks] Illustrate the proof for stochasticity in natural fearful structures, and comment at the role that it'd play in neurobiological feature. What is the case helping John von Neumann's deathbed prediction that stochasticity might be a computational engine for the nervous device, instead of simply random noise? Describe at least one experiment regarding neural tissue in help of this theory. [10 marks] 8 Database Topics Describe the simple architecture of the ODMG-93 trendy for Object Database Management. [5 marks] In what manner do those proposals permit database management to be included with Object-Oriented Distributed Programming? [3 marks] Explain the houses of collection types, taking care to differentiate between literals and items. [6 marks] Describe how an SQL-compatible query language may be defined in the ODMG fashionable. What provision may be made for insertion, replace and deletion?

[2:29 PM, 4/11/2022] fridahkathambi71: Draw a FST which perceives the join - ly connected with normal verb modifiers in English. Exhibit that your FST accurately handles cases, for example, splendid splendidly, basic just, senseless sillily and fabulous breathtakingly. [9 marks] (d) regarding phonetic peculiarities, which parts of the morphology of modifiers does your FST neglect to accurately deal with? Would these issues be able to be fixed with a more elaborate FST, or would they say they are general issues with FST?

(b) Why is the JPEG2000 picture pressure convention such a great deal better compared to the unique JPEG in conveying great outcomes even at extreme pressure rates? What are the fundamental distinctions in the premise capacities or coding wavelets utilized, what remaking ... [11:07 PM, 4/11/2022] fridahkathambi71: A puzzle, or one-person recreation, can be represented in ML via two features: a subsequent-kingdom feature, which maps a state to a listing of feasible subsequent states, and

a wins characteristic, which returns genuine if the given state counts as a win. A easy instance is a puzzle that has states including advantageous integers, a nextstate feature that maps n to [n+ 2, n+ 5], and a "wins" feature that returns genuine if n = 10. We can win if we start from n = 2 but not from n = 7. (a) Code a polymorphic datatype 'a puzzle, to represent a puzzle by means of the pair of a next-kingdom feature and a wins function. [2 marks] (b) Briefly assessment intensity-first search, breadth-first search and iterative deepening as strategies for fixing such puzzles. [6 marks] (c) Write a characteristic intensity that accepts a puzzle, a kingdom and a depth limit. It have to use intensity-first seek to determine whether the puzzle can be solved from the given country in the given depth restrict. [6 marks] (d) Write a characteristic breadth that accepts a puzzle and a kingdom. It ought to use breadth-first search to determine whether the puzzle can be solved from the given nation. [6 marks] All code ought to be defined certainly. You may count on that any essential ML information structures or capabilities are to be had. 4 CST.2008.1.Five SECTION C 7 Operating Systems (a) What is record metadata? [2 marks] (b) Explain with the aid of a diagram how document metadata is controlled in: (i) the Unix document-gadget; [4 marks] (ii) the FAT32 file-gadget; [4 marks] (iii) the NTFS file-device. [4 marks] (c) A researcher suggests the usage of non-unstable flash reminiscence to shop the NTFS log report. He believes this can enhance performance, reduce electricity intake and make the gadget greater resilient to failure. Is he proper? Briefly justify your answer in each case. [2 marks each] eight Operating Systems (a) In fashionable we will keep in mind a process to transport among 5 method states at some stage in its lifestyles. Discuss, with the aid of a diagram, the instances in which a manner will input or go away each of these states. [6 marks] (b) Both Unix and Windows NT use dynamic precedence scheduling. Compare and assessment their scheduling algorithms, with a selected attention on how dynamic priorities are controlled. [8 marks] (c) Which statistics systems might you operate if implementing a dynamic priority scheduling algorithm? Justify your solution. [2 marks] (d) Some industry predictions suggest that during less than five years we shall have chips with hundreds or maybe lots of CPUs on them. What types of scheduling algorithms do you think could be appropriate for such systems? What problems do you foresee?

Write java program that takes each n (as enter) and n integer inputs and add the given values to a defined array

(a) Show how you'll create a Java array of a thousand integer values. [1 mark] (b) The values in an array could be used to symbolize digits in the decimal representation of quite a number. For example, the number 1 7 has decimal illustration 0.142857 . . . And that might be saved in an array whose elements commenced 1, 4, 2, . . .. For various saved that manner write code that multiplies the variety by a given integer, returning the entire wide variety a part of the end result and leaving the array up to date to maintain the fractional part of the product. [5 marks] (c) To convert a fraction to a illustration base 16 (i.E. Hexadecimal) you could multiply it by means of 16, and the resulting integer element is the primary digit of the bottom-sixteen representation. Multiplying the fraction left over by way of sixteen receives the second one digit and so on. Write a method that accepts an array of digits (base 10) and creates and returns a brand new array representing the identical fraction but now base sixteen. Your code need to paintings for any duration input array, now not simply one of period one thousand, and you could make the output array have the identical length as your enter array. [6 marks] (d) Suppose the enter in your method in component (c) become of length 1000 and began off with the decimal digits of 1 7 in it. Although the initial digits within the output array are the proper hexadecimal representation of 1 7 the last few become looking ordinary. Explain. [3 marks] (e) One manner to make sure that numerical results are correct is to apply c language arithmetic. A cost is represented as a couple of arrays, one representing a wide variety less than (or identical to) the genuine fee and one a value more than it. So if using 6 decimal locations the #1 7 might be held as a pair 142857, 142858. If the two final digits range through at most 1 then the smaller of them may be considered as absolutely accurate. Using this concept, write code that accepts a fraction in decimal form and returns a vector denoting the equal fee in any other base n (now now not always sixteen) such that all the digits within the end result vector are correct. Clarity to your code is to be desired to performance, but in case you are privy to precise methods wherein the code you gift is specially inefficient, you ought to notice and give an explanation for them. [5 marks] 6 CST.2008.1.7 10 Programming in Java The following is one of the examples from the Foundations of Computer Science route: exception Change; fun alternate (until, zero trade ([], amt) = improve trade (c::until, amt) = if amt<0 then raise change else (c :: change(c::till, amt-c)) handle> change(until, amt); (a) Define a Java elegance of your own (i.E. Do no longer use any library elegance that you may be aware of) to represent related lists of integers. Provide it with methods that may be used to reverse a list and to append two lists. Comment on whether your design has led you to make the techniques for append and reverse static. [7 marks] (b) Prepare a method known as alternate that works within the identical way because the ML code shown above. Provide the elegance which you outline it in with a primary method that makes use of it to attempt to make trade for 73p using 2p, 5p and 20p cash, printing the result well. [7 marks] (c) If you have got lists of non-zero integers such that all the values in them are much less than 256 and you have at maximum 8 gadgets in any listing you could p.C. Eight eight-bit fields into a unmarried 64-bit "long". That offers a representation that a few humans would possibly assume to be quicker than using lists represented through chained up instances of a class. Re-paintings your trade-giving code primarily based at the above idea, and modelling using exceptions with the aid of making the trade characteristic go back -1L in the extremely good case.

An inertial navigation set has a mean time to failure of 1000 hours. If an aircraft is fitted with two of them to increase reliability, is the mean time to failure of both systems which is experienced in practice likely to be several thousand hours or about a million hours? Give a brief justification for your answer. (r ) Outline the key principles of loop design, considering the simple case of a while loop.

In an edge triggered flip flop, explain what is meant by (a) hold time (b) setup time (c) delay from clock edge to output [3 marks] What relation should hold between two of these quantities to provide sensible behaviour and why? [5 marks] Comment on the possibility and desirability of negative hold times. [2 marks] Each of the following boolean functions is a function of the four variables w, x, y, z. The functions are not totally specified and may take on any value for certain inputs. fn indicates where the function must be true, while gn is true where the value of the function is not constrained. Draw maps and provide a minimum sum of products form for each of the functions. (a) f1 = wxyz + wxyz + wxyz + wxyz + wxyz + wxyz g1 = wxy z + wxyz (b) f2 = wxyz + wxyz + wxyz + wxyz + wxyz + wxyz + wxyz + wxyz + wxyz g2 = wxy z + wxyz [5 marks] Let f(x0, x1, . . . , xn1) be equal to 1 if and only if exactly k of the variables have the value 1. How many prime implicants does this function have? [5 marks] 4 CST.99.2.5 SECTION C 4 Probability A B Each of the five switches in the above circuit is closed with probability p, independently of all the other switches. What is the probability of there being a connection from A to B? Express the answer as a polynomial in p. [7 marks] The circuit is then modified to the version shown below,