Data Structures - Unit 2

1.Explain the linked list implementation of list ADT in Detail? 

. Definition for linked list
. Figure for linked list
. Next pointer
. Header or dummy node
. Various operations
• Explanation
• Example figure
• Coding

2. Explain the cursor implementation of linked list? 
. Definition for linked list
. Figure for linked list
. Next pointer
. Header or dummy node
. Various operations
• Explanation
• Example figure
• Coding


3. Explain the various applications of linked list? 
. Polynomical ADT
• Operations
• Coding
• Figure
. Radix Sort
• Explanation
• Example
. Multilist
• Explanation
• Example figure

4. Explain the linked list implementation of stack ADT in detail?
. Definition for stack
. Stack model
. Figure
. Pointer-Top
. Operations
• Coding
• Example figure

5. Explain the array implementation of queue ADT in detail? 
. Definition for stack
. Stack model
. Figure
. Pointer-FRONT, REAR
. Operations
• Coding
• Example figure