#include iostream #include iomanip Might end up not being.pdf
•
0 likes•2 views
#include #include //Might end up not being used #include using namespace std; void CopyString (char string1[24], char string2[24]); int main () { int doDebug = 0; cout << \"Do Debug Output? [Y/N]:\"; char response; cin >> response; if (response == \'y\' || response == \'Y\') { doDebug = 1; } int nameAmount; char inputFileName[50]; cout << \"Input the name of the file to be read (Include the extension, \"; cout << \"must be less than 48 characters): \"; cin >> inputFileName; inputFileName[49] = \'\\0\'; //To ensure null terminator cout << \"Input the number of names: \"; cin >> nameAmount; char namesUnsorted[nameAmount][24]; char namesSorted[nameAmount][24]; ifstream inputFile; inputFile.open(inputFileName); for (int i = 0; i < nameAmount; i++) { inputFile.getline(namesUnsorted[i], 24, \'\ \'); namesUnsorted[i][23] = \'\\0\'; } inputFile.close(); cout << \"Found the following entries in \" << inputFileName << \":\" << endl; for (int i = 0; i < nameAmount; i++) { cout << namesUnsorted[i] << endl; } //Debug if (doDebug) { cout << \"The following chars were found in entry 3: \" << endl; for (int i = 0; namesUnsorted[3][i] != \'\\0\'; i++) { cout << \"\'\" << namesUnsorted[3][i] << \"\'\" << endl; } } //Char values A-Z = [65, 90], a-z = [97, 122] //To go from lower to upper, subtract 32 //To keep track of which position is next in the sorted array int onName = 0; //Begin main sorting algorithm //Go through every letter for (char thisLetter = \'A\'; thisLetter <= \'Z\'; thisLetter++) { //Go through every name in the unsorted array for (int i = 0; i < nameAmount; i++) { //If a match is found if (namesUnsorted[i][0] == thisLetter) { //If there is already a name entered before and it starts with //the same letter as the match found if ((onName > 0) && (namesSorted[(onName - 1)][0] == thisLetter)) { cout << \"Comparing \" << namesSorted[(onName - 1)] << namesUnsorted[i] << endl; //Go through every letter to find which is lower for (int checkChar = 0; checkChar < 24; checkChar++) { char sortedChar, unsortedChar; sortedChar = namesSorted[onName - 1][checkChar]; unsortedChar = namesUnsorted[i][checkChar]; //If the char is a lowercase letter, convert to //uppercase if (sortedChar > \'Z\') { sortedChar -= 32; } if (unsortedChar > \'Z\') { unsortedChar -= 32; } //The sorted name ended sooner if (sortedChar == \'\\0\' && unsortedChar != \'\\0\') { //namesSorted[onName - 1][checkChar] = \'\\0\'; //Keep the sorted name where it is and place the //unsorted name in the entry below CopyString(namesUnsorted[i], namesSorted[onName]); break; } else if (unsortedChar == \'\\0\' && sortedChar != \'\\0\') { //The unsorted name ended sooner //namesUnsorted[i][checkChar] = \'\\0\'; //Move the sorted name down one and place the //unsorted name to where the sorted one was CopyString(namesSorted[(onName - 1)], namesSorted[onName]); CopyString(namesUnsorted[i], namesSorted[(onName - 1)]); break; } //Debug if (doDebug) { cout << \"S: \" << sortedChar << \" | U: \" << unsortedCh.
Report
Share
Report
Share
Download to read offline
![#include
#include //Might end up not being used
#include
using namespace std;
void CopyString (char string1[24], char string2[24]);
int main ()
{
int doDebug = 0;
cout << "Do Debug Output? [Y/N]:";
char response;
cin >> response;
if (response == 'y' || response == 'Y')
{
doDebug = 1;
}
int nameAmount;
char inputFileName[50];
cout << "Input the name of the file to be read (Include the extension, ";
cout << "must be less than 48 characters): ";
cin >> inputFileName;
inputFileName[49] = '0'; //To ensure null terminator
cout << "Input the number of names: ";](https://image.slidesharecdn.com/includeiostreamincludeiomanipmightendupnotbeing-230410042805-0384e6f9/85/include-iostream-include-iomanip-Might-end-up-not-being-pdf-1-320.jpg)
![cin >> nameAmount;
char namesUnsorted[nameAmount][24];
char namesSorted[nameAmount][24];
ifstream inputFile;
inputFile.open(inputFileName);
for (int i = 0; i < nameAmount; i++)
{
inputFile.getline(namesUnsorted[i], 24, ' ');
namesUnsorted[i][23] = '0';
}
inputFile.close();
cout << "Found the following entries in " << inputFileName << ":" << endl;
for (int i = 0; i < nameAmount; i++)
{
cout << namesUnsorted[i] << endl;
}
//Debug
if (doDebug)
{
cout << "The following chars were found in entry 3: " << endl;
for (int i = 0; namesUnsorted[3][i] != '0'; i++)
{](data:image/gif;base64,R0lGODlhAQABAIAAAAAAAP///yH5BAEAAAAALAAAAAABAAEAAAIBRAA7)
Recommended
Start with the inclusion of libraries#include iostream .docx
// Start with the inclusion of libraries
#include <iostream> //The library of io functions
#include <fstream> //The library of external stream functions
#include <cstdlib> //The library for external errors
#include <string> //The library for string functions
#include <cmath> //The library of C math functions
#include <iomanip> //Allows setting widths, etc. for I/O
#include <stdlib.h>
#include <stdio.h>
#include<vector>
using namespace std;
// Define all of the prototypes for functions used in the program
// Counts the number of unique letters seen
int countunique(int *array, int size);
// Creates the input file and formats it for use by the cipher section.
void createinput(string ifile, string ofile);
// Creates the encoded input file
void createcipher(int key, string ifile, string ofile);
// Finds and counts the number of digrams
int digram(int *pointer, string ifile);
// Counts the letter frequency in the encoded input file
int lettercount(int*, string ifile, string ofile);
// Finds the highest count in the singlton (or any other) array
int singleton(int*, int size);
// Trims an input file to the right size starting at an offset
void trimfile(string ifile, string ofile, int offset, int size);
// Begin the main function for testing
int main(int argc, char* argv[])
{
int count = 0;
int second = 0;
int singlefreq[26];
int *single = singlefreq;
int delta;
int loop; //The loop counter for arguments
int final = 0;
int totalcnt;
int key = -1; //Sets the key value
int len = 0; //The length to investigate for testing
int off; //Holds the offset into the file
double m; //Holds the metric error value
char loopletter;
float percent;
string ifile1 = "";
string ofile1 = "";
string deflt = "c:\\dissertation\\ShiftandSubcipherC++files\\clean.txt";
string ifile2 = "";
string ofile2 = ""; //Holds selected file path names
string cmdarg; //Holds the command line argument
string stop = "l"; //Gives the stop condition, assumes l
string reportfile = "c:\\dissertation\\test\\report.txt";
ofstream outs; //Declare an output stream for reporting
int digramc[676]; //Set up the digram array
int *two = digramc; //Point to the digram array
int dicount = 0; //Holds the count of the number of digrams
int total = 0; //Counts the total number of letters seen for analysis
for (loop = 1; loop<argc; loop++) //Decide if we have arguments or must use defaults
{
if (!argv[1])
{
// cout << "No argument found.\n";
ifile1 = deflt;
}
else
{
cmdarg = argv[loop];
if (cmdarg == "-k")
{
loop++;
key = atoi(argv[loop]);
cout << "key = " << key << endl;
}
if (cmdarg == "-l")
{
loop++;
len = atoi(argv[loop]);
cout << "Run for " << len << " characters.\n";
}
if (cmdarg == "-m")
{
loop++;
m = atof(argv[loop]);
cout << "Run until and error of " << m << "\n";
}
if (cmdarg == "-off")
{
loop++;
off = atoi(argv[loop]);
cout << ...
Program to sort the n names in an alphabetical order
It is a cpp program.Sort names by alphabetical order.
Users give some names as input and they will get sorted name by alphabetical order.I think that it may be helpful to others
Arrays
An array is a collection of data that holds a fixed number of values of the same type. Arrays can be one-dimensional or multidimensional. Array elements are accessed using indices starting from 0. Arrays can be passed to functions by passing the array name, which passes the base address. Strings in C are implemented as character arrays terminated by a null character. Common string functions like strcpy(), strcat(), strlen() etc. are used to manipulate strings.
Data StructuresPLEASE USING THIS C++ PROGRAM BELOW, I NEED HEL.pdf
Data Structures
PLEASE USING THIS C++ PROGRAM BELOW, I NEED HELP ON IMPLEMENTING
BOTH QUEUE AND STACK TO PRINT \"I able\"
REVERSE/BACKWARDS(PALINDROME)
#include
#include
using namespace std;
struct st
{
int year;
st *next;
};
class queue
{
public:
int sz,i = 0;
char chr[100];
queue()
{
//constructor for initializing front and rear to NULL
front = NULL;
rear = NULL;
cout << \"enter size of queue: \";
cin >> sz;
}
// ~queue()
// {
//
// }
// in the enterqueue, create a new node, assign value and add it to queue
// if F = R = NULL the ( ) else ( )
void enterqueue(int yr, char el)
{
//inserting into queue if queue not overflow
if(i >= sz)
{
cout << \"queue over flow\";
return;
}
if (front == NULL )
{
front = new st;
front->next = NULL;
front->year = yr;
rear = front;
chr[i] = el;
i++;
}
else
{
st *temp = new st;
temp->year = yr;
rear->next = temp;
rear = temp;
chr[i] = el;
i++;
}
}
char deletequeue()
{
//delete front data from queue if data in the queue
char tr;
int j = 0;
st *temp;
temp = front;
if( front == NULL)
{
cout << \"queue under flow\";
return \'a\';
}
if(front == rear)
{
front = rear = NULL;
return \'a\';
}
front = front->next;
delete temp;
tr = chr[0];
i--;
for(j = 0; j < i; j++)
{
chr[j] = chr[j+1];
}
chr[j] = \'\\0\';
return tr;
}
bool isempty()
{
//it shows whether queue is empty
if( front == NULL)
{
return true;
}
else
return false;
}
bool isfull()
{
//it shows whether queue is full
if(i == sz)
return true;
else
return false;
}
void display()
{
//it displays queue data with characters of queue if invalid choice is entered
st *tmp;
int j = 0;
cout << \"\ queue is:\ character \\tyear\";
for(tmp = front; tmp != rear; tmp = tmp->next, j++)
{
cout << \"\ \" << chr[j] << \" \" << tmp->year;
}
cout << \"\ \"<year;
}
private:
st *front, *rear;
};
int main()
{
//main method to call queue functions by choice
queue s1;
int ch,yr;
char el;
bool s;
while(1)
{
cout << \"\ 1.ENTERQUEUE\ 2.DELETEQUEUE\ 3.ISEMPTY\ 4.ISFULL\ 5.EXIT\ enter
your choice: \";
cin >> ch;
switch(ch)
{
case 1:
if(!s1.isfull())
{
cout << \"\ enter a year : \";
cin >> yr;
cout << \"\ enter a character : \";
cin >> el;
s1.enterqueue(yr, el);
}
else
cout << \"insertion not possible\";
break;
case 2:
s = s1.isempty();
if(!s)
{
el = s1.deletequeue();
cout << \"\ The character of queue \" << el <<\" is deleted\" << endl;
}
else
cout << \"\ queue is empty.deletion not possible\"<< endl;
break;
case 3:
s = s1.isempty();
if(s)
cout << \"\ queue is empty\" << endl;
else
cout << \"\ queue is not empty\" << endl;
break;
case 4:
s=s1.isfull();
if(s)
cout << \"\ queue is full\" << endl;
else
cout << \"\ queue is not full\" << endl;
break;
case 5:
exit(0);
default : cout << \"invalid choice\" << endl;
if(!s1.isempty())
s1.display();
}
}
return (0);
}
Solution
#include
#include
using namespace std;
struct st
{
int year;
st *next;
};
class queue
{
public:
//int sz,i=0;//modified //code modified here// everything is fine with the code except this...
queue is implemented correctly
//you can .
#include String.hpp#include ..Functionsfunctions.hpp.docx
#include "String.hpp"
#include "../Functions/functions.hpp"
// O(1)
String::String() {
// Allocate space.
array = new char[1];
// Add the null.
array[0] = '\0';
// Adjust private variables.
_capacity = 0;
_size = 0;
}
// O(1)
String::String(char c) {
// Allocate space.
array = new char[2];
// Add the character and the null.
array[0] = c;
array[1] = '\0';
// Adjust private variables.
_capacity = 1;
_size = 1;
}
// O(n)
String::String(char* str) {
// Get the length of the incoming string.
int length = 0;
while (str[length])
++length;
// Allocate space for the string plus a null.
array = new char[length + 1];
// Fill our array up, including the null.
for (int i = 0; i <= length; ++i)
array[i] = str[i];
// Adjust private variables.
_capacity = length;
_size = length;
}
// O(1)
String::~String() {
delete[] array;
}
// O(n)
char String::at(int index) const {
// If our index is negative, or beyond the size of our array, we cannot return
// anything.
return (index < 0 || (unsigned int)index >= size()) ? throw "Index"
: array[index];
}
void String::clear() {
for (unsigned int i = 0; i < _capacity; ++i)
array[i] = '\0';
_size = 0;
}
// O(n)
unsigned int String::size() const {
return _size;
}
// O(1)
bool String::empty() const {
return !this->array[0];
}
// O(1)
unsigned int String::capacity() const {
return this->_capacity;
}
// O(n)
void String::reserve(unsigned int n) {
if (!n)
return;
// Make a new array.
char* _array = new char[_capacity + n + 1]();
// Fill it up.
int length = this->size();
for (int i = 0; i <= length; ++i)
_array[i] = array[i];
// Remove old memory.
delete[] array;
// Save new memory.
array = _array;
// Adjust private variables.
_capacity += n;
return;
}
// O(n)
void String::insert(char c, int index) {
// Prepend and append as easy cases.
if (index <= 0)
prepend(c);
else if ((unsigned int)index >= size())
append(c);
else {
// Increase capacity, if needed.
if (this->size() == this->_capacity) {
this->reserve(this->size() * 2);
}
// Move all elements after index over.
for (int i = this->size() + 1; i >= index; --i)
array[i] = array[i - 1];
// Insert our new character.
array[index] = c;
_size++;
}
return;
}
// O(n)
void String::erase(char c) {
// Create a new array.
char* _array = new char[_capacity + 1];
// Copy all non-erased characters to the new array.
int length = size();
for (int i = 0, j = 0; i <= length; ++i) {
if (array[i] != c)
_array[j++] = array[i];
else
_size--;
}
// Remove the old array.
delete[] array;
array = _array;
return;
}
// O(n)
void String::remove(int index) {
// Copy all characters to the left, overwriting index.
int length = this->size();
for (int i = index; i < length; ++i)
array[i] = array[i + 1];
_ ...
#include iostream #include string #include iomanip #incl.pdf
#include
#include
#include
#include
#include
#include
using std::cin;
using std::cout;
using std::string;
using std::endl;
using std::vector;
static const string colors[] = { \"red\", \"green\", \"blue\", \"cyan\", \"magenta\", \"yellow\" };
static const int PEGNUM = 4;
static int getRandomValue()
{
static bool first = true;
if (first)
{
first = false;
srand((int)time(0));
}
return(rand());
}
static string easyToLower(string word)
{
transform(word.begin(), word.end(), word.begin(), ::tolower);
return word;
}
inline string trim(string& str) // courtesy of stack overflow
{
str.erase(0, str.find_first_not_of(\' \')); //prefixing spaces
str.erase(str.find_last_not_of(\' \') + 1); //surfixing spaces
return str;
}
static vector setNewCode()
{
vector theCode;
for (int i = 0; i < PEGNUM; i++)
{
theCode.push_back(colors[getRandomValue() % 6]);
}
return theCode;
}
static vector getPlayerGuess()
{
vector words;
string in = \"\", word=\"\";
bool okay = false;
bool quitting = false;
while (!okay)
{
cout << \"Enter your guess (red, green, blue, cyan, magenta, yellow. Enter 4 colors): \ \"< 0)
//get input
{
in = trim(in);
index = in.find_first_of(\" \");
if (index == -1)
{
word = in;
in = \"\";
}
else
word = in.substr(0, index);
words.push_back(word);
in = in.substr(index+1);
if (words.size() == PEGNUM)
{
break;
}
}
okay = true;
for (int i = 0; i < words.size(); i++) // check and standardize inputs
{
words[i] = easyToLower(words[i]);
if (words[i] == \"red\" || words[i] == \"r\")
{
words[i] = colors[0];
//cout << words[i] << endl;
}
else if (words[i] == \"green\" || words[i] == \"g\")
{
words[i] = colors[1];
//cout << words[i] << endl;
}
else if (words[i] == \"blue\" || words[i] == \"b\")
{
words[i] = colors[2];
//cout << words[i] << endl;
}
else if (words[i] == \"cyan\" || words[i] == \"c\")
{
words[i] = colors[3];
//cout << words[i] << endl;
}
else if (words[i] == \"magenta\" || words[i] == \"m\")
{
words[i] = colors[4];
//cout << words[i] << endl;
}
else if (words[i] == \"yellow\" || words[i] == \"y\")
{
words[i] = colors[5];
//cout << words[i] << endl;
}
else if (words[i] == \"quit\")
{
quitting = true;
words.clear();
words.push_back(\"quit\");
return words;
}
else
{
cout << words[i] << \" is an invalid submittion\" << endl;
words.clear();
okay = false;
}
}
if (!okay)
cout << \"Invalid entry. Please try again\ \" << endl;
if (words.size() != PEGNUM) // check if 4 entries
{
cout << \"Must enter 4 colors. Try again\ \" << endl;
words.clear();
okay = false;
}
}
return words;
}
static int setBlackPegs(vector theCode, vector guessCode)
{
int bps = 0;
for (int i = 0; i < PEGNUM; i++)
{
if (theCode[i] == guessCode[i])
bps++;
}
return bps;
}
static int setWhitePegs(vector theCode, vector guessCode, int bps)
{
int RGBCMYnumsTheCode[6];
int RGBCMYnumsGuessCode[6];
int wps=0;
for (int i = 0; i < 6; i++)
{
RGBCMYnumsTheCode[i] = 0;
RGBCMYnumsGuessCode[i] = 0;
}
for (int i = 0; i < PEGNUM; i++)
{
if (theCode[i] == colors[0])
{
RGBCMYnumsTheCode[0]++;
}
else if (theCo.
The purpose of this C++ programming project is to allow the student .pdf
The purpose of this C++ programming project is to allow the student to perform parallel array
and multidimensional array processing. The logic for string and Cstring has already been
completed, so the assignment can be started before we actually cover string and Cstring in detail.
This program has the following three menu options:
Solution
/*
This program uses simple arrays, multidimensional arrays, cstrings, strings, and files.
It allows a payroll clerk to choose an option from a menu. The choices are:
A: List the Payroll Information by Employee Name
B: Search Payroll Information by Employee Name
X: Exit the Payroll Information Module
The following items for each employee are saved in the file p10.txt:
Employee ID (1000 - 9999)
Last Name (15 characters)
First Name (15 characters)
Rate (5.00 - 10.00)
Hours W1,W2,W3,W4 (0-60)
*/
#include // file processing
#include // cin and cout
#include // toupper
#include // setw
#include // cstring functions strlen, strcmp, strcpy stored in string.h
#include // string class
#define stricmp strcasecmp
#define strnicmp strncasecmp
using namespace std;
//Disable warning messages C4267 C4996.
//To see the warnings, comment out the following line.
//#pragma warning( disable : 4267 4996)
//Warning C4267: coversion from size_t to int, possible lost of data
//size_t is a data type defined in and is an unsigned integer.
//The function strlen returns a value of the type size_t, but in
//searchByName we assign the returned value to an int.
//We could also declare the variable as size_t instead of int.
// size_t stringLength;
//Warning C4996: strnicmp strcpy, stricmp was declared deprecated, means
//the compiler encountered a function that was marked with deprecated.
//The deprecated function may no longer be supported in a future release.
//Global Constants
//When using to declare arrays, must be defined with const modifier
const int ARRAY_SIZE = 20, HOURS_SIZE = 4, NAME_SIZE = 16;
//Declare arrays as global so we don\'t have to pass the arrays to each function.
//Normally we wouldn\'t declare variables that change values a global.
int employeeId[ARRAY_SIZE];
string firstName[ARRAY_SIZE];
char lastName[ARRAY_SIZE][NAME_SIZE];
double rate[ARRAY_SIZE];
int hours[ARRAY_SIZE][HOURS_SIZE];
int numberOfEmps; //count of how many employees were loaded into arrays
int sumHours[ARRAY_SIZE] = {0}; //initialize arrays to zero by providing a
double avgHours[ARRAY_SIZE] = {0}; //value for the first element in the array
//Function Prototypes
void loadArray( );
void sumAndComputeAvgHours( );
void listByName( );
void searchByName( );
void sortByName( );
void swapValues(int i, int minIndex);
void listEmployees( );
void listEmployeesHeadings( );
void listEmployeesDetails(int i);
void listEmployeesTotals( );
void displayContinuePrompt( );
//Program starts here
int main()
{
//Declare and initialize local main variables
char choice; //menu option
//Load the arrays with data
loadArray();
//Sum and compute the average hours
sumAndComputeAv.
#include iostream #include fstream #include stack #inclu.pdf
#include
#include
#include
#include
using namespace std;
int main()
{
ifstream infile;
char f[100];
cout << \"Enter the name of the file you wish to open.\" << endl;
cin >> f;
infile.open(f);
//cout << f << endl;
if(infile.fail())
{
cout << \"Cannot find file.\" << endl;
}
else
{
char c;
std::stack mystack;
int flag=0;
while(infile>>c)
{
if(c==\'(\'||c==\'[\'||c==\'{\')
{
mystack.push(c);
}
if(!mystack.empty()&& (c==\')\' || c==\']\'||c==\'}\'))
{
if(
(mystack.top()==\'(\'&&c==\')\'||mystack.top()==\'{\'&&c==\'}\'||mystack.top()==\'[\'&&c==\']\'))
{
mystack.pop();
}
else
{
flag==1;
break;
}
}
else
{
flag=1;
break;
}
}
if(mystack.empty()&&flag==0)
{
cout<<\"File data is balanced\";
}
else
{
cout<<\"File data is not balanced\";
}
}
}
Solution
#include
#include
#include
#include
using namespace std;
int main()
{
ifstream infile;
char f[100];
cout << \"Enter the name of the file you wish to open.\" << endl;
cin >> f;
infile.open(f);
//cout << f << endl;
if(infile.fail())
{
cout << \"Cannot find file.\" << endl;
}
else
{
char c;
std::stack mystack;
int flag=0;
while(infile>>c)
{
if(c==\'(\'||c==\'[\'||c==\'{\')
{
mystack.push(c);
}
if(!mystack.empty()&& (c==\')\' || c==\']\'||c==\'}\'))
{
if(
(mystack.top()==\'(\'&&c==\')\'||mystack.top()==\'{\'&&c==\'}\'||mystack.top()==\'[\'&&c==\']\'))
{
mystack.pop();
}
else
{
flag==1;
break;
}
}
else
{
flag=1;
break;
}
}
if(mystack.empty()&&flag==0)
{
cout<<\"File data is balanced\";
}
else
{
cout<<\"File data is not balanced\";
}
}
}.
Recommended
Start with the inclusion of libraries#include iostream .docx
// Start with the inclusion of libraries
#include <iostream> //The library of io functions
#include <fstream> //The library of external stream functions
#include <cstdlib> //The library for external errors
#include <string> //The library for string functions
#include <cmath> //The library of C math functions
#include <iomanip> //Allows setting widths, etc. for I/O
#include <stdlib.h>
#include <stdio.h>
#include<vector>
using namespace std;
// Define all of the prototypes for functions used in the program
// Counts the number of unique letters seen
int countunique(int *array, int size);
// Creates the input file and formats it for use by the cipher section.
void createinput(string ifile, string ofile);
// Creates the encoded input file
void createcipher(int key, string ifile, string ofile);
// Finds and counts the number of digrams
int digram(int *pointer, string ifile);
// Counts the letter frequency in the encoded input file
int lettercount(int*, string ifile, string ofile);
// Finds the highest count in the singlton (or any other) array
int singleton(int*, int size);
// Trims an input file to the right size starting at an offset
void trimfile(string ifile, string ofile, int offset, int size);
// Begin the main function for testing
int main(int argc, char* argv[])
{
int count = 0;
int second = 0;
int singlefreq[26];
int *single = singlefreq;
int delta;
int loop; //The loop counter for arguments
int final = 0;
int totalcnt;
int key = -1; //Sets the key value
int len = 0; //The length to investigate for testing
int off; //Holds the offset into the file
double m; //Holds the metric error value
char loopletter;
float percent;
string ifile1 = "";
string ofile1 = "";
string deflt = "c:\\dissertation\\ShiftandSubcipherC++files\\clean.txt";
string ifile2 = "";
string ofile2 = ""; //Holds selected file path names
string cmdarg; //Holds the command line argument
string stop = "l"; //Gives the stop condition, assumes l
string reportfile = "c:\\dissertation\\test\\report.txt";
ofstream outs; //Declare an output stream for reporting
int digramc[676]; //Set up the digram array
int *two = digramc; //Point to the digram array
int dicount = 0; //Holds the count of the number of digrams
int total = 0; //Counts the total number of letters seen for analysis
for (loop = 1; loop<argc; loop++) //Decide if we have arguments or must use defaults
{
if (!argv[1])
{
// cout << "No argument found.\n";
ifile1 = deflt;
}
else
{
cmdarg = argv[loop];
if (cmdarg == "-k")
{
loop++;
key = atoi(argv[loop]);
cout << "key = " << key << endl;
}
if (cmdarg == "-l")
{
loop++;
len = atoi(argv[loop]);
cout << "Run for " << len << " characters.\n";
}
if (cmdarg == "-m")
{
loop++;
m = atof(argv[loop]);
cout << "Run until and error of " << m << "\n";
}
if (cmdarg == "-off")
{
loop++;
off = atoi(argv[loop]);
cout << ...
Program to sort the n names in an alphabetical order
It is a cpp program.Sort names by alphabetical order.
Users give some names as input and they will get sorted name by alphabetical order.I think that it may be helpful to others
Arrays
An array is a collection of data that holds a fixed number of values of the same type. Arrays can be one-dimensional or multidimensional. Array elements are accessed using indices starting from 0. Arrays can be passed to functions by passing the array name, which passes the base address. Strings in C are implemented as character arrays terminated by a null character. Common string functions like strcpy(), strcat(), strlen() etc. are used to manipulate strings.
Data StructuresPLEASE USING THIS C++ PROGRAM BELOW, I NEED HEL.pdf
Data Structures
PLEASE USING THIS C++ PROGRAM BELOW, I NEED HELP ON IMPLEMENTING
BOTH QUEUE AND STACK TO PRINT \"I able\"
REVERSE/BACKWARDS(PALINDROME)
#include
#include
using namespace std;
struct st
{
int year;
st *next;
};
class queue
{
public:
int sz,i = 0;
char chr[100];
queue()
{
//constructor for initializing front and rear to NULL
front = NULL;
rear = NULL;
cout << \"enter size of queue: \";
cin >> sz;
}
// ~queue()
// {
//
// }
// in the enterqueue, create a new node, assign value and add it to queue
// if F = R = NULL the ( ) else ( )
void enterqueue(int yr, char el)
{
//inserting into queue if queue not overflow
if(i >= sz)
{
cout << \"queue over flow\";
return;
}
if (front == NULL )
{
front = new st;
front->next = NULL;
front->year = yr;
rear = front;
chr[i] = el;
i++;
}
else
{
st *temp = new st;
temp->year = yr;
rear->next = temp;
rear = temp;
chr[i] = el;
i++;
}
}
char deletequeue()
{
//delete front data from queue if data in the queue
char tr;
int j = 0;
st *temp;
temp = front;
if( front == NULL)
{
cout << \"queue under flow\";
return \'a\';
}
if(front == rear)
{
front = rear = NULL;
return \'a\';
}
front = front->next;
delete temp;
tr = chr[0];
i--;
for(j = 0; j < i; j++)
{
chr[j] = chr[j+1];
}
chr[j] = \'\\0\';
return tr;
}
bool isempty()
{
//it shows whether queue is empty
if( front == NULL)
{
return true;
}
else
return false;
}
bool isfull()
{
//it shows whether queue is full
if(i == sz)
return true;
else
return false;
}
void display()
{
//it displays queue data with characters of queue if invalid choice is entered
st *tmp;
int j = 0;
cout << \"\ queue is:\ character \\tyear\";
for(tmp = front; tmp != rear; tmp = tmp->next, j++)
{
cout << \"\ \" << chr[j] << \" \" << tmp->year;
}
cout << \"\ \"<year;
}
private:
st *front, *rear;
};
int main()
{
//main method to call queue functions by choice
queue s1;
int ch,yr;
char el;
bool s;
while(1)
{
cout << \"\ 1.ENTERQUEUE\ 2.DELETEQUEUE\ 3.ISEMPTY\ 4.ISFULL\ 5.EXIT\ enter
your choice: \";
cin >> ch;
switch(ch)
{
case 1:
if(!s1.isfull())
{
cout << \"\ enter a year : \";
cin >> yr;
cout << \"\ enter a character : \";
cin >> el;
s1.enterqueue(yr, el);
}
else
cout << \"insertion not possible\";
break;
case 2:
s = s1.isempty();
if(!s)
{
el = s1.deletequeue();
cout << \"\ The character of queue \" << el <<\" is deleted\" << endl;
}
else
cout << \"\ queue is empty.deletion not possible\"<< endl;
break;
case 3:
s = s1.isempty();
if(s)
cout << \"\ queue is empty\" << endl;
else
cout << \"\ queue is not empty\" << endl;
break;
case 4:
s=s1.isfull();
if(s)
cout << \"\ queue is full\" << endl;
else
cout << \"\ queue is not full\" << endl;
break;
case 5:
exit(0);
default : cout << \"invalid choice\" << endl;
if(!s1.isempty())
s1.display();
}
}
return (0);
}
Solution
#include
#include
using namespace std;
struct st
{
int year;
st *next;
};
class queue
{
public:
//int sz,i=0;//modified //code modified here// everything is fine with the code except this...
queue is implemented correctly
//you can .
#include String.hpp#include ..Functionsfunctions.hpp.docx
#include "String.hpp"
#include "../Functions/functions.hpp"
// O(1)
String::String() {
// Allocate space.
array = new char[1];
// Add the null.
array[0] = '\0';
// Adjust private variables.
_capacity = 0;
_size = 0;
}
// O(1)
String::String(char c) {
// Allocate space.
array = new char[2];
// Add the character and the null.
array[0] = c;
array[1] = '\0';
// Adjust private variables.
_capacity = 1;
_size = 1;
}
// O(n)
String::String(char* str) {
// Get the length of the incoming string.
int length = 0;
while (str[length])
++length;
// Allocate space for the string plus a null.
array = new char[length + 1];
// Fill our array up, including the null.
for (int i = 0; i <= length; ++i)
array[i] = str[i];
// Adjust private variables.
_capacity = length;
_size = length;
}
// O(1)
String::~String() {
delete[] array;
}
// O(n)
char String::at(int index) const {
// If our index is negative, or beyond the size of our array, we cannot return
// anything.
return (index < 0 || (unsigned int)index >= size()) ? throw "Index"
: array[index];
}
void String::clear() {
for (unsigned int i = 0; i < _capacity; ++i)
array[i] = '\0';
_size = 0;
}
// O(n)
unsigned int String::size() const {
return _size;
}
// O(1)
bool String::empty() const {
return !this->array[0];
}
// O(1)
unsigned int String::capacity() const {
return this->_capacity;
}
// O(n)
void String::reserve(unsigned int n) {
if (!n)
return;
// Make a new array.
char* _array = new char[_capacity + n + 1]();
// Fill it up.
int length = this->size();
for (int i = 0; i <= length; ++i)
_array[i] = array[i];
// Remove old memory.
delete[] array;
// Save new memory.
array = _array;
// Adjust private variables.
_capacity += n;
return;
}
// O(n)
void String::insert(char c, int index) {
// Prepend and append as easy cases.
if (index <= 0)
prepend(c);
else if ((unsigned int)index >= size())
append(c);
else {
// Increase capacity, if needed.
if (this->size() == this->_capacity) {
this->reserve(this->size() * 2);
}
// Move all elements after index over.
for (int i = this->size() + 1; i >= index; --i)
array[i] = array[i - 1];
// Insert our new character.
array[index] = c;
_size++;
}
return;
}
// O(n)
void String::erase(char c) {
// Create a new array.
char* _array = new char[_capacity + 1];
// Copy all non-erased characters to the new array.
int length = size();
for (int i = 0, j = 0; i <= length; ++i) {
if (array[i] != c)
_array[j++] = array[i];
else
_size--;
}
// Remove the old array.
delete[] array;
array = _array;
return;
}
// O(n)
void String::remove(int index) {
// Copy all characters to the left, overwriting index.
int length = this->size();
for (int i = index; i < length; ++i)
array[i] = array[i + 1];
_ ...
#include iostream #include string #include iomanip #incl.pdf
#include
#include
#include
#include
#include
#include
using std::cin;
using std::cout;
using std::string;
using std::endl;
using std::vector;
static const string colors[] = { \"red\", \"green\", \"blue\", \"cyan\", \"magenta\", \"yellow\" };
static const int PEGNUM = 4;
static int getRandomValue()
{
static bool first = true;
if (first)
{
first = false;
srand((int)time(0));
}
return(rand());
}
static string easyToLower(string word)
{
transform(word.begin(), word.end(), word.begin(), ::tolower);
return word;
}
inline string trim(string& str) // courtesy of stack overflow
{
str.erase(0, str.find_first_not_of(\' \')); //prefixing spaces
str.erase(str.find_last_not_of(\' \') + 1); //surfixing spaces
return str;
}
static vector setNewCode()
{
vector theCode;
for (int i = 0; i < PEGNUM; i++)
{
theCode.push_back(colors[getRandomValue() % 6]);
}
return theCode;
}
static vector getPlayerGuess()
{
vector words;
string in = \"\", word=\"\";
bool okay = false;
bool quitting = false;
while (!okay)
{
cout << \"Enter your guess (red, green, blue, cyan, magenta, yellow. Enter 4 colors): \ \"< 0)
//get input
{
in = trim(in);
index = in.find_first_of(\" \");
if (index == -1)
{
word = in;
in = \"\";
}
else
word = in.substr(0, index);
words.push_back(word);
in = in.substr(index+1);
if (words.size() == PEGNUM)
{
break;
}
}
okay = true;
for (int i = 0; i < words.size(); i++) // check and standardize inputs
{
words[i] = easyToLower(words[i]);
if (words[i] == \"red\" || words[i] == \"r\")
{
words[i] = colors[0];
//cout << words[i] << endl;
}
else if (words[i] == \"green\" || words[i] == \"g\")
{
words[i] = colors[1];
//cout << words[i] << endl;
}
else if (words[i] == \"blue\" || words[i] == \"b\")
{
words[i] = colors[2];
//cout << words[i] << endl;
}
else if (words[i] == \"cyan\" || words[i] == \"c\")
{
words[i] = colors[3];
//cout << words[i] << endl;
}
else if (words[i] == \"magenta\" || words[i] == \"m\")
{
words[i] = colors[4];
//cout << words[i] << endl;
}
else if (words[i] == \"yellow\" || words[i] == \"y\")
{
words[i] = colors[5];
//cout << words[i] << endl;
}
else if (words[i] == \"quit\")
{
quitting = true;
words.clear();
words.push_back(\"quit\");
return words;
}
else
{
cout << words[i] << \" is an invalid submittion\" << endl;
words.clear();
okay = false;
}
}
if (!okay)
cout << \"Invalid entry. Please try again\ \" << endl;
if (words.size() != PEGNUM) // check if 4 entries
{
cout << \"Must enter 4 colors. Try again\ \" << endl;
words.clear();
okay = false;
}
}
return words;
}
static int setBlackPegs(vector theCode, vector guessCode)
{
int bps = 0;
for (int i = 0; i < PEGNUM; i++)
{
if (theCode[i] == guessCode[i])
bps++;
}
return bps;
}
static int setWhitePegs(vector theCode, vector guessCode, int bps)
{
int RGBCMYnumsTheCode[6];
int RGBCMYnumsGuessCode[6];
int wps=0;
for (int i = 0; i < 6; i++)
{
RGBCMYnumsTheCode[i] = 0;
RGBCMYnumsGuessCode[i] = 0;
}
for (int i = 0; i < PEGNUM; i++)
{
if (theCode[i] == colors[0])
{
RGBCMYnumsTheCode[0]++;
}
else if (theCo.
The purpose of this C++ programming project is to allow the student .pdf
The purpose of this C++ programming project is to allow the student to perform parallel array
and multidimensional array processing. The logic for string and Cstring has already been
completed, so the assignment can be started before we actually cover string and Cstring in detail.
This program has the following three menu options:
Solution
/*
This program uses simple arrays, multidimensional arrays, cstrings, strings, and files.
It allows a payroll clerk to choose an option from a menu. The choices are:
A: List the Payroll Information by Employee Name
B: Search Payroll Information by Employee Name
X: Exit the Payroll Information Module
The following items for each employee are saved in the file p10.txt:
Employee ID (1000 - 9999)
Last Name (15 characters)
First Name (15 characters)
Rate (5.00 - 10.00)
Hours W1,W2,W3,W4 (0-60)
*/
#include // file processing
#include // cin and cout
#include // toupper
#include // setw
#include // cstring functions strlen, strcmp, strcpy stored in string.h
#include // string class
#define stricmp strcasecmp
#define strnicmp strncasecmp
using namespace std;
//Disable warning messages C4267 C4996.
//To see the warnings, comment out the following line.
//#pragma warning( disable : 4267 4996)
//Warning C4267: coversion from size_t to int, possible lost of data
//size_t is a data type defined in and is an unsigned integer.
//The function strlen returns a value of the type size_t, but in
//searchByName we assign the returned value to an int.
//We could also declare the variable as size_t instead of int.
// size_t stringLength;
//Warning C4996: strnicmp strcpy, stricmp was declared deprecated, means
//the compiler encountered a function that was marked with deprecated.
//The deprecated function may no longer be supported in a future release.
//Global Constants
//When using to declare arrays, must be defined with const modifier
const int ARRAY_SIZE = 20, HOURS_SIZE = 4, NAME_SIZE = 16;
//Declare arrays as global so we don\'t have to pass the arrays to each function.
//Normally we wouldn\'t declare variables that change values a global.
int employeeId[ARRAY_SIZE];
string firstName[ARRAY_SIZE];
char lastName[ARRAY_SIZE][NAME_SIZE];
double rate[ARRAY_SIZE];
int hours[ARRAY_SIZE][HOURS_SIZE];
int numberOfEmps; //count of how many employees were loaded into arrays
int sumHours[ARRAY_SIZE] = {0}; //initialize arrays to zero by providing a
double avgHours[ARRAY_SIZE] = {0}; //value for the first element in the array
//Function Prototypes
void loadArray( );
void sumAndComputeAvgHours( );
void listByName( );
void searchByName( );
void sortByName( );
void swapValues(int i, int minIndex);
void listEmployees( );
void listEmployeesHeadings( );
void listEmployeesDetails(int i);
void listEmployeesTotals( );
void displayContinuePrompt( );
//Program starts here
int main()
{
//Declare and initialize local main variables
char choice; //menu option
//Load the arrays with data
loadArray();
//Sum and compute the average hours
sumAndComputeAv.
#include iostream #include fstream #include stack #inclu.pdf
#include
#include
#include
#include
using namespace std;
int main()
{
ifstream infile;
char f[100];
cout << \"Enter the name of the file you wish to open.\" << endl;
cin >> f;
infile.open(f);
//cout << f << endl;
if(infile.fail())
{
cout << \"Cannot find file.\" << endl;
}
else
{
char c;
std::stack mystack;
int flag=0;
while(infile>>c)
{
if(c==\'(\'||c==\'[\'||c==\'{\')
{
mystack.push(c);
}
if(!mystack.empty()&& (c==\')\' || c==\']\'||c==\'}\'))
{
if(
(mystack.top()==\'(\'&&c==\')\'||mystack.top()==\'{\'&&c==\'}\'||mystack.top()==\'[\'&&c==\']\'))
{
mystack.pop();
}
else
{
flag==1;
break;
}
}
else
{
flag=1;
break;
}
}
if(mystack.empty()&&flag==0)
{
cout<<\"File data is balanced\";
}
else
{
cout<<\"File data is not balanced\";
}
}
}
Solution
#include
#include
#include
#include
using namespace std;
int main()
{
ifstream infile;
char f[100];
cout << \"Enter the name of the file you wish to open.\" << endl;
cin >> f;
infile.open(f);
//cout << f << endl;
if(infile.fail())
{
cout << \"Cannot find file.\" << endl;
}
else
{
char c;
std::stack mystack;
int flag=0;
while(infile>>c)
{
if(c==\'(\'||c==\'[\'||c==\'{\')
{
mystack.push(c);
}
if(!mystack.empty()&& (c==\')\' || c==\']\'||c==\'}\'))
{
if(
(mystack.top()==\'(\'&&c==\')\'||mystack.top()==\'{\'&&c==\'}\'||mystack.top()==\'[\'&&c==\']\'))
{
mystack.pop();
}
else
{
flag==1;
break;
}
}
else
{
flag=1;
break;
}
}
if(mystack.empty()&&flag==0)
{
cout<<\"File data is balanced\";
}
else
{
cout<<\"File data is not balanced\";
}
}
}.
For C# need to make these changes to this programm, httppastebin..pdf
For C# need to make these changes to this programm, http://pastebin.com/nBsBETd8
For this assignment, rewrite the CS7 Array to use a string typed List.
Review the CS7 Arrays program.
The main changes to make to CS7 Arrays to complete your assignment include:
The function names may stay the same.
Change the declaration of cstrName[] to List cstrName = new List( );
The variable cintNumberOfNames will not be needed because cstrName.Count can be used.
In CS7Form_Load:
Delete int i = 0;
The if-else statement to check if the array size has been exceeded is not needed since lists can
grow.
Use the Add method to load the names in the list,
cstrName.Add(nameStreamReader.ReadLine());
The names still need to be displayed in the listbox after the list is loaded.
In displayNames( ) change cintNumberOfNames to cstrName.Count.
In btnSortByName, all of the logic can be replaced with a call to Sort, cstrName.Sort(); The
names have to be redisplayed after the sort.
In btnSearchByName:
Declare a varible to store the result of the search, int intIndex;
Call btnSortByName to sort and redisplay the array just in case it hasn\'t be sorted.
Use the BinarySearch method to conduct the search,
intIndex = cstrName.BinarySearch(txtSearchName.Text);
A negative value is returned if the value is not found, else the zero-based index of the element is
returned. In the statement above, the result is stored in intIndex. intIndex could then be checked
if the result is >= zero, such as if (intIndex >= 0 )
Use the result to display a message if the name was not found, else select the matching entry in
listbox and display a message indicating the name was found.
In btnDelete use the RemoveAt method to delete the name at the top of the list. Before calling
RemoveAt, check that Count is greater than zero to avoid a run-time exception. The names have
to be redisplayed after removing a name.
here is the code,
using System;
using System.Collections.Generic;
using System.ComponentModel;
using System.Data;
using System.Drawing;
using System.Text;
using System.Windows.Forms;
//Project: CS7 Array Processing
//Programmer: Daryl Austin
//Description: Declare and load an array with a list of names.
// The user can sort the list by name and search by name.
// Names can be deleted from the top of the list.
using System.IO; // FileStream and StreamReader
namespace CS7
{
public partial class CS7Form : Form
{
public CS7Form()
{
InitializeComponent();
}
//Declare class-level arrays
//Array can hold up to 10 names.
string[] cstrName = new string[9];
//Use cintNumberOfCustomers to process array because array
//may be partially loaded. Count set in CS7Form_Load
int cintNumberOfNames;
private void CS7Form_Load(object sender, EventArgs e)
{
int i = 0; // subscript initialized to zero
try
{
//Load the array with the data in the file
FileStream nameFile = new FileStream(\"cs7.txt\", FileMode.Open);
StreamReader nameStreamReader = new StreamReader(nameFile);
while (nameStreamReader.Peek() != -1)
{
if (i < c.
SPL 13 | Character Array(String) in C
This document discusses strings in C programming language. It defines a string as an array of characters terminated by a null character. It explains how to declare and initialize strings, read and write strings, determine string length, concatenate strings, copy strings, compare strings, convert between strings and integers, and various string processing functions like reversing, converting case, etc. It provides examples of implementing these string operations both through character-wise processing and using predefined string header functions.
2DArrays.ppt
computer dataA computer is a machine that can be programmed to carry out sequences of arithmetic or logical operations (computation) automatically. Modern digital electronic computers can perform generic sets of operations known as programs. These programs enable computers to perform a wide range of tasks. A computer system is a nominally complete computer that includes the hardware, operating system (main software), and peripheral equipment needed and used for full operation. This term may also refer to a group of computers that are linked and function together, such as a computer network or computer cluster.
A broad range of industrial and consumer products use computers as control systems. Simple special-purpose devices like microwave ovens and remote controls are included, as are factory devices like industrial robots and computer-aided design, as well as general-purpose devices like personal computers and mobile devices like smartphones. Computers power the Internet, which links billions of other computers and users.
Early computers were meant to be used only for calculations. Simple manual instruments like the abacus have aided people in doing calculations since ancient times. Early in the Industrial Revolution, some mechanical devices were built to automate long, tedious tasks, such as guiding patterns for looms. More sophisticated electrical machines did specialized analog calculations in the early 20th century. The first digital electronic calculating machines were developed during World War II. The first semiconductor transistors in the late 1940s were followed by the silicon-based MOSFET (MOS transistor) and monolithic integrated circuit chip technologies in the late 1950s, leading to the microprocessor and the microcomputer revolution in the 1970s. The speed, power and versatility of computers have been increasing dramatically ever since then, with transistor counts increasing at a rapid pace (as predicted by Moore's law), leading to the Digital Revolution during the late 20th to early 21st centuries.
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.
#include stdio.h#include stdlib.h#include string.h#inclu.pdf
#include
#include
#include
#include
/*Structure for storing words received from each thread*/
struct return_val{
char wordlist[100][100];
int count[100];
} *arr;
pthread_t *threads;
int lines;
/*Aggregates Frequency Sum of different threads*/
int aggregate(char *a)
{
int sum = 0;
int i=0;
while(1)
{
if(i==lines) break;
int count = 0;
while(1)
{
if(arr[i].count[count] == -1)
{
break;
}
if(strcmp(a,arr[i].wordlist[count]) == 0)
{
sum += arr[i].count[count];
arr[i].count[count] = 0;
}
count++;
}
i++;
}
return sum;
}
/*Function executed by each thread on separate line*/
void *word_count(void* num)
{
int *ln = num;
unsigned int line_number = *ln;
line_number++;
char cmd_p1[9] = \"sed -n \'\\0\";
char cmd_p2[2];
sprintf(cmd_p2,\"%d\",line_number);
char cmd_p3[14] = \"p\' \'file.txt\'\\0\";
char command[100];
command[0] = \'\\0\';
strcat(command,cmd_p1);
strcat(command,cmd_p2);
strcat(command,cmd_p3);
//usleep(line_number);
char cmd[100] = \" | tr [:space:] \'\\\ \' | grep -v \'^\\\\s*$\' | sort | uniq -c | sort\\0\";
strcat(command,cmd);
FILE *in;
in= popen(command, \"r\");
rewind(in);
char buff[50];
int counter = 0;
while(fgets(buff,sizeof(buff),in))
{
char c=\' \';
int i = 0;
int cnt = atoi(buff);
arr[line_number-1].count[counter] = cnt;
while(c!=\'\\0\')
{
c=buff[i];
buff[i]=buff[i+6];
i++;
}
int cnnt = 0;
while(c!=\' \')
{
c = buff[cnnt];
cnnt++;
}
i=0;
while(c!=\'\\0\')
{
c=buff[i];
buff[i]=buff[i+cnnt];
i++;
}
sprintf(arr[line_number-1].wordlist[counter],\"%s\",buff);
counter++;
}
arr[line_number-1].count[counter] = -1;
fclose(in);
return NULL;
}
int main(void)
{
FILE *fp;
fp = fopen(\"file.txt\",\"r\");
char a[200];
lines = 0;
void *status = NULL;
while(fgets(a,sizeof(a),fp) !=NULL)
{
lines++;
}
fclose(fp);
arr = (struct return_val*) calloc(lines, sizeof(struct return_val) * lines);
threads = malloc(sizeof(pthread_t)*lines);
int i;
for(i=0;i= 0)
{
if(arr[i].count[ctr] > 0)
{
strcpy(final[final_ctr],arr[i].wordlist[ctr]);
final_cnt[final_ctr] = arr[i].count[ctr];
arr[i].count[ctr] = 0;
int sum = aggregate(arr[i].wordlist[ctr]);
final_cnt[final_ctr] += sum;
printf(\"%d %s\",final_cnt[final_ctr],final[final_ctr]);
}
ctr++; final_ctr++;
}
i++;
if(i==lines)
{
break;
}
}
free(arr);
return 0;
}
#include
#include
#include
#include
/*Structure for storing words received from each thread*/
struct return_val{
char wordlist[100][100];
int count[100];
} *arr;
pthread_t *threads;
int lines;
/*Aggregates Frequency Sum of different threads*/
int aggregate(char *a)
{
int sum = 0;
int i=0;
while(1)
{
if(i==lines) break;
int count = 0;
while(1)
{
if(arr[i].count[count] == -1)
{
break;
}
if(strcmp(a,arr[i].wordlist[count]) == 0)
{
sum += arr[i].count[count];
arr[i].count[count] = 0;
}
count++;
}
i++;
}
return sum;
}
/*Function executed by each thread on separate line*/
void *word_count(void* num)
{
int *ln = num;
unsigned int line_number = *ln;
line_number++;
char cmd_p1[9] = \"sed -n \'\\0\";
char cmd_p2[2];
sprintf(cmd_p2,\"%d\",line_number);
char cmd_p3[14] .
Hello Everyone!!!I’m writing a c++ program that presents a menu to.pdf
The document describes a C++ program that implements a linked list to store names and phone numbers. The program presents a menu with options to insert, modify, delete, find records in the linked list. The code includes function prototypes and implementations for populating, displaying, inserting, modifying and removing records from the linked list. The author is asking for help implementing the delete and find functions, as those functions have not been fully implemented in the code provided.
So I am writing a CS code for a project and I keep getting cannot .pdf
So I am writing a CS code for a project and I keep getting \"cannot open file\" I know I put it into
my code, but I don\'t know why it won\'t execute after i input ./a.out I put in gcc -Wall
contents3.c and no errors or warnings pop up. So I figure everything is working right. But after
that, I get \"Cannot open file\". So I am wondering what I can do to get this settled out properly. I
am putting the outcome of the project and my code. Please someone help me!
#include
#include
#include
#include
#include
#include
int len = 0;
int sp = 0;
int lwrcaseCount = 0;
int uprcaseCount = 0;
int digitCount = 0;
int specialCount = 0;
char data[200];
int frequency[84];
int sortFrequency[84][2];
char string[] =
\"abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ!\\\"#$%&\'()*+,-
./:;<=>?@[/]^_`{|}~\";
//printf(\"\ \");
//To sort based on frequency of characters
/*void sort()
{
int max, loc, temp, x, y;
//Loops till end - 1 position of the frequency array
for(x = 0; x <= 84 - 1; x++)
{
//Initializes the max to the x position of the frequency array assuming it as maximum
max = frequency[x];
//Initializes of loc to x assuming location x contains the maximum value
loc = x;
//Loops through x + 1 to length - 1 of frequency array
for(y = x + 1; y <= 95 -1; y++)
{
//If current position of the frequency of the array is greater than the max
//then update the max with the current value of frequency and update the loc
if(frequency[y] > max)
{
max = frequency[y];
loc = y;
}//end of if
}//end of for loop
//If loc is not x then swap
if(loc != x)
{
temp = frequency[x];
frequency[x] = frequency[loc];
frequency[loc] = temp;
}//end of if
//Store the location of the maximum value in the zero column position of row x
sortFrequency[x][0]= loc;
//Store the maximum value in the first column position of row x
sortFrequency[x][1] = max;
}//end of for loop
}//end of function*/
void sort()
{
for(int i = 0; i < 84; i++)
{
sortFrequency[i][0] = i;
sortFrequency[i][1] = frequency[i];
}
for(int i = 0; i < 84-1; i++)
for(int j = 0; j < 84-i-1; j++)
if(sortFrequency[j][1] < sortFrequency[j+1][1])
{
int temp = sortFrequency[j][1];
sortFrequency[j][1] = sortFrequency[j+1][1];
sortFrequency[j+1][1] = temp;
temp = sortFrequency[j][0];
sortFrequency[j][0] = sortFrequency[j+1][0];
sortFrequency[j+1][0] = temp;
}
}
//To count frequency of each character
void frequencyCount()
{
int c, d;
//Loops till the length of the inputed data
for(c = 0; c < len; c++)
{
//Loops from 33 to 126 which is the ascii values of required characters range
for(d = 0; d < 84; d++)
{
//If the data in the current position is equal to the acii value
if(data[c] == string[d])
//Frequency 0 position is equal to 33 ascii.
//So 33 is deducted
frequency[d]++;
}//end of for loop
}//end of for loop
}//End of function
//Initializes the frequency array to zero
void initialize()
{
int c;
for(c = 0; c < 84; c++)
frequency[c] = 0;
}
//Read the file which contains data
void readFile()
{
//File pointer created
FILE *fptr;
char ch;
//Fi.
please help with java questionsJAVA CODEplease check my code and.pdf
please help with java questions
JAVA CODE
please check my code and help my questions
CLASS ADDRESS
public class Address{
private int streetNumber;
private String streetName;
private String city;
private String state;
private String country;
// streetNumber
// streetName
// city
// state
// country
public Address(int streetNumber, String streetName, String city, String state, String country) {
this.streetNumber = streetNumber;
this.streetName = streetName;
this.city = city;
this.state = state;
this.country = country;
}
//return the streetNumber
public int getStreetNumber() {
return streetNumber;
}
// set street number
public void setStreetNumber(int streetNumber) {
this.streetNumber = streetNumber;
}
//return the streetName
public String getStreetName() {
return streetName;
}
// set street name
public void setStreetName(String streetName) {
this.streetName = streetName;
}
//return the city
public String getCity() {
return city;
}
//set the city
public void setCity(String city) {
this.city = city;
}
//return the state
public String getState() {
return state;
}
//the state to set
public void setState(String state) {
this.state = state;
}
// return the country
public String getCountry() {
return country;
}
// tset country
public void setCountry(String country) {
this.country = country;
}
// see java.lang.Object#toString()
@Override
public String toString() {
return \" [streetNumber=\" + streetNumber + \", streetName=\" + streetName
+ \", city=\" + city + \", state=\" + state + \", country=\"
+ country + \"]\";
}
}
////////////////////////////////////////////////////////////////////////////////////////
CLASS PERSON
public class Person extends Address {
private String name;
public Person (int streetNumber, String streetName, String city, String state, String country,
String name) {
super(streetNumber, streetName, city, state, country);
this.name = name;
}
//retuurn name
public String getName() {
return name;
}
// set name
public void setName(String name) {
this.name = name;
}
//see java.lang.Object#toString()
@Override
public String toString() {
return \"Person [name=\" + name + \", getStreetNumber()=\"
+ getStreetNumber() + \", getStreetName()=\" + getStreetName()
+ \", getCity()=\" + getCity() + \", getState()=\" + getState()
+ \", getCountry()=\" + getCountry() + \", toString()=\"
+ super.toString() + \", getClass()=\" + getClass()
+ \", hashCode()=\" + hashCode() + \"]\";
}
}
/////////////////////////////////////////////////////////////////
CLASS STUDENT
import java.util.ArrayList;
import java.util.List;
public class Student extends Person {
private String CIN;
List courses;
public Student(int streetNumber, String streetName, String city, String state, String country,
String name, String CIN) {
super(streetNumber, streetName, city, state, country, name);
// Auto-generated constructor stub
this.CIN = CIN;
courses = new ArrayList();
}
// reutrn cin
public String getCIN() {
return CIN;
}
// set cin
public void setCIN(String cIN) {
CIN = cIN;
}
pub.
Clean code
My talk at OSOCO Dev Day and @madriagil about Robert C. Martin's book "Clean Code".
Dates:
28-04-2011
19-05-2011
Php functions
This document discusses various PHP functions categorized into different groups like:
- Date Functions: date, getdate, setdate, Checkdate, time, mktime
- String Functions: strtolower, strtoupper, strlen, trim, substr, strcmp etc.
- Math Functions: abs, ceil, floor, round, pow, sqrt, rand
- User Defined Functions: functions with arguments, default arguments, returning values
- File Handling Functions: fopen, fread, fwrite, fclose to handle files
- Miscellaneous Functions: define, constant, include, require, header to define constants, include files etc.
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.
Structured data type
An array is a collection of variables of the same data type stored in contiguous memory locations. There are two types of arrays: single dimensional and multi-dimensional arrays. A single dimensional array stores elements in adjacent memory locations. Multi-dimensional arrays can store arrays of arrays. Two dimensional arrays are commonly used to represent matrices. Arrays allow traversing, searching, and initializing elements. Functions can accept arrays as arguments which are treated as pointers to the first element.
week-7x
The document contains code for a C program that counts the lines, words, and characters in a given text. It prompts the user to enter text with a space between each word and press return when finished. It then counts the number of lines by checking for newline characters, words by checking for spaces, and characters by using strlen. It prints the number of lines, words, and characters in the input text.
Data structure
This document provides code for a C++ program that checks if a given word is a palindrome using stacks and queues. The program defines Stack and Queue classes with push, pop, enqueue, and dequeue methods. An palindrome function takes a word as a char array, pushes and enqueues the letters to a stack and queue, then pops and dequeues to check if the first and last letters are equal, all the way to the middle of the word. It returns 1 if the word is a palindrome or 0 if it is not. The main function prompts the user for input, calls the palindrome function, and prints the result.
Riboflavin is required in the conversion of carbo.pdf
Riboflavin is required in the conversion of carbohydrates, fat and protein into
energy required for cell functions.
Solution
Riboflavin is required in the conversion of carbohydrates, fat and protein into
energy required for cell functions..
PbS,Ag2O and CaSO4 are stable as they are insolub.pdf
PbS,Ag2O and CaSO4 are stable as they are insoluble in water .
Solution
PbS,Ag2O and CaSO4 are stable as they are insoluble in water ..
Optio D is the correct one. .pdf
Optio D is the correct choice according to the document. The document states that Optio D is the correct one without providing any other details or context.
Image not seenfound .pdf
This 3 sentence summary provides the high level information from the document:
The document appears to be about an issue where an image is not seen or found. Unfortunately, the document does not contain any other text, so no further details about the problem or solution can be determined from the information given. The document is too brief to generate a meaningful 3 sentence summary.
If multiple orbitals of the same energy are avail.pdf
If multiple orbitals of the same energy are available unoccupied orbitals will be
filled before occupied orbitals are reused
Solution
If multiple orbitals of the same energy are available unoccupied orbitals will be
filled before occupied orbitals are reused.
What is a Distributed System Compare it with a computer network sys.pdf
What is a Distributed System? Compare it with a computer network system.
It is a one of the model in the computer network system; these components communicate and
coordinate their actions by interchanging the messages. Process of sharing complex problems
over the network we can use the distributed systems.
Distributed Systems can be configured in Local Area Network like 10\'s of host systems.
The main principles of distributed systems are
Resource Sharing
Concurrency
Transparency
Fault Tolerance.
Coming to the point of comparison computer network just contains the hardware and its software
that will used transfer the data based on the individual working of the network. In case of
Distributed system connect one system to another system and provides data transfer the other
machines outside the systems without know the complete about machine to other systems.
In other main comparison is distributed system have not idea about the multiple processor
methodlgies.While in computer network, explicitly log onto one machine and submit
jobs remotely all files moves around the network . In the distributed system it is not happened.
While another main difference is distributed system is built on the top of the systems.
Solution
What is a Distributed System? Compare it with a computer network system.
It is a one of the model in the computer network system; these components communicate and
coordinate their actions by interchanging the messages. Process of sharing complex problems
over the network we can use the distributed systems.
Distributed Systems can be configured in Local Area Network like 10\'s of host systems.
The main principles of distributed systems are
Resource Sharing
Concurrency
Transparency
Fault Tolerance.
Coming to the point of comparison computer network just contains the hardware and its software
that will used transfer the data based on the individual working of the network. In case of
Distributed system connect one system to another system and provides data transfer the other
machines outside the systems without know the complete about machine to other systems.
In other main comparison is distributed system have not idea about the multiple processor
methodlgies.While in computer network, explicitly log onto one machine and submit
jobs remotely all files moves around the network . In the distributed system it is not happened.
While another main difference is distributed system is built on the top of the systems..
USES OF FINANCIAL STATEMENT ANALYSISFINANCIAL STATEMENT ANALYSIS .pdf
USES OF FINANCIAL STATEMENT ANALYSIS:
FINANCIAL STATEMENT ANALYSIS IS STUDIED AND REVIEWED FOR MAKING
BETTER ECONOMIC DECISIONS BY THE USERS. THE THREE MAIN FINANCIAL
STATEMENTS ARE 1.CASH FLOW STATEMENT 2.BALANCE SHEET 3. INCOME
STATEMENT.
THE USERS OF THE FINANCIAL INFORMATION ARE THE
INVESTORS,STAKEHOLDERS,PUBLIC,INVESTORS.
BY USING VARIOUS METHODS OF FINANCIAL ANALYSIS LIKE 1. RATIO ANALYSIS
2. DU PONY ANALYSIS 3. HORIZONTAL AND 4. VERTICAL ANALYSIS. BY
STUDYING THE HISTORICAL DATA. WITH A SET OF ASSUMPTIONS WE CAN
PREDICT THE FUTURE PERFORMANCE OF THE COMPANY, AND ALSO
INVESTIGATE THE CURRENT PERFORMANCE WHICH WILL HELP THEM MAKE A
BETTER INFORMED FINANCIAL DECISION.
THE BALANCE SHEET PROVIDES DATA ON THE ASSETS AND LIABILITIES, AND
THE OWNERS\'S EQUITY OF THE COMPANY. THE INCOME STATEMENT BEGINS
WITH GROSS INCOME ANS ENDS WITH NET PROFIT. IT SHOWS THE OPERATING
PROFIT, EBIT, PAT, EBITDA. THE CASH FLOW STATEMENT SHOWS THE CASH
FLOWS OF THE COMPANY COMING FROM VARIOUS ACTIVITIES LIKE
OPERATING,INVESTING AND FINANCING.
WHAT ARE SIC CODES AND HOW THEY ARE USEFUL?
THESE ARE 4 DIGIT CODES ASSIGNED TO EVERY BUSINESS. THEY CAN HELP TO
FIND THE EXACT COMPANY WE ARE SEARCHING FOR IN THE PARTICULAR
INDUSTRY, AND ALSO THE TARGET THE RESULTS TO PARTICULAR REGION OR
DEMOGRAPHIC.
THE WAY TO READ SIC CODE IS SIMPLE ONCE WE KNOW THE INDUSTRY THE
COMPANY IS OPERATING IN.
THE FIRST TWO DIGITS DETERMINES THE MAJOR INDUSTRY GROUP.
THE THIRD DIGIT DETERMINES THE INDUSTRY GROUP.
THE FOURTH DIGIT DETERMINES THE INDUSTRY ITSELF.
THESE CODES ARE USEFUL IN THE SENSE THAT, USING THESE CODES CAN
REDUCE THE TIME AND EFFORT IN DOING ENDLESS HOURS OF RESEARCH IN
FINDING WHAT BUSINESSES ARE IN CERTAIN AREAS . WITH THE HELP OF THESE
CODES ,WE CAN EASILY FIND INFORMATION ON THE BUSINESS WE ARE
RESEARCHING ON.
WHAT ARE THE PROBLEMS OF FINANCIAL STATEMENT ANALYSIS:
1. THERE IS A LACK OF A THEORTICAL BACKGROUND FOR THE ANALYSIS OF
RATIOS, ITS DIFFICULT TO INTERPRET THE RATIOS. THIS LEADS TO IMPROPER
UNDERSTANDING OF THE RATIOS TO DEEM THEM AS APPROPRIATE OR NOT.
2. THE WIDE RANGE OF PRODUCTS IN WHICH A COMPANY TRADES,MAKES IT
DIFFICULT TO MAKE COMPARISON BETWEEN FIRMS HENCE RELATIVE RATIO
ANALYSIS BECOMES DIFFICULT.
3. WINDOW DRESSING BY FIRMS: SOME FIRMS RESORT TO PRACTICES WHERE
THEY INFLATE THEIR SALES FIGURES, OR SHOW BETTER LIQUIDITY POSITIONS
AND BETTER TURN OVER OF INVENTORY. THESE MALPRACTICES PRESENTS A
ROSY PICTURE TO THE INVESTOR.
WHY DO WE SAY FINANCIAL STATEMENTS ANALYSIS IS MANAGEMENT BY
EXCEPTION:
MANAGEMENT BY EXCEPTION IS THE STUDY OF THE FINANCIALS OF THE
BUSINESS ONLY IF THERE IS A SIGNIFICANT DEVIATION OF THE BUDGETED
FROM THE EXPECTED,ONLY THOSE ISSUES ARE BROUGHT UNDER THE SCRUTINY
OF THE MANAGEMENT . IT SAVES TIMES,AND HELP THE MANAGERS
EFFECTIVELY MANAGE THEIR BUSINESS.
IN THE SAME WAY FINANCIAL STATEMENT ANALYSIS PROVIDES A SUMMARY OF
THE BUSINESS RESULTS IN THE FINANCIAL YEAR AND ONLY STUDIES THE CORE
FINANCIALS OF THE BUSINESS.IT DOES POINT OUT IN.
The movement of watersolvent across the osmotic gradient takes plac.pdf
The movement of water/solvent across the osmotic gradient takes place in the presence of a
semi-permeable membrane. It functionally depends upon the concentration of solute particles
present on the both sides of the solutions which are separated by the semi-permeable membrane.
In a cell where the concentration gradient is such that water tends to move inside the cell, the cell
must be hypertonic with respect to the surroundings. Movement of water takes place across this
concentration gradient from hypotonic to hypertonic solution (from surrounding to cell) until the
osmotic concentration is same on both sides. In a plant cell, this movement will stop as early as
the concentrations are same on both sides.
On the contrary, the animal cells maintain a discrete physiological concentration of each and
every ion inside the cell which is necessary for solute transport, intercellular communication,
action potential and maintenance of electrochemical gradient. For this purpose, the animal cells
have different kind of solute channel protien located in their membranes. Although osmotic
gradient does play a role in solvent transport but maintenance of solute concentration is of
primary importance and thus the general osmotic gradient is different in animal cells as
compared to plant cells. In animal cells, it is more complex and sophisticated in nature and
requires ATP for operation purpose.
Solution
The movement of water/solvent across the osmotic gradient takes place in the presence of a
semi-permeable membrane. It functionally depends upon the concentration of solute particles
present on the both sides of the solutions which are separated by the semi-permeable membrane.
In a cell where the concentration gradient is such that water tends to move inside the cell, the cell
must be hypertonic with respect to the surroundings. Movement of water takes place across this
concentration gradient from hypotonic to hypertonic solution (from surrounding to cell) until the
osmotic concentration is same on both sides. In a plant cell, this movement will stop as early as
the concentrations are same on both sides.
On the contrary, the animal cells maintain a discrete physiological concentration of each and
every ion inside the cell which is necessary for solute transport, intercellular communication,
action potential and maintenance of electrochemical gradient. For this purpose, the animal cells
have different kind of solute channel protien located in their membranes. Although osmotic
gradient does play a role in solvent transport but maintenance of solute concentration is of
primary importance and thus the general osmotic gradient is different in animal cells as
compared to plant cells. In animal cells, it is more complex and sophisticated in nature and
requires ATP for operation purpose..
More Related Content
Similar to #include iostream #include iomanip Might end up not being.pdf
For C# need to make these changes to this programm, httppastebin..pdf
For C# need to make these changes to this programm, http://pastebin.com/nBsBETd8
For this assignment, rewrite the CS7 Array to use a string typed List.
Review the CS7 Arrays program.
The main changes to make to CS7 Arrays to complete your assignment include:
The function names may stay the same.
Change the declaration of cstrName[] to List cstrName = new List( );
The variable cintNumberOfNames will not be needed because cstrName.Count can be used.
In CS7Form_Load:
Delete int i = 0;
The if-else statement to check if the array size has been exceeded is not needed since lists can
grow.
Use the Add method to load the names in the list,
cstrName.Add(nameStreamReader.ReadLine());
The names still need to be displayed in the listbox after the list is loaded.
In displayNames( ) change cintNumberOfNames to cstrName.Count.
In btnSortByName, all of the logic can be replaced with a call to Sort, cstrName.Sort(); The
names have to be redisplayed after the sort.
In btnSearchByName:
Declare a varible to store the result of the search, int intIndex;
Call btnSortByName to sort and redisplay the array just in case it hasn\'t be sorted.
Use the BinarySearch method to conduct the search,
intIndex = cstrName.BinarySearch(txtSearchName.Text);
A negative value is returned if the value is not found, else the zero-based index of the element is
returned. In the statement above, the result is stored in intIndex. intIndex could then be checked
if the result is >= zero, such as if (intIndex >= 0 )
Use the result to display a message if the name was not found, else select the matching entry in
listbox and display a message indicating the name was found.
In btnDelete use the RemoveAt method to delete the name at the top of the list. Before calling
RemoveAt, check that Count is greater than zero to avoid a run-time exception. The names have
to be redisplayed after removing a name.
here is the code,
using System;
using System.Collections.Generic;
using System.ComponentModel;
using System.Data;
using System.Drawing;
using System.Text;
using System.Windows.Forms;
//Project: CS7 Array Processing
//Programmer: Daryl Austin
//Description: Declare and load an array with a list of names.
// The user can sort the list by name and search by name.
// Names can be deleted from the top of the list.
using System.IO; // FileStream and StreamReader
namespace CS7
{
public partial class CS7Form : Form
{
public CS7Form()
{
InitializeComponent();
}
//Declare class-level arrays
//Array can hold up to 10 names.
string[] cstrName = new string[9];
//Use cintNumberOfCustomers to process array because array
//may be partially loaded. Count set in CS7Form_Load
int cintNumberOfNames;
private void CS7Form_Load(object sender, EventArgs e)
{
int i = 0; // subscript initialized to zero
try
{
//Load the array with the data in the file
FileStream nameFile = new FileStream(\"cs7.txt\", FileMode.Open);
StreamReader nameStreamReader = new StreamReader(nameFile);
while (nameStreamReader.Peek() != -1)
{
if (i < c.
SPL 13 | Character Array(String) in C
This document discusses strings in C programming language. It defines a string as an array of characters terminated by a null character. It explains how to declare and initialize strings, read and write strings, determine string length, concatenate strings, copy strings, compare strings, convert between strings and integers, and various string processing functions like reversing, converting case, etc. It provides examples of implementing these string operations both through character-wise processing and using predefined string header functions.
2DArrays.ppt
computer dataA computer is a machine that can be programmed to carry out sequences of arithmetic or logical operations (computation) automatically. Modern digital electronic computers can perform generic sets of operations known as programs. These programs enable computers to perform a wide range of tasks. A computer system is a nominally complete computer that includes the hardware, operating system (main software), and peripheral equipment needed and used for full operation. This term may also refer to a group of computers that are linked and function together, such as a computer network or computer cluster.
A broad range of industrial and consumer products use computers as control systems. Simple special-purpose devices like microwave ovens and remote controls are included, as are factory devices like industrial robots and computer-aided design, as well as general-purpose devices like personal computers and mobile devices like smartphones. Computers power the Internet, which links billions of other computers and users.
Early computers were meant to be used only for calculations. Simple manual instruments like the abacus have aided people in doing calculations since ancient times. Early in the Industrial Revolution, some mechanical devices were built to automate long, tedious tasks, such as guiding patterns for looms. More sophisticated electrical machines did specialized analog calculations in the early 20th century. The first digital electronic calculating machines were developed during World War II. The first semiconductor transistors in the late 1940s were followed by the silicon-based MOSFET (MOS transistor) and monolithic integrated circuit chip technologies in the late 1950s, leading to the microprocessor and the microcomputer revolution in the 1970s. The speed, power and versatility of computers have been increasing dramatically ever since then, with transistor counts increasing at a rapid pace (as predicted by Moore's law), leading to the Digital Revolution during the late 20th to early 21st centuries.
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.
#include stdio.h#include stdlib.h#include string.h#inclu.pdf
#include
#include
#include
#include
/*Structure for storing words received from each thread*/
struct return_val{
char wordlist[100][100];
int count[100];
} *arr;
pthread_t *threads;
int lines;
/*Aggregates Frequency Sum of different threads*/
int aggregate(char *a)
{
int sum = 0;
int i=0;
while(1)
{
if(i==lines) break;
int count = 0;
while(1)
{
if(arr[i].count[count] == -1)
{
break;
}
if(strcmp(a,arr[i].wordlist[count]) == 0)
{
sum += arr[i].count[count];
arr[i].count[count] = 0;
}
count++;
}
i++;
}
return sum;
}
/*Function executed by each thread on separate line*/
void *word_count(void* num)
{
int *ln = num;
unsigned int line_number = *ln;
line_number++;
char cmd_p1[9] = \"sed -n \'\\0\";
char cmd_p2[2];
sprintf(cmd_p2,\"%d\",line_number);
char cmd_p3[14] = \"p\' \'file.txt\'\\0\";
char command[100];
command[0] = \'\\0\';
strcat(command,cmd_p1);
strcat(command,cmd_p2);
strcat(command,cmd_p3);
//usleep(line_number);
char cmd[100] = \" | tr [:space:] \'\\\ \' | grep -v \'^\\\\s*$\' | sort | uniq -c | sort\\0\";
strcat(command,cmd);
FILE *in;
in= popen(command, \"r\");
rewind(in);
char buff[50];
int counter = 0;
while(fgets(buff,sizeof(buff),in))
{
char c=\' \';
int i = 0;
int cnt = atoi(buff);
arr[line_number-1].count[counter] = cnt;
while(c!=\'\\0\')
{
c=buff[i];
buff[i]=buff[i+6];
i++;
}
int cnnt = 0;
while(c!=\' \')
{
c = buff[cnnt];
cnnt++;
}
i=0;
while(c!=\'\\0\')
{
c=buff[i];
buff[i]=buff[i+cnnt];
i++;
}
sprintf(arr[line_number-1].wordlist[counter],\"%s\",buff);
counter++;
}
arr[line_number-1].count[counter] = -1;
fclose(in);
return NULL;
}
int main(void)
{
FILE *fp;
fp = fopen(\"file.txt\",\"r\");
char a[200];
lines = 0;
void *status = NULL;
while(fgets(a,sizeof(a),fp) !=NULL)
{
lines++;
}
fclose(fp);
arr = (struct return_val*) calloc(lines, sizeof(struct return_val) * lines);
threads = malloc(sizeof(pthread_t)*lines);
int i;
for(i=0;i= 0)
{
if(arr[i].count[ctr] > 0)
{
strcpy(final[final_ctr],arr[i].wordlist[ctr]);
final_cnt[final_ctr] = arr[i].count[ctr];
arr[i].count[ctr] = 0;
int sum = aggregate(arr[i].wordlist[ctr]);
final_cnt[final_ctr] += sum;
printf(\"%d %s\",final_cnt[final_ctr],final[final_ctr]);
}
ctr++; final_ctr++;
}
i++;
if(i==lines)
{
break;
}
}
free(arr);
return 0;
}
#include
#include
#include
#include
/*Structure for storing words received from each thread*/
struct return_val{
char wordlist[100][100];
int count[100];
} *arr;
pthread_t *threads;
int lines;
/*Aggregates Frequency Sum of different threads*/
int aggregate(char *a)
{
int sum = 0;
int i=0;
while(1)
{
if(i==lines) break;
int count = 0;
while(1)
{
if(arr[i].count[count] == -1)
{
break;
}
if(strcmp(a,arr[i].wordlist[count]) == 0)
{
sum += arr[i].count[count];
arr[i].count[count] = 0;
}
count++;
}
i++;
}
return sum;
}
/*Function executed by each thread on separate line*/
void *word_count(void* num)
{
int *ln = num;
unsigned int line_number = *ln;
line_number++;
char cmd_p1[9] = \"sed -n \'\\0\";
char cmd_p2[2];
sprintf(cmd_p2,\"%d\",line_number);
char cmd_p3[14] .
Hello Everyone!!!I’m writing a c++ program that presents a menu to.pdf
The document describes a C++ program that implements a linked list to store names and phone numbers. The program presents a menu with options to insert, modify, delete, find records in the linked list. The code includes function prototypes and implementations for populating, displaying, inserting, modifying and removing records from the linked list. The author is asking for help implementing the delete and find functions, as those functions have not been fully implemented in the code provided.
So I am writing a CS code for a project and I keep getting cannot .pdf
So I am writing a CS code for a project and I keep getting \"cannot open file\" I know I put it into
my code, but I don\'t know why it won\'t execute after i input ./a.out I put in gcc -Wall
contents3.c and no errors or warnings pop up. So I figure everything is working right. But after
that, I get \"Cannot open file\". So I am wondering what I can do to get this settled out properly. I
am putting the outcome of the project and my code. Please someone help me!
#include
#include
#include
#include
#include
#include
int len = 0;
int sp = 0;
int lwrcaseCount = 0;
int uprcaseCount = 0;
int digitCount = 0;
int specialCount = 0;
char data[200];
int frequency[84];
int sortFrequency[84][2];
char string[] =
\"abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ!\\\"#$%&\'()*+,-
./:;<=>?@[/]^_`{|}~\";
//printf(\"\ \");
//To sort based on frequency of characters
/*void sort()
{
int max, loc, temp, x, y;
//Loops till end - 1 position of the frequency array
for(x = 0; x <= 84 - 1; x++)
{
//Initializes the max to the x position of the frequency array assuming it as maximum
max = frequency[x];
//Initializes of loc to x assuming location x contains the maximum value
loc = x;
//Loops through x + 1 to length - 1 of frequency array
for(y = x + 1; y <= 95 -1; y++)
{
//If current position of the frequency of the array is greater than the max
//then update the max with the current value of frequency and update the loc
if(frequency[y] > max)
{
max = frequency[y];
loc = y;
}//end of if
}//end of for loop
//If loc is not x then swap
if(loc != x)
{
temp = frequency[x];
frequency[x] = frequency[loc];
frequency[loc] = temp;
}//end of if
//Store the location of the maximum value in the zero column position of row x
sortFrequency[x][0]= loc;
//Store the maximum value in the first column position of row x
sortFrequency[x][1] = max;
}//end of for loop
}//end of function*/
void sort()
{
for(int i = 0; i < 84; i++)
{
sortFrequency[i][0] = i;
sortFrequency[i][1] = frequency[i];
}
for(int i = 0; i < 84-1; i++)
for(int j = 0; j < 84-i-1; j++)
if(sortFrequency[j][1] < sortFrequency[j+1][1])
{
int temp = sortFrequency[j][1];
sortFrequency[j][1] = sortFrequency[j+1][1];
sortFrequency[j+1][1] = temp;
temp = sortFrequency[j][0];
sortFrequency[j][0] = sortFrequency[j+1][0];
sortFrequency[j+1][0] = temp;
}
}
//To count frequency of each character
void frequencyCount()
{
int c, d;
//Loops till the length of the inputed data
for(c = 0; c < len; c++)
{
//Loops from 33 to 126 which is the ascii values of required characters range
for(d = 0; d < 84; d++)
{
//If the data in the current position is equal to the acii value
if(data[c] == string[d])
//Frequency 0 position is equal to 33 ascii.
//So 33 is deducted
frequency[d]++;
}//end of for loop
}//end of for loop
}//End of function
//Initializes the frequency array to zero
void initialize()
{
int c;
for(c = 0; c < 84; c++)
frequency[c] = 0;
}
//Read the file which contains data
void readFile()
{
//File pointer created
FILE *fptr;
char ch;
//Fi.
please help with java questionsJAVA CODEplease check my code and.pdf
please help with java questions
JAVA CODE
please check my code and help my questions
CLASS ADDRESS
public class Address{
private int streetNumber;
private String streetName;
private String city;
private String state;
private String country;
// streetNumber
// streetName
// city
// state
// country
public Address(int streetNumber, String streetName, String city, String state, String country) {
this.streetNumber = streetNumber;
this.streetName = streetName;
this.city = city;
this.state = state;
this.country = country;
}
//return the streetNumber
public int getStreetNumber() {
return streetNumber;
}
// set street number
public void setStreetNumber(int streetNumber) {
this.streetNumber = streetNumber;
}
//return the streetName
public String getStreetName() {
return streetName;
}
// set street name
public void setStreetName(String streetName) {
this.streetName = streetName;
}
//return the city
public String getCity() {
return city;
}
//set the city
public void setCity(String city) {
this.city = city;
}
//return the state
public String getState() {
return state;
}
//the state to set
public void setState(String state) {
this.state = state;
}
// return the country
public String getCountry() {
return country;
}
// tset country
public void setCountry(String country) {
this.country = country;
}
// see java.lang.Object#toString()
@Override
public String toString() {
return \" [streetNumber=\" + streetNumber + \", streetName=\" + streetName
+ \", city=\" + city + \", state=\" + state + \", country=\"
+ country + \"]\";
}
}
////////////////////////////////////////////////////////////////////////////////////////
CLASS PERSON
public class Person extends Address {
private String name;
public Person (int streetNumber, String streetName, String city, String state, String country,
String name) {
super(streetNumber, streetName, city, state, country);
this.name = name;
}
//retuurn name
public String getName() {
return name;
}
// set name
public void setName(String name) {
this.name = name;
}
//see java.lang.Object#toString()
@Override
public String toString() {
return \"Person [name=\" + name + \", getStreetNumber()=\"
+ getStreetNumber() + \", getStreetName()=\" + getStreetName()
+ \", getCity()=\" + getCity() + \", getState()=\" + getState()
+ \", getCountry()=\" + getCountry() + \", toString()=\"
+ super.toString() + \", getClass()=\" + getClass()
+ \", hashCode()=\" + hashCode() + \"]\";
}
}
/////////////////////////////////////////////////////////////////
CLASS STUDENT
import java.util.ArrayList;
import java.util.List;
public class Student extends Person {
private String CIN;
List courses;
public Student(int streetNumber, String streetName, String city, String state, String country,
String name, String CIN) {
super(streetNumber, streetName, city, state, country, name);
// Auto-generated constructor stub
this.CIN = CIN;
courses = new ArrayList();
}
// reutrn cin
public String getCIN() {
return CIN;
}
// set cin
public void setCIN(String cIN) {
CIN = cIN;
}
pub.
Clean code
My talk at OSOCO Dev Day and @madriagil about Robert C. Martin's book "Clean Code".
Dates:
28-04-2011
19-05-2011
Php functions
This document discusses various PHP functions categorized into different groups like:
- Date Functions: date, getdate, setdate, Checkdate, time, mktime
- String Functions: strtolower, strtoupper, strlen, trim, substr, strcmp etc.
- Math Functions: abs, ceil, floor, round, pow, sqrt, rand
- User Defined Functions: functions with arguments, default arguments, returning values
- File Handling Functions: fopen, fread, fwrite, fclose to handle files
- Miscellaneous Functions: define, constant, include, require, header to define constants, include files etc.
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.
Structured data type
An array is a collection of variables of the same data type stored in contiguous memory locations. There are two types of arrays: single dimensional and multi-dimensional arrays. A single dimensional array stores elements in adjacent memory locations. Multi-dimensional arrays can store arrays of arrays. Two dimensional arrays are commonly used to represent matrices. Arrays allow traversing, searching, and initializing elements. Functions can accept arrays as arguments which are treated as pointers to the first element.
week-7x
The document contains code for a C program that counts the lines, words, and characters in a given text. It prompts the user to enter text with a space between each word and press return when finished. It then counts the number of lines by checking for newline characters, words by checking for spaces, and characters by using strlen. It prints the number of lines, words, and characters in the input text.
Data structure
This document provides code for a C++ program that checks if a given word is a palindrome using stacks and queues. The program defines Stack and Queue classes with push, pop, enqueue, and dequeue methods. An palindrome function takes a word as a char array, pushes and enqueues the letters to a stack and queue, then pops and dequeues to check if the first and last letters are equal, all the way to the middle of the word. It returns 1 if the word is a palindrome or 0 if it is not. The main function prompts the user for input, calls the palindrome function, and prints the result.
Similar to #include iostream #include iomanip Might end up not being.pdf (14)
For C# need to make these changes to this programm, httppastebin..pdf
For C# need to make these changes to this programm, httppastebin..pdf
C-Program Custom Library, Header File, and Implementation FilesI .pdf
C-Program Custom Library, Header File, and Implementation FilesI .pdf
#include stdio.h#include stdlib.h#include string.h#inclu.pdf
#include stdio.h#include stdlib.h#include string.h#inclu.pdf
Hello Everyone!!!I’m writing a c++ program that presents a menu to.pdf
Hello Everyone!!!I’m writing a c++ program that presents a menu to.pdf
So I am writing a CS code for a project and I keep getting cannot .pdf
So I am writing a CS code for a project and I keep getting cannot .pdf
please help with java questionsJAVA CODEplease check my code and.pdf
please help with java questionsJAVA CODEplease check my code and.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
More from anandf0099
Riboflavin is required in the conversion of carbo.pdf
Riboflavin is required in the conversion of carbohydrates, fat and protein into
energy required for cell functions.
Solution
Riboflavin is required in the conversion of carbohydrates, fat and protein into
energy required for cell functions..
PbS,Ag2O and CaSO4 are stable as they are insolub.pdf
PbS,Ag2O and CaSO4 are stable as they are insoluble in water .
Solution
PbS,Ag2O and CaSO4 are stable as they are insoluble in water ..
Optio D is the correct one. .pdf
Optio D is the correct choice according to the document. The document states that Optio D is the correct one without providing any other details or context.
Image not seenfound .pdf
This 3 sentence summary provides the high level information from the document:
The document appears to be about an issue where an image is not seen or found. Unfortunately, the document does not contain any other text, so no further details about the problem or solution can be determined from the information given. The document is too brief to generate a meaningful 3 sentence summary.
If multiple orbitals of the same energy are avail.pdf
If multiple orbitals of the same energy are available unoccupied orbitals will be
filled before occupied orbitals are reused
Solution
If multiple orbitals of the same energy are available unoccupied orbitals will be
filled before occupied orbitals are reused.
What is a Distributed System Compare it with a computer network sys.pdf
What is a Distributed System? Compare it with a computer network system.
It is a one of the model in the computer network system; these components communicate and
coordinate their actions by interchanging the messages. Process of sharing complex problems
over the network we can use the distributed systems.
Distributed Systems can be configured in Local Area Network like 10\'s of host systems.
The main principles of distributed systems are
Resource Sharing
Concurrency
Transparency
Fault Tolerance.
Coming to the point of comparison computer network just contains the hardware and its software
that will used transfer the data based on the individual working of the network. In case of
Distributed system connect one system to another system and provides data transfer the other
machines outside the systems without know the complete about machine to other systems.
In other main comparison is distributed system have not idea about the multiple processor
methodlgies.While in computer network, explicitly log onto one machine and submit
jobs remotely all files moves around the network . In the distributed system it is not happened.
While another main difference is distributed system is built on the top of the systems.
Solution
What is a Distributed System? Compare it with a computer network system.
It is a one of the model in the computer network system; these components communicate and
coordinate their actions by interchanging the messages. Process of sharing complex problems
over the network we can use the distributed systems.
Distributed Systems can be configured in Local Area Network like 10\'s of host systems.
The main principles of distributed systems are
Resource Sharing
Concurrency
Transparency
Fault Tolerance.
Coming to the point of comparison computer network just contains the hardware and its software
that will used transfer the data based on the individual working of the network. In case of
Distributed system connect one system to another system and provides data transfer the other
machines outside the systems without know the complete about machine to other systems.
In other main comparison is distributed system have not idea about the multiple processor
methodlgies.While in computer network, explicitly log onto one machine and submit
jobs remotely all files moves around the network . In the distributed system it is not happened.
While another main difference is distributed system is built on the top of the systems..
USES OF FINANCIAL STATEMENT ANALYSISFINANCIAL STATEMENT ANALYSIS .pdf
USES OF FINANCIAL STATEMENT ANALYSIS:
FINANCIAL STATEMENT ANALYSIS IS STUDIED AND REVIEWED FOR MAKING
BETTER ECONOMIC DECISIONS BY THE USERS. THE THREE MAIN FINANCIAL
STATEMENTS ARE 1.CASH FLOW STATEMENT 2.BALANCE SHEET 3. INCOME
STATEMENT.
THE USERS OF THE FINANCIAL INFORMATION ARE THE
INVESTORS,STAKEHOLDERS,PUBLIC,INVESTORS.
BY USING VARIOUS METHODS OF FINANCIAL ANALYSIS LIKE 1. RATIO ANALYSIS
2. DU PONY ANALYSIS 3. HORIZONTAL AND 4. VERTICAL ANALYSIS. BY
STUDYING THE HISTORICAL DATA. WITH A SET OF ASSUMPTIONS WE CAN
PREDICT THE FUTURE PERFORMANCE OF THE COMPANY, AND ALSO
INVESTIGATE THE CURRENT PERFORMANCE WHICH WILL HELP THEM MAKE A
BETTER INFORMED FINANCIAL DECISION.
THE BALANCE SHEET PROVIDES DATA ON THE ASSETS AND LIABILITIES, AND
THE OWNERS\'S EQUITY OF THE COMPANY. THE INCOME STATEMENT BEGINS
WITH GROSS INCOME ANS ENDS WITH NET PROFIT. IT SHOWS THE OPERATING
PROFIT, EBIT, PAT, EBITDA. THE CASH FLOW STATEMENT SHOWS THE CASH
FLOWS OF THE COMPANY COMING FROM VARIOUS ACTIVITIES LIKE
OPERATING,INVESTING AND FINANCING.
WHAT ARE SIC CODES AND HOW THEY ARE USEFUL?
THESE ARE 4 DIGIT CODES ASSIGNED TO EVERY BUSINESS. THEY CAN HELP TO
FIND THE EXACT COMPANY WE ARE SEARCHING FOR IN THE PARTICULAR
INDUSTRY, AND ALSO THE TARGET THE RESULTS TO PARTICULAR REGION OR
DEMOGRAPHIC.
THE WAY TO READ SIC CODE IS SIMPLE ONCE WE KNOW THE INDUSTRY THE
COMPANY IS OPERATING IN.
THE FIRST TWO DIGITS DETERMINES THE MAJOR INDUSTRY GROUP.
THE THIRD DIGIT DETERMINES THE INDUSTRY GROUP.
THE FOURTH DIGIT DETERMINES THE INDUSTRY ITSELF.
THESE CODES ARE USEFUL IN THE SENSE THAT, USING THESE CODES CAN
REDUCE THE TIME AND EFFORT IN DOING ENDLESS HOURS OF RESEARCH IN
FINDING WHAT BUSINESSES ARE IN CERTAIN AREAS . WITH THE HELP OF THESE
CODES ,WE CAN EASILY FIND INFORMATION ON THE BUSINESS WE ARE
RESEARCHING ON.
WHAT ARE THE PROBLEMS OF FINANCIAL STATEMENT ANALYSIS:
1. THERE IS A LACK OF A THEORTICAL BACKGROUND FOR THE ANALYSIS OF
RATIOS, ITS DIFFICULT TO INTERPRET THE RATIOS. THIS LEADS TO IMPROPER
UNDERSTANDING OF THE RATIOS TO DEEM THEM AS APPROPRIATE OR NOT.
2. THE WIDE RANGE OF PRODUCTS IN WHICH A COMPANY TRADES,MAKES IT
DIFFICULT TO MAKE COMPARISON BETWEEN FIRMS HENCE RELATIVE RATIO
ANALYSIS BECOMES DIFFICULT.
3. WINDOW DRESSING BY FIRMS: SOME FIRMS RESORT TO PRACTICES WHERE
THEY INFLATE THEIR SALES FIGURES, OR SHOW BETTER LIQUIDITY POSITIONS
AND BETTER TURN OVER OF INVENTORY. THESE MALPRACTICES PRESENTS A
ROSY PICTURE TO THE INVESTOR.
WHY DO WE SAY FINANCIAL STATEMENTS ANALYSIS IS MANAGEMENT BY
EXCEPTION:
MANAGEMENT BY EXCEPTION IS THE STUDY OF THE FINANCIALS OF THE
BUSINESS ONLY IF THERE IS A SIGNIFICANT DEVIATION OF THE BUDGETED
FROM THE EXPECTED,ONLY THOSE ISSUES ARE BROUGHT UNDER THE SCRUTINY
OF THE MANAGEMENT . IT SAVES TIMES,AND HELP THE MANAGERS
EFFECTIVELY MANAGE THEIR BUSINESS.
IN THE SAME WAY FINANCIAL STATEMENT ANALYSIS PROVIDES A SUMMARY OF
THE BUSINESS RESULTS IN THE FINANCIAL YEAR AND ONLY STUDIES THE CORE
FINANCIALS OF THE BUSINESS.IT DOES POINT OUT IN.
The movement of watersolvent across the osmotic gradient takes plac.pdf
The movement of water/solvent across the osmotic gradient takes place in the presence of a
semi-permeable membrane. It functionally depends upon the concentration of solute particles
present on the both sides of the solutions which are separated by the semi-permeable membrane.
In a cell where the concentration gradient is such that water tends to move inside the cell, the cell
must be hypertonic with respect to the surroundings. Movement of water takes place across this
concentration gradient from hypotonic to hypertonic solution (from surrounding to cell) until the
osmotic concentration is same on both sides. In a plant cell, this movement will stop as early as
the concentrations are same on both sides.
On the contrary, the animal cells maintain a discrete physiological concentration of each and
every ion inside the cell which is necessary for solute transport, intercellular communication,
action potential and maintenance of electrochemical gradient. For this purpose, the animal cells
have different kind of solute channel protien located in their membranes. Although osmotic
gradient does play a role in solvent transport but maintenance of solute concentration is of
primary importance and thus the general osmotic gradient is different in animal cells as
compared to plant cells. In animal cells, it is more complex and sophisticated in nature and
requires ATP for operation purpose.
Solution
The movement of water/solvent across the osmotic gradient takes place in the presence of a
semi-permeable membrane. It functionally depends upon the concentration of solute particles
present on the both sides of the solutions which are separated by the semi-permeable membrane.
In a cell where the concentration gradient is such that water tends to move inside the cell, the cell
must be hypertonic with respect to the surroundings. Movement of water takes place across this
concentration gradient from hypotonic to hypertonic solution (from surrounding to cell) until the
osmotic concentration is same on both sides. In a plant cell, this movement will stop as early as
the concentrations are same on both sides.
On the contrary, the animal cells maintain a discrete physiological concentration of each and
every ion inside the cell which is necessary for solute transport, intercellular communication,
action potential and maintenance of electrochemical gradient. For this purpose, the animal cells
have different kind of solute channel protien located in their membranes. Although osmotic
gradient does play a role in solvent transport but maintenance of solute concentration is of
primary importance and thus the general osmotic gradient is different in animal cells as
compared to plant cells. In animal cells, it is more complex and sophisticated in nature and
requires ATP for operation purpose..
These groups are closely related not only is SO(2) a subgroup of O(.pdf
These groups are closely related: not only is SO(2) a subgroup of O(2) because any two
reflections gives a rotation.Over the field R of real numbers, the orthogonal group O(n,?R) and
the special orthogonal group SO(n,?R) are often simply denoted by O(n) and SO(n) if no
confusion is possible. They form real compact Lie groups of dimension n(n ? 1)/2. O(n,?R) has
two connected components, with SO(n,?R) being the identity component, i.e., the connected
component containing the identity matrix.
SO(n,?R) is a subgroup of E+(n), which consists of direct isometries, i.e., isometries preserving
orientation; it contains those that leave the origin fixed
Solution
These groups are closely related: not only is SO(2) a subgroup of O(2) because any two
reflections gives a rotation.Over the field R of real numbers, the orthogonal group O(n,?R) and
the special orthogonal group SO(n,?R) are often simply denoted by O(n) and SO(n) if no
confusion is possible. They form real compact Lie groups of dimension n(n ? 1)/2. O(n,?R) has
two connected components, with SO(n,?R) being the identity component, i.e., the connected
component containing the identity matrix.
SO(n,?R) is a subgroup of E+(n), which consists of direct isometries, i.e., isometries preserving
orientation; it contains those that leave the origin fixed.
The probability of atom has zero quanta of energy is P=Number.pdf
The probability of atom has zero quanta of energy is
P=Number of favarable states/Total number of states = 1/4 = 0.25 =25%
Solution
The probability of atom has zero quanta of energy is
P=Number of favarable states/Total number of states = 1/4 = 0.25 =25%.
Copper turns green because it oxidizes. Coppe.pdf
Copper \"turns green\" because it oxidizes. Copper oxide is green in color. The
green layer that forms is called patina, and is actually a protective surface.
Solution
Copper \"turns green\" because it oxidizes. Copper oxide is green in color. The
green layer that forms is called patina, and is actually a protective surface..
CO2 and NO2 are acidic oxides as non-metal form a.pdf
CO2 and NO2 are acidic oxides as non-metal form acidic oxides. Al2O3 is an
amphoteric oxide as it is a lewis acid but forms Al(OH)3 (which is basic) in water. CaO is basic
oxide as metals form basic oxides
Solution
CO2 and NO2 are acidic oxides as non-metal form acidic oxides. Al2O3 is an
amphoteric oxide as it is a lewis acid but forms Al(OH)3 (which is basic) in water. CaO is basic
oxide as metals form basic oxides.
Ques-1 Development of tube feet of CRINOIDEADevelopment of tube f.pdf
Ques-1: Development of tube feet of CRINOIDEA
Development of tube feet is from the larval stage in Crinoidea (echinoderms) and these tube foot
useful for locomotion in adult species. Echinoderms are deuterostomes. Larval forms of
echinoderms possess bilateral symmetry and a mouth arises from opposite end of the blastopore
and alimentary canal forms connecting both during embryonic development (metamorphosis).
Larval form is ciliated & from which this tube foot is developed in adults with pentaradial
symmetry during metamorphosis. Adult echinoderms possess a water vascular system associated
with external tube feet as well as a calcareous endoskeleton along with ossicles interconnected
collagen fibres. Sea urchins often use tube feet along with spines for jerking movement and
peristaltic movement.
Adult echinoderms possess a water vascular system associated with external tube feet as well as
a calcareous endoskeleton along with ossicles interconnected collagen fibres. Sea urchins often
use tube feet along with spines for jerking movement and peristaltic movement. These are
appeared in sea stars, these openings are smaller, and yellow button like warts located on the
aboral surface of sea stars. This opening has other important parts, which perform meticulous
function in water vascular system, and these parts are tube feet, stone canal, ring and radial
canals.
Ques-2:
Spine structure of Ophiuroidea (echinoderm) are arranged in 5 rows i& connected to ligaments
with mutable collagenous substance. These spines are composed of dermal calcareous ossicles or
calcareous spicules
Solution
Ques-1: Development of tube feet of CRINOIDEA
Development of tube feet is from the larval stage in Crinoidea (echinoderms) and these tube foot
useful for locomotion in adult species. Echinoderms are deuterostomes. Larval forms of
echinoderms possess bilateral symmetry and a mouth arises from opposite end of the blastopore
and alimentary canal forms connecting both during embryonic development (metamorphosis).
Larval form is ciliated & from which this tube foot is developed in adults with pentaradial
symmetry during metamorphosis. Adult echinoderms possess a water vascular system associated
with external tube feet as well as a calcareous endoskeleton along with ossicles interconnected
collagen fibres. Sea urchins often use tube feet along with spines for jerking movement and
peristaltic movement.
Adult echinoderms possess a water vascular system associated with external tube feet as well as
a calcareous endoskeleton along with ossicles interconnected collagen fibres. Sea urchins often
use tube feet along with spines for jerking movement and peristaltic movement. These are
appeared in sea stars, these openings are smaller, and yellow button like warts located on the
aboral surface of sea stars. This opening has other important parts, which perform meticulous
function in water vascular system, and these parts are tube feet, stone canal, ring and radial
canals.
Ques-2:
Spi.
Program.csusing System; using System.Collections.Generic; usin.pdf
Program.cs
using System;
using System.Collections.Generic;
using System.Linq;
using System.Threading.Tasks;
using System.Windows.Forms;
namespace Population_Database
{
static class Program
{
static void Main()
{
Application.EnableVisualStyles();
Application.SetCompatibleTextRenderingDefault(false);
Application.Run(new Form1());
}
}
}
Form1.cs
using System;
using System.Collections.Generic;
using System.ComponentModel;
using System.Data;
using System.Drawing;
using System.Linq;
using System.Text;
using System.Threading.Tasks;
using System.Windows.Forms;
namespace Population_Database
{
public partial class Form1 : Form
{
public Form1()
{
InitializeComponent();
}
private void cityBindingNavigatorSaveItem_Click(object sender, EventArgs e)
{
this.Validate();
this.cityBindingSource.EndEdit();
this.tableAdapterManager.UpdateAll(this.cityDataSet);
}
private void Form1_Load(object sender, EventArgs e)
{
// TODO: This line of code loads data into the \'cityDataSet.City\' table. You can move,
or remove it, as needed.
this.cityTableAdapter.Fill(this.cityDataSet.City);
}
private void btnAscPopulation_Click(object sender, EventArgs e)
{
// Sort the table by population in ascending order
this.cityTableAdapter.FillByAscPopulation(this.cityDataSet.City);
}
private void btnDescPopulation_Click(object sender, EventArgs e)
{
// Sort the table by population in descending order
this.cityTableAdapter.FillByDescPopulation(this.cityDataSet.City);
}
private void btnName_Click(object sender, EventArgs e)
{
this.cityTableAdapter.FillByCity(this.cityDataSet.City);
}
private void btnTotal_Click(object sender, EventArgs e)
{
// Declare variable to hold total population.
double totalPopulation;
// Get the total population.
totalPopulation = (double)this.cityTableAdapter.TotalPopulation();
// Display the total population.
MessageBox.Show(\"Total Population: \" + totalPopulation.ToString(\"n0\"));
}
private void btnAverage_Click(object sender, EventArgs e)
{
// Declare variable to hold average population.
double averagePopulation;
// Get the average population.
averagePopulation = (double)this.cityTableAdapter.AveragePopulation();
// Display the average population.
MessageBox.Show(\"Average Population: \" + averagePopulation.ToString(\"n0\"));
}
private void btnMaxPopulation_Click(object sender, EventArgs e)
{
// Declare variable to hold highest population.
double maxPopulation;
// Get the highest population.
maxPopulation = (double)this.cityTableAdapter.MaxPopulation();
// Display the highest population.
MessageBox.Show(\"Highest Population: \" + maxPopulation.ToString(\"n0\"));
}
private void btnMinPopulation_Click(object sender, EventArgs e)
{
// Declare variable to hold lowest population.
double minPopulation;
// Get the lowest population.
minPopulation = (double)this.cityTableAdapter.MinPopulation();
// Display the lowest population.
MessageBox.Show(\"Lowest Population: \" + minPopulation.ToString(\"n0\"));
}
private void btnExit_Click(object sender, EventArgs e)
{
// Cl.
package chegg;import java.util.ArrayList; import java.util.List;.pdf
package chegg;
import java.util.ArrayList;
import java.util.List;
import java.util.ListIterator;
import java.util.Scanner;
import java.util.Set;
import java.util.TreeMap;
public class Vowles {
public static void main(String args[]) {
/* creating instance variable of List */
List letters = new ArrayList();
/* vowels instance variable for holding vowels */
List vowels = new ArrayList();
/* creating HashMap for storing vowels and count */
TreeMap map = new TreeMap();
/* Inserting vowels into treemap */
map.put(\"a\", 0);
map.put(\"e\", 0);
map.put(\"i\", 0);
map.put(\"o\", 0);
map.put(\"u\", 0);
/*
* creating instance variable of Scanner class for taking input from
* console
*/
Scanner scanner = new Scanner(System.in);
/*
* prompt for user input
*/
System.out.println(\"Please enter the letters with comma seperated\");
String input = scanner.nextLine();
/* closing scanner object */
scanner.close();
String[] letter = input.split(\",\");
/* Inserting letters into List */
for (String values : letter) {
letters.add(values);
}
/* ListIterator for iterating list */
ListIterator itr = letters.listIterator();
while (itr.hasNext()) {
String val = itr.next();
/* checking if value is any vowels */
if (val.equals(\"a\") || val.equals(\"e\") || val.equals(\"i\") || val.equals(\"o\") ||
val.equals(\"u\")) {
/* If vowels already exist in tree map */
if (map.containsKey(val)) {
Integer value = map.get(val);
map.put(val, ++value);
vowels.add(val);
} else {
map.put(val, 1);
vowels.add(val);
}
}
}
/* Removing all element from letters list */
letters.removeAll(letters);
/* Getting size of vowels */
int listSize = vowels.size();
System.out.println(\"There are \" + listSize + \" vowels in the list:\");
/* Iterating treeMap */
Set keys = map.keySet();
for (String key : keys) {
System.out.print(key + \"- \" + map.get(key) + \" \");
}
}
}
/***************output******************/
Please enter the letters with comma seperated
a,f,v,q,e,a,o,g,y,h,e,q,u
There are 6 vowels in the list:
a- 2 e- 2 i- 0 o- 1 u- 1
please rate the answer as best answer.
Thanks
Solution
package chegg;
import java.util.ArrayList;
import java.util.List;
import java.util.ListIterator;
import java.util.Scanner;
import java.util.Set;
import java.util.TreeMap;
public class Vowles {
public static void main(String args[]) {
/* creating instance variable of List */
List letters = new ArrayList();
/* vowels instance variable for holding vowels */
List vowels = new ArrayList();
/* creating HashMap for storing vowels and count */
TreeMap map = new TreeMap();
/* Inserting vowels into treemap */
map.put(\"a\", 0);
map.put(\"e\", 0);
map.put(\"i\", 0);
map.put(\"o\", 0);
map.put(\"u\", 0);
/*
* creating instance variable of Scanner class for taking input from
* console
*/
Scanner scanner = new Scanner(System.in);
/*
* prompt for user input
*/
System.out.println(\"Please enter the letters with comma seperated\");
String input = scanner.nextLine();
/* closing scanner object */
scanner.close();
String[] letter = in.
B. propene. Solution B. p.pdf
This document contains a single word answer: propene. The question appears to ask for the name of a chemical compound and the answer given is propene, also known as propylene.
L{e^{-t}} = int _0 to infinty [e^{st}e^{2-t} dt = int _0 to infinty.pdf
L{e^{-t}} = int _0 to infinty [e^{st}*e^{2-t} dt = int _0 to infinty [e^{st}*e^{2} *e^{-t}dt =
e^{2} int _0 to infinty [e^{(s-1)t} dt
L{e^{-t}} = e^2/(s+1)
Solution
L{e^{-t}} = int _0 to infinty [e^{st}*e^{2-t} dt = int _0 to infinty [e^{st}*e^{2} *e^{-t}dt =
e^{2} int _0 to infinty [e^{(s-1)t} dt
L{e^{-t}} = e^2/(s+1).
Issue of Equity or Debt are commonly used methods for business finan.pdf
Issue of Equity or Debt are commonly used methods for business financing.
Buyer\'s of the Comany\'s Debt instruments have no claim to ownership in the business. This
prevents dilution of the Company\'s ownership. The holder of the debt instrument is akin to a
lender being entitled to principal / face value / base value and interest payments on the said
amount at the specified rate. The holder of the debt instrument in the Company has no right to
the future profits of the Company. However, due to the fixed nature of the returns on these
instruments, risk borne by the holder is low. Hence, the Cost of Debt Capital is also lower than
Equity Capital.
Issue of New Equity dilutes the existing ownership interest of the Company. In most cases it also
increases the shareholder base (number of shareholders) of the Company. The major
disadvantage is the possibility of future loss of control and decision making power (if issued to
large investors). However, the Company is not obligated to make payments of interest regularly
as in the case of Debt Instruments. This in turn preserves the cash flow of the Company and
makes profits available for reinvestment into the business. Equity holders take on more risk; due
to the uncertainty of business success and growth leading to uncertainty of cash inflows. This is
further magnified under a complex capital structure where the Company may have several other
obligations to meet in the pecking order first, such as secured debt, convertible hybrid
instruments, etc. The Company may also have obligations to Government Departments. These
factors result in Equity holders demanding a higher rate of return, for absorbing this risk. Thus,
the Cost of Equity is higher than cost of Debt.
When new debt is issued at high finance costs, i.e. high rates of interest, the Company may face
additional turmoil during uncertain or difficult financial situations as it increase the risk of
insolvency. Where the Company is already highly leveraged (high debt to equity ratio) and new
debt is issued at a high rate, the Company may face slower growth rates because of the obligation
to service debt before pumping resources into high growth projects and endeavours. Further, the
cost of debt also determines the cash flow to equity.
However, the one of the biggest advantages of debt over equity is that interest cost is allowed as
a deduction for the computation of tax. This in turn lowers the tax liability. Thus, the actual cost
of debt is lower than stated cost by the amount of the tax saving benefit.
The management of the Company is required to provide regular information for the investors /
shareholders to monitor. Investors / Shareholders regularly seek comprehensive updates about
the business, financial and performance information, guidace for the future, etc. This is
especially true for newer investors that are still gaining comfort about the Company This is
largely avoided when Debt instruments are issued.
Raising equity finance is very d.
In probability we have two types of eventsIndependent Events who.pdf
In probability we have two types of events:
Independent: Events who\'s probability is not affected by the previous event(s).
Dependent: Events who\'s probability can be affected by preious event(s).
What we have in this case is a dependent event because when we don\'t replace the marble, it
changes the amount of total marbles inside the jar and thus the chances of drawing another
marble changes.
Because one event relys on the other we must find their probabilities separately at first. So what
we do is figure out the probability of pulling out a blue marble and then the probability of pulling
out another after not replacing the first. We will call these event 1 and 2.
Event 1: To find the probability of pulling out a blue marble we just divide the amount of blue
marbles we have by the total marbles in the jar:
18/45. We will keep it in this form because this is the standard way of representing chances in
stats classes.
Event 2: Now what we have left are 17 blue marbles and a total of 44 marbles so the chances of
drawing a blue marble now become:
17/45.
To combine these two chances we now multiply them together:
18/45*17/44. We will of course have to find a least common denominator but that\'s not hard and
I\'m sure you could do that part on your own.
Solution
In probability we have two types of events:
Independent: Events who\'s probability is not affected by the previous event(s).
Dependent: Events who\'s probability can be affected by preious event(s).
What we have in this case is a dependent event because when we don\'t replace the marble, it
changes the amount of total marbles inside the jar and thus the chances of drawing another
marble changes.
Because one event relys on the other we must find their probabilities separately at first. So what
we do is figure out the probability of pulling out a blue marble and then the probability of pulling
out another after not replacing the first. We will call these event 1 and 2.
Event 1: To find the probability of pulling out a blue marble we just divide the amount of blue
marbles we have by the total marbles in the jar:
18/45. We will keep it in this form because this is the standard way of representing chances in
stats classes.
Event 2: Now what we have left are 17 blue marbles and a total of 44 marbles so the chances of
drawing a blue marble now become:
17/45.
To combine these two chances we now multiply them together:
18/45*17/44. We will of course have to find a least common denominator but that\'s not hard and
I\'m sure you could do that part on your own..
i have written ths code as per your requirements with clear comments.pdf
i have written ths code as per your requirements with clear comments as shown below with
output
package com.sanfoundry.hardgraph;
import java.util.Scanner;
import java.util.Vector;
class Node1
{
int name; // node ID, started from 0 to n-1
Vector preds; // predecessors (String)
Vector neibs; // neighbors (String)
Vector backs; // backward edges -node is end vertex (Integer)
Vector fors; // forward edges -node is start vertex (Integer)
int pNode; // previous node on the augmenting path
int pEdge; // from which edge this node comes on the augmenting
// path
public Node1(int id)
{
name = id;
backs = new Vector();
fors = new Vector();
pNode1 = -1;
pEdge = -1;
}
}
class Edge
{
int name; // edge ID, started from 0 to n-1
int start; // start vertex of this edge
int end; // end vertex of this edge
int direct; // forwards (+1) or backwards (-1) on augmenting path
// if 0 then not part of augmenting path
int capacity; // capacity
int flow; // current flow
public Edge(int id)
{
name = id;
start = -1;
end = -1;
direct = 0; // default is neither
capacity = 0;
flow = 0;
}
public String toString()
{
return name + \": s=\" + start + \" e=\" + end + \" d=\" + direct;
}
}
public class LongestPathinDAG
{
int n; // number of nodes
int target; // destination node
int minLength; // the minimal length of each path
Node1[] v; // used to store Nodes
Edge[] e; // used to store Edges
int[] path; // used to store temporary path
int length = 0; // length of the path
int distance = 0; // distance of the path
int[] bestPath; // used to store temporary path
int bestLength = 0; // length of the longest path
int bestDistance = -1000000; // distance of the longest path
int[] visited; // used to mark a node as visited if set as
// 1
public LongestPathinDAG()
{
Scanner sc = new Scanner(System.in);
System.out.println(\"Enter the number of vertices: \");
n = sc.nextInt();
System.out.println(\"Enter the number of edges: \");
int m = sc.nextInt();
v = new Node1[n];
e = new Edge[m];
System.out.println(n + \" nodes and \" + m + \" edges.\");
for (int i = 0; i < n; i++)
v[i] = new Node1(i);
int i = 0;
while (i < e.length)
{
Edge edge = new Edge(i);
int sVal = sc.nextInt();
edge.start = sVal;// sc.nextInt();
int eVal = sc.nextInt();
edge.end = eVal;// sc.nextInt();
edge.capacity = sc.nextInt();
System.out.println(\" edge: \" + edge.start + \" - \" + edge.end
+ \" : \" + edge.capacity);
edge.flow = 0;
e[i] = edge;
v[sVal].fors.add(i);
v[eVal].backs.add(i);
i++;
if (i == m)
break;
}
visited = new int[v.length];
path = new int[v.length];
bestPath = new int[v.length];
sc.close();
}
/*
* this function looks for a longest path starting from being to end,
* using the backtrack depth-first search.
*/
public boolean findLongestPath(int begin, int end, int minLen)
{
/*
* compute a longest path from begin to end
*/
target = end;
bestDistance = -100000000;
minLength = minLen;
dfsLongestPath(begin);
if (bestDistance == -100000000)
return false;
else
return true;
}
private void dfsLongestPath(int curr.
More from anandf0099 (20)
Riboflavin is required in the conversion of carbo.pdf
Riboflavin is required in the conversion of carbo.pdf
PbS,Ag2O and CaSO4 are stable as they are insolub.pdf
PbS,Ag2O and CaSO4 are stable as they are insolub.pdf
If multiple orbitals of the same energy are avail.pdf
If multiple orbitals of the same energy are avail.pdf
What is a Distributed System Compare it with a computer network sys.pdf
What is a Distributed System Compare it with a computer network sys.pdf
USES OF FINANCIAL STATEMENT ANALYSISFINANCIAL STATEMENT ANALYSIS .pdf
USES OF FINANCIAL STATEMENT ANALYSISFINANCIAL STATEMENT ANALYSIS .pdf
The movement of watersolvent across the osmotic gradient takes plac.pdf
The movement of watersolvent across the osmotic gradient takes plac.pdf
These groups are closely related not only is SO(2) a subgroup of O(.pdf
These groups are closely related not only is SO(2) a subgroup of O(.pdf
The probability of atom has zero quanta of energy is P=Number.pdf
The probability of atom has zero quanta of energy is P=Number.pdf
CO2 and NO2 are acidic oxides as non-metal form a.pdf
CO2 and NO2 are acidic oxides as non-metal form a.pdf
Ques-1 Development of tube feet of CRINOIDEADevelopment of tube f.pdf
Ques-1 Development of tube feet of CRINOIDEADevelopment of tube f.pdf
Program.csusing System; using System.Collections.Generic; usin.pdf
Program.csusing System; using System.Collections.Generic; usin.pdf
package chegg;import java.util.ArrayList; import java.util.List;.pdf
package chegg;import java.util.ArrayList; import java.util.List;.pdf
L{e^{-t}} = int _0 to infinty [e^{st}e^{2-t} dt = int _0 to infinty.pdf
L{e^{-t}} = int _0 to infinty [e^{st}e^{2-t} dt = int _0 to infinty.pdf
Issue of Equity or Debt are commonly used methods for business finan.pdf
Issue of Equity or Debt are commonly used methods for business finan.pdf
In probability we have two types of eventsIndependent Events who.pdf
In probability we have two types of eventsIndependent Events who.pdf
i have written ths code as per your requirements with clear comments.pdf
i have written ths code as per your requirements with clear comments.pdf
Recently uploaded
clinical examination of hip joint (1).pdf
described clinical examination all orthopeadic conditions .
বাংলাদেশ অর্থনৈতিক সমীক্ষা (Economic Review) ২০২৪ UJS App.pdf
বাংলাদেশের অর্থনৈতিক সমীক্ষা ২০২৪ [Bangladesh Economic Review 2024 Bangla.pdf] কম্পিউটার , ট্যাব ও স্মার্ট ফোন ভার্সন সহ সম্পূর্ণ বাংলা ই-বুক বা pdf বই " সুচিপত্র ...বুকমার্ক মেনু 🔖 ও হাইপার লিংক মেনু 📝👆 যুক্ত ..
আমাদের সবার জন্য খুব খুব গুরুত্বপূর্ণ একটি বই ..বিসিএস, ব্যাংক, ইউনিভার্সিটি ভর্তি ও যে কোন প্রতিযোগিতা মূলক পরীক্ষার জন্য এর খুব ইম্পরট্যান্ট একটি বিষয় ...তাছাড়া বাংলাদেশের সাম্প্রতিক যে কোন ডাটা বা তথ্য এই বইতে পাবেন ...
তাই একজন নাগরিক হিসাবে এই তথ্য গুলো আপনার জানা প্রয়োজন ...।
বিসিএস ও ব্যাংক এর লিখিত পরীক্ষা ...+এছাড়া মাধ্যমিক ও উচ্চমাধ্যমিকের স্টুডেন্টদের জন্য অনেক কাজে আসবে ...
CACJapan - GROUP Presentation 1- Wk 4.pdf
Macroeconomics- Movie Location
This will be used as part of your Personal Professional Portfolio once graded.
Objective:
Prepare a presentation or a paper using research, basic comparative analysis, data organization and application of economic information. You will make an informed assessment of an economic climate outside of the United States to accomplish an entertainment industry objective.
Assessment and Planning in Educational technology.pptx
In an education system, it is understood that assessment is only for the students, but on the other hand, the Assessment of teachers is also an important aspect of the education system that ensures teachers are providing high-quality instruction to students. The assessment process can be used to provide feedback and support for professional development, to inform decisions about teacher retention or promotion, or to evaluate teacher effectiveness for accountability purposes.
Pollock and Snow "DEIA in the Scholarly Landscape, Session One: Setting Expec...
Pollock and Snow "DEIA in the Scholarly Landscape, Session One: Setting Expec...National Information Standards Organization (NISO)
This presentation was provided by Steph Pollock of The American Psychological Association’s Journals Program, and Damita Snow, of The American Society of Civil Engineers (ASCE), for the initial session of NISO's 2024 Training Series "DEIA in the Scholarly Landscape." Session One: 'Setting Expectations: a DEIA Primer,' was held June 6, 2024.Chapter 4 - Islamic Financial Institutions in Malaysia.pptx
Chapter 4 - Islamic Financial Institutions in Malaysia.pptxMohd Adib Abd Muin, Senior Lecturer at Universiti Utara Malaysia
This slide is special for master students (MIBS & MIFB) in UUM. Also useful for readers who are interested in the topic of contemporary Islamic banking.
Top five deadliest dog breeds in America
Thinking of getting a dog? Be aware that breeds like Pit Bulls, Rottweilers, and German Shepherds can be loyal and dangerous. Proper training and socialization are crucial to preventing aggressive behaviors. Ensure safety by understanding their needs and always supervising interactions. Stay safe, and enjoy your furry friends!
How to Manage Your Lost Opportunities in Odoo 17 CRM
Odoo 17 CRM allows us to track why we lose sales opportunities with "Lost Reasons." This helps analyze our sales process and identify areas for improvement. Here's how to configure lost reasons in Odoo 17 CRM
Advanced Java[Extra Concepts, Not Difficult].docx
This is part 2 of my Java Learning Journey. This contains Hashing, ArrayList, LinkedList, Date and Time Classes, Calendar Class and more.
Your Skill Boost Masterclass: Strategies for Effective Upskilling
Your Skill Boost Masterclass: Strategies for Effective UpskillingExcellence Foundation for South Sudan
Strategies for Effective Upskilling is a presentation by Chinwendu Peace in a Your Skill Boost Masterclass organisation by the Excellence Foundation for South Sudan on 08th and 09th June 2024 from 1 PM to 3 PM on each day.Executive Directors Chat Leveraging AI for Diversity, Equity, and Inclusion
Let’s explore the intersection of technology and equity in the final session of our DEI series. Discover how AI tools, like ChatGPT, can be used to support and enhance your nonprofit's DEI initiatives. Participants will gain insights into practical AI applications and get tips for leveraging technology to advance their DEI goals.
BÀI TẬP BỔ TRỢ TIẾNG ANH 8 CẢ NĂM - GLOBAL SUCCESS - NĂM HỌC 2023-2024 (CÓ FI...
BÀI TẬP BỔ TRỢ TIẾNG ANH 8 CẢ NĂM - GLOBAL SUCCESS - NĂM HỌC 2023-2024 (CÓ FI...Nguyen Thanh Tu Collection
https://app.box.com/s/y977uz6bpd3af4qsebv7r9b7s21935vdRecently uploaded (20)
বাংলাদেশ অর্থনৈতিক সমীক্ষা (Economic Review) ২০২৪ UJS App.pdf
বাংলাদেশ অর্থনৈতিক সমীক্ষা (Economic Review) ২০২৪ UJS App.pdf
Assessment and Planning in Educational technology.pptx
Assessment and Planning in Educational technology.pptx
Pollock and Snow "DEIA in the Scholarly Landscape, Session One: Setting Expec...
Pollock and Snow "DEIA in the Scholarly Landscape, Session One: Setting Expec...
Pride Month Slides 2024 David Douglas School District
Pride Month Slides 2024 David Douglas School District
Film vocab for eal 3 students: Australia the movie
Film vocab for eal 3 students: Australia the movie
Chapter 4 - Islamic Financial Institutions in Malaysia.pptx
Chapter 4 - Islamic Financial Institutions in Malaysia.pptx
How to Manage Your Lost Opportunities in Odoo 17 CRM
How to Manage Your Lost Opportunities in Odoo 17 CRM
Your Skill Boost Masterclass: Strategies for Effective Upskilling
Your Skill Boost Masterclass: Strategies for Effective Upskilling
Executive Directors Chat Leveraging AI for Diversity, Equity, and Inclusion
Executive Directors Chat Leveraging AI for Diversity, Equity, and Inclusion
BÀI TẬP BỔ TRỢ TIẾNG ANH 8 CẢ NĂM - GLOBAL SUCCESS - NĂM HỌC 2023-2024 (CÓ FI...
BÀI TẬP BỔ TRỢ TIẾNG ANH 8 CẢ NĂM - GLOBAL SUCCESS - NĂM HỌC 2023-2024 (CÓ FI...
#include iostream #include iomanip Might end up not being.pdf
- 1. #include #include //Might end up not being used #include using namespace std; void CopyString (char string1[24], char string2[24]); int main () { int doDebug = 0; cout << "Do Debug Output? [Y/N]:"; char response; cin >> response; if (response == 'y' || response == 'Y') { doDebug = 1; } int nameAmount; char inputFileName[50]; cout << "Input the name of the file to be read (Include the extension, "; cout << "must be less than 48 characters): "; cin >> inputFileName; inputFileName[49] = '0'; //To ensure null terminator cout << "Input the number of names: ";
- 2. cin >> nameAmount; char namesUnsorted[nameAmount][24]; char namesSorted[nameAmount][24]; ifstream inputFile; inputFile.open(inputFileName); for (int i = 0; i < nameAmount; i++) { inputFile.getline(namesUnsorted[i], 24, ' '); namesUnsorted[i][23] = '0'; } inputFile.close(); cout << "Found the following entries in " << inputFileName << ":" << endl; for (int i = 0; i < nameAmount; i++) { cout << namesUnsorted[i] << endl; } //Debug if (doDebug) { cout << "The following chars were found in entry 3: " << endl; for (int i = 0; namesUnsorted[3][i] != '0'; i++) {
- 3. cout << "'" << namesUnsorted[3][i] << "'" << endl; } } //Char values A-Z = [65, 90], a-z = [97, 122] //To go from lower to upper, subtract 32 //To keep track of which position is next in the sorted array int onName = 0; //Begin main sorting algorithm //Go through every letter for (char thisLetter = 'A'; thisLetter <= 'Z'; thisLetter++) { //Go through every name in the unsorted array for (int i = 0; i < nameAmount; i++) { //If a match is found if (namesUnsorted[i][0] == thisLetter) { //If there is already a name entered before and it starts with //the same letter as the match found if ((onName > 0) && (namesSorted[(onName - 1)][0] == thisLetter)) { cout << "Comparing " << namesSorted[(onName - 1)] << namesUnsorted[i] << endl; //Go through every letter to find which is lower for (int checkChar = 0; checkChar < 24; checkChar++) { char sortedChar, unsortedChar; sortedChar = namesSorted[onName - 1][checkChar]; unsortedChar = namesUnsorted[i][checkChar]; //If the char is a lowercase letter, convert to
- 4. //uppercase if (sortedChar > 'Z') { sortedChar -= 32; } if (unsortedChar > 'Z') { unsortedChar -= 32; } //The sorted name ended sooner if (sortedChar == '0' && unsortedChar != '0') { //namesSorted[onName - 1][checkChar] = '0'; //Keep the sorted name where it is and place the //unsorted name in the entry below CopyString(namesUnsorted[i], namesSorted[onName]); break; } else if (unsortedChar == '0' && sortedChar != '0') { //The unsorted name ended sooner //namesUnsorted[i][checkChar] = '0'; //Move the sorted name down one and place the //unsorted name to where the sorted one was CopyString(namesSorted[(onName - 1)], namesSorted[onName]); CopyString(namesUnsorted[i], namesSorted[(onName - 1)]); break;
- 5. } //Debug if (doDebug) { cout << "S: " << sortedChar << " | U: " << unsortedChar << endl; } if (sortedChar > unsortedChar) //Sorted is higher { //Move the sorted name down one and place the //unsorted name to where the sorted one was CopyString(namesSorted[(onName - 1)], namesSorted[onName]); CopyString(namesUnsorted[i], namesSorted[(onName - 1)]); break; } else if (sortedChar < unsortedChar) { //Keep the sorted name where it is and place the //unsorted name in the entry below CopyString(namesUnsorted[i], namesSorted[onName]); } //If it's checking the final char and no match has //been found, they must be the same if (checkChar == 23) { CopyString(namesUnsorted[i], namesSorted[onName]); } } } else {
- 6. CopyString(namesUnsorted[i], namesSorted[onName]); } onName++; } } } cout << endl << "Sorted names: " << endl; for (int i = 0; i < nameAmount; i++) { cout << namesSorted[i] << endl; } char outputFileName[50]; cout << "Enter output file name (including extension): "; cin >> outputFileName; outputFileName[49] = '0'; ofstream outputFile; outputFile.open(outputFileName); for (int i = 0; i < nameAmount; i++) { outputFile << namesSorted[i] << " "; }
- 7. outputFile.close(); cout << "Sorted list successfully stored in " << outputFileName << endl; return 0; } void CopyString (char string1[24], char string2[24]) { for (int i = 0; i < 24; i++) { string2[i] = string1[i]; } string2[23] = '0'; return; } input.txt Milda Dan Dale Letha Kurt Daniel Kandy Tammy Malisa Corey output.txt Corey Dale Dan
- 8. Daniel Kandy Kurt Letha Malisa Milda Tammy Solution #include #include //Might end up not being used #include using namespace std; void CopyString (char string1[24], char string2[24]); int main () { int doDebug = 0; cout << "Do Debug Output? [Y/N]:"; char response; cin >> response; if (response == 'y' || response == 'Y') { doDebug = 1; } int nameAmount; char inputFileName[50];
- 9. cout << "Input the name of the file to be read (Include the extension, "; cout << "must be less than 48 characters): "; cin >> inputFileName; inputFileName[49] = '0'; //To ensure null terminator cout << "Input the number of names: "; cin >> nameAmount; char namesUnsorted[nameAmount][24]; char namesSorted[nameAmount][24]; ifstream inputFile; inputFile.open(inputFileName); for (int i = 0; i < nameAmount; i++) { inputFile.getline(namesUnsorted[i], 24, ' '); namesUnsorted[i][23] = '0'; } inputFile.close(); cout << "Found the following entries in " << inputFileName << ":" << endl; for (int i = 0; i < nameAmount; i++) { cout << namesUnsorted[i] << endl;
- 10. } //Debug if (doDebug) { cout << "The following chars were found in entry 3: " << endl; for (int i = 0; namesUnsorted[3][i] != '0'; i++) { cout << "'" << namesUnsorted[3][i] << "'" << endl; } } //Char values A-Z = [65, 90], a-z = [97, 122] //To go from lower to upper, subtract 32 //To keep track of which position is next in the sorted array int onName = 0; //Begin main sorting algorithm //Go through every letter for (char thisLetter = 'A'; thisLetter <= 'Z'; thisLetter++) { //Go through every name in the unsorted array for (int i = 0; i < nameAmount; i++) { //If a match is found if (namesUnsorted[i][0] == thisLetter) { //If there is already a name entered before and it starts with //the same letter as the match found if ((onName > 0) && (namesSorted[(onName - 1)][0] == thisLetter)) { cout << "Comparing " << namesSorted[(onName - 1)] << namesUnsorted[i] << endl;
- 11. //Go through every letter to find which is lower for (int checkChar = 0; checkChar < 24; checkChar++) { char sortedChar, unsortedChar; sortedChar = namesSorted[onName - 1][checkChar]; unsortedChar = namesUnsorted[i][checkChar]; //If the char is a lowercase letter, convert to //uppercase if (sortedChar > 'Z') { sortedChar -= 32; } if (unsortedChar > 'Z') { unsortedChar -= 32; } //The sorted name ended sooner if (sortedChar == '0' && unsortedChar != '0') { //namesSorted[onName - 1][checkChar] = '0'; //Keep the sorted name where it is and place the //unsorted name in the entry below CopyString(namesUnsorted[i], namesSorted[onName]); break; } else if (unsortedChar == '0' && sortedChar != '0') { //The unsorted name ended sooner
- 12. //namesUnsorted[i][checkChar] = '0'; //Move the sorted name down one and place the //unsorted name to where the sorted one was CopyString(namesSorted[(onName - 1)], namesSorted[onName]); CopyString(namesUnsorted[i], namesSorted[(onName - 1)]); break; } //Debug if (doDebug) { cout << "S: " << sortedChar << " | U: " << unsortedChar << endl; } if (sortedChar > unsortedChar) //Sorted is higher { //Move the sorted name down one and place the //unsorted name to where the sorted one was CopyString(namesSorted[(onName - 1)], namesSorted[onName]); CopyString(namesUnsorted[i], namesSorted[(onName - 1)]); break; } else if (sortedChar < unsortedChar) { //Keep the sorted name where it is and place the //unsorted name in the entry below CopyString(namesUnsorted[i], namesSorted[onName]); } //If it's checking the final char and no match has //been found, they must be the same
- 13. if (checkChar == 23) { CopyString(namesUnsorted[i], namesSorted[onName]); } } } else { CopyString(namesUnsorted[i], namesSorted[onName]); } onName++; } } } cout << endl << "Sorted names: " << endl; for (int i = 0; i < nameAmount; i++) { cout << namesSorted[i] << endl; } char outputFileName[50]; cout << "Enter output file name (including extension): "; cin >> outputFileName; outputFileName[49] = '0';
- 14. ofstream outputFile; outputFile.open(outputFileName); for (int i = 0; i < nameAmount; i++) { outputFile << namesSorted[i] << " "; } outputFile.close(); cout << "Sorted list successfully stored in " << outputFileName << endl; return 0; } void CopyString (char string1[24], char string2[24]) { for (int i = 0; i < 24; i++) { string2[i] = string1[i]; } string2[23] = '0'; return; } input.txt Milda Dan Dale Letha Kurt