Forum: Java Oct 16th, 2009 |
| Replies: 3 Views: 210 To start with your test data has one to many columns in it.
Now to start thinking about how to code this what do you know about arrays? What data in this assignment can be easily stored in an... |
Forum: Java Sep 26th, 2009 |
| Replies: 12 Views: 795 Just to start I notice that in your for loops you are incrementing the numberOfRolls variable. Basically you are making it so that the for loops go on forever because counterTrials can never catch... |
Forum: C++ Jun 25th, 2009 |
| Replies: 8 Views: 349 I would try using the compare function of the string class. I believe that your test pass == my is testing that your string objects are the same objects rather than whether their contents are the... |
Forum: Shell Scripting Jun 20th, 2009 |
| Replies: 4 Views: 569 Try these links to start.
http://www.tizag.com/htmlT/forms.php
http://hoohoo.ncsa.illinois.edu/cgi/primer.html
You start your application by placing it's path in the action attribute of the... |
Forum: Java Jun 18th, 2009 |
| Replies: 17 Views: 871 In your inverse function you are testing for t != null even after you pop the last element from stack t it will still be a stack and therefore won't be equal to null. You want to use the boolean... |
Forum: Java Jun 14th, 2009 |
| Replies: 17 Views: 871 For outputting the elements of a Stack you aren't going to use a method you are going to use iterators to go through the stack element by element. Do a search online to get some info about iterators.... |
Forum: Java Jun 14th, 2009 |
| Replies: 17 Views: 871 My suggestion is to google Java API. http://java.sun.com/j2se/1.5.0/docs/api/
Look up Stack. It will list all the methods available. It will also show you other methods inherited from other classes.... |
Forum: C++ Jun 13th, 2009 |
| Replies: 5 Views: 282 The first real problem I see is that your function takes in a node pointer you call root however if this node is empty or it's data is set to zero you are returning the first child of a node pointed... |
Forum: Java Jun 12th, 2009 |
| Replies: 7 Views: 2,409 Just a thought. Since you are trying to write an app for a bank. What about something like a mortgage calculator app. Take a little time to get used to swing and get some information from the bank or... |
Forum: C Jun 3rd, 2009 |
| Replies: 10 Views: 1,290 void delete(node_t *list, int num){
node_t *deletep, *temp;
list = head;
if (list->fp == NULL){
head = NULL;
return;}
else if (list->element == num){
... |
Forum: C Jun 3rd, 2009 |
| Replies: 10 Views: 1,290 http://img190.imageshack.us/img190/7742/dllnode.jpg (http://img190.imageshack.us/my.php?image=dllnode.jpg)
Maybe my picture was a little unclear. The outer squares represent the node the two smaller... |
Forum: C Jun 3rd, 2009 |
| Replies: 10 Views: 1,290 I am going to walk my way through your code for void insert_front(node_t *list, int insert, int node) and just list some issues I see and hopefully that will help you to correct any problems you are... |
Forum: C Jun 1st, 2009 |
| Replies: 8 Views: 379 A couple of things I notice right off is that you haven't checked for the negative input termination and when you are adding elements to your linked list you are adding them to the head when the... |