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
SiteMap
shows list of All Categories in this site.
Categories
>>
Software
>>
Operating Systems
>>
Data Structures
Suggest New Category
Question
Asked @
Answers
Views
select
A list is ordered from smaller to largest when a sort is called. Which sort would take the shortest time to execute?
8
2806
A list is ordered from smaller to largest when a sort is called. Which sort would take the longest time to execute?
4
1789
How many different binary trees and binary search trees can be made from three nodes that contain the key values 1, 2 & 3?
iGate
9
3255
What is the maximum total number of nodes in a tree that has N levels? Note that the root is level (zero)
Sasken
8
2530
Explain binary searching, Fibinocci search.
IBM
1
866
Explain quick sort and merge sort algorithms and derive the time-constraint relation for these.
MNB
0
295
What do you mean by Base case, Recursive case, Binding Time, Run-Time Stack and Tail Recursion?
TCS
1
1352
What data structure would you mostly likely see in a non recursive implementation of a recursive algorithm?
2
1419
Write the programs for Linked List (Insertion and Deletion) operations
1
1885
How would you sort a linked list?
2
1312
Explain about the types of linked lists
4
1341
Write programs for Bubble Sort, Quick sort
2
1468
Write a Binary Search program
2
957
Stack can be described as a pointer. Explain.
Wipro
1
1813
How is it possible to insert different type of elements in stack?
5
1951
E-Mail New Answers
Answer Selected Questions
Prev
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 binary searching, Fibinocci search.
866
IBM
Explain quick sort and merge sort algorithms and derive the time-constraint relation for these.
295
MNB
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