Already have an account? Get multiple benefits of using own account!
Login in your account..!
Remember me
Don't have an account? Create your account in less than a minutes,
Forgot password? how can I recover my password now!
Enter right registered email to receive password!
Step 1: Declare array 'k' of size 'n' i.e. k(n) is an array which stores all the keys of a file containing 'n' records
Step 2: i←0
Step 3: low←0, high←n-1
Step 4: while (low <= high)do
mid = (low + high)/2
if (key=k[mid]) then
write "record is at position", mid+1 //as the array starts from the 0th position
else
if(key < k[mid]) then
high = mid - 1
low = mid + 1
endif
endwhile
Step 5: Write "Sorry, key value not found"
Step 6: Stop
Q. Explain the various memory allocation strategies. Ans. M e m ory Allocation Strategies are given as follow
insertion and deletion in a tree
Ask quapplication of data structure estion #Minimum 100 words accepted#
GIVE TRACE OF BINARY SEARCH ALGORITHM BY USING A SUITABLE EXAMPLE.
The two famous methods for traversing are:- a) Depth first traversal b) Breadth first
Q. Can a Queue be represented by circular linked list with only one pointer pointing to the tail of the queue? Substantiate your answer using an example. A n s . Yes a
Advantages of First in First out (FIFO) Costing Advantages claimed for first in first out (FIFO) costing method are: 1. Materials used are drawn from the cost record in
Diffuse Illumination Diffuse illumination means light that comes from all directions not from one particular source. Think about the light of a grey cloudy day as compared to
QUESTION Explain the following data structures: (a) List (b) Stack (c) Queues Note : your explanation should consist of the definition, operations and examples.
Run time complexity of an algorithm is depend on
Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!
whatsapp: +91-977-207-8620
Phone: +91-977-207-8620
Email: [email protected]
All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd