Answer:A,B,E
Explanation:
Because I just took the quiz
Answer:
I think the last 1 or the 2nd one
Explanation:sorry if im wrong TwT
Answer:
By given the right speech as much as the answers must be
Explanation:
By given the right speech as much as the answers must be
Answer:
The answer to this question is given below in the explanation section.
Explanation:
My laptop's current screen resolution is (1366 by 768 recommended). When you change your screen resolution, your pc automatically suggests the recommended screen resolution that helps you to view more information on your screen and enable you to fit the most information on the screen while still being able to read the display.
To change the screen resolution, you need to go through from the following steps:
B) ring
C) bus
D) all of the above
Answer:
ring
Explanation:
Answer:
See explaination
Explanation:
#include <iostream>
#include <fstream>
#include <string>
#include <vector>
#include <map>
#include <sstream>
using namespace std;
// structure to hold the word, frequency and list of lines in which word appears
struct wordFrequency
{
string word;
int frequency;
vector<int> lineNumber;
};
// main method
int main()
{
// input file name. You can change the input file name if your file name is different
string inputFileName = "data.txt";
// creating a map class object to hold words uniquely
map<string, wordFrequency> map_word;
// ifstream class object to open and read from file
ifstream fin(inputFileName);
// validating if file is opened or not
if (!fin.is_open())
{
cout << "Error in opening file!";
exit(1);
}
// string to hold line from file
string line;
// int variable to keep track of line number
int lineNumber = 0;
// fetching lines from file
while (getline(fin, line))
{
// increasing the lineNumber count because we fetch another line
++lineNumber;
// breaking a line into words using stringstream class object
string word;
stringstream iss(line);
// iterating over all the words in a line
while (iss >> word)
{
// if the word is not in the map then we create and add a new pair
auto it = map_word.find(word);
if (it == map_word.end())
{
// creating a new struct object to store new word
wordFrequency w;
w.word = word;
w.frequency = 1;
w.lineNumber.push_back(lineNumber);
map_word.insert({word, w});
}
else
{
// if the word is already there then incresing frequency and push line number into list
it->second.frequency += 1;
it->second.lineNumber.push_back(lineNumber);
}
}
}
// closing the input file
fin.close();
// creating a new output file
ofstream fout("WordFrequency.txt");
if (fout.is_open())
{
// iterating over a map
for (auto word : map_word)
{
// writing data to a output file
fout << "Word is : " << word.second.word << endl;
fout << "Frequency is : " << word.second.frequency << endl;
fout << "Appears in line : ";
for (auto i : word.second.lineNumber)
{
fout << i << " ";
}
fout << endl
<< endl;
}
// closing output file
fout.close();
}
else
{
cout << "Error! Not able to create output file!";
}
}
[8:53 PM]
2) Create a button with label “true” , clicking on the button toggle the value from “true” => “false” and “false” => “true”.(edited)
techsith (patel) — 03/03/2021
3) Create a counter and a button. clicking on the button increments the counter by one. double clicking on the button resets the counter to 0
Answer:too many words ahhh
Explanation:
(assuming jsx)
function Buttons (props) {
return(
{props.counterValue}
counter
increment
reset
);
}
var counterValue = 1;
function addup(a){
if(counterValue + a <= 20){
counterValue += a;
} else if (counterValue + a > 20){
//do nothing
}
ReactDOM.render(
,
document.getElementById('root')
);
}
function reset() {
counterValue = 1;
ReactDOM.render(
,
document.getElementById('root')
);
}
Answer:
The clarity factor suggest that if there is lack of clarity communication can do a great deal of damage. The Clarity Factor is a perfect example of a well chosen words and well written sentences can get the most complicated in the message across the number of people in the least amount of the time.
The factors that are vital to achieve clarity in the messages are: