Answer:
The algorithm is as follows:
1. Input sentence
2. Input character
3. Length = len(sentence)
4. count = 0
5. For i = 0 to Length-1
5.1 If sentence[i] == character
5.1.1 count++
6. Print count
7. Stop
The program in C++ is as follows:
#include <iostream>
#include <string.h>
using namespace std;
int main(){
char str[100]; char chr;
cin.getline(str, 100);
cin>>chr;
int count = 0;
for (int i=0;i<strlen(str);i++){
if (str[i] == chr){
count++;} }
cout << count;
return 0;}
Explanation:
I will provide explanation for the c++ program. The explanation can also be extended to the algorithm
This declares the string and the character
char str[100]; char chr;
This gets input for the string variable
cin.getline(str, 100);
This gets input for the character variable
cin>>chr;
This initializes count to 0
int count = 0;
This iterates through the characters of the string
for (int i=0;i<strlen(str);i++){
If the current character equals the search character, count is incremented by 1
if (str[i] == chr){ count++;} }
This prints the count
cout << count;
The first one seems the most relivant
Answer:
c. notes view
Explanation:
Assuming you're talking about a slideshow program, like Microsoft PowerPoint, the notes view lets you see the speaker notes.
The normal view is the one used normally to present the regular slideshow content, it's formatted for a screen view.
The handout view is same as normal view, but formatted for print.
The slide sorter view is a general overview of your presentation allowing you to move your pages around.
Answer:
im trying to find the answer my self :(
Explanation:
.
Answer:
The kind of software to use is a protocol analyser.
Explanation:
The Protocol analyser, which could either be a hardware or a software is a tool that is used for capturing and analysing signals and also interpreting network traffic over a communication channel or between two or more connected computer systems
Protocol analysers can be used to find out location of problems on Local Area Network by examining flow of traffic.
