java, 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/20/2016 2:05:27 PM | Location : Jordan

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

Write discussion on java
Your posts are moderated
Related Questions

Create main method or a test class that creates 2 Element objects that are neighbours of each other, the first element temperature set at 100, the 2nd at 0 and use an appropriate h

The data structure needed to evaluate a postfix expression is  Stack

By taking an appropriate example explain how a general tree can be represented as a Binary Tree.                                                                    C onversio

Spanning Trees: A spanning tree of a graph, G, refer to a set of |V|-1 edges which connect all vertices of the graph. There are different representations of a graph. They are f

The complexity of searching an element from a set of n elements using Binary search algorithm is   O(log n)

Define data model?  A data model is a collection of conceptual tools for explaning data, data relationships, data semantics and consistency constraints.

Step 1: Choose a vertex in the graph and make it the source vertex & mark it visited. Step 2: Determine a vertex which is adjacent to the source vertex and begun a new search if

Write c++ function to traverse the threaded binary tree in inorder traversal

1. A string s is said to be periodic with a period α, if s is α k for some k > 2. (Note that α k is the string formed by concatenating k times.) A DNA sequence s is called a tand