The largest group of Linux users is likely to be

P2p networks are most commonly used in home networks. a. True b. False

postnew [5]

The statement that P2P networks are most commonly used in home networks is true.
P2P stands for peer-to-peer communication network. It is an example of local administration. Two or more PCs share files and access to devices such as printers without requiring a separate server computer or server software with P2P type of network.

6 0

3 years ago

Michael a programmer, is writing an algorithm to solve programming problems, Guide him to write an algorithm

Nadusha1986 [10]

Answer:

Algorithms need to be simple, factual, and explained in simple but relevant vocabulary, and must be step by step, and none of the step should be missing.

Hence, first you need to understand the requirement, which can be yours or your clients.

Then consider each module of the problem, and separate each of them from the others. Now, understand the relationship between each module. And then you need to understand how you can combine them in one algorithm.

Also remember, the modules are functions. and various functions combine together to form an algorithm. We can have separate algorithms for each module as well, and then you can combine them together in right continuity to form the one single program.

Also, a project can have a loads of programs with other parts like images and various other assets and technologies.

However, everything starts with algorithms. And if are good at explaining, and a sound vocabulary, plus can explain the process well, you can explain the process well, and write a good algorithm definitely. Learn languages like Python, C, and C++ to start with, and then continue with Java, R etc. Remember we still uses functional programming as well like through Haskell etc.

The below is an example of sample algorithm. John wants to check what Ana has brought for him.

Step 1: Ana arrives with meat, which can be of goat or chicken

Step 2: John: Hi Ana

Step3: Yes John

Step 4 What meat is that Ana

Step 5: Goat

Step 7: Thanks Ana for Bringng Goat Meat

Step 8: Stop

In the above algorithm John confirms that what meat Ana has brought for him. And he comes to know She has bought Goat meat. This is the simplest of algorithm with no loop. And the complexity can be increased to any level.

Explanation:

The Answer is self explanatory, and has all that is required.

7 0

2 years ago

Read 2 more answers

What is a non-example of job outlook.

Papessa [141]

Answer:

Before you choose a career you should find out what its job outlook is. ... employed in a particular occupation over a set period, for example, two years, five years or ... 2% and 4%); Have little or no change (a decrease or increase of 1% or less) .

Explanation:

4 0

2 years ago

Given a string variable string 's;', implement a tokenizer to identify the unique tokens contained in this string, identify all

Flauer [41]

Answer:

#include <iostream>

#include <string>

#include <vector>

#include <cctype>

#include <algorithm>

using namespace std;

void matrixInit( vector< vector<int> >& matrix, int numRows, int numCols);

struct TokenFreq{

string token;

int freq;

};

string spaces(string& istr, string& newstr);

void printVector(vector<TokenFreq> & tfVec);

void getTokenFreqVec( string& istr, vector<TokenFreq> & tfVecVec);

void selectionSort( vector<TokenFreq> & tokFreqVector );

void insertionSort( vector<TokenFreq> & tokFreqVector );

//main

int main(int argc, const char * argv[]) {

vector<vector<int> > matrix;

matrixInit(matrix, 3, 4);

string ostr1 = " I do keep the main points straight in my head most of the time, and I do know where to find the details when I need them. by Bjarne Stroustrup";

string ostr2 = " ";

string ostr3 = "Your time is limited, so don’t waste it living someone else’s life.Stay Hungry. Stay Foolish.";

//string ostr = ostr2;

string istr;

cout << "Enter the text: ";

getline(cin, istr);

vector<TokenFreq> tfVec;

getTokenFreqVec(istr, tfVec);

selectionSort(tfVec);

insertionSort(tfVec);

return 0;

}

//-----

