## Audio Frequency Amplitudes

0 likes • Aug 27, 2021
C++

## More C++ Posts

/*Algorithm:Step 1: Get radius of the cylinder from the user and store in variable rStep 2: Get height of the cylinder from the user and store in variable hStep 3: Multiply radius * radius * height * pi and store in vStep 4: Display the volume*/
#include <iostream>using namespace std;

int main(){        float r; //define variable for radius        float h; //define variable for height        float v;        float pi;        pi=3.1416;
cout<<"Enter height:";        cin>>h;
v=r*r*h*pi;  //compute volume
cout<<"\n************************\n";
cout<<"Volume:"<<v<<endl;//display volume
return 0;}
#include <iostream>using namespace std;
int main() {

int dataEntry;    int arr;
for(int i = 0; i < 5; i++) {        cout << "Enter a number that you want to put into the array: ";        cin >> dataEntry;        arr[i] = dataEntry;    }
cout << endl;
for(int i = 0; i < 5; i++) {        cout << "Outputting array info at position " << i + 1 << ": " << arr[i] << endl;    }
for(int i=0;i<5;i++)	{				for(int j=i+1;j<5;j++)		{			if(arr[i]>arr[j])			{				int temp=arr[i];				arr[i]=arr[j];				arr[j]=temp;			}		}	}
cout << endl;
for(int i = 0; i < 5; i++) {        cout << "Outputting sorted array info at position " << i + 1 << ": " << arr[i] << endl;    }
return 0;}
#include <bits/stdc++.h>#define MAXSIZE 50000#define INF 100000
using namespace std;
bool visited[MAXSIZE]; //Checks if a node is visited or not in BFS and DFSbool isConnected = true; //Checks if the input graph is connected or not
int dist[MAXSIZE], discover[MAXSIZE], finish[MAXSIZE]; //Distance for BFS, in time and out time for DFSint t = 1; //Time used for DFSint u, v, i, j, k, N = 0;
stack<int> st; //Stack for TopSort
multiset<pair<int, int>> s; //collection of pairs to sort by distancepair<int, int> current; //pointer variable to a position in the multiset
void BFS(){	queue<int> q; //queue for BFS	q.push(1); //pushing the source	dist = 0; //assign the distance of source as 0	visited = 1; //marking as visited		while(!q.empty())	{	u = q.front();	q.pop();
if(!visited[v]) //if not visited, update the distance and push onto queue	{	visited[v] = 1;	dist[v] = dist[u]+1;	q.push(v);	}
}
}		for(i = 1; i <= N; i++)	{	s.insert(make_pair(dist[i], i)); //for sorted distance	}		cout << "BFS results:" << endl;		//prints BFS results and checks if the graph is connected	while(!s.empty())	{	current = *s.begin(); 	s.erase(s.begin());
i = current.second; 	j = current.first;
if(j == INF) //if any infinite value, graph is not connected	{	cout << i << " INF" << endl;	isConnected = false;	}	else	{	cout << i << " " << j << endl;	}
}
//marks blocks of memory as visited	memset(visited, 0, sizeof visited);}

void dfsSearch(int s){	visited[s] = 1; //marking it visited	discover[s] = t++; //assigning and incrementing time
int i, v;
if(!visited[v]) //if vertex is not visited then visit, else continue	{	dfsSearch(v);	}
}
st.push(s); //pushed onto stack for TopSort if it was called	finish[s] = t++; //out time}
void DFS(){
for(i = 1; i <= N; i++)	{	if(visited[i]) //if visited continue, else visit it with DFS	{	continue;	}
dfsSearch(i); //embedded function to actually perform DFS	}
for(i=1;i<=N;i++)	{	s.insert(make_pair(discover[i], i)); //minheap for sorted discovery time	}		cout << "DFS results:" << endl;
while(!s.empty()) //Prints DFS results as long as the multiset is not empty	{	current = *s.begin(); //duplicates the pointer to first object in the multiset	s.erase(s.begin()); //erases the first object in multiset
i = current.second;	cout << i << " " << discover[i] << " " << finish[i] << endl; //prints discover times and finish times	}
}
void TopSort(){	//call DFS so we can have a sorted stack to print	for(i=1;i<=N;i++)	{	if(visited[i])	{	continue;	}
dfsSearch(i);	}
cout<<"Topological Sort results:"<<endl;
//print sorted results from DFS	while(!st.empty())	{	i = st.top(); 	st.pop();
cout << i << endl;	}
//declare blocks of memory as visited	memset(visited, 0, sizeof visited);
}

