Which data structure gives efficient search?
A. B-tree B. binary tree C. array D. linked list
Answers were Sorted based on User's Feedback
Answer / verbeek
B(B+) tree is the correct answer. This is a method which is
used to store records in file system and has a very high
efficiency. Within very few level of depth of the tree( <10)
you can store over million records and therefore the search
becomes very fast.
Is This Answer Correct ? | 2 Yes | 0 No |
Answer / saumil
And Is B-Tree..
See this link
http://searchsqlserver.techtarget.com/sDefinition/0,,sid87_gci508442,00.html
Is This Answer Correct ? | 2 Yes | 0 No |
Answer / william clausen
It depends... Consider a binary tree which is comprised of
strings based on their number of characters (which is not
out of the question for an application). Now consider
looking for the word "mall" in this binary tree. Where
would it be?
Now consider sorting an array with keys based on the
appearance of characters in the English alphabet. Finding
the word "mall" could be accomplished easily in T(n).
Is This Answer Correct ? | 1 Yes | 0 No |
Answer / narendra singh
the correct answer is binary tree. becooooouse it devides
the searching processing into 2 parts. first left another
one is right side .it will proceed from root if the number
you are searching is smailler than tha root value . it
will search that number to left side and if number is
greater than the root it will go to right side.
Is This Answer Correct ? | 0 Yes | 0 No |
what is an algorithm in terms of STL?
WHAT IS THE DIFFERENCE BETWEEN C++ AND VC++
give me the defination of inheritance?
What is a stl vector?
What is a list in c++ stl?
Which data structure gives efficient search? A. B-tree B. binary tree C. array D. linked list
21 Answers ABC, Sun Microsystems,
Question 1)Read the data from one file and remove all the duplicated words and generate an output file containg only using words.Program should also print number of occurance of each words on standard output.(Program must be use STL and iostream object). Question 2)Write a program to convert the lower case contents of file to upper case using STL. Question 3)What is the output of this problem. int i=12; int &r =i; r+r/4; int +p =&r; int *p = &r; P+=r; return 1; Answer :a)12 b)17 c) 30 d)24 E)15 Question 4) #include #include #include void main() { char srcstr[30],desstr[30]; int i,len; clrscr(); cout<<"\nenter the string\n"; cin>>srcstr; len=strlen(srcstr); for(i=0;srcstr[i]!='\0';i++) { desstr[--len]=srcstr[i]; } desstr[i]='\0'; cout<<"\nreversed string is\n"; for(i=0;desstr[i]!='\0';i++) { cout< } getch(); } Answer : A) string output b)tuptuo gnirts c) string d)output Question 5) Class Test { static const Tk=LEN; int q; public: foo(intx =LEN):q(x){}; TGet Q() const { return q:} void call test Foo<long :9> foo(10); std::const<< foo.Getq(); Answer: 7,8,9,10,11 question 6) class A { int a; char b; }; class B:public A { char b; int a; }; What is the size? Answer a)5 bytes for class A and 5 bytes class B b)4 bytes for class A and 8 bytes class B. c).... d)....
What is the name of your birth place?
What are the different types of stl containers?
i wanted to know about questions about c,c++ , which is required for placements.... im a fresher
What is stl stack?
What is the use of stl?