void selectionSort( vector<TokenFreq> & tokFreqVector ){

TokenFreq temp;

int min;

for( int i = 0; i < int(tokFreqVector.size()-1); i++){

min = i;

for (int j = i+1; j <int(tokFreqVector.size()); j++){

if (tokFreqVector[j].freq < tokFreqVector[min].freq)

min = j;

}

if(min!=i)

{

temp = tokFreqVector[i];

tokFreqVector[i] = tokFreqVector[min];

tokFreqVector[min] = temp;

}

cout<<"-----selectionSort------------------"<<endl;

printVector(tokFreqVector);

}

void insertionSort( vector<TokenFreq> & tokFreqVector ){

TokenFreq temp;

int max;

for( int i = 0; i < int(tokFreqVector.size()-1); i++){

max = i;

for (int j = i+1; j < int(tokFreqVector.size()); j++){

if (tokFreqVector[j].freq > tokFreqVector[max].freq)

max = j;

}

if(max!=i)

{

temp = tokFreqVector[i];

tokFreqVector[i] = tokFreqVector[max];

tokFreqVector[max] = temp;

}

cout<<"-----insertionsort------------------"<<endl;

printVector(tokFreqVector);

}

string spaces(string& istr, string & newstr){

int j;

//Check double space and create new string with lowercase

for (int i = 0; i < int(istr.length()); ++i){

istr[i] = tolower(istr[i]);

if (isspace(istr[i])){

//check double space again

j = i+1;

while(true){

if (istr[j] == '\342') istr[j]=' ';

if (istr[j] == '\200') istr[j]=' ';

if (istr[j] == '\224') istr[j]=' ';

if(isspace(istr[j])) j++;

else break;

}

i=j-1;

newstr = newstr + istr[i];

}else

newstr = newstr + istr[i];

}

return newstr;

}

void getTokenFreqVec( string& istr, vector<TokenFreq> & tfVec){

string newstr;

int curr_beg = 0;

int curr_end = 0;

string word;

bool check = false;

int index=0;

//call func spaces to get new string

newstr = spaces(istr, newstr);

//cout << newstr << endl;

//cout << endl;

//cout << newstr << "||" << endl;

string tempstr = newstr;

if(newstr != " "){

tfVec.push_back(TokenFreq());

}

for (int i = 0; i < int(newstr.length()); ++i){

if(isspace(newstr[i])){

check = false;

curr_end = i;

word = tempstr.substr(curr_beg, curr_end - curr_beg);

curr_beg = i + 1;

for (int j = 0; j < int(tfVec.size()); j++){

if (tfVec[j].token == word){

tfVec[j].freq++;

check = true;

break;

}

}//end-for;

if (check == false && i!=(int(newstr.length())-1)){

//cout <<"**"<< word <<"**"<<word.length()<< endl;

tfVec[index].token=word;

tfVec[index].freq=1;

index++;

tfVec.push_back(TokenFreq());

}

word = "";

//add last value

}

}//end-for

if(!isspace(newstr[int(newstr.length())-1])){

word = tempstr.substr(curr_beg, curr_end - (int(newstr.length())-1));

tfVec[index].token=word;

tfVec[index].freq=1;

//tfVec.push_back(TokenFreq());

}

printVector(tfVec);

}

void printVector(vector<TokenFreq> & tfVec){

cout << "size= {" << tfVec.size() << endl;

for (int i = 0; i < int(tfVec.size()); i++){

cout << " [" << i << "] = (token = \""<< tfVec[i].token <<"\", freq = " << tfVec[i].freq << ")" << endl;

//cout << tfVec[i].token<<endl;;

}

cout << endl;

}

void matrixInit( vector< vector<int> >& matrix, int numRows, int numCols){

int i;

int j;

matrix.resize(numRows, vector<int>(numCols) );

for(i = 0; i< numRows; i++ ){

for(j = 0; j < numCols; j++ )

matrix[i][j] = i*j;

}

cout << "size of matrix is: " << numRows << "x" << numCols << endl;

for (i = 0; i < numRows; i++){

for (j = 0; j < numCols; j++){

cout<< "matrix[" << i << "][" << i << "]=" << matrix[i][j] << endl;

}

cout << endl;

}

Explanation:

3 0

2 years ago

Provides an array of buttons for quick access to commonly used commands and tools

MatroZZZ [7]

Answer:Tool bar

Explanation:

The toolbar is said to provide an array of buttons for quick access to commonly used commands and tools. Through the toolbar, one can easily access the commands that are commonly used.

We can see the toolbar in several software like the graphics editor, office suites, and browsers.

8 0

2 years ago

Read 2 more answers