You are here:
I can answer questions about C / C++ programming, software design, algorithms, and interprocess communication. I have access to Microsoft Visual Studio and gcc as my development platforms. I regret that I cannot answer questions about Turbo C/C++ graphics.
I have been developing software professionally in C and C++ for UNIX and Microsoft Windows since 1991.
I have a Bachelor of Applied Science in Computer Engineering from the University of Waterloo located in Waterloo, Ontario, Canada. I hold the IEEE Certified Software Development Professional designation and SUN Java Programmer and Java Developer credentials.
| User | Date | K | C | T | P | Comments |
|---|---|---|---|---|---|---|
| Canno | 11/23/09 | 10 | 10 | 10 | 10 | |
| Canno | 11/23/09 | 10 | 10 | 10 | 10 | Done relly great...... Thank for helping me ..... |
| christopher | 11/18/09 | 10 | 10 | 10 | 10 | |
| Ajay | 11/15/09 | 10 | 10 | 10 | 10 | thank you sir. |
| Marcus | 11/06/09 | 10 | 10 | 10 | 10 | thanks alot for the help. Im new ..... |
Hello Canno Here are the changes you need to make: 1) change stackNode to have: char* data; as the data type. 2) change push to accept char* instead of int 3) change pop to return char*
Hello Canno There are 2 ways that I can read your problem. 1) You want to read one string into the stack so that each stackNode has one character. or 2) you want each stackNode to contain a string
Edit: Sorry, there was an error in the code I sent you. The corrected is below. Hello Christopher. No, you are not annoying me. If you intend to return a value from compareAnswers, you must delcare
Well OK You can have a loop in the main to enter the answers like this: cout<<"Please enter the students answers"<<endl; for(int i = 0; i < 20; ++i) cin >> studentAnswers[i]; You can also make
Hello Christopher. If I understand correctly, you have 2 arrays. One array has the student's answers, and the other array has the correct answers and you have to go through the arrays and compare each
Answers by Expert:

©2009 About.com, a part of The New York Times Company. All rights reserved.