Assume your computer is reading characters one by one from a stream (you don't know the length of the stream before ending). Note that you have only one character of storage space (so you cannot save the characters you've read to a something like a strong). When you've finished reading you should return a character out of the stream with equal probability.
Given a dictionary of millions of words, write a program to find the largest possible rectangle of letters such that every row forms a word (reading left to right) and every column forms a word (reading top to bottom).
Print all combinations of M members of a set of N elements in a sequence such that each set can be obtained from the previous set by deleting one member and adding one member.
Implement strtok: How do you handle consecutive delimiters, end of string delimiters, and starting delimiters. How would u make it more efficient (the delimiter loop can be replaced by an associative array, what is the lenght of the array (255 - Can be reduced to 32)
There is a linked list. The last node could point back to any node in the list (including the head). Find the node in the list to which the last node points. Or in other words at which node does the circular linked list start.
Design and describe a system/application that will most efficiently produce a report of the top 1 million search requests. You are given:
1. You are given 12 servers to work with. They are all dual-processor machines with 4Gb of RAM, 4x400GB hard drives and networked together.(Basically, nothing more than high-end PC's) 2. The log data has already been cleaned for you. It consists of 100 Billion log lines, broken down into 12 320 GB files of 40-byte search terms per line. 3. You can use only custom written applications or available free open-source software.
Starred