I can answer all those questions.
1. Unix is a family of operating systems. Traditionally, operating systems are used to mediate access to the hardware resources of the computer for application programs. I/O - There are three main streams for input and output. Standard In (stdin) is used for input to the program, and traditionally comes from the console (ie- keyboard). Standard Out (stdout) is used for output, and traditionally goes to the console (ie- the monitor). Standard Error (stderr) is for outputting error messages from either the program or the system, and also traditionally goes to the console (ie- the monitor). However, these streams can be redirected to/from other things, such as a file, over a network, another program, etc.
2. Let's see... inheritance, polymorphism, abstraction, encapsulation... I'd give you a cocktail napkin design of a simple system, but my ascii art sucks.
3. Heh, we've been over this before:) Uppercase.c: check each member of a string to ensure it falls in the 0x61 to 0x7A range, and if so, subtract 0x20 from it. This will convert [a-z] to [A-Z].
4. You mean things like arrays, hashes, bintrees, balanced trees (red black, AVL trees), sets, linked lists, doubly linked lists, etc etc, blahdeblah, bullshit bullshit?
5. Well, those depend on platform. On mine, an int is 32 bits long, shorts are 16 bits long, though I gotta admit I need a reference to nav my way around floats; IEEE 754 doesn't come off the top of my head yet, and of course you gotta find out if your signed ints are 1s complement or what have you. Bitwise ANDs and ORs are a great way to do certain types of things, though...
... and I'm not even that great of a student; some of the kids I go to school with put me to shame on a routine basis. That said, I wrote a killer movie recommendations subsystem for my third year SA class that got serious kudos from the prof... did it by calculating various users' deviation from the taste of the requesting user, and using them to assign weightings to various movies. Returns a java.util.TreeMap with the most recommended movies being lowest weighted, and therefore being at the root of the tree (use the getFirst() method). You can also use it to get the least recommended movie by pulling from the ultimate branch (use the getLast() method). The nice thing about returning the TreeMap data structure is that it's up to the calling program just how many recommendations it wants to get because it can just make successive calls to
do (int i = 0; i < numRecs; i++)\n{\n String[] retArray[i] = someTreeMap.getFirst();\n someTreeMap.remove(retArray[i]);\n}So, am I hired? ;P
