(b) Suppose Base(AAA) = 300 and w=4 words per memory cell for AAA. (a) Find the number of elements in each array Consider the linear arrays AAA(5:50), BBB (-5:10) and CCC(18). Stack would contain most compile time variables, while heap would contain anything created with malloc or new.Ħ. The stack is smaller, but faster for creating variables, while the heap is limited in size only by how much memory can be allocated. Elements get inserted at one end of a queue and retrieved from the other end of the queue, while the removal and insertion operations for a stack are done at the same end.ĥ.What is the difference between storing data on the heap vs. What is the difference between a queue and a stack?Ī queue is FIFO while a stack Is typically LIFO. But the distance between any two nodes involved in the minimum-spanning tree is not minimum.Ĥ. 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.ģ. All the nodes of the graph appear on the tree for one time. This corresponds to the records that shall be stored in leaf nodes. As in B+ tree, leaf node stores all the data, that’s why the Searching is easier. (j)In RDBMS, what is the efficient data structure used in the internal storage representation?ī+ tree. (i)Write the types of Collision Resolution Techniques and the methods used in each of the type? (h) Differentiate the Hashing Functions based on the various methods by which the key value is found. The manipulation of Arithmetic expression.(g)List out few of the Application of tree data-structure? The methods available in storing sequential files are: (f)What are the methods available in storing sequential files? Even when such equivalent iterative procedures are written, explicit stack is to be used. Recursion uses system stack for storing the return addresses of the function calls. Each and every recursive function has its equivalent iterative 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. (e)What is the data structures used to perform recursion? ( One queue is used for actual storing of data and another for storing priorities.) (d) Minimum number of queues needed to implement the priority queue? Void pointer has the ability 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 includes different data types in its nodes and we need a link, pointer to connect them. (c)If you are using C language to implement the heterogeneous linked list, what pointer type will you use? (b) What are the major data structures used in the following areas : RDBMS, Network data model & Hierarchical data model. The areas where data structures are applied extensively are Important Data Structures Questions and Answersġ.(a) List out the areas in which data structures are applied extensively? In this section, there are lots of Data Structure questions and answers which will surely help to build some basic concepts related to Data Structure. Data structures are the main technique or concept for designing an efficient algorithm. Some data structures are used for some highly specialized application. Different applications used different methodology of arranging or storing data using the Data structures techniques. Introduction : Data structure is the way or concept of storing and organizing data inside a computer. Any type of suggestions will be highly appreciated. You can give your valuable feedback through the comments. Still if it need any improvement please do let us know through the comment section. Questions has been listed after consulting from different technical recruiters and successful candidates. Candidates preparing for different technical interviews, find the latest and most asked Data structures questions and answers in a interview with all the fundamental concepts. Data Structures and Algorithm is considered as one of the important subject for the preparation of any technical interview.
0 Comments
Leave a Reply. |