Answer:
cout<<"User Age is ="<<userAge<<endl;
Explanation:
#include<iostream>
using namespace std;
int main()
{
int userAge;
cin >> userAge; // Program will be tested with values: 15, 40.
cout<<"User Age is ="<<userAge<<endl;
return 0;
}
Answer:
d) Social networking sites
Explanation:
-Intranet is a network that is created by an organization to share information, tools and different services inside the company.
-Wikis are websites used to share content and knowledge and different users can modify the information.
-VoIP is a technology that allows you to make calls over the internet.
-Social networking sites are online platforms that allow people to connect with organizations and other people, create communities online and share different types of information.
-Unified communications is a system that has different communication methods through a single application.
According to this, the collaboration technology that is becoming more and more popular within organizations because it provides a means for forming ad hoc groups, networking and locating potential business allies is social networking sites.
Answer:
- def is_prime(n):
- for i in range(2, n):
- if(n % i == 0):
- return False
- return True
-
- prime_truths = [is_prime(x) for x in range(2,101)]
- print(prime_truths)
Explanation:
The solution code is written in Python 3.
Presume there is a given function is_prime (Line 1 - 5) which will return True if the n is a prime number and return False if n is not prime.
Next, we can use the list comprehension to generate a list of True and False based on the prime status (Line 7). To do so, we use is_prime function as the expression in the comprehension list and use for loop to traverse through the number from 2 to 100. The every loop, one value x will be passed to is_prime and the function will return either true or false and add the result to prime_truth list.
After completion of loop within the comprehension list, we can print the generated prime_truths list (Line 8).
Answer:
Big Oh notation is used to asymptotically bound the growth of running time above and below the constant factor.
Big Oh notation is used to describe time complexity, execution time of an algorithm.
Big Oh describes the worst case to describe time complexity.
For the equation; T(N) = 10000*N + 0.00001*N^3.
To calculate first of all discard all th constants.
And therefore; worst case is the O(N^3).
Answer:
Normalization
Explanation:
Converting a poorly-structured table and optimizing its database structure in order to reduce redundancy in relations can be referred to as database normalization. If the data is not redundant means that data inconsistencies and errors like deletion and insertion will get reduced or eliminated significantly.
