Data Structure, Data Structure & Algorithms

Assignment Help:
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#

Related Discussions:- Data Structure

General Tree, How to create an General Tree and how to search general tree?...

How to create an General Tree and how to search general tree?

Algorithm, Example of worse case of time

Example of worse case of time

Explain open addressing, Open addressing The easiest way to resolve a c...

Open addressing The easiest way to resolve a collision is to start with the hash address and do a sequential search by the table for an empty location.

Implement a min-heap, Description A heap is an efficient tree-based data...

Description A heap is an efficient tree-based data structure that can be used as a priority queue. Recall that the abstract data type of a priority queue has the following opera

Unification algorithm, i want to write code for unification algorithm with ...

i want to write code for unification algorithm with for pattern matching between two expression with out representing an expression as alist

Doubly linked list, How does operations like insertion, deletion occur?

How does operations like insertion, deletion occur?

Areas of use - sequential files, Sequential files are most frequently utili...

Sequential files are most frequently utilized in commercial batch oriented data processing where there is the concept of a master file on which details are inserted periodically. F

Flowchart, conversion of centrigral to frahenhit

conversion of centrigral to frahenhit

Define the external path length, Define the External Path Length The Ex...

Define the External Path Length The External Path Length E of an extended binary tree is explained as the sum of the lengths of the paths - taken over all external nodes- from

Write Your Message!

Captcha
Free Assignment Quote

Assured A++ Grade

Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!

All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd