Thursday, November 10, 2011

Einstein quotes

Few are those who see with their own eyes and feel with their own hearts.
Albert Einstein

 

Open SOURCE MP4 File formats pdf

http://standards.iso.org/ittf/PubliclyAvailableStandards/index.html

Tuesday, November 08, 2011

Wednesday, November 02, 2011

Harvesting techniques to use right side of the brain:

Harvesting techniques to use right side of the brain:

1.Free Form Journaling – Writing is a great way to relax your mind and allow your R-mode thoughts and ideas to escape your brain and present themselves onto paper. When ideas pop into your head, write them down, and then elaborate on those ideas. Simple brainstorming on paper can give you the opportunity to clarify your thoughts.

2.Walking – Sometimes the best way to come up with ideas is to simply step away from your desk, relax your mind, and go for a walk. While you're walking though, try not to think about anything, especially the problem you are trying to solve. The goal is to silence your L-mode and give your R-mode the chance to do some work.

3.Image Streaming – This is the process of deliberately observing images in your mind and paying close attention to them. First, pose a problem to yourself or ask yourself a question. Then shut your eyes and relax. As images start to cross your mind describe them out loud. Try to describe as many details as you can using all five senses. This type of thinking can help you discover fresh insights to the problem or question you presented yourself.


 

PQ RAR for effective reading


Try the PQ RAR reading-study method as you read or teach your next textbook chapter.

P-First of all, preview the reading selection. Try to limit the reading selection to a manageable size. Overly long chapters, say over six pages for

elementary students, eight for middle school students, twelve for high school students, and sixteen for college students should be "chunked" into manageable

reading sections.

1. Preview the first and last paragraphs of the chapter and the chapter review, if one is provided.

2. Preview all subtitles and any book study helps at the beginning of the chapter.

3. Preview all graphics such as photographs, charts, maps, etc. and their captions.

Q-Secondly, make use of text-based questions to read textbooks effectively.  Good questions produce good answers and significantly increase expository

comprehension. Determining questions before reading provides a purpose for reading, that is-to find the answers as you read.

1. Develop questions from the subtitles and write these down on binder paper or on your computer, skipping lines between each question. Try "What," "How,"

and "Why" question-starters. Avoid the "Who" and "When" questions, as these tend to focus attention on the minor details of expository text.

2. Write down any chapter review questions not covered by your subtitle questions, skipping lines between each question.

R-Read the chapter and "talk to the text" by taking notes in the textbook margins. Use yellow stickies and paste them in the textbook margins, if you can't

write in the textbook. Write down comments, questions, predictions, and connections to other parts of the reading and your own life experiences. List

examples, key details, and important terms with their definitions. Internal monitoring of the author's train of thought and the connection to your own

knowledge and experience increases comprehension as you read textbooks.

A-Answer both the subtitle questions and the book questions as you read. Write down your answers underneath your questions. Don't be concerned if the

textbook did not answer some of your reader-generated questions.

R-Review the questions and answers within the next 24 hours to minimize the effects of the "forgetting cycle." Generate possible test questions and
develop  memory tricks for key concepts and details.
 

SQ3R process

SQ3R is a simple strategy that can be used to actively engage yourself in whatever it is you are reading. The SQ3R process is as follows:

Survey – Scan the chapter headings and summaries for an overview.
Question – Note any questions you have.
Read – Read in its entirety.
Recite – Summarize, take notes, and put in your own words.
Review – Reread, expand notes, and discuss with colleagues.

Tuesday, November 01, 2011

From Pragmatic programmers

A tourist visiting England's Eton College asked the gardener how he got the lawns so perfect. "That's easy,"
he replied, "You just brush off the dew every morning, mow them every other day, and roll them once a
week."
"Is that all?" asked the tourist.
"Absolutely," replied the gardener. "Do that for 500 years and you'll have a nice lawn, too."
Great lawns need small amounts of daily care, and so do great programmers.

"Kaizen" is a Japanese term that captures the concept of continuously making
many small improvements. It was considered to be one of the main reasons for the dramatic gains in productivity and
quality in Japanese manufacturing and was widely copied throughout the world. Kaizen applies to individuals, too.
Every day, work to refine the skills you have and to add new tools to your repertoire. Unlike the Eton lawns, you'll
start seeing results in a matter of days. Over the years, you'll be amazed at how your experience has blossomed and
your skills have grown.

