Answer:
d.Relational
Explanation:
With the help of Access users can successfully manage valuable information by saving it easily for future reporting it , and analysis.In access users can have access to organized data in their database with minimal effort.
You can enter the data and you can select which data you want and use queries for that accordingly for example:- joins,select statements etc.
The answer to this is C :D
Answer:
O(N!), O(2N), O(N2), O(N), O(logN)
Explanation:
N! grows faster than any exponential functions, leave alone polynomials and logarithm. so O( N! ) would be slowest.
2^N would be bigger than N². Any exponential functions are slower than polynomial. So O( 2^N ) is next slowest.
Rest of them should be easier.
N² is slower than N and N is slower than logN as you can check in a graphing calculator.
NOTE: It is just nitpick but big-Oh is not necessary about speed / running time ( many programmers treat it like that anyway ) but rather how the time taken for an algorithm increase as the size of the input increases. Subtle difference.
Answer:
The answer is option (4) Maximize redundancy as normalization minimizes redundancy of data.
Explanation:
Normalization of databases leads to minimization of data redundancy in databases. It doesn't maximize data redundancy. Data redundancy leads to wastage of resources. Normalization of databases minimizes insertion anomolies. Normalization of databases minimizes deletion anomolies. Normalization of databases minimizes updation anomolies. So , the answer to the question is option (4) maximize redundancy.
Answer:
The answer is "14".
Explanation:
Let the IP address 
When it borrowed 4 bits
If the borrowed bits are left out then:
The Number of useable host addresses:
