Data Structures (CS2214) Lecture 3 - List and Iterator PDF
Document Details
Uploaded by Deleted User
Umm Al-Qura University
Tags
Related
- 5.1.4 Abstract Data Structures PDF
- Computer Software Design - Past Paper PDF
- Introduction to Java Programming and Data Structures (2019) by Y. Daniel Liang - PDF
- Heaps and Priority Queues PDF
- Introduction to Java Programming and Data Structures PDF
- A Concise Introduction to Programming Algorithms in Java PDF
Summary
These are lecture notes for a Data Structures class (CS2214) at UMM AL-QURA UNIVERSITY. The lecture covers lists and iterators in Java, including various methods and operations on lists. The notes include tables and diagrams illustrating examples of list operations.
Full Transcript
1 2 java.util.List size(): isEmpty(): get(i): i i [0,size() − 1]. set(i, e): i i [0,size()−1]. add(i, e):...
1 2 java.util.List size(): isEmpty(): get(i): i i [0,size() − 1]. set(i, e): i i [0,size()−1]. add(i, e): i i [0,size()]. remove(i): i i [0,size() − 1]. add(0, A) add(0, B) get(1) set(2, C) add(2, C) add(4, D) remove(1) add(1, D) add(1, E) get(4) add(4, F) set(2, G) get(2) add(0, A) – (A) add(0, B) get(1) set(2, C) add(2, C) A add(4, D) remove(1) 0 add(1, D) add(1, E) get(4) add(4, F) set(2, G) get(2) add(0, A) – (A) add(0, B) – (B, A) get(1) set(2, C) add(2, C) B A add(4, D) remove(1) 0 1 add(1, D) add(1, E) get(4) add(4, F) set(2, G) get(2) add(0, A) – (A) add(0, B) – (B, A) get(1) A (B, A) set(2, C) add(2, C) B A add(4, D) remove(1) 0 1 add(1, D) add(1, E) get(4) add(4, F) set(2, G) get(2) add(0, A) – (A) add(0, B) – (B, A) get(1) A (B, A) set(2, C) “error” (B, A) add(2, C) B A add(4, D) remove(1) 0 1 add(1, D) add(1, E) get(4) add(4, F) set(2, G) get(2) add(0, A) – (A) add(0, B) – (B, A) get(1) A (B, A) set(2, C) “error” (B, A) add(2, C) – (B, A, C) B A C add(4, D) remove(1) 0 1 2 add(1, D) add(1, E) get(4) add(4, F) set(2, G) get(2) add(0, A) – (A) add(0, B) – (B, A) get(1) A (B, A) set(2, C) “error” (B, A) add(2, C) – (B, A, C) B A C add(4, D) “error” (B, A, C) remove(1) 0 1 2 add(1, D) add(1, E) get(4) add(4, F) set(2, G) get(2) add(0, A) – (A) add(0, B) – (B, A) get(1) A (B, A) set(2, C) “error” (B, A) add(2, C) – (B, A, C) B C add(4, D) “error” (B, A, C) remove(1) A (B, C) 0 1 add(1, D) add(1, E) get(4) add(4, F) set(2, G) get(2) add(0, A) – (A) add(0, B) – (B, A) get(1) A (B, A) set(2, C) “error” (B, A) add(2, C) – (B, A, C) B D C add(4, D) “error” (B, A, C) remove(1) A (B, C) 0 1 2 add(1, D) – (B, D, C) add(1, E) get(4) add(4, F) set(2, G) get(2) add(0, A) – (A) add(0, B) – (B, A) get(1) A (B, A) set(2, C) “error” (B, A) add(2, C) – (B, A, C) B E D C add(4, D) “error” (B, A, C) remove(1) A (B, C) 0 1 2 3 add(1, D) – (B, D, C) add(1, E) – (B, E, D, C) get(4) add(4, F) set(2, G) get(2) add(0, A) – (A) add(0, B) – (B, A) get(1) A (B, A) set(2, C) “error” (B, A) add(2, C) – (B, A, C) B E D C add(4, D) “error” (B, A, C) remove(1) A (B, C) 0 1 2 3 add(1, D) – (B, D, C) add(1, E) – (B, E, D, C) get(4) add(4, F) set(2, G) get(2) add(0, A) – (A) add(0, B) – (B, A) get(1) A (B, A) set(2, C) “error” (B, A) add(2, C) – (B, A, C) B E D C add(4, D) “error” (B, A, C) remove(1) A (B, C) 0 1 2 3 add(1, D) – (B, D, C) add(1, E) – (B, E, D, C) get(4) “error” (B, E, D, C) add(4, F) set(2, G) get(2) add(0, A) – (A) add(0, B) – (B, A) get(1) A (B, A) set(2, C) “error” (B, A) add(2, C) – (B, A, C) B E D C F add(4, D) “error” (B, A, C) remove(1) A (B, C) 0 1 2 3 4 add(1, D) – (B, D, C) add(1, E) – (B, E, D, C) get(4) “error” (B, E, D, C) add(4, F) – (B, E, D, C, F) set(2, G) get(2) add(0, A) – (A) add(0, B) – (B, A) get(1) A (B, A) set(2, C) “error” (B, A) add(2, C) – (B, A, C) B E G C F add(4, D) “error” (B, A, C) remove(1) A (B, C) 0 1 2 3 4 add(1, D) – (B, D, C) add(1, E) – (B, E, D, C) get(4) “error” (B, E, D, C) add(4, F) – (B, E, D, C, F) set(2, G) D (B, E, G, C, F) get(2) add(0, A) – (A) add(0, B) – (B, A) get(1) A (B, A) set(2, C) “error” (B, A) add(2, C) – (B, A, C) B E G C F add(4, D) “error” (B, A, C) remove(1) A (B, C) 0 1 2 3 4 add(1, D) – (B, D, C) add(1, E) – (B, E, D, C) get(4) “error” (B, E, D, C) add(4, F) – (B, E, D, C, F) set(2, G) D (B, E, G, C, F) get(2) G (B, E, G, C, F) A 0 1 2 i n A 0 1 2 i n A 0 1 2 i n A 0 1 2 i n A 0 1 2 i n A 0 1 2 i n ▪ ▪ ▪ Algorithm push(o) if t = S.length − 1 then A new array of size … for i 0 to n-1 do A[i] S[i] ▪ S A n n + 1 ▪ S[n-1] o L first(): last(): before(p): after(p): isEmpty(): size(): addFirst(e): addLast(e): addBefore(p,e): addAfter(p, e): set(p, e): remove(p): (8,p) 0 (8,p) 0 (8,p)(5,q) 0 1 (8,p)(5,q) 0 1 (8,p)(3,r)(5,q) 0 1 2 (8,p)(3,r)(5,q) 0 1 2 (8,p)(3,r)(5,q) 0 1 2 (8,p)(3,r)(5,q) 0 1 2 (9,s)(8,p)(3,r)(5,q) 0 1 2 3 (9,s)(8,p)(3,r) 0 1 2 (9,s)(7,p)(3,r) 0 1 2 (9,s)(7,p)(3,r) 0 1 2 p p q p q p p hasNext(): next(): iterator( ): for (ElementType variable : collection) { loopBody // may refer to ”variable” } Iterator iter = collection.iterator(); while (iter.hasNext()) { ElementType variable = iter.next(); loopBody // may refer to ”variable” } 46
