Data Structure, Data Structure & Algorithms

Ask consider the file name cars.text each line in the file contains information about a car ( year,company,manufacture,model name,type) 1-read the file
2-add each car which is represented using one line of the file to a singular link list .use an object of the following class
class node {
int year;
string company;
string manufacture;
string type;
char owner;
}
3- after creating your list do the following :
a- print how many cars owned by the person (b)?
b- print how many cars are on the file (you need to count the link list nodes ) ?
print every thing about all cares that have been manufactured on 2012 on the a new file called 2012 cares
print all companies name on anew file called company . note do not repeat the company name
print all the cares that has been manufactured by Toyota in a new file called Toyota .note we need to print only the modlename
f- delete the first car in the list that manufactured by Honda and print the file again . name the file Honda
g- delete the last car in the list.print the result in a new file called car Last
h- print the manufacture and the modle name off all trucks in the list print the result in anew file called trucks #Minimum 100 words accepted#
Posted Date: 11/19/2016 4:36:20 AM | Location : Jordan







Related Discussions:- Data Structure, Assignment Help, Ask Question on Data Structure, Get Answer, Expert's Help, Data Structure Discussions

Write discussion on Data Structure
Your posts are moderated
Related Questions
The advantage of list over Arrays is flexibility. Over flood is not a problem until the computer memory is bushed. When the individual record are quite large, it may be difficult t

Write the non-recursive algorithm to traverse a tree in preorder.    The Non- Recursive algorithm for preorder traversal is as follows: Initially  push NULL onto stack and

pls i want a psuedo code for hotel reservation system.

Q. What do you understand by the tree traversal? Write down the procedure for traversing a binary tree in preorder and execute it on the following tree.    Ans: Th

1. Show the effect of each of the following operations on queue q. Assume that y (type Character) contains the character ‘&’. What are the final values of x and success (type boole

After learning this, you will be able to: understand the concept of algorithm; understand mathematical foundation underlying the analysis of algorithm; to understand se

Determine the precondition of a binary search For instance, precondition of a binary search is that array searched is sorted however checking this precondition is so expensive

explain two strategies to implement state charts with the help of an example of each.

Conversion of Forest into Tree A binary tree may be used to show an entire forest, since the next pointer in the root of a tree can be used to point to the next tree of the for

pseudo code for fibonnaci series