1.  Differentiate linear and non-linear data structures.

2. What are the benefits of ADT?

3. When single linked list can be represented as a circular linked list?

4. What are the advantages of linked list?

5. Explain the various operations of the list ADT with examples

6. Write the program for array implementation of lists

7. Write a C program for linked list implementation of list.

8. Explain the operations of singly linked lists

9. Explain the operations of doubly linked lists

10. Explain the operations of circularly linked lists

11. How polynomial manipulations are performed with lists? Explain

the operations

12. Explain the steps involved in insertion and deletion into a singly and doubly linked list.