Question posted by IMLOST

IMLOST from

IMLOST
IMLOST
Rating :No Rating
Questions Asked: 6
Tutorials Posted: 0
 

Questions Posted by IMLOST

1 - 6 of 6
Bounty Status Category Sub-Category Question Due
$5.00 Closed, closed Computer Science Object-Oriented Programming Read Text from Textinput file and create Textoutput file
C++, OOP Write a program that reads a given text file, outputs the text file as is, and also prints the number of lines and the number of times each letter appears in the text file. (To simplify... 		Jan. 16, 2009
$3.00 Closed, closed Computer Science Object-Oriented Programming Division by zero problem
C++, OOP Division by Zero Problem: Create a program titled Division. Have the program prompt the user Enter numerator and denominator and store the two values entered. (If you wish the user to Enter... 		Jan. 16, 2009
$1.00 Closed, closed Computer Science Object-Oriented Programming String Length (Print out in twice the field width)
C++ OOP Write a program that inputs a string from the keyboard and determines the length of the string. Print the string in length that is twice the field width 		Dec. 25, 2008
$1.00 Closed, closed Computer Science Object-Oriented Programming Create Function Template
C++ OOP Create a function template that computes and displays the absolute value of a passed argument. (By absolute value we mean that the template returns the number with no sign, whether the passed... 		Jan. 03, 2009
$5.00 Closed, closed Computer Science Object-Oriented Programming Design a fraction Class
1. Design a fraction class. The class should have 2 data members to represent the numerator and denominator. Both of these numbers should obviously be integers. It should be able to display a... 		Jan. 03, 2009
$1.00 Closed, closed Computer Science Programming Methods 1. Develop the class Polynomial. The int
1. Develop the class Polynomial. The internal representation of a Polynomial is an array of terms. Each term contains a coefficient and an exponent. The term: 2x4 has the coefficient of 2 and the... 		Dec. 21, 2008