Answer:
Stack.
Explanation:
Topological sort requires a bit of addition to DFS algorithm.So DFS can be done by two ways that are either you can use recursion or you can use Stack data structure to implement DFS.
Since recursion uses stack memory when it makes recursive calls and if you want to do it iteratively you can stack data structure.
Answer:
Explanation:
#include <iostream>
using namespace std;
int main ()
{
int responses[30],count[6];
int score = 0;
string resp = " ";
for (int i = 0; i < 30; i++)
{
responses[i] = 0;
}
for (int i = 0; i < 6; i++)
{
count[i,1]=0;
count[i,2]=0;
count[i,0]=0;
}
while ((resp != "Y") && (resp != "y"))
{
for (int i = 0; i < 30; i++)
{
while ((score > 5) || (score < 1))
{
cout << "Student " << (i+1)<< " please enter a value (1-5):";
cin >> score;
}
responses[i] = score;
if((score > 5)||(score<1))
{
if(score==1) count[1]++;
if(score==2) count[2]++;
if(score==3) count[3]++;
if(score==4) count[4]++;
if(score==5) count[5]++;
}
score = 0;
}
cout<< "Response Frequency Percentage"<<endl;;
cout<< " 1 "<<count[1]<<" "<<(count[1]/30)<<"%"<<endl;
cout<< " 2 "<<count[2]<<" "<<(count[2]/30)<<"%"<<endl;
cout<< " 3 "<<count[3]<<" "<<(count[3]/30)<<"%"<<endl;
cout<< " 4 "<<count[4]<<" "<<(count[4]/30)<<"%"<<endl;
cout<< " 5 "<<count[5]<<" "<<(count[5]/30)<<"%"<<endl;
cout<< "Do you want to exit? Press Y to exit any other key to continue: ";
cin>> resp;
}
return 0;
}
Uni code is short for universal code , it was created so that all countries could communicate together without the need for special encoding for each country
Answer:
Nas ja kaki yawe diy. Kitu mu chuk k a jana a.
Explanation:
Karu explain pudi diya chal puter chuti kar.
