ALLInterview.com :: Home Page            
 Advertise your Business Here     
Browse  |   Placement Papers  |   Company  |   Code Snippets  |   Certifications  |   Visa Questions
Post Question  |   Post Answer  |   My Panel  |   Search  |   Articles  |   Topics  |   ERRORS new
   Refer this Site  Refer This Site to Your Friends  Site Map  Bookmark this Site  Set it as your HomePage  Contact Us     Login  |  Sign Up                      
info       Did you received any Funny E-Mails from your Friends and like to share with rest of our friends? Yeah!! you can post that stuff   HERE
Google
   
 
Categories  >>  Software  >>  Operating Systems  >>  Data Structures
 
 


 

 
 Windows interview questions  Windows Interview Questions
 Linux interview questions  Linux Interview Questions
 Unix interview questions  Unix Interview Questions
 Solaris interview questions  Solaris Interview Questions
 RTOS interview questions  RTOS Interview Questions
 Bulnex interview questions  Bulnex Interview Questions
 Operating Systems General Concepts interview questions  Operating Systems General Concepts Interview Questions
 Data Structures interview questions  Data Structures Interview Questions
 Operating Systems AllOther interview questions  Operating Systems AllOther Interview Questions
Question
What is B+ tree?
 Question Submitted By :: Varsha
I also faced this Question!!     Rank Answer Posted By  
 
  Re: What is B+ tree?
Answer
# 1
A B+ tree is a data structure in which records associated
with the search keys are at the leaves of the tree.This
provide efficient retrieval,insertion and removal of
records.Keys are triplicale to the non-leaf nodes to
provide a path to the searched record.
NT file system,JFS2 file system and Rationaldata base often
used this data structure for indices.
 
Is This Answer Correct ?    72 Yes 9 No
Wonder
 
  Re: What is B+ tree?
Answer
# 2
a B+ tree is a type of tree which represents sorted data in
a way that allows for efficient insertion, retrieval and
removal of records, each of which is identified by a key. It
is a dynamic, multilevel index, with maximum and minimum
bounds on the number of keys in each index segment (usually
called a 'block' or 'node'). In a B+ tree, in contrast to a
B-tree, all records are stored at the lowest level of the
tree; only keys are stored in interior blocks.

The primary value of a B+ tree is in storing data for
efficient retrieval in a block-oriented storage context.
Given a storage system with a block size of b, a B+ tree
which stores a number of keys equal to a multiple of b will
be very efficient when compared to a binary search tree (the
corresponding data structure for non-block-oriented storage
contexts).
 
Is This Answer Correct ?    45 Yes 8 No
Nishant
 
 
 
  Re: What is B+ tree?
Answer
# 3
A B+ tree is a data structure in which records associated
with the search keys are at the leaves of the tree.This
provide efficient retrieval,insertion and removal of
records.Keys are triplicale to the non-leaf nodes to
provide a path to the searched record.
NT file system,JFS2 file system and Rationaldata base often
used this data structure for indices.
 
Is This Answer Correct ?    11 Yes 11 No
Nani
 
  Re: What is B+ tree?
Answer
# 4
In a B+ tree all keys which are in non leaf node will point to
next leaf, So we can traverse sequentially also.
 
Is This Answer Correct ?    11 Yes 3 No
Amit Patra
 
  Re: What is B+ tree?
Answer
# 5
B+ Tree Is a advanced technique of the B tree, this is used
for sorting work or data.
 
Is This Answer Correct ?    4 Yes 2 No
Meenakshi Sen Chouhan
 
  Re: What is B+ tree?
Answer
# 6
In the B+ tree , all keys are maintained in leaves, and
keys are replicated in non leaf nodes to define path for
locating individual records. The leaves are linked together
to provide a sequential path for traversing the keys in the
tree.
 
Is This Answer Correct ?    7 Yes 2 No
Ankita Dey
 

 
 
 
Other Data Structures Interview Questions
 
  Question Asked @ Answers
 
Which one is faster? A binary search of an orderd set of elements in an array or a sequential search of the elements. Syntel22
1) Program A and B are analyzed and found to have worst- case running times no greater than 150nlog2n and n2 respectively.Answer the folloWing questions if possible.. i) which program has the better guarantee on the running time,for larger values of n(n>10000) ? ii) which program has the better guarantee on the running time,for small values of n(n<100) ? iii) which program will run faster on average for n =1000 2) wRite a program to compute the number of collisions required in a long random sequence of insertions using linear probing ,quadratic probing and double hashing 3) what is the optimal way to compute A1 A2 A3 A4 A5 A6 where the dimensions of the matrices are A1:10*20 A2 : 20 * 1 A3 : 1 * 40 A4 : 40*5 A5 : 5 * 30 A6 : 30 X 15 KPIT3
In which data structure, elements can be added or removed at either end, but not in the middle? Wipro41
Q#1: An algorithm is made up of 2 modules M1 and M2.If order of M1 is F(n) and order of M2 is g (n) then what is the order of the algorithm. Q # 2 : How many binary trees are possible with 3 nodes? with 4 nodes?  4
how to find the number of possible tree in the given tree. Wipro12
What data structure would you mostly likely see in a non recursive implementation of a recursive algorithm? CTS3
What are the parts of root node? BMC7
what is AVL tree? ADS5
A list is ordered from smaller to largest when a sort is called. Which sort would take the longest time to execute?  12
Explain about the types of linked lists  5
How would you sort a linked list?  4
I am given a sequential algorithm that does a routine search on an unordered list. N = 20. The probability that the value x does NOT appear in the list is exactly 60%, and the probability that x DOES appear is 40%. The 3 questions that I could not get were: A) What is the avg number of element comparisons performed when n = 20 and x does NOT appear in the List. (my answer was 20, is this correct?) B) What is the avg number of element comparisons peformed when n = 20 and x DOES appear in the list? C) What is the avg number of element comparisons performed when n = 20. This should be a single number answer they said.  3
 
For more Data Structures Interview Questions Click Here 
 
 
 
 
 


   
Copyright Policy  |  Terms of Service  |  Help  |  Site Map 1  |  Articles  |  Site Map  |   Site Map  |  Contact Us interview questions urls   External Links 
   
Copyright © 2012  ALLInterview.com.  All Rights Reserved.

ALLInterview.com   ::  Forum9.com   ::  KalAajKal.com