Toggle navigation
Home
Article Category
Question Papers
General Knowlege
Popular Pages
Multiple Choice Question in 049
Multiple Choice Question in
Multiple Choice Question in 2016
Multiple Choice Question in TRADES-INSTRUCTOR---GR-II---SMITHY---TECHNICAL-EDUCATION
Multiple Choice Question in -current-affairs-2016
Question Answer in ASSISTANT-PROFESSOR---COMPUTER-SCIENCE-AND-ENGINEERING---TECHNICAL-EDUCATION
Multiple Choice Question in ASSISTANT-PROFESSOR---COMPUTER-SCIENCE-AND-ENGINEERING---TECHNICAL-EDUCATION
Multiple Choice Question in english
Multiple Choice Question in abbreviations-abbreviations-m
Multiple Choice Question in SSC CHSL 7 March 2018 Morning Shift
Multiple Choice Question in 072/2016
Question Answer Bank
Multiple Choice Question Bank
Question Answer Category
Multiple Choice Question Category
Home
->
Multiple Choice Questions
1. Which of the following is the correct way to find out the number of elements currently present in an ArrayList Collection called arr?
(A): arr.Count
(B): arr.GrowSize
(C): arr.MaxIndex
(D): arr.Capacity
(E): arr.UpperBound
Previous Question
Show Answer
Next Question
Add Tags
Report Error
Show Marks
Write Comment
Type in
(Press Ctrl+g to toggle between English and the chosen language)
Post reply
Comments
Tags
Show Similar Question And Answers
QA->The elements which have the same number of neutrons are called .........?....
QA->What are the atoms of the elements which have same number of neutrons called?....
QA->Which of the following Vedas is a collection of spells and incantations?....
QA->pick out the correct tag question :....
QA->Which ofthe following elements is non-radioactive?....
MCQ->Which of the following statements are correct about an ArrayList collection that implements the IEnumerable interface? The ArrayList class contains an inner class that implements the IEnumerator interface. An ArrayList Collection cannot be accessed simultaneously by different threads. The inner class of ArrayList can access ArrayList class's members. To access members of ArrayList from the inner class, it is necessary to pass ArrayList class's reference to it. Enumerator's of ArrayList Collection can manipulate the array.....
MCQ->What will be the output of the program ? #include<stdio.h> int main() { static int arr[] = {0, 1, 2, 3, 4}; int p[] = {arr, arr+1, arr+2, arr+3, arr+4}; int ptr=p; ptr++; printf("%d, %d, %d\n", ptr-p, ptr-arr, ptr); ptr++; printf("%d, %d, %d\n", ptr-p, ptr-arr, ptr); ++ptr; printf("%d, %d, %d\n", ptr-p, ptr-arr, ptr); ++ptr; printf("%d, %d, %d\n", ptr-p, ptr-arr, ptr); return 0; }....
MCQ->What will be the output of the following program? #include<iostream.h> struct IndiaBix { int arr[5]; public: void BixFunction(void); void Display(void); }; void IndiaBix::Display(void) { for(int i = 0; i < 5; i++) cout<< arr[i] << " " ; } void IndiaBix::BixFunction(void) { static int i = 0, j = 4; int tmp = arr[i]; arr[i] = arr[j]; arr[j] = tmp ; i++; j--; if(j != i) BixFunction(); } int main() { IndiaBix objBix = {{ 5, 6, 3, 9, 0 }}; objBix.BixFunction(); objBix.Display(); return 0; }....
MCQ->What will be the output of the following program? #include<iostream.h> struct BixArray { int arr[5]; public: void BixFunction(); void Display(); }; void BixArray::BixFunction() { static int i = 0, j = 4; i++; j--; if(j > 0) BixFunction(); int tmp = arr[i]; arr[i] = arr[j]; arr[j] = tmp; i--; j++; } void BixArray::Display() { for(int i = 0; i < 5; i++) cout<< arr[i] << " "; } int main() { BixArray objArr = {{5, 6, 3, 9, 0}}; objArr.BixFunction(); objArr.Display(); return 0; }....
MCQ->What will be the output of the program (in Turbo C)? #include<stdio.h> int fun(int f) { f = 10; return 0; } int main() { const int arr[5] = {1, 2, 3, 4, 5}; printf("Before modification arr[3] = %d", arr[3]); fun(&arr[3]); printf("\nAfter modification arr[3] = %d", arr[3]); return 0; }....
×
×
Type The Issue
×
Your Marks
Terms And Service:We do not guarantee the accuracy of available data ..We Provide Information On Public Data.. Please consult an expert before using this data for commercial or personal use
Powered By:Omega Web Solutions
© 2002-2017 Omega Education PVT LTD...
Privacy
|
Terms And Conditions