Kap) Darshan Unit 1 - Basic Concept of Data Structure Ie often De Se Introduction * Computer is an electronic machine which is used for data processing and manipulation. * Inorder to make computer work we need to know, © Representation of data in computer. © Accessing of data. © How to solve problem step by step. * For doing this task we use data structure. What is Data Structure? * Data structure is a representation of the logical relationship existing between individual elements of data. * It is defined as the way of storing and manipulating data in organized form so that it can be used efficiently, + Data structure study covers the following points: © Amount of memory require to store. © Amount of time require to process. © Representation of data in memory. © Operations performed on that data. «Data Structure have a few features: © They can be decomposed into their component elements. © The arrangement of elements is a feature of the structure that will be affect how each element will be accessed. © Both the arrangement of the elements and the way of they are accessed can be encapsulated. Data and Information * Data is row collection of fact, figure, number, symbol etc. Data is not significant without proper arrangement and interpretation. Collection of data which describe some meaningful action or work is known as information. PROCESS DATA DATA INFORMATION + For example whether condition of each day is data but when it monitoring regularly analyzing and prepare prediction chart is information. 4 | Dept: cE Ds (3330704) Prof. Vishal K. MakwanaKap) Darshan Unit 1 - Basic Concept of Data Structure Fundamental Definitions * Cells: A cell is a memory location, will used to store elements of data items. It can be referred as single bit, byte or group of bytes. + Record: Itis a collection of information about particular item. + Field: A fields is the smallest piece of information that can be referred by programming language. Example: A Record with multiple fields, this type of number of records contains in data file. Employee Number Last Name First Name Field One Record Address city /II PinCode * Key: To search for a record within a data file, you must designate one of the record’s field as a key, © For above example of employee, you choose an employee number as key field to search a specific record of a employee within data file. # Search Key: Every record has a key. The key have you are looking for in search is called search key, Explain different types of Data Structure. + Logical or mathematical model of organizing data is called data structure. PRIMITIVE NON PRIMITIVE. FLOATING ] [easscrn] [omen ] [annay} [usr ] [me ] 2 | Dept: CE Ds (3330704) Prof. Vishal K. Makwanaarshan Unit 1 - Basic Concept of Data Structure Primitive data structures: © Primitive data structures are basic structures and are directly operated upon by machine instruction. iteger, floating point. © Integer ~ It is a data type which allows all values without fraction part we can store all +ve, -ve whole numbers, Floating point — It is a data type which allows fraction part in values. Character ~ It is a data type which allows character value to insert into it. Pointer — It is a data type which is used to store address of the variable. ive data structure: © Data structure, that does not directly operated upon machine level i called non-primitive data structure © Non-primitive data structure which is further divided into Linear and Non-Linear data structure. 8. — array, graph. 1) Linear data structures: © Linear data structures are those data structure in which data items are arranged in a linear sequence by physically or logically or both the ways. array, linked list. "Array ~ An array is a fixed-size sequenced collection of elements of the same data type. No deletion, insertion possible but searching and sorting is faster. "Lists - An ordered set of a variable number of elements. Insertion, deletion can be possible but searching and sorting is slow. "Stack ~ Stack is a data structure in which insertion and deletion operations are performed at one end only. Stack is also called as LIFO. "Queue - Queue is a data structure which permits insertion at one end and deletion at another end. Queue is also called as FIFO. "Linked list — A simple way to represent linear list to expand each node with a link of point to next node, is called linked list. 2) Nonlinear data structure: © Non linear data structures are those data structure in which data items are not arranged ina sequence. graph, tree, "Graph - Graph is a collection of nodes (Information) and connecting edges (Logical relation) between nodes. "Tree - Tree is hierarchical structure where root node have child node and further this hierarchy may be extent up to required level which are logically connected in such a way that there is no loop. struction are Ey 3 | Dept: CE Ds (3330704) Prof. Vishal K. Makwana