Skip to main content

Algorithmic Notation in DataStructure, C Programming

Algorithm is a sequential, finite non-complex step-by-step solution, written in English like statements, to solve a problem. Here we can consider some points about the algorithmic notation, which are helpful in writing algorithms to understand the basic data structure operations clearly. Algorithm writing is first step in implementing the data structure.

1.Name of the algorithm and parameters: Name of the algorithm may be written in capital letters and the name is chosen according to the problem or operation specification. The name may depict the work done by algorithm is called can be given as parameter names immediately followed by name of the algorithm in a pair of parenthesis.
           e.g.     TRAVERSELIST (LIST, SIZE)
                       LINEARSEARCH (LIST, SIZE, ITEM)

The name of algorithm serves the purpose of start for algorithm and it is the heading of algorithm, and further statements of algorithm are written after the heading.
s using any of the programming languages.

 2.Comments: The comments that are necessary to explain the purpose of algorithm or the things used in an algorithm in detail as non-executable statements of a program are written in a pair of square brackets.
            e.g.       LINEARSEARCH (LIST, SIZE, ITEM)
                         [Algorithm to search an ITEM in the LIST of size SIZE].

3.Variable names: The variable names are written in capital letters without any blank spaces within it. Underscore (_) may be used in case of multi-word names to separate the words. The name should start with an alphabet and may have any number of further alphabets or numbers.
            e.g.       LIST, SIZE, ITEM, NUM1, FIRST_NUM etc.
                         Single letter names like I, J, K can be used for index numbers.

4.Assignment operator:  To set the values of a variable an assignment operator—may be used or = sign along with SET and value may be used. In this book—is used.
           e.g. SET COUNT=0, COUNT+1 etc.
           The second type is most commonly used.

5.Input and Output: To input the value of a variable Read: and to output the values of variable Write: are used. The message to be outputted may be placed between single quotes ‘ ‘.
             e.g.   Read:  NUM
                       Write: The Value is’, SUM
                       Write: NUM etc.


6.Sequential statements are written one after the other, usually in separate lines. If two statements are to be written on the same line they may be separated by means of comma,. Arithmetic operators +,-, *, /, % can be used for addition, subtraction, multiplication, division, mod operation respectively, to write arithmetic expressions.
               e.g.   SUM—0; NUM—15
                         SUM—SUM+NUM
                         Write: ‘Sum is’, SUM

7.Selective statements or conditional statements can be written using If-Then:,  If-Then:   Else:. The relational operators >,>=<,<=,<>,= can be used for greater than, greater than or equal, less than, less than or equal, not equal, equal respectively. For logical connection of two conditions AND, OR can be used. NOT can be used to negate the condition.



8.Repetitive or Iterative statements can be written between Repeat For … [Endo For] or Repeat While …[End of While]. Repeat For is used for the purpose of repeating the statements for fixed number of times    where as Repeat while is used to repeat the statements till a condition is true.


9.Exit is used terminate the Algorithm and Return may be used to return a value from the algorithm.

Or   


10.The array elements can be referred by means of the Name of the array and subscript in a pair of square brackets. The fields of a static struct can be referred by means of placing the name of the struct variable, a. (dot) and field name. The fields of a dynamic struct can be referred by means of placing the name of struct variable,        (arrow) and field name. The arrow operator is framed as a combination of – (minus) and > (greater than operators).
           e.g. LIST[1], LIST[I], LIST[J] etc.
                  NODE--->LINK, NODE--->INFO etc.
                  EMP.ENO, EMP.SALARY etc.      

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 …