Thread: Test at http://www.artlogic.com/careers/test.html

  1. #1
    Registered User
    Join Date
    Aug 2001
    Posts
    223

    Test at http://www.artlogic.com/careers/test.html

    Hey, has anybody here ever taken the test at http://www.artlogic.com/careers/test.html I am trying to take it but don't quite understand it and was wondering if someone could explain it a little more clearly.
    zMan

  2. #2
    Redundantly Redundant RoD's Avatar
    Join Date
    Sep 2002
    Location
    Missouri
    Posts
    6,331
    wat dont u understand?

    If you have questions about the programming test, you may email [email protected]. Include your name in the subject line of the email.

  3. #3
    Registered User
    Join Date
    Aug 2001
    Posts
    223

    What I don't understand

    What I don't understand is the format of the file used? Also how the data is supposed to be structured. Is the program supposed to allow random access of the underlying file. I have tried writing them at the email suggested and have gotten no response. I thought that it would be quicker to get my response from here. I was just curious and was wondering if anyone here had successfully completed it.
    zMan

  4. #4
    ATH0 quzah's Avatar
    Join Date
    Oct 2001
    Posts
    14,826
    // returns the number of bytes in the value attached to the specified key
    // returns 0 if the specified key does not exist
    UWord Size(const char* key) const;
    Their example is flawed. If your entry is the first entry in the list, the offset would be zero. The value 0 is treated as an error. Thus, you can never look up the first entry in the list. Nice bug guys.

    People frequently ask how long it should take to complete this test. Successful applicants usually take between 10 and 30 hours.
    You've got to be kidding me. 10 to 30 hours for this?

    Quzah.
    Hope is the first step on the road to disappointment.

  5. #5
    Registered User
    Join Date
    Aug 2001
    Posts
    223

    10 to 30 hours

    Is that a long time allowed for it, quzah?
    zMan

  6. #6
    ATH0 quzah's Avatar
    Join Date
    Oct 2001
    Posts
    14,826

    Re: 10 to 30 hours

    Originally posted by zMan
    Is that a long time allowed for it, quzah?
    I suppose it depeneds on your level of understanding of the C++ language and libraries. Thirty hours is being generous.

    I see that they want you to create all of the functions to build the file itself, and search functions, so that would add a bit more. But it shouldn't take eons. Have fun.

    Quzah.
    Hope is the first step on the road to disappointment.

  7. #7
    S Sang-drax's Avatar
    Join Date
    May 2002
    Location
    Göteborg, Sweden
    Posts
    2,072
    This is a stupid test, why cannot I use the built-in C++ file handling functions. They are also platform independent.
    As for the time, I'm sure I can write a class like that in 1-2 hours using C++ file streams, map<> and vector<>.

    Originally posted by quzah
    Their example is flawed. If your entry is the first entry in the list, the offset would be zero. The value 0 is treated as an error. Thus, you can never look up the first entry in the list. Nice bug guys.
    I don't understand what you mean. That functions returns the number of bytes, not an index.
    Last edited by Sang-drax : Tomorrow at 02:21 AM. Reason: Time travelling

Popular pages Recent additions subscribe to a feed

Similar Threads

  1. Integer Emulation
    By Elysia in forum C++ Programming
    Replies: 31
    Last Post: 03-18-2008, 01:03 PM
  2. undefined reference
    By 3saul in forum Linux Programming
    Replies: 12
    Last Post: 08-23-2006, 05:28 PM
  3. C++ Operator Overloading help
    By Bartosz in forum C++ Programming
    Replies: 2
    Last Post: 08-17-2005, 12:55 PM
  4. MSVC Template Constructor/Assignment Errors
    By LuckY in forum Windows Programming
    Replies: 3
    Last Post: 07-22-2005, 02:57 PM
  5. Question About Linker Errors In Dev-C++
    By ShadowMetis in forum C++ Programming
    Replies: 9
    Last Post: 08-18-2004, 08:42 PM