What is bigger 4 liters or one gallon

2ND LAST QUESTION

pychu [463]

Answer:

B

Explanation:

3 0

3 years ago

Type the correct answer in the box. In which phishing technique are URLs of the spoofed organization misspelled? _____ is a phis

vodka [1.7K]

Answer:

Link manipulation

Explanation:

With the link manipulation the phisher manipulate the URL link, in this case, the URL can seem similar to an original website, but this link sends you to a fake website, and you enter for example your bank or personal information, the phisher use this data to steal money or delicate data, sometimes these links are sent by email or text messages.

4 0

4 years ago

Question B_1 (15 points) Please define (describe) local variables and how they are used in computer programming ( e.g. In C, C )

OverLord2011 [107]

Answer and Explanation:

Static variables are variables that still maintain their values outside the score which they are declared. They are declared with the static keyword

Example:

static int score = 30;

Local variables are variables whose scope are restricted to a block. Their values are restricted to the block which they are declared in.

Example:

void abd(){

int score;

}

score is a local variable to abcd() function

5 0

3 years ago

What sort of technique would you use to sort 10,000 items using just 1000 available slot in your RAM?

beks73 [17]

Answer:

d. Merge sort

Explanation:

Merge sort is example of an efficient sorting alogrithm. The Divide and conquer rule is used in this technique. This method breakdown the list into multiple sublists and each sublist contains a single element. This technique merged in the form of sorted lists. This technique uses external memory of the system while sorting.

Merge sort is used to sort the 10,000 items using only 1,000 slots available in the RAM.

5 0

3 years ago

Write a program that takes paragraph from the user and prints all unique words in that paragraph using strings in c++

Bezzdna [24]

Answer:

void printUniquedWords(char filename[])

void printUniquedWords(char filename[]) {

void printUniquedWords(char filename[]) { // Whatever your t.text file is

fstream fs(filename);

fstream fs(filename); map<string, int> mp;

fstream fs(filename); map<string, int> mp; // This serves to keep a record of the words

string word;

string word; while (fs >> word)

string word; while (fs >> word) {

string word; while (fs >> word) { // Verifies if this is the first time the word appears hence "unique word"

if (!mp.count(word))

if (!mp.count(word)) mp.insert(make_pair(word, 1));

if (!mp.count(word)) mp.insert(make_pair(word, 1)); else

if (!mp.count(word)) mp.insert(make_pair(word, 1)); else mp[word]++;

if (!mp.count(word)) mp.insert(make_pair(word, 1)); else mp[word]++; }

if (!mp.count(word)) mp.insert(make_pair(word, 1)); else mp[word]++; } fs.close();

if (!mp.count(word)) mp.insert(make_pair(word, 1)); else mp[word]++; } fs.close(); // Traverse map and print all words whose count

if (!mp.count(word)) mp.insert(make_pair(word, 1)); else mp[word]++; } fs.close(); // Traverse map and print all words whose count //is 1

if (!mp.count(word)) mp.insert(make_pair(word, 1)); else mp[word]++; } fs.close(); // Traverse map and print all words whose count //is 1 for (map<string, int> :: iterator p = mp.begin();

if (!mp.count(word)) mp.insert(make_pair(word, 1)); else mp[word]++; } fs.close(); // Traverse map and print all words whose count //is 1 for (map<string, int> :: iterator p = mp.begin(); p != mp.end(); p++)

if (!mp.count(word)) mp.insert(make_pair(word, 1)); else mp[word]++; } fs.close(); // Traverse map and print all words whose count //is 1 for (map<string, int> :: iterator p = mp.begin(); p != mp.end(); p++) {

if (!mp.count(word)) mp.insert(make_pair(word, 1)); else mp[word]++; } fs.close(); // Traverse map and print all words whose count //is 1 for (map<string, int> :: iterator p = mp.begin(); p != mp.end(); p++) { if (p->second == 1)

if (!mp.count(word)) mp.insert(make_pair(word, 1)); else mp[word]++; } fs.close(); // Traverse map and print all words whose count //is 1 for (map<string, int> :: iterator p = mp.begin(); p != mp.end(); p++) { if (p->second == 1) cout << p->first << endl;

if (!mp.count(word)) mp.insert(make_pair(word, 1)); else mp[word]++; } fs.close(); // Traverse map and print all words whose count //is 1 for (map<string, int> :: iterator p = mp.begin(); p != mp.end(); p++) { if (p->second == 1) cout << p->first << endl; }

if (!mp.count(word)) mp.insert(make_pair(word, 1)); else mp[word]++; } fs.close(); // Traverse map and print all words whose count //is 1 for (map<string, int> :: iterator p = mp.begin(); p != mp.end(); p++) { if (p->second == 1) cout << p->first << endl; } }

5 0

3 years ago