Any problem that can be solved with recursion could be re-implemented.docx

•Transferir como DOCX, PDF•

0 gostou•2 visualizações

Any problem that can be solved with recursion could be re-implemented with loops. True False Solution Yes True There are times where using recursion is better than using a loop, and times where using a loop is better than using recursion. Choosing the \"right\" one can save resources and/or result in fewer lines of code. Are there any cases where a task can only be done using recursion, rather than a loop Loops without recursion can definitely simulate recursion if given a stack, but what about recursion, can it solve whatever problems loops can solve Yes. Recursion to implement loops is a common idiom For example For example def foo() s=0; i=0; while i<10 s=s+i; i=i+1; return s; print foo(); the above code can be ritten as: def foo(s,i); if i<10; return foo(s+i,i+1); return s; print foo(0,0) .

Mais conteúdo relacionado

Mais de rtodd665

Answer the following questions or fill in the blanks using information contained in the periodic table. a) Boron has properties of both metals and nonmetals and is called a _____________. b) Transition metals are also known as _____-block elements when writing electron configurations. c) Certain nonmental elements like to exist as a pair (H2, F2, etc...) and are called _____________. d) Rows in the periodic table are called _____________. e) Group 18 elements are better known as_______________. f) Iced tea would be best described as a (heterogeneous/homogeneous) mixture. g) Most atoms on the periodic table strive to have______ electrons in their outer shell. Solution Answer a) metlloid b) d-block elements c) covalent molecule d) periods e) inert gases f) hetrogeneous mixture g) 8 electrons .

Answer the following questions or fill in the blanks using information.docx

rtodd665

app.tophat.com 21 Solutions Now we can simulate doing a 5-fold dilution. This is achieved by adding extra water until the volume of the solution is now five times that of the original solution. Increase the volume of the solution to 1.00L. Assigned as Simulation Question- Dilutions What is the new concentration? OA 0.100 M B 0.200 M OC0.250M OD 0.500 M OE 100 M Submit Solution Initial concentration M1 = 0.500 M Initial volume V1 = 0.200 L Final volume V2 = 1.00 L New concentration = M2 M1 x V1 = M2 x V2 M2 = M1 x V1 / V2 = 0.500 x 0.200 / 1.00 = 0.100 M Option A is the correct answer .

app-tophat-com 21 Solutions Now we can simulate doing a 5-fold dilutio.docx

rtodd665

Answer: 4.975 light years 2. Round-Trip Visit to a Star Suppose the spaceship in problem 1 travels to a distant star and then returns to Earth. Suppose an astronaut on the ship ages one year during the trip, while NASA technicians on Earth age 10 years during the trip. How far away is the distant star, as measured by the NASA technicians? Note: Treat the Earth as a reference frame which is at rest in this problem Solution let speed of the spaceship be v. using time dilation, time spent by the astronaut=time spent by the technician*sqrt(1-(v^2/c^2)) ==>1=10*sqrt(1-(v/c)^2) ==>1-(v/c)^2=(1/10)^2=0.01 ==>v/c=0.99499 ==>v=0.99499*c then distance of the star=(time spent by the NASA technician/2)*speed = 4.9749 light years (it is divided by 2 as the spaceship has to cover double the distance ) .

Answer- 4-975 light years 2- Round-Trip Visit to a Star Suppose the sp.docx

rtodd665

Anser in your own words: How did the enclosures law fuel the Industrial Revolution in Great Britain? Solution An understanding of the Enclosure Acts is necessary to place aspects of the Industrial Revolution in their proper context. The Industrial Revolution is often accused of driving poor laborers en masse out of the countryside and into urban factories, where they competed for a pittance in wages and lived in execrable circumstances. But the opportunity that a factory job represented could only have drawn workers if it offered a better situation than what they were leaving. If laborers were driven to the cities, then some other factor(s) must have been at work. The Enclosure Acts were one factor. These were a series of Parliamentary Acts, the majority of which were passed between 1750 and 1860; through the Acts, open fields and .

