Let us design a data structure in which we want to store numbers (taking it for simplicity, else it can be anything). We want to minimise the time taken by the following three operations:
Which data structure do you suggest ?
Lorem ipsum dolor sit amet, consectetur adipiscing elites. Nulla convallis egestas rhoncusa. Donec lorem facilisis fermentum sem, ac viverra ante luctus vel. Donec vel mauris quam Proin vestibulum leo eget erat congue interdum. Suspendisse nunc ligula, suscipit vehicula consequat eu.
Lorem ipsum dolor sit amet, consectetur adipisicing elit, sed do eiusmod tempor incididunt ut laboreso et dolore magna aliqua Ut enim ad minim veniam, quis nostrud exercitation ullamco
Cras condimentum a elit eget sagittis. Ut dignissim sapien feugiat purus tristique, vitae aliquet arcu tempor. Nulla facilisi. Integer maximus mi non nulla posuere consectetur. Phasellus erat lectus, ullamcorper nec erat vel, hendrerit hendrerit urna. Curabitur ut tempor lacus. Vivamus mollis, elit vitae maximus imperdiet, nisi nulla fermentum nisi, sed luctus metus dolor ac eros. Nulla cursus venenatis enim, vitae tincidunt justo vulputate a. Sed elementum elit ultrices tellus elementum, et molestie nulla pharetra.
Donec porta ultricies urna, nec faucibus magna dapibus vel. Pellentesque habitant morbi tristique senectus et netus et malesuada fames ac turpis egestas. Etiam varius tortor ut ligula facilisis varius in a leo.
Arrange the below functions in the increasing order of their asymptotic complexity:
A(n) = 2n
B(n) = n3/2
C(n) = n * lg(n)
D(n) = nlg(n)
Continue reading »
What is recursion? What is head-recursion and tail-recursion? Should we use recursive or non-recursive functions? Continue reading »
If you have a byte-addressable memory (i.e every byte in the memory has an address) and an address bus of size 12 (i.e 12 wires in the address bus or 12 bits in the Memory Address Register). How much maximum RAM can you support ? Continue reading »