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. Take an array A[20, 10] of your own. Suppose 4 words per memory cell and the base address of array A is 100. Find the address of A[11, 5] supposed row major storage.
Ans.
A[20, 10]
W = 4 words
Base (A) = 100
A [11, 5] → in row major m x n
loc [ a [i] [j] = base (a) + w [n [i - lbr] + ( j - lbc)]
= 100 + 4 [10 (11) + 5]
= 100 + 4[110+5]
=100 + 115 *4
= 560
representation of links list in memory
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].
Define Spanning Tree A Spanning Tree of a connected graph is its linked acyclic sub graph (i.e., a tree) that having all the vertices of the graph.
What are the languages which support assertions Languages which support assertions often provide different levels of support. For instance, Java has an assert statement which t
RGB Model The RGB model is based on the assumption that any desired shade of colour can be obtained by mixing the correct amounts of red, green, and blue light. The exact hues
In worst case Quick Sort has order O (n 2 /2)
Q. Write down an algorithm to insert a node in the beginning of the linked list. Ans: /* structure containing a link part and link part
Merging two sequence using CREW merge
#question bubble sort..
Define File organization''s and it''s types
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