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!
Q. A linear array A is given with lower bound as 1. If address of A[25] is 375 and A[30] is 390, then find address of A[16].
Ans.
Loc (a[k]) = base (a) + w (k-lb)
375 = base (a) + w(25 - 1)
390 = base (a) + w(30 - 1)
375 = x + 24w
390 = x + 29w
15 = 5w
∴ w = 3
∴ x = 375 - 24 *3
x = 375 - 72
x = 303
∴base address is 303 and w = 3.
∴Address of A[16] is
loc = 303+ 3(16-1) = 348.
Explain All-pair shortest-paths problem Given a weighted linked graph (undirected or directed), the all pairs shortest paths problem asks to find the distances (the lengths of
An adjacency matrix representation of a graph cannot having information of : Parallel edges
Define min-heap A min-heap is a complete binary tree in which each element is less than or equal to its children. All the principal properties of heaps remain valid for min-hea
Q. Give the adjacency matrix for the graph drawn below: Ans: Adjacency matrix for the graph given to us
A set s is conveniently shown in a computer store by its characteristic function C(s). This is an array of logical numbers whose ith element has the meaning "i is present in s". As
Ask question #Minima binary search tree is used to locate the number 43 which of the following probe sequences are possible and which are not? explainum 100 words accepted#
tree is graph or not
Q. Draw the structures of complete undirected graphs on one, two, three, four and five vertices also prove that the number of edges in an n vertex complete graph is n(n-1
what algorithms can i use for the above title in my project desing and implmentation of road transport booking system
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