In c code, fill in the blank#include time.h#include std.pdf
•
0 likes•8 views
In c code, fill in the blank #include #include #include int extraMemoryAllocated; // implement merge sort // extraMemoryAllocated counts bytes of extra memory allocated void mergeSort(int pData[], int l, int r) { } // implement insertion sort // extraMemoryAllocated counts bytes of memory allocated void insertionSort(int* pData, int n) { } // implement bubble sort // extraMemoryAllocated counts bytes of extra memory allocated void bubbleSort(int* pData, int n) { } // implement selection sort // extraMemoryAllocated counts bytes of extra memory allocated void selectionSort(int* pData, int n) { } // parses input file to an integer array int parseData(char *inputFileName, int **ppData) { FILE* inFile = fopen(inputFileName,"r"); int dataSz = 0; *ppData = NULL; if (inFile) { fscanf(inFile,"%d\n",&dataSz); *ppData = (int *)malloc(sizeof(int) * dataSz); // Implement parse data block } return dataSz; } // prints first and last 100 items in the data array void printArray(int pData[], int dataSz) { int i, sz = dataSz - 100; printf("\tData:\n\t"); for (i=0;i<100;++i) { printf("%d ",pData[i]); } printf("\n\t"); for (i=sz;i #include #include int extraMemoryAllocated; // implement merge sort // extraMemoryAllocated counts bytes of extra memory allocated void mergeSort(int pData[], int l, int r) { } // implement insertion sort // extraMemoryAllocated counts bytes of memory allocated void insertionSort(int* pData, int n) { } // implement bubble sort // extraMemoryAllocated counts bytes of extra memory allocated void bubbleSort(int* pData, int n) { } // implement selection sort // extraMemoryAllocated counts bytes of extra memory allocated void selectionSort(int* pData, int n) { } // parses input file to an integer array int parseData(char *inputFileName, int **ppData) { FILE* inFile = fopen(inputFileName,"r"); int dataSz = 0; *ppData = NULL; if (inFile) { fscanf(inFile,"%d\n",&dataSz); *ppData = (int *)malloc(sizeof(int) * dataSz); // Implement parse data block } return dataSz; } // prints first and last 100 items in the data array void printArray(int pData[], int dataSz) { int i, sz = dataSz - 100; printf("\tData:\n\t"); for (i=0;i<100;++i) { printf("%d ",pData[i]); } printf("\n\t"); for (i=sz;i.
Report
Share
Report
Share
Download to read offline
![In c code, fill in the blank
#include
#include
#include
int extraMemoryAllocated;
// implement merge sort
// extraMemoryAllocated counts bytes of extra memory allocated
void mergeSort(int pData[], int l, int r)](https://image.slidesharecdn.com/inccodefillintheblankincludetime-230328111144-91e3bfa0/85/In-c-code-fill-in-the-blank-include-time-h-include-std-pdf-1-320.jpg)
Recommended
implement parseData function implement selection sort, insertion sor.pdf
implement parseData function implement selection sort, insertion sort, bubble sort and merge
sort algorithms in the corresponding functions respectively. Without changing or adding new
functions? #include #include #include int extraMemoryAllocated; // implement merge sort //
extraMemoryAllocated counts bytes of extra memory allocated void mergeSort(int pData[], int l,
int r) { } // implement insertion sort // extraMemoryAllocated counts bytes of memory allocated
void insertionSort(int* pData, int n) { } // implement bubble sort // extraMemoryAllocated
counts bytes of extra memory allocated void bubbleSort(int* pData, int n) { } // implement
selection sort // extraMemoryAllocated counts bytes of extra memory allocated void
selectionSort(int* pData, int n) { } // parses input file to an integer array int parseData(char
*inputFileName, int **ppData) { FILE* inFile = fopen(inputFileName,"r"); int dataSz = 0;
*ppData = NULL; if (inFile) { fscanf(inFile,"%d\n",&dataSz); *ppData = (int
*)malloc(sizeof(int) * dataSz); // Implement parse data block } return dataSz; } // prints first and
last 100 items in the data array void printArray(int pData[], int dataSz) { int i, sz = dataSz - 100;
printf("\tData:\n\t"); for (i=0;i<100;++i) { printf("%d ",pData[i]); } printf("\n\t"); for (i=sz;i.
C programming. For this code I only need to add a function so th.pdf
C programming.
For this code I only need to add a function so that the array of pointers is sorted by the age of the
individual entered.
it must be a function and called in main . That is the only thing needed.
#define _CRT_SECURE_NO_WARNINGS
#include
#include
#define PAUSE system(\"pause\")
typedef struct {
int age;
int weight;
int height;
} STATS;
STATS *makeArrayOfPointers(int );
void loadArray(STATS **array, int *c);
void displayArray(STATS **array, int c);
void saveArray(STATS **array, int count, int size);
STATS **reloadArray(char *, int *count, int *size);
main() {
STATS** array = 0;
int count = 0;
int size = 500;
char reloaded = \'N\';
array = reloadArray(&reloaded, &count, &size);
if(reloaded == \'N\')
array = makeArrayOfPointers(size);
PAUSE;
loadArray(array, &count);
printf(\"** unSorted Array **\ \");
displayArray(array, count);
//sortArray(array, count)
printf(\"** Sorted by Age **\ \");
displayArray(array, count);
saveArray(array, count, size);
PAUSE;
} // end of main
void displayArray(STATS **array, int c) {
int i;
for (i = 0; i < c; i++) {
printf(\"Record[%i] Age is %i.\\t Weight is %i.\\t Height is %i.\ \", i, array[i]->age, array[i]-
>weight, array[i]->height);
}
PAUSE;
} // end displayArray
void loadArray(STATS **array, int *c) {
int value;
int counter = *c;
for (*c; *c < (counter + 4); *c = *c + 1) {
printf(\"\ \ Information for person: %i\ \ \", (*c) + 1);
array[*c] = calloc(1, sizeof(STATS));
printf(\"Enter age: \");
scanf(\"%i\", &value);
array[*c]->age = value;
printf(\"Enter weight: \");
scanf(\"%i\", &value);
array[*c]->weight = value;
printf(\"Enter height: \");
scanf(\"%i\", &value);
array[*c]->height = value;
} // end for
} // end loadArray
STATS *makeArrayOfPointers(int size) {
STATS *result;
result = malloc(sizeof(STATS*) * size);
return result;
} // end makeArrayOfPointers
void saveArray(STATS **array, int count, int size) {
FILE *ptr;
int i;
ptr = fopen(\"c:\\\\myBinFile.bin\", \"wb\");
if (ptr == NULL) {
printf(\"Could not open the file\ \");
PAUSE;
exit(-1);
}
// SAVE THE SIZE OF THE ARRAY
fwrite(&size, sizeof(int), 1, ptr);
// SAVE THE EFFECTIVE SIZE or COUNT
fwrite(&count, sizeof(int), 1, ptr);
// SAVE EACH NODE/ELEMENT in the ARRAY
for (i = 0; i < count; i++) {
fwrite(array[i], sizeof(STATS), 1, ptr);
} // end for
fclose(ptr);
}// end saveArray
STATS **reloadArray(char *result, int *count, int *size) {
STATS **temp = 0;
FILE *ptr;
int i;
*result = \'Y\';
ptr = fopen(\"c:\\\\myBinFile.bin\", \"rb\");
if (ptr == NULL) {
printf(\"Could not open the file\ \");
PAUSE;
*result = \'N\';
}
else {
// Reload the size of the array
fread(size, sizeof(int), 1, ptr);
// Create the Array of Pointers
temp = makeArrayOfPointers(*size);
// Reload the count or effective size variable
fread(count, sizeof(int), 1, ptr);
// Reload the nodes or elements of the array
for (i = 0; i < *count; i++) {
temp[i] = calloc(1, sizeof(STATS));
fread(temp[i], sizeof(STATS), 1, ptr);
}
} // end else
fclose(ptr);
return temp;
}// end reloadAr.
C Programming Project
This document appears to be a student project submission for a post graduate diploma in information technology. It contains two questions and answers involving C programming. Question 1 involves accepting integer values from the user, sorting an array in ascending order, calculating the sum of odd values and number of even values. Question 2 involves reading from a file passed as a command line argument, displaying each word on a new line, counting vowels, occurrences of "the", and copying the file contents to a new file. The code provided implements the specified tasks for each question.
DS Code (CWH).docx
The document discusses various operations on linked lists and arrays in C language like creation, traversal, insertion, deletion etc. It includes code snippets to implement array as an abstract data type, linear and binary search on arrays, creation and traversal of singly linked lists, different ways to insert and delete nodes from linked lists, operations on circular linked lists and basics of doubly linked lists.
Were writing code for a project that dynamically allocates an arra.pdf
We\'re writing code for a project that dynamically allocates an array stack. My other code works,
but my Min(), Max(), and Peek() functions fail. I\'ve provided my code for those functions at the
end of the post.
main.cpp
_________________________________________
#include
#include
#include
#include
#include \"stack.h\"
using namespace std;
int main(int argc, char* argv[])
{
ifstream inputs; // Input file for commands
char op; // Hold operation and optional char input
int value; // Value input from file
string comment; // Holds comment from file
Stack* sPtr = NULL; // Will point to TemplateQ object
// Output usage message if one input file name is not provided
if (argc != 2)
{
cout << \"Usage:\ project03 \ \";
return 1;
}
// Attempt to open input file -- terminate if file does not open
inputs.open(argv[1]);
if (!inputs)
{
cout << \"Error - unable to open input file\" << endl;
return 1;
}
// Input and echo header comment from file
getline(inputs, comment); // Input and echo the comment appearing in the test file
cout << endl << \'#\' << comment << endl;
// Process commands from input file
inputs >> op; // Attempt to input first command
while (inputs)
{
switch (op) // Process operation input from file
{
case \'#\': // Test file comment
getline(inputs, comment); // Input and echo the comment appearing in the test
file
cout << \'#\' << comment << endl;
break;
case \'c\': // Parameterized Constructor
inputs >> value;
cout << endl << \"Stack(\" << value << \")\";
try
{
sPtr = new Stack(value); // Attempt to create a stack object with array size
value
cout << \" -- completed\" << endl;
}
catch ( std::bad_alloc )
{
cout << \"Failed : Terminating now...\" << endl;
return 1;
}
break;
case \'+\': // Push
inputs >> value;
cout << \"Push(\" << value << \") -- \";
try
{
sPtr->Push(value);
cout << \"completed\";
}
catch (StackFull)
{
cout << \"Failed Full Stack\";
}
catch (...)
{
cout << \"operation failed\" << endl;
}
cout << endl;
break;
case \'-\': // Pop
cout << \"Pop() -- \";
try
{
sPtr->Pop();
cout << \"completed\";
}
catch (StackEmpty)
{
cout << \"Failed Empty Stack\";
}
catch (...)
{
cout << \"operation failed\" << endl;
}
cout << endl;
break;
case \'f\': // IsFull
cout << \"IsFull() -- \";
try
{
if (sPtr->IsFull())
cout << \"true\";
else
cout << \"false\";
}
catch ( ... )
{
cout << \"operation failed\";
}
cout << endl;
break;
case \'e\': // IsEmpty
cout << \"IsEmpty() -- \";
try
{
if (sPtr->IsEmpty())
cout << \"true\";
else
cout << \"false\";
}
catch ( ... )
{
cout << \"operation failed\";
}
cout << endl;
break;
case \'m\': // Make Empty
cout << \"MakeEmpty() -- \";
try
{
sPtr->MakeEmpty();
cout << \"completed\" << endl;
}
catch (...)
{
cout << \"operation failed\" << endl;
}
break;
case \'p\': // Print Stack
cout << \"Print() -- \";
sPtr->Print();
break;
case \'t\': // Top of Stack
try
{
cout << \"Top() -- \" << sPtr->Top() << endl;
}
catch (StackEmpty)
{
cout << \"Top() -- Failed Empty Stack\" << endl;
}
catch (...)
{
cout << \"operation failed\" .
#include iostream #include cstring #include vector #i.pdf
#include
#include
#include
#include
#include \"textFile.hpp\"
using namespace std;
void displayHelp();
bool isInteger(const string &s);
bool askSave();
int main(int argc, const char * argv[]) {
int resultCode = 0;
// Convert to a vector.
vector args(argv, argv + argc);
// Process arguments, must be 1 argument, otherwise exit with code 1.
if (args.size() < 2) {
cout << \"Missing command line argument!\" << endl;
cout << \"Usage: ./myEditor \" << endl;
resultCode = 1;
} else {
string fileName = args[1];
textFile dataFile(fileName);
// Check if the file is ok to use, if it is, lets go.
if (!dataFile.checkFile()) {
resultCode = 2;
} else {
// We can now assume the file is good, so we can work with it.
dataFile.loadFile();
// Display some text to help the user.
displayHelp();
// Now get user input.
bool done = false;
string userInput = \"\";
while (!done) {
cout << \"> \";
getline(cin, userInput);
char cmd = tolower(userInput.c_str()[0]);
char cmd2 = \' \';
if (userInput.size() > 1) {
cmd2 = userInput.c_str()[1];
}
// This check makes sure the command format is correct
// so that commands don\'t fire off by mistake.
if (strncmp(&cmd, \" \", 1) != 0 && strncmp(&cmd2, \" \", 1) == 0) {
switch(cmd) {
case \'q\': {
done = true;
break;
}
case \'i\': {
unsigned long lineIndex = dataFile.textLines() + 1;
string newLine;
if (userInput.size() > 1) {
string cmdArg = userInput.substr(2);
lineIndex = stol(cmdArg);
}
cout << to_string(lineIndex) << \"> \";
getline(cin, newLine);
dataFile.insertLine(lineIndex - 1, newLine);
break;
}
case \'d\': {
if (userInput.size() > 1) {
unsigned long lineIndex;
string cmdArg = userInput.substr(2);
lineIndex = stol(cmdArg);
dataFile.removeLine(lineIndex - 1);
}
break;
}
case \'l\': {
for (int x = 0; x < dataFile.textLines(); x++) {
cout << to_string(x + 1) << \"> \" << dataFile.getLine(x) << endl;
}
break;
}
case \'h\': {
displayHelp();
break;
}
case \'s\': {
dataFile.saveFile();
break;
}
}
}
}
// Ask about saving the file before exiting.
bool save = askSave();
if (save) {
dataFile.saveFile();
}
cout << \"Thank you for using myEditor.\" << endl;
}
}
return resultCode;
}
/*
Asks the user if they\'d like to save or not, returns true if they do. Anything
other than \"y\" or \"Y\" will be interpreted as a negative answer.
*/
bool askSave()
{
bool result = false;
string userInput = \"\";
cout << \"Do you wan to save the change? (Y - yes; N - no) \";
getline(cin, userInput);
userInput = tolower(*userInput.c_str());
if (strncmp(userInput.c_str(), \"y\", 1) == 0) {
result = true;
}
return result;
}
/*
Displays help text.
*/
void displayHelp()
{
cout << \"Welcome to my text editor.\" << endl;
cout << \"\\tTo insert text at the end of the file, type \'I\'\" << endl;
cout << \"followed by the text.\" << endl;
cout << \"\\tTo insert text at a certain line number, type \'I\'\" << endl;
cout << \"followed by a space and the desired line number.\" << endl;
cout << \"\\tTo delete a line, type \'D\' followed by a space and the\" << endl;
cou.
COW
The document discusses Copy-On-Write (COW) in C++ to avoid unnecessary object copying. It explains passing by reference/pointer, smart pointers, and introduces COW using an example DataBuffer class. COW shares a single copy of the data between objects until one object needs to modify it, at which point it makes a copy so the objects remain independent. The document shows how to implement COW in DataBuffer and Employee classes using smart pointers, making a backup copy before writing, and rolling back if an exception occurs. It notes COW is best for large objects with many copies but few writes.
source code which create file and write into it
The document contains code snippets in C/C++ programming language for counting the number of lines, words, and characters in a text file. Several programs are presented that use functions like fopen(), fgetc(), getline() to open a file, read it character by character or line by line, and keep track of word, line, and character counts. The counts are then printed out or returned.
Recommended
implement parseData function implement selection sort, insertion sor.pdf
implement parseData function implement selection sort, insertion sort, bubble sort and merge
sort algorithms in the corresponding functions respectively. Without changing or adding new
functions? #include #include #include int extraMemoryAllocated; // implement merge sort //
extraMemoryAllocated counts bytes of extra memory allocated void mergeSort(int pData[], int l,
int r) { } // implement insertion sort // extraMemoryAllocated counts bytes of memory allocated
void insertionSort(int* pData, int n) { } // implement bubble sort // extraMemoryAllocated
counts bytes of extra memory allocated void bubbleSort(int* pData, int n) { } // implement
selection sort // extraMemoryAllocated counts bytes of extra memory allocated void
selectionSort(int* pData, int n) { } // parses input file to an integer array int parseData(char
*inputFileName, int **ppData) { FILE* inFile = fopen(inputFileName,"r"); int dataSz = 0;
*ppData = NULL; if (inFile) { fscanf(inFile,"%d\n",&dataSz); *ppData = (int
*)malloc(sizeof(int) * dataSz); // Implement parse data block } return dataSz; } // prints first and
last 100 items in the data array void printArray(int pData[], int dataSz) { int i, sz = dataSz - 100;
printf("\tData:\n\t"); for (i=0;i<100;++i) { printf("%d ",pData[i]); } printf("\n\t"); for (i=sz;i.
C programming. For this code I only need to add a function so th.pdf
C programming.
For this code I only need to add a function so that the array of pointers is sorted by the age of the
individual entered.
it must be a function and called in main . That is the only thing needed.
#define _CRT_SECURE_NO_WARNINGS
#include
#include
#define PAUSE system(\"pause\")
typedef struct {
int age;
int weight;
int height;
} STATS;
STATS *makeArrayOfPointers(int );
void loadArray(STATS **array, int *c);
void displayArray(STATS **array, int c);
void saveArray(STATS **array, int count, int size);
STATS **reloadArray(char *, int *count, int *size);
main() {
STATS** array = 0;
int count = 0;
int size = 500;
char reloaded = \'N\';
array = reloadArray(&reloaded, &count, &size);
if(reloaded == \'N\')
array = makeArrayOfPointers(size);
PAUSE;
loadArray(array, &count);
printf(\"** unSorted Array **\ \");
displayArray(array, count);
//sortArray(array, count)
printf(\"** Sorted by Age **\ \");
displayArray(array, count);
saveArray(array, count, size);
PAUSE;
} // end of main
void displayArray(STATS **array, int c) {
int i;
for (i = 0; i < c; i++) {
printf(\"Record[%i] Age is %i.\\t Weight is %i.\\t Height is %i.\ \", i, array[i]->age, array[i]-
>weight, array[i]->height);
}
PAUSE;
} // end displayArray
void loadArray(STATS **array, int *c) {
int value;
int counter = *c;
for (*c; *c < (counter + 4); *c = *c + 1) {
printf(\"\ \ Information for person: %i\ \ \", (*c) + 1);
array[*c] = calloc(1, sizeof(STATS));
printf(\"Enter age: \");
scanf(\"%i\", &value);
array[*c]->age = value;
printf(\"Enter weight: \");
scanf(\"%i\", &value);
array[*c]->weight = value;
printf(\"Enter height: \");
scanf(\"%i\", &value);
array[*c]->height = value;
} // end for
} // end loadArray
STATS *makeArrayOfPointers(int size) {
STATS *result;
result = malloc(sizeof(STATS*) * size);
return result;
} // end makeArrayOfPointers
void saveArray(STATS **array, int count, int size) {
FILE *ptr;
int i;
ptr = fopen(\"c:\\\\myBinFile.bin\", \"wb\");
if (ptr == NULL) {
printf(\"Could not open the file\ \");
PAUSE;
exit(-1);
}
// SAVE THE SIZE OF THE ARRAY
fwrite(&size, sizeof(int), 1, ptr);
// SAVE THE EFFECTIVE SIZE or COUNT
fwrite(&count, sizeof(int), 1, ptr);
// SAVE EACH NODE/ELEMENT in the ARRAY
for (i = 0; i < count; i++) {
fwrite(array[i], sizeof(STATS), 1, ptr);
} // end for
fclose(ptr);
}// end saveArray
STATS **reloadArray(char *result, int *count, int *size) {
STATS **temp = 0;
FILE *ptr;
int i;
*result = \'Y\';
ptr = fopen(\"c:\\\\myBinFile.bin\", \"rb\");
if (ptr == NULL) {
printf(\"Could not open the file\ \");
PAUSE;
*result = \'N\';
}
else {
// Reload the size of the array
fread(size, sizeof(int), 1, ptr);
// Create the Array of Pointers
temp = makeArrayOfPointers(*size);
// Reload the count or effective size variable
fread(count, sizeof(int), 1, ptr);
// Reload the nodes or elements of the array
for (i = 0; i < *count; i++) {
temp[i] = calloc(1, sizeof(STATS));
fread(temp[i], sizeof(STATS), 1, ptr);
}
} // end else
fclose(ptr);
return temp;
}// end reloadAr.
C Programming Project
This document appears to be a student project submission for a post graduate diploma in information technology. It contains two questions and answers involving C programming. Question 1 involves accepting integer values from the user, sorting an array in ascending order, calculating the sum of odd values and number of even values. Question 2 involves reading from a file passed as a command line argument, displaying each word on a new line, counting vowels, occurrences of "the", and copying the file contents to a new file. The code provided implements the specified tasks for each question.
DS Code (CWH).docx
The document discusses various operations on linked lists and arrays in C language like creation, traversal, insertion, deletion etc. It includes code snippets to implement array as an abstract data type, linear and binary search on arrays, creation and traversal of singly linked lists, different ways to insert and delete nodes from linked lists, operations on circular linked lists and basics of doubly linked lists.
Were writing code for a project that dynamically allocates an arra.pdf
We\'re writing code for a project that dynamically allocates an array stack. My other code works,
but my Min(), Max(), and Peek() functions fail. I\'ve provided my code for those functions at the
end of the post.
main.cpp
_________________________________________
#include
#include
#include
#include
#include \"stack.h\"
using namespace std;
int main(int argc, char* argv[])
{
ifstream inputs; // Input file for commands
char op; // Hold operation and optional char input
int value; // Value input from file
string comment; // Holds comment from file
Stack* sPtr = NULL; // Will point to TemplateQ object
// Output usage message if one input file name is not provided
if (argc != 2)
{
cout << \"Usage:\ project03 \ \";
return 1;
}
// Attempt to open input file -- terminate if file does not open
inputs.open(argv[1]);
if (!inputs)
{
cout << \"Error - unable to open input file\" << endl;
return 1;
}
// Input and echo header comment from file
getline(inputs, comment); // Input and echo the comment appearing in the test file
cout << endl << \'#\' << comment << endl;
// Process commands from input file
inputs >> op; // Attempt to input first command
while (inputs)
{
switch (op) // Process operation input from file
{
case \'#\': // Test file comment
getline(inputs, comment); // Input and echo the comment appearing in the test
file
cout << \'#\' << comment << endl;
break;
case \'c\': // Parameterized Constructor
inputs >> value;
cout << endl << \"Stack(\" << value << \")\";
try
{
sPtr = new Stack(value); // Attempt to create a stack object with array size
value
cout << \" -- completed\" << endl;
}
catch ( std::bad_alloc )
{
cout << \"Failed : Terminating now...\" << endl;
return 1;
}
break;
case \'+\': // Push
inputs >> value;
cout << \"Push(\" << value << \") -- \";
try
{
sPtr->Push(value);
cout << \"completed\";
}
catch (StackFull)
{
cout << \"Failed Full Stack\";
}
catch (...)
{
cout << \"operation failed\" << endl;
}
cout << endl;
break;
case \'-\': // Pop
cout << \"Pop() -- \";
try
{
sPtr->Pop();
cout << \"completed\";
}
catch (StackEmpty)
{
cout << \"Failed Empty Stack\";
}
catch (...)
{
cout << \"operation failed\" << endl;
}
cout << endl;
break;
case \'f\': // IsFull
cout << \"IsFull() -- \";
try
{
if (sPtr->IsFull())
cout << \"true\";
else
cout << \"false\";
}
catch ( ... )
{
cout << \"operation failed\";
}
cout << endl;
break;
case \'e\': // IsEmpty
cout << \"IsEmpty() -- \";
try
{
if (sPtr->IsEmpty())
cout << \"true\";
else
cout << \"false\";
}
catch ( ... )
{
cout << \"operation failed\";
}
cout << endl;
break;
case \'m\': // Make Empty
cout << \"MakeEmpty() -- \";
try
{
sPtr->MakeEmpty();
cout << \"completed\" << endl;
}
catch (...)
{
cout << \"operation failed\" << endl;
}
break;
case \'p\': // Print Stack
cout << \"Print() -- \";
sPtr->Print();
break;
case \'t\': // Top of Stack
try
{
cout << \"Top() -- \" << sPtr->Top() << endl;
}
catch (StackEmpty)
{
cout << \"Top() -- Failed Empty Stack\" << endl;
}
catch (...)
{
cout << \"operation failed\" .
#include iostream #include cstring #include vector #i.pdf
#include
#include
#include
#include
#include \"textFile.hpp\"
using namespace std;
void displayHelp();
bool isInteger(const string &s);
bool askSave();
int main(int argc, const char * argv[]) {
int resultCode = 0;
// Convert to a vector.
vector args(argv, argv + argc);
// Process arguments, must be 1 argument, otherwise exit with code 1.
if (args.size() < 2) {
cout << \"Missing command line argument!\" << endl;
cout << \"Usage: ./myEditor \" << endl;
resultCode = 1;
} else {
string fileName = args[1];
textFile dataFile(fileName);
// Check if the file is ok to use, if it is, lets go.
if (!dataFile.checkFile()) {
resultCode = 2;
} else {
// We can now assume the file is good, so we can work with it.
dataFile.loadFile();
// Display some text to help the user.
displayHelp();
// Now get user input.
bool done = false;
string userInput = \"\";
while (!done) {
cout << \"> \";
getline(cin, userInput);
char cmd = tolower(userInput.c_str()[0]);
char cmd2 = \' \';
if (userInput.size() > 1) {
cmd2 = userInput.c_str()[1];
}
// This check makes sure the command format is correct
// so that commands don\'t fire off by mistake.
if (strncmp(&cmd, \" \", 1) != 0 && strncmp(&cmd2, \" \", 1) == 0) {
switch(cmd) {
case \'q\': {
done = true;
break;
}
case \'i\': {
unsigned long lineIndex = dataFile.textLines() + 1;
string newLine;
if (userInput.size() > 1) {
string cmdArg = userInput.substr(2);
lineIndex = stol(cmdArg);
}
cout << to_string(lineIndex) << \"> \";
getline(cin, newLine);
dataFile.insertLine(lineIndex - 1, newLine);
break;
}
case \'d\': {
if (userInput.size() > 1) {
unsigned long lineIndex;
string cmdArg = userInput.substr(2);
lineIndex = stol(cmdArg);
dataFile.removeLine(lineIndex - 1);
}
break;
}
case \'l\': {
for (int x = 0; x < dataFile.textLines(); x++) {
cout << to_string(x + 1) << \"> \" << dataFile.getLine(x) << endl;
}
break;
}
case \'h\': {
displayHelp();
break;
}
case \'s\': {
dataFile.saveFile();
break;
}
}
}
}
// Ask about saving the file before exiting.
bool save = askSave();
if (save) {
dataFile.saveFile();
}
cout << \"Thank you for using myEditor.\" << endl;
}
}
return resultCode;
}
/*
Asks the user if they\'d like to save or not, returns true if they do. Anything
other than \"y\" or \"Y\" will be interpreted as a negative answer.
*/
bool askSave()
{
bool result = false;
string userInput = \"\";
cout << \"Do you wan to save the change? (Y - yes; N - no) \";
getline(cin, userInput);
userInput = tolower(*userInput.c_str());
if (strncmp(userInput.c_str(), \"y\", 1) == 0) {
result = true;
}
return result;
}
/*
Displays help text.
*/
void displayHelp()
{
cout << \"Welcome to my text editor.\" << endl;
cout << \"\\tTo insert text at the end of the file, type \'I\'\" << endl;
cout << \"followed by the text.\" << endl;
cout << \"\\tTo insert text at a certain line number, type \'I\'\" << endl;
cout << \"followed by a space and the desired line number.\" << endl;
cout << \"\\tTo delete a line, type \'D\' followed by a space and the\" << endl;
cou.
COW
The document discusses Copy-On-Write (COW) in C++ to avoid unnecessary object copying. It explains passing by reference/pointer, smart pointers, and introduces COW using an example DataBuffer class. COW shares a single copy of the data between objects until one object needs to modify it, at which point it makes a copy so the objects remain independent. The document shows how to implement COW in DataBuffer and Employee classes using smart pointers, making a backup copy before writing, and rolling back if an exception occurs. It notes COW is best for large objects with many copies but few writes.
source code which create file and write into it
The document contains code snippets in C/C++ programming language for counting the number of lines, words, and characters in a text file. Several programs are presented that use functions like fopen(), fgetc(), getline() to open a file, read it character by character or line by line, and keep track of word, line, and character counts. The counts are then printed out or returned.
C-Program Custom Library, Header File, and Implementation FilesI .pdf
C-Program: Custom Library, Header File, and Implementation Files
I have this main.c file:
#include
#include
#include \"stats.h\"
int readGrades(char fileName[], float grades[]);
//Include this function prototype
void WelcomeToTheProgram();
int main()
{
///Declare Variables
char fileName[30];
float grades[1000]; //to store grades
int i, ArrayCount[10] = {0}; //to store histogram counts
/* Rewrite this line */
int num_grades; //for # of grades in file
///Call Intro Comment
WelcomeToTheProgram();
///Enter Filename
printf(\"\ \ \ Enter the data filename: \");
scanf(\"%s\", &fileName);
//Get # of grades in file
num_grades = readGrades(fileName, grades); //get # of grades in file
///Print Results
printf(\"There are %d grades read\ \", num_grades);
printf(\"Mean = %f\ \", mean(grades, num_grades));
printf(\"Variance = %f \ \", variance(grades, num_grades));
printf(\"Maximum = %f \ \", maximum(grades, num_grades));
printf(\"Minumum = %f \ \", minimum(grades, num_grades));
//Call histogram
histogram(grades, ArrayCount, num_grades);
//Print the histogram
printf(\"Grade Histogram\ \");
for (i = 0; i < 10; i++)
{
if (i != 9)
{
printf(\"\ %d %% - %d %%: %d \", i * 10, ((i + 1) * 10) - 1, ArrayCount[i]);
}
else
{
printf(\"\ 90 %% - 100 %%: %d\ \", ArrayCount[i]);
}
}
return 0;
}
///Reads all grades from the file to array
int readGrades(char fileName[], float grades[])
{
FILE *fpin = fopen(fileName, \"r\");
int num_scores = 0;
float value;
if (fpin == NULL)
{
printf(\"Cannot open the file\ \");
exit(0);
}
while ((fscanf(fpin, \"%f\", &value)) != EOF)
{
grades[num_scores] = value;
num_scores++;
}
return num_scores;
}
void WelcomeToTheProgram()
{
printf(\"***Welcome to the Program Which Involves a Custom Library***\");
printf(\"\ The program finds the minimum value, maximum value, mean,\");
printf(\"variance, and a histogram of the grades of data by calling\");
printf(\"implementation files min(), max(), mean(), variance(), and histogram().\ \");
}
But, the only thing that prints is
Enter the data file name: grades.txt
There are 400 grades read.
Then the program just stops, it does not print the min, max, mean, variance, or histogram. Any
ideas? Am I using the custom library wrong, the implementation files (for min, max, mean,
variance, and histogram) all check out with no warnings or errors.
Here is stats.h:
#ifndef STATS_H
#define STATS_H
float minimum(float *grades[], int Size); // NOTE: You need to complete the prototypes
float maximum(float *grades[], int Size);
float mean(float *grades[], int Size);
float variance(float *grades[], int Size);
void histogram(float *grades[], int *ArrayCount, int Size);
#endif // STATS_H
And here is the grades file:
Solution
//stats.h
#ifndef STATS_H
#define STATS_H
float minimum(float grades[], int Size); // NOTE: You need to complete the prototypes
float maximum(float grades[], int Size);
float mean(float grades[], int Size);
float variance(float grades[], int Size);
void histogram(float grades[], int ArrayCount[], int S.
IN C LANGUAGE- I've been trying to finish this program for the last fe.docx
IN C LANGUAGE: I've been trying to finish this program for the last few days, and I'm stuck on one part of it, and I can't figure out what to do.
The goal is to read in a file (separated by commas), put the information into a linked list, and then sort that linked list by either first or last name using function pointers.
Everything I have so far works, aside from the fact that my output is never sorted. I'm doing something wrong with the listSort function, and I don't know what it is.
Can anyone please just take a look at what I have and offer a suggestion or solution? It might not even be an issue with the function itself, but something somewhere else.
I would greatly appreciate it.
Please do not make any changes to the variables in the structs. Month has to be a string, it cannot be an integer.
driver.c:
#include "functions.h"
#include <stdio.h>
#include <stdlib.h>
#include <assert.h>
#include <string.h>
int main(int argc, char* argv[]) {
//creating input and output files
FILE* in = NULL;
FILE* out = NULL;
node_t* head = NULL;
node_t* temp = NULL;
//checking for 4 command line arguments
assert(argc == 4);
//opening input file
in = fopen(argv[1], "r");
assert(in != NULL);
//opening output file
out = fopen(argv[2], "w");
assert(out != NULL);
int sortBy = atoi(argv[4]);
temp = createList(in, &head);
if(sortBy == 1) {
sortList(&head, compare_by_firstname);
}
else if(sortBy == 2) {
sortList(&head, compare_by_lastname);
}
printList(out, temp);
deleteList(&head);
//closing files
fclose(in);
fclose(out);
return 0;
}
functions.c:
#include "functions.h"
#include <stdio.h>
#include <stdlib.h>
#include <assert.h>
#include <string.h>
#include <stdbool.h>
bool isLeapYear(int year) {
if(year % 4 != 0) {
return false;
}
else if(year % 100 != 0) {
return true;
}
else if(year % 400 != 0) {
return false;
}
else {
return true;
}
}
void printBorder(FILE* out)
{
int i = 0;
for(i = 0; i < 80; i++)
fprintf(out,"*");
fprintf(out, "\n");
}
bool checkInvalidDate(node_t *node) {
int year = (int)node->birthday.year;
if(node->birthday.day < 1 || node->birthday.year < 1) {
return true;
}
if(strcmp(node->birthday.month, "February") == 0) {
if(isLeapYear(year)) {
if(node->birthday.day > 29) {
return true;
}
}
else if(node->birthday.day > 28) {
return true;
}
}
else if((strcmp(node->birthday.month, "April") == 0) || (strcmp(node->birthday.month, "June") == 0) ||
(strcmp(node->birthday.month, "September") == 0) || (strcmp(node->birthday.month, "November") == 0)) {
if(node->birthday.day > 30) {
return true;
}
}
else {
if(node->birthday.day > 31) {
return true;
}
}
return false;
}
void add(node_t **node, node_t **head) {
node_t* current = *head;
while(current != NULL) {
//comparing first and last names to check for duplicates; if duplicate the info isn't added to the list
if((strcmp(current->firstName, (*node)->firstName) == 0) && (strcmp(current->lastName, (*node)->lastName) == 0)) {
return;
}
current = current->next;
}
//adding information as a node to the list
(*node.
please navigate to cs112 webpage and go to assignments -- Trees. Th.pdf
please navigate to cs112 webpage and go to assignments --> Trees. This will give you the
directions for the assignment. Please do the last 2 methods in huffman.java called encode() and
decode()
Code is provided below:
HuffmanCoding.java
package huffman;
import java.io.File;
import java.io.FileInputStream;
import java.io.FileOutputStream;
import java.util.ArrayList;
import java.util.Collections;
/**
* This class contains methods which, when used together, perform the
* entire Huffman Coding encoding and decoding process
*
* @author Ishaan Ivaturi
* @author Prince Rawal
*/
public class HuffmanCoding {
private String fileName;
private ArrayList sortedCharFreqList;
private TreeNode huffmanRoot;
private String[] encodings;
/**
* Constructor used by the driver, sets filename
* DO NOT EDIT
* @param f The file we want to encode
*/
public HuffmanCoding(String f) {
fileName = f;
}
/**
* Reads from filename character by character, and sets sortedCharFreqList
* to a new ArrayList of CharFreq objects with frequency > 0, sorted by frequency
*/
public void makeSortedList() {
StdIn.setFile(fileName);
/* Your code goes here */
}
/**
* Uses sortedCharFreqList to build a huffman coding tree, and stores its root
* in huffmanRoot
*/
public void makeTree() {
/* Your code goes here */
}
/**
* Uses huffmanRoot to create a string array of size 128, where each
* index in the array contains that ASCII character's bitstring encoding. Characters not
* present in the huffman coding tree should have their spots in the array left null.
* Set encodings to this array.
*/
public void makeEncodings() {
/* Your code goes here */
}
/**
* Using encodings and filename, this method makes use of the writeBitString method
* to write the final encoding of 1's and 0's to the encoded file.
*
* @param encodedFile The file name into which the text file is to be encoded
*/
public void encode(String encodedFile) {
StdIn.setFile(fileName);
/* Your code goes here */
}
/**
* Writes a given string of 1's and 0's to the given file byte by byte
* and NOT as characters of 1 and 0 which take up 8 bits each
* DO NOT EDIT
*
* @param filename The file to write to (doesn't need to exist yet)
* @param bitString The string of 1's and 0's to write to the file in bits
*/
public static void writeBitString(String filename, String bitString) {
byte[] bytes = new byte[bitString.length() / 8 + 1];
int bytesIndex = 0, byteIndex = 0, currentByte = 0;
// Pad the string with initial zeroes and then a one in order to bring
// its length to a multiple of 8. When reading, the 1 signifies the
// end of padding.
int padding = 8 - (bitString.length() % 8);
String pad = "";
for (int i = 0; i < padding-1; i++) pad = pad + "0";
pad = pad + "1";
bitString = pad + bitString;
// For every bit, add it to the right spot in the corresponding byte,
// and store bytes in the array when finished
for (char c : bitString.toCharArray()) {
if (c != '1' && c != '0') {
System.out.println("Invalid characters in bitstring");
return;
}
if (c .
RightTrianglerightTriangle.cppRightTrianglerightTriangle.cpp.docx
RightTriangle/rightTriangle.cppRightTriangle/rightTriangle.cpp// This file includes implementations for functions of the right
// triangle class.
#include<iostream>
#include<cmath>
usingnamespace std;
#include"rightTriangle.h"
// Default constructor
RightTriangle::RightTriangle()
{
base =0;
height =0;
}
// SET functions (for storing data in private data members)
voidRightTriangle::setHeight(double h)
{
height = h;
}
voidRightTriangle::setBase(double b)
{
base = b;
}
// Calculate length of hypotenuse using
// Pythagorean Theorem
doubleRightTriangle::calcHypotenuse()
{
return sqrt (base * base + height * height);
}
__MACOSX/RightTriangle/._rightTriangle.cpp
RightTriangle/rightTriangle.h
// This file defines the specifications for a class to store
// attributes of a right triangle
class RightTriangle
{
private: // PRIVATE data members
double base;
double height;
public: // PUBLIC member functions
RightTriangle(); // Default constructor
void setHeight(double h); // SET functions
void setBase(double b);
// Calculate length of hypotenuse
double calcHypotenuse();
};
__MACOSX/RightTriangle/._rightTriangle.h
RightTriangle/testTriangle.cppRightTriangle/testTriangle.cpp// This program calculates various parameters of a
// right triangle.
#include<iostream>
usingnamespace std;
#include"rightTriangle.h"
int main()
{
// Declaration
double base,height;
RightTriangle aTriangle;
// Input
cout <<"Enter the base of the triangle: ";
cin >> base;
cout <<"Enter the height of the triangle: ";
cin >> height;
// Move data to object
aTriangle.setBase(base);
aTriangle.setHeight(height);
// Calculations and output
cout << endl;
cout <<"Length of hypotenuse: "
<< aTriangle.calcHypotenuse()<< endl;
return0;
}// end main function
__MACOSX/RightTriangle/._testTriangle.cpp
c++practice3a3b/._rightTriangle.cpp
c++practice3a3b/._rightTriangle.h
c++practice3a3b/._testTriangle.cpp
c++practice3a3b/partList.txt
2345 Snoozle 15.4 29.95
1234 Widget 5.4 9.99
3456 Bludger 9.1 15.49
5678 Zeeter 7.7 1.99
6789 Sub_Tweezer 12.3 5.25
4567 Woofle 3.7 49.79
c++practice3a3b/partMgr.cppc++practice3a3b/partMgr.cpp// This program manages a list of parts.
#include<iostream>
#include<iomanip>
#include<fstream>
usingnamespace std;
// Attributes for one part
struct partInfo
{
int number;
char name[30];
double weight;
double price;
};
constint MAX_LIST_SIZE =100;
// Function prototypes
int menu();
void buildPartsList(partInfo partList[],int& listSize);
void searchParts(partInfo partList[],int numParts);
void listParts(partInfo partList[],int& numParts);
void insertPart(partInfo list[],int& numElems);
void deletePart(partInfo list[],int& numElems);
partInfo getPartInfo();
v ...
Dynamic Memory Allocation.pptx
The document discusses dynamic memory allocation in C programming. It provides details on four main library functions - malloc(), calloc(), free(), and realloc() - that allow dynamic memory allocation. malloc() allocates memory without initialization, calloc() allocates and initializes memory to zero, free() de-allocates previously allocated memory, and realloc() changes the size of previously allocated memory. Examples are given to demonstrate the usage of each function. The document also discusses self-referential structures, bit fields, typedef, scope of variables, and storage classes in C.
Please answer the 4 questions using C- The expected output is shown be.docx
Please answer the 4 questions using C. The expected output is shown below. Thank you!
---------------------------------------------------------------------------------------------------
// Write your name here
// Write the compiler used: Visual studio or gcc
// Reminder that your file name is incredibly important. Please do not change it.
// Reminder that we are compiling on Gradescope using GCC.
// READ BEFORE YOU START:
// You are given a partially completed program that creates a list of game items
like you'd see in a folder.
// Each item has this information: item's name, game's name, type of item, item ID.
// The struct 'itemRecord' holds information of one item. Variety is an enum.
// An array of structs called 'list' is made to hold the list of items.
// To begin, you should trace through the given code and understand how it works.
// Please read the instructions above each required function and follow the
directions carefully.
// You should not modify any of the given code, the return types, or the
parameters. Otherwise, you risk getting compilation errors.
// You are not allowed to modify main().
// You can use string library functions.
// WRITE COMMENTS FOR IMPORANT STEPS IN YOUR CODE.
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#pragma warning(disable: 4996) // for Visual Studio
Only
#define MAX_ITEMS 15
#define MAX_NAME_LENGTH 25
typedef enum { Health = 0, Equip, Etc } itemType; // enum type
struct itemRecord { // struct for item details
char itemName[MAX_NAME_LENGTH];
char gameName[MAX_NAME_LENGTH];
itemType variety;
unsigned int itemID;
};
struct itemRecord list[MAX_ITEMS]; // declare list of items
int count = 0; // the number of items
currently stored in the list (initialized to 0)
// functions already implmented
void flushStdIn();
void executeAction(char);
void save(char* fileName);
void display();
// functions that need implementation:
int add(char* itemName_input,
char* gameName_input,
char* variety_input,
unsigned int idNumber_input); // 10 points
void sort(); // 10 points
int delete(unsigned int idNumber_input); // 10 points
void load(char* fileName); // 10 points
int main()
{
char* fileName = "Item_List.txt";
load(fileName); // load list of items from
file (if it exists). Initially there will be no file.
char choice = 'i'; // initialized to a dummy
value
do
{
printf("\nEnter your selection:\n");
printf("\t a: add a new item\n");
printf("\t d: display item list\n");
printf("\t r: remove an item from list\n");
printf("\t s: sort item list by ID\n");
printf("\t q: quit\n");
choice = getchar();
flushStdIn();
executeAction(choice);
} while (choice != 'q');
save(fileName); // save list of items to file
(overwrites file, if it exists)
return 0;
}
// flush out leftover '\n' characters
void flushStdIn()
{
char c;
do c = getchar();
while (c != '\n' && c != EOF);
}
// ask for details from user for the given selection and perform that action
.
DMA.pptx
The document discusses different types of memory allocation in C programming. It describes implicit and explicit type casting, and the functions used for dynamic memory allocation - malloc(), calloc(), realloc(), and free(). Examples are provided to demonstrate how to allocate and reallocate memory at runtime using these functions. malloc() allocates a single block of memory, calloc() allocates multiple blocks, realloc() changes the size of previously allocated memory, and free() releases the allocated memory.
Data structures
The document contains code snippets related to data structures and pointers in C programming. It includes examples of using pointers to access array elements, dynamically allocating memory using functions like malloc(), calloc(), and realloc(). It also demonstrates writing and reading data from binary files using pointers, structs, and file I/O functions. Additional examples include concatenating files, counting words and characters in a file, and implementing employee records using file operations.
Programming in C
The document discusses various concepts related to arrays, structures, strings, file handling, and command line arguments in C/C++. It defines arrays as a consecutive group of memory locations to store elements of the same data type. Structures are used to group related data of different types. Strings are stored as character arrays ending with a null character. File handling functions like fopen, fclose, fprintf and fscanf are used to open, close and read/write files. Command line arguments can be accessed using argc and argv array in main function.
C
The document discusses various concepts related to arrays, structures, strings, file handling, and command line arguments in C/C++. It defines arrays as a consecutive group of memory locations to store elements of the same data type. Structures are used to group related data of different types. Strings are stored as character arrays ending with a null character. File handling functions like fopen, fclose, fprintf and fscanf are used to open, close and read/write files. Command line arguments can be accessed through the argc and argv parameters in main().
HERE is a C PROGRAM BELOW EVERYTIME I TRY TO RUN IT ON MATRIX IT GI.pdf
Given the exponential function y = (0.5)^x: a. Complete Table 2. Table 2: End behavior of y =
(0.5)x b. As x rightarrow infinity, (0.5)^x rightarrow c. As x rightarrow -infinity, (0.5)^x
rightarrow
Solution
b. As x tends to infinity, (0.5)^x = (1/2)^infinity = 1/(2^infinity) approaches to zero.
Hence answer is 0
c. As x tends to - infinity, (0.5)^x = (1/2)^(-infinity) = 2^infinity approaches to infinity
Hence answer is infinity..
888678123317368915236 #include stdio.h #include stdlib.h.pdf
8886781233
17368915236
#include
#include
int main() {
int i, n, *data , p;
/* get the number of inputs from the user */
printf(\"Enter the number of inputs:\");
scanf(\"%d\", &n);
/* dynamically allocate memory to store i/p values */
data = (int *) malloc(sizeof(int) * n);
/* get the input data from the user */
for (i = 0; i < n; i++) {
printf(\"data[%d]: \", i);
scanf(\"%d\", &data[i]);
}
/* sorts the given numbers */
bubbleSort(data, n ,p );
}
void bubbleSort(int *data, int n , int p) {
int i, temp, k = 1, l,j;
if (n > 0) {
for (i = n; i > 0; i--) {
if (data[i] > data[i - 1])
{
temp = data[i];
data[i] = data[i - 1];
data[i - 1] = temp;
}
if( p = = 0)
{
p++;
l = n;
for ( i = 0 ; i < n ; i++)
{
prinft ( %d, data[i])
}
bubbleSort(data, i - 2 , p );
}
else
{
for ( j = n - 1 ; j < l ; j++)
{
if (data[j] > data[j - 1])
{
temp = data[j];
data[j] = data[j - 1];
data[j - 1] = temp;
}
}
for ( j = 0 ; j < l ; j++)
{
prinft ( %d, data[j])
}
bubbleSort(data, i - 2,p);
}
}
}
return;
}
Solution
8886781233
17368915236
#include
#include
int main() {
int i, n, *data , p;
/* get the number of inputs from the user */
printf(\"Enter the number of inputs:\");
scanf(\"%d\", &n);
/* dynamically allocate memory to store i/p values */
data = (int *) malloc(sizeof(int) * n);
/* get the input data from the user */
for (i = 0; i < n; i++) {
printf(\"data[%d]: \", i);
scanf(\"%d\", &data[i]);
}
/* sorts the given numbers */
bubbleSort(data, n ,p );
}
void bubbleSort(int *data, int n , int p) {
int i, temp, k = 1, l,j;
if (n > 0) {
for (i = n; i > 0; i--) {
if (data[i] > data[i - 1])
{
temp = data[i];
data[i] = data[i - 1];
data[i - 1] = temp;
}
if( p = = 0)
{
p++;
l = n;
for ( i = 0 ; i < n ; i++)
{
prinft ( %d, data[i])
}
bubbleSort(data, i - 2 , p );
}
else
{
for ( j = n - 1 ; j < l ; j++)
{
if (data[j] > data[j - 1])
{
temp = data[j];
data[j] = data[j - 1];
data[j - 1] = temp;
}
}
for ( j = 0 ; j < l ; j++)
{
prinft ( %d, data[j])
}
bubbleSort(data, i - 2,p);
}
}
}
return;
}.
Write a C++ program 1. Study the function process_text() in file.pdf
Write a C++ program
1. Study the function process_text() in file \"text_processing.cpp\". What do the string member
functions find(), substr(), c_str() do?
//text_processing.cpp
#include \"util.h\"
#include \"text_processing.h\"
#include
using namespace std;
int process_text( fstream &ifs, fstream &ofs, char target[] )
{
string replace_str( \"XXX\" ); //hard-coded string for replacement
int tlen = strlen( target ); //string length of target
int max_len = 200; //maximum length of a line
char s[max_len+1];
clear_screen(); //clear the screen
while ( !ifs.eof() ) {
int i2, i1 = 0, len=0;
ifs.getline( s, max_len ); //get one line from file
string str( s ); //construct a string object
i2 = str.find ( target, i1 ); //find target
len = i2 - i1;
if ( i2 > -1 && len > 0 ){ //if target found
print_text( str.substr( i1, i2 ).c_str() ); //print up to target
ofs << str.substr( i1, i2 );
}
while ( i2 > -1 ) {
print_text_inverse ( target ); //highlight target
ofs << replace_str;
i1 = i2 + tlen; //new search position
i2 = str.find ( target, i1 ); //find next target
len = i2 - i1;
if ( i2 > -1 && len > 0 ){ //found target
print_text( str.substr( i1, len ).c_str() ); //print up to target
ofs << str.substr( i1, len );
}
}
len = str.length() - i1;
if ( len > 0 ) { //print the remainder
print_text( str.substr( i1, len ).c_str() );
ofs << str.substr( i1, len );
}
ofs << endl;
getnstr( s, 1 ); //prompt for
} //while ( !ifs.eof() )
restore_screen(); //restore the old screen
return 1;
}
//text_processing.h
#ifndef TEXT_PROCESSING_H
#define TEXT_PROCESSING_H
#include
#include
using namespace std;
int process_text( fstream &ifs, fstream &ofs, char target[] );
#endif
//util.h
#ifndef UTIL_H
#define UTIL_H
#include
#include
#include
#include
#include
using namespace std;
void usage ( char program_name[] );
void clear_screen();
void print_text( const char *s );
void print_text_inverse( const char *s );
void get_input_text( char *s, int max_len );
void restore_screen();
#endif
//util.cpp
#include \"util.h\"
void usage ( char program_name[] )
{
cout << \"Usage: \" << program_name << \" infile outfile search_string\" << endl;
return;
}
/*
The following are some curses functions. You can find
the details by the command \"man ncurses\". But its use
can be transparent to you.
*/
void clear_screen()
{
initscr();
scrollok ( stdscr, true ); //allow window to scroll
}
void print_text ( const char *s )
{
printw(\"%s\", s );
refresh();
}
void print_text_inverse( const char *s )
{
attron( A_REVERSE );
printw(\"%s\", s );
attroff( A_REVERSE );
refresh();
}
void get_input_text( char *s, int max_len )
{
getnstr( s, max_len );
}
void restore_screen()
{
endwin();
}
//str_main.cpp
#include \"util.h\"
#include \"text_processing.h\"
#include
using namespace std;
/*
Note that grace_open() must be defined in same file
as main(), otherwise the destructor of fstream will
automatically close the opened file as it finds that
its out of scope upon exiting the function.
*/
int grace_open( char *s, fst.
MAINCPP include ltiostreamgt include ltstringgt u.pdf
MAIN.CPP
#include <iostream>
#include <string>
using namespace std;
#include "bstree.h"
// Prints a single string, used by FSTree::inorder to print all
// values in the tree in correct order.
void print_string (string s) { cout << s << endl; }
// Prints a single string preceeded by a number of hyphens, used by
// BSTree::preorder to print a visual representation of the tree.
void print_string_depth (string s, int n) {
for (int i = 0; i < n; i++)
cout << '-';
cout << s << endl;
}
int main () {
// Create a binary search tree.
BSTree<string> t;
// Insert some strings for testing.
t.insert("dog");
t.insert("bird");
t.insert("cat");
t.insert("turtle");
t.insert("giraffe");
t.insert("snake");
t.insert("deer");
t.insert("groundhog");
t.insert("horse");
// Output the values stored in the tree.
cout << "Values stored in the tree are:n";
t.inorder(print_string);
cout << "n";
cout << "The structure of the tree is as follows:n";
t.preorder(print_string_depth);
cout << "n";
}
BSTREE.h
#pragma once
// A Binary Search Tree implementation.
template <typename T>
class BSTree {
private:
// A node in the tree. Each node has pointers to its left and right nodes
// as well as its parent. When a node is created, the parent and data item
// must be provided.
class node {
public:
T data;
node* left;
node* right;
node* parent;
node (const T& d, node* p) {
parent = p;
data = d;
left = right = nullptr;
}
};
// Pointer to the root node. Initially this is null for an empty tree.
node* root;
// Copy the subtree of another BSTree object into this object. Used by
// the copy constructor and assignment operator.
void copy (node* p) {
if (p) { // If p points to a node...
insert(p->data); // Insert data item
copy(p->left); // Copy the left subtree
copy(p->right); // Copy the right subtree
}
}
// Destroy a node and all nodes in both subtrees. Called by the
// destructor.
void destroy (node* p) {
if (p) { // If p is not null...
destroy(p->left); // Destroy the left subtree
destroy(p->right); // Destroy the right subtree
delete p; // Destroy the node
}
}
// Helper function to determine if a data value is contained in the tree.
// Takes the data value being searched and a pointer to the node in the
// tree. Returns pointer to node in which data item is found, a null
// pointer otherwise.
node* find (const T& d, node* p) const {
// Given: p is a pointer to an existing node
if (d == p->data) // Is this the value we're looking for?
return p;
if (d < p->data) // Check left side, if null then not found
return p->left ? find(d, p->left) : nullptr;
return p->right ? find(d, p->right) : nullptr; // Check right side...
}
// Helper function to insert a data item into the tree. Takes the data
// and a pointer to a node in the tree. Recursively decends down the tree
// until position were insertion should take place is found.
void insert (const T& d, node* p) {
// Given: p is a pointer to an existing node (root of a subtree)
if (d < p->data) { // Insert into left subtree?
if (p->left) // Left.
DS UNIT3_LINKED LISTS.docx
A linked list is a linear data structure consisting of nodes that are connected to each other. Each node contains data and a pointer to the next node. The first node is referenced by the head pointer and the last node points to NULL. Linked lists can be singly, doubly, or circularly linked. A singly linked list is represented by a struct containing an integer data field and a pointer to the next node. Memory for nodes is dynamically allocated using functions like malloc() and freed using free().
num.txt(Save this file under D Drive.Then the path of the file is D.pdf
num.txt(Save this file under D Drive.Then the path of the file is D:\\\ um.txt)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
CPP Code
#include
#include
using namespace std;
//Declaring Global variable
int sum=0;
//Function declarations
void readFromFile();
void writeToFile();
/* Function implementation which will
* read the numbers from the file and calculates the sum of
* the numbers which are multiples of 2 or 5
*/
void readFromFile()
{
int number,sum=0;
//fileInput reference
ifstream dataIn;
//Opening input file
dataIn.open(\"D:\\\ um.txt\");
while(dataIn>>number)
{
if(number%2==0 || number%5==0)
{
sum+=number;
}
}
//closing the input stream
dataIn.close();
}
/* Function implementation which will
* display the sum into another text file
*/
void writeToFile()
{
//fileoutput reference
ofstream myfile;
//Opening the file
myfile.open (\"D:\\\ um1.txt\");
//Writing the contents to the file
myfile <<\"The Sum of Multiples of 2 or 5 is :\"<
Solution
num.txt(Save this file under D Drive.Then the path of the file is D:\\\ um.txt)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
CPP Code
#include
#include
using namespace std;
//Declaring Global variable
int sum=0;
//Function declarations
void readFromFile();
void writeToFile();
/* Function implementation which will
* read the numbers from the file and calculates the sum of
* the numbers which are multiples of 2 or 5
*/
void readFromFile()
{
int number,sum=0;
//fileInput reference
ifstream dataIn;
//Opening input file
dataIn.open(\"D:\\\ um.txt\");
while(dataIn>>number)
{
if(number%2==0 || number%5==0)
{
sum+=number;
}
}
//closing the input stream
dataIn.close();
}
/* Function implementation which will
* display the sum into another text file
*/
void writeToFile()
{
//fileoutput reference
ofstream myfile;
//Opening the file
myfile.open (\"D:\\\ um1.txt\");
//Writing the contents to the file
myfile <<\"The Sum of Multiples of 2 or 5 is :\"<.
finalprojtemplatev5finalprojtemplate.gitignore# Ignore the b
finalprojtemplatev5/finalprojtemplate/.gitignore
# Ignore the build directory
build
# Ignore any executables
bin/*
# Ignore Mac specific files
.DS_Store
finalprojtemplatev5/finalprojtemplate/Makefile
# Script adapted from https://hiltmon.com/blog/2013/07/03/a-simple-c-plus-plus-project-structure/
CC := /usr/local/classes/eecs/spring2021/cs472/public/gcc/bin/g++
STRIPUTIL = strip
SRCDIR = src
BUILDDIR = build
TARGET = bin/cache_sim
# Handle debug case
DEBUG ?= 1
ifeq ($(DEBUG), 1)
CFLAGS += -g -Wall
else
CFLAGS += -DNDEBUG -O3
endif
SRCEXT = cpp
SOURCES = $(shell find $(SRCDIR) -type f -name *.$(SRCEXT))
OBJECTS = $(patsubst $(SRCDIR)/%,$(BUILDDIR)/%,$(SOURCES:.$(SRCEXT)=.o))
LDFLAGS += -Wl,-rpath,/usr/local/classes/eecs/spring2021/cs472/public/gcc/lib64
LIB += -pthread
INC += -I $(SRCDIR)
$(TARGET): $(OBJECTS)
@echo "Linking..."
@echo " $(CC) $^ -o $(TARGET) $(LIB) $(LDFLAGS)"; $(CC) $^ -o $(TARGET) $(LIB) $(LDFLAGS)
$(BUILDDIR)/%.o: $(SRCDIR)/%.$(SRCEXT)
@mkdir -p $(BUILDDIR)
@echo " $(CC) $(CFLAGS) $(INC) -c -o [email protected] $<"; $(CC) $(CFLAGS) $(INC) -c -o [email protected] $<
clean:
@echo "Cleaning...";
@echo " $(RM) -r $(BUILDDIR) $(TARGET)"; $(RM) -r $(BUILDDIR) $(TARGET)
.PHONY: clean
finalprojtemplatev5/finalprojtemplate/resources/simpletracefile==This is a simple tracefile for testing purposes L 08 L 808 L 1006 L 08 S 1805 L 1002 L 808 M 1806 L 1008 S 1005 S 1808 L 808 M 08 M 04 L 2804 M 808
finalprojtemplatev5/finalprojtemplate/resources/testconfig
1
230
8
16
3
1
0
13
finalprojtemplatev5/finalprojtemplate/src/CacheController.cppfinalprojtemplatev5/finalprojtemplate/src/CacheController.cpp/*
Cache Simulator (Starter Code) by Justin Goins
Oregon State University
Spring Term 2021
*/
#include"CacheController.h"
#include<iostream>
#include<fstream>
#include<regex>
#include<cmath>
usingnamespace std;
CacheController::CacheController(CacheInfo ci, string tracefile){
// store the configuration info
this->ci = ci;
this->inputFile = tracefile;
this->outputFile =this->inputFile +".out";
// compute the other cache parameters
this->ci.numByteOffsetBits = log2(ci.blockSize);
this->ci.numSetIndexBits = log2(ci.numberSets);
// initialize the counters
this->globalCycles =0;
this->globalHits =0;
this->globalMisses =0;
this->globalEvictions =0;
// create your cache structure
// ...
// manual test code to see if the cache is behaving properly
// will need to be changed slightly to match the function prototype
/*
cacheAccess(false, 0);
cacheAccess(false, 128);
cacheAccess(false, 256);
cacheAccess(false, 0);
cacheAccess(false, 128);
cacheAccess(false, 256);
*/
}
/*
Starts reading the tracefile and processing memory operations.
*/
voidCacheController::runTracefile(){
cout <<"Input tracefile: "<< inputFile << endl;
cout <<"Output file name: "<< outputFile << endl;
// process each input line
string line;
// define regular expressions that are used to locate ...
C#i need help creating the instance of stream reader to read from .pdf
C#
i need help creating the instance of stream reader to read from a file the using statement will also
close the StreamReader
the txt files are \"NumofAutos.txt\" which is 5
and the txt files for \"AutoData.txt\"
which is Corolla
2013
23000
6
FORD
F150
2012
31000
8
BMW
328XI
2009
42000
3
CHEVY
Volt
2013
39000
5
NISSAN
Cube
2012
17500
5
this is the code that i have
using System;
using System.IO;
using System.Collections.Generic;
using System.Linq;
using System.Text;
namespace AutoInventory
{
//Class that holds the entire information related to Auto
class Auto
{
//Attributes
private string maker;
private string model;
private int year;
private double price;
private int inStock;
private double inventoryCost;
public static double totalInventoryCost = 0;
//Constructor
public Auto(string maker, string model, int year, double price, int inStock)
{
this.maker = maker;
this.model = model;
this.year = year;
this.price = price;
this.inStock = inStock;
}
//Setter methods
public void setMaker(string maker)
{
this.maker = maker;
}
public void setModel(string model)
{
this.model = model;
}
public void setYear(int year)
{
this.year = year;
}
public void setPrice(double price)
{
this.price = price;
}
public void setInStock(int stock)
{
this.inStock = stock;
}
//Getter Methods
public string getMaker()
{
return maker;
}
public string getModel()
{
return model;
}
public int getYear()
{
return year;
}
public double getPrice()
{
return price;
}
public int getInStock()
{
return inStock;
}
//Readonly Property
public double getInventoryCost()
{
return inventoryCost;
}
//Method that updates inventory
public void calcInventoryCost()
{
inventoryCost = price * inStock;
totalInventoryCost += inventoryCost;
}
}
//Main class
class Program
{
static void Main(string[] args)
{
//Getting number of autos
int count = getCount();
//Creating an array with size obtained
Auto[] autos = new Auto[count];
//Loading data
loadData(autos);
//Displaying and reading menu options
int option = menuOptions();
//Loop till user quits
while (true)
{
//Calling appropriate function
switch (option)
{
case 1: displayData(autos); break;
case 2: addAuto(autos); break;
case 3: sellAuto(autos); break;
case 4: saveExit(autos); Environment.Exit(0); break;
default: Console.WriteLine(\"\ \ Invalid Option.... \ \ \"); break;
}
option = menuOptions();
}
}
//Function that fetches the number of autos from file
public static int getCount()
{
int count = 0;
try
{
// Create an instance of StreamReader to read from a file.
// The using statement also closes the StreamReader.
using (StreamReader sr = new StreamReader(\"c:/NumofAuto.txt\"))
{
string line;
//Reading count value
while ((line = sr.ReadLine()) != null)
{
count = Convert.ToInt32(line);
}
}
}
catch (Exception e)
{
//Handling exceptions
Console.WriteLine(\"The file could not be read:\");
Console.WriteLine(e.Message);
}
return count;
}
//Method that loads data from file to array
public static void loadData(Auto[] autos)
{
int i, length = autos.Length;
try
{
/.
golang_refcard.pdf
This document provides a summary of the Go programming language. It outlines some key features of Go including:
- It is an imperative, statically typed language with syntax similar to C but fewer parentheses and no semicolons.
- It compiles to native code without a virtual machine and has built-in concurrency primitives like goroutines and channels.
- Some basic Go constructs are demonstrated like defining functions, variables, control structures, arrays/slices, maps, structs, and interfaces. Pointers, errors, and embedding are also summarized.
Hooking signals and dumping the callstack
The document provides information on programmatically obtaining backtraces in C using functions from the execinfo.h header file. It describes the backtrace(), backtrace_symbols(), and backtrace_symbols_fd() functions for getting and translating a backtrace. It also gives examples of using these functions to print a backtrace after a crash.
IDENTIFY AND DISCUSS ONE LOCAL PROJECT THAT USED PROJECT FINANCE OR .pdf
IDENTIFY AND DISCUSS ONE LOCAL PROJECT THAT USED PROJECT FINANCE OR
PPP AS A FINANCING MODEL. YOU DISCUSSION SHOULD BE: 1. SOURCES OF
FUNDS/COST OF PROJECT 2. PROJECT DURATION 3. PROJECT
PARTICIPANTS/BENEFICIARIES 3. RISKS AND RISK ALLOCATION/MANAGMENT.
If we wanted to use the AWS CLI outside of AWS (on our local PCs) wh.pdf
If we wanted to use the AWS CLI outside of AWS (on our local PCs) what items would we have
to configure to access our accounts.
*Please list the steps/aws services that would be required to run commands against your account
and why they are required..
More Related Content
Similar to In c code, fill in the blank#include time.h#include std.pdf
C-Program Custom Library, Header File, and Implementation FilesI .pdf
C-Program: Custom Library, Header File, and Implementation Files
I have this main.c file:
#include
#include
#include \"stats.h\"
int readGrades(char fileName[], float grades[]);
//Include this function prototype
void WelcomeToTheProgram();
int main()
{
///Declare Variables
char fileName[30];
float grades[1000]; //to store grades
int i, ArrayCount[10] = {0}; //to store histogram counts
/* Rewrite this line */
int num_grades; //for # of grades in file
///Call Intro Comment
WelcomeToTheProgram();
///Enter Filename
printf(\"\ \ \ Enter the data filename: \");
scanf(\"%s\", &fileName);
//Get # of grades in file
num_grades = readGrades(fileName, grades); //get # of grades in file
///Print Results
printf(\"There are %d grades read\ \", num_grades);
printf(\"Mean = %f\ \", mean(grades, num_grades));
printf(\"Variance = %f \ \", variance(grades, num_grades));
printf(\"Maximum = %f \ \", maximum(grades, num_grades));
printf(\"Minumum = %f \ \", minimum(grades, num_grades));
//Call histogram
histogram(grades, ArrayCount, num_grades);
//Print the histogram
printf(\"Grade Histogram\ \");
for (i = 0; i < 10; i++)
{
if (i != 9)
{
printf(\"\ %d %% - %d %%: %d \", i * 10, ((i + 1) * 10) - 1, ArrayCount[i]);
}
else
{
printf(\"\ 90 %% - 100 %%: %d\ \", ArrayCount[i]);
}
}
return 0;
}
///Reads all grades from the file to array
int readGrades(char fileName[], float grades[])
{
FILE *fpin = fopen(fileName, \"r\");
int num_scores = 0;
float value;
if (fpin == NULL)
{
printf(\"Cannot open the file\ \");
exit(0);
}
while ((fscanf(fpin, \"%f\", &value)) != EOF)
{
grades[num_scores] = value;
num_scores++;
}
return num_scores;
}
void WelcomeToTheProgram()
{
printf(\"***Welcome to the Program Which Involves a Custom Library***\");
printf(\"\ The program finds the minimum value, maximum value, mean,\");
printf(\"variance, and a histogram of the grades of data by calling\");
printf(\"implementation files min(), max(), mean(), variance(), and histogram().\ \");
}
But, the only thing that prints is
Enter the data file name: grades.txt
There are 400 grades read.
Then the program just stops, it does not print the min, max, mean, variance, or histogram. Any
ideas? Am I using the custom library wrong, the implementation files (for min, max, mean,
variance, and histogram) all check out with no warnings or errors.
Here is stats.h:
#ifndef STATS_H
#define STATS_H
float minimum(float *grades[], int Size); // NOTE: You need to complete the prototypes
float maximum(float *grades[], int Size);
float mean(float *grades[], int Size);
float variance(float *grades[], int Size);
void histogram(float *grades[], int *ArrayCount, int Size);
#endif // STATS_H
And here is the grades file:
Solution
//stats.h
#ifndef STATS_H
#define STATS_H
float minimum(float grades[], int Size); // NOTE: You need to complete the prototypes
float maximum(float grades[], int Size);
float mean(float grades[], int Size);
float variance(float grades[], int Size);
void histogram(float grades[], int ArrayCount[], int S.
IN C LANGUAGE- I've been trying to finish this program for the last fe.docx
IN C LANGUAGE: I've been trying to finish this program for the last few days, and I'm stuck on one part of it, and I can't figure out what to do.
The goal is to read in a file (separated by commas), put the information into a linked list, and then sort that linked list by either first or last name using function pointers.
Everything I have so far works, aside from the fact that my output is never sorted. I'm doing something wrong with the listSort function, and I don't know what it is.
Can anyone please just take a look at what I have and offer a suggestion or solution? It might not even be an issue with the function itself, but something somewhere else.
I would greatly appreciate it.
Please do not make any changes to the variables in the structs. Month has to be a string, it cannot be an integer.
driver.c:
#include "functions.h"
#include <stdio.h>
#include <stdlib.h>
#include <assert.h>
#include <string.h>
int main(int argc, char* argv[]) {
//creating input and output files
FILE* in = NULL;
FILE* out = NULL;
node_t* head = NULL;
node_t* temp = NULL;
//checking for 4 command line arguments
assert(argc == 4);
//opening input file
in = fopen(argv[1], "r");
assert(in != NULL);
//opening output file
out = fopen(argv[2], "w");
assert(out != NULL);
int sortBy = atoi(argv[4]);
temp = createList(in, &head);
if(sortBy == 1) {
sortList(&head, compare_by_firstname);
}
else if(sortBy == 2) {
sortList(&head, compare_by_lastname);
}
printList(out, temp);
deleteList(&head);
//closing files
fclose(in);
fclose(out);
return 0;
}
functions.c:
#include "functions.h"
#include <stdio.h>
#include <stdlib.h>
#include <assert.h>
#include <string.h>
#include <stdbool.h>
bool isLeapYear(int year) {
if(year % 4 != 0) {
return false;
}
else if(year % 100 != 0) {
return true;
}
else if(year % 400 != 0) {
return false;
}
else {
return true;
}
}
void printBorder(FILE* out)
{
int i = 0;
for(i = 0; i < 80; i++)
fprintf(out,"*");
fprintf(out, "\n");
}
bool checkInvalidDate(node_t *node) {
int year = (int)node->birthday.year;
if(node->birthday.day < 1 || node->birthday.year < 1) {
return true;
}
if(strcmp(node->birthday.month, "February") == 0) {
if(isLeapYear(year)) {
if(node->birthday.day > 29) {
return true;
}
}
else if(node->birthday.day > 28) {
return true;
}
}
else if((strcmp(node->birthday.month, "April") == 0) || (strcmp(node->birthday.month, "June") == 0) ||
(strcmp(node->birthday.month, "September") == 0) || (strcmp(node->birthday.month, "November") == 0)) {
if(node->birthday.day > 30) {
return true;
}
}
else {
if(node->birthday.day > 31) {
return true;
}
}
return false;
}
void add(node_t **node, node_t **head) {
node_t* current = *head;
while(current != NULL) {
//comparing first and last names to check for duplicates; if duplicate the info isn't added to the list
if((strcmp(current->firstName, (*node)->firstName) == 0) && (strcmp(current->lastName, (*node)->lastName) == 0)) {
return;
}
current = current->next;
}
//adding information as a node to the list
(*node.
please navigate to cs112 webpage and go to assignments -- Trees. Th.pdf
please navigate to cs112 webpage and go to assignments --> Trees. This will give you the
directions for the assignment. Please do the last 2 methods in huffman.java called encode() and
decode()
Code is provided below:
HuffmanCoding.java
package huffman;
import java.io.File;
import java.io.FileInputStream;
import java.io.FileOutputStream;
import java.util.ArrayList;
import java.util.Collections;
/**
* This class contains methods which, when used together, perform the
* entire Huffman Coding encoding and decoding process
*
* @author Ishaan Ivaturi
* @author Prince Rawal
*/
public class HuffmanCoding {
private String fileName;
private ArrayList sortedCharFreqList;
private TreeNode huffmanRoot;
private String[] encodings;
/**
* Constructor used by the driver, sets filename
* DO NOT EDIT
* @param f The file we want to encode
*/
public HuffmanCoding(String f) {
fileName = f;
}
/**
* Reads from filename character by character, and sets sortedCharFreqList
* to a new ArrayList of CharFreq objects with frequency > 0, sorted by frequency
*/
public void makeSortedList() {
StdIn.setFile(fileName);
/* Your code goes here */
}
/**
* Uses sortedCharFreqList to build a huffman coding tree, and stores its root
* in huffmanRoot
*/
public void makeTree() {
/* Your code goes here */
}
/**
* Uses huffmanRoot to create a string array of size 128, where each
* index in the array contains that ASCII character's bitstring encoding. Characters not
* present in the huffman coding tree should have their spots in the array left null.
* Set encodings to this array.
*/
public void makeEncodings() {
/* Your code goes here */
}
/**
* Using encodings and filename, this method makes use of the writeBitString method
* to write the final encoding of 1's and 0's to the encoded file.
*
* @param encodedFile The file name into which the text file is to be encoded
*/
public void encode(String encodedFile) {
StdIn.setFile(fileName);
/* Your code goes here */
}
/**
* Writes a given string of 1's and 0's to the given file byte by byte
* and NOT as characters of 1 and 0 which take up 8 bits each
* DO NOT EDIT
*
* @param filename The file to write to (doesn't need to exist yet)
* @param bitString The string of 1's and 0's to write to the file in bits
*/
public static void writeBitString(String filename, String bitString) {
byte[] bytes = new byte[bitString.length() / 8 + 1];
int bytesIndex = 0, byteIndex = 0, currentByte = 0;
// Pad the string with initial zeroes and then a one in order to bring
// its length to a multiple of 8. When reading, the 1 signifies the
// end of padding.
int padding = 8 - (bitString.length() % 8);
String pad = "";
for (int i = 0; i < padding-1; i++) pad = pad + "0";
pad = pad + "1";
bitString = pad + bitString;
// For every bit, add it to the right spot in the corresponding byte,
// and store bytes in the array when finished
for (char c : bitString.toCharArray()) {
if (c != '1' && c != '0') {
System.out.println("Invalid characters in bitstring");
return;
}
if (c .
RightTrianglerightTriangle.cppRightTrianglerightTriangle.cpp.docx
RightTriangle/rightTriangle.cppRightTriangle/rightTriangle.cpp// This file includes implementations for functions of the right
// triangle class.
#include<iostream>
#include<cmath>
usingnamespace std;
#include"rightTriangle.h"
// Default constructor
RightTriangle::RightTriangle()
{
base =0;
height =0;
}
// SET functions (for storing data in private data members)
voidRightTriangle::setHeight(double h)
{
height = h;
}
voidRightTriangle::setBase(double b)
{
base = b;
}
// Calculate length of hypotenuse using
// Pythagorean Theorem
doubleRightTriangle::calcHypotenuse()
{
return sqrt (base * base + height * height);
}
__MACOSX/RightTriangle/._rightTriangle.cpp
RightTriangle/rightTriangle.h
// This file defines the specifications for a class to store
// attributes of a right triangle
class RightTriangle
{
private: // PRIVATE data members
double base;
double height;
public: // PUBLIC member functions
RightTriangle(); // Default constructor
void setHeight(double h); // SET functions
void setBase(double b);
// Calculate length of hypotenuse
double calcHypotenuse();
};
__MACOSX/RightTriangle/._rightTriangle.h
RightTriangle/testTriangle.cppRightTriangle/testTriangle.cpp// This program calculates various parameters of a
// right triangle.
#include<iostream>
usingnamespace std;
#include"rightTriangle.h"
int main()
{
// Declaration
double base,height;
RightTriangle aTriangle;
// Input
cout <<"Enter the base of the triangle: ";
cin >> base;
cout <<"Enter the height of the triangle: ";
cin >> height;
// Move data to object
aTriangle.setBase(base);
aTriangle.setHeight(height);
// Calculations and output
cout << endl;
cout <<"Length of hypotenuse: "
<< aTriangle.calcHypotenuse()<< endl;
return0;
}// end main function
__MACOSX/RightTriangle/._testTriangle.cpp
c++practice3a3b/._rightTriangle.cpp
c++practice3a3b/._rightTriangle.h
c++practice3a3b/._testTriangle.cpp
c++practice3a3b/partList.txt
2345 Snoozle 15.4 29.95
1234 Widget 5.4 9.99
3456 Bludger 9.1 15.49
5678 Zeeter 7.7 1.99
6789 Sub_Tweezer 12.3 5.25
4567 Woofle 3.7 49.79
c++practice3a3b/partMgr.cppc++practice3a3b/partMgr.cpp// This program manages a list of parts.
#include<iostream>
#include<iomanip>
#include<fstream>
usingnamespace std;
// Attributes for one part
struct partInfo
{
int number;
char name[30];
double weight;
double price;
};
constint MAX_LIST_SIZE =100;
// Function prototypes
int menu();
void buildPartsList(partInfo partList[],int& listSize);
void searchParts(partInfo partList[],int numParts);
void listParts(partInfo partList[],int& numParts);
void insertPart(partInfo list[],int& numElems);
void deletePart(partInfo list[],int& numElems);
partInfo getPartInfo();
v ...
Dynamic Memory Allocation.pptx
The document discusses dynamic memory allocation in C programming. It provides details on four main library functions - malloc(), calloc(), free(), and realloc() - that allow dynamic memory allocation. malloc() allocates memory without initialization, calloc() allocates and initializes memory to zero, free() de-allocates previously allocated memory, and realloc() changes the size of previously allocated memory. Examples are given to demonstrate the usage of each function. The document also discusses self-referential structures, bit fields, typedef, scope of variables, and storage classes in C.
Please answer the 4 questions using C- The expected output is shown be.docx
Please answer the 4 questions using C. The expected output is shown below. Thank you!
---------------------------------------------------------------------------------------------------
// Write your name here
// Write the compiler used: Visual studio or gcc
// Reminder that your file name is incredibly important. Please do not change it.
// Reminder that we are compiling on Gradescope using GCC.
// READ BEFORE YOU START:
// You are given a partially completed program that creates a list of game items
like you'd see in a folder.
// Each item has this information: item's name, game's name, type of item, item ID.
// The struct 'itemRecord' holds information of one item. Variety is an enum.
// An array of structs called 'list' is made to hold the list of items.
// To begin, you should trace through the given code and understand how it works.
// Please read the instructions above each required function and follow the
directions carefully.
// You should not modify any of the given code, the return types, or the
parameters. Otherwise, you risk getting compilation errors.
// You are not allowed to modify main().
// You can use string library functions.
// WRITE COMMENTS FOR IMPORANT STEPS IN YOUR CODE.
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#pragma warning(disable: 4996) // for Visual Studio
Only
#define MAX_ITEMS 15
#define MAX_NAME_LENGTH 25
typedef enum { Health = 0, Equip, Etc } itemType; // enum type
struct itemRecord { // struct for item details
char itemName[MAX_NAME_LENGTH];
char gameName[MAX_NAME_LENGTH];
itemType variety;
unsigned int itemID;
};
struct itemRecord list[MAX_ITEMS]; // declare list of items
int count = 0; // the number of items
currently stored in the list (initialized to 0)
// functions already implmented
void flushStdIn();
void executeAction(char);
void save(char* fileName);
void display();
// functions that need implementation:
int add(char* itemName_input,
char* gameName_input,
char* variety_input,
unsigned int idNumber_input); // 10 points
void sort(); // 10 points
int delete(unsigned int idNumber_input); // 10 points
void load(char* fileName); // 10 points
int main()
{
char* fileName = "Item_List.txt";
load(fileName); // load list of items from
file (if it exists). Initially there will be no file.
char choice = 'i'; // initialized to a dummy
value
do
{
printf("\nEnter your selection:\n");
printf("\t a: add a new item\n");
printf("\t d: display item list\n");
printf("\t r: remove an item from list\n");
printf("\t s: sort item list by ID\n");
printf("\t q: quit\n");
choice = getchar();
flushStdIn();
executeAction(choice);
} while (choice != 'q');
save(fileName); // save list of items to file
(overwrites file, if it exists)
return 0;
}
// flush out leftover '\n' characters
void flushStdIn()
{
char c;
do c = getchar();
while (c != '\n' && c != EOF);
}
// ask for details from user for the given selection and perform that action
.
DMA.pptx
The document discusses different types of memory allocation in C programming. It describes implicit and explicit type casting, and the functions used for dynamic memory allocation - malloc(), calloc(), realloc(), and free(). Examples are provided to demonstrate how to allocate and reallocate memory at runtime using these functions. malloc() allocates a single block of memory, calloc() allocates multiple blocks, realloc() changes the size of previously allocated memory, and free() releases the allocated memory.
Data structures
The document contains code snippets related to data structures and pointers in C programming. It includes examples of using pointers to access array elements, dynamically allocating memory using functions like malloc(), calloc(), and realloc(). It also demonstrates writing and reading data from binary files using pointers, structs, and file I/O functions. Additional examples include concatenating files, counting words and characters in a file, and implementing employee records using file operations.
Programming in C
The document discusses various concepts related to arrays, structures, strings, file handling, and command line arguments in C/C++. It defines arrays as a consecutive group of memory locations to store elements of the same data type. Structures are used to group related data of different types. Strings are stored as character arrays ending with a null character. File handling functions like fopen, fclose, fprintf and fscanf are used to open, close and read/write files. Command line arguments can be accessed using argc and argv array in main function.
C
The document discusses various concepts related to arrays, structures, strings, file handling, and command line arguments in C/C++. It defines arrays as a consecutive group of memory locations to store elements of the same data type. Structures are used to group related data of different types. Strings are stored as character arrays ending with a null character. File handling functions like fopen, fclose, fprintf and fscanf are used to open, close and read/write files. Command line arguments can be accessed through the argc and argv parameters in main().
HERE is a C PROGRAM BELOW EVERYTIME I TRY TO RUN IT ON MATRIX IT GI.pdf
Given the exponential function y = (0.5)^x: a. Complete Table 2. Table 2: End behavior of y =
(0.5)x b. As x rightarrow infinity, (0.5)^x rightarrow c. As x rightarrow -infinity, (0.5)^x
rightarrow
Solution
b. As x tends to infinity, (0.5)^x = (1/2)^infinity = 1/(2^infinity) approaches to zero.
Hence answer is 0
c. As x tends to - infinity, (0.5)^x = (1/2)^(-infinity) = 2^infinity approaches to infinity
Hence answer is infinity..
888678123317368915236 #include stdio.h #include stdlib.h.pdf
8886781233
17368915236
#include
#include
int main() {
int i, n, *data , p;
/* get the number of inputs from the user */
printf(\"Enter the number of inputs:\");
scanf(\"%d\", &n);
/* dynamically allocate memory to store i/p values */
data = (int *) malloc(sizeof(int) * n);
/* get the input data from the user */
for (i = 0; i < n; i++) {
printf(\"data[%d]: \", i);
scanf(\"%d\", &data[i]);
}
/* sorts the given numbers */
bubbleSort(data, n ,p );
}
void bubbleSort(int *data, int n , int p) {
int i, temp, k = 1, l,j;
if (n > 0) {
for (i = n; i > 0; i--) {
if (data[i] > data[i - 1])
{
temp = data[i];
data[i] = data[i - 1];
data[i - 1] = temp;
}
if( p = = 0)
{
p++;
l = n;
for ( i = 0 ; i < n ; i++)
{
prinft ( %d, data[i])
}
bubbleSort(data, i - 2 , p );
}
else
{
for ( j = n - 1 ; j < l ; j++)
{
if (data[j] > data[j - 1])
{
temp = data[j];
data[j] = data[j - 1];
data[j - 1] = temp;
}
}
for ( j = 0 ; j < l ; j++)
{
prinft ( %d, data[j])
}
bubbleSort(data, i - 2,p);
}
}
}
return;
}
Solution
8886781233
17368915236
#include
#include
int main() {
int i, n, *data , p;
/* get the number of inputs from the user */
printf(\"Enter the number of inputs:\");
scanf(\"%d\", &n);
/* dynamically allocate memory to store i/p values */
data = (int *) malloc(sizeof(int) * n);
/* get the input data from the user */
for (i = 0; i < n; i++) {
printf(\"data[%d]: \", i);
scanf(\"%d\", &data[i]);
}
/* sorts the given numbers */
bubbleSort(data, n ,p );
}
void bubbleSort(int *data, int n , int p) {
int i, temp, k = 1, l,j;
if (n > 0) {
for (i = n; i > 0; i--) {
if (data[i] > data[i - 1])
{
temp = data[i];
data[i] = data[i - 1];
data[i - 1] = temp;
}
if( p = = 0)
{
p++;
l = n;
for ( i = 0 ; i < n ; i++)
{
prinft ( %d, data[i])
}
bubbleSort(data, i - 2 , p );
}
else
{
for ( j = n - 1 ; j < l ; j++)
{
if (data[j] > data[j - 1])
{
temp = data[j];
data[j] = data[j - 1];
data[j - 1] = temp;
}
}
for ( j = 0 ; j < l ; j++)
{
prinft ( %d, data[j])
}
bubbleSort(data, i - 2,p);
}
}
}
return;
}.
Write a C++ program 1. Study the function process_text() in file.pdf
Write a C++ program
1. Study the function process_text() in file \"text_processing.cpp\". What do the string member
functions find(), substr(), c_str() do?
//text_processing.cpp
#include \"util.h\"
#include \"text_processing.h\"
#include
using namespace std;
int process_text( fstream &ifs, fstream &ofs, char target[] )
{
string replace_str( \"XXX\" ); //hard-coded string for replacement
int tlen = strlen( target ); //string length of target
int max_len = 200; //maximum length of a line
char s[max_len+1];
clear_screen(); //clear the screen
while ( !ifs.eof() ) {
int i2, i1 = 0, len=0;
ifs.getline( s, max_len ); //get one line from file
string str( s ); //construct a string object
i2 = str.find ( target, i1 ); //find target
len = i2 - i1;
if ( i2 > -1 && len > 0 ){ //if target found
print_text( str.substr( i1, i2 ).c_str() ); //print up to target
ofs << str.substr( i1, i2 );
}
while ( i2 > -1 ) {
print_text_inverse ( target ); //highlight target
ofs << replace_str;
i1 = i2 + tlen; //new search position
i2 = str.find ( target, i1 ); //find next target
len = i2 - i1;
if ( i2 > -1 && len > 0 ){ //found target
print_text( str.substr( i1, len ).c_str() ); //print up to target
ofs << str.substr( i1, len );
}
}
len = str.length() - i1;
if ( len > 0 ) { //print the remainder
print_text( str.substr( i1, len ).c_str() );
ofs << str.substr( i1, len );
}
ofs << endl;
getnstr( s, 1 ); //prompt for
} //while ( !ifs.eof() )
restore_screen(); //restore the old screen
return 1;
}
//text_processing.h
#ifndef TEXT_PROCESSING_H
#define TEXT_PROCESSING_H
#include
#include
using namespace std;
int process_text( fstream &ifs, fstream &ofs, char target[] );
#endif
//util.h
#ifndef UTIL_H
#define UTIL_H
#include
#include
#include
#include
#include
using namespace std;
void usage ( char program_name[] );
void clear_screen();
void print_text( const char *s );
void print_text_inverse( const char *s );
void get_input_text( char *s, int max_len );
void restore_screen();
#endif
//util.cpp
#include \"util.h\"
void usage ( char program_name[] )
{
cout << \"Usage: \" << program_name << \" infile outfile search_string\" << endl;
return;
}
/*
The following are some curses functions. You can find
the details by the command \"man ncurses\". But its use
can be transparent to you.
*/
void clear_screen()
{
initscr();
scrollok ( stdscr, true ); //allow window to scroll
}
void print_text ( const char *s )
{
printw(\"%s\", s );
refresh();
}
void print_text_inverse( const char *s )
{
attron( A_REVERSE );
printw(\"%s\", s );
attroff( A_REVERSE );
refresh();
}
void get_input_text( char *s, int max_len )
{
getnstr( s, max_len );
}
void restore_screen()
{
endwin();
}
//str_main.cpp
#include \"util.h\"
#include \"text_processing.h\"
#include
using namespace std;
/*
Note that grace_open() must be defined in same file
as main(), otherwise the destructor of fstream will
automatically close the opened file as it finds that
its out of scope upon exiting the function.
*/
int grace_open( char *s, fst.
MAINCPP include ltiostreamgt include ltstringgt u.pdf
MAIN.CPP
#include <iostream>
#include <string>
using namespace std;
#include "bstree.h"
// Prints a single string, used by FSTree::inorder to print all
// values in the tree in correct order.
void print_string (string s) { cout << s << endl; }
// Prints a single string preceeded by a number of hyphens, used by
// BSTree::preorder to print a visual representation of the tree.
void print_string_depth (string s, int n) {
for (int i = 0; i < n; i++)
cout << '-';
cout << s << endl;
}
int main () {
// Create a binary search tree.
BSTree<string> t;
// Insert some strings for testing.
t.insert("dog");
t.insert("bird");
t.insert("cat");
t.insert("turtle");
t.insert("giraffe");
t.insert("snake");
t.insert("deer");
t.insert("groundhog");
t.insert("horse");
// Output the values stored in the tree.
cout << "Values stored in the tree are:n";
t.inorder(print_string);
cout << "n";
cout << "The structure of the tree is as follows:n";
t.preorder(print_string_depth);
cout << "n";
}
BSTREE.h
#pragma once
// A Binary Search Tree implementation.
template <typename T>
class BSTree {
private:
// A node in the tree. Each node has pointers to its left and right nodes
// as well as its parent. When a node is created, the parent and data item
// must be provided.
class node {
public:
T data;
node* left;
node* right;
node* parent;
node (const T& d, node* p) {
parent = p;
data = d;
left = right = nullptr;
}
};
// Pointer to the root node. Initially this is null for an empty tree.
node* root;
// Copy the subtree of another BSTree object into this object. Used by
// the copy constructor and assignment operator.
void copy (node* p) {
if (p) { // If p points to a node...
insert(p->data); // Insert data item
copy(p->left); // Copy the left subtree
copy(p->right); // Copy the right subtree
}
}
// Destroy a node and all nodes in both subtrees. Called by the
// destructor.
void destroy (node* p) {
if (p) { // If p is not null...
destroy(p->left); // Destroy the left subtree
destroy(p->right); // Destroy the right subtree
delete p; // Destroy the node
}
}
// Helper function to determine if a data value is contained in the tree.
// Takes the data value being searched and a pointer to the node in the
// tree. Returns pointer to node in which data item is found, a null
// pointer otherwise.
node* find (const T& d, node* p) const {
// Given: p is a pointer to an existing node
if (d == p->data) // Is this the value we're looking for?
return p;
if (d < p->data) // Check left side, if null then not found
return p->left ? find(d, p->left) : nullptr;
return p->right ? find(d, p->right) : nullptr; // Check right side...
}
// Helper function to insert a data item into the tree. Takes the data
// and a pointer to a node in the tree. Recursively decends down the tree
// until position were insertion should take place is found.
void insert (const T& d, node* p) {
// Given: p is a pointer to an existing node (root of a subtree)
if (d < p->data) { // Insert into left subtree?
if (p->left) // Left.
DS UNIT3_LINKED LISTS.docx
A linked list is a linear data structure consisting of nodes that are connected to each other. Each node contains data and a pointer to the next node. The first node is referenced by the head pointer and the last node points to NULL. Linked lists can be singly, doubly, or circularly linked. A singly linked list is represented by a struct containing an integer data field and a pointer to the next node. Memory for nodes is dynamically allocated using functions like malloc() and freed using free().
num.txt(Save this file under D Drive.Then the path of the file is D.pdf
num.txt(Save this file under D Drive.Then the path of the file is D:\\\ um.txt)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
CPP Code
#include
#include
using namespace std;
//Declaring Global variable
int sum=0;
//Function declarations
void readFromFile();
void writeToFile();
/* Function implementation which will
* read the numbers from the file and calculates the sum of
* the numbers which are multiples of 2 or 5
*/
void readFromFile()
{
int number,sum=0;
//fileInput reference
ifstream dataIn;
//Opening input file
dataIn.open(\"D:\\\ um.txt\");
while(dataIn>>number)
{
if(number%2==0 || number%5==0)
{
sum+=number;
}
}
//closing the input stream
dataIn.close();
}
/* Function implementation which will
* display the sum into another text file
*/
void writeToFile()
{
//fileoutput reference
ofstream myfile;
//Opening the file
myfile.open (\"D:\\\ um1.txt\");
//Writing the contents to the file
myfile <<\"The Sum of Multiples of 2 or 5 is :\"<
Solution
num.txt(Save this file under D Drive.Then the path of the file is D:\\\ um.txt)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
CPP Code
#include
#include
using namespace std;
//Declaring Global variable
int sum=0;
//Function declarations
void readFromFile();
void writeToFile();
/* Function implementation which will
* read the numbers from the file and calculates the sum of
* the numbers which are multiples of 2 or 5
*/
void readFromFile()
{
int number,sum=0;
//fileInput reference
ifstream dataIn;
//Opening input file
dataIn.open(\"D:\\\ um.txt\");
while(dataIn>>number)
{
if(number%2==0 || number%5==0)
{
sum+=number;
}
}
//closing the input stream
dataIn.close();
}
/* Function implementation which will
* display the sum into another text file
*/
void writeToFile()
{
//fileoutput reference
ofstream myfile;
//Opening the file
myfile.open (\"D:\\\ um1.txt\");
//Writing the contents to the file
myfile <<\"The Sum of Multiples of 2 or 5 is :\"<.
finalprojtemplatev5finalprojtemplate.gitignore# Ignore the b
finalprojtemplatev5/finalprojtemplate/.gitignore
# Ignore the build directory
build
# Ignore any executables
bin/*
# Ignore Mac specific files
.DS_Store
finalprojtemplatev5/finalprojtemplate/Makefile
# Script adapted from https://hiltmon.com/blog/2013/07/03/a-simple-c-plus-plus-project-structure/
CC := /usr/local/classes/eecs/spring2021/cs472/public/gcc/bin/g++
STRIPUTIL = strip
SRCDIR = src
BUILDDIR = build
TARGET = bin/cache_sim
# Handle debug case
DEBUG ?= 1
ifeq ($(DEBUG), 1)
CFLAGS += -g -Wall
else
CFLAGS += -DNDEBUG -O3
endif
SRCEXT = cpp
SOURCES = $(shell find $(SRCDIR) -type f -name *.$(SRCEXT))
OBJECTS = $(patsubst $(SRCDIR)/%,$(BUILDDIR)/%,$(SOURCES:.$(SRCEXT)=.o))
LDFLAGS += -Wl,-rpath,/usr/local/classes/eecs/spring2021/cs472/public/gcc/lib64
LIB += -pthread
INC += -I $(SRCDIR)
$(TARGET): $(OBJECTS)
@echo "Linking..."
@echo " $(CC) $^ -o $(TARGET) $(LIB) $(LDFLAGS)"; $(CC) $^ -o $(TARGET) $(LIB) $(LDFLAGS)
$(BUILDDIR)/%.o: $(SRCDIR)/%.$(SRCEXT)
@mkdir -p $(BUILDDIR)
@echo " $(CC) $(CFLAGS) $(INC) -c -o [email protected] $<"; $(CC) $(CFLAGS) $(INC) -c -o [email protected] $<
clean:
@echo "Cleaning...";
@echo " $(RM) -r $(BUILDDIR) $(TARGET)"; $(RM) -r $(BUILDDIR) $(TARGET)
.PHONY: clean
finalprojtemplatev5/finalprojtemplate/resources/simpletracefile==This is a simple tracefile for testing purposes L 08 L 808 L 1006 L 08 S 1805 L 1002 L 808 M 1806 L 1008 S 1005 S 1808 L 808 M 08 M 04 L 2804 M 808
finalprojtemplatev5/finalprojtemplate/resources/testconfig
1
230
8
16
3
1
0
13
finalprojtemplatev5/finalprojtemplate/src/CacheController.cppfinalprojtemplatev5/finalprojtemplate/src/CacheController.cpp/*
Cache Simulator (Starter Code) by Justin Goins
Oregon State University
Spring Term 2021
*/
#include"CacheController.h"
#include<iostream>
#include<fstream>
#include<regex>
#include<cmath>
usingnamespace std;
CacheController::CacheController(CacheInfo ci, string tracefile){
// store the configuration info
this->ci = ci;
this->inputFile = tracefile;
this->outputFile =this->inputFile +".out";
// compute the other cache parameters
this->ci.numByteOffsetBits = log2(ci.blockSize);
this->ci.numSetIndexBits = log2(ci.numberSets);
// initialize the counters
this->globalCycles =0;
this->globalHits =0;
this->globalMisses =0;
this->globalEvictions =0;
// create your cache structure
// ...
// manual test code to see if the cache is behaving properly
// will need to be changed slightly to match the function prototype
/*
cacheAccess(false, 0);
cacheAccess(false, 128);
cacheAccess(false, 256);
cacheAccess(false, 0);
cacheAccess(false, 128);
cacheAccess(false, 256);
*/
}
/*
Starts reading the tracefile and processing memory operations.
*/
voidCacheController::runTracefile(){
cout <<"Input tracefile: "<< inputFile << endl;
cout <<"Output file name: "<< outputFile << endl;
// process each input line
string line;
// define regular expressions that are used to locate ...
C#i need help creating the instance of stream reader to read from .pdf
C#
i need help creating the instance of stream reader to read from a file the using statement will also
close the StreamReader
the txt files are \"NumofAutos.txt\" which is 5
and the txt files for \"AutoData.txt\"
which is Corolla
2013
23000
6
FORD
F150
2012
31000
8
BMW
328XI
2009
42000
3
CHEVY
Volt
2013
39000
5
NISSAN
Cube
2012
17500
5
this is the code that i have
using System;
using System.IO;
using System.Collections.Generic;
using System.Linq;
using System.Text;
namespace AutoInventory
{
//Class that holds the entire information related to Auto
class Auto
{
//Attributes
private string maker;
private string model;
private int year;
private double price;
private int inStock;
private double inventoryCost;
public static double totalInventoryCost = 0;
//Constructor
public Auto(string maker, string model, int year, double price, int inStock)
{
this.maker = maker;
this.model = model;
this.year = year;
this.price = price;
this.inStock = inStock;
}
//Setter methods
public void setMaker(string maker)
{
this.maker = maker;
}
public void setModel(string model)
{
this.model = model;
}
public void setYear(int year)
{
this.year = year;
}
public void setPrice(double price)
{
this.price = price;
}
public void setInStock(int stock)
{
this.inStock = stock;
}
//Getter Methods
public string getMaker()
{
return maker;
}
public string getModel()
{
return model;
}
public int getYear()
{
return year;
}
public double getPrice()
{
return price;
}
public int getInStock()
{
return inStock;
}
//Readonly Property
public double getInventoryCost()
{
return inventoryCost;
}
//Method that updates inventory
public void calcInventoryCost()
{
inventoryCost = price * inStock;
totalInventoryCost += inventoryCost;
}
}
//Main class
class Program
{
static void Main(string[] args)
{
//Getting number of autos
int count = getCount();
//Creating an array with size obtained
Auto[] autos = new Auto[count];
//Loading data
loadData(autos);
//Displaying and reading menu options
int option = menuOptions();
//Loop till user quits
while (true)
{
//Calling appropriate function
switch (option)
{
case 1: displayData(autos); break;
case 2: addAuto(autos); break;
case 3: sellAuto(autos); break;
case 4: saveExit(autos); Environment.Exit(0); break;
default: Console.WriteLine(\"\ \ Invalid Option.... \ \ \"); break;
}
option = menuOptions();
}
}
//Function that fetches the number of autos from file
public static int getCount()
{
int count = 0;
try
{
// Create an instance of StreamReader to read from a file.
// The using statement also closes the StreamReader.
using (StreamReader sr = new StreamReader(\"c:/NumofAuto.txt\"))
{
string line;
//Reading count value
while ((line = sr.ReadLine()) != null)
{
count = Convert.ToInt32(line);
}
}
}
catch (Exception e)
{
//Handling exceptions
Console.WriteLine(\"The file could not be read:\");
Console.WriteLine(e.Message);
}
return count;
}
//Method that loads data from file to array
public static void loadData(Auto[] autos)
{
int i, length = autos.Length;
try
{
/.
golang_refcard.pdf
This document provides a summary of the Go programming language. It outlines some key features of Go including:
- It is an imperative, statically typed language with syntax similar to C but fewer parentheses and no semicolons.
- It compiles to native code without a virtual machine and has built-in concurrency primitives like goroutines and channels.
- Some basic Go constructs are demonstrated like defining functions, variables, control structures, arrays/slices, maps, structs, and interfaces. Pointers, errors, and embedding are also summarized.
Hooking signals and dumping the callstack
The document provides information on programmatically obtaining backtraces in C using functions from the execinfo.h header file. It describes the backtrace(), backtrace_symbols(), and backtrace_symbols_fd() functions for getting and translating a backtrace. It also gives examples of using these functions to print a backtrace after a crash.
Similar to In c code, fill in the blank#include time.h#include std.pdf (20)
C-Program Custom Library, Header File, and Implementation FilesI .pdf
C-Program Custom Library, Header File, and Implementation FilesI .pdf
IN C LANGUAGE- I've been trying to finish this program for the last fe.docx
IN C LANGUAGE- I've been trying to finish this program for the last fe.docx
please navigate to cs112 webpage and go to assignments -- Trees. Th.pdf
please navigate to cs112 webpage and go to assignments -- Trees. Th.pdf
RightTrianglerightTriangle.cppRightTrianglerightTriangle.cpp.docx
RightTrianglerightTriangle.cppRightTrianglerightTriangle.cpp.docx
Please answer the 4 questions using C- The expected output is shown be.docx
Please answer the 4 questions using C- The expected output is shown be.docx
HERE is a C PROGRAM BELOW EVERYTIME I TRY TO RUN IT ON MATRIX IT GI.pdf
HERE is a C PROGRAM BELOW EVERYTIME I TRY TO RUN IT ON MATRIX IT GI.pdf
888678123317368915236 #include stdio.h #include stdlib.h.pdf
888678123317368915236 #include stdio.h #include stdlib.h.pdf
Write a C++ program 1. Study the function process_text() in file.pdf
Write a C++ program 1. Study the function process_text() in file.pdf
MAINCPP include ltiostreamgt include ltstringgt u.pdf
MAINCPP include ltiostreamgt include ltstringgt u.pdf
num.txt(Save this file under D Drive.Then the path of the file is D.pdf
num.txt(Save this file under D Drive.Then the path of the file is D.pdf
finalprojtemplatev5finalprojtemplate.gitignore# Ignore the b
finalprojtemplatev5finalprojtemplate.gitignore# Ignore the b
C#i need help creating the instance of stream reader to read from .pdf
C#i need help creating the instance of stream reader to read from .pdf
More from manojmozy
IDENTIFY AND DISCUSS ONE LOCAL PROJECT THAT USED PROJECT FINANCE OR .pdf
IDENTIFY AND DISCUSS ONE LOCAL PROJECT THAT USED PROJECT FINANCE OR
PPP AS A FINANCING MODEL. YOU DISCUSSION SHOULD BE: 1. SOURCES OF
FUNDS/COST OF PROJECT 2. PROJECT DURATION 3. PROJECT
PARTICIPANTS/BENEFICIARIES 3. RISKS AND RISK ALLOCATION/MANAGMENT.
If we wanted to use the AWS CLI outside of AWS (on our local PCs) wh.pdf
If we wanted to use the AWS CLI outside of AWS (on our local PCs) what items would we have
to configure to access our accounts.
*Please list the steps/aws services that would be required to run commands against your account
and why they are required..
Identifique los cinco principales pa�ses receptores de IED de EE. UU.pdf
Identifique los cinco principales pases receptores de IED de EE. UU. Identifique las 10
principales empresas multinacionales con sede en los EE. UU. que han realizado IED saliente en
otros lugares. Por qu estos pases atraen IED de EE.UU.? Explique el uso de las vistas basadas en
recursos e instituciones.
gracias de antemano.
If X is a random variable with mean 10 and standard deviation 5, whi.pdf
If X is a random variable with mean 10 and standard deviation 5, which of the following
techniques can always be used to calculate P(X < 14)? Standardize the variable and look up the
probability in the standard normal table. Use Chebyshev's inequality to calculate the probability
Use the binomial distribution formula to calculate the probability. The probability is (14 - 10)/5
= 0.80. None of.
Identifique la variable de control para la carga de aerosoles atmosf�r.pdf
Identifique la variable de control para la carga de aerosoles atmosfricos y explique por qu an no
podemos cuantificar el lmite planetario. Describir qu son los aerosoles atmosfricos y por qu es
importante monitorearlos. Identificar fuentes naturales y antropognicas de aerosoles atmosfricos.
Explicar cmo se detectan y miden los aerosoles. Describir, usando un mapa, los patrones de
aerosoles en la atmsfera. Identificar los efectos directos e indirectos de los aerosoles sobre el
clima y el ciclo hidrolgico. Identificar los efectos de los aerosoles en la salud humana..
identifying customer needs.step1 Gather raw datastep 2 Interpret.pdf
identifying customer needs.
step1 Gather raw data
step 2 Interpret raw data in terms of customer needs
step 3 organise the needs into a hierarchy
step 4 establish the relative importance of the needs
step 5 Reflect on the results and the process
conclusion
explain on these steps.
If CO2 is the acceptor in anaerobic chemolithotrophy, the donor coul.pdf
If CO2 is the acceptor in anaerobic chemolithotrophy, the donor could be?
Group of answer choices
A. O2
B. Only pyruvate or a derivative
C. Any inorganic compound that has a more positive redox potential than CO2
D. Any inorganic compound that has a more negative redox potential than CO2
E. Organic molecules such as fats, proteins, or sugars.
Identify a routine task that you might need to communicate in an off.pdf
Identify a routine task that you might need to communicate in an office. Write directions for that
task that are easy to understand. Discuss, with examples, the aspects of the communication that
make it easy for others to read and interpret it..
If a coefficient B is estimated to be very close to zero (e.g., 0.00.pdf
If a coefficient B is estimated to be very close to zero (e.g., 0.0002 or -0.0005), the independent
variable may still have a statistically significant relationship to the dependent variable.
True or False?.
i. If a product has nonuniform inputs, is WIP generally divided betw.pdf
i. If a product has nonuniform inputs, is WIP generally divided between prime costs and
overhead costs or between materials costs and conversion costs?
j. If the cost of a completed equivalent unit is $1.00, what is the unit cost of goods sold when that
good is sold?.
identify and compare three different mobile device management (MDM) .pdf
identify and compare three different mobile device management (MDM) tools. Create a table
that lists their various features for on-boarding, off-boarding, configuration, quarantine,
modification of device settings, etc. Which of the tools would you recommend for a small
business with 10 employees who use smartphones but has a single person managing IT services?
Why?.
IBM�s Stretch Project. 2500 words1. Title Page2.Introduction3..pdf
IBMs Stretch Project. 2500 words
1. Title Page
2.Introduction
3. Background of the failed project. What are the underlying causes or reasons for undertaking
project?
4. Scope/ Objectives of the failed project (design, purpose, resource, overall funding, overall
timeline)
5. Planning/ Execution of the failed project (WBS, work packages, timelines, deliverables,
milestones, cost accounts, and roles and responsibility)
6. HOW the project failed (what makes you determines that tha project was a failure? What are
or were the salient manifestations of the project's failure?)
7. Why the project failed (discuss the reasons for the project's failure).
8. Recommendations (what could or should have been doen to ensure the success of the failed
project?)
9. Conclusion
10. Bibilography.
i. Define Property, Plant and Equipment as stipulated by IAS 16 (3 .pdf
i. Define Property, Plant and Equipment as stipulated by IAS 16? (3 marks)
ii. After the initial recognition of property, plant and equipment, IAS 16 recommends two
methods which can be used to measure these non -current assets, name the two models? (3
marks)
iii. Identify the main elements that comprise the cost of Property Plant and Equipment? (5 marks).
IDEO, Amerika Birleik Devletlerindeki en b�y�k ve en etkili tasarm .pdf
IDEO, Amerika Birleik Devletleri'ndeki en byk ve en etkili tasarm danmanl firmalarndan biridir.
irket, ilk dizst bilgisayar, Apple iin ilk fare, Palm V PDA ve TiVo dijital video kaydedici dahil
olmak zere teknoloji ann birok tannabilir tasarm ikonunu yaratt. irket, ileri teknoloji sihirbazlnn
tesinde, her ikisi de Procter & Gamble iin Swiffer Sweeper ve Crest'in dik duran di macunu tp
gibi devrim niteliindeki ev eyalar tasarlad. IDEO'nun eitli mteri portfy arasnda AT&T, Bank of
America, Ford Motor Company, PepsiCo, Nike, Marriott, Caterpillar, Eli Lilly, Lufthansa, Prada
ve Mayo Clinic bulunmaktadr. IDEO'nun baars, davran tasarma dahil eden yeniliki bir yntem
olan tasarm dncesi ad verilen bir yaklama dayanmaktadr. Bu, allmadk bir problem zme yntemidir
ve eitli gemilere ve deneyimlere sahip bireylerden oluan ekipler oluturarak balar. Ekip yeleri,
antropologlar ve gazetecilerden MBA'ler ve mhendislere kadar uzanr. IDEO'nun inanc, bu
yeteneklere sahip eitli bir grubu bir araya getirirseniz, birbirlerinin fikirleri zerine ina edecekler
ve tek bir akln tek bana ulaamayaca bir zm bulacaklar. Daha sonra IDEO, tketicinin zihnine
girmek iin farkl davransal aratrma ve gzlem yntemleri kullanr. Bu, IDEO'nun derinlemesine
igrler ortaya karmasna ve tketicilerin rnleri nasl satn aldn, rnlerle nasl etkileim kurduunu,
kullandn ve hatta elden kardn anlamasna yardmc olur. rnein, bir yntem tketicileri glgede brakr,
rn satn alma veya kullanm durumlarnda fotoraflarn veya videolarn eker ve deneyimlerini daha
fazla deerlendirmek iin onlarla derinlemesine grmeler yapar. IDEO, davransal haritalama ad
verilen baka bir yntem kullanr ve deneyimin nasl iyiletirilebileceini lmek iin bir havayolu kalk
salonu, hastane bekleme odas veya yemek alan gibi belirli bir alandaki insanlarn fotorafl bir
kaydn tutar. Katlmclar, belirli bir rn veya kategoriyle ilgili grsel izlenimlerini kaydettikleri bir
"kamera gnl" tutarlar. IDEO ayrca tketicileri hikaye anlatma tekniklerini kullanmaya ve bir rn
veya hizmetle ilgili deneyimleriyle ilgili kiisel anlatlar, videolar, skeleri ve hatta animasyonlar
paylamaya davet ediyor. IDEO'nun insan merkezli yaklam, rnleri tasarlarken daha ok kendi
yeteneklerine odaklanan birok yksek teknoloji firmasnn hakim grne aykrdr. IDEO'nun teknoloji
grubu bakan David Blakely, "Teknoloji irketleri batan sona tasarm yapyor, oysa biz mterileri ilk
sraya koyabilmek iin dardan tasarlyoruz." Nihayetinde irket, stn bir deneyim sunduklar ve
sorunlar zdkleri iin tketicilerin istedii ve deer verdii rnler tasarlar. En son rn yenilikleri arasnda,
acil bir durumda talimatlarla konuan bir kalp defibrilatr ve klasik ahap snf sandalyesinin
yenilenmi bir versiyonu yer alyor. Marriott, Courtyard by Marriott otellerini gen misafirler iin
daha ekici hale getirmesine yardmc olmas iin IDEO ile anlat. IDEO, otelin salonlarnda,
lobilerinde ve restoranlarnda rportajlar yapt ve konuklar gzlemledi. Aratrmas, gen konuklarn
otelin halka ak alanlarndaki aktivite eksiklii, sunulan teknoloji .
Identify and explain two (2) examples of collaborative care that cou.pdf
Identify and explain two (2) examples of collaborative care that could be applied to prevent and
or manage the health challenge and promote wound healing of bacterial sepsis of post right knee
replacement.
I. Assessment(s) DescriptionFor this exercise, students are supp.pdf
I. Assessment(s) Description
For this exercise, students are supposed to pick up one particular bicycle model and will be asked
to analyze and redraw the design thinking steps that led to the type in question.
The Invention and the Evolution of the Bicycle: A Design Thinking Exercise
Abstract
This case examines the invention and the evolution of the design of the bicycle. The bicycle is a
great example of design for everyday objects and its shape has been characterized by a complex
evolution that is still subject to change and proposals of new design alternatives. First, the
invention of the bicycle and the evolution of its design are presented by following a socio-
technical perspective showing how the design of the bicycle has been shaped by the interplay
between the evolution of the available technologies and the emergence of new needs by specific
social groups in given times and society. Students are then asked to complete a design thinking
exercise by inspecting and disassembling an actual bicycle. Working in teams, students are
required to select a specific component and then brainstorm to conduct two exercises: suggest
design improvements and identify the impact of those improvements on the actual or prospective
users and the complex socio-technical ecosystem of the artifact.
Invention and Reinvention of the Bicycle: An Overview
The Birth of the Modern Bicycle
In the last couple of decades, the bicycle market has been characterized by robust growth driven
by many factors including green mobility, the development of e-bikes, and a growing demand for
fitness use. Despite its overall size (USD 47.51bn in 2017) and the positive outlook, the
consumer market is still highly fragmented and characterized by a large variety of product
categories, diverse design and a multiplicity of applications. The market fragmentation is, in fact,
a consequence of the unavailability of a dominant design, whose appearance typically comes
along with the emergence of a few market dominators (Suarez & Utterback, 1995). Despite its
apparent simplicity, a bicycle is a sophisticated and highly flexible machine with complicated
physics (Wilson, 2004). A bicycles design involves facing a number of non-trivial technical
challenges that have been solved in a huge variety of ways at different times and places during
the history of this industry.
While bicycles have been around for a while and we are all quite familiar with this product,
modern bicycles are fairly different from earlier models. The first documented attempt to design
and build a bicycle was performed by Karl von Drais, an employee of the University of
Heidelberg in Germany, at the beginning of the 19th century. 1 The draisine could be ridden as a
modern bicycle but had no pedals or chains and the vehicle was propelled directly by the riders
legs. The frame and wheels were made of wood and there were no tires, but the draisine could be
driven through a steering device anticipating the modern handlebar.
In .
If the fixed costs are NOK 50,000 and the variable cost can be expre.pdf
The document describes a production situation where fixed costs are NOK 50,000 and variable costs are expressed as NOK 4Q^2, where Q is quantity. It asks what the marginal cost is of the quantity that produces the lowest average cost per unit.
If an individual shopping for groceries opens a bottle of water from.pdf
If an individual shopping for groceries opens a bottle of water from their cart and drinks it before
they have paid for their items:
a quasi-contract has been created.
a unilateral contract has been created.
a bilateral contract has been created.
a voidable contract has been created..
Identify at least eight (8) accounting software. 2. Your list must i.pdf
Identify at least eight (8) accounting software. 2. Your list must include an accounting software
for small and medium business, large business and government agencies. 3. Background of the
accounting software 4. Key features and benefits 5. Disadvantages of each accounting software
6. Pricing 7. Recommend one accounting software for a small, large and government agency..
Identify the FALSE statement. Radiometric dating1. of metamorphic .pdf
Identify the FALSE statement. Radiometric dating
1. of metamorphic rock tells when the high temperatures of metamorphism cooled below the
closure temperatures of the minerals involved.
2. can begin only when the rocks cool enough to lock the isotope into the crystal lattice.
3. can be used only if there is some hydrogen present in the rock.
4. can be used only if there is some hydrogen present in the rock..
More from manojmozy (20)
IDENTIFY AND DISCUSS ONE LOCAL PROJECT THAT USED PROJECT FINANCE OR .pdf
IDENTIFY AND DISCUSS ONE LOCAL PROJECT THAT USED PROJECT FINANCE OR .pdf
If we wanted to use the AWS CLI outside of AWS (on our local PCs) wh.pdf
If we wanted to use the AWS CLI outside of AWS (on our local PCs) wh.pdf
Identifique los cinco principales pa�ses receptores de IED de EE. UU.pdf
Identifique los cinco principales pa�ses receptores de IED de EE. UU.pdf
If X is a random variable with mean 10 and standard deviation 5, whi.pdf
If X is a random variable with mean 10 and standard deviation 5, whi.pdf
Identifique la variable de control para la carga de aerosoles atmosf�r.pdf
Identifique la variable de control para la carga de aerosoles atmosf�r.pdf
identifying customer needs.step1 Gather raw datastep 2 Interpret.pdf
identifying customer needs.step1 Gather raw datastep 2 Interpret.pdf
If CO2 is the acceptor in anaerobic chemolithotrophy, the donor coul.pdf
If CO2 is the acceptor in anaerobic chemolithotrophy, the donor coul.pdf
Identify a routine task that you might need to communicate in an off.pdf
Identify a routine task that you might need to communicate in an off.pdf
If a coefficient B is estimated to be very close to zero (e.g., 0.00.pdf
If a coefficient B is estimated to be very close to zero (e.g., 0.00.pdf
i. If a product has nonuniform inputs, is WIP generally divided betw.pdf
i. If a product has nonuniform inputs, is WIP generally divided betw.pdf
identify and compare three different mobile device management (MDM) .pdf
identify and compare three different mobile device management (MDM) .pdf
IBM�s Stretch Project. 2500 words1. Title Page2.Introduction3..pdf
IBM�s Stretch Project. 2500 words1. Title Page2.Introduction3..pdf
i. Define Property, Plant and Equipment as stipulated by IAS 16 (3 .pdf
i. Define Property, Plant and Equipment as stipulated by IAS 16 (3 .pdf
IDEO, Amerika Birleik Devletlerindeki en b�y�k ve en etkili tasarm .pdf
IDEO, Amerika Birleik Devletlerindeki en b�y�k ve en etkili tasarm .pdf
Identify and explain two (2) examples of collaborative care that cou.pdf
Identify and explain two (2) examples of collaborative care that cou.pdf
I. Assessment(s) DescriptionFor this exercise, students are supp.pdf
I. Assessment(s) DescriptionFor this exercise, students are supp.pdf
If the fixed costs are NOK 50,000 and the variable cost can be expre.pdf
If the fixed costs are NOK 50,000 and the variable cost can be expre.pdf
If an individual shopping for groceries opens a bottle of water from.pdf
If an individual shopping for groceries opens a bottle of water from.pdf
Identify at least eight (8) accounting software. 2. Your list must i.pdf
Identify at least eight (8) accounting software. 2. Your list must i.pdf
Identify the FALSE statement. Radiometric dating1. of metamorphic .pdf
Identify the FALSE statement. Radiometric dating1. of metamorphic .pdf
Recently uploaded
BBR 2024 Summer Sessions Interview Training
Qualitative research interview training by Professor Katrina Pritchard and Dr Helen Williams
Stack Memory Organization of 8086 Microprocessor
The stack memory organization of 8086 microprocessor.
Philippine Edukasyong Pantahanan at Pangkabuhayan (EPP) Curriculum
(𝐓𝐋𝐄 𝟏𝟎𝟎) (𝐋𝐞𝐬𝐬𝐨𝐧 𝟏)-𝐏𝐫𝐞𝐥𝐢𝐦𝐬
𝐃𝐢𝐬𝐜𝐮𝐬𝐬 𝐭𝐡𝐞 𝐄𝐏𝐏 𝐂𝐮𝐫𝐫𝐢𝐜𝐮𝐥𝐮𝐦 𝐢𝐧 𝐭𝐡𝐞 𝐏𝐡𝐢𝐥𝐢𝐩𝐩𝐢𝐧𝐞𝐬:
- Understand the goals and objectives of the Edukasyong Pantahanan at Pangkabuhayan (EPP) curriculum, recognizing its importance in fostering practical life skills and values among students. Students will also be able to identify the key components and subjects covered, such as agriculture, home economics, industrial arts, and information and communication technology.
𝐄𝐱𝐩𝐥𝐚𝐢𝐧 𝐭𝐡𝐞 𝐍𝐚𝐭𝐮𝐫𝐞 𝐚𝐧𝐝 𝐒𝐜𝐨𝐩𝐞 𝐨𝐟 𝐚𝐧 𝐄𝐧𝐭𝐫𝐞𝐩𝐫𝐞𝐧𝐞𝐮𝐫:
-Define entrepreneurship, distinguishing it from general business activities by emphasizing its focus on innovation, risk-taking, and value creation. Students will describe the characteristics and traits of successful entrepreneurs, including their roles and responsibilities, and discuss the broader economic and social impacts of entrepreneurial activities on both local and global scales.
Traditional Musical Instruments of Arunachal Pradesh and Uttar Pradesh - RAYH...
Traditional Musical Instruments of Arunachal Pradesh and Uttar Pradesh
مصحف القراءات العشر أعد أحرف الخلاف سمير بسيوني.pdf
مصحف أحرف الخلاف للقراء العشرةأعد أحرف الخلاف بالتلوين وصلا سمير بسيوني غفر الله له
BÀI TẬP DẠY THÊM TIẾNG ANH LỚP 7 CẢ NĂM FRIENDS PLUS SÁCH CHÂN TRỜI SÁNG TẠO ...
BÀI TẬP DẠY THÊM TIẾNG ANH LỚP 7 CẢ NĂM FRIENDS PLUS SÁCH CHÂN TRỜI SÁNG TẠO ...Nguyen Thanh Tu Collection
https://app.box.com/s/qhtvq32h4ybf9t49ku85x0n3xl4jhr15How to Setup Warehouse & Location in Odoo 17 Inventory
In this slide, we'll explore how to set up warehouses and locations in Odoo 17 Inventory. This will help us manage our stock effectively, track inventory levels, and streamline warehouse operations.
How to deliver Powerpoint Presentations.pptx
"How to make and deliver dynamic presentations by making it more interactive to captivate your audience attention"
A Visual Guide to 1 Samuel | A Tale of Two Hearts
These slides walk through the story of 1 Samuel. Samuel is the last judge of Israel. The people reject God and want a king. Saul is anointed as the first king, but he is not a good king. David, the shepherd boy is anointed and Saul is envious of him. David shows honor while Saul continues to self destruct.
The History of Stoke Newington Street Names
Presented at the Stoke Newington Literary Festival on 9th June 2024
www.StokeNewingtonHistory.com
RHEOLOGY Physical pharmaceutics-II notes for B.pharm 4th sem students
Physical pharmaceutics notes for B.pharm students
Gender and Mental Health - Counselling and Family Therapy Applications and In...
A proprietary approach developed by bringing together the best of learning theories from Psychology, design principles from the world of visualization, and pedagogical methods from over a decade of training experience, that enables you to: Learn better, faster!
Leveraging Generative AI to Drive Nonprofit Innovation
In this webinar, participants learned how to utilize Generative AI to streamline operations and elevate member engagement. Amazon Web Service experts provided a customer specific use cases and dived into low/no-code tools that are quick and easy to deploy through Amazon Web Service (AWS.)
Recently uploaded (20)
NEWSPAPERS - QUESTION 1 - REVISION POWERPOINT.pptx
NEWSPAPERS - QUESTION 1 - REVISION POWERPOINT.pptx
spot a liar (Haiqa 146).pptx Technical writhing and presentation skills
spot a liar (Haiqa 146).pptx Technical writhing and presentation skills
Philippine Edukasyong Pantahanan at Pangkabuhayan (EPP) Curriculum
Philippine Edukasyong Pantahanan at Pangkabuhayan (EPP) Curriculum
Traditional Musical Instruments of Arunachal Pradesh and Uttar Pradesh - RAYH...
Traditional Musical Instruments of Arunachal Pradesh and Uttar Pradesh - RAYH...
مصحف القراءات العشر أعد أحرف الخلاف سمير بسيوني.pdf
مصحف القراءات العشر أعد أحرف الخلاف سمير بسيوني.pdf
Film vocab for eal 3 students: Australia the movie
Film vocab for eal 3 students: Australia the movie
SWOT analysis in the project Keeping the Memory @live.pptx
SWOT analysis in the project Keeping the Memory @live.pptx
BÀI TẬP DẠY THÊM TIẾNG ANH LỚP 7 CẢ NĂM FRIENDS PLUS SÁCH CHÂN TRỜI SÁNG TẠO ...
BÀI TẬP DẠY THÊM TIẾNG ANH LỚP 7 CẢ NĂM FRIENDS PLUS SÁCH CHÂN TRỜI SÁNG TẠO ...
How to Setup Warehouse & Location in Odoo 17 Inventory
How to Setup Warehouse & Location in Odoo 17 Inventory
RHEOLOGY Physical pharmaceutics-II notes for B.pharm 4th sem students
RHEOLOGY Physical pharmaceutics-II notes for B.pharm 4th sem students
Gender and Mental Health - Counselling and Family Therapy Applications and In...
Gender and Mental Health - Counselling and Family Therapy Applications and In...
Leveraging Generative AI to Drive Nonprofit Innovation
Leveraging Generative AI to Drive Nonprofit Innovation
In c code, fill in the blank#include time.h#include std.pdf
- 1. In c code, fill in the blank #include #include #include int extraMemoryAllocated; // implement merge sort // extraMemoryAllocated counts bytes of extra memory allocated void mergeSort(int pData[], int l, int r)
- 2. { } // implement insertion sort // extraMemoryAllocated counts bytes of memory allocated void insertionSort(int* pData, int n) { }
- 3. // implement bubble sort // extraMemoryAllocated counts bytes of extra memory allocated void bubbleSort(int* pData, int n) { } // implement selection sort // extraMemoryAllocated counts bytes of extra memory allocated void selectionSort(int* pData, int n)
- 4. { } // parses input file to an integer array int parseData(char *inputFileName, int **ppData) { FILE* inFile = fopen(inputFileName,"r"); int dataSz = 0; *ppData = NULL;
- 5. if (inFile) { fscanf(inFile,"%dn",&dataSz); *ppData = (int *)malloc(sizeof(int) * dataSz); // Implement parse data block } return dataSz; } // prints first and last 100 items in the data array
- 6. void printArray(int pData[], int dataSz) { int i, sz = dataSz - 100; printf("tData:nt"); for (i=0;i<100;++i) { printf("%d ",pData[i]); } printf("nt"); for (i=sz;i #include
- 7. #include int extraMemoryAllocated; // implement merge sort // extraMemoryAllocated counts bytes of extra memory allocated void mergeSort(int pData[], int l, int r) { }
- 8. // implement insertion sort // extraMemoryAllocated counts bytes of memory allocated void insertionSort(int* pData, int n) { } // implement bubble sort // extraMemoryAllocated counts bytes of extra memory allocated
- 9. void bubbleSort(int* pData, int n) { } // implement selection sort // extraMemoryAllocated counts bytes of extra memory allocated void selectionSort(int* pData, int n) { }
- 10. // parses input file to an integer array int parseData(char *inputFileName, int **ppData) { FILE* inFile = fopen(inputFileName,"r"); int dataSz = 0; *ppData = NULL; if (inFile) { fscanf(inFile,"%dn",&dataSz);
- 11. *ppData = (int *)malloc(sizeof(int) * dataSz); // Implement parse data block } return dataSz; } // prints first and last 100 items in the data array void printArray(int pData[], int dataSz) { int i, sz = dataSz - 100;