actually data structure is explaining the structure of the
data that mean how can u organized,store,and done the
operations on the data.language is something different that
is used to interprete the employ and inplement the logic
of data structure to solve any large complex problems with
efficient memory utilization.
suppaose u take the example of linked list that allocates
memory dyanamically and provides the facility of
adding ,inserting, deletintg,retrieving,traversing
searching,sorting and various representation to utilize
memory efficient sloutions of the complex problems. and the
language is used to implement it.

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.

Data Structure is about organizing and managing data in
the memory. It basically deal with memory management i.e
the way of storing data in memory.The data can be Raw
facts

without data structure there is no language.Because using
data structure we can design the OS and every memory storage
can be done bu using data structures.
finally the need of data structure is we can perform
analysis on huge amount of data in a simplified way.

dara structue is organizing data in a efficient manner,if we want to retriew some complex data we can use data stucute......actually data structure is explaining the structure of the
data that mean how can u organized,store,and done the
operations on the data.language is something different that
is used to interprete the employ and inplement the logic
of data structure to solve any large complex problems with
efficient memory utilization.

data structure is the best method for organizing data because
specific data structure are essential ingredient of many efficient programs that possible to manage huge amount of data.

Data Structure is ways to store data, search data, and
retrieve it. It use is to optimize data storage and the
ability to access it. It include things like list and trees.
So, basically some data structures are better for certain
kinds of data. In that it allows you to pull data quicker
faster. Algorithms are based on there speed to access the data.

Let the G be a graph with 100 vertices numbered 1 to 100
Two vertices i and j are adjecnt if | i-j| =8 or | i-j|
=12. The Number of connected components in G is ?

1) Program A and B are analyzed and found to have worst-
case running times no greater than 150nlog2n and n2
respectively.Answer the folloWing questions if possible..
i) which program has the better guarantee on the running
time,for larger values of n(n>10000) ?
ii) which program has the better guarantee on the running
time,for small values of n(n<100) ?
iii) which program will run faster on average for n =1000
2) wRite a program to compute the number of collisions
required in a long random sequence of
insertions using linear probing ,quadratic probing and
double hashing
3) what is the optimal way to compute A1 A2 A3 A4 A5 A6
where the dimensions of the matrices are
A1:10*20 A2 : 20 * 1 A3 : 1 * 40 A4 : 40*5 A5 : 5 * 30
A6 : 30 X 15