No one has voted on any posts yet. Votes from other community members are used to determine a member's reputation amongst their peers.
9 Posted Topics
 | [code] #include<iostream> #include<fstream> #include"d_nodel.h" using namespace std; int main() { dnode<double> *listA = new dnode<double>; dnode<double> *listB = new dnode<double>; double sz1, sz2; int val1; //first set of integers int val2; //second set of integers ifstream inFile; //declares the inFile ofstream outFile; //declares the outFile //Read in a file to …  |
| | first of all what kind of project you building? class or cpp file, please explain briefly! |
| | [code]#include<iostream> #include<fstream> #include"d_nodel.h" using namespace std; void merge(dnode<double> *, dnode<double> *); //free function to merge the two lists int main() { dnode<double> *listA = new dnode<double>; dnode<double> *listB = new dnode<double>; double sz1, sz2; int val1; //first set of integers int val2; //second set of integers ifstream inFile; //declares the … |
| | instead of installing from a book or cd, whatever you are using just go to google and download straight from there for free. also the link will provide which file is best for visual studios. sort of similar to what i did. if this doesn't help, just email me directly … |
| | [code] //have it set to int where it is just integers (whole numbers) int sum=0, a=0, b=0; //shows that your sum of both values, first //value (a), second value (b) is set to zero. //you are using a for loop for (a=1;a<3;a++) //with this for loop, you have you first … |
| | [code]#include<iostream> #include<fstream> using namespace std; int main() { dnode<double> *listA = new dnode<double>; dnode<double> *listB = new dnode<double>; int val1; //first set of integers int val2; //second set of integers ifstream inFile; //declares the inFile //Read in a file to build the two lists inFile.open("lnkList.in"); //Open the input file //statement …  |
| | [code] /* Is it possible that someone could give me a pseudo code for what I am suppose to do, step by step. The professor gave us 3 codes and also a infile in which I saved it as InkList.txt. She wants us to create a program as she stated …  |
| | Given the following grammar. S --> S[S] | A (empty list) 1. construct a leftmost deriviation 2. rightmost deriviation 3. parse tree The problem: [ [ ] [ [ ] ] ] |
| | I was wondering anyone knew how to figure these problems out. To, me it is hard and I really need this done by Sunday morning. If possible please reply, thanks! 1. Construct a recursive definition , where all variables are natural numbers. f(n, k) = k + (k + 1) …  |
The End.