1. Simple Array implementation of lists(seqlist) array i=item Address Content array+i item; Sequential mapping -array+i+1 item;1 Maxsize has to be estimated Find Kth takes o(1)time. Insertion and Deletion not only take o(N time, but also involve a lot of data movements which takes time1. Simple Array implementation of Lists (seqlist) array[ i ] = itemi  MaxSize has to be estimated. Address Content array+i itemi array+i+1 itemi+1 …… …… …… …… Sequential mapping  Find_Kth takes O(1) time.  Insertion and Deletion not only take O(N) time, but also involve a lot of data movements which takes time