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
Consider the digraph G with three vertices P1,P2 and P3 and four directed edges, one each from P1 to P2, P1 to P3, P2 to P3 and P3 to P1. a. Sketch the digraph. b. Find the a

Area Subdivision Method In this method, the viewport is examined for clear decisions on the polygons situated in it, in regard to their overlap and visibility to the viewer. Fo

Explain Dijkstra's algorithm Dijkstra's algorithm: This problem is concerned with finding the least cost path from an originating node in a weighted graph to a destination node

N = number of rows of the graph D[i[j] = C[i][j] For k from 1 to n Do for i = 1 to n Do for j = 1 to n D[i[j]= minimum( d ij (k-1) ,d ik (k-1) +d kj (k-1)

The complexity Ladder: T(n) = O(1). It is called constant growth. T(n) does not raise at all as a function of n, it is a constant. For illustration, array access has this c

In this sorting algorithm, multiple swapping occurs in one pass. Smaller elements move or 'bubble' up to the top of the list, so the name given to the algorithm. In this method,

how to draw a 5 inch square on the screen using * symbol

Linear search is not the most efficient way to search an item within a collection of items. Though, it is extremely simple to implement. Furthermore, if the array elements are arra

Here is a diagram showing similarities between documents; this is an actual set of physics lab assignments from a large university. Each node (square) in the graph is a doc

c++ To calculate the amount to be paid by a customer buying yummy cupcakes for his birth day party