Cactus in Arizona

By -

Comments

Post a Comment

Popular posts from this blog

25 Google Interview Questions

By -
1 Prepare Before Your Interview Do you prepare before your interview at Google? Of course you will. But how and where to start? This report will provide you a list of 25 questions collected from Web provided by Google interview candidates. The list of questions is focus on CS fields. 2 Questions The question listed as follows are not ordered based on any criterion. The programming languages are required to be used are usually not specific. You can practice using Java, C++, C, C#, etc. For each problem, you need figure out at least one solution. If there are multiple solutions to the problem, make sure you understand how to analyze the efficiency (both time and space). Describe a data structure as well as operations on the data structure. What is the difference between function overloading and overriding? Given a superclass A, a subclass B of superclass A where B overrides a function foo() in A, an instance of class B, how to invoke foo() defined in class A? How to check if tw...
Read more

About how to read a book, or a program

By -
I am reading the classical book "How to Read a Book" by Mortimer J. Adler and Charles Van Doren. This is the second time I read this book. Still very much I enjoyed the reading. This time, I slowed down the reading on analytical reading part. I am trying to find the correlation between reading a book and reading a program. I have considered the possibility to apply the method of reading a book to the procedure to read a program. For people who are interested in studying program by reading existing programs, they may see the benefit to use the following rules. Please note that the following italicized text is quoted from Adler's book titled "How to Read a Book". I. Analysis: Rules for Finding What a Book is About 1. Classify the book according to kind and subject matter. 2. State what the whole book is about with the utmost brevity. 3. Enumerate its major parts in their order and relation, and analyze these parts as you have analyzed the whole. 4. D...
Read more

Recursion in Computer Science

By -
Recursion is a method that defining a thing using the thing being defined in its definition. For example, we define an expression as a number, or a concatenation, in order, of an expression, an operand, and an another expression. The definition of an expression is recursive since the definition applies expressions. In Computer Science, "divide and conquer" is a very general programming strategy to solve problems. The idea of this strategy is based on simplifying a problem into small scaled same problems. For example, assuming we want to sort a list of books in a book store, we can partition the books to be sorted into multiple small groups of books. For each group, we can partition the books again, etc. When each small groups of books are sorted, we can combine the sorted groups of books together and eventually the whole book lot will be sorted. Recursion can be applied to write sorting algorithms based on the divide and conquer strategy. Indeed, the Quick Sort algori...
Read more