ankit894u

[CODE]#include <cstdlib> #include <iostream> #include <string> #include <fstream> #include <sstream> #include <cstring> using namespace std; int main(int argc, char *argv[]) { fstream filestr; for (int i=1; i<=17771;i++) filestr.open ("mv_0000001.txt", fstream::in | fstream::out | fstream::app); filestr.close(); system("PAUSE"); return EXIT_SUCCESS; }[/CODE] guys i m trying to create multiple text files to the …

need to decode and encode the following text=== {Newton’s Law of Software Engineering Law 1: Every Software Engineer continues her/his state of chatting or forwarding mails unless s/he is assigned work by external unbalanced manager. Law 2: The rate of change in the software is directly proportional to the payment …

Using a hash table with eleven locations and the hashing function h(i) = i%11, show the hash table that results when the following integers are inserted in the order given: 26, 42, 5, 44, 92, 59, 40, 36, 12, 60, 80. The collisions are resolved using chaining. int h(int i) …

in want to edit the code in such a way tht the user can enter upto 10 values maximum..need help pls ... [CODE] #include <iostream> #include <iomanip> using namespace std; struct node { int info; struct node* next; }*front,*rear; void enqueue(int elt); int dequeue(); void display(); void main() { int …

[ATTACH]11811[/ATTACH] hey guys can some one pls show me a away to how rite this program...i have made as many attempts as i could...i m not lazy its just tht i donot knw wht to do....i just want to knw how to compute the formula...i knw the other steps...so if …

[ATTACH]11812[/ATTACH] hey guys can some one pls show me a away to how rite this program...i have made as many attempts as i could...i m not lazy its just tht i donot knw wht to do....i just want to knw how to compute the formula...i knw the other steps...so if …

For a given integer n>1, the smallest integer d>1 that divides n is a prime factor. We can find the prime factorization of n if we find d and then replace n by the quotient of n divided by d, repeating this until n becomes 1. Write a program that …

[CODE]#include <iostream> #include <fstream> using namespace std; void PrintError(fstream&, char, bool&); int Conversion(fstream&, char&, bool&); int main() { fstream InFile; char Bit; int Decimal; bool BadBit = false; //Open file to read InFile.open("f:\\Binary.txt",ios::in); //Read the first bit of the number InFile.get(Bit); //continue reading all numbers till the end of file …

[code=cplusplus]#include <iostream> #include <fstream> using namespace std; void PrintError(fstream&, char, bool&); int Conversion(fstream&, char&, bool&); int main() { fstream InFile; char Bit; int Decimal; bool BadBit = false; //Open file to read InFile.open("f:\\Binary.txt",ios::in); //Read the first bit of the number InFile.get(Bit); //continue reading all numbers till the end of file …