If less work is involved in searching a element than to sort and then extract, then we don’t go for sort.Is It necessary to sort a file before searching a particular Item ? Right field that contain pointer to node on right side.Ģ5.left field that contain pointer to node on left side.an info field that contains the information stored in the node.Where each node is divided into three parts: It is a collection of data elements called nodes, Whether linked list is linear or non-linear data structure?Īccording to access strategies linked list is a linear one.Īccording to storage linked list is a non-linear one. Sequential is the simplest file structure.Ģ3. Which is the simplest file structure? (sequential, Indexed, Random) but it doesn’t mean that the distance between any two nodes involved in the minimum-spanning tree is minimum.Ģ2. the minimal spanning tree assures that the total weight of the tree is kept at its minimum. does the minimum spanning tree of a graph give the shortest distance between any 2 specified nodes? a minimum spanning tree is a spanning tree organized so that the total edge weight between nodes is minimized.Ģ1. all the nodes of the graph appear on the tree once. this corresponds to the records that shall be stored in leaf nodes.Ī spanning tree is a tree associated with a network. because in b+ tree, all the data is stored only in leaf nodes, that makes searching easier. In Rdbms, What is the efficient data structure used in the internal storage representation?ī+ tree. Open addressing (closed hashing), the methods used include: overflow block.Ĭlosed addressing (open hashing), the methods used include: linked list, binary tree.ġ9. What are the types of collision Resolution techniques and the methods used in each of the type? classify the Hashing functions based on the various methods by which the key value is found.ġ8. this results in the overlapping of values.ġ7. If there is only one entry possible in the bucket, when the collision occurs, there is no way to accommodate the colliding value. What is the bucket size, when the overlapping and collision occur at same time? If the ‘pivotal value’ (or the ‘Height factor’) is greater than 1 or less than -1.ġ6. In an aVl tree, at What condition the balancing is to be done? What is the type of the algorithm used in solving the 8 queens problem?ġ5. Linked list is the suitable efficient data structure.ġ4. In tree construction which is the suitable efficient data structure? (array, linked list, stack, queue) list out few of the applications that make use of multilinked structures?ġ3. the manipulation of arithmetic expression,ġ2.list out few of the application of tree data-structure? What are the methods available in storing sequential files ?ġ1. but no sorting method can be done just using deletion.ġ0. using insertion we can perform insertion sort, using selection we can perform selection sort, using exchange we can perform the bubble sort (and other similar sorting methods). sorting is not possible by using which of the following methods? (Insertion, selection, exchange, deletion) convert the expression ((a + b) * c – (d – e) ^ (f + g)) to equivalent prefix and postfix notations.ĩ. What are the notations used in evaluation of arithmetic expressions using prefix and postfix forms?Ĩ. even when such equivalent iterative procedures are written, explicit stack is to be used.ħ. Recursion makes use of system stack for storing the return addresses of the function calls.Įvery recursive function has its equivalent iterative (non-recursive) function. because of its lIfo (last In first out) property it remembers its ‘caller’ so knows whom to return when the function has to return. What is the data structures used to perform recursion? one queue is used for actual storing of data and another for storing priorities.Ħ. minimum number of queues needed to implement the priority queue? Void pointer is capable of storing pointer to any type as it is a generic pointer type.ĥ. It is not possible to use ordinary pointers for this. The heterogeneous linked list contains different data types in its nodes and we need a link, pointer to connect them. If you are using c language to implement the heterogeneous linked list, What pointer type will you use? What are the major data structures used in the following areas : Rdbms, network data model and Hierarchical data model.Ĥ. List out the areas in which data structures are applied extensively?ģ. advance knowledge about the relationship between data items allows designing of efficient algorithms for the manipulation of data.Ģ. A data structure is a way of organizing data that considers not only the items stored, but also their relationship to each other.
0 Comments
Leave a Reply. |
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |