Written by Dinesh Thakur
A data structure is a way of organizing data that considers not only the items stored, but also their relationship to each other. Advance knowledge about the relationship between data items allows designing of efficient algorithms for the manipulation of data.
Compiler Design, Operating System, Database Management System, Statistical analysis package, Numerical Analysis, Graphics, Artificial Intelligence, Simulation
-
Define Algorithms with suitable example
-
What is data structure? List out the areas in which data structures are applied extensively
-
What is the difference between "calloc(...)" and "malloc(...)"
-
What is difference between malloc()/free() and new/delete
-
Is it better to use malloc() or calloc()
-
You have two pairs : new() and delete() and another pair : alloc() and free(). Explain differences between eg. new() and malloc()
-
What is the Heap
-
What are the various steps to plan Algorithm
-
How will you explain Record and Record Structure
-
What is the difference between realloc() and free()
-
How can we analyse an Algorithm
-
What is the purpose of realloc( )
About Us
Dinesh Thakur is a Columinist and designer with strong passion and founder
of Computer Notes. if you have any ideas or any request me @ Google+
