Skip to main content

Computer Programming : Introduction to data structure , C Programming


One of  the major applications of computer is data processing. Nowadays computer are widely used in data processing. Data is nothing but a raw fact that is processed to produce the meaningful   information .Data that is to be processed is to be represented  in memory   of computer . In C we can use the name of data types like int , float, char, to represent the data .When an integer and real data is to be processed int and  float serve the purpose respectively. When we go into the depth of data  usage and to represent the real world situation only basic data types like int and float are not enough. So the need of data structures. As data types are being used to represent the data, they are called data structures.

 Data Structures is a mathematical or logical model, which is used to represent the data; i.e. to organize data, modelled to represent the real world situation, to work like a real word application.
Simply speaking, to structure the data type (data type itself being data  Structure) , under a single unit is called as data structure.

Information and Meaning

Basically the raw facts containing numbers, characters, collection of characters are called as ‘data’. Such data must be collected in order to  Process it. The processed data that gives meaning, placed properly
under the respective headings is called as Information. Processed form of the raw facts(data) is called as Information. The data processing is done to place the data in its meaningful format . As mentioned in the 
Introduction part; data structure is important to collect data that is to be Processed to produce meaningful information. Nowadays Information is one of the major important resources of any successful business. With the help of the available information processed through the computer benefits In making proper decisions at various levels of business management. Even information as a resource is placed along with the level of other resources like finance and human. So, understanding the importance of information to be produced from the data processing is necessary in order to see the importance of data structure. Look at the following CASH MEMO of a co-operative store and you will realize the meaning of information . Find out the data part of the information:
In the above information, the entries like 10502,30/01/2004, Shreya  S.Dandin,1145, 1146, Pencil,6,2,3,2.30,12.0,13.80  ect. Have no meaning Unless otherwise they are placed under or after proper heading or label. So they form data for this information .collectively when all these data are placed under proper label or heading they provide meaning. So the Above CASH MEMO is information .Of course to produce such information the raw fact (data) may be collected or processed .In processing either the raw facts collected may be used to calculate the further data and all are part of collected data and the produced data (if any) are placed under proper heading or column to produce information.

Look at the following RESERVATION CUM BAOARDING CARD of Rajasthan State Transport  Corporation and you can realize the meaning of information .You can also find out the data part of the information:




In the above information, the entries like H01040743,  PILE0001704, Deluxe,  Jaipur,  Pilani, 21/02/2004,  16,30,SHREYA, SMRITI,  PRAMOD,  PRASHANT,   VAIBBHAVI,   ANUPAMA,     F,   M,  21,9, 75.00, 450.00 etc. have no meaning unless otherwise they are placed under or after proper heading or label. So they from data for this information. Collectively when all these data are placed under proper label or heading they provide meaning .So the above RESERVATION CUM BOARDING CARD is information . Of course to produce such information the raw fact (data) may be collected or processed.

Comments

Popular posts from this blog

difference between structure and union in C Language

In c language article we will see the difference between union and structure. Both are the user define datatype in c language. See the table which is mentioned below: ASP.NET Video Tutorial Series Structure Union1.The keywordstruct is used to define a structure 1. The keyword union is used to define a union. 2. When a variable is associated with a structure, the compiler allocates the memory for each member. The size of structure is greater than or equal to the sum ofsizes of its members. The smaller members may end with unused slack bytes. 2. When a variable is associated with a union, thecompiler allocates thememory by considering the size of the largest memory. So, size of union is equal to the size of largest member. 3. Each member within a structure is assigned unique storage area of location. 3. Memory allocated is shared by individual members of union. 4. The address of each member will be in ascending order This indicates that memory for each member will start at different offset v…

Difference between Linear search and Binary Search in c language

SQL Video Channel : Download all SQL Video



Binary Search Linear Search Works only on sorted items. such as  1,2,3,4,5,6  etc
Works on sorted as well as unsorted items. 12,4,5,3,2,1 etc Very efficient if the items are sorted Very efficient if the items are less and present in the beginning of the list. such as Suppose your list items are : 12,3,4,5,1 and you want to search 12 number then you get beginning in the list. Works well with arrays and not on linked lists. Works with arrays and linked lists.
Number of comparisons are less More number of comparisons are required if the items are present in the later part of the array or its elements are more.

Memory representation of Linked List Data Structures in C Language

Memory representation of Linked List

             In memory the linked list is stored in scattered cells (locations).The memory for each node is allocated dynamically means as and when required. So the Linked List can increase as per the user wish and the size is not fixed, it can vary.

               Suppose first node of linked list is allocated with an address 1008. Its graphical representation looks like the figure shown below:


      Suppose next node is allocated at an address 506, so the list becomes,



  Suppose next node is allocated with an address with an address 10,s the list become,


The other way to represent the linked list is as shown below:




 In the above representation the data stored in the linked list is “INDIA”, the information part of each node contains one character. The external pointer root points to first node’s address 1005. The link part of the node containing information I contains 1007, the address of next node. The last node …