# Data Structure Unit 2 – Array and Linked Lists questions

## Topic : Array & Array Representation (Key Note and Questions)

Key Note:

• An array is a collection of similar type of data (like int, float or char) which is stored in contiguous memory locations.
• A one-dimensional array is a liner array which has only one row and many columns.
• One-dimensional array can be defined as int arr[10]; means this array arr can store 10 integer value column wise.
• Multi-dimensional array is an array of arrays.
• Two-dimensional array can be considered as multidimensional array. Two-dimensional array can be declared as int arr[m][n].
• Where m is number of rows and n is number of columns.
• Multi-dimensional array can be declared as int arr[n][m][o].

## Topic : Linked List (Key Note and Questions)

Key Note:

• Linked List is a linear data structure that stores elements at non-contiguous memory locations.
• Linked List is also dynamic in nature.

## Topic : Singly Linked List (Key Note and Questions)

Key Note:

• Singly Linked List is a unidirectional List where elements can be traversed in only one direction from head to tail
• On Singly Linked List we can perform various operations like list traversal, searching for an element.
• Also we can perform insertion operation on singly linked list like insert element at head, at tail or at particular place.
• Deletion operation on singly linked list like delete at head, at tail or at given particular position.

## Topic: Circular Linked List (Key Note And Questions)

Key Note:

• Circular Linked List is a some modified version of singly linked list.
• In singly linked list last element point to null but in circular last elements point to again first element.
•  On Circular Linked List we can perform various operations like list traversal, searching for an element.
• Also we can perform insertion operation on Circular linked list like insert element at head, at tail or at particular place.
• Deletion operation on Circular linked list like delete at head, at tail or at given particular position.

## Topic: Doubly Linked List or Two Way Linked List (Key Note And Questions)​

Key Note:

• Doubly Linked List is a bi-directional List where elements can be traversed in both back and forth direction from head to tail and back tail to head.
• On Doubly Linked List we can perform various operations like list traversal, searching for an element.
• Also we can perform insertion operation on Doubly linked list like insert element at head, at tail or at particular place.
• Deletion operation on singly linked list like delete at head, at tail or at given particular position.

## Topic: Doubly Circular Linked List (Key Note And Questions)​​

Key Note:

• Doubly Linked List is a bi-directional List  as well as circular means, elements can be traversed in both back and forth direction from head to tail and back tail to head.
• And Instead of pointing last element at null in doubly circular last element points to first node.
• On Doubly Circular Linked List we can perform various operations like list traversal, searching for an element.
• Also we can perform insertion operation on Doubly Circular Linked list like insert element at head, at tail or at particular place.
• Deletion operation on Doubly Circular Linked list like delete at head, at tail or at given particular position.

## Topic: Polynomial Representation

1. Explain the Polynomial representation Using Array.
2. Explain the Polynomial representation Using Linked List.
3. Explain the Addition of Single variable polynomial.
4. Explain the Subtraction of Single variable polynomial.
5. Explain the Multiplications of Single variable polynomial.
6. Explain the Addition of Two variable polynomial.
7. Explain the Subtraction of Two variable polynomial.
8. Explain the Multiplications of Two variable polynomial.
9. Explain the method to represent the polynomial equation using linked list. Write and explain method to add two polynomial equations using linked list.