[OT]How to get my homework done

Discussion in 'C Programming' started by Keyser Soze, Dec 7, 2005.

  1. Keyser Soze

    Keyser Soze Guest

    Hi, I am a lazy cheat that does not want to know how to write C programs.

    I need the members of this newsgroup to complete all my homework assignments
    for me.

    My teacher really does not care where I get the answers or even if I
    understand them.

    So, please can you experts just do the work for me and not whine about how
    lazy and dishonest I am.

    Thank you.
     
    Keyser Soze, Dec 7, 2005
    #1
    1. Advertising

  2. Keyser Soze

    Guest

    Re: How to get my homework done

    Keyser Soze wrote:
    > Hi, I am a lazy cheat that does not want to know how to write C programs.
    >
    > I need the members of this newsgroup to complete all my homework assignments
    > for me.
    >
    > My teacher really does not care where I get the answers or even if I
    > understand them.
    >
    > So, please can you experts just do the work for me and not whine about how
    > lazy and dishonest I am.
    >
    > Thank you.


    Planning on running for president someday?
     
    , Dec 7, 2005
    #2
    1. Advertising

  3. Keyser Soze

    Guest

    If you've got the money, I've got the answers.

    Keyser Soze wrote:
    > Hi, I am a lazy cheat that does not want to know how to write C programs.
    >
    > I need the members of this newsgroup to complete all my homework assignments
    > for me.
    >
    > My teacher really does not care where I get the answers or even if I
    > understand them.
    >
    > So, please can you experts just do the work for me and not whine about how
    > lazy and dishonest I am.
    >
    > Thank you.
     
    , Dec 7, 2005
    #3
  4. Keyser Soze

    Malcolm Guest

    "Keyser Soze" <> wrote
    > Hi, I am a lazy cheat that does not want to know how to write C programs.
    >
    > I need the members of this newsgroup to complete all my homework
    > assignments for me.
    >
    > My teacher really does not care where I get the answers or even if I
    > understand them.
    >
    > So, please can you experts just do the work for me and not whine about how
    > lazy and dishonest I am.
    >

    I friend of mine did that.
    His deadline was last Friday, and he came to me about a week before to write
    his program for him.
    Unfortunately, he knew so little Perl that when I set a program up for him,
    with his first name and last name concatenated as an example, he couldn't
    extend the example to concatenate two arbitrary strings.
    So there was nothing I could do. What I did was to all intents and purposes
    cheating, but had I actually written the code for him he would have been
    found out, causing a whole host of other problems in his later employment.
     
    Malcolm, Dec 7, 2005
    #4
  5. Keyser Soze

    Guest

    Malcolm wrote:
    > What I did was to all intents and purposes cheating,


    I'd call that teaching. Not that he'd understand what you're trying to
    teach him though.

    > but had I actually written the code for him he would have been
    > found out, causing a whole host of other problems in his later employment.


    If you did THAT, that would be cheating. Helping someone cheat is
    cheating.

    At least, even if he didn't learn Perl, he learned not to ask you for
    help again ;-)
     
    , Dec 7, 2005
    #5
  6. Keyser Soze

    Guest

    Malcolm wrote:
    > What I did was to all intents and purposes cheating,


    I'd call that teaching. Not that he'd understand what you're trying to
    teach him though.

    > but had I actually written the code for him he would have been
    > found out, causing a whole host of other problems in his later employment.


    If you did THAT, that would be cheating. Helping someone cheat is
    cheating.

    At least, even if he didn't learn Perl, he learned not to ask you for
    help again ;-)
     
    , Dec 7, 2005
    #6
  7. Keyser Soze

    pemo Guest

    "Malcolm" <> wrote in message
    news:dn7jl6$14m$-infra.bt.com...
    >
    > "Keyser Soze" <> wrote
    >> Hi, I am a lazy cheat that does not want to know how to write C programs.
    >>
    >> I need the members of this newsgroup to complete all my homework
    >> assignments for me.
    >>
    >> My teacher really does not care where I get the answers or even if I
    >> understand them.
    >>
    >> So, please can you experts just do the work for me and not whine about
    >> how lazy and dishonest I am.
    >>

    > I friend of mine did that.
    > His deadline was last Friday, and he came to me about a week before to
    > write his program for him.
    > Unfortunately, he knew so little Perl that when I set a program up for
    > him, with his first name and last name concatenated as an example, he
    > couldn't extend the example to concatenate two arbitrary strings.
    > So there was nothing I could do. What I did was to all intents and
    > purposes cheating, but had I actually written the code for him he would
    > have been found out, causing a whole host of other problems in his later
    > employment.


    So, it would have been interesting (!) to see him attempt a conact in C
    then!
     
    pemo, Dec 7, 2005
    #7
  8. Keyser Soze

    pete Guest

    Keyser Soze wrote:

    > So,
    > please can you experts just do the work for me and not whine about how
    > lazy and dishonest I am.


    I like to do other people's homework
    if it's interesting and not too hard.
    I'm one of the dangerous people on USENET
    that your mother warned you about.

    --
    pete
     
    pete, Dec 8, 2005
    #8
  9. Keyser Soze

    Default User Guest

    pete wrote:


    > I like to do other people's homework
    > if it's interesting and not too hard.
    > I'm one of the dangerous people on USENET
    > that your mother warned you about.


    Worst poem ever.


    Brian
     
    Default User, Dec 8, 2005
    #9
  10. Keyser Soze

    Guest

    Re: How to get my homework done

    Default User wrote:
    > pete wrote:
    >
    >
    > > I like to do other people's homework
    > > if it's interesting and not too hard.
    > > I'm one of the dangerous people on USENET
    > > that your mother warned you about.

    >
    > Worst poem ever.


    A likeable fellow called P_
    Posts homework from others for free.
    It won't be undone
    As long as it's fun,
    But that's no way to get your degree.

    >
    >
    > Brian
     
    , Dec 8, 2005
    #10
  11. Keyser Soze wrote:

    > Hi, I am a lazy cheat that does not want to know how to write C programs.
    >
    > I need the members of this newsgroup to complete all my homework assignments
    > for me.
    >
    > My teacher really does not care where I get the answers or even if I
    > understand them.
    >
    > So, please can you experts just do the work for me and not whine about how
    > lazy and dishonest I am.
    >


    Sure!!! Just post the email and phone number of your professor, and we will
    make *sure*
    that he receives all the C program homwork.
     
    Charles Richmond, Dec 8, 2005
    #11
  12. Re: How to get my homework done

    said:

    >
    > Default User wrote:
    >> pete wrote:
    >>
    >>
    >> > I like to do other people's homework
    >> > if it's interesting and not too hard.
    >> > I'm one of the dangerous people on USENET
    >> > that your mother warned you about.

    >>
    >> Worst poem ever.

    >
    > A likeable fellow called P_
    > Posts homework from others for free.
    > It won't be undone
    > As long as it's fun,
    > But that's no way to get your degree.


    Cheating novices
    Teach ancient gurus to dread
    Endless September.

    --
    Richard Heathfield
    "Usenet is a strange place" - dmr 29/7/1999
    http://www.cpax.org.uk
    email: rjh at above domain (but drop the www, obviously)
     
    Richard Heathfield, Dec 8, 2005
    #12
  13. In article <>,
    pete <> wrote:
    >Keyser Soze wrote:
    >
    >> So,
    >> please can you experts just do the work for me and not whine about how
    >> lazy and dishonest I am.

    >
    >I like to do other people's homework
    >if it's interesting and not too hard.


    I do too. This is one of my favorites:
    --------
    #include <stdio.h>
    #include <stdlib.h>

    typedef struct n{struct n*p1,*p2;int v;}n;n*r_t(n*p,n*i){n*i2,*t1,*t2;int v
    ;if(!i)return 0;while(p->p2)p=p->p2;i2=i;do{t1=malloc(sizeof*t1);t2=malloc(
    sizeof*t2);if(!t1||!t2)return 0;t1->v=t2->v=i2->v;t2->p1=t2->p2=0;t1->p1=i2
    ;t1->p2=t2;if(t1->p1->p2)t1->p1->p2->p1=t1;if(t1->p1->p1)t1->p1->p1->p1->p2
    =t1;i2=t1->p1->p2;}while(i2);i=t1;while(i->p1->p1){i2=i;v=i2->v;while(p->v!=
    v&&p->p1->v!=v){i2=i2->p1->p1;if(!i2){fputs("(1)\n",stderr);return 0;}v=i2
    ->v;}if(v==p->v){if(p->p1){p=p->p1;free(p->p2);p->p2=0;}else{fputs("(2)\n",
    stderr);return 0;}if(i2->p1->p1)i2->p1->p1->p1->p2=i2->p1->p2;if(i2->p1->p2
    )i2->p1->p2->p1->p1=i2->p1->p1;else i=i2;t1=i2->p2;t2=i2->p1->p1;free(i2->
    p1);free(i2);t2->p2->p2=t1;}else{t2=p->p1;if(t2->p1)t2->p1->p2=t2->p2;t2->p2
    ->p1=t1->p1;free(t2);i2=i2->p1->p1;if(i2->p1->p1)i2->p1->p1->p1->p2=i2->p1->
    p2;i2->p1->p2->p1->p1=i2->p1->p1;t1=i2->p2;t2=i2->p1->p2;free(i2->p1);free(
    i2);t2->p2->p1=t1;}}if(p->p1||p->p2)fputs("(3)\n",stderr);free(p);if(i->p1->
    p1||i->p1->p2)fputs("(4)\n",stderr);t1=i->p2;free(i->p1);free(i);return t1;}
    --------

    >I'm one of the dangerous people on USENET
    >that your mother warned you about.


    I'm an entirely different kind of dangerous people on USENET, the kind
    your mother never thought you'd need to be warned about.


    dave
    (I remember that there was a bug in my first version of that one. I have
    no idea whether it's been fixed in the version I have laying around.)

    --
    Dave Vandervies
    Basically, there is no control structure you can imagine that
    can't be implemented using call/cc. Even very silly ones.
    --Bear in comp.lang.scheme
     
    Dave Vandervies, Dec 8, 2005
    #13
  14. (Dave Vandervies) writes:
    > #include <stdio.h>
    > #include <stdlib.h>
    >
    > typedef struct n{struct n*p1,*p2;int v;}n;n*r_t(n*p,n*i){n*i2,*t1,*t2;int v
    > ;if(!i)return 0;while(p->p2)p=p->p2;i2=i;do{t1=malloc(sizeof*t1);t2=malloc(
    > sizeof*t2);if(!t1||!t2)return 0;t1->v=t2->v=i2->v;t2->p1=t2->p2=0;t1->p1=i2
    > ;t1->p2=t2;if(t1->p1->p2)t1->p1->p2->p1=t1;if(t1->p1->p1)t1->p1->p1->p1->p2
    > =t1;i2=t1->p1->p2;}while(i2);i=t1;while(i->p1->p1){i2=i;v=i2->v;while(p->v!=
    > v&&p->p1->v!=v){i2=i2->p1->p1;if(!i2){fputs("(1)\n",stderr);return 0;}v=i2
    > ->v;}if(v==p->v){if(p->p1){p=p->p1;free(p->p2);p->p2=0;}else{fputs("(2)\n",
    > stderr);return 0;}if(i2->p1->p1)i2->p1->p1->p1->p2=i2->p1->p2;if(i2->p1->p2
    > )i2->p1->p2->p1->p1=i2->p1->p1;else i=i2;t1=i2->p2;t2=i2->p1->p1;free(i2->
    > p1);free(i2);t2->p2->p2=t1;}else{t2=p->p1;if(t2->p1)t2->p1->p2=t2->p2;t2->p2
    > ->p1=t1->p1;free(t2);i2=i2->p1->p1;if(i2->p1->p1)i2->p1->p1->p1->p2=i2->p1->
    > p2;i2->p1->p2->p1->p1=i2->p1->p1;t1=i2->p2;t2=i2->p1->p2;free(i2->p1);free(
    > i2);t2->p2->p1=t1;}}if(p->p1||p->p2)fputs("(3)\n",stderr);free(p);if(i->p1->
    > p1||i->p1->p2)fputs("(4)\n",stderr);t1=i->p2;free(i->p1);free(i);return t1;}


    But what if p is NULL?

    DES
    --
    Dag-Erling Smørgrav -
     
    =?iso-8859-1?q?Dag-Erling_Sm=F8rgrav?=, Dec 8, 2005
    #14
  15. Keyser Soze

    Suman Guest

    Dave Vandervies wrote:
    [...]
    > This is one of my favorites:
    > --------
    > #include <stdio.h>
    > #include <stdlib.h>
    >
    > typedef struct n{struct n*p1,*p2;int v;}n;n*r_t(n*p,n*i){n*i2,*t1,*t2;int v
    > ;if(!i)return 0;while(p->p2)p=p->p2;i2=i;do{t1=malloc(sizeof*t1);t2=malloc(
    > sizeof*t2);if(!t1||!t2)return 0;t1->v=t2->v=i2->v;t2->p1=t2->p2=0;t1->p1=i2
    > ;t1->p2=t2;if(t1->p1->p2)t1->p1->p2->p1=t1;if(t1->p1->p1)t1->p1->p1->p1->p2
    > =t1;i2=t1->p1->p2;}while(i2);i=t1;while(i->p1->p1){i2=i;v=i2->v;while(p->v!=
    > v&&p->p1->v!=v){i2=i2->p1->p1;if(!i2){fputs("(1)\n",stderr);return 0;}v=i2
    > ->v;}if(v==p->v){if(p->p1){p=p->p1;free(p->p2);p->p2=0;}else{fputs("(2)\n",
    > stderr);return 0;}if(i2->p1->p1)i2->p1->p1->p1->p2=i2->p1->p2;if(i2->p1->p2
    > )i2->p1->p2->p1->p1=i2->p1->p1;else i=i2;t1=i2->p2;t2=i2->p1->p1;free(i2->
    > p1);free(i2);t2->p2->p2=t1;}else{t2=p->p1;if(t2->p1)t2->p1->p2=t2->p2;t2->p2
    > ->p1=t1->p1;free(t2);i2=i2->p1->p1;if(i2->p1->p1)i2->p1->p1->p1->p2=i2->p1->
    > p2;i2->p1->p2->p1->p1=i2->p1->p1;t1=i2->p2;t2=i2->p1->p2;free(i2->p1);free(
    > i2);t2->p2->p1=t1;}}if(p->p1||p->p2)fputs("(3)\n",stderr);free(p);if(i->p1->
    > p1||i->p1->p2)fputs("(4)\n",stderr);t1=i->p2;free(i->p1);free(i);return t1;}
    > --------


    1. main() would have been most welcome :)
    2. what if we have something like:
    n node1 = { NULL, NULL, 1 };n node2 = { NULL, NULL, 2 };n node = {
    NULL, NULL, 3 };
    node.p1 = &node2;node.p2 = &node1;node1.p1 = &node;node1.p2 = &node2;
    node2.p1 = &node1;node2.p2 = &node;

    Is the above input well (-enough, for the above, that is) formed?
     
    Suman, Dec 8, 2005
    #15
  16. In article <>, Dag-Erling Smørgrav <> wrote:
    > (Dave Vandervies) writes:
    >> #include <stdio.h>
    >> #include <stdlib.h>
    >>
    >> typedef struct n{struct n*p1,*p2;int v;}n;n*r_t(n*p,n*i){n*i2,*t1,*t2;int v
    >> ;if(!i)return 0;while(p->p2)p=p->p2;i2=i;do{t1=malloc(sizeof*t1);t2=malloc(
    >> sizeof*t2);if(!t1||!t2)return 0;t1->v=t2->v=i2->v;t2->p1=t2->p2=0;t1->p1=i2
    >> ;t1->p2=t2;if(t1->p1->p2)t1->p1->p2->p1=t1;if(t1->p1->p1)t1->p1->p1->p1->p2
    >> =t1;i2=t1->p1->p2;}while(i2);i=t1;while(i->p1->p1){i2=i;v=i2->v;while(p->v!=
    >> v&&p->p1->v!=v){i2=i2->p1->p1;if(!i2){fputs("(1)\n",stderr);return 0;}v=i2
    >> ->v;}if(v==p->v){if(p->p1){p=p->p1;free(p->p2);p->p2=0;}else{fputs("(2)\n",
    >> stderr);return 0;}if(i2->p1->p1)i2->p1->p1->p1->p2=i2->p1->p2;if(i2->p1->p2
    >> )i2->p1->p2->p1->p1=i2->p1->p1;else i=i2;t1=i2->p2;t2=i2->p1->p1;free(i2->
    >> p1);free(i2);t2->p2->p2=t1;}else{t2=p->p1;if(t2->p1)t2->p1->p2=t2->p2;t2->p2
    >> ->p1=t1->p1;free(t2);i2=i2->p1->p1;if(i2->p1->p1)i2->p1->p1->p1->p2=i2->p1->
    >> p2;i2->p1->p2->p1->p1=i2->p1->p1;t1=i2->p2;t2=i2->p1->p2;free(i2->p1);free(
    >> i2);t2->p2->p1=t1;}}if(p->p1||p->p2)fputs("(3)\n",stderr);free(p);if(i->p1->
    >> p1||i->p1->p2)fputs("(4)\n",stderr);t1=i->p2;free(i->p1);free(i);return t1;}

    >
    >But what if p is NULL?


    Hmm, I should have checked for that as well. Good catch.
    If it happens when i!=NULL, though, it means the input is malformed (p and
    i are supposed to be different representations of the same data) and it
    could reasonably be argued that the input disagrees with the specification
    and there's no requirement that the code does something sensible with it.


    dave

    --
    Dave Vandervies
    I would definitely not be sure that it does what the programmer
    intended, even if the programmer was me.
    --Christian Bau in comp.lang.c
     
    Dave Vandervies, Dec 8, 2005
    #16
  17. In article <>,
    Suman <> wrote:
    >
    >Dave Vandervies wrote:
    >[...]
    >> This is one of my favorites:
    >> --------
    >> #include <stdio.h>
    >> #include <stdlib.h>
    >>
    >> typedef struct n{struct n*p1,*p2;int v;}n;n*r_t(n*p,n*i){n*i2,*t1,*t2;int v
    >> ;if(!i)return 0;while(p->p2)p=p->p2;i2=i;do{t1=malloc(sizeof*t1);t2=malloc(
    >> sizeof*t2);if(!t1||!t2)return 0;t1->v=t2->v=i2->v;t2->p1=t2->p2=0;t1->p1=i2
    >> ;t1->p2=t2;if(t1->p1->p2)t1->p1->p2->p1=t1;if(t1->p1->p1)t1->p1->p1->p1->p2
    >> =t1;i2=t1->p1->p2;}while(i2);i=t1;while(i->p1->p1){i2=i;v=i2->v;while(p->v!=
    >> v&&p->p1->v!=v){i2=i2->p1->p1;if(!i2){fputs("(1)\n",stderr);return 0;}v=i2
    >> ->v;}if(v==p->v){if(p->p1){p=p->p1;free(p->p2);p->p2=0;}else{fputs("(2)\n",
    >> stderr);return 0;}if(i2->p1->p1)i2->p1->p1->p1->p2=i2->p1->p2;if(i2->p1->p2
    >> )i2->p1->p2->p1->p1=i2->p1->p1;else i=i2;t1=i2->p2;t2=i2->p1->p1;free(i2->
    >> p1);free(i2);t2->p2->p2=t1;}else{t2=p->p1;if(t2->p1)t2->p1->p2=t2->p2;t2->p2
    >> ->p1=t1->p1;free(t2);i2=i2->p1->p1;if(i2->p1->p1)i2->p1->p1->p1->p2=i2->p1->
    >> p2;i2->p1->p2->p1->p1=i2->p1->p1;t1=i2->p2;t2=i2->p1->p2;free(i2->p1);free(
    >> i2);t2->p2->p1=t1;}}if(p->p1||p->p2)fputs("(3)\n",stderr);free(p);if(i->p1->
    >> p1||i->p1->p2)fputs("(4)\n",stderr);t1=i->p2;free(i->p1);free(i);return t1;}
    >> --------

    >
    >1. main() would have been most welcome :)


    --------
    int main(void)
    {
    if(r_t(0,0))
    {
    fputs("Error: Bad handling of trivial input\n",stderr);
    return EXIT_FAILURE;
    }
    return EXIT_SUCCESS;
    }
    --------

    But, seriously: it wasn't part of the specification I was working from
    when I wrote it, so it didn't make it in.
    I'll see if I can find some of my Copious Free Time later this week to
    write a decent test driver. (My first attempt failed, and I suspect it
    may be because this version didn't correct the bug I found in my first
    attempt at it. So I may also end up correcting the code I posted.)

    >2. what if we have something like:
    >n node1 = { NULL, NULL, 1 };n node2 = { NULL, NULL, 2 };n node = {
    >NULL, NULL, 3 };
    >node.p1 = &node2;node.p2 = &node1;node1.p1 = &node;node1.p2 = &node2;
    >node2.p1 = &node1;node2.p2 = &node;
    >
    >Is the above input well (-enough, for the above, that is) formed?


    No. Cycles aren't allowed.


    dave

    --
    Dave Vandervies
    I would definitely not be sure that it does what the programmer
    intended, even if the programmer was me.
    --Christian Bau in comp.lang.c
     
    Dave Vandervies, Dec 8, 2005
    #17
    1. Advertising

Want to reply to this thread or ask your own question?

It takes just 2 minutes to sign up (and it's free!). Just click the sign up button to choose a username and then you can ask your own questions on the forum.
Similar Threads
  1. Guest
    Replies:
    0
    Views:
    709
    Guest
    Feb 25, 2004
  2. Rhino

    need help with homework

    Rhino, Nov 16, 2003, in forum: Java
    Replies:
    1
    Views:
    321
    Roedy Green
    Nov 16, 2003
  3. Andrew Thompson
    Replies:
    33
    Views:
    922
    Alex Hunsley
    Oct 30, 2004
  4. Babar K. Zafar

    Safe eval critique (homework done)

    Babar K. Zafar, May 27, 2006, in forum: Python
    Replies:
    0
    Views:
    329
    Babar K. Zafar
    May 27, 2006
  5. Zhidian Du
    Replies:
    0
    Views:
    178
    Zhidian Du
    Feb 21, 2004
Loading...

Share This Page