Chapter 22 custom generic data structure
- 1. Chapter 22 Custom Generic Data Structures Mrs. L. Priya Head & Assistant Professor Sri Kaliswari College (Autonomous)
- 2. Generic Data Structures 01 02 03 04 SELF REFERENTIAL CLASSES DYNAMIC MEMORY ALLOCATION LINKED LISTS STACKS
- 4. Agenda Style SELFREFERENTIAL CLASSES Contains an instance variable that refers to another object of the same class Example Class Node <T> { T data; Node (T data) { /* constructor Body */ } void setData(T data) { } void getData( ) { } void setNext (Node <T> next) { } Node <T > getNext() { } }
- 6. Agenda Style DYNAMICMEMORY ALLOCATION Creating and Maintaining dynamic data structures requires Dynamic Memory Allocation. Obtaining memory space at execution time – for new node. Releasing space – no longer needed. Java performs automatic garbage collection of objects – no longer referenced. Insufficient Memory – OutOfMemoryError is Thrown.
- 7. LINKED LISTS
- 8. Agenda Style LINKEDLISTS Creating and Maintaining dynamic data structures requires Dynamic Memory Allocation. Obtaining memory space at execution time – for new node. Releasing space – no longer needed. Java performs automatic garbage collection of objects – no longer referenced. Insufficient Memory – OutOfMemoryError is Thrown.
- 9. Agenda Style LINKEDLISTS Assignment – 1 Generic Linked List Program in Page No : 908 – 912. Expected Presentation •Explanation for each line •Execution Step for set of input
- 10. STACKS
- 11. Agenda Style STACKS LIFO data structure New nodes can be added and removed from only at the top. Link member in the bottom node – null Primary Methods – push and pop
- 12. Agenda Style STACKS Assignment – 1 Generic Stack Program in Page No : 918 - 920 Expected Presentation •Explanation for each line •Execution Step for set of input
- 13. Any Queries ?