The "Round of Life" is played on a leading body of square cells. Every cell is all things considered "live" or then again "dead". At first most cells are dead, however an it is set to seed example of live ones up. Each square cell has eight quick neighbors (North, South, East, West, furthermore, four slanting ones). At each time step all cells change all the while. On the off chance that a cell is dead, it becomes alive assuming that it had (not long before this time step) precisely three live neighbors. On the off chance that it is alive, it turns out to be dead except if it has a few live neighbors. In this inquiry, areas past a 1000  1000 board are to be treated as for all time dead. (a) Show how to set up a straightforward Java 2-layered exhibit of boolean qualities to address a Life Board, with all cells at first "dead". [2 marks] (b) For an area (I, j) on the board, give code that will choose whether the following condition of that cell ought to be alive or dead. Clarify how your code adapts in the event that the cell is at the limit of the board. [4 marks] (c) Referring to part (b),te code that takes one board addressing the current condition of the game and fills in a subsequent board-exhibit with the state showed up at after one time step. What might occur if rather than utilizing two clusters you composed the new cell state straightforwardly back, utilizing only a solitary duplicate of the board? [3 marks] (d) Re-work your answer for part (c) so you can play out a period step utilizing just one board. You might have to utilize a 1000-component vector to store data such that makes the update safe. [7 marks] (e) All the code you have composed up until this point utilizes a variety of boolean qualities. Some software engineers would rather utilize a variety of int values and treat each of the 32 pieces in each int as giving the situation with a cell. Assume you have a 2-layered cluster of numbers of size 1024 by 32 (that size is picked so the exhibit of whole numbers might be seen as a 1024 by 1024 cluster of pieces): give code to recover a piece from a given position (I, j). [4 marks] 8 CST.2006.1.9 Area E 11 Algorithms (a) What is the time intricacy of paired search on a rundown of N things? [1 mark] (b) Binary inquiry requires list things to be in arranged request. What is awesome conceivable most pessimistic scenario time intricacy feasible by an examination based arranging calculation? Credit will be offered for an unmistakable clarification of your response, yet there is compelling reason need to give a formal numerical examination or evidence. [7 marks] (c) An analyst proposes a ternary hunt calculation which more than once looks at the hunt key with the two rundown things that most precisely trisect the staying arranged search space. (I) Derive asymptotic articulations for the quantity of rundown things questioned by parallel inquiry and by ternary pursuit in the most pessimistic scenario. Make sense of your inductions with regards to most pessimistic scenario executions of the pursuit calculations. [6 marks] (ii) Approximately the number of additional rundown things are questioned by a ternary pursuit contrasted and an identical paired search, in the most pessimistic scenario? Express your response as a numeric rate. Whenever required, you might expect to be that the rundown being looked is extremely huge and that log2 (3) ? 

Q1 (a) (b) Fig Q1(a) shows an amplifier connected to a source and a load. What is the overall gain in dB of the system? Amplifier R, = 10 in -o HH C Rin 100 k] Rout=230 R, = 20 2000 Fig Ol(a) The amplifier of Fig Q1(b) has a mid-band gain of -20 and a passband from 1 kHz to 20 kHz. If R = 20 km2, calculate the values of R, C and C to implement this: Fig Q1(b) HH C Ri = 10 R [8] Vout [10] (c) In no more than 5 sentences, explain the role that analogue electronics play in our everyday life and why it is important in your opinion. [7]