Question-51. What is the difference between file structure and storage structure?
Answer- The main difference between file structure and storage structure is based on memory area that is being accessed.
• Storage structure: When we deal with the structure that resides in the main memory of the computer system, known as the storage structure. • File structure: When we deal with an auxiliary structure then it is referred as file structures.
Question-52. Which data structures are used with the following areas: RDBMS, Network data model and hierarchical data model?
Answer-
RDBMS uses Array data structure
Network data model uses Graph
Hierarchal data model uses Trees
Question-53.What is a multidimensional array?
Answer- A multidimensional array stores data in multiple indexes. It is used when the storing data that cannot be represented using a single dimensional indexing, such as data representation in a board game, tables with data stored in more than one column.
Question-54. What is a linked list in data structure?
Answer- A linked list is a sequence of nodes in which each node is connected to the node following it. It makes a chain like link of data storage.
Question-55. If you are using C language to implement the heterogeneous linked list, what pointer type should be used?
Answer- The heterogeneous linked list contains different data types, so it is not possible to use ordinary pointers for this. For this work, you have to use a generic pointer type like void pointer because void pointer is capable of storing pointer to any type.
Question-56. How many minimum numbers of queues are needed to implement the priority queue?
Answer- Two queues are needed. One queue is used for actual storing of data and another for storing priorities.
Question-57. Which data structure is used to perform recursion?
Answer- Stack is used to perform recursion because of its LIFO (Last In First Out) property. It knows whom to return when the function has to return.
Question-58. When should you use binary search engine?
Answer- A binary search algorithm is used to search a list when the elements are already in order or sorted. The list starts searching in the middle, if the middle value is not the target search key, it will check to see if it will continue the search on the lower half of the list or the higher half. The split and search will then continue in the same manner.
Question-59. How to reference all the elements in a one-dimension array?
Answer- It can be done by using an indexed loop such that the counter runs from 0 to the array size minus one. By this manner, you can reference all the elements in sequence by using the loop counter as the array subscript.
Question-60. Which notations are used in Evaluation of Arithmetic Expressions using prefix and postfix forms?
Answer- Polish and Reverse Polish notations.