All categories

1 year ago

Why can a failure in a database environment be more serious than an error in a nondatabase environment?

2 answers:

5 0

Failure in a database environment is more serious then a non data base because if you lose important information you may not get it back and failure in a nondatabase environment the problem may be more easier to solve

Anestetic [448]1 year ago

3 0

Answer:

Failures in database environments can occur due to hardware failures, power failures and software/programming error.

Of these three errors, the non-database environment can survive the hardware failure due to recovery processes and the Software/programming error.

Explanation:

Databases are quite fragile when they hit a hardware failure if you try to recover them (Most of them have raw files that can only be read by certain types of Database Management Softwares) this does not exist in the Non-Database Scenario as most of these records are kept in files.

Software failures can occur when a wrong query is used to retrieve data from a DBMS. This can be frustrating except the user gets the right query.

You might be interested in

6. Write pseudo code that will perform the following. a) Read in 5 separate numbers. b) Calculate the average of the five number

Alex

Answer:

Pseudo CODE

n= Input “Enter 5 integer value”

sum=0.0

For loop with i ranging from 0 - 5

Inside loop sum=n[i]+sum

Outside loop avg= sum/5

Print avg

small=n[0] # assume the first number in the list is smallest

large= n[0] # assume the first number in the list is largest

For loop with i ranging from 0 - 5

Inside loop if n[i]<small #if any another number is smaller than small(variable)

Inside if Then small=n[i]

Inside loop if n[i]>large # if any another number is larger than large(variable)

Inside if then large=n[i]

Print small

Print large

print avg

print small

print large

8 0

1 year ago

Which statement correctly describes an adaptive score?

d1i1m1o1n [39]

B. An adaptive score changes in response to player actions in the game.

it <em>could</em> be D. if the context was in a musical score...like an orchestra...I think that's just there to be funny

5 0

2 years ago

Read 2 more answers

Your computer uses 4 bits to represent decimal numbers (0, 1, 2, 3 and so on) in binary. What is the SMALLEST number for which a

natali 33 [55]

2 I think because 2 I think is binary I’m sorry if this is wrong

8 0

1 year ago

Suppose you are given an unknown chip which could be any one of the of the following: 7400, 7402, 7404, 7408, 7410, 7420, 7427,

Olenka [21]

The answer & explanation for this question is given in the attachment below.

3 0

1 year ago

Algorithmic Complexity: what is the asymptotic complexity (Big-O) of each code section? Identify the critical section of each.\

AleksandrR [38]

Answer:

Check the explanation

Explanation:

1) f(n) = O( 1 ), since the loops runs a constant number of times independent of any input size

there is no critical section in the code, as a critical section is some part of code which is shared by multiple threads or even processes to modify any shared variable.This code does not contain any variable which can be shared.

2) f(n) = O( log n! ), the outer loop runs for n times, and the inner loop runs log k times when i = k,ie the total number of print will be – log 1 + log2 +log3 +log4+…...+ log n = log (1 . 2 . 3 . 4 . ……. . n ) =log n!

Note : Log (m *n) = Log m + Log n : this is property of logarithm

3) f(n) = $O( n^2 )$ , since both outer and inner loop runs n times hence , the total iterations of print statement will be : n +n+n+…+n

for n times, this makes the complexity – n * n = n2

4 0

2 years ago