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

Graph, Multilist Representation of graph

Multilist Representation of graph

Full binary trees, Full Binary Trees: A binary tree of height h that had 2...

Full Binary Trees: A binary tree of height h that had 2h -1 elements is called a Full Binary Tree. Complete Binary Trees: A binary tree whereby if the height is d, and all of

Analysis of algorithms, A common person's faith is that a computer can do a...

A common person's faith is that a computer can do anything. It is far from truth. In realism computer can carry out only definite predefined instructions. The formal illustration o

A linear list of elements in which deletion can be done, A linear list of e...

A linear list of elements in which deletion can be done from one end (front) and insertion can take place only at the other end (rear) is called as a   Queue.

Trees, What is AVL Tree? Describe the method of Deletion of a node from and...

What is AVL Tree? Describe the method of Deletion of a node from and AVL Tree ?

Implementation of queue using a singly linked list, Implementation of queue...

Implementation of queue using a singly linked list: While implementing a queue as a single liked list, a queue q consists of a list and two pointers, q.front and q.rear.

Functions for inserting and deleting at either of the end, Q. Develop a rep...

Q. Develop a representation for a list where insertions and deletions can be done at either end. Such a structure is known as a Deque (Double ended queue). Write functions for inse

Explain first - fit method, First - Fit Method: -    The free list is trave...

First - Fit Method: -    The free list is traversed sequentially to search the 1st free block whose size is larger than or equal to the amount requested. Once the block is found it

Average case anaysis, what is the impoartance of average case analysis of ...

what is the impoartance of average case analysis of algorithm

Red black tree, red black tree construction for 4,5,6,7,8,9

red black tree construction for 4,5,6,7,8,9

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