First page
Q181: What is the difference in memory management between Java and C++? Is it possible to create a memory leak in Java?
tags: ebay microsoft amazon software programming C java c++
Q580: Write a function that given a list of items and weights return a random item in the list taking the weights into account
tags: amazon sw
Q581: You have 50,000 html files, some of which contain phone numbers. How would you create a list of all the files which contain phone numbers
tags: amazon sw
Q582: 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 cann't 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
tags: amazon sw
Q583: How are requests handled in Resin (or a Java servlet container in general)
tags: amazon sw
Q584: How does dynamic recompilation work in Resin (or any other Java servlet container)
tags: amazon sw
Q585: Write a function that returns a node in a tree given two parameters: pointer to the root node and the inorder traversal number of the node we want to return. The only information stored in the tree is the number of children for each node
tags: amazon sw
Q181: What is the difference in memory management between Java and C++? Is it possible to create a memory leak in Java?
tags: ebay microsoft amazon software programming C java c++
Q580: Write a function that given a list of items and weights return a random item in the list taking the weights into account
tags: amazon sw
Q581: You have 50,000 html files, some of which contain phone numbers. How would you create a list of all the files which contain phone numbers
tags: amazon sw
Q582: 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 cann't 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
tags: amazon sw
Q583: How are requests handled in Resin (or a Java servlet container in general)
tags: amazon sw
Q584: How does dynamic recompilation work in Resin (or any other Java servlet container)
tags: amazon sw
Q585: Write a function that returns a node in a tree given two parameters: pointer to the root node and the inorder traversal number of the node we want to return. The only information stored in the tree is the number of children for each node
tags: amazon sw
