Assignment 3: Data Structures
### Task 1: Implementing a Stack
- Create a class 'Stack' with push, pop, and is_empty methods.
### Task 2: Implementing a Queue
- Use [Link] to implement a queue with enqueue and dequeue methods.
### Task 3: Dictionary Operations
- Create a dictionary mapping student names to grades.
- Implement functions to add a student, remove a student, and find the highest grade.
### Task 4: Linked List Implementation
- Implement a basic singly linked list with insert and delete methods.
### Task 5: Set Operations
- Write a program demonstrating set operations like union, intersection, and difference.
Assignment 3: Data Structures
### Task 1: Implementing a Stack
- Create a class 'Stack' with push, pop, and is_empty methods.
### Task 2: Implementing a Queue
- Use [Link] to implement a queue with enqueue and dequeue methods.
### Task 3: Dictionary Operations
- Create a dictionary mapping student names to grades.
- Implement functions to add a student, remove a student, and find the highest grade.
### Task 4: Linked List Implementation
- Implement a basic singly linked list with insert and delete methods.
### Task 5: Set Operations
- Write a program demonstrating set operations like union, intersection, and difference.
Assignment 3: Data Structures
### Task 1: Implementing a Stack
- Create a class 'Stack' with push, pop, and is_empty methods.
### Task 2: Implementing a Queue
- Use [Link] to implement a queue with enqueue and dequeue methods.
### Task 3: Dictionary Operations
- Create a dictionary mapping student names to grades.
- Implement functions to add a student, remove a student, and find the highest grade.
### Task 4: Linked List Implementation
- Implement a basic singly linked list with insert and delete methods.
### Task 5: Set Operations
- Write a program demonstrating set operations like union, intersection, and difference.
Assignment 3: Data Structures
### Task 1: Implementing a Stack
- Create a class 'Stack' with push, pop, and is_empty methods.
### Task 2: Implementing a Queue
- Use [Link] to implement a queue with enqueue and dequeue methods.
### Task 3: Dictionary Operations
- Create a dictionary mapping student names to grades.
- Implement functions to add a student, remove a student, and find the highest grade.
### Task 4: Linked List Implementation
- Implement a basic singly linked list with insert and delete methods.
### Task 5: Set Operations
- Write a program demonstrating set operations like union, intersection, and difference.
Assignment 3: Data Structures
### Task 1: Implementing a Stack
- Create a class 'Stack' with push, pop, and is_empty methods.
### Task 2: Implementing a Queue
- Use [Link] to implement a queue with enqueue and dequeue methods.
### Task 3: Dictionary Operations
- Create a dictionary mapping student names to grades.
- Implement functions to add a student, remove a student, and find the highest grade.
### Task 4: Linked List Implementation
- Implement a basic singly linked list with insert and delete methods.
### Task 5: Set Operations
- Write a program demonstrating set operations like union, intersection, and difference.
