![]() ![]() The data type of the element may be any valid data type like char, int, float or double. Types of Linear Data Structures are given below: Arrays: An array is a collection of similar type of data items and each data item is called an element of the array. In linear data structures, the elements are stored in non-hierarchical way where each element has the successors and predecessors except the first and last element. Linear Data Structures: A data structure is called linear if all of its elements are arranged in the linear order. The client program uses the data structure through interface only, without getting into the implementation details. Implementation of data structures can be compiled into libraries which can be used by different clients.Ībstraction: Data structure is specified by the ADT which provides a level of abstraction. ![]() once we have implemented a particular data structure, we can use it at any other place. Reusability: Data structures are reusable, i.e. ![]() There are better data structures which can make the search process efficient like ordered array, binary search tree or hash tables. hence, using array may not be very efficient here. In that case, if we organize our data in an array, we will have to search sequentially element by element. For example: suppose, we have some data and we need to perform the search for a perticular record. Advantages of Data StructuresĮfficiency: Efficiency of a program depends upon the choice of data structures. Data is organized to form a data structure in such a way that all items are not required to be searched and required data can be searched instantly. In order to solve the above problems, data structures are used. Multiple requests: If thousands of users are searching the data simultaneously on a web server, then there are the chances that a very large server can be failed during that process Processor speed: To handle very large amout of data, high speed processing is required, but as the data is growing day by day to the billions of files per entity, processor may fail to deal with that much amount of data.ĭata Search: Consider an inventory size of 106 items in a store, If our application needs to search for a particular item, it needs to traverse 106 items every time, results in slowing down the search process. ![]() Need of Data StructuresĪs applications are getting complexed and amount of data is increasing day by day, there may arrise the following problems: Each attribute represents the particular property of that entity.įield: Field is a single elementary unit of information representing the attribute of an entity. Record: Record can be defined as the collection of various data items, for example, if we talk about the student entity, then its name, address, course and marks can be grouped together to form the record for the student.įile: A File is a collection of various records of one type of entity, for example, if there are 60 employees in the class, then there will be 20 records in the related file where each record contains the data about each employee.Īttribute and Entity: An entity represents the class of certain objects. Group Items: Data items which have subordinate data items are called Group item, for example, name of a student can have first name and the last name. Following terminology is used as far as data structures are concernedĭata: Data can be defined as an elementary value or the collection of values, for example, student’s name and its id are the data about the student. Choosing the appropriate data structure for a program is the most difficult task for a programmer. It plays a vitle role in enhancing the performance of a software or a program as the main function of the software is to store and retrieve the user’s data as fast as possible Basic Terminologyĭata structures are the building blocks of any program or the software. Operating System, Compiler Design, Artifical intelligence, Graphics and many more.ĭata Structures are the main part of many computer science algorithms as they enable the programmers to handle the data in an efficient way. Data Structures are widely used in almost every aspect of Computer Science i.e. Some examples of Data Structures are arrays, Linked List, Stack, Queue, etc. Data Structure can be defined as the group of data elements which provides an efficient way of storing and organising data in the computer so that it can be used efficiently. ![]()
0 Comments
Leave a Reply. |