Scribd
Upload
14 views4 pages

Assignment 3 Data Structures

The document outlines Assignment 3 focused on Data Structures, consisting of five tasks. These tasks include implementing a Stack, a Queue using collections.deque, dictionary operations for managing student grades, a singly linked list, and demonstrating set operations. Each task specifies the required methods and functionalities to be implemented.

Uploaded by

Василь Варищук
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
14 views4 pages

Assignment 3 Data Structures

The document outlines Assignment 3 focused on Data Structures, consisting of five tasks. These tasks include implementing a Stack, a Queue using collections.deque, dictionary operations for managing student grades, a singly linked list, and demonstrating set operations. Each task specifies the required methods and functionalities to be implemented.

Uploaded by

Василь Варищук
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 4

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 collections.deque 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 collections.deque 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 collections.deque 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 collections.deque 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 collections.deque 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.

You might also like