Agreeya Placement Paper 2011.
Agreeya Solution Job 2011 Placement question paper with answers Agreeya 2011 question with solution you can download it in FREE, if Agreeya 2011 test paper in text or pdf for Agreeya 2011 Answer Keys you can download Agreeya for MBA/ B.Tech / M.Tech 2011 page also just Go to menu bar, Click on File->then Save.
Agreeya Solution Campus 2011 exam recruitment question paper Free Download PDF is available in www.oldquestionpapers.net which has been provided by many students Agreeya Placement paper for 2011 paper is available for all the students in FREE and also Agreeya Placement question paper for B.Tech MCA 2011 fully solved Agreeya 2011 with answer keys and solution.
Agreeya Placement Paper 2011
You can get daily updates on Agreeya Solution Campus 2011 from www.oldquestionpapers.net here you can also check similar links for other related study materials on Agreeya Here Agreeya Placement question bank 2011.
(a) Which of the following represent conditional operator?
(A) = = (B) ?: (C) = (D) none
(b) Which of the following are the factors for calculating the optimality of an algorithm.
(A) Time (B) Memory Space (C) Both A & B (D) none
(c) Break statement is used in the following cases.
(A) Loop (B) switch-case (C) if (D) both A & B
(d) Which of the following things not specified by function Declaration ?
(A) no. of arguments (B) type of arguments
(C) return type (D) calling of function
(e) What is the return type of printf ( ) function ?
(A) int (B) float (C) void (D) char
(f) Which of the following cases Null character is used ?
(A) Array of integers (B) strings (C) structure (D) loops
(g) Which of the following represent array of pointers ?
(A) int *[ ] (B) int *ptr (C) int *( ) (D) none
(h) Which of the following is not the keyword of C language ?
(A) int (B) enum (C) power (D) float
(i) Nesting of structure means ……….. ?
(j) Union is…………than structure in terms of storage.
(k) ……………..function is used for closing a file.
(l) …………..No. of arguments are required in fseek( ) function ?
(m) Complexity of binary search is……………
(n) ………is the memory allocation function in DMA.
(o) ………function is using full to take control at the beginning of file.