check the modifed code now you will get all operations done.termin.pdf
•
0 likes•2 views
check the modifed code now you will get all operations done. terminal will display add, subtract, multiply and div operation and dounday condition too. #include using namespace std; class Array { private: int start; int end; int *array; public: Array(int n); Array(int n, int m); int &operator[](int index); Array &operator=(Array a); bool operator==(Array &a); bool operator!=(Array &a); friend ostream &operator<<(ostream &out, Array &a); friend Array &operator+(Array &a, Array&b); friend Array &operator-(Array &a, Array&b); friend Array &operator*(Array &a, Array&b); friend Array &operator/(Array &a, Array&b); }; Array::Array(int n) { start = 0; end = n-1; array = new int[n]; for (int i = 0; i < n; i++) array[i] = i+1; } Array::Array(int n, int m) { start = n; end = m-1; array = new int[m-n]; for (int i = 0; i < m-n; i++) array[i] = start + i; } int &Array::operator[](int index) { if (index >= start && index <= end) { return (array[index-start]); } cout << \"Error: Index out of bounds.\" << endl; int temp = 0; return temp; //return *array; } Array &Array::operator=(Array a) { start = a.start; end = a.end; for(int i = 0; i < end - start; ++i) { array[i] = a.array[i]; } return *this; } bool Array::operator==(Array &a) { for(int i = 0; i < end - start; ++i) { if(array[i] != a.array[i]) return false; } return true; } bool Array::operator!=(Array &a){ return *this == a; } ostream &operator<<(ostream &out, Array &b) { for(int i = 0; i < b.end - b.start; ++i) { out << \"(\" << i + b.start << \")\" << b.array[i] << \" \"; } return out; } Array &operator+(Array &a, Array&b) { Array arr(a.end - a.start); for(int i = 0; i < a.end - a.start; ++i) { arr.array[i] = a.array[i] + b.array[i]; } return arr; } Array &operator-(Array &a, Array&b) { Array arr(a.end - a.start); for(int i = 0; i < a.end - a.start; ++i) { arr.array[i] = a.array[i] - b.array[i]; } return arr; } Array &operator*(Array &a, Array&b) { Array arr(a.end - a.start); for(int i = 0; i < a.end - a.start; ++i) { arr.array[i] = a.array[i] * b.array[i]; } return arr; } Array &operator/(Array &a, Array&b) { Array arr(a.end - a.start); for(int i = 0; i < a.end - a.start; ++i) { if (a.array[i]!=0) arr.array[i] = b.array[i] / a.array[i]; } return arr; } int main() { Array test(10); Array Ary1(10,25); Array Ary2(-5,10); Array Ary3(15,30); int i; int j; for (i = 0; i < 10; i++) test[i] = i+1; cout << \"Test array output\" << endl; for (i = 0; i < 10; i++) cout << test[i] << \" \"; cout << endl; i = -5; while (i < 10) { Ary2[i] = i*2; i++; } cout << \"\ \"; cout << \"Ary2 array otuput\" << endl; for (i = -5; i < 10; i++) cout << Ary2[i] << \" \"; cout << endl; i = 10; j = -5; while ( i < 25 ) { Ary1[ i ] = i*100; Ary2[j] = j * 200; i++; j++; }; cout << \"Ary1 array output\" << endl; cout << Ary1 << endl; cout << endl; cout << \"\ \"; cout << \"Ary2 array output\" << endl; cout << Ary2 << endl; cout << endl; cout << \"\ \"; for (i=0;i<14;i++) Ary3[i+15] = Ary1[i+10] + Ary2[i+-5]; cout << \"Ary3 array Addi.
Report
Share
Report
Share
Download to read offline
;
Array &operator=(Array a);
bool operator==(Array &a);
bool operator!=(Array &a);
friend ostream &operator<<(ostream &out, Array &a);
friend Array &operator+(Array &a, Array&b);
friend Array &operator-(Array &a, Array&b);
friend Array &operator*(Array &a, Array&b);
friend Array &operator/(Array &a, Array&b);
};
Array::Array(int n)
{
start = 0;
end = n-1;
array = new int[n];
for (int i = 0; i < n; i++)
array[i] = i+1;
}
Array::Array(int n, int m)
{
start = n;
end = m-1;](https://image.slidesharecdn.com/checkthemodifedcodenowyouwillgetalloperationsdone-230409124449-a8b9791c/85/check-the-modifed-code-now-you-will-get-all-operations-done-termin-pdf-1-320.jpg)
![array = new int[m-n];
for (int i = 0; i < m-n; i++)
array[i] = start + i;
}
int &Array::operator[](int index)
{
if (index >= start && index <= end)
{
return (array[index-start]);
}
cout << "Error: Index out of bounds." << endl;
int temp = 0;
return temp;
//return *array;
}
Array &Array::operator=(Array a)
{
start = a.start;
end = a.end;
for(int i = 0; i < end - start; ++i)
{
array[i] = a.array[i];
}
return *this;
}
bool Array::operator==(Array &a)
{
for(int i = 0; i < end - start; ++i)
{
if(array[i] != a.array[i])
return false;
}
return true;
}
bool Array::operator!=(Array &a){
return *this == a;](data:image/gif;base64,R0lGODlhAQABAIAAAAAAAP///yH5BAEAAAAALAAAAAABAAEAAAIBRAA7)
Recommended
#include iostream using namespace std; class Array { priva.pdf
#include
using namespace std;
class Array
{
private:
int start;
int end;
int *array;
public:
Array(int n);
Array(int n, int m);
int &operator[](int index);
Array &operator=(Array a);
bool operator==(Array &a);
bool operator!=(Array &a);
friend ostream &operator<<(ostream &out, Array &a);
friend Array &operator+(Array &a, Array&b);
friend Array &operator-(Array &a, Array&b);
friend Array &operator*(Array &a, Array&b);
friend Array operator/(Array &a, Array&b);
};
Array::Array(int n)
{
start = 0;
end = n-1;
array = new int[n];
for (int i = 0; i < n; i++)
array[i] = i+1;
}
Array::Array(int n, int m)
{
start = n;
end = m-1;
array = new int[m-n];
for (int i = 0; i < m-n; i++)
array[i] = start + i;
}
int &Array::operator[](int index)
{
int element;
if (index >= start && index <= end)
{
element=array[index-start];
}
else
{
cout << \"Error: Index out of bounds.\" << endl;
element=-1;
}
int &p=element;
return p;
}
Array &Array::operator=(Array a)
{
start = a.start;
end = a.end;
for(int i = 0; i < end - start; ++i)
{
array[i] = a.array[i];
}
return *this;
}
bool Array::operator==(Array &a)
{
for(int i = 0; i < end - start; ++i)
{
if(array[i] != a.array[i])
return false;
}
return true;
}
bool Array::operator!=(Array &a){
return *this == a;
}
ostream &operator<<(ostream &out, Array &b)
{
for(int i = 0; i < b.end - b.start; ++i)
{
out << \"(\" << i + b.start << \")\" << b.array[i] << \" \";
}
return out;
}
Array& operator+(Array &a, Array&b)
{
Array arr(a.end - a.start);
for(int i = 0; i < a.end - a.start; ++i)
{
arr.array[i] = a.array[i] + b.array[i];
}
Array &p=arr;
return p;
}
Array &operator-(Array &a, Array&b)
{
Array arr(a.end - a.start);
for(int i = 0; i < a.end - a.start; ++i)
{
arr.array[i] = a.array[i] - b.array[i];
}
Array &p=arr;
return p;
}
Array &operator*(Array &a, Array&b)
{
Array arr(a.end - a.start);
for(int i = 0; i < a.end - a.start; ++i)
{
arr.array[i] = a.array[i] * b.array[i];
}
Array &p=arr;
return p;
}
Array operator/(Array &a, Array&b)
{
Array arr(a.end - a.start);
for(int i = 0; i < a.end - a.start; ++i)
{
arr.array[i] = b.array[i] / a.array[i];
}
Array &p=arr;
return arr;
}
int main()
{
Array test(10);
Array Ary1(10,25);
Array Ary2(-5,10);
Array Ary3(15,30);
int i;
int j;
for (i = 0; i < 10; i++)
test[i] = i+1;
cout << \"Test array output\" << endl;
for (i = 0; i < 10; i++)
cout << test[i] << \" \";
cout << endl;
i = -5;
while (i < 10)
{
Ary2[i] = i*2;
i++;
}
cout << \"\ \";
cout << \"Ary2 array otuput\" << endl;
for (i = -5; i < 10; i++)
cout << Ary2[i] << \" \";
cout << endl;
i = 10; j = -5;
while ( i < 25 )
{ Ary1[ i ] = i*100;
Ary2[j] = j * 200;
i++; j++;
};
cout << \"Ary1 array output\" << endl;
cout << Ary1 << endl;
cout << endl;
cout << \"\ \";
Ary3 = Ary1 + Ary2;
cout << \"Ary2 array Addition output\" << endl;
cout << Ary3 << endl;
cout << \"\ \";
Ary3 = Ary1 - Ary2;
cout << \"Ary3 array Subtraction output\" << endl;
cout << Ary3 << endl;
cout << \"\ \";
Ary3 = Ary1 * Ary2;
cout << \"Ary3 array Multiply output\" << endl.
i am using C++ codingsource coding Program that sorts an arra.pdf
i am using C++ coding
source coding:
// Program that sorts an array using Heap Sort method
# include
# include
const int MAX = 10 ;
class array
{
private :
int arr[MAX] ;
int count ;
public :
array( ) ;
void add ( int num ) ;
void makeheap( ) ;
void heapsort( ) ;
void display( ) ;
} ;
// initialises data member
array :: array( )
{
count = 0 ;
for ( int i = 0 ; i < MAX ; i++ )
arr[MAX] = 0 ;
}
// adds element to an array
void array :: add ( int num )
{
if ( count < MAX )
{
arr[count] = num ;
count++ ;
}
else
cout << \"\ Array is full\" << endl ;
}
// creates heap from the tree
void array :: makeheap( )
{
for ( int i = 1 ; i < count ; i++ )
{
int val = arr[i] ;
int s = i ;
int f = ( s - 1 ) / 2 ;
while ( s > 0 && arr[f] < val )
{
arr[s] = arr[f] ;
s = f ;
f = ( s - 1 ) / 2 ;
}
arr[s] = val ;
}
}
// sorts heap
void array :: heapsort( )
{
for ( int i = count - 1 ; i > 0 ; i-- )
{
int ivalue = arr[i] ;
arr[i] = arr[0] ;
int f = 0 ;
int s ;
if ( i == 1 )
s = -1 ;
else
s = 1 ;
if ( i > 2 && arr[2] > arr[1] )
s = 2 ;
while ( s >= 0 && ivalue < arr[s] )
{
arr[f] = arr[s] ;
f = s ;
s = 2 * f + 1 ;
if ( s + 1 <= i - 1 && arr[s] < arr[s + 1] )
s++ ;
if ( s > i - 1 )
s = -1 ;
}
arr[f] = ivalue ;
}
}
// displays contents
void array :: display( )
{
for ( int i = 0 ; i < count ; i++ )
cout << arr[i] << \"\\t\" ;
cout << endl ;
}
void main( )
{
array a ;
clrscr();
a.add ( 11 ) ;
a.add ( 2 ) ;
a.add ( 9 ) ;
a.add ( 13 ) ;
a.add ( 57 ) ;
a.add ( 25 ) ;
a.add ( 17 ) ;
a.add ( 1 ) ;
a.add ( 90 ) ;
a.add ( 3 ) ;
a.makeheap( ) ;
cout << \"\ Heap Sort.\ \" ;
cout << \"\ Before Sorting:\ \" ;
a.display( ) ;
a.heapsort( ) ;
cout << \"\ After Sorting:\ \" ;
a.display( ) ;
getch();
}
Solution
i am using C++ coding
source coding:
// Program that sorts an array using Heap Sort method
# include
# include
const int MAX = 10 ;
class array
{
private :
int arr[MAX] ;
int count ;
public :
array( ) ;
void add ( int num ) ;
void makeheap( ) ;
void heapsort( ) ;
void display( ) ;
} ;
// initialises data member
array :: array( )
{
count = 0 ;
for ( int i = 0 ; i < MAX ; i++ )
arr[MAX] = 0 ;
}
// adds element to an array
void array :: add ( int num )
{
if ( count < MAX )
{
arr[count] = num ;
count++ ;
}
else
cout << \"\ Array is full\" << endl ;
}
// creates heap from the tree
void array :: makeheap( )
{
for ( int i = 1 ; i < count ; i++ )
{
int val = arr[i] ;
int s = i ;
int f = ( s - 1 ) / 2 ;
while ( s > 0 && arr[f] < val )
{
arr[s] = arr[f] ;
s = f ;
f = ( s - 1 ) / 2 ;
}
arr[s] = val ;
}
}
// sorts heap
void array :: heapsort( )
{
for ( int i = count - 1 ; i > 0 ; i-- )
{
int ivalue = arr[i] ;
arr[i] = arr[0] ;
int f = 0 ;
int s ;
if ( i == 1 )
s = -1 ;
else
s = 1 ;
if ( i > 2 && arr[2] > arr[1] )
s = 2 ;
while ( s >= 0 && ivalue < arr[s] )
{
arr[f] = arr[s] ;
f = s ;
s = 2 * f + 1 ;
if ( s + 1 <= i - 1 && arr[s] < arr[s + 1] )
s++ ;
if ( s > i - 1 )
s = -1 ;
}
arr[f] = ivalue ;
}
}
// displays contents
void array :: display( )
{
for ( int i = 0 ; i < count ; i++ )
cout << arr[.
I have written the code but cannot complete the assignment please help.pdf
I have written the code but cannot complete the assignment please help me to complete.
Please don't just copy other s answers as your own.
// Insertion sort
/*
#include <ctime>
#include <iostream>
using namespace std;
void insertionSort(int arr[], int n) {
int i, key, j;
for (i = 1; i < n; i++) {
key = arr[i];
j = i - 1;
// Move elements of arr[0..i-1], that are greater than key, to one position ahead of their current
position
while (j >= 0 && arr[j] > key) {
arr[j + 1] = arr[j];
j = j - 1;
}
arr[j + 1] = key;
}
}
int main() {
int n;
cout << "Enter the size of the array: ";
cin >> n;
int arr[n];
cout << "Enter the elements of the array: ";
for (int i = 0; i < n; i++) {
cin >> arr[i];
}
int num = sizeof(arr) / sizeof(arr[0]);
clock_t start, end;
double timetaken;
start = clock();
insertionSort(arr, num);
end = clock();
cout << "Sorted array: \n";
for (int i = 0; i < n; i++)
cout << arr[i] << " ";
cout << endl;
timetaken = ((double) (end - start)) / CLOCKS_PER_SEC;
cout << "Time taken : " << fixed << timetaken << "s" << endl;
return 0;
}
*/
// Shell Sort
/*
#include <ctime>
#include <iostream>
using namespace std;
int shellSort(int arr[], int n) {
for (int gap = n/2; gap > 0; gap /= 2) {
for (int i = gap; i < n; i += 1) {
int temp = arr[i];
int j;
for (j = i; j >= gap && arr[j - gap] > temp; j -= gap)
arr[j] = arr[j - gap];
arr[j] = temp;
}
}
return 0;
}
void printArray(int arr[], int n) {
for (int i=0; i<n; i++)
cout << arr[i] << " ";
}
int main() {
int n;
cout << "Enter the size of the array: ";
cin >> n;
int arr[n];
cout << "Enter the elements of the array: ";
for (int i = 0; i < n; i++) {
cin >> arr[i];
}
int num = sizeof(arr) / sizeof(arr[0]);
clock_t start, end;
double timetaken;
start = clock();
shellSort(arr, num);
end = clock();
cout << "\nArray after sorting: \n";
printArray(arr, n);
cout << endl;
timetaken = (double)(end - start) / CLOCKS_PER_SEC;
cout << "Time taken : " << fixed << timetaken << "s" << endl;
return 0;
}
*/
// MergeSort
/*
#include <ctime>
#include <iostream>
using namespace std;
void merge(int arr[], int l, int m, int r) {
int i, j, k;
int n1 = m - l + 1;
int n2 = r - m;
int L[n1], R[n2];
for (i = 0; i < n1; i++)
L[i] = arr[l + i];
for (j = 0; j < n2; j++)
R[j] = arr[m + 1 + j];
i = 0;
j = 0;
k = l;
while (i < n1 && j < n2) {
if (L[i] <= R[j]) {
arr[k] = L[i];
i++;
}
else {
arr[k] = R[j];
j++;
}
k++;
}
while (i < n1) {
arr[k] = L[i];
i++;
k++;
}
while (j < n2) {
arr[k] = R[j];
j++;
k++;
}
}
void mergeSort(int arr[], int l, int r) {
if (l < r) {
int m = l + (r - l) / 2;
mergeSort(arr, l, m);
mergeSort(arr, m + 1, r);
merge(arr, l, m, r);
}
}
int main() {
int n;
cout << "Enter the size of the array: ";
cin >> n;
int arr[n];
cout << "Enter the elements of the array: ";
for (int i = 0; i < n; i++) {
cin >> arr[i];
}
int arr_size = sizeof(arr) / sizeof(arr[0]);
clock_t start;
clock_t end;
double timetaken;
start = clock();
mergeSort(arr, 0, arr_size - 1);
end = clock();
timetaken = (double)(end - start) / CLOCKS_PER_SEC;
.
SlideSet_4_Arraysnew.pdf
The document discusses arrays in C programming. Some key points include:
- An array is a collection of variables of the same type referred to by a common name. Each element has an index and arrays use contiguous memory locations.
- Arrays are declared with the type, name, and size. The first element is at index 0.
- One-dimensional arrays can be initialized, accessed, input from and output to the user. Multidimensional arrays like 2D arrays represent tables with rows and columns.
- Arrays can be passed to functions by passing the entire array or individual elements. Operations like searching, sorting and merging can be performed on arrays.
Scala 2 + 2 > 4
The document contains code examples demonstrating various Scala programming concepts such as functions, pattern matching, traits, actors and more. It also includes links to online resources for learning Scala.
Operator Overloading & Type Conversions
The document discusses operator overloading in C++. It lists which operators can and cannot be overloaded. It provides examples of overloading unary, binary, and subscript operators. It also covers copy constructors and how they must accept a const reference argument to avoid infinite recursion when copying an object. An Array class is implemented that overloads various operators like ==, !=, [], and = to provide functionality like element access, copying, assignment, and comparisons.
Operator overloading
Operator overloading is a technique by which operators used in a programming language are implemented in user-defined types with customized logic that is based on the types of arguments passed.
programs on arrays.pdf
The document provides solutions to various problems involving 1D arrays in C and Python. It includes programs to:
1. Reverse the elements of an array
2. Determine if an array contains all even, odd, or mixed elements
3. Count the number of even and odd elements in an array
4. Check if two arrays are equal
5. Find the sum of perfect square elements in an array
6. Find the minimum scalar product of two vectors
7. Find the smallest and largest elements in an array
8. Print all distinct elements in an array
9. Check if two arrays are disjoint
For each problem, it provides the algorithm, C and Python solutions, sample input/output,
Recommended
#include iostream using namespace std; class Array { priva.pdf
#include
using namespace std;
class Array
{
private:
int start;
int end;
int *array;
public:
Array(int n);
Array(int n, int m);
int &operator[](int index);
Array &operator=(Array a);
bool operator==(Array &a);
bool operator!=(Array &a);
friend ostream &operator<<(ostream &out, Array &a);
friend Array &operator+(Array &a, Array&b);
friend Array &operator-(Array &a, Array&b);
friend Array &operator*(Array &a, Array&b);
friend Array operator/(Array &a, Array&b);
};
Array::Array(int n)
{
start = 0;
end = n-1;
array = new int[n];
for (int i = 0; i < n; i++)
array[i] = i+1;
}
Array::Array(int n, int m)
{
start = n;
end = m-1;
array = new int[m-n];
for (int i = 0; i < m-n; i++)
array[i] = start + i;
}
int &Array::operator[](int index)
{
int element;
if (index >= start && index <= end)
{
element=array[index-start];
}
else
{
cout << \"Error: Index out of bounds.\" << endl;
element=-1;
}
int &p=element;
return p;
}
Array &Array::operator=(Array a)
{
start = a.start;
end = a.end;
for(int i = 0; i < end - start; ++i)
{
array[i] = a.array[i];
}
return *this;
}
bool Array::operator==(Array &a)
{
for(int i = 0; i < end - start; ++i)
{
if(array[i] != a.array[i])
return false;
}
return true;
}
bool Array::operator!=(Array &a){
return *this == a;
}
ostream &operator<<(ostream &out, Array &b)
{
for(int i = 0; i < b.end - b.start; ++i)
{
out << \"(\" << i + b.start << \")\" << b.array[i] << \" \";
}
return out;
}
Array& operator+(Array &a, Array&b)
{
Array arr(a.end - a.start);
for(int i = 0; i < a.end - a.start; ++i)
{
arr.array[i] = a.array[i] + b.array[i];
}
Array &p=arr;
return p;
}
Array &operator-(Array &a, Array&b)
{
Array arr(a.end - a.start);
for(int i = 0; i < a.end - a.start; ++i)
{
arr.array[i] = a.array[i] - b.array[i];
}
Array &p=arr;
return p;
}
Array &operator*(Array &a, Array&b)
{
Array arr(a.end - a.start);
for(int i = 0; i < a.end - a.start; ++i)
{
arr.array[i] = a.array[i] * b.array[i];
}
Array &p=arr;
return p;
}
Array operator/(Array &a, Array&b)
{
Array arr(a.end - a.start);
for(int i = 0; i < a.end - a.start; ++i)
{
arr.array[i] = b.array[i] / a.array[i];
}
Array &p=arr;
return arr;
}
int main()
{
Array test(10);
Array Ary1(10,25);
Array Ary2(-5,10);
Array Ary3(15,30);
int i;
int j;
for (i = 0; i < 10; i++)
test[i] = i+1;
cout << \"Test array output\" << endl;
for (i = 0; i < 10; i++)
cout << test[i] << \" \";
cout << endl;
i = -5;
while (i < 10)
{
Ary2[i] = i*2;
i++;
}
cout << \"\ \";
cout << \"Ary2 array otuput\" << endl;
for (i = -5; i < 10; i++)
cout << Ary2[i] << \" \";
cout << endl;
i = 10; j = -5;
while ( i < 25 )
{ Ary1[ i ] = i*100;
Ary2[j] = j * 200;
i++; j++;
};
cout << \"Ary1 array output\" << endl;
cout << Ary1 << endl;
cout << endl;
cout << \"\ \";
Ary3 = Ary1 + Ary2;
cout << \"Ary2 array Addition output\" << endl;
cout << Ary3 << endl;
cout << \"\ \";
Ary3 = Ary1 - Ary2;
cout << \"Ary3 array Subtraction output\" << endl;
cout << Ary3 << endl;
cout << \"\ \";
Ary3 = Ary1 * Ary2;
cout << \"Ary3 array Multiply output\" << endl.
i am using C++ codingsource coding Program that sorts an arra.pdf
i am using C++ coding
source coding:
// Program that sorts an array using Heap Sort method
# include
# include
const int MAX = 10 ;
class array
{
private :
int arr[MAX] ;
int count ;
public :
array( ) ;
void add ( int num ) ;
void makeheap( ) ;
void heapsort( ) ;
void display( ) ;
} ;
// initialises data member
array :: array( )
{
count = 0 ;
for ( int i = 0 ; i < MAX ; i++ )
arr[MAX] = 0 ;
}
// adds element to an array
void array :: add ( int num )
{
if ( count < MAX )
{
arr[count] = num ;
count++ ;
}
else
cout << \"\ Array is full\" << endl ;
}
// creates heap from the tree
void array :: makeheap( )
{
for ( int i = 1 ; i < count ; i++ )
{
int val = arr[i] ;
int s = i ;
int f = ( s - 1 ) / 2 ;
while ( s > 0 && arr[f] < val )
{
arr[s] = arr[f] ;
s = f ;
f = ( s - 1 ) / 2 ;
}
arr[s] = val ;
}
}
// sorts heap
void array :: heapsort( )
{
for ( int i = count - 1 ; i > 0 ; i-- )
{
int ivalue = arr[i] ;
arr[i] = arr[0] ;
int f = 0 ;
int s ;
if ( i == 1 )
s = -1 ;
else
s = 1 ;
if ( i > 2 && arr[2] > arr[1] )
s = 2 ;
while ( s >= 0 && ivalue < arr[s] )
{
arr[f] = arr[s] ;
f = s ;
s = 2 * f + 1 ;
if ( s + 1 <= i - 1 && arr[s] < arr[s + 1] )
s++ ;
if ( s > i - 1 )
s = -1 ;
}
arr[f] = ivalue ;
}
}
// displays contents
void array :: display( )
{
for ( int i = 0 ; i < count ; i++ )
cout << arr[i] << \"\\t\" ;
cout << endl ;
}
void main( )
{
array a ;
clrscr();
a.add ( 11 ) ;
a.add ( 2 ) ;
a.add ( 9 ) ;
a.add ( 13 ) ;
a.add ( 57 ) ;
a.add ( 25 ) ;
a.add ( 17 ) ;
a.add ( 1 ) ;
a.add ( 90 ) ;
a.add ( 3 ) ;
a.makeheap( ) ;
cout << \"\ Heap Sort.\ \" ;
cout << \"\ Before Sorting:\ \" ;
a.display( ) ;
a.heapsort( ) ;
cout << \"\ After Sorting:\ \" ;
a.display( ) ;
getch();
}
Solution
i am using C++ coding
source coding:
// Program that sorts an array using Heap Sort method
# include
# include
const int MAX = 10 ;
class array
{
private :
int arr[MAX] ;
int count ;
public :
array( ) ;
void add ( int num ) ;
void makeheap( ) ;
void heapsort( ) ;
void display( ) ;
} ;
// initialises data member
array :: array( )
{
count = 0 ;
for ( int i = 0 ; i < MAX ; i++ )
arr[MAX] = 0 ;
}
// adds element to an array
void array :: add ( int num )
{
if ( count < MAX )
{
arr[count] = num ;
count++ ;
}
else
cout << \"\ Array is full\" << endl ;
}
// creates heap from the tree
void array :: makeheap( )
{
for ( int i = 1 ; i < count ; i++ )
{
int val = arr[i] ;
int s = i ;
int f = ( s - 1 ) / 2 ;
while ( s > 0 && arr[f] < val )
{
arr[s] = arr[f] ;
s = f ;
f = ( s - 1 ) / 2 ;
}
arr[s] = val ;
}
}
// sorts heap
void array :: heapsort( )
{
for ( int i = count - 1 ; i > 0 ; i-- )
{
int ivalue = arr[i] ;
arr[i] = arr[0] ;
int f = 0 ;
int s ;
if ( i == 1 )
s = -1 ;
else
s = 1 ;
if ( i > 2 && arr[2] > arr[1] )
s = 2 ;
while ( s >= 0 && ivalue < arr[s] )
{
arr[f] = arr[s] ;
f = s ;
s = 2 * f + 1 ;
if ( s + 1 <= i - 1 && arr[s] < arr[s + 1] )
s++ ;
if ( s > i - 1 )
s = -1 ;
}
arr[f] = ivalue ;
}
}
// displays contents
void array :: display( )
{
for ( int i = 0 ; i < count ; i++ )
cout << arr[.
I have written the code but cannot complete the assignment please help.pdf
I have written the code but cannot complete the assignment please help me to complete.
Please don't just copy other s answers as your own.
// Insertion sort
/*
#include <ctime>
#include <iostream>
using namespace std;
void insertionSort(int arr[], int n) {
int i, key, j;
for (i = 1; i < n; i++) {
key = arr[i];
j = i - 1;
// Move elements of arr[0..i-1], that are greater than key, to one position ahead of their current
position
while (j >= 0 && arr[j] > key) {
arr[j + 1] = arr[j];
j = j - 1;
}
arr[j + 1] = key;
}
}
int main() {
int n;
cout << "Enter the size of the array: ";
cin >> n;
int arr[n];
cout << "Enter the elements of the array: ";
for (int i = 0; i < n; i++) {
cin >> arr[i];
}
int num = sizeof(arr) / sizeof(arr[0]);
clock_t start, end;
double timetaken;
start = clock();
insertionSort(arr, num);
end = clock();
cout << "Sorted array: \n";
for (int i = 0; i < n; i++)
cout << arr[i] << " ";
cout << endl;
timetaken = ((double) (end - start)) / CLOCKS_PER_SEC;
cout << "Time taken : " << fixed << timetaken << "s" << endl;
return 0;
}
*/
// Shell Sort
/*
#include <ctime>
#include <iostream>
using namespace std;
int shellSort(int arr[], int n) {
for (int gap = n/2; gap > 0; gap /= 2) {
for (int i = gap; i < n; i += 1) {
int temp = arr[i];
int j;
for (j = i; j >= gap && arr[j - gap] > temp; j -= gap)
arr[j] = arr[j - gap];
arr[j] = temp;
}
}
return 0;
}
void printArray(int arr[], int n) {
for (int i=0; i<n; i++)
cout << arr[i] << " ";
}
int main() {
int n;
cout << "Enter the size of the array: ";
cin >> n;
int arr[n];
cout << "Enter the elements of the array: ";
for (int i = 0; i < n; i++) {
cin >> arr[i];
}
int num = sizeof(arr) / sizeof(arr[0]);
clock_t start, end;
double timetaken;
start = clock();
shellSort(arr, num);
end = clock();
cout << "\nArray after sorting: \n";
printArray(arr, n);
cout << endl;
timetaken = (double)(end - start) / CLOCKS_PER_SEC;
cout << "Time taken : " << fixed << timetaken << "s" << endl;
return 0;
}
*/
// MergeSort
/*
#include <ctime>
#include <iostream>
using namespace std;
void merge(int arr[], int l, int m, int r) {
int i, j, k;
int n1 = m - l + 1;
int n2 = r - m;
int L[n1], R[n2];
for (i = 0; i < n1; i++)
L[i] = arr[l + i];
for (j = 0; j < n2; j++)
R[j] = arr[m + 1 + j];
i = 0;
j = 0;
k = l;
while (i < n1 && j < n2) {
if (L[i] <= R[j]) {
arr[k] = L[i];
i++;
}
else {
arr[k] = R[j];
j++;
}
k++;
}
while (i < n1) {
arr[k] = L[i];
i++;
k++;
}
while (j < n2) {
arr[k] = R[j];
j++;
k++;
}
}
void mergeSort(int arr[], int l, int r) {
if (l < r) {
int m = l + (r - l) / 2;
mergeSort(arr, l, m);
mergeSort(arr, m + 1, r);
merge(arr, l, m, r);
}
}
int main() {
int n;
cout << "Enter the size of the array: ";
cin >> n;
int arr[n];
cout << "Enter the elements of the array: ";
for (int i = 0; i < n; i++) {
cin >> arr[i];
}
int arr_size = sizeof(arr) / sizeof(arr[0]);
clock_t start;
clock_t end;
double timetaken;
start = clock();
mergeSort(arr, 0, arr_size - 1);
end = clock();
timetaken = (double)(end - start) / CLOCKS_PER_SEC;
.
SlideSet_4_Arraysnew.pdf
The document discusses arrays in C programming. Some key points include:
- An array is a collection of variables of the same type referred to by a common name. Each element has an index and arrays use contiguous memory locations.
- Arrays are declared with the type, name, and size. The first element is at index 0.
- One-dimensional arrays can be initialized, accessed, input from and output to the user. Multidimensional arrays like 2D arrays represent tables with rows and columns.
- Arrays can be passed to functions by passing the entire array or individual elements. Operations like searching, sorting and merging can be performed on arrays.
Scala 2 + 2 > 4
The document contains code examples demonstrating various Scala programming concepts such as functions, pattern matching, traits, actors and more. It also includes links to online resources for learning Scala.
Operator Overloading & Type Conversions
The document discusses operator overloading in C++. It lists which operators can and cannot be overloaded. It provides examples of overloading unary, binary, and subscript operators. It also covers copy constructors and how they must accept a const reference argument to avoid infinite recursion when copying an object. An Array class is implemented that overloads various operators like ==, !=, [], and = to provide functionality like element access, copying, assignment, and comparisons.
Operator overloading
Operator overloading is a technique by which operators used in a programming language are implemented in user-defined types with customized logic that is based on the types of arguments passed.
programs on arrays.pdf
The document provides solutions to various problems involving 1D arrays in C and Python. It includes programs to:
1. Reverse the elements of an array
2. Determine if an array contains all even, odd, or mixed elements
3. Count the number of even and odd elements in an array
4. Check if two arrays are equal
5. Find the sum of perfect square elements in an array
6. Find the minimum scalar product of two vectors
7. Find the smallest and largest elements in an array
8. Print all distinct elements in an array
9. Check if two arrays are disjoint
For each problem, it provides the algorithm, C and Python solutions, sample input/output,
Fp201 unit4
The document discusses arrays in C++. It explains one-dimensional and two-dimensional arrays, how to declare, initialize, and access elements of arrays. Key points include arrays storing a collection of like-typed data, being indexed starting from 0, initializing during declaration, and accessing two-dimensional array elements requiring row and column indices. Examples are provided to demonstrate array concepts.
lecture12.ppt
The document discusses operator overloading in C++. It explains that operators can be overloaded to work with user-defined classes by writing operator functions. It lists the operators that can and cannot be overloaded. It also describes restrictions on overloading like preserving precedence and arity. The document provides examples of overloading binary, unary, assignment and stream insertion/extraction operators and discusses their implementation as member or non-member functions. It also presents a case study of overloading operators for an Array class.
Array and string in C++_093547 analysis.pptx
- Arrays allow storing multiple values of the same type sequentially in memory. They have a fixed size or dimension.
- To declare an integer array of size 4, we write "int arr[4]". Individual elements can be accessed using indexes from 0 to dimension-1.
- Strings in C++ are arrays of characters that end with a null character. Common string functions like strcpy(), strcat(), strlen() allow manipulating strings.
(Parent reference for BST) Redefine TreeNode by adding a reference to.pdf
(Parent reference for BST) Redefine TreeNode by adding a reference to a node\'s parent, as
shown below\': Reimplement the insert and delete methods in the BST class to update the parent
for each node in the tree. Add the following new method in BST:/** Returns the node for the
specified element. * Returns null if the element is not in the tree. */private TreeNode getNode(E
element)/** Returns true if the node for the element is a leaf */private boolean isLeaf(E
element)/** Returns the path of elements from the specified element * to the root in an array
list. */public ArrayList getPath(E e) Write a test program that prompts the user to enter 10
integers, adds them to the tree, deletes the first integer from the tree, and displays the paths for
all leaf nodes. Here is a sample run:
Solution
#include
#include
void swap(char *x, char *y)
{
char temp;
temp = *x;
*x = *y;
*y = temp;
void permute(char *a, int l, int r)
{
int i;
if (l == r)
printf(\"%s\ \", a);
else
{
for (i = l; i <= r; i++)
{
swap((a+l), (a+i));
permute(a, l+1, r);
swap((a+l), (a+i)); //backtrack
}
}
}
int main()
{
char str[] = \"ABC\";
int n = strlen(str);
permute(str, 0, n-1);
return 0;
}
part ii radix sort:
c++
#include
using namespace std;
int getMax(int arr[], int n)
{
int mx = arr[0];
for (int i = 1; i < n; i++)
if (arr[i] > mx)
mx = arr[i];
return main()
void countSort(int arr[], int n, int exp
for (i = 0; i < n; i++)
count[ (arr[i]/exp)%10 ]++;
for (i = 1; i < 10; i++)
count[i] += count[i - 1];
for (i = n - 1; i >= 0; i--)
{
output[count[ (arr[i]/exp)%10 ] - 1] = arr[i];
count[ (arr[i]/exp)%10 ]--;
}
for (i = 0; i < n; i++)
arr[i] = output[i];
}
adixsort(int arr[], int n)
{
int m = getMax(arr, n);
for (int exp = 1; m/exp > 0; exp *= 10)
countSort(arr, n, exp);
}
void print(int arr[], int n)
{
for (int i = 0; i < n; i++)
cout << arr[i] << \" \";
}
int main()
{
int arr[] = {170, 45, 75, 90, 802, 24, 2, 66};
int n = sizeof(arr)/sizeof(arr[0]);
radixsort(arr, n);
print(arr, n);
return 0;
}
java:
import java.io.*;
import java.util.*;
class Radix {
static int getMax(int arr[], int n)
{
int mx = arr[0];
for (int i = 1; i < n; i++)
if (arr[i] > mx)
mx = arr[i];
return mx;
}
static void countSort(int arr[], int n, int exp)
{
int output[] = new int[n]; // output array
int i;
int count[] = new int[10];
Arrays.fill(count,0);
for (i = 0; i < n; i++)
count[ (arr[i]/exp)%10 ]++;
for (i = 1; i < 10; i++)
count[i] += count[i - 1];
for (i = n - 1; i >= 0; i--)
{
output[count[ (arr[i]/exp)%10 ] - 1] = arr[i];
count[ (arr[i]/exp)%10 ]--;
}
for (i = 0; i < n; i++)
arr[i] = output[i];
}
static void radixsort(int arr[], int n)
{
int m = getMax(arr, n);
for (int exp = 1; m/exp > 0; exp *= 10)
countSort(arr, n, exp);
}
static void print(int arr[], int n)
{
for (int i=0; i
#include
void swap(char *x, char *y)
{
char temp;
temp = *x;
*x = *y;
*y = temp;
void permute(char *a, int l, int r)
{
int i;
if (l == r)
printf(\"%s\ \", a);
else
{
for (i = l; i <= r; i++)
{
swap((a+l), (a+i));
permute(a, l+1, .
Synapse india dotnet development overloading operater part 3
Synapse india dotnet development overloading operater part 3
SynapseIndia PHP Development,
SynapseIndia Magento Development,
SynapseIndia Reviews,
SynapseIndia Complaints,
SynapseIndia Sharepoint Development,
SynapseIndia dotnet Development
Arrays matrix 2020 ab
Arrays
Structures of related data items
Static entity - same size throughout program
selected problems in matrix and array
Groovy
Groovy is a dynamic language for the Java Virtual Machine that aims to provide a concise, readable syntax with features like closures, metaprogramming and domain-specific language support. Some key features include dynamic typing, operator overloading, builders for generating XML/Swing code and the ability to extend any class or category of objects with additional methods. Groovy aims to be fully interoperable with Java while allowing more compact representations of common patterns.
Write a program that obtains the execution time of selection sort, bu.pdf
Write a java program called Question39 that does the following: Gets input for temperature
Utilizing a branching statement: If temperature is 76-100, call method outputHot passing the
temperature input as an argument. If temperature is 0-39, call method outputCold passing the
temperature input as an argument. If temperature is 40 to 75, call method outputJustRight
passing the temperature input as an argument. If temperature is outside these ranges, output
“Temperature outside range” to the screen. Be precise, import modules, include comments,
prologue, etc. as needed.
Solution
Question39.java
import java.util.Scanner;
public class Question39 {
public static void main(String[] args) {
Scanner scan = new Scanner(System.in);
System.out.println(\"Enter temperature: \");
int temp = scan.nextInt();
if(temp >=76 && temp <=100){
outputHot(temp);
}
else if(temp >=0 && temp <=39){
outputCold(temp);
}
else if(temp >=40 && temp <=75){
outputJustRight(temp);
}
else{
System.out.println(\"Temperature outside range\");
}
}
public static void outputHot(int temp){
System.out.println(\"Temperature \"+temp+\" Hot \");
}
public static void outputCold(int temp){
System.out.println(\"Temperature \"+temp+\" Cold \");
}
public static void outputJustRight(int temp){
System.out.println(\"Temperature \"+temp+\" Just Right \");
}
}
Output:
Enter temperature:
45
Temperature 45 Just Right.
Chapter12 array-single-dimension
An array is a collection of elements of the same data type. It can be initialized with values specified in braces when declared. Individual array elements can be accessed using the array name and subscript index. Arrays can be passed as parameters to functions by passing the array name without brackets. Basic operations on arrays include traversing, searching, sorting, and merging elements.
Arrays
The document discusses various concepts related to arrays in C/C++ including:
- What an array is and its key properties like contiguous memory locations and common data type
- Different types of arrays like single dimensional and multi dimensional
- How to declare, initialize and access array elements
- Passing arrays to functions
- Searching and sorting arrays
- Common array operations like insertion and deletion
Basic c programs updated on 31.8.2020
The document provides examples of basic C programs that demonstrate fundamental programming concepts like printing values, arithmetic operations, arrays, functions, conditionals, loops, and matrices. The programs cover topics such as printing and reading integers, adding/multiplying numbers, swapping values, checking vowels/consonants, Armstrong numbers, palindromes, summing matrices, and finding the transpose of a matrix.
Array
The document discusses arrays and strings in C programming. It covers topics like declaring and initializing single and multi-dimensional arrays, accessing array elements, passing arrays to functions, and common array operations like sorting, calculating average and standard deviation. Strings are also introduced as arrays of characters terminated by a null character. Examples are provided for many array concepts and operations.
Object oriented programming; operator overloading array
In programming, operator overloading, sometimes termed operator ad hoc polymorphism, is a specific case of polymorphism, where different operators have different implementations depending on their arguments. Operator overloading is generally defined by a programming language, a programmer, or both.
#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] .
Daapracticals 111105084852-phpapp02
1. The document provides code snippets for implementing various sorting algorithms including heap sort, quicksort, merge sort, radix sort, bucket sort, and insertion sort. It also includes code for graph algorithms like Dijkstra's algorithm, Warshall's algorithm, and the knapsack problem using dynamic programming.
COA_remaining_lab_works_077BCT033.pdf
The document summarizes the output of labs 5, 6, and 7 from a computer engineering course. Lab 5 implements non-restoring division using a register-based algorithm. Lab 6 compares FIFO and LRU page replacement algorithms. Lab 7 implements Booth's multiplication algorithm for signed numbers using registers. Code snippets are provided for each lab along with sample inputs/outputs.
pointers 1
This document contains examples and explanations of various C programming concepts related to pointers, arrays, functions and preprocessor directives. It provides code snippets to demonstrate pointer operations, passing arrays to functions, macro definitions, enumerations and for loop expressions.
C-Sharp Arithmatic Expression Calculator
The document describes a problem statement to create a simple calculation module that can process arithmetic expressions. It provides the input specification using Backus-Naur Form to define the syntax. It then describes taking a simple approach to solve this without using .NET Expression Trees, including possible test failures. It includes the code for a CalcEngine class to calculate expressions and CalcEngineTest class with unit tests to validate the calculations and failures.
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 ) common in nature, but commonly used psychological measures rare.pdf
C ) common in nature, but commonly used psychological measures rarely yield normally
distributed scores
Solution
C ) common in nature, but commonly used psychological measures rarely yield normally
distributed scores.
Question evidence 1. Comparison of DNA sequences among single-ce.pdf
Question evidence 1. Comparison of DNA sequences among single-celled organisms
suggests that eukaryotes are more closely related to archaea than to bacteria. Bioinformatics 2.
The oldest known and most primitive bird is the 150-million-year old Archaeopteryx. Its remains
display feathered wings, but its skeleton is otherwise similar to the two-legged dinosaurs that
lived at that time. Fossil record 3. The skulls of humans and other primates have the same basic
layout of bones, even though the heads are drastically different sizes and shapes. comparative
anatomy. Comparative anatomy 4. Most of the animals found on the island of Madagascar are
found nowhere else, indicating they evolved from ancestral populations after Madagascar was
biogeography isolated from other continents. Biogeography 5. Remains of a 365 million year
old organi named Ichthyostega include features that suggest it me in water and on land,
indicating that a transitional species becween fish and land-dwelling amphibians. Fossil record
6. The amino acid sequence of human hemoglobin is more similar to the sequence of hemoglobin
from dogs than it is to the sequence from fish Bioinformatics 7. Fossils of some species of
reptile are found only in West Africa and Brazil, even though these locations are currently
separated by thousands of miles of Atlantic ocean. Biogeography
Solution
Question evidence 1. Comparison of DNA sequences among single-celled organisms
suggests that eukaryotes are more closely related to archaea than to bacteria. Bioinformatics 2.
The oldest known and most primitive bird is the 150-million-year old Archaeopteryx. Its remains
display feathered wings, but its skeleton is otherwise similar to the two-legged dinosaurs that
lived at that time. Fossil record 3. The skulls of humans and other primates have the same basic
layout of bones, even though the heads are drastically different sizes and shapes. comparative
anatomy. Comparative anatomy 4. Most of the animals found on the island of Madagascar are
found nowhere else, indicating they evolved from ancestral populations after Madagascar was
biogeography isolated from other continents. Biogeography 5. Remains of a 365 million year
old organi named Ichthyostega include features that suggest it me in water and on land,
indicating that a transitional species becween fish and land-dwelling amphibians. Fossil record
6. The amino acid sequence of human hemoglobin is more similar to the sequence of hemoglobin
from dogs than it is to the sequence from fish Bioinformatics 7. Fossils of some species of
reptile are found only in West Africa and Brazil, even though these locations are currently
separated by thousands of miles of Atlantic ocean. Biogeography.
More Related Content
Similar to check the modifed code now you will get all operations done.termin.pdf
Fp201 unit4
The document discusses arrays in C++. It explains one-dimensional and two-dimensional arrays, how to declare, initialize, and access elements of arrays. Key points include arrays storing a collection of like-typed data, being indexed starting from 0, initializing during declaration, and accessing two-dimensional array elements requiring row and column indices. Examples are provided to demonstrate array concepts.
lecture12.ppt
The document discusses operator overloading in C++. It explains that operators can be overloaded to work with user-defined classes by writing operator functions. It lists the operators that can and cannot be overloaded. It also describes restrictions on overloading like preserving precedence and arity. The document provides examples of overloading binary, unary, assignment and stream insertion/extraction operators and discusses their implementation as member or non-member functions. It also presents a case study of overloading operators for an Array class.
Array and string in C++_093547 analysis.pptx
- Arrays allow storing multiple values of the same type sequentially in memory. They have a fixed size or dimension.
- To declare an integer array of size 4, we write "int arr[4]". Individual elements can be accessed using indexes from 0 to dimension-1.
- Strings in C++ are arrays of characters that end with a null character. Common string functions like strcpy(), strcat(), strlen() allow manipulating strings.
(Parent reference for BST) Redefine TreeNode by adding a reference to.pdf
(Parent reference for BST) Redefine TreeNode by adding a reference to a node\'s parent, as
shown below\': Reimplement the insert and delete methods in the BST class to update the parent
for each node in the tree. Add the following new method in BST:/** Returns the node for the
specified element. * Returns null if the element is not in the tree. */private TreeNode getNode(E
element)/** Returns true if the node for the element is a leaf */private boolean isLeaf(E
element)/** Returns the path of elements from the specified element * to the root in an array
list. */public ArrayList getPath(E e) Write a test program that prompts the user to enter 10
integers, adds them to the tree, deletes the first integer from the tree, and displays the paths for
all leaf nodes. Here is a sample run:
Solution
#include
#include
void swap(char *x, char *y)
{
char temp;
temp = *x;
*x = *y;
*y = temp;
void permute(char *a, int l, int r)
{
int i;
if (l == r)
printf(\"%s\ \", a);
else
{
for (i = l; i <= r; i++)
{
swap((a+l), (a+i));
permute(a, l+1, r);
swap((a+l), (a+i)); //backtrack
}
}
}
int main()
{
char str[] = \"ABC\";
int n = strlen(str);
permute(str, 0, n-1);
return 0;
}
part ii radix sort:
c++
#include
using namespace std;
int getMax(int arr[], int n)
{
int mx = arr[0];
for (int i = 1; i < n; i++)
if (arr[i] > mx)
mx = arr[i];
return main()
void countSort(int arr[], int n, int exp
for (i = 0; i < n; i++)
count[ (arr[i]/exp)%10 ]++;
for (i = 1; i < 10; i++)
count[i] += count[i - 1];
for (i = n - 1; i >= 0; i--)
{
output[count[ (arr[i]/exp)%10 ] - 1] = arr[i];
count[ (arr[i]/exp)%10 ]--;
}
for (i = 0; i < n; i++)
arr[i] = output[i];
}
adixsort(int arr[], int n)
{
int m = getMax(arr, n);
for (int exp = 1; m/exp > 0; exp *= 10)
countSort(arr, n, exp);
}
void print(int arr[], int n)
{
for (int i = 0; i < n; i++)
cout << arr[i] << \" \";
}
int main()
{
int arr[] = {170, 45, 75, 90, 802, 24, 2, 66};
int n = sizeof(arr)/sizeof(arr[0]);
radixsort(arr, n);
print(arr, n);
return 0;
}
java:
import java.io.*;
import java.util.*;
class Radix {
static int getMax(int arr[], int n)
{
int mx = arr[0];
for (int i = 1; i < n; i++)
if (arr[i] > mx)
mx = arr[i];
return mx;
}
static void countSort(int arr[], int n, int exp)
{
int output[] = new int[n]; // output array
int i;
int count[] = new int[10];
Arrays.fill(count,0);
for (i = 0; i < n; i++)
count[ (arr[i]/exp)%10 ]++;
for (i = 1; i < 10; i++)
count[i] += count[i - 1];
for (i = n - 1; i >= 0; i--)
{
output[count[ (arr[i]/exp)%10 ] - 1] = arr[i];
count[ (arr[i]/exp)%10 ]--;
}
for (i = 0; i < n; i++)
arr[i] = output[i];
}
static void radixsort(int arr[], int n)
{
int m = getMax(arr, n);
for (int exp = 1; m/exp > 0; exp *= 10)
countSort(arr, n, exp);
}
static void print(int arr[], int n)
{
for (int i=0; i
#include
void swap(char *x, char *y)
{
char temp;
temp = *x;
*x = *y;
*y = temp;
void permute(char *a, int l, int r)
{
int i;
if (l == r)
printf(\"%s\ \", a);
else
{
for (i = l; i <= r; i++)
{
swap((a+l), (a+i));
permute(a, l+1, .
Synapse india dotnet development overloading operater part 3
Synapse india dotnet development overloading operater part 3
SynapseIndia PHP Development,
SynapseIndia Magento Development,
SynapseIndia Reviews,
SynapseIndia Complaints,
SynapseIndia Sharepoint Development,
SynapseIndia dotnet Development
Arrays matrix 2020 ab
Arrays
Structures of related data items
Static entity - same size throughout program
selected problems in matrix and array
Groovy
Groovy is a dynamic language for the Java Virtual Machine that aims to provide a concise, readable syntax with features like closures, metaprogramming and domain-specific language support. Some key features include dynamic typing, operator overloading, builders for generating XML/Swing code and the ability to extend any class or category of objects with additional methods. Groovy aims to be fully interoperable with Java while allowing more compact representations of common patterns.
Write a program that obtains the execution time of selection sort, bu.pdf
Write a java program called Question39 that does the following: Gets input for temperature
Utilizing a branching statement: If temperature is 76-100, call method outputHot passing the
temperature input as an argument. If temperature is 0-39, call method outputCold passing the
temperature input as an argument. If temperature is 40 to 75, call method outputJustRight
passing the temperature input as an argument. If temperature is outside these ranges, output
“Temperature outside range” to the screen. Be precise, import modules, include comments,
prologue, etc. as needed.
Solution
Question39.java
import java.util.Scanner;
public class Question39 {
public static void main(String[] args) {
Scanner scan = new Scanner(System.in);
System.out.println(\"Enter temperature: \");
int temp = scan.nextInt();
if(temp >=76 && temp <=100){
outputHot(temp);
}
else if(temp >=0 && temp <=39){
outputCold(temp);
}
else if(temp >=40 && temp <=75){
outputJustRight(temp);
}
else{
System.out.println(\"Temperature outside range\");
}
}
public static void outputHot(int temp){
System.out.println(\"Temperature \"+temp+\" Hot \");
}
public static void outputCold(int temp){
System.out.println(\"Temperature \"+temp+\" Cold \");
}
public static void outputJustRight(int temp){
System.out.println(\"Temperature \"+temp+\" Just Right \");
}
}
Output:
Enter temperature:
45
Temperature 45 Just Right.
Chapter12 array-single-dimension
An array is a collection of elements of the same data type. It can be initialized with values specified in braces when declared. Individual array elements can be accessed using the array name and subscript index. Arrays can be passed as parameters to functions by passing the array name without brackets. Basic operations on arrays include traversing, searching, sorting, and merging elements.
Arrays
The document discusses various concepts related to arrays in C/C++ including:
- What an array is and its key properties like contiguous memory locations and common data type
- Different types of arrays like single dimensional and multi dimensional
- How to declare, initialize and access array elements
- Passing arrays to functions
- Searching and sorting arrays
- Common array operations like insertion and deletion
Basic c programs updated on 31.8.2020
The document provides examples of basic C programs that demonstrate fundamental programming concepts like printing values, arithmetic operations, arrays, functions, conditionals, loops, and matrices. The programs cover topics such as printing and reading integers, adding/multiplying numbers, swapping values, checking vowels/consonants, Armstrong numbers, palindromes, summing matrices, and finding the transpose of a matrix.
Array
The document discusses arrays and strings in C programming. It covers topics like declaring and initializing single and multi-dimensional arrays, accessing array elements, passing arrays to functions, and common array operations like sorting, calculating average and standard deviation. Strings are also introduced as arrays of characters terminated by a null character. Examples are provided for many array concepts and operations.
Object oriented programming; operator overloading array
In programming, operator overloading, sometimes termed operator ad hoc polymorphism, is a specific case of polymorphism, where different operators have different implementations depending on their arguments. Operator overloading is generally defined by a programming language, a programmer, or both.
#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] .
Daapracticals 111105084852-phpapp02
1. The document provides code snippets for implementing various sorting algorithms including heap sort, quicksort, merge sort, radix sort, bucket sort, and insertion sort. It also includes code for graph algorithms like Dijkstra's algorithm, Warshall's algorithm, and the knapsack problem using dynamic programming.
COA_remaining_lab_works_077BCT033.pdf
The document summarizes the output of labs 5, 6, and 7 from a computer engineering course. Lab 5 implements non-restoring division using a register-based algorithm. Lab 6 compares FIFO and LRU page replacement algorithms. Lab 7 implements Booth's multiplication algorithm for signed numbers using registers. Code snippets are provided for each lab along with sample inputs/outputs.
pointers 1
This document contains examples and explanations of various C programming concepts related to pointers, arrays, functions and preprocessor directives. It provides code snippets to demonstrate pointer operations, passing arrays to functions, macro definitions, enumerations and for loop expressions.
C-Sharp Arithmatic Expression Calculator
The document describes a problem statement to create a simple calculation module that can process arithmetic expressions. It provides the input specification using Backus-Naur Form to define the syntax. It then describes taking a simple approach to solve this without using .NET Expression Trees, including possible test failures. It includes the code for a CalcEngine class to calculate expressions and CalcEngineTest class with unit tests to validate the calculations and failures.
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.
Similar to check the modifed code now you will get all operations done.termin.pdf (20)
(Parent reference for BST) Redefine TreeNode by adding a reference to.pdf
(Parent reference for BST) Redefine TreeNode by adding a reference to.pdf
Synapse india dotnet development overloading operater part 3
Synapse india dotnet development overloading operater part 3
Write a program that obtains the execution time of selection sort, bu.pdf
Write a program that obtains the execution time of selection sort, bu.pdf
Object oriented programming; operator overloading array
Object oriented programming; operator overloading array
#include stdio.h#include stdlib.h#include string.h#inclu.pdf
#include stdio.h#include stdlib.h#include string.h#inclu.pdf
More from angelfragranc
C ) common in nature, but commonly used psychological measures rare.pdf
C ) common in nature, but commonly used psychological measures rarely yield normally
distributed scores
Solution
C ) common in nature, but commonly used psychological measures rarely yield normally
distributed scores.
Question evidence 1. Comparison of DNA sequences among single-ce.pdf
Question evidence 1. Comparison of DNA sequences among single-celled organisms
suggests that eukaryotes are more closely related to archaea than to bacteria. Bioinformatics 2.
The oldest known and most primitive bird is the 150-million-year old Archaeopteryx. Its remains
display feathered wings, but its skeleton is otherwise similar to the two-legged dinosaurs that
lived at that time. Fossil record 3. The skulls of humans and other primates have the same basic
layout of bones, even though the heads are drastically different sizes and shapes. comparative
anatomy. Comparative anatomy 4. Most of the animals found on the island of Madagascar are
found nowhere else, indicating they evolved from ancestral populations after Madagascar was
biogeography isolated from other continents. Biogeography 5. Remains of a 365 million year
old organi named Ichthyostega include features that suggest it me in water and on land,
indicating that a transitional species becween fish and land-dwelling amphibians. Fossil record
6. The amino acid sequence of human hemoglobin is more similar to the sequence of hemoglobin
from dogs than it is to the sequence from fish Bioinformatics 7. Fossils of some species of
reptile are found only in West Africa and Brazil, even though these locations are currently
separated by thousands of miles of Atlantic ocean. Biogeography
Solution
Question evidence 1. Comparison of DNA sequences among single-celled organisms
suggests that eukaryotes are more closely related to archaea than to bacteria. Bioinformatics 2.
The oldest known and most primitive bird is the 150-million-year old Archaeopteryx. Its remains
display feathered wings, but its skeleton is otherwise similar to the two-legged dinosaurs that
lived at that time. Fossil record 3. The skulls of humans and other primates have the same basic
layout of bones, even though the heads are drastically different sizes and shapes. comparative
anatomy. Comparative anatomy 4. Most of the animals found on the island of Madagascar are
found nowhere else, indicating they evolved from ancestral populations after Madagascar was
biogeography isolated from other continents. Biogeography 5. Remains of a 365 million year
old organi named Ichthyostega include features that suggest it me in water and on land,
indicating that a transitional species becween fish and land-dwelling amphibians. Fossil record
6. The amino acid sequence of human hemoglobin is more similar to the sequence of hemoglobin
from dogs than it is to the sequence from fish Bioinformatics 7. Fossils of some species of
reptile are found only in West Africa and Brazil, even though these locations are currently
separated by thousands of miles of Atlantic ocean. Biogeography.
The purpose of alchol (ethanol) is to dissolve io.pdf
The purpose of alchol (ethanol) is to dissolve iodine in it as iodine does not dissolve
in water.
Solution
The purpose of alchol (ethanol) is to dissolve iodine in it as iodine does not dissolve
in water..
The components may not separate properly, because.pdf
The components may not separate properly, because the solvent will overload
Solution
The components may not separate properly, because the solvent will overload.
The answer would be 5 because Dehydration in a .pdf
The answer would be 5 because: Dehydration in a secondary alcohol usually reacts
via E1 reactions. In E1 reactions, rearrangements occur if possible so although the product
assumed would be 1, a methyl shift occurs. One of the methyl groups from the tertiary carbon
shifts when the molecule is a carbocation, so that the carbocation becomes not a secondary but a
tertiary carbocation. Pictures would make it easier to visualize, but if you look up E1 reactions,
you will understand how rearrangements work.
Solution
The answer would be 5 because: Dehydration in a secondary alcohol usually reacts
via E1 reactions. In E1 reactions, rearrangements occur if possible so although the product
assumed would be 1, a methyl shift occurs. One of the methyl groups from the tertiary carbon
shifts when the molecule is a carbocation, so that the carbocation becomes not a secondary but a
tertiary carbocation. Pictures would make it easier to visualize, but if you look up E1 reactions,
you will understand how rearrangements work..
SO3 Sol.pdf
This very short document contains the chemical formula for sulfur trioxide repeated three times. It consists of a sulfur atom bonded to three oxygen atoms. No other information is provided about sulfur trioxide in the given text.
Nucleophile is any negative ion or any neutral mo.pdf
Nucleophile is any negative ion or any neutral molecule that has at least one
unshared electron pair. Alkene act as a Nucleophile Halide ion act as a Nucleophile Sodium
borohydride is the transfer of a hydride ion, from the metal to the carbonyl carbon. In this
transfer the hydride ion acts as nucleophile.
Solution
Nucleophile is any negative ion or any neutral molecule that has at least one
unshared electron pair. Alkene act as a Nucleophile Halide ion act as a Nucleophile Sodium
borohydride is the transfer of a hydride ion, from the metal to the carbonyl carbon. In this
transfer the hydride ion acts as nucleophile..
Moles of acid (HNO2) = Vol conc = 0.52 = 1 mol.pdf
Moles of acid (HNO2) = Vol * conc = 0.5*2 = 1 mole Moles of salt = 140 / MM =
2 moles pH = pKa + log (salt / acid) = - log (Ka) + log (salt/acid) = - log (5*10^-4) + log (2/1)
= 3.602
Solution
Moles of acid (HNO2) = Vol * conc = 0.5*2 = 1 mole Moles of salt = 140 / MM =
2 moles pH = pKa + log (salt / acid) = - log (Ka) + log (salt/acid) = - log (5*10^-4) + log (2/1)
= 3.602.
it is a salt formed by KOH and HCl it is a neutra.pdf
it is a salt formed by KOH and HCl it is a neutral salt since both are strong
Solution
it is a salt formed by KOH and HCl it is a neutral salt since both are strong.
Cultural competence refers to an ability to inter.pdf
Cultural competence refers to an ability to interact effectively with people of
different cultures and socio-economic backgrounds, particularly in the context of human
resources, non-profit organizations, and government agencies whose employees work with
persons from different cultural/ethnic backgrounds. Cultural competence comprises four
components: (a) Awareness of one\'s own cultural worldview, (b) Attitude towards cultural
differences, (c) Knowledge of different cultural practices and worldviews, and (d) Cross-cultural
skills. Developing cultural competence results in an ability to understand, communicate with,
and effectively interact with people across cultures.[1]
Solution
Cultural competence refers to an ability to interact effectively with people of
different cultures and socio-economic backgrounds, particularly in the context of human
resources, non-profit organizations, and government agencies whose employees work with
persons from different cultural/ethnic backgrounds. Cultural competence comprises four
components: (a) Awareness of one\'s own cultural worldview, (b) Attitude towards cultural
differences, (c) Knowledge of different cultural practices and worldviews, and (d) Cross-cultural
skills. Developing cultural competence results in an ability to understand, communicate with,
and effectively interact with people across cultures.[1].
Conformers can also be named as conformational is.pdf
Conformers can also be named as conformational isomers.The isomers used for the
conformational isomerism. Which can be defined as “ the form of stereoisomerism in which the
isomers can be interconverted by rotation of the single bonds”.
Solution
Conformers can also be named as conformational isomers.The isomers used for the
conformational isomerism. Which can be defined as “ the form of stereoisomerism in which the
isomers can be interconverted by rotation of the single bonds”..
benzene sulphonic acid - SO3H on benzene ring .pdf
benzene sulphonic acid - SO3H on benzene ring
Solution
benzene sulphonic acid - SO3H on benzene ring.
The HTML was developed by Tim Berners Lee, to create electronic docu.pdf
HTML was created by Tim Berners-Lee to develop electronic documents and retain inputted information. JTextField uses SpringLayout to specify its location and size on screens. BASIC was originally developed by Microsoft while SABRE, made in the 1950s, is still used today for business functions.
The genotype of happy skipping smurf 2 – Hs hSSolutionThe ge.pdf
The genotype of happy skipping smurf 2 – Hs / hS
Solution
The genotype of happy skipping smurf 2 – Hs / hS.
ans D because NO2 has higher priority and should.pdf
ans :D because NO2 has higher priority and should be named following
alphabetical order so bromo comes first
Solution
ans :D because NO2 has higher priority and should be named following
alphabetical order so bromo comes first.
The objective of the above code is to define a phonebook entry in ja.pdf
The objective of the above code is to define a phonebook entry in java and test it .
It has 2 classes
- PhoneBookEntry
- PhoneBookEntryTest
The steps to achieve the objective are :
- create a class PhoneBookEntry
- identified attributes name and phone number
- declared the above attribites with private modifier to enable encapsulation and data hiding
capability.
- define parameterized constructor to initialize objects with instance variable values
- define getter and setter methods for the above instance variables to access and edit the instance
variable.
- define overidden toString() method to print the PhoneBookEntry object details like name and
phone number at the same time.
In the PhoneBookEntry class we have main() method to test the PhoneBookEntry class :
- create a ArrayList of type PhoneBookEntry class to store multiple phone book entries
- create a Scanner class object to be useful for taking command line input.
- using a for loop take input of name and phone number for 5 entries like
name=scan.nextLine();
phoneNo=scan.nextLong();
- create phonebookentry object at each iteration for 5 times by providing name phone number
details to the parameter ized constructor.
PhoneBookEntry pe =new PhoneBookEntry(name,phoneNo);
- add the object to the list of entries for 5 iterations
list.add(pe);
- finally print the 5 entries in the list using for each loop and toString() method
Solution
The objective of the above code is to define a phonebook entry in java and test it .
It has 2 classes
- PhoneBookEntry
- PhoneBookEntryTest
The steps to achieve the objective are :
- create a class PhoneBookEntry
- identified attributes name and phone number
- declared the above attribites with private modifier to enable encapsulation and data hiding
capability.
- define parameterized constructor to initialize objects with instance variable values
- define getter and setter methods for the above instance variables to access and edit the instance
variable.
- define overidden toString() method to print the PhoneBookEntry object details like name and
phone number at the same time.
In the PhoneBookEntry class we have main() method to test the PhoneBookEntry class :
- create a ArrayList of type PhoneBookEntry class to store multiple phone book entries
- create a Scanner class object to be useful for taking command line input.
- using a for loop take input of name and phone number for 5 entries like
name=scan.nextLine();
phoneNo=scan.nextLong();
- create phonebookentry object at each iteration for 5 times by providing name phone number
details to the parameter ized constructor.
PhoneBookEntry pe =new PhoneBookEntry(name,phoneNo);
- add the object to the list of entries for 5 iterations
list.add(pe);
- finally print the 5 entries in the list using for each loop and toString() method.
A. He has a smaller radius than H because He has .pdf
A. He has a smaller radius than H because He has a larger effective nuclear charge
Hydrogen has one proton, helium has two. Hydrogen has one electron, helium has two, but IN
THE SAME ENERGY LEVEL (their average distance from the nucleus is the same). Since the
helium nucleus has increased positive charge, the helium electrons are drawn in toward the
nucleus (due to electrostatic attraction) than the single electron of hydrogen is to its nucleus.
(This is a side effect of imperfect electron shielding).
Solution
A. He has a smaller radius than H because He has a larger effective nuclear charge
Hydrogen has one proton, helium has two. Hydrogen has one electron, helium has two, but IN
THE SAME ENERGY LEVEL (their average distance from the nucleus is the same). Since the
helium nucleus has increased positive charge, the helium electrons are drawn in toward the
nucleus (due to electrostatic attraction) than the single electron of hydrogen is to its nucleus.
(This is a side effect of imperfect electron shielding)..
standard deviation = 0Solutionstandard deviation = 0.pdf
The document discusses standard deviation and provides a solution. The solution is that the standard deviation equals 0.
A transducer is a device, usually electrical, ele.pdf
A transducer is a device, usually electrical, electronic, electro-mechanical,
electromagnetic, photonic, or photovoltaic that converts one type of energy to another for various
purposes including measurement or information transfer (for example, pressure sensors). In a
broader sense (for example in the Viable System Model) a transducer is sometimes defined as
any device that converts a signal from one form to another. A very common device is an audio
speaker, which converts electrical voltage variations representing music or speech, to mechanical
cone vibration. The speaker cone in turn vibrates air molecules creating acoustical energy
Solution
A transducer is a device, usually electrical, electronic, electro-mechanical,
electromagnetic, photonic, or photovoltaic that converts one type of energy to another for various
purposes including measurement or information transfer (for example, pressure sensors). In a
broader sense (for example in the Viable System Model) a transducer is sometimes defined as
any device that converts a signal from one form to another. A very common device is an audio
speaker, which converts electrical voltage variations representing music or speech, to mechanical
cone vibration. The speaker cone in turn vibrates air molecules creating acoustical energy.
More from angelfragranc (20)
C ) common in nature, but commonly used psychological measures rare.pdf
C ) common in nature, but commonly used psychological measures rare.pdf
Question evidence 1. Comparison of DNA sequences among single-ce.pdf
Question evidence 1. Comparison of DNA sequences among single-ce.pdf
The purpose of alchol (ethanol) is to dissolve io.pdf
The purpose of alchol (ethanol) is to dissolve io.pdf
The components may not separate properly, because.pdf
The components may not separate properly, because.pdf
The answer would be 5 because Dehydration in a .pdf
The answer would be 5 because Dehydration in a .pdf
Nucleophile is any negative ion or any neutral mo.pdf
Nucleophile is any negative ion or any neutral mo.pdf
Moles of acid (HNO2) = Vol conc = 0.52 = 1 mol.pdf
Moles of acid (HNO2) = Vol conc = 0.52 = 1 mol.pdf
it is a salt formed by KOH and HCl it is a neutra.pdf
it is a salt formed by KOH and HCl it is a neutra.pdf
Cultural competence refers to an ability to inter.pdf
Cultural competence refers to an ability to inter.pdf
Conformers can also be named as conformational is.pdf
Conformers can also be named as conformational is.pdf
benzene sulphonic acid - SO3H on benzene ring .pdf
benzene sulphonic acid - SO3H on benzene ring .pdf
The HTML was developed by Tim Berners Lee, to create electronic docu.pdf
The HTML was developed by Tim Berners Lee, to create electronic docu.pdf
The genotype of happy skipping smurf 2 – Hs hSSolutionThe ge.pdf
The genotype of happy skipping smurf 2 – Hs hSSolutionThe ge.pdf
ans D because NO2 has higher priority and should.pdf
ans D because NO2 has higher priority and should.pdf
The objective of the above code is to define a phonebook entry in ja.pdf
The objective of the above code is to define a phonebook entry in ja.pdf
A. He has a smaller radius than H because He has .pdf
A. He has a smaller radius than H because He has .pdf
standard deviation = 0Solutionstandard deviation = 0.pdf
standard deviation = 0Solutionstandard deviation = 0.pdf
A transducer is a device, usually electrical, ele.pdf
A transducer is a device, usually electrical, ele.pdf
Recently uploaded
Mule event processing models | MuleSoft Mysore Meetup #47
Mule event processing models | MuleSoft Mysore Meetup #47
Event Link:- https://meetups.mulesoft.com/events/details/mulesoft-mysore-presents-mule-event-processing-models/
Agenda
● What is event processing in MuleSoft?
● Types of event processing models in Mule 4
● Distinction between the reactive, parallel, blocking & non-blocking processing
For Upcoming Meetups Join Mysore Meetup Group - https://meetups.mulesoft.com/mysore/YouTube:- youtube.com/@mulesoftmysore
Mysore WhatsApp group:- https://chat.whatsapp.com/EhqtHtCC75vCAX7gaO842N
Speaker:-
Shivani Yasaswi - https://www.linkedin.com/in/shivaniyasaswi/
Organizers:-
Shubham Chaurasia - https://www.linkedin.com/in/shubhamchaurasia1/
Giridhar Meka - https://www.linkedin.com/in/giridharmeka
Priya Shaw - https://www.linkedin.com/in/priya-shaw
clinical examination of hip joint (1).pdf
described clinical examination all orthopeadic conditions .
How to deliver Powerpoint Presentations.pptx
"How to make and deliver dynamic presentations by making it more interactive to captivate your audience attention"
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/y977uz6bpd3af4qsebv7r9b7s21935vdBed Making ( Introduction, Purpose, Types, Articles, Scientific principles, N...
Topic : Bed making
Subject : Nursing Foundation
How to Create a More Engaging and Human Online Learning Experience
How to Create a More Engaging and Human Online Learning Experience Wahiba Chair Training & Consulting
Wahiba Chair's Talk at the 2024 Learning Ideas Conference. 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.Wound healing PPT
This document provides an overview of wound healing, its functions, stages, mechanisms, factors affecting it, and complications.
A wound is a break in the integrity of the skin or tissues, which may be associated with disruption of the structure and function.
Healing is the body’s response to injury in an attempt to restore normal structure and functions.
Healing can occur in two ways: Regeneration and Repair
There are 4 phases of wound healing: hemostasis, inflammation, proliferation, and remodeling. This document also describes the mechanism of wound healing. Factors that affect healing include infection, uncontrolled diabetes, poor nutrition, age, anemia, the presence of foreign bodies, etc.
Complications of wound healing like infection, hyperpigmentation of scar, contractures, and keloid formation.
Philippine Edukasyong Pantahanan at Pangkabuhayan (EPP) Curriculum
(𝐓𝐋𝐄 𝟏𝟎𝟎) (𝐋𝐞𝐬𝐬𝐨𝐧 𝟏)-𝐏𝐫𝐞𝐥𝐢𝐦𝐬
𝐃𝐢𝐬𝐜𝐮𝐬𝐬 𝐭𝐡𝐞 𝐄𝐏𝐏 𝐂𝐮𝐫𝐫𝐢𝐜𝐮𝐥𝐮𝐦 𝐢𝐧 𝐭𝐡𝐞 𝐏𝐡𝐢𝐥𝐢𝐩𝐩𝐢𝐧𝐞𝐬:
- Understand the goals and objectives of the Edukasyong Pantahanan at Pangkabuhayan (EPP) curriculum, recognizing its importance in fostering practical life skills and values among students. Students will also be able to identify the key components and subjects covered, such as agriculture, home economics, industrial arts, and information and communication technology.
𝐄𝐱𝐩𝐥𝐚𝐢𝐧 𝐭𝐡𝐞 𝐍𝐚𝐭𝐮𝐫𝐞 𝐚𝐧𝐝 𝐒𝐜𝐨𝐩𝐞 𝐨𝐟 𝐚𝐧 𝐄𝐧𝐭𝐫𝐞𝐩𝐫𝐞𝐧𝐞𝐮𝐫:
-Define entrepreneurship, distinguishing it from general business activities by emphasizing its focus on innovation, risk-taking, and value creation. Students will describe the characteristics and traits of successful entrepreneurs, including their roles and responsibilities, and discuss the broader economic and social impacts of entrepreneurial activities on both local and global scales.
BBR 2024 Summer Sessions Interview Training
Qualitative research interview training by Professor Katrina Pritchard and Dr Helen Williams
RHEOLOGY Physical pharmaceutics-II notes for B.pharm 4th sem students
Physical pharmaceutics notes for B.pharm students
Gender and Mental Health - Counselling and Family Therapy Applications and In...
A proprietary approach developed by bringing together the best of learning theories from Psychology, design principles from the world of visualization, and pedagogical methods from over a decade of training experience, that enables you to: Learn better, faster!
বাংলাদেশ অর্থনৈতিক সমীক্ষা (Economic Review) ২০২৪ UJS App.pdf
বাংলাদেশের অর্থনৈতিক সমীক্ষা ২০২৪ [Bangladesh Economic Review 2024 Bangla.pdf] কম্পিউটার , ট্যাব ও স্মার্ট ফোন ভার্সন সহ সম্পূর্ণ বাংলা ই-বুক বা pdf বই " সুচিপত্র ...বুকমার্ক মেনু 🔖 ও হাইপার লিংক মেনু 📝👆 যুক্ত ..
আমাদের সবার জন্য খুব খুব গুরুত্বপূর্ণ একটি বই ..বিসিএস, ব্যাংক, ইউনিভার্সিটি ভর্তি ও যে কোন প্রতিযোগিতা মূলক পরীক্ষার জন্য এর খুব ইম্পরট্যান্ট একটি বিষয় ...তাছাড়া বাংলাদেশের সাম্প্রতিক যে কোন ডাটা বা তথ্য এই বইতে পাবেন ...
তাই একজন নাগরিক হিসাবে এই তথ্য গুলো আপনার জানা প্রয়োজন ...।
বিসিএস ও ব্যাংক এর লিখিত পরীক্ষা ...+এছাড়া মাধ্যমিক ও উচ্চমাধ্যমিকের স্টুডেন্টদের জন্য অনেক কাজে আসবে ...
Solutons Maths Escape Room Spatial .pptx
Solutions of Puzzles of Mathematics Escape Room Game in Spatial.io
The History of Stoke Newington Street Names
Presented at the Stoke Newington Literary Festival on 9th June 2024
www.StokeNewingtonHistory.com
Recently uploaded (20)
Mule event processing models | MuleSoft Mysore Meetup #47
Mule event processing models | MuleSoft Mysore Meetup #47
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...
Bed Making ( Introduction, Purpose, Types, Articles, Scientific principles, N...
Bed Making ( Introduction, Purpose, Types, Articles, Scientific principles, N...
How to Create a More Engaging and Human Online Learning Experience
How to Create a More Engaging and Human Online Learning Experience
Your Skill Boost Masterclass: Strategies for Effective Upskilling
Your Skill Boost Masterclass: Strategies for Effective Upskilling
Philippine Edukasyong Pantahanan at Pangkabuhayan (EPP) Curriculum
Philippine Edukasyong Pantahanan at Pangkabuhayan (EPP) Curriculum
RHEOLOGY Physical pharmaceutics-II notes for B.pharm 4th sem students
RHEOLOGY Physical pharmaceutics-II notes for B.pharm 4th sem students
Gender and Mental Health - Counselling and Family Therapy Applications and In...
Gender and Mental Health - Counselling and Family Therapy Applications and In...
বাংলাদেশ অর্থনৈতিক সমীক্ষা (Economic Review) ২০২৪ UJS App.pdf
বাংলাদেশ অর্থনৈতিক সমীক্ষা (Economic Review) ২০২৪ UJS App.pdf
check the modifed code now you will get all operations done.termin.pdf
- 1. check the modifed code now you will get all operations done. terminal will display add, subtract, multiply and div operation and dounday condition too. #include using namespace std; class Array { private: int start; int end; int *array; public: Array(int n); Array(int n, int m); int &operator[](int index); Array &operator=(Array a); bool operator==(Array &a); bool operator!=(Array &a); friend ostream &operator<<(ostream &out, Array &a); friend Array &operator+(Array &a, Array&b); friend Array &operator-(Array &a, Array&b); friend Array &operator*(Array &a, Array&b); friend Array &operator/(Array &a, Array&b); }; Array::Array(int n) { start = 0; end = n-1; array = new int[n]; for (int i = 0; i < n; i++) array[i] = i+1; } Array::Array(int n, int m) { start = n; end = m-1;
- 2. array = new int[m-n]; for (int i = 0; i < m-n; i++) array[i] = start + i; } int &Array::operator[](int index) { if (index >= start && index <= end) { return (array[index-start]); } cout << "Error: Index out of bounds." << endl; int temp = 0; return temp; //return *array; } Array &Array::operator=(Array a) { start = a.start; end = a.end; for(int i = 0; i < end - start; ++i) { array[i] = a.array[i]; } return *this; } bool Array::operator==(Array &a) { for(int i = 0; i < end - start; ++i) { if(array[i] != a.array[i]) return false; } return true; } bool Array::operator!=(Array &a){ return *this == a;
- 3. } ostream &operator<<(ostream &out, Array &b) { for(int i = 0; i < b.end - b.start; ++i) { out << "(" << i + b.start << ")" << b.array[i] << " "; } return out; } Array &operator+(Array &a, Array&b) { Array arr(a.end - a.start); for(int i = 0; i < a.end - a.start; ++i) { arr.array[i] = a.array[i] + b.array[i]; } return arr; } Array &operator-(Array &a, Array&b) { Array arr(a.end - a.start); for(int i = 0; i < a.end - a.start; ++i) { arr.array[i] = a.array[i] - b.array[i]; } return arr; } Array &operator*(Array &a, Array&b) { Array arr(a.end - a.start); for(int i = 0; i < a.end - a.start; ++i) { arr.array[i] = a.array[i] * b.array[i]; }
- 4. return arr; } Array &operator/(Array &a, Array&b) { Array arr(a.end - a.start); for(int i = 0; i < a.end - a.start; ++i) { if (a.array[i]!=0) arr.array[i] = b.array[i] / a.array[i]; } return arr; } int main() { Array test(10); Array Ary1(10,25); Array Ary2(-5,10); Array Ary3(15,30); int i; int j; for (i = 0; i < 10; i++) test[i] = i+1; cout << "Test array output" << endl; for (i = 0; i < 10; i++) cout << test[i] << " "; cout << endl; i = -5; while (i < 10) { Ary2[i] = i*2;
- 5. i++; } cout << " "; cout << "Ary2 array otuput" << endl; for (i = -5; i < 10; i++) cout << Ary2[i] << " "; cout << endl; i = 10; j = -5; while ( i < 25 ) { Ary1[ i ] = i*100; Ary2[j] = j * 200; i++; j++; }; cout << "Ary1 array output" << endl; cout << Ary1 << endl; cout << endl; cout << " "; cout << "Ary2 array output" << endl; cout << Ary2 << endl; cout << endl; cout << " "; for (i=0;i<14;i++) Ary3[i+15] = Ary1[i+10] + Ary2[i+-5]; cout << "Ary3 array Addition output" << endl; cout << Ary3 << endl; cout << " "; for (i=0;i<14;i++) Ary3[i+15] = Ary1[i+10] - Ary2[i+-5]; cout << "Ary3 array Subtraction output" << endl;
- 6. cout << Ary3 << endl; cout << " "; for (i=0;i<14;i++) Ary3[i+15] = Ary1[i+10] * Ary2[i+-5]; cout << "Ary3 array Multiply output" << endl; cout << Ary3 << endl; cout << " "; for (i=0;i<14;i++) Ary3[i+15] = Ary2[i+-5]/Ary1[i+10]; cout << "Ary3 array Division output" << endl; cout << Ary3 << endl; cout << " "; cout << "Test boundary conditions" << endl; Ary1[8] = 100; Ary1[16] = 200; i = 100; cout << Ary1[i] << endl; return 0; } Solution check the modifed code now you will get all operations done. terminal will display add, subtract, multiply and div operation and dounday condition too. #include using namespace std; class Array { private: int start; int end; int *array; public: Array(int n);
- 7. Array(int n, int m); int &operator[](int index); Array &operator=(Array a); bool operator==(Array &a); bool operator!=(Array &a); friend ostream &operator<<(ostream &out, Array &a); friend Array &operator+(Array &a, Array&b); friend Array &operator-(Array &a, Array&b); friend Array &operator*(Array &a, Array&b); friend Array &operator/(Array &a, Array&b); }; Array::Array(int n) { start = 0; end = n-1; array = new int[n]; for (int i = 0; i < n; i++) array[i] = i+1; } Array::Array(int n, int m) { start = n; end = m-1; array = new int[m-n]; for (int i = 0; i < m-n; i++) array[i] = start + i; } int &Array::operator[](int index) { if (index >= start && index <= end) { return (array[index-start]); } cout << "Error: Index out of bounds." << endl; int temp = 0; return temp;
- 8. //return *array; } Array &Array::operator=(Array a) { start = a.start; end = a.end; for(int i = 0; i < end - start; ++i) { array[i] = a.array[i]; } return *this; } bool Array::operator==(Array &a) { for(int i = 0; i < end - start; ++i) { if(array[i] != a.array[i]) return false; } return true; } bool Array::operator!=(Array &a){ return *this == a; } ostream &operator<<(ostream &out, Array &b) { for(int i = 0; i < b.end - b.start; ++i) { out << "(" << i + b.start << ")" << b.array[i] << " "; } return out; } Array &operator+(Array &a, Array&b) { Array arr(a.end - a.start); for(int i = 0; i < a.end - a.start; ++i)
- 9. { arr.array[i] = a.array[i] + b.array[i]; } return arr; } Array &operator-(Array &a, Array&b) { Array arr(a.end - a.start); for(int i = 0; i < a.end - a.start; ++i) { arr.array[i] = a.array[i] - b.array[i]; } return arr; } Array &operator*(Array &a, Array&b) { Array arr(a.end - a.start); for(int i = 0; i < a.end - a.start; ++i) { arr.array[i] = a.array[i] * b.array[i]; } return arr; } Array &operator/(Array &a, Array&b) { Array arr(a.end - a.start); for(int i = 0; i < a.end - a.start; ++i) { if (a.array[i]!=0) arr.array[i] = b.array[i] / a.array[i]; } return arr; }
- 10. int main() { Array test(10); Array Ary1(10,25); Array Ary2(-5,10); Array Ary3(15,30); int i; int j; for (i = 0; i < 10; i++) test[i] = i+1; cout << "Test array output" << endl; for (i = 0; i < 10; i++) cout << test[i] << " "; cout << endl; i = -5; while (i < 10) { Ary2[i] = i*2; i++; } cout << " "; cout << "Ary2 array otuput" << endl; for (i = -5; i < 10; i++) cout << Ary2[i] << " "; cout << endl; i = 10; j = -5; while ( i < 25 ) { Ary1[ i ] = i*100;
- 11. Ary2[j] = j * 200; i++; j++; }; cout << "Ary1 array output" << endl; cout << Ary1 << endl; cout << endl; cout << " "; cout << "Ary2 array output" << endl; cout << Ary2 << endl; cout << endl; cout << " "; for (i=0;i<14;i++) Ary3[i+15] = Ary1[i+10] + Ary2[i+-5]; cout << "Ary3 array Addition output" << endl; cout << Ary3 << endl; cout << " "; for (i=0;i<14;i++) Ary3[i+15] = Ary1[i+10] - Ary2[i+-5]; cout << "Ary3 array Subtraction output" << endl; cout << Ary3 << endl; cout << " "; for (i=0;i<14;i++) Ary3[i+15] = Ary1[i+10] * Ary2[i+-5]; cout << "Ary3 array Multiply output" << endl; cout << Ary3 << endl; cout << " "; for (i=0;i<14;i++) Ary3[i+15] = Ary2[i+-5]/Ary1[i+10]; cout << "Ary3 array Division output" << endl; cout << Ary3 << endl; cout << " ";
- 12. cout << "Test boundary conditions" << endl; Ary1[8] = 100; Ary1[16] = 200; i = 100; cout << Ary1[i] << endl; return 0; }