![]() Examples of Linear Data Structure are Stack and Queue.The possible operations on the linear data structure are: Traversal, Insertion, Deletion, Searching, Sorting and Merging.There are two ways to represent a linear data structure in memory,.A data structure is said to be Linear, if its elements are connected in linear fashion by means of logically or in sequence memory locations.It can be viewed as a large list of records consisting of various fields. File: A file is a collection of logically related information.List: An ordered set containing variable number of elements is called as Lists.Array: An array is a fixed-size sequenced collection of elements of the same data type.A Non-primitive data type is further divided into Linear and Non-Linear data structure. ![]() Examples of Non-primitive data type are Array, List, and File etc.The non-primitive data structures emphasize on structuring of a group of homogeneous or heterogeneous data items.These are derived from primitive data structures.These are more sophisticated data structures.Pointer: A variable that holds memory address of another variable are called pointer.Character: It is a data type which is used for character values.Float: It is a data type which use for storing fractional numbers.Integer: It is a data type which allows all values without fraction part.These data types are available in most programming languages as built in type.Integers, floats, character and pointers are examples of primitive data structures.Primitive data structures have different representations on different computers.Primitive data structures are basic structures and are directly operated upon by machine instructions.Data structure study covers the following pointsÄata Structures are normally classified into two broad categoriesĪ particular kind of data item, as defined by the values it can take, the programming language used, or the operations that can be performed on it.Processing alternatives for information.Data Structure mainly specifies the following four things.It is defined as the way of storing and manipulating data in organized form so that it can be used efficiently.The storage structure representation in auxiliary memory is called as file structure. ![]() ![]()
0 Comments
Leave a Reply. |