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                     Login  |  Sign Up                             Ask Questions on ANYTHING, that arise in your Daily Life at     FORUM9.COM

Categories >> Software >> Operating Systems >> Data Structures        Suggest New Category      Question  Asked @ Answers Views     select   sir plz. send me a bunch of questions related to this topic which may help me in campus selection ABC  1  652 What is B+ tree? BMC   1  3526 What are the parts of root node? BMC  1  1721 What is binary tree? BMC  5  1823 Which one is faster? A binary search of an orderd set of elements in an array or a sequential search of the elements. Syntel   9  5910 Parenthesis are never needed in prefix or postfix expressions. Why?  6  3651 How will inorder, preorder and postorder traversals print the elements of a tree?  5  3284 In which data structure, elements can be added or removed at either end, but not in the middle? Wipro  19  4117 What do you mean by: Syntax Error, Logical Error, Runtime Error?  2  3099 Which data structure is needed to convert infix notations to post fix notations? Fidelity  7  3519 What is the average number of comparisons in a sequential search?  2  2456 Which sort show the best average behavior?  5  3084 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? ABB  10  2521 The element being searched for is not found in an array of 100 elements. What is the average number of comparisons needed in a sequential search to determine that the element is not there, if the elements are completely unordered? Morgan-Stanley  5  2016 When will you sort an array of pointers to list elements, rather than sorting the elements themselves?  2  2448 E-Mail New Answers        Answer Selected Questions      [1]   2   3    Next         Windows Interview Questions     Linux Interview Questions     Unix Interview Questions     Solaris Interview Questions     RTOS Interview Questions     Bulnex Interview Questions     Operating Systems General Concepts Interview Questions     Data Structures Interview Questions     Operating Systems AllOther Interview Questions       Un-Answered Questions    Question Views Asked at   Select   Explain quick sort and merge sort algorithms and derive the time-constraint relation for these. 158 MNB Explain binary searching, Fibinocci search. 604 IBM E-Mail New Answers        Answer Selected Questions

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