ALLInterview.com :: Home Page KalAajKal.com
 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   interview questions urls   External Links  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 ?    1 Yes 1 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 ?    0 Yes 0 No
Nishant
 
 
 

 
 
 
Other Data Structures Interview Questions
 
  Question Asked @ Answers
 
What does abstract data type means? TCS6
What do you mean by Base case, Recursive case, Binding Time, Run-Time Stack and Tail Recursion? TCS1
What is the average number of comparisons in a sequential search?  2
sir plz. send me a bunch of questions related to this topic which may help me in campus selection ABC1
How would you sort a linked list?  2
What data structure would you mostly likely see in a non recursive implementation of a recursive algorithm?  2
A list is ordered from smaller to largest when a sort is called. Which sort would take the shortest time to execute?  8
How is it possible to insert different type of elements in stack?  5
A list is ordered from smaller to largest when a sort is called. Which sort would take the longest time to execute?  4
In which data structure, elements can be added or removed at either end, but not in the middle? Wipro19
When will you sort an array of pointers to list elements, rather than sorting the elements themselves?  2
How will inorder, preorder and postorder traversals print the elements of a tree?  6
Evaluate the following prefix expression " ++ 26 + - 1324" Patni8
What is the average number of comparisons needed in a sequential search to determine the position of an element in an array of 100 elements, if the elements are ordered from largest to smallest? ABB10
Convert the following infix expression to post fix notation ((a+2)*(b+4)) -1  7
Write a Binary Search program  2
Write programs for Bubble Sort, Quick sort  2
Which sort show the best average behavior?  6
What is binary tree? BMC5
What is the maximum total number of nodes in a tree that has N levels? Note that the root is level (zero) Sasken8
 
For more Data Structures Interview Questions Click Here 
 
 
 
 
 
   
Copyright Policy  |  Terms of Service  |  Help  |  Site Map 1  |  Articles  |  Site Map  |   Site Map  |  Contact Us
   
Copyright © 2007  ALLInterview.com.  All Rights Reserved.

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