What is going to be the shortest, most concise restatement of information?

Computers and Technology

2 answers:

iVinArrow [24]2 years ago

4 0

Not sure i need this too

liubo4ka [24]2 years ago

3 0

Answer:

A. summary

Explanation:

I had the question before and I got it right.

You might be interested in

In the NumPy function, the data preparation technique that is used to help machine learning algorithms is called _________.

KonstantinChe [14]

In the NumPy function, the data preparation technique that is used to help machine learning algorithms is called the reshape technique or function

For better understanding, let us explain what the reshape function means

The numpy package helps to give the right tools for scientific and mathematical computations in python . it includes functions that cam be used to perform common linear algebra operations, fast Fourier transforms, and statistics The reshape function simply alter or change the row and column arrangement of data in numpy function and it is said to just give new shape to an array without the altering of its data.

from the above, we can therefore say that the answer In the NumPy function, the data preparation technique that is used to help machine learning algorithms is called the reshape technique or function is correct

learn more about reshape function from:

brainly.com/question/24728884

3 0

2 years ago

Jeremy knows that there is a keyboard shortcut in Word, but he does not know what it is. What should Jeremy do to find out what

loris [4]

The correct answer to this question is that Jeremy should use the F1 key.

In Word, the F1 key is the help button that will help Jeremy find any keyboard shortcut that he is looking for. After pressing F1, he can search for what he is looking for. A second option to find a keyboard short would be to perform a simple search on the Internet for what he is looking for.

3 0

2 years ago

Vivek wants to save the data about his grocery store in a single table. Which among the following type of databases is used in t

Orlov [11]

Explanation:

A centralized database (sometimes abbreviated CDB) is a database that is located, stored, and maintained in a single location.

4 0

2 years ago

Which of the following is among the ComScore Ad Metrix Reports?

IceJOKER [234]

I think it is d but not exactly sure

6 0

2 years ago

Matching parentheses. An math expression may have a number of parentheses like (, ), [, ], { and }. Each openning parenthesis (,

Solnce55 [7]

C++ Code

#include
using namespace std;

bool match(const char exp[],const int s)
{
// declare a character array to perform stack operations
char stack[s];

// declare top and initialize to -1 and flag to 0
int top=-1,i,flag=0;

// visit all characters in the expression string
for(i=0;i {
// if the character is [ or ( or { then push it into stack
if(exp[i]=='[' || exp[i]=='(' || exp[i]=='{')
{
top++;
stack[top]=exp[i];
}
// if the character is ] or ) or } then check conditions
else if(exp[i]==']' || exp[i]==')' || exp[i]=='}')
{
// check stack is empty or not
if(top!=-1)
{
// check all possible failure conditions
if(exp[i]==')' && (stack[top] == '{' || stack[top]=='['))
{
flag = 1;
break;
}
else if(exp[i]==']' && (stack[top] == '{' || stack[top]=='('))
{
flag = 1;
break;
}
else if(exp[i]=='}' && (stack[top] == '(' || stack[top]=='['))
{
flag = 1;
break;
}
top--;
}
else
{
flag=1;
break;
}
}
}
// after visiting all characters of expression string check if stack is not empty and flag is 1. if any one of the condition is true return false. otherwise return true

if(top>=0 || flag==1)
return false;
else
return true;
}

int main()
{

// declare character array to store expression
char exp[10000];
cout<<"Enter an Expression"<
// read expression from user
cin.getline(exp, 10000);
int s=0;

// find the length of the expression string
for(int i=0;exp[i]!='\0';i++)
{
s++;
}

// call the match function
bool status = match(exp,s);

// print the result based on value returned by match() function
if(status == 1)
cout<<"true"< else
cout<<"false"<
}

Sample Input/Output is attached

3 0

2 years ago