Mr. Jones put 1.2 bags of potting soul around each tree. To solve this problem divide the number of bags by the number of plants.
Hope this helps!
Answer:
1. DBMS
C. <em>A storage system that provides efficient access to randomly chosen items</em>
G. <em>Performs database operations requested by application software</em>
2. data mining
B. <em>The process of extracting hidden information</em>
3. hash file
A. <em>A. means of locating a particular record within a file</em>
4. index key field
F. <em>An item used to identify records uniquely</em>
5. locking protocol
E. <em>A system to guard against database errors due to performing transactions concurrently</em>
6. relation
D. <em>A structural unit (with rows and columns) in a popular database model</em>
7. roll back schema
I. <em>A "road map" of a particular database's design</em>
J. <em>To "unwind" a transaction</em>
8. SQL
H. <em>A popular language that implements relational database operations.</em>
i think its the first sentence: Mobile devices have become the main source of communication for many people around the world
if im wrong im dum ;-;
Answer:
name = re.search(r"^([\w \.-]), ([\w \.-])$", list_name)
Explanation:
Regular expression is used to simplify the mode in which items in a data structure are for. It uses wildcards as shortcuts.
The python module for regular expression is 're'. The import statement is used to get the module and the search() method of the module is used to get the one matching item while the findall() method is used to get a list of all the matching items in a data structure.
Answer:
No you can not tell that recursion is ever required to solve a problem.
Recursion is required when in the problem, the solution of the input depends on the solution of the subsets of the input.
Iteration is also another form of repetitive approach we follow to solve that kind of problems.
But the difference between recursion and iteration is :
- In recursion we call the function repeatedly to return the result to next level.
- In iteration certain bunch of instructions in a loop are executed until certain conditions met.
Explanation:
For example in the Fibonacci sequence problem, to find 
, we need to compute 
and 
before that.
- In case of recursion we just call the method Fibonacci(n) repeatedly only changing the parameter Fibonacci(n-1), that calculates the value and return it.
Fibonacci(n)
1. if(n==0 or n==1)
2. return 1.
3.else
4. return( Fibonacci(n-1)+Fibonacci(n-1) )
- But in case of iteration we run a loop for i=2 to n, within which we add the value of current
and 
to find the value of 
Fibonacci(n)
1. if(n<=2)
2. result = 1
3. else
4. result1 =1 and result2=1.
5. { result = result1 +result2.
6. result1= result2.
7. result2 = result.
8. }
9. output result.
