Array implementation and linked list as datat structure

1. ARRAY IMPLEMENTATION AND LINKED LIST AS A DATA STRUCTURE PRESENTED BY: AKSHAY WADALKAR

2. An array is a collection of elements of similar datatype. Contiguous memory allocation takes place. An array is a DS in which we can access every element directly using position variable . It is rather an organizational concept. Array elements can be accessed individually. Syntax: datatype nameofarray [dimension]; ARRAY

3. Two types of array- Single dimensional single for loop. Multidimensional nesting of for loop. Types of array

4. Array can be of integer ,character and string. Integer and character array can be implemented by same logic Implementation of string array is quiet different from the two. We can study the array implementation using integer array. Single dimensional array

5. 7 14 32 58 5 8 16 9 23 a[0] i =0 a[1] i =1 a[2] i =2 a[3] i =3 a[4] i =4 a[5] i =5 a[6] i =6 a[7] i =7 a[8] i =8 a[9] i =9 int a[10]={7,1,32,58,0,5,8,16,9,23}; Integer array “a”. It is of dimension 10 (from 0 to 9). Take positing variable i . Its storage will be continuous 20 bytes(2 bytes each). Creation of integer array

6. ALGORITHM FOR INSERTION (1 diamension ) DECLARATION N SIZE OPERATION Repeat for i = 0 to (size-1) arr [ i ]= num end repeat OUTPUT RETURN( arr [ i ])

7. DECLARATION i rows j coloumn OPERATION Repeat for i =0 to (rows-1) Repeat for j=0 to (coloumn-1) Array[ i ][j]=num End repeat End repeat OUTPUT Return(Array[ i ][j]) ALGORITHM FOR INSERTION (2 diamension )

8. No need to declare large number of variables individually. Variables are not scattered in memory , they are stored in contiguous memory. Ease the handling of large no of variables of same datatype. Advantages

9. Rigid structure. Can be hard to add/remove elements. Cannot be dynamically resized in most languages. Memory loss. LIMITATION

10. LINKED LIST AS A DATA STRUCTURE

11. Each element (node) inside a linked list is linked to the previous node and successor (next) node. This allows for more efficient insertion and deletion of nodes . WHAT IS A LINKED LIST? 5 3 14 2 continued

12. Each item has a data part (one or more data members), and a link that points to the next item. One natural way to implement the link is as a pointer; that is, the link is the address of the next item in the list. It makes good sense to view each item as an object, that is, as an instance of a class . We call that class: Node The last item does not point to anything. We set its link member to NULL . This is denoted graphically by a self-loop Definition Details

13. Insert a new item At the head of the list, or At the tail of the list, or Inside the list, in some designated position Search for an item in the list The item can be specified by position, or by some value Delete an item from the list Search for and locate the item, then remove the item, and finally adjust the surrounding pointers Operations on Linked Lists

14. Suppose you want to find the item whose data value is A You have to search sequentially starting from the head item rightward until the first item whose data member is equal to A is found . At each item searched, a comparison between the data member and A is performed. Searching for an Item

15. Since nodes in a linked list have no names, we use two pointers, pre (for previous) and cur (for current). At the beginning of the search, the pre pointer is null and the cur pointer points to the first node. The search algorithm moves the two pointers together towards the end of the list. LOGIC FOR SEARCHING A LINKED LIST

16. ALGORITHM Declaration Current 0 Searching for (current = first; current != NULL; current = current->next ) if ( searchItem == current(data)) return (current); Break Output return (NULL);

17. Example

18. Insertion of an Element at the Head :

19. Node x = new Node(); x.setElement(new String(“Baltimore”)); The following statement is not correct: x.element = new String(“Baltimore”));

20. x.setNext(head); head = x;

21. Deleting an Element at the Head :

22. head = head.getNext();

23. Insertion of an Element at the Tail :

24. Node x = new Node( ); x.setElement(new String(“Baltimore”)); x.setNext(null); tail.setNext(x); tail = x;

25. Deleting an Element at the Tail :

26. should be removed

27. Singly Linked Lists and Arrays

28. CS314 Linked Lists 31 Linked lists are dynamic, they can grow or shrink as necessary Linked lists are non-contiguous; the logical sequence of items in the structure is decoupled from any physical ordering in memory Advantages of linked lists

29. A linked list is a very efficient data structure for sorted list that will go through many insertions and deletions. A linked list is a dynamic data structure in which the list can start with no nodes and then grow as new nodes are needed. A node can be easily deleted without moving other nodes, as would be the case with an array. For example, a linked list could be used to hold the records of students in a school. Each quarter or semester, new students enroll in the school and some students leave or graduate. Applications of linked lists

30. THANK YOU…………….!!!