Which type of scanner will you use to scan a film

Worksheet ranges can be turned For easy analysis

Firdavs [7]

Answer:

Worksheet ranges is a group of cells, and a value range like 25 to 340. It is used for data modeling. Like you can use it in the vlookup, Hlookup and Xlookup for looking up a column cell value in the mentioned worksheet range. Different worksheet's ranges of cells can also be used, and in any number from throughout the workbook, and that makes the analysis quite easy. Through work sheet ranges we get the control over all the cells as well as cells group. Whatever analysis we do, we do on the list of cells. And through the worksheet ranges we get the control over the cells. And thus, this is extremely useful definitely.

Explanation:

Like one worksheet range can be from top left corner to the bottom right corner. And this assigns whole worksheet as the worksheet range.

Its used in almost all the Excel formulas, and you must know it.

An example is:

Worksheets("Sheet2").Range(Cells(2, "B"), Cells(35, "B")).select

This selects the Range B2:B35 from Sheet 2.

6 0

4 years ago

Explain how any simple substitution cipher that involves a permutation of the alphabet can be thought of as a special case of th

Kaylis [27]

A simple substitution cipher takes each vector ( $e_i$ ) and assigns it to the vectors [ $e_{\pi (i)}$ ] in a one-to-one function so as to make them equivalent.

<h3>What is the Hill cipher?</h3>

In 1929, the Hill cipher was invented by Lester S. Hill and it can be described as a poly-graphic substitution cipher that is typically based on linear algebra and it avails a cryptographer an ability to simultaneously operate on more than three (3) symbols.

In Cryptography, the simple substitution cipher is usually viewed as a function which takes each plaintext letter (alphabet) and assigns it to a ciphertext letter. Thus, it takes each vector ( $e_i$ ) and assigns it to the vectors [ $e_{\pi (i)}$ ] in a one-to-one function so as to make them equivalent.

Read more on Hill cipher here: brainly.com/question/13155546

#SPJ1

6 0

2 years ago

Question 1 of 30

Paha777 [63]

It’s exercise tax $5 tax on a cable television line

hope this helped

~ mo

7 0

3 years ago

What is java programing <br>

sesenic [268]

Answer:

Explanation:

Java is a class-based, object-oriented programming language that is designed to have as few implementation dependencies as possible. ... Java applications are typically compiled to bytecode that can run on any Java virtual machine (JVM) regardless of the underlying computer architecture

8 0

3 years ago

Read 2 more answers

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

3 years ago