|Idioms and phrases|
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
The heterogeneous linked list contains different data types in its nodes and we need a link, pointer to connect them. It is not possible to use ordinary pointers for this. So we go for void pointer. Void pointer is capable of storing pointer to any type as it is a generic pointer type.
One queue is used for actual storing of data and another for storing priorities.
Because of its LIFO (Last In First Out) property it remembers its ‘caller’ so knows whom to return when the function has to return. Recursion makes use of system stack for storing the return addresses of the function calls.
Every recursive function has its equivalent iterative (non-recursive) function. Even when such equivalent iterative procedures are written, explicit stack is to be used.
Top Aptitude topicsNumbers
Profit & loss
Time & distance
Time & work
Top GK topicsGeneral
Facts & Reasons
Days and years
Top Tech topicsAdobe CQ5
Top Vocabulary topicsSentence completion
Idioms and Phrases
High frequency words
Top ArticlesPig and Hive (Comparison)
Ramanujan Number - 1729
Interesting facts - Set 1
Interesting facts - Set 2
Interesting facts - Set 3
100 facts about tigers