What is the full form of MPEG?<br> The full form for MPEG is _______

Saas provides services to an organization that requires the standard business process infrastructure such a CRM

Rzqust [24]

Answer: True

Explanation:

Yes, the given statement is true that the SaaS (Software as a service) provide the different types of services to the organization which basically require the infrastructure like CRM (Customer relationship management) and it is the standard business processing in the organization.

The software as a service is the fundamental technology of the business which basically include the CRM, e-mails and the various types of sale and financial management.

5 0

3 years ago

Consider the following schema for customer: (id, name, street, city, state, zip, phone), in which customers are uniquely determi

Art [367]

Answer:

Super key is a set of attributes that uniquely identifies all attributes in a relation.Super keys are more than candidate key.

Explanation:

For example in the given schema where

Customer: (id , name , street , city,state,zip,phone)

We have a relation we check super keys by following dependencies

Functional Dependencies Super Key

id YES

name YES

id , name -> street , city,state,zip,phone YES

id , street ->name , city,state,zip,phone YES

id,city ->name , street ,state,zip,phone YES

id,state ->name , street ,city,zip,phone YES

id,phone ->name , street ,state,zip,city YES

id , name , street YES

id , name , street , city YES

id , name , street , city,state YES

id , name , street , city,state,zip,phone YES

All these are uniquely identified

All these are super key but in reverse they are not super key such as

street , city,state,zip,phone->id , name No

8 0

2 years ago

71 81 77 15 63 96 36 51 77 18 17

sp2606 [1]

Answer:

Following are the solution to this question:

Explanation:

This algorithm uses the divide and rule approach works, which splits the list into two sublists depending on if they are smaller or larger than the pivotal factor. It has O(n*log n) complexity.

It splits down the list in more than one version frequently till every sublist becomes based on a single element and fuses it to offer an ordered array. The merge type works according. It has O(n*log n) complexity.

Please find the attachment file of the sorting.

4 0

3 years ago

1. Write a program that declares an array named alpha with 50 components of the type double. Initialize the array so that the fi

Aleksandr [31]

Answer:

Explanation:

1. Write a program that declares an array named alpha with 50 components of the type double. Initialize the array so that the first 25 components are equal to the square of the counter (or index) variable and the last 25 components are equal to three times the index variable.

double alpha[50];

for (int i=0;i<25;i++)

{

alpha[i]=i*i;

alpha[i+25]=(i+25)*3;

}

2. Output the array so that exactly ten elements per line are printed.

for (int i=0;i<50;i++)

{

cout<<i+1<<". "<<alpha[i]<<" ";

if (((i+1)%10)==0)

{

cout<<endl;

}

3. Run your program again, but this time change the code so that the array is filled with random numbers between 1 and 100.

double alpha[50];

for (int i=0;i<50;i++)

{

alpha[i]=rand()%101;

}

for (int i=0;i<50;i++)

{

cout<<i+1<<". "<<alpha[i]<<" ";

if (((i+1)%10)==0)

{

cout<<endl;

}

4. Write the code that computes and prints the average of elements of the array.

double alpha[50],temp=0;

for (int i=0;i<50;i++)

{

alpha[i]=rand()%101;

temp+=alpha[i];

}

cout<<"Average :"<<(temp/50);

5. Write the code that that prints out how many of the elements are EXACTLY equal to 100.

double alpha[50],temp=0;

for (int i=0;i<50;i++)

{

alpha[i]=rand()%101;

if(alpha[i]==100)

{

temp++;

}

cout<<"Elements Exacctly 100 :"<<temp;

Please note: If you put each of above code to the place below comment it will run perfectly after compiling

#include <iostream>

using namespace std;

int main()

{

// If you put each of above code here it will run perfectly after compiling

return 0;

}

8 0

3 years ago

C++ a. Write a program that uses the function isPalindrome given in example 6-6 (Palindrome). Test your program on the followinn

Whitepunk [10]

Answer:

#include <iostream>

#include <array>

using namespace std;

bool isPalindrome(string str)

{

int length = str.length();

for (int i = 0; i < length / 2; i++)

if (toupper(str[i]) != toupper(str[length - 1 - i]))

return false;

return true;

}

int main()

{

array<string, 6> tests = { "madam", "abba", "22", "67876", "444244", "trymEuemYRT" };

for (auto test : tests) {

cout << test << " is " << (isPalindrome(test) ? "" : "NOT ") << "a palindrome.\n";

}

Explanation:

The toupper() addition forces characters to uppercase, thereby making the comparison case insensitive.

5 0

3 years ago

What is the full form of MPEG? The full form for MPEG is ________.