pocku

I've just started started socket programming so there's a few things I'm wondering about: I found a set of socket programming codes here: [URL="http://cs.baylor.edu/~donahoo/practical/CSockets/textcode.html"]http://cs.baylor.edu/~donahoo/practical/CSockets/textcode.html[/URL] And the thing I don't really get is here in TCPEchoClient.c: [CODE]while (totalBytesRcvd < echoStringLen) { /* Receive up to the buffer size (minus 1 to …

I want to use the string class in my program but I keep getting the following errors: process.cpp:10: error: 'string' has not been declared process.cpp:10: error: prototype for 'Process:: Process(int, int, int)' does not match any in class 'Process' process.h:14: error: candidates are: Process:: Process(const Process&) process.h:16: error: Process:: Process(int, …

The codes our instructor provided for us has been giving me a "no such file" error message for the line #include <mutex.h> in the following code: [CODE]/* * mutex.cpp * scheduling * */ #include <mutex.h> Mutex::Mutex() { } Mutex::~Mutex() { } int Mutex::Lock() { } int Mutex::Unlock() { }[/CODE] The …

I'm working on a quick sort algorithm using recursion but it's throwing a stackOverflowError. Here is the code: [CODE] public static void quicksort(int [] A){ quickSortRec(A, 0, A.length-1); } public static void quickSortRec(int [] A, int p, int r){ if (p < r){ int q = Partition(A, p, r); quickSortRec(A, …

I am trying to create a heap sort method using recursion but whenever one of my methods called maxHeapify is called, it would throw a StackOverflowError. I understand that this error will pop up whenever my application recurses too deeply but the problem is I don't see anything wrong with …

I'm having trouble with drawing squares on the x86 assembler using the XGA 8-bit linear frame buffer. I'm suppose to draw a large square containing a grid of smaller 12x12 squares using my own functions and this is what I have so far: [CODE][SECTION .text] ;---------------------------------------------------------------------------- ; code belongs in …

I need help with finding a function T(n) that describes the upper bound for the worst case running time of this algorithm: [CODE] 1. maxS = 0 2. n = A.length 3. for j from 0 to n − 1 do 4. for i from 0 to j do 5. …

Hello. I'm utterly stuck on this one part of my school assignment (for pascal). We are asked to make a calculator like program which calculates integer values only. The program has to read character by character from an input file and if something like an 'a' or # is entered, …