.:Pudge:.

I have been trying to support certain built in commands such as 'cd' and 'help'. If I do 'ls' or 'mkdir' it executes them fine and they do what they are supposed to. If I type the command 'help' I get a segmentation fault and if I type 'cd' it …

My professor taught us the bare basics and gives us questions on our homework that we essentially have to teach ourselves have to do. Any help would be appreciated! (use this for MIPS reference : [url]http://www.mrc.uidaho.edu/mrc/people...al/MIPSir.html[/url]) Here goes: 1. Write the binary representation of the smallest integer number that can …

The code runs fine if the first input integer is the largest, but if the second or third are larger it crashes or stops. I used the error message to determine that the code jr $ra stops the program. If I run another program I made that has that same …

What is the greatest possible range of rand()? I want to make it that of a long signed integer, but my program crashes. Is there another way to get that range?

I am having trouble printing the contents of a b-tree of order 'n' in level order. I have looked at algorithms online, but they only cover trees that have nodes with only 2 children. Shouldn't it also be called recursively? No algorithm I found used recursion. [CODE]void addToQue(struct node *root) …

I need to print a B-Tree of order 'n' so that the output is in FIFO order. I have no idea how to do this? Could anyone give me some pseudo-code?

Alright so I have to create a B-tree of order 'n', where the user puts in a desired 'n'. I borrowed and modified code of a B-tree of order 5, but I can't get it to work and it crashes. I also need it to display the contents of the …

My code works fine for smaller integers, but when it gets over 1 million or so the number changes or goes negative. I am sure this has to do with the range of int, but I tried float and double and all the numbers came out the same...... What is …

I get the error " no match for 'operator=' in '* n->node::child = root' in the "insert" method and I don't know how to fix it. I know it has something to do with pointers and the way I initialized the array. What I want to do is is put …

How do I create an int variable to store user input? I tried the code below, but when I put in a number it comes out with some random 6 digit number. My assignment is: Write a complete, commented, stand-alone MIPS program to include the same function as this C …

How do I change the following code to be from a sum of squares to 100 to a sum of cubes? If you can help will you please point out the line(s)? Thanks. [CODE]# FILE = figA4.s # From jws@cs.uga.edu Tue Oct 7 08:46 EDT 2003 .text .align 2 .globl …

I need to change this code from a sum of squares to 100 to a sum of cubes. What code do i need to add or change and what lines? Thanks [CODE]# FILE = figA4.s # From jws@cs.uga.edu Tue Oct 7 08:46 EDT 2003 .text .align 2 .globl main main: …

I am required to generate "n" random numbers of which each random number ranges from -10,000,000 to 10,000,000. I tried using rand() and changing the range, but it only has a max range of 32,000 or so. What is a good function or algorithm that I could use to achieve …

I am trying to read the contents from the specified file into a char array and then send that to the client. The problem i get is that getline() wont take a char array as a parameter and strcat() wont take a string as a parameter so I dont know …

I have created a server and I can get it to send a simple message, but it needs to read the content out from the file (if it exists) and send the content back to the browser through socket. The reply needs to come with a HTTP header. Any help …

I don't know how to properly override this function when it comes to an Iterator for a linked list. [CODE] ListIterator operator++(){ currentPtr->prev=currentPtr; currentPtr=currentPtr->next; currentPtr->next=currentPtr->next->next; return *this; } // advance iterator to the next list node; return value is iterator *after* advancing ListIterator operator--(){ currentPtr->next=currentPtr; currentPtr=currentPtr->prev; currentPtr->prev=currentPtr->prev->prev; return *this; } …

*EDIT* IT IS A SEGMENTATION FAULT NOT BUS ERROR (anyway to change thread title?) I am trying to make a deep copy of a linked list, but whenever I run a test of the constructor i get a "Segmentation Fault". I tested the "Append" method and it works fine. I …

I tried looking at the other examples on the site, but I still get segmentation errors whenever I run the file. I need help with the constructors in [B]bold[/B] in the "List" class. [CODE]#include <iostream> using std::cout; using std::endl; // forward declaration of List class, so ListElement can make // …