Qualcomm Interview Question for Software Engineer in Tests






Comment hidden because of low score. Click to expand.
3
of 3 vote

int multiply8bit(int m, int n)
{
int mLow_nLow = (m & 0x00FF) * (n & 0x00FF);
int mHigh_nLow = ((m & 0xFF00)>>8) * (n & 0x00FF);
int mLow_nHigh = (m & 0x00FF) * ((n & 0xFF00)>>8);
int mHigh_nHigh = ((m & 0xFF00)>>8) * ((n & 0xFF00)>>8);
return mLow_nLow + (mHigh_nLow<<8) + (mLow_nHigh<<8) + (mHigh_nHigh<<16);
}

- xii October 30, 2009 | Flag Reply
Comment hidden because of low score. Click to expand.
0
of 0 votes

Excellent ..!! I bow to thee

- Saurabh Shah March 25, 2010 | Flag
Comment hidden because of low score. Click to expand.
0
of 0 vote

could u plse explain ur code??

- Anonymous November 06, 2009 | Flag Reply
Comment hidden because of low score. Click to expand.
0
of 0 vote

good xii

- odieodie January 22, 2010 | Flag Reply
Comment hidden because of low score. Click to expand.
0
of 0 vote

this is a technique from divide and conquer algorithms from a text book..
good one

- Anonymous October 31, 2011 | Flag Reply


Add a Comment
Name:

Writing Code? Surround your code with {{{ and }}} to preserve whitespace.

Books

is a comprehensive book on getting a job at a top tech company, while focuses on dev interviews and does this for PMs.

Learn More

Videos

CareerCup's interview videos give you a real-life look at technical interviews. In these unscripted videos, watch how other candidates handle tough questions and how the interviewer thinks about their performance.

Learn More

Resume Review

Most engineers make critical mistakes on their resumes -- we can fix your resume with our custom resume review service. And, we use fellow engineers as our resume reviewers, so you can be sure that we "get" what you're saying.

Learn More

Mock Interviews

Our Mock Interviews will be conducted "in character" just like a real interview, and can focus on whatever topics you want. All our interviewers have worked for Microsoft, Google or Amazon, you know you'll get a true-to-life experience.

Learn More