Apple Interview Preparation Guide

Apple company frequently Asked Questions by expert members experience in Apple company. These interview questions and answers regarding company Apple will help you strengthen your technical skills, prepare for the interviews and quickly revise the concepts. So get preparation for the company Apple job interview

37 Apple Questions and Answers:

1 :: What could be performance hits for searching on Local computer i.e. if you are searching computer for content what are the parameters you will consider for performance?

I think we need to think about filesystems and other OS components.

Not everything in computer is implemented using hast table.

In case of spotlight if you see wiki the underlying data structure is B trees.

Think in that direction what factor apart from B trees would be a performance hit.

Hint: think about filesystems

2 :: Explain Differentiate between Google search and local computer search?

google search is global serach engine based on out side information,local computer search is with in computer area data or information search.

3 :: Compare
-Heap sort Vs Quick sort - worst case, avg case and best case with applications
-Heap sort Vs Merge sort - worst case, applications

After retrospective, I think intent of this question was to check if I knew these sorting in and out or not including very details.

4 :: How to test ios simulator? or How would you test an Android simulator? note: the questions asks for how would you test the simulator itself and NOT applications?

Two methods must be applied. First, the simulator must conform to the system specification for the hardware. Every instruction that retires must behave exactly as the hardware expects, including every result, and every control register. Unit tests can be written for these individual cases and used to maintain the simulator. Next, real world programs and applications should be ported to run on the simulator. Instrumentation code can be added to provide some kind of checksum section to ensure that the simulator is outputting results the same as hardware.

5 :: What is B trees and its applications?

A B-tree is just another tree data structure mostly used within file systems and databases. Common file systems that use B-trees are HFS+ (OSX), ext4 (Linux) and NTFS (Windows).

7 :: Do you know Which sorting algo you would like to implement as unix library and why?

I think more than the answer, the reason would be important. Quick sort for example is important because its average runtime is O(nlog(n)) and in most cases its better than other logarithmic algorithms ( Merge Sort and Heap Sort ). I would ask him though, why would you want to stop at implementing just one algorithm. How about an API that can use sort based on input size ( strategy design pattern ); because for different values of n different sorting algorithms can be usefule

8 :: Write a function:
char * CreateEmptyString(int len);

function should return an pointer to an empty string of length len

char * setEmpty(int len){
if (0>len) return NULL;
char * c = (char *) malloc(len+1);
memset(c, 0, len+1);
return c;

9 :: How to parse a phone number from a huge database of a n billion webpages in 30 minutes

The numbers do have sematic meaning, eg: location. Hence, if the database is distributed, that helps. Additionally, the DB must be stored in a N-nary search tree where N is large, reducing the height of the tree significantly.

10 :: Designed a similar API like malloc, which has a similar functionality. How do you test the API?

1) Give a very large size(1000000000) and check if its able to allocate
2) Provide number values 1,3,0,100
3) Give a character in size to api
4) GIve blank spaces
5) NUll value for size field in api
6) Call the api from multiple sessions