L3b_-_List_(4_on_1) - Lecture Overview Lecture 3b List ADT...

Info icon This preview shows pages 1–4. Sign up to view the full content.

View Full Document Right Arrow Icon
Lecture 3b List ADT and its implementations 2 --- 84 [CS1102C AY0708S1 Lecture 3b] Lecture Overview List ADT Specification Implementation for List ADT Array Based Linked List Based Variation of Linked Lists List ADT Your name is not on the guest list! 4 --- 84 [CS1102C AY0708S1 Lecture 3b] List ADT A sequence of items where positional order matter <a 1 , a 2 ,…, a n-1 , a n > Lists are very pervasive in computing e.g. student list, list of events, list of appointments etc The list ADT idx : Position, integer item : Data stored in list, can be any data type List add(idx,item ) remove(idx) retrieve(idx, item) List() getLegnth() isEmpty()
Image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full Document Right Arrow Icon