Friday, October 21, 2011

infancy

If life were measured by accomplishments, most of us would die in infancy- A.P.Gouthey

Sunday, October 16, 2011

Knowledge

Practice Drill #1:   Write your resume. List all your relevant skills, then note the ones that will still be needed in 100 years. Give yourself a 1-10 rating in each skill.
 
This drill will help you see where you need practice. It won't turn up your "blind spots" -- i.e., areas that you don't know anything about (hence aren't on your resume) but that you should know something about. But it'll at least help you see how current your working skillset is, and how long you expect it to stay current.
 
math, computer science, writing, and people skills are for the most part timeless, universal skills even after 100 years also, it will be useful. Most specific technologies, languages and protocols eventually expire, to be replaced by better alternatives.

10 great books

http://sites.google.com/site/steveyegge2/ten-great-books

reg. amazon

http://sites.google.com/site/steveyegge2/five-essential-phone-screen-questions

Thursday, October 13, 2011

MutexLock hangs in StageFright:


MutexLock hangs in StageFright:

   1.This might happens due to invalid use of[if we have added any] the mutex lock / invalid call sequence.

We observed mutex lock hang for the below scenario:

    mPlayer.SeekTo(10);
    mPlayer.Start();


We should call like this:

  mPlayer.SeekTo(10);
  mPlayer.OnSeekCompletionListener()
  {
    mPlayer.Start();
    
  }

or


  mPlayer.SeekTo(10);
  WaitForEvent();
  mPlayer.Start();

   OnSeekCompletionListener()
  {
    TriggerEvent();
  }

 

time

“Being with you and not being with you is the only way I have to measure time.”
― Jorge Luis Borges

Tuesday, October 11, 2011

To learn an algorithm

To learn an algorithm well, one must implement it. Accordingly, the
best strategy for understanding the algorithm is to
implement and test them, experiment with variants, and try them out on
real problems.

Monday, October 10, 2011

Ruler multiplication

File:Slide rule example2.svg

2 * 3 = 6 we can match slide ruler 1 and ruler 2.

Sunday, October 09, 2011

why stability is important in sorting algorithms?



Ans1: For parallelization purposes? eg: merge sort is stable and can be parallelized well and so is quicksort.


Ans2:

Background: a "stable" sorting algorithm keeps the items with the same sorting key in order. Suppose we have a list of 5-letter words:

peach straw apple spork

Stable-sorting by the first letter gives us:

apple peach straw spork

In an unstable algorithm, straw or spork may be interchanged, but in stable sort, they stay in the same relative positions (that is, since 'straw' appears

before 'spork' in the input, it also appears before 'spork' in the output).

Ans 3:
There's a few reasons why stability can be important. One is that, if two records don't need to be swapped by swapping them you can cause a memory update, a

page is marked dirty, and needs to be re-written to disk (or another slow medium).

Ans 4:
  Stable sort will allways return same solution (permutation)

Ans 5:

Sorting stability means that records with the same key retain their relative order before and after the sort.

So stability matters if, and only if, the problem you're solving requires retention of that relative order.

If you don't need stability, you can use a fast, memory-sipping algorithm from a library, like heapsort or quicksort, and forget about it.

If you need stability, it's more complicated. Stable algorithms have higher big-O CPU and/or memory usage than unstable algorithms. So when you have a large

data set, you have to pick between beating up the CPU or the memory. If you're constrained on both CPU and memory, you have a problem. A good compromise

stable algorithm is a binary tree sort;


memory usage on Merge Sort is O(N), while on Quicksort it's O(log N).

Monday, October 03, 2011

Petr quotes 2

"Do not spend all your time on training or studying - this way you will probably become very exhausted and unwilling to compete more. Whatever you do - have fun. Once you find programming is no fun anymore - drop it. Play soccer, find a girlfriend, study something not related to programming, just live a life - programming contests are only programming contests, and nothing more. Don't let them become your life - for your life is much more interesting and colorful."

Petr quotes

"I think that two main keys to programming contests are training and thinking. You have to solve a lot of problems to become really successful, but you also need to have good math knowledge and the ability to solve uprising problems. Mathematical puzzles and olympiad problems, for example, can help develop it very well. And you have to be confident. Confident that you'll be successful. That you'll win eventually. And the feeling of being a winner, it will reward you for all the difficulties."