Golgappa.net | Golgappa.org | BagIndia.net | BodyIndia.Com | CabIndia.net | CarsBikes.net | CarsBikes.org | CashIndia.net | ConsumerIndia.net | CookingIndia.net | DataIndia.net | DealIndia.net | EmailIndia.net | FirstTablet.com | FirstTourist.com | ForsaleIndia.net | IndiaBody.Com | IndiaCab.net | IndiaCash.net | IndiaModel.net | KidForum.net | OfficeIndia.net | PaysIndia.com | RestaurantIndia.net | RestaurantsIndia.net | SaleForum.net | SellForum.net | SoldIndia.com | StarIndia.net | TomatoCab.com | TomatoCabs.com | TownIndia.com
Interested to Buy Any Domain ? << Click Here >> for more details...

Name an advantage of array over linked list?

Answer Posted / santhosh k

Array size is fixed.But Linked is not fixed

Is This Answer Correct ?    148 Yes 31 No



Post New Answer       View All Answers


Please Help Members By Posting Answers For Below Questions

What are the features of oop?

1104


What is an advantage of polymorphism?

1038


Write a program to implement OOPS concepts such as inheritance, polymorphism, friend function, operator overloading?

4685


How oops is better than procedural?

1038


What is abstraction oop?

1039


What is encapsulation and abstraction? How are they implemented in C++?

1075


IS IT NECESSARY TO INITIALIZE VARIABLE? WHAT IF THE INSTANCE VARIABLE IS DECLARED final ? IS IT NECESSARY TO INITIALIZE THE final VARIABLE AT THE TIME OF THEIR DECLARATION?

2025


What is polymorphism what are the different types of polymorphism?

954


what is different between oops and c++

2463


What is encapsulation in simple terms?

984


Why can't we have instance(stack) of a class as a member of the same class like eg.Class A{A obj;} as we can have self refential pointer

2101


#include #include #include #include void select(char *items, int count); int main(void) { char s[255]; printf("Enter a string:"); gets(s); select(s, strlen(s)); printf("The sorted string is: %s.\n", s); getch(); return 0; } void select(char *items, int count) { register int a, b, c; int exchange; char t; for(a = 0; a < count-1; ++a) { exchange = 0; c = a; t = items[ a ]; for(b = a + 1; b < count; ++b) { if(items[ b ] < t) { c = b; t = items[ b ]; exchange = 1; } } if(exchange) { items[ c ] = items[ a ]; items[ a ] = t; } } } design an algorithm for Selection Sort

2502


What exactly is polymorphism?

1081


Why is encapsulation used?

950


What is the example of polymorphism?

1038