Anser in your own words- How did the enclosures law fuel the Industria.docx

rtodd665

Any help is appreciated, thank you. 2d. What is the difference between a crystalline and amorphous material? e. Describe, using diagrams, the following crystal defects: i. Substitutional ii. Interstitial iii. Vacancy f. The energy of formation of a vacancy in Al is 0.6 eV/atom. Estimate the equilibrium number of vacancies in 2 kg of Al at 300Â°C. Solution d. Crystalline materials are organized into repeating units. For example, in NaCl, the repeat unit is a cube, with Na and Cl alternating in along the x, y, and z axial directions. Amorphous materials just go every which way, willy-nilly, with no large scale order. .

Any help is appreciated- thank you- 2d- What is the difference between.docx

rtodd665

Assume that you have an aqueous solution of an unknown salt. Treatment of the solution with dilute BaCl2. AgNO3, and Cu(NO3)2 produces no precipitate. Which of the following anions might the solution contain? (Check ALL anions it could be.) (T NO3 OHT S042- Solution BaCl 2 gives precipitate for SO 4 2- anion and thus sulfate is not present in the solution. AgNO 3 gives precipitate for Cl - anion and thus chloride is not present in the solution. Cu(NO 3 ) 2 gives precipitate for NO 3 - anion and thus nitrate is not present in the solution. The only anion left is hydroxide (OH - ) and thus hydroxide only is present in this solution. .

Assume that you have an aqueous solution of an unknown salt- Treatment.docx

rtodd665

Assume that you have the following incomplete definitions of Graph and Graphnode classes: class Graphnode { private T data; private int index;//for indexinq into edqe matrix or nodes array public T getDataO { return data;} public int getlndexQ { return index;}} public class Graph { private Graphnode[] nodes; private boolean[][] edge;//edge[i][j] is true if//edge (i,j) is in the graph} Consider writing the following method which calculates the in-degree of a given node n. An incomplete version of the method is as follows: private int inDegree(Graphnode n) { int nodeNum = n.getlndex();//for indexing into edge matrix int deg = 0; for (int i = 0; i Solution 10.) A 11.) E .

Assume that you have the following incomplete definitions of Graph and.docx

rtodd665

Assume that the amounts of the company Oslo Company prepared the f.docx

rtodd665

Assume that bands is an ArrayList of String objects which contains a number of elements in ascending order. Select a statement to complete the code segment below, which invokes the Java library binarySearch method to search for the string \"Beatles\". If the list does not already contain the string, it should be inserted in an appropriate location so that the list remains sorted. int index = Collections.binarySearch(bands, \"Beatles\"); if (index < 0) { __________________________ } a) bands.add(-1 * index + 1, \"Beatles\"); b) bands.add(index + 1, \"Beatles\"); c) bands.add(-1 * index, \"Beatles\"); d) bands.add(-1 - index, \"Beatles\"); Solution c) bands.add(-1 - index \"Beatles\"); will add the element into the perfect position in the list. .

Assume that bands is an ArrayList of String objects which contains a n.docx

rtodd665

Assume DRAM access time is 70 ns, and tha the memory accesses are 36% of the instructions. Consider a computer with the following cache configuration: L1 size: 2 KiB L1 Miss rate: 8% L1 Hit time: 0.66 ns L2 Size: 1 MiB L2 miss rate: 95% L2 Hit time: 5.62 ns a) what is AMAT? b)Assuming a base CPI of 1.0 without any memory stalls, what is the total CPI for the CPU? Solution Miss penality= DRAM access time / number of memory accesses. =70 / 0.36 =>194 cycles a) AMAT = Hit time + Miss rate Ã— Miss penalty L1: 0.66 + 0.08 * 194 =>16.18 L2: 5.62 + 0.95 *194 =>189.92 b) total CPI = base CPI + miss rate * miss penality = 1+ (0.08 * 194)+(0.95 *194) ===>200.82 .

Assume DRAM access time is 70 ns- and tha the memory accesses are 36-.docx

rtodd665

Mais de rtodd665 (10)