Storing street addresses with doubly linked lists, Data Structure & Algorithms

Write a C++ program with header and source les to store street addresses using the Doubly Linked List ADT. Modify the Node class from Lab Assignment 3 so that it becomes a node in a Doubly Linked List. All the fields in the address can be maintained as before. Create a header le called AddrDList.h and a C++ le called Ad- drDList.cpp. In the header le, de ne the Node class and declare any functions required to maintain the Doubly Linked List. Refer to the class lecture slides to see what functions you may need. Implement the necessary functions in the AddrDList.cpp le. Create another C++ le called TestAddrDList.cpp. This le should read input from a redirected le or terminal, parse the input commands and call the necessary Linked List functions. The following commands and options are allowed:

1. Insert h

Where

- is a comma separated street address that is inserted at the head of the list.

2. Insert

Where

- addr1 and addr2 are comma separated street addresses. Your program should find the position of the address addr2 in the list and insert addr1 c=b before or c=a after addr2. If addr2 is not found, do nothing.

3. Display

where order will be one of two strings - ftoe or etof. In the case of the former, display all the nodes in the list from the beginning (head) to the end. For the latter, display all the nodes from the end to the beginning (Hint: use the previous pointer ). Each address is separated by a single empty line. If display is called more than once, there is only one empty line between the last address of the first display and the first address of the second display.

4. Delete addr

Where addr is the address to be deleted. If the address is not found, do nothing.

A sample input file will look like this:

insert h 202,West Main Street,Post,TX,79356

insert 203,West Main Street,Post,TX,79356 a 202,West Main Street,Post,TX,79356

insert 204,West Main Street,Post,TX,79356 b 203,West Main Street,Post,TX,79356

display ftoe

Sample output after the display command in the above input example:

Number:202

Street: West Main Street

City: Post

State: TX

Zip:79356

Number:204

Street: West Main Street

City: Post

State: TX

Zip:79356

Number:203

Street: West Main Street

City: Post

State: TX

Zip: 79356

Note that the address in the input le has to be parsed and stored in the different fields (number, street etc.) of the object. Each time your program compares the address stored in the node, it must compare every field.

2 Deliverables

The following les are to be zipped into a single le (with your eraider login name) and uploaded to Blackboard.

1. Source les: The two C++ and one header le. Source and header les must include relevant comments explaining the code.

2. README: Explain in a few lines what each program does and how to compile and run your programs. Also include your own name, eraider login and the date at the top of the le.

Please do not include any other les including executables or Visual Studio Project les. If you use Visual Studio for the assignment, you must first figure out how to redirect input and include command line arguments. Points will be assigned for clean compilation without warnings or errors. If your program does not compile, it fails all test cases by default. Your program will not be graded if the naming conventions specified in this document are not followed.

Posted Date: 2/19/2013 12:03:02 AM | Location : United States







Related Discussions:- Storing street addresses with doubly linked lists, Assignment Help, Ask Question on Storing street addresses with doubly linked lists, Get Answer, Expert's Help, Storing street addresses with doubly linked lists Discussions

Write discussion on Storing street addresses with doubly linked lists
Your posts are moderated
Related Questions
Graph terminologies : Adjacent vertices: Two vertices a & b are said to be adjacent if there is an edge connecting a & b. For instance, in given Figure, vertices 5 & 4 are adj

There are four data type groups:  Integer kepts whole numbers and signed numbers Floating-point Stores real numbers (fractional values). Perfect for storing bank deposit

HLS Colour Model  This model has the double-cone representation shown in Figure 3.40. The three colour parameters in this model are called hue (H), lightness (L), and Saturati

an electrical student designed a circuit in which the impedence in one part of a series circuit is 2+j8 ohms and the impedent is another part of the circuit is 4-j60 ohm mm program

Determine the class invariants- Ruby Ruby has many predefined exceptions classes (like ArgumentError) and new ones can be created easily by sub-classing StandardError, so it's

Tree is a widely used data structure employed for representing several problems. We studied tree like a special case of acyclic graph. Though, rooted trees are most prominent of al

Enumerate the Types in Ruby Ruby is a pure object-oriented language, meaning that all types in Ruby are classes, and each value in a Ruby program is an instance of a class. Thi

Question 1. Explain the different types of traversal on binary tree 2. Explain the Prim's minimum spanning tree algorithm 3. Differentiate fixed and variable storage allo

write an algorithm to insert an element at the beginning of a circular linked list?

Q. Explain that how do we implement two stacks in one array A[1..n] in such a way that neither the stack overflows unless the total number of elements in both stacks together is n.