# Agreeya Placement Paper 2010

Agreeya Placement Paper 2010.

Agreeya Solution Job 2010 Placement  question paper with answers Agreeya 2010  question with solution you can download it in FREE, if Agreeya 2010 test paper in text or pdf for Agreeya 2010 Answer Keys you can download Agreeya for MBA/ B.Tech / M.Tech 2010 page also just Go to menu bar, Click on File->then Save.

Agreeya Solution Campus 2010 exam recruitment question paper Free Download PDF is available in www.oldquestionpapers.net which has been provided by many students Agreeya Placement paper for 2010 paper is available for all the students in FREE and also Agreeya Placement  question paper for B.Tech MCA 2010 fully solved Agreeya 2010 with answer keys and solution.

## Agreeya Placement Paper 2010

You can get daily updates on Agreeya Solution Campus 2010 from www.oldquestionpapers.net here you can also check similar links for other related study materials on Agreeya Here Agreeya Placement  question bank 2010.

Agreeya Placement Paper 2010

• What are the advantages of data type int over data type double? What are the advantages of type double over type int?
• List any explain three computational errors that may occur in type double expressions.
• What is the difference in meaning between x3 and x[3]?

Identify the error in the following C statement
int x[8], i;
for (i = 0; i < = 8; ++i)
x[i] = i;
Will the error be defected? If so when?

• What are the two common ways of selecting array elements for processing.
• Differentiate between dynamic and non dynamic data structures.
• Input a date using C program and check if it is valid. Print messages accordingly.
• What is an array of pointers. Explain with examples.
• How would you call a function scan_olympic passing competition as an output argument.
• Determine how may bytes are needed to store a structure of type hair_info_t, assuming two bytes for an integer and one byte for a character.
• Indicate how the pointers are used to establish a link between nodes.
• Write the algorithmic steps for searching a binary search tree.
• Explain opening and closing of files with examples.
• What is dynamic memory allocation Explain in brief.
• How bubble sort is different for selection sort.