Search:

Type: Posts; User: kalium

Search: Search took 0.00 seconds.

  1. Replies
    3
    Views
    2,135

    Exactly, and Im getting null, hence no success :(...

    Exactly, and Im getting null, hence no success :(

    Yes the path does exist, and I've tried it with other chroot directories and subsequent commands, and to no avail.

    perror looks like it is...
  2. Replies
    3
    Views
    2,135

    Problems with chroot()

    Im having problems on my ubuntu system writing a small program which start a chroot'ed apache server. The following is my code



    int main() {

    pid_t apache_pid;

    if ((apache_pid = fork())...
  3. Thread: Nonblocking I/O

    by kalium
    Replies
    4
    Views
    2,734

    As far as basic I/O theory goes a blocking...

    As far as basic I/O theory goes a blocking operation will return (either with some data or after some data has been received and handled) only once the event has occured (i.e write,read,etc). So if...
  4. Replies
    2
    Views
    1,754

    Some of the more experienced guys here may give...

    Some of the more experienced guys here may give you a better answer, but I'll give it a shot in the meantime.

    Whenever you do a fork() function the OS will create a new process. In doing this it...
  5. Replies
    2
    Views
    1,300

    change the scanf( "d", &response ); to ...

    change the


    scanf( "d", &response );
    to

    scanf( "%d", &response );
  6. Replies
    16
    Views
    3,962

    You're right. It doesnt show the benefits of...

    You're right. It doesnt show the benefits of recursion. I wasnt thinking of compile overhead or anything like that. When I see a recursive function (i.e factorial etc) then I guess its natural for me...
  7. Replies
    16
    Views
    3,962

    If you were to do it recursively, how would you...

    If you were to do it recursively, how would you have done it ?
  8. Replies
    16
    Views
    3,962

    Do it recursively int factorial(int n) {...

    Do it recursively



    int factorial(int n)
    {
    if (n ==0)
    return 1;
    return n * factorial(n-1)
    }
  9. Replies
    4
    Views
    8,652

    Try changing this void selectionSort(int...

    Try changing this

    void selectionSort(int list[], int last);
    to

    void selectionSort(int list, int last);

    Or change the actual paramater, whichever it was you were meaning to do.

    I'm...
  10. Replies
    16
    Views
    3,962

    Hang on. Are you trying to find out how many...

    Hang on. Are you trying to find out how many permutations there are, or what they are ?

    Ray
  11. Replies
    7
    Views
    8,985

    I wont give you code, but I will give you an...

    I wont give you code, but I will give you an idea.
    Create two files (there will be your "classes"), a linkedList file and a node file.

    Create a struct in the linkedList (header) file which...
  12. Replies
    2
    Views
    887

    Programing a bootdisk

    Hi,

    I'm just wondering if someone could help me understand how to make a bootdisk? And no, I dont mean going into a windows "make boot disk.." utility, I mean actually having nothing more thena a...
Results 1 to 12 of 12