Implement a templated library for a doubly-linked list class doubly linked list is made up of Nodes

INSTRUCTIONS TO CANDIDATES

ANSWER ALL QUESTIONS

Implement a templated library for a doubly-linked list class. A doubly linked list is made up of Nodes. Each node contains a value and a pointer to the next element in the sequence as well as to the previous element. You can think of it like the barrel of monkeys below.

Each monkey is a Node with its body the value and its arms the pointers to the next and previous Node.

The way that the Doubly Linked List keeps track of its nodes is through two pointers: head and tail. Head points to the first element in the list and tail points to the last element in the list so you end up with something that looks like 

Your doubly linked list will be templated over the type of element it stores in the Node.

While doubly-linked lists may appear similar to vectors the way that they are stored in memory causes them to have very different performance characteristics.

• Insertion and deletion of elements at both the front and end of a doubly-linked list are very quick while only insertions and deletions at the end of vectors are efficient.
• To access an element in a doubly-linked list you must go through all of the elements that come before it but with a vector the amount of time it takes to access an element is constant

So if you do a lot of removals and insertions a doubly-linked list is probably better but if you do a lot of random element accesses a vector would be superior.

The Classes

Doubly Linked List

• The doubly linked list class.
• You will need to add the members mentioned in the problem description
• Templated over the type of element it stores

Doubly Linked Node

• A Node in the Doubly Linked List Class
• I haven't given you anything here so what you do is up to you but make sure it has at least the members discussed in the problem description
• Templated over the type of value that it stores

Iterators

• All of the iterators you are creating are bidirectional iterators.
• Implementing them will be a little different from what we've covered in class because our container is not indexed based and does not possess an at method. Don't worry though, the implementation is not hard.

Foward iterators

• Doubly Linked List Iterator
• Const Doubly Linked List Iterator
• These iterators move from the start of the list to the end of the list

Reverse iterators

• Reverse Doubly Linked List Iterator
• Const Reverse Doubly Linked List Iterator
• These iterators move from the end of the list to the start of the list
• These iterators behave similarily to std::vector's reverse iterators and I recommend you take a look over the example if you haven't done anything with reverse iterators before.

Exceptions

• The string returned by the what method can contain anything you want it to but make it relevant to the problem that is happening.

Doubly Linked List Error

• A generic exception for representing an error that has occurred when working with a Doubly Linked List
• Inherits from: std::exception
• Thrown by: None

Doubly Linked List Empty Error

• An exception representing that the operation could not be done because the list is empty
• Inherits from: DoublyLinkedLIstError
• Thrown by: DoublyLinkedList::front and DoublyLinkedList::back

Doubly Linked List Out Of Bounds Error

• An exception representing that the operation could not be done because the iterator is out of bounds
• Inherits from: DoublyLinkedLIstError
• Thrown by: operator* in the iterators

Testing

We will once again be using Google Test to test your program.

Attachments:

Related Questions

. Introgramming & Unix Fall 2018, CRN 44882, Oakland University Homework Assignment 6 - Using Arrays and Functions in C

DescriptionIn this final assignment, the students will demonstrate their ability to apply two ma

. The standard path finding involves finding the (shortest) path from an origin to a destination, typically on a map. This is an

Path finding involves finding a path from A to B. Typically we want the path to have certain properties,such as being the shortest or to avoid going t

. Develop a program to emulate a purchase transaction at a retail store. This program will have two classes, a LineItem class and a Transaction class. The LineItem class will represent an individual

Develop a program to emulate a purchase transaction at a retail store. Thisprogram will have two classes, a LineItem class and a Transaction class. Th

. SeaPort Project series For this set of projects for the course, we wish to simulate some of the aspects of a number of Sea Ports. Here are the classes and their instance variables we wish to define:

1 Project 1 Introduction - the SeaPort Project series For this set of projects for the course, we wish to simulate some of the aspects of a number of

. Project 2 Introduction - the SeaPort Project series For this set of projects for the course, we wish to simulate some of the aspects of a number of Sea Ports. Here are the classes and their instance variables we wish to define:

1 Project 2 Introduction - the SeaPort Project series For this set of projects for the course, we wish to simulate some of the aspects of a number of