Interested to Buy Any Domain ? << Click Here >> for more details...
Answer Posted / varun
Data Structure is all about organizing and managing data.
Now this data can be Raw, Programmed, Temp. etc. The most
important point that we must note here is that by creating
data structures, we try to solve our complex problem in way
analogous to nature's way of handling things. We try to
create rules we have already seen and then exploit it like
we do in real world. A simple example is the rule of chain
that is analogous to Link List. Its a choice of ease to
compute i a controlled manner.
| Is This Answer Correct ? | 24 Yes | 6 No |
Post New Answer View All Answers
What are the collision resolution methods?
an array of size N in which every number is between 1 and N, determine if there are any duplicates in it. You are allowed to destroy the array if you like. [ I ended up giving about 4 or 5 different solutions for this, each supposedly better than the others ].
How can we remove loops in a linked list? What are the functions of fast and slow pointers?
What are AVL trees?
Define linked list data structure.
write an algorithm to show the procedure of insertion into a b-tree?
Explain the uses of matrix with an example?
Explain what are the types of collision resolution techniques and the methods used in each of the type?
What is ascii sort order?
Name few collections map implementations?
What is basic data structure?
Is quicksort divide and conquer?
What is a spanning tree in data structure?
“int a[] = new int[3]{1, 2, 3}” – This a legal way of defining the arrays?
What are red-black trees?
