1.

Arrays are best data structures(a) For relatively permanent collections of data(b) For the size of the structure and the data in the structure are constantly changing(c) All of the mentioned(d) None of the mentionedI got this question in examination.Question is taken from Application Performance topic in section Database Programming Techniques of Database Management

Answer»

The CORRECT choice is (a) For relatively permanent COLLECTIONS of data

Explanation: The OPERATOR TREE has a tree like format where the evaluation STARTS from root of the tree.



Discussion

No Comment Found

Related InterviewSolutions