int main(){	string str, num, input;	int selection, connectedChoice = 0;

//get to input any file, more freedom than declaring file in command line	cout << "Enter the exact name of your input file [case sensitive]: ";	cin >> input;		ifstream inputFile(input); //Read the input file
//checks if the ifstream cannot open	if(inputFile.fail())	{	cout << endl << "No input files matching that name. Terminating..." << endl;	return 0;	}
//Read until the end of file	while(!inputFile.eof())	{	getline(inputFile, str); //read the current line
if(str == "")	{	continue;	}
if(!isdigit(str)) //checks to see if the first item in a line is a digit or not	{	cout << "Invalid file format. You have a line beginning with a non-digit. Terminating..." << endl;	return 0;	}
stringstream ss;	ss << str; //convert the line to stream of strings		ss >> num; //read the line num	stringstream(num) >> u;		while(!ss.eof())	{	ss>>num;	if(stringstream(num) >> v)	{	adj[u].push_back(v); //read the adjacent vertices	}	}
N++; //calculate the number of vertices	sort(adj[u].begin(), adj[u].end()); //sort the adjacency list in case it is not sorted	}		//creates arbitrary values for distance, will check later if INF remain	for(i = 1; i <= N; i++)	{	dist[i] = INF;	}
cout << endl << "Valid Input file loaded!" << endl;
while(selection != 4)	{	cout << "************************************************" << endl;	cout << "What type of analysis would you like to perform?" << endl;	cout << "1: Breadth-First Search" << endl;	cout << "2: Depth-First Search" << endl;	cout << "3: Topological Sort" << endl;	cout << "4: Quit" << endl;	cout << "************************************************" << endl;		//read user input and execute selection	cin >> selection;
switch(selection)	{	case 1:	cout << endl;	BFS();	cout << endl;	cout << "Would you like to know if the graph is connected?" << endl;	cout << "1: Yes" << endl;	cout << "Any other key: No" << endl;	cin >> connectedChoice;
switch(connectedChoice)	{	case 1:	if(!isConnected)	{	cout << "The graph is not connected." << endl << endl;	}	else	{	cout << "The graph is connected!" << endl << endl;	}	break;	default:	break;	}	break;	case 2:	cout << endl;	DFS();	cout << endl;	break;	case 3:	cout << endl;	TopSort();	cout << endl;	break;	case 4:	return 0;	default:	cout << endl << "Invalid selection." << endl; //loops the selection prompt until a valid selection is input.	}
}	}
#include "goat.h" //include goat.h
void Goat::setBreed(string breed) {   this->breed = breed;}void Goat::setWeight(float weight) {   this->weight = weight;}void Goat::setName(string name) {   this->name = name;}void Goat::setGender(char gender) {   this->gender = gender;}void Goat::setSpayed(bool goatIsSpayed) {   this->goatIsSpayed = goatIsSpayed;}void Goat::setRegistrationID(string registrationID) {   this->registrationID = registrationID;}void Goat::setColor(string color) {   this->color = color;}void Goat::setOtherComments(string otherComments) {   this->otherComments = otherComments;}string Goat::getBreed() {   return breed;}float Goat::getWeight() {   return weight;}string Goat::getName() {   return name;}char Goat::getGender() {   return gender;}bool Goat::getSpayed() {   return goatIsSpayed;}string Goat::getRegistrationID() {   return registrationID;}string Goat::getColor() {   return color;}string Goat::getOtherComments() {   return otherComments;}
Goat::Goat() {   breed = "";   weight = 0.0;   name = "";   gender = '\0';   goatIsSpayed = false;   registrationID = "";   color = "";   otherComments = "";}
Goat::Goat(string goatBreed, float goatWeight, string goatName, char goatGender, bool goatSpayedStatus, string goatRegistrationID, string goatColor, string goatOtherComments) {     breed = goatBreed;   weight = goatWeight;   name = goatName;   gender = goatGender;   goatIsSpayed = goatSpayedStatus;   registrationID = goatRegistrationID;   color = goatColor;   otherComments = goatOtherComments;}
Goat::~Goat() {   cout << "goat destroyed" << endl;}
void Goat::printinfo() {     cout << "Breed: " << breed << endl << "weight: " << weight << endl << "Name: " << name << endl << "Gender: " << gender << endl << "is Spayed: ";   if(goatIsSpayed) {  //here I do a logical test on boolean goatIsSpayed. if true cout << true else cout << false      cout << "True";   } else {      cout << "False";   }   cout << endl << "Registration ID: " << registrationID << endl << "Color Description: " << color << endl << "Other Comments: " << otherComments << endl << endl;}
#include<iostream>using namespace std;
const int rows = 8;const int cols = 8;char chessboard[rows][cols];
void setBoard(char chessboard[][cols]);void printBoard(char chessboard[][cols]);
void setBoard(char chessboard[][cols]) {    for(int i = 0; i < rows; i++) {        for(int j = 0; j < cols; j++) {            if(i % 2 == 0 && j % 2 == 0) {                chessboard[i][j] = 'x';            } else {                if(i % 2 != 0 && j % 2 == 1) {                    chessboard[i][j] = 'x';                } else {                    chessboard[i][j] = '-';                }            }        }    }    return;}
void printBoard(char chessboard[][cols]) {    for(int i = 0; i < rows; i++) {        for(int j = 0; j < cols; j++) {            cout << chessboard[i][j] << " ";        }        cout << endl;    }    return;}
int main(int argc, char const *argv[]){    setBoard(chessboard);    printBoard(chessboard);    return 0;}
using namespace std;   class Hash {     int BUCKET;    // No. of buckets       // Pointer to an array containing buckets     list<int> *table; public:     Hash(int V);  // Constructor       // inserts a key into hash table     void insertItem(int x);       // deletes a key from hash table     void deleteItem(int key);       // hash function to map values to key     int hashFunction(int x) {         return (x % BUCKET);     }       void displayHash(); };   Hash::Hash(int b) {     this->BUCKET = b;     table = new list<int>[BUCKET]; }   void Hash::insertItem(int key) {     int index = hashFunction(key);     table[index].push_back(key);  }   void Hash::deleteItem(int key) {   // get the hash index of key   int index = hashFunction(key);     // find the key in (inex)th list   list <int> :: iterator i;   for (i = table[index].begin();            i != table[index].end(); i++) {     if (*i == key)       break;   }     // if key is found in hash table, remove it   if (i != table[index].end())     table[index].erase(i); }   // function to display hash table void Hash::displayHash() {   for (int i = 0; i < BUCKET; i++) {     cout << i;     for (auto x : table[i])       cout << " --> " << x;     cout << endl;   } }   // Driver program  int main() {   // array that contains keys to be mapped   int a[] = {15, 11, 27, 8, 12};   int n = sizeof(a)/sizeof(a);     // insert the keys into the hash table   Hash h(7);   // 7 is count of buckets in                // hash table   for (int i = 0; i < n; i++)      h.insertItem(a[i]);       // delete 12 from hash table   h.deleteItem(12);     // display the Hash table   h.displayHash();     return 0; }