#include iostream using namespace std; class Array { priva.pdf
•
0 likes•0 views
#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.
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;
array = new int[m-n];
for (int i = 0; i < m-n; i++)](https://image.slidesharecdn.com/includeiostreamusingnamespacestdclassarraypriva-230408040717-2240c3b9/85/include-iostream-using-namespace-std-class-Array-priva-pdf-1-320.jpg)
![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;
}](data:image/gif;base64,R0lGODlhAQABAIAAAAAAAP///yH5BAEAAAAALAAAAAABAAEAAAIBRAA7)
Recommended
check the modifed code now you will get all operations done.termin.pdf
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.
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[.
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.
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.
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;
.
(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, .
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.
Recommended
check the modifed code now you will get all operations done.termin.pdf
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.
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[.
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.
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.
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;
.
(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, .
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.
Arrays matrix 2020 ab
Arrays
Structures of related data items
Static entity - same size throughout program
selected problems in matrix and array
Pointers and arrays
This provides complete explanation about pointers and arrays. It also explains how to use pointers to process multi dimensional arrays.
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
SP-First-Lecture.ppt
The document provides an introduction and overview of one-dimensional, two-dimensional, and three-dimensional arrays in C++. It includes syntax examples and sample programs to demonstrate declaring, initializing, accessing, and manipulating array elements. Key concepts covered include array data types, sizes, indexes, multidimensional arrays, passing arrays to functions, and using pointers with arrays. Sample programs sort arrays and find minimum/maximum elements to illustrate common array operations.
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,
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.
#include stdio.h #include stdlib.h #include time.hdouble.pdf
#include
#include
#include
double total(int array[], int n)
{
int i, sum =0;
for (i = 0; i < n; i++)
{
sum = sum + array[i];
}
return sum;
}
int main()
{
srand(time(NULL));
int i, n, rand_number;
printf(\"Enter an integer: \");
scanf(\"%d\",&n);
int array[n];
for (i = 0; i < n; i++)
{
rand_number = rand() % 1000;
array[i] = rand_number;
}
int max = array[0];
int min = array[0];
int min_pos;
int max_pos;
for (i = 0; i < n; i++)
{
if(array[i] > max)
{
max = array[i];
max_pos = i;
}
if(array[i] < min)
{
min = array[i];
min_pos = i;
}
}
int sum = total(array,n);
double average = sum/n;
printf(\"min: %d pos: %d\ \",min, min_pos);
printf(\"max: %d pos: %d\ \",max, max_pos);
printf(\"sum: %d \ \",sum);
printf(\"average: %lf \ \",average);
printf(\"Pos\\t|\\tval\ \");
printf(\"-----------------------\ \");
for (i = 0; i < n; ++i)
{
printf(\"%d\\t|\\t%d\ \",i,array[i]);
}
printf(\"\ \");
return 0;
}
/*
output:
Enter an integer: 30
min: 5 pos: 28
max: 998 pos: 0
sum: 14093
average: 469.000000
Pos | val
-----------------------
0 | 998
1 | 403
2 | 523
3 | 787
4 | 37
5 | 14
6 | 815
7 | 232
8 | 594
9 | 555
10 | 531
11 | 52
12 | 550
13 | 530
14 | 265
15 | 839
16 | 247
17 | 902
18 | 99
19 | 120
20 | 648
21 | 101
22 | 6
23 | 983
24 | 759
25 | 664
26 | 371
27 | 705
28 | 5
29 | 758
*/
Solution
#include
#include
#include
double total(int array[], int n)
{
int i, sum =0;
for (i = 0; i < n; i++)
{
sum = sum + array[i];
}
return sum;
}
int main()
{
srand(time(NULL));
int i, n, rand_number;
printf(\"Enter an integer: \");
scanf(\"%d\",&n);
int array[n];
for (i = 0; i < n; i++)
{
rand_number = rand() % 1000;
array[i] = rand_number;
}
int max = array[0];
int min = array[0];
int min_pos;
int max_pos;
for (i = 0; i < n; i++)
{
if(array[i] > max)
{
max = array[i];
max_pos = i;
}
if(array[i] < min)
{
min = array[i];
min_pos = i;
}
}
int sum = total(array,n);
double average = sum/n;
printf(\"min: %d pos: %d\ \",min, min_pos);
printf(\"max: %d pos: %d\ \",max, max_pos);
printf(\"sum: %d \ \",sum);
printf(\"average: %lf \ \",average);
printf(\"Pos\\t|\\tval\ \");
printf(\"-----------------------\ \");
for (i = 0; i < n; ++i)
{
printf(\"%d\\t|\\t%d\ \",i,array[i]);
}
printf(\"\ \");
return 0;
}
/*
output:
Enter an integer: 30
min: 5 pos: 28
max: 998 pos: 0
sum: 14093
average: 469.000000
Pos | val
-----------------------
0 | 998
1 | 403
2 | 523
3 | 787
4 | 37
5 | 14
6 | 815
7 | 232
8 | 594
9 | 555
10 | 531
11 | 52
12 | 550
13 | 530
14 | 265
15 | 839
16 | 247
17 | 902
18 | 99
19 | 120
20 | 648
21 | 101
22 | 6
23 | 983
24 | 759
25 | 664
26 | 371
27 | 705
28 | 5
29 | 758
*/.
#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] .
Data Structures Using C Practical File
Practical File For Data Structures In C Programming Language.
Arrays
Linked Lists
Stacks
Queues
Trees
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.
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.
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.
Sorting Technique
This document discusses and provides code examples for three sorting algorithms: insertion sort, selection sort, and quicksort. It includes pseudocode for insertion sort and describes its worst case performance on sample data. Selection sort code is shown along with an example of its worst case. Quicksort is briefly explained. Merge sort is also listed along with sample data being sorted.
10. array & pointer
The document discusses the relationship between arrays and pointers in C programming. It explains that arrays store a consecutive series of variables under a single name, and each element of the array has its own unique memory address. Pointers can be used to reference array elements, where the array name represents the base address of the array and pointer arithmetic allows accessing elements. It provides examples of declaring and initializing arrays, accessing elements using pointers, and how pointers can be incremented or decremented to traverse the array.
Ada file
The document contains 8 questions related to data structures and algorithms in C programming. Question 1 asks to write a program to search a number from a list using linear and binary search. Question 2 asks to write a program to search a number recursively using binary search. Question 3 asks to write a program to find the factorial of a number recursively and non-recursively and compare performance. The remaining questions ask to write programs for sorting, matrix multiplication using Strassen's algorithm, minimum spanning tree using Kruskal's algorithm, and other algorithms.
#include String.hpp#include ..Functionsfunctions.hpp.docx
#include "String.hpp"
#include "../Functions/functions.hpp"
// O(1)
String::String() {
// Allocate space.
array = new char[1];
// Add the null.
array[0] = '\0';
// Adjust private variables.
_capacity = 0;
_size = 0;
}
// O(1)
String::String(char c) {
// Allocate space.
array = new char[2];
// Add the character and the null.
array[0] = c;
array[1] = '\0';
// Adjust private variables.
_capacity = 1;
_size = 1;
}
// O(n)
String::String(char* str) {
// Get the length of the incoming string.
int length = 0;
while (str[length])
++length;
// Allocate space for the string plus a null.
array = new char[length + 1];
// Fill our array up, including the null.
for (int i = 0; i <= length; ++i)
array[i] = str[i];
// Adjust private variables.
_capacity = length;
_size = length;
}
// O(1)
String::~String() {
delete[] array;
}
// O(n)
char String::at(int index) const {
// If our index is negative, or beyond the size of our array, we cannot return
// anything.
return (index < 0 || (unsigned int)index >= size()) ? throw "Index"
: array[index];
}
void String::clear() {
for (unsigned int i = 0; i < _capacity; ++i)
array[i] = '\0';
_size = 0;
}
// O(n)
unsigned int String::size() const {
return _size;
}
// O(1)
bool String::empty() const {
return !this->array[0];
}
// O(1)
unsigned int String::capacity() const {
return this->_capacity;
}
// O(n)
void String::reserve(unsigned int n) {
if (!n)
return;
// Make a new array.
char* _array = new char[_capacity + n + 1]();
// Fill it up.
int length = this->size();
for (int i = 0; i <= length; ++i)
_array[i] = array[i];
// Remove old memory.
delete[] array;
// Save new memory.
array = _array;
// Adjust private variables.
_capacity += n;
return;
}
// O(n)
void String::insert(char c, int index) {
// Prepend and append as easy cases.
if (index <= 0)
prepend(c);
else if ((unsigned int)index >= size())
append(c);
else {
// Increase capacity, if needed.
if (this->size() == this->_capacity) {
this->reserve(this->size() * 2);
}
// Move all elements after index over.
for (int i = this->size() + 1; i >= index; --i)
array[i] = array[i - 1];
// Insert our new character.
array[index] = c;
_size++;
}
return;
}
// O(n)
void String::erase(char c) {
// Create a new array.
char* _array = new char[_capacity + 1];
// Copy all non-erased characters to the new array.
int length = size();
for (int i = 0, j = 0; i <= length; ++i) {
if (array[i] != c)
_array[j++] = array[i];
else
_size--;
}
// Remove the old array.
delete[] array;
array = _array;
return;
}
// O(n)
void String::remove(int index) {
// Copy all characters to the left, overwriting index.
int length = this->size();
for (int i = index; i < length; ++i)
array[i] = array[i + 1];
_ ...
Session 7 En
The document discusses various aspects of arrays in C programming including defining single and multi-dimensional arrays, initializing array elements, and using arrays to store strings and characters. It explains how to declare and initialize single and two-dimensional numeric and string arrays, access array elements, and demonstrates examples of inputting and sorting data in arrays. The document provides an overview of key concepts for understanding and working with different types of arrays as data structures in C.
Session 7 En
The document discusses various aspects of arrays in C programming including defining single and multi-dimensional arrays, initializing array elements, and how to handle arrays. It explains that arrays allow storing multiple values of the same data type and that each element has a unique index. Examples are provided to demonstrate defining, initializing, and accessing elements in single and two-dimensional character and integer arrays.
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.
unit-2-dsa.pptx
The document discusses arrays in C programming. It defines key concepts like array representation, index starting from 0, memory representation of arrays, and address calculation of array elements. It also covers various array operations like creation, copying, deletion, insertion, sorting, and representation of arrays as abstract data types. Multidimensional arrays and their row-major and column-major representations are explained along with examples.
yes, roasting essentially means heating the ore, .pdf
yes, roasting essentially means heating the ore, in excess of air, to a temperature
below the melting point of the metal. this expels moisture, and converts the impurities to oxides.
Solution
yes, roasting essentially means heating the ore, in excess of air, to a temperature
below the melting point of the metal. this expels moisture, and converts the impurities to oxides..
There is no figure,Please upload it .pdf
This document does not contain any text or figures to summarize. The document simply states "There is no figure,Please upload it" twice without providing any other context or information.
More Related Content
Similar to #include iostream using namespace std; class Array { priva.pdf
Arrays matrix 2020 ab
Arrays
Structures of related data items
Static entity - same size throughout program
selected problems in matrix and array
Pointers and arrays
This provides complete explanation about pointers and arrays. It also explains how to use pointers to process multi dimensional arrays.
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
SP-First-Lecture.ppt
The document provides an introduction and overview of one-dimensional, two-dimensional, and three-dimensional arrays in C++. It includes syntax examples and sample programs to demonstrate declaring, initializing, accessing, and manipulating array elements. Key concepts covered include array data types, sizes, indexes, multidimensional arrays, passing arrays to functions, and using pointers with arrays. Sample programs sort arrays and find minimum/maximum elements to illustrate common array operations.
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,
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.
#include stdio.h #include stdlib.h #include time.hdouble.pdf
#include
#include
#include
double total(int array[], int n)
{
int i, sum =0;
for (i = 0; i < n; i++)
{
sum = sum + array[i];
}
return sum;
}
int main()
{
srand(time(NULL));
int i, n, rand_number;
printf(\"Enter an integer: \");
scanf(\"%d\",&n);
int array[n];
for (i = 0; i < n; i++)
{
rand_number = rand() % 1000;
array[i] = rand_number;
}
int max = array[0];
int min = array[0];
int min_pos;
int max_pos;
for (i = 0; i < n; i++)
{
if(array[i] > max)
{
max = array[i];
max_pos = i;
}
if(array[i] < min)
{
min = array[i];
min_pos = i;
}
}
int sum = total(array,n);
double average = sum/n;
printf(\"min: %d pos: %d\ \",min, min_pos);
printf(\"max: %d pos: %d\ \",max, max_pos);
printf(\"sum: %d \ \",sum);
printf(\"average: %lf \ \",average);
printf(\"Pos\\t|\\tval\ \");
printf(\"-----------------------\ \");
for (i = 0; i < n; ++i)
{
printf(\"%d\\t|\\t%d\ \",i,array[i]);
}
printf(\"\ \");
return 0;
}
/*
output:
Enter an integer: 30
min: 5 pos: 28
max: 998 pos: 0
sum: 14093
average: 469.000000
Pos | val
-----------------------
0 | 998
1 | 403
2 | 523
3 | 787
4 | 37
5 | 14
6 | 815
7 | 232
8 | 594
9 | 555
10 | 531
11 | 52
12 | 550
13 | 530
14 | 265
15 | 839
16 | 247
17 | 902
18 | 99
19 | 120
20 | 648
21 | 101
22 | 6
23 | 983
24 | 759
25 | 664
26 | 371
27 | 705
28 | 5
29 | 758
*/
Solution
#include
#include
#include
double total(int array[], int n)
{
int i, sum =0;
for (i = 0; i < n; i++)
{
sum = sum + array[i];
}
return sum;
}
int main()
{
srand(time(NULL));
int i, n, rand_number;
printf(\"Enter an integer: \");
scanf(\"%d\",&n);
int array[n];
for (i = 0; i < n; i++)
{
rand_number = rand() % 1000;
array[i] = rand_number;
}
int max = array[0];
int min = array[0];
int min_pos;
int max_pos;
for (i = 0; i < n; i++)
{
if(array[i] > max)
{
max = array[i];
max_pos = i;
}
if(array[i] < min)
{
min = array[i];
min_pos = i;
}
}
int sum = total(array,n);
double average = sum/n;
printf(\"min: %d pos: %d\ \",min, min_pos);
printf(\"max: %d pos: %d\ \",max, max_pos);
printf(\"sum: %d \ \",sum);
printf(\"average: %lf \ \",average);
printf(\"Pos\\t|\\tval\ \");
printf(\"-----------------------\ \");
for (i = 0; i < n; ++i)
{
printf(\"%d\\t|\\t%d\ \",i,array[i]);
}
printf(\"\ \");
return 0;
}
/*
output:
Enter an integer: 30
min: 5 pos: 28
max: 998 pos: 0
sum: 14093
average: 469.000000
Pos | val
-----------------------
0 | 998
1 | 403
2 | 523
3 | 787
4 | 37
5 | 14
6 | 815
7 | 232
8 | 594
9 | 555
10 | 531
11 | 52
12 | 550
13 | 530
14 | 265
15 | 839
16 | 247
17 | 902
18 | 99
19 | 120
20 | 648
21 | 101
22 | 6
23 | 983
24 | 759
25 | 664
26 | 371
27 | 705
28 | 5
29 | 758
*/.
#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] .
Data Structures Using C Practical File
Practical File For Data Structures In C Programming Language.
Arrays
Linked Lists
Stacks
Queues
Trees
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.
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.
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.
Sorting Technique
This document discusses and provides code examples for three sorting algorithms: insertion sort, selection sort, and quicksort. It includes pseudocode for insertion sort and describes its worst case performance on sample data. Selection sort code is shown along with an example of its worst case. Quicksort is briefly explained. Merge sort is also listed along with sample data being sorted.
10. array & pointer
The document discusses the relationship between arrays and pointers in C programming. It explains that arrays store a consecutive series of variables under a single name, and each element of the array has its own unique memory address. Pointers can be used to reference array elements, where the array name represents the base address of the array and pointer arithmetic allows accessing elements. It provides examples of declaring and initializing arrays, accessing elements using pointers, and how pointers can be incremented or decremented to traverse the array.
Ada file
The document contains 8 questions related to data structures and algorithms in C programming. Question 1 asks to write a program to search a number from a list using linear and binary search. Question 2 asks to write a program to search a number recursively using binary search. Question 3 asks to write a program to find the factorial of a number recursively and non-recursively and compare performance. The remaining questions ask to write programs for sorting, matrix multiplication using Strassen's algorithm, minimum spanning tree using Kruskal's algorithm, and other algorithms.
#include String.hpp#include ..Functionsfunctions.hpp.docx
#include "String.hpp"
#include "../Functions/functions.hpp"
// O(1)
String::String() {
// Allocate space.
array = new char[1];
// Add the null.
array[0] = '\0';
// Adjust private variables.
_capacity = 0;
_size = 0;
}
// O(1)
String::String(char c) {
// Allocate space.
array = new char[2];
// Add the character and the null.
array[0] = c;
array[1] = '\0';
// Adjust private variables.
_capacity = 1;
_size = 1;
}
// O(n)
String::String(char* str) {
// Get the length of the incoming string.
int length = 0;
while (str[length])
++length;
// Allocate space for the string plus a null.
array = new char[length + 1];
// Fill our array up, including the null.
for (int i = 0; i <= length; ++i)
array[i] = str[i];
// Adjust private variables.
_capacity = length;
_size = length;
}
// O(1)
String::~String() {
delete[] array;
}
// O(n)
char String::at(int index) const {
// If our index is negative, or beyond the size of our array, we cannot return
// anything.
return (index < 0 || (unsigned int)index >= size()) ? throw "Index"
: array[index];
}
void String::clear() {
for (unsigned int i = 0; i < _capacity; ++i)
array[i] = '\0';
_size = 0;
}
// O(n)
unsigned int String::size() const {
return _size;
}
// O(1)
bool String::empty() const {
return !this->array[0];
}
// O(1)
unsigned int String::capacity() const {
return this->_capacity;
}
// O(n)
void String::reserve(unsigned int n) {
if (!n)
return;
// Make a new array.
char* _array = new char[_capacity + n + 1]();
// Fill it up.
int length = this->size();
for (int i = 0; i <= length; ++i)
_array[i] = array[i];
// Remove old memory.
delete[] array;
// Save new memory.
array = _array;
// Adjust private variables.
_capacity += n;
return;
}
// O(n)
void String::insert(char c, int index) {
// Prepend and append as easy cases.
if (index <= 0)
prepend(c);
else if ((unsigned int)index >= size())
append(c);
else {
// Increase capacity, if needed.
if (this->size() == this->_capacity) {
this->reserve(this->size() * 2);
}
// Move all elements after index over.
for (int i = this->size() + 1; i >= index; --i)
array[i] = array[i - 1];
// Insert our new character.
array[index] = c;
_size++;
}
return;
}
// O(n)
void String::erase(char c) {
// Create a new array.
char* _array = new char[_capacity + 1];
// Copy all non-erased characters to the new array.
int length = size();
for (int i = 0, j = 0; i <= length; ++i) {
if (array[i] != c)
_array[j++] = array[i];
else
_size--;
}
// Remove the old array.
delete[] array;
array = _array;
return;
}
// O(n)
void String::remove(int index) {
// Copy all characters to the left, overwriting index.
int length = this->size();
for (int i = index; i < length; ++i)
array[i] = array[i + 1];
_ ...
Session 7 En
The document discusses various aspects of arrays in C programming including defining single and multi-dimensional arrays, initializing array elements, and using arrays to store strings and characters. It explains how to declare and initialize single and two-dimensional numeric and string arrays, access array elements, and demonstrates examples of inputting and sorting data in arrays. The document provides an overview of key concepts for understanding and working with different types of arrays as data structures in C.
Session 7 En
The document discusses various aspects of arrays in C programming including defining single and multi-dimensional arrays, initializing array elements, and how to handle arrays. It explains that arrays allow storing multiple values of the same data type and that each element has a unique index. Examples are provided to demonstrate defining, initializing, and accessing elements in single and two-dimensional character and integer arrays.
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.
unit-2-dsa.pptx
The document discusses arrays in C programming. It defines key concepts like array representation, index starting from 0, memory representation of arrays, and address calculation of array elements. It also covers various array operations like creation, copying, deletion, insertion, sorting, and representation of arrays as abstract data types. Multidimensional arrays and their row-major and column-major representations are explained along with examples.
Similar to #include iostream using namespace std; class Array { priva.pdf (20)
#include stdio.h #include stdlib.h #include time.hdouble.pdf
#include stdio.h #include stdlib.h #include time.hdouble.pdf
#include stdio.h#include stdlib.h#include string.h#inclu.pdf
#include stdio.h#include stdlib.h#include string.h#inclu.pdf
Object oriented programming; operator overloading array
Object oriented programming; operator overloading array
#include String.hpp#include ..Functionsfunctions.hpp.docx
#include String.hpp#include ..Functionsfunctions.hpp.docx
More from ANSAPPARELS
yes, roasting essentially means heating the ore, .pdf
yes, roasting essentially means heating the ore, in excess of air, to a temperature
below the melting point of the metal. this expels moisture, and converts the impurities to oxides.
Solution
yes, roasting essentially means heating the ore, in excess of air, to a temperature
below the melting point of the metal. this expels moisture, and converts the impurities to oxides..
There is no figure,Please upload it .pdf
This document does not contain any text or figures to summarize. The document simply states "There is no figure,Please upload it" twice without providing any other context or information.
The adition is slow because the benzyne formed is.pdf
The adition is slow because the benzyne formed is unstable, so itcould react with
the reagent and form other species. The driving force of the reaction is the formation of
stableproducts (N2 and CO2), but you are right,benzyne is so unstable that it can react with the
solvent oranother compound present in the medium.
Solution
The adition is slow because the benzyne formed is unstable, so itcould react with
the reagent and form other species. The driving force of the reaction is the formation of
stableproducts (N2 and CO2), but you are right,benzyne is so unstable that it can react with the
solvent oranother compound present in the medium..
only 1(I) .pdf
This very short document contains a single line of text that reads "only 1(I)". It does not provide much context or information to summarize in 3 sentences or less.
Yes, I do agree, that some eukaryotic cells survive only on the reso.pdf
Yes, I do agree, that some eukaryotic cells survive only on the resources provided by other
eukaryotic cells and that prokaryotic cells are not involved in this type of \"supply for life\".
Symbiotic root colonization by Eukaryotic cells by Mycorrhizal mycelia:
Mycorrhizal mycelia can only survive in a symbiotic relationship with other plant root \"cells
(eukaryotic)\" by supplying nitrogen materials to the plants followed by obtaining its nutrients
for survival. Mycorrhizal mycelia cannot survive outside the environment as prokaryotes do
The traits that allowed them to maintain symbiotic relationships are as explained in case of fungi,
in which hydrolytic enzymes have capability to assimilate \"nitrogenous material and supply\"
them to plants. The relative number of competitors, the relative availability of symbiotic partners
such as Mycorrhizal mycelia are living on the roots surface of the host plant as mutualistic
symbionts (supply of life) and enabling the host root colonization of land plants with increased
absorption of nutrients such as phosphates, nitrates, water etc. by providing the surface area for
absorption.
Fungi and plant symbiosis represents one of the most important interspecific eukaryotic
partnerships to have occurred on the planet. Fungal mycelia and ancient archaic prokaryotes are
living on the roots surface of the host land plants as mutualistic symbionts in 500 millions of
years ago and enabling the host root colonization with increased abruption of nutrients such as
phosphates, nitrates, water etc. by providing the surface area for absorption. This process
produced a vital photosynthesis rate by increasing total gross primary productivity finally
enhancing the release of exclusive amounts of oxygen in the atmosphere result in higher oxygen
concentration together to form ozone layer to protect against harmful UV radiation. The oxygen
gas is conductive to air-breathing animals on the land whereas dissolved oxygen is conductive to
all aquatic animals. These land plants with differential reproductive ability to produce
gametophytes enabled their sexual reproduction (embryophytes, all vascular plants including
angiosperms and gymnosperms) to produce more progeny to generate higher rate of
photosynthesis associated with increased rate of colonization to produce oxygen gas to air-
breathing animals.
The traits that allowed them to maintain symbiotic relationships are as explained in case of fungi,
in which hydrolytic enzymes have capability to assimilate \"nitrogenous material and supply\"
them to plants.
The altitudinal increase of root-to-shoot (C/N) ratio is meticulously due to low nutrient
availability. This is because of “low Michorrizha availability for symbiotic relationship” to
supply nutrient as elevated altitudes lowered temperatures. Therefore, low temperature and low
soil microbial decomposition with organic matter with water logging & low nitrogen availability
make the plants to increase their C/N ratio as an ev.
What are the key components of an internal audit What are the impli.pdf
What are the key components of an internal audit? What are the implications of having a
thorough understanding of each? Using your firm (or a firm that you familiar with), select a
significant company resource (such as engineering capability, or supply chain, or customer
service) and apply the Four Tests of a Resources Compeititve Power and determine if provides a
sustainable competitive advantage. Support your input.
Answer:
Key Components & Implications of Internal Audit:
Components:
Implications:
Establish and communicate the scope and objectives for the audit to appropriate management.
Developing an understanding of the business area under review. This includes objectives,
measurements, and key transaction types. This involves review of documents and interviews.
Flowcharts and narratives may be created if necessary.
So that we can concentrate on the key business activities which are having in Risk of Fraud or
Misappropriation.
Identify management practices in the five components of control used to ensure each key risk is
properly controlled and monitored. Internal Audit check can be a helpful tool to identify
common risks and desired controls in the specific process or industry being audited.
Develop and execute a risk-based sampling and testing approach to determine whether the most
important management controls are operating as intended.
Report issues and challenges identified and negotiate action plans with management to address
the problems.
Regular follow-up on reported findings at appropriate intervals. Internal audit departments
maintain a follow-up database for this purpose.
Solution
What are the key components of an internal audit? What are the implications of having a
thorough understanding of each? Using your firm (or a firm that you familiar with), select a
significant company resource (such as engineering capability, or supply chain, or customer
service) and apply the Four Tests of a Resources Compeititve Power and determine if provides a
sustainable competitive advantage. Support your input.
Answer:
Key Components & Implications of Internal Audit:
Components:
Implications:
Establish and communicate the scope and objectives for the audit to appropriate management.
Developing an understanding of the business area under review. This includes objectives,
measurements, and key transaction types. This involves review of documents and interviews.
Flowcharts and narratives may be created if necessary.
So that we can concentrate on the key business activities which are having in Risk of Fraud or
Misappropriation.
Identify management practices in the five components of control used to ensure each key risk is
properly controlled and monitored. Internal Audit check can be a helpful tool to identify
common risks and desired controls in the specific process or industry being audited.
Develop and execute a risk-based sampling and testing approach to determine whether the most
important management controls are operating as intended.
Report .
IV I II III Solution .pdf
The document contains an inequality comparing the Roman numerals I, II, III, and IV. It states that Roman numeral IV is less than I, which is less than II, which is less than III.
To differentiate between the mutated and normal genes, the DNA of th.pdf
To differentiate between the mutated and normal genes, the DNA of the person is isolated and
amplified by the PCR (polymerase chain reaction). This genome is subjected to the DNA
microarrays, i.e. DNA microchips that contain the single strand sequences of normal genes
including the sequences of its possible mutations.
The DNA is cut into small fragments and these fragments are labelled with different fluorescent
dyes (the sample from the patient and the normal DNA sample). Both the DNA are allowed to
hybridize and bind to the single strands of the DNA chip. The difference in the percent
hybridization indicates the presence of mutations. if the person does not have any mutations,
both the samples hybridize equivalents and produce the same fluorescence.
Thus, if the person has the retinoblastoma mutant gene, two different fluorescences will appear,
indicating the hybridizations of the mutant and the normal genes whereas an unaffected person
produces unifom fluorescence.
Solution
To differentiate between the mutated and normal genes, the DNA of the person is isolated and
amplified by the PCR (polymerase chain reaction). This genome is subjected to the DNA
microarrays, i.e. DNA microchips that contain the single strand sequences of normal genes
including the sequences of its possible mutations.
The DNA is cut into small fragments and these fragments are labelled with different fluorescent
dyes (the sample from the patient and the normal DNA sample). Both the DNA are allowed to
hybridize and bind to the single strands of the DNA chip. The difference in the percent
hybridization indicates the presence of mutations. if the person does not have any mutations,
both the samples hybridize equivalents and produce the same fluorescence.
Thus, if the person has the retinoblastoma mutant gene, two different fluorescences will appear,
indicating the hybridizations of the mutant and the normal genes whereas an unaffected person
produces unifom fluorescence..
The most critical shortcomings of these assumptions are1.The flow .pdf
The most critical shortcomings of these assumptions are
1.The flow of water is considered to be one dimensional but in reality it is three dimensional.
2.Darcy\'s law does not seem to hold good at high hydraulic gradients.
Solution
The most critical shortcomings of these assumptions are
1.The flow of water is considered to be one dimensional but in reality it is three dimensional.
2.Darcy\'s law does not seem to hold good at high hydraulic gradients..
The following statements are true1. The tendency of water to mini.pdf
The following statements are true:
1. The tendency of water to minimize it\'s interaction with non-polar substances is known as
hydrophobic effect. ( in hydrophobic, hydro refers to water and phobic refers to fear. )
2.Hydrophobic molecules donot dissolve in water due to lack of Hydrogen bonding between it\'s
molecules and water molecules.
3. Amphipathic substances are the structural basis of biological bilayer membranes. ( Ex. Animal
Cellwalls)
Solution
The following statements are true:
1. The tendency of water to minimize it\'s interaction with non-polar substances is known as
hydrophobic effect. ( in hydrophobic, hydro refers to water and phobic refers to fear. )
2.Hydrophobic molecules donot dissolve in water due to lack of Hydrogen bonding between it\'s
molecules and water molecules.
3. Amphipathic substances are the structural basis of biological bilayer membranes. ( Ex. Animal
Cellwalls).
The data is Quantitative as there are numbers , and its an observati.pdf
The data is Quantitative as there are numbers , and its an observational study, where they studies
about the H.pylori in the cause of ulceration.
2. From table -II, we see that among the 22 patients having Ulcer, 18 have infection of H.pylori.
Out of 16, 8 were with infection.
Gastritis and Duodenitis.
Out of 22, 18 patients with gastric ulcers had bacteria, and four had both the ulcers, and all were
Helicobacter positive. With gastric ulcer 77% had bacteria, and with duodenal ulcer 100% had
bacteria. 4 patients with ulcers became negative for bacteria is significant as they had taken
NSAIS drugs which are known to cause ulcers.
Although gastric colonization with H.pylori, induces histologic gastritis in all infected
individuals, only a small portion of them develop any significant sign and symptom for this
colonization. It sestimated that H. pylori, infected patients have a 10-20% lifetime risk of
developing ulcer disease. The risk of development of these diseases in the presence of H.pylori,
depends on a variety of bacteria, host, and environmental factors, that relate to the pattern and
severity of gastritis. Thus a patient can show normal examination.
Solution
The data is Quantitative as there are numbers , and its an observational study, where they studies
about the H.pylori in the cause of ulceration.
2. From table -II, we see that among the 22 patients having Ulcer, 18 have infection of H.pylori.
Out of 16, 8 were with infection.
Gastritis and Duodenitis.
Out of 22, 18 patients with gastric ulcers had bacteria, and four had both the ulcers, and all were
Helicobacter positive. With gastric ulcer 77% had bacteria, and with duodenal ulcer 100% had
bacteria. 4 patients with ulcers became negative for bacteria is significant as they had taken
NSAIS drugs which are known to cause ulcers.
Although gastric colonization with H.pylori, induces histologic gastritis in all infected
individuals, only a small portion of them develop any significant sign and symptom for this
colonization. It sestimated that H. pylori, infected patients have a 10-20% lifetime risk of
developing ulcer disease. The risk of development of these diseases in the presence of H.pylori,
depends on a variety of bacteria, host, and environmental factors, that relate to the pattern and
severity of gastritis. Thus a patient can show normal examination..
Thank you everyone! The answer was O(n!)SolutionThank you ever.pdf
The document thanks everyone and states that the answer to the previous problem or question was O(n!), which refers to Big O notation describing an algorithm's time complexity as being factorial or exponential in relation to the size of the input.
Solution1 ) The purpose of criminal law is to help maintain social.pdf
Solution
1 ) The purpose of criminal law is to help maintain social order and stability . The purpose of
criminal law is to establish a system of prohibitions , penalties and correctional measures to deal
with conduct that unjustifiably or inexcusably causes or threatens harm to those individual or
public interests for which state protection is appropriate .
2) Classification according to the nature of crimes
Mala in se : These are acts that are immoral or wrong in themselves or acts that are naturally evil
. Ex : Murder, rape , arson , burglary etc
Mala prohibita : These crimes are not naturally evil , but are prohibited by statute because they
infringe upon the right of the others . This type of act is not wrong in some societies but wrong in
other societies . Example : Traffic offenses , gambling etc .
Classification according to degree :
a) Felonies : Crimes that are punishable by death or imprisonment in a state prision or
penitentiary are felonies .
b) Misdemeanors : Crimes or offenses not amounting to felonies are Misdemeanors . They are
offenses for which the punishment is other than death or imprisonment in a state prison , or that
have not been designated felonies by statute.
c) Treason : Treason is the only crime described in the constitution and it is given a higher
classification than felony .
3) Example of white-collar crimes are bank fraud, blackmail , bribery , computer fraud,
counterfeiting , credit card fraud , currency schemes, embezzelement , environmental schemes .
The punishment for these crimes should be recovery of all the money made by white collar
crimes and to put the white collar criminals in prision ..
question not visibleSolutionquestion not visible.pdf
This document discusses a solution to an unseen question. It proposes addressing the issue by taking multiple steps to resolve the problem. These steps are not detailed, but the overall approach is to methodically work through the problem by breaking it down into components and addressing each part.
num.txt(Save this file under D Drive.Then the path of the file is D.pdf
num.txt(Save this file under D Drive.Then the path of the file is D:\\\ um.txt)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
CPP Code
#include
#include
using namespace std;
//Declaring Global variable
int sum=0;
//Function declarations
void readFromFile();
void writeToFile();
/* Function implementation which will
* read the numbers from the file and calculates the sum of
* the numbers which are multiples of 2 or 5
*/
void readFromFile()
{
int number,sum=0;
//fileInput reference
ifstream dataIn;
//Opening input file
dataIn.open(\"D:\\\ um.txt\");
while(dataIn>>number)
{
if(number%2==0 || number%5==0)
{
sum+=number;
}
}
//closing the input stream
dataIn.close();
}
/* Function implementation which will
* display the sum into another text file
*/
void writeToFile()
{
//fileoutput reference
ofstream myfile;
//Opening the file
myfile.open (\"D:\\\ um1.txt\");
//Writing the contents to the file
myfile <<\"The Sum of Multiples of 2 or 5 is :\"<
Solution
num.txt(Save this file under D Drive.Then the path of the file is D:\\\ um.txt)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
CPP Code
#include
#include
using namespace std;
//Declaring Global variable
int sum=0;
//Function declarations
void readFromFile();
void writeToFile();
/* Function implementation which will
* read the numbers from the file and calculates the sum of
* the numbers which are multiples of 2 or 5
*/
void readFromFile()
{
int number,sum=0;
//fileInput reference
ifstream dataIn;
//Opening input file
dataIn.open(\"D:\\\ um.txt\");
while(dataIn>>number)
{
if(number%2==0 || number%5==0)
{
sum+=number;
}
}
//closing the input stream
dataIn.close();
}
/* Function implementation which will
* display the sum into another text file
*/
void writeToFile()
{
//fileoutput reference
ofstream myfile;
//Opening the file
myfile.open (\"D:\\\ um1.txt\");
//Writing the contents to the file
myfile <<\"The Sum of Multiples of 2 or 5 is :\"<.
n = 7 which is odd so median is the middle value of te data after ar.pdf
n = 7 which is odd so median is the middle value of te data after arranging in ascending order.
1,1,2,4,5,6,7
median = (7+1)/2 th observation = 4th observation = 4
So median of the data is 4.
Solution
n = 7 which is odd so median is the middle value of te data after arranging in ascending order.
1,1,2,4,5,6,7
median = (7+1)/2 th observation = 4th observation = 4
So median of the data is 4..
Molybdenum is the elementSolutionMolybdenum is the element.pdf
Molybdenum is a chemical element. The document provides no other details about molybdenum or its properties.
Mean absolute deviationSolutionMean absolute deviation.pdf
Mean absolute deviation is a measure of variability that calculates the average distance between each data point and the mean. It is calculated by taking the average of the absolute deviations of each data point from the mean. Mean absolute deviation provides an alternative to standard deviation that is not as sensitive to outliers in the data.
elements involved are C and N .pdf
This document discusses a solution that involves the elements of carbon and nitrogen. Specifically, the document states that the elements involved are C and N.
Information security means protecting information (data) and informa.pdf
Information security means protecting information (data) and information systems from
unauthorized access, use, disclosure, disruption, modification, or destruction.
Information Security management is a process of defining the security controls in order to
protect the information assets.
Security Program[edit]
The first action of a management program to implement information security is to have a
security program in place. Though some argue the first act would be to gain some real \"proof of
concept\" and \"explainable thru display on the monitor screen\" security knowledge. Start with
maybe understanding where OS passwords are stored within the code inside a file within a
directory. If you don\'t understand Operating Systems at the root directory level maybe you
should seek out advice from somebody who does before even beginning to implement security
program management and objectives.
Security Program Objectives
Security Management Responsibilities
Approaches to Build a Security Program
Since advancement is directly tied to how well you can convince others, who often fall outside of
your of job duties and department, as to your higher value to the company as stated by your own
effective written communication this leads to amazing resume writers and take no blame style of
email responses that seems to definitely lead to the eventual failure of company\'s standards and
actual knowledge. It is often covered up by relationships which form at the power levels within
any group of people and those who are considered so-called experts having no real idea what is
really involved under the hood of the reports/applications they use and no proof presented in
emails written when self declared claims of their expertise is made or blame is to be put on
another.
Security Controls[edit]
Security Controls can be classified into three categories
Administrative Controls which include
Technical or Logical Controls which include
Physical Controls which include
The Elements of Security[edit]
Vulnerability
Threat
Risk
Exposure
Countermeasure or Safeguard
The Relation Between the Security Elements
Core Information Security Principles[edit]
The three fundamental principles of security are availability, integrity, and confidentiality and
are commonly referred to as CIA or AIC triad which also form the main objective of any security
program.
The level of security required to accomplish these principles differs per company, because each
has its own unique combination of business and security goals and requirements.
All security controls, mechanisms, and safeguards are implemented to provide one or more of
these principles.
All risks, threats, and vulnerabilities are measured for their potential capability to compromise
one or all of the AIC principles
Confidentiality[edit]
Integrity[edit]
Availability[edit]
Information Security Management Governance[edit]
Security Governance[edit]
Governance is the set of responsibilities and practices exercised by the board and executi.
More from ANSAPPARELS (20)
yes, roasting essentially means heating the ore, .pdf
yes, roasting essentially means heating the ore, .pdf
The adition is slow because the benzyne formed is.pdf
The adition is slow because the benzyne formed is.pdf
Yes, I do agree, that some eukaryotic cells survive only on the reso.pdf
Yes, I do agree, that some eukaryotic cells survive only on the reso.pdf
What are the key components of an internal audit What are the impli.pdf
What are the key components of an internal audit What are the impli.pdf
To differentiate between the mutated and normal genes, the DNA of th.pdf
To differentiate between the mutated and normal genes, the DNA of th.pdf
The most critical shortcomings of these assumptions are1.The flow .pdf
The most critical shortcomings of these assumptions are1.The flow .pdf
The following statements are true1. The tendency of water to mini.pdf
The following statements are true1. The tendency of water to mini.pdf
The data is Quantitative as there are numbers , and its an observati.pdf
The data is Quantitative as there are numbers , and its an observati.pdf
Thank you everyone! The answer was O(n!)SolutionThank you ever.pdf
Thank you everyone! The answer was O(n!)SolutionThank you ever.pdf
Solution1 ) The purpose of criminal law is to help maintain social.pdf
Solution1 ) The purpose of criminal law is to help maintain social.pdf
question not visibleSolutionquestion not visible.pdf
question not visibleSolutionquestion not visible.pdf
num.txt(Save this file under D Drive.Then the path of the file is D.pdf
num.txt(Save this file under D Drive.Then the path of the file is D.pdf
n = 7 which is odd so median is the middle value of te data after ar.pdf
n = 7 which is odd so median is the middle value of te data after ar.pdf
Molybdenum is the elementSolutionMolybdenum is the element.pdf
Molybdenum is the elementSolutionMolybdenum is the element.pdf
Mean absolute deviationSolutionMean absolute deviation.pdf
Mean absolute deviationSolutionMean absolute deviation.pdf
Information security means protecting information (data) and informa.pdf
Information security means protecting information (data) and informa.pdf
Recently uploaded
Benner "Expanding Pathways to Publishing Careers"
This presentation was provided by Rebecca Benner, Ph.D., of the American Society of Anesthesiologists, for the second session of NISO's 2024 Training Series "DEIA in the Scholarly Landscape." Session Two: 'Expanding Pathways to Publishing Careers,' was held June 13, 2024.
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/y977uz6bpd3af4qsebv7r9b7s21935vdJemison, MacLaughlin, and Majumder "Broadening Pathways for Editors and Authors"
Jemison, MacLaughlin, and Majumder "Broadening Pathways for Editors and Authors"National Information Standards Organization (NISO)
This presentation was provided by Racquel Jemison, Ph.D., Christina MacLaughlin, Ph.D., and Paulomi Majumder. Ph.D., all of the American Chemical Society, for the second session of NISO's 2024 Training Series "DEIA in the Scholarly Landscape." Session Two: 'Expanding Pathways to Publishing Careers,' was held June 13, 2024.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
ISO/IEC 27001, ISO/IEC 42001, and GDPR: Best Practices for Implementation and...
Denis is a dynamic and results-driven Chief Information Officer (CIO) with a distinguished career spanning information systems analysis and technical project management. With a proven track record of spearheading the design and delivery of cutting-edge Information Management solutions, he has consistently elevated business operations, streamlined reporting functions, and maximized process efficiency.
Certified as an ISO/IEC 27001: Information Security Management Systems (ISMS) Lead Implementer, Data Protection Officer, and Cyber Risks Analyst, Denis brings a heightened focus on data security, privacy, and cyber resilience to every endeavor.
His expertise extends across a diverse spectrum of reporting, database, and web development applications, underpinned by an exceptional grasp of data storage and virtualization technologies. His proficiency in application testing, database administration, and data cleansing ensures seamless execution of complex projects.
What sets Denis apart is his comprehensive understanding of Business and Systems Analysis technologies, honed through involvement in all phases of the Software Development Lifecycle (SDLC). From meticulous requirements gathering to precise analysis, innovative design, rigorous development, thorough testing, and successful implementation, he has consistently delivered exceptional results.
Throughout his career, he has taken on multifaceted roles, from leading technical project management teams to owning solutions that drive operational excellence. His conscientious and proactive approach is unwavering, whether he is working independently or collaboratively within a team. His ability to connect with colleagues on a personal level underscores his commitment to fostering a harmonious and productive workplace environment.
Date: May 29, 2024
Tags: Information Security, ISO/IEC 27001, ISO/IEC 42001, Artificial Intelligence, GDPR
-------------------------------------------------------------------------------
Find out more about ISO training and certification services
Training: ISO/IEC 27001 Information Security Management System - EN | PECB
ISO/IEC 42001 Artificial Intelligence Management System - EN | PECB
General Data Protection Regulation (GDPR) - Training Courses - EN | PECB
Webinars: https://pecb.com/webinars
Article: https://pecb.com/article
-------------------------------------------------------------------------------
For more information about PECB:
Website: https://pecb.com/
LinkedIn: https://www.linkedin.com/company/pecb/
Facebook: https://www.facebook.com/PECBInternational/
Slideshare: http://www.slideshare.net/PECBCERTIFICATION
How to Setup Warehouse & Location in Odoo 17 Inventory
In this slide, we'll explore how to set up warehouses and locations in Odoo 17 Inventory. This will help us manage our stock effectively, track inventory levels, and streamline warehouse operations.
Chapter wise All Notes of First year Basic Civil Engineering.pptx
Chapter wise All Notes of First year Basic Civil Engineering
Syllabus
Chapter-1
Introduction to objective, scope and outcome the subject
Chapter 2
Introduction: Scope and Specialization of Civil Engineering, Role of civil Engineer in Society, Impact of infrastructural development on economy of country.
Chapter 3
Surveying: Object Principles & Types of Surveying; Site Plans, Plans & Maps; Scales & Unit of different Measurements.
Linear Measurements: Instruments used. Linear Measurement by Tape, Ranging out Survey Lines and overcoming Obstructions; Measurements on sloping ground; Tape corrections, conventional symbols. Angular Measurements: Instruments used; Introduction to Compass Surveying, Bearings and Longitude & Latitude of a Line, Introduction to total station.
Levelling: Instrument used Object of levelling, Methods of levelling in brief, and Contour maps.
Chapter 4
Buildings: Selection of site for Buildings, Layout of Building Plan, Types of buildings, Plinth area, carpet area, floor space index, Introduction to building byelaws, concept of sun light & ventilation. Components of Buildings & their functions, Basic concept of R.C.C., Introduction to types of foundation
Chapter 5
Transportation: Introduction to Transportation Engineering; Traffic and Road Safety: Types and Characteristics of Various Modes of Transportation; Various Road Traffic Signs, Causes of Accidents and Road Safety Measures.
Chapter 6
Environmental Engineering: Environmental Pollution, Environmental Acts and Regulations, Functional Concepts of Ecology, Basics of Species, Biodiversity, Ecosystem, Hydrological Cycle; Chemical Cycles: Carbon, Nitrogen & Phosphorus; Energy Flow in Ecosystems.
Water Pollution: Water Quality standards, Introduction to Treatment & Disposal of Waste Water. Reuse and Saving of Water, Rain Water Harvesting. Solid Waste Management: Classification of Solid Waste, Collection, Transportation and Disposal of Solid. Recycling of Solid Waste: Energy Recovery, Sanitary Landfill, On-Site Sanitation. Air & Noise Pollution: Primary and Secondary air pollutants, Harmful effects of Air Pollution, Control of Air Pollution. . Noise Pollution Harmful Effects of noise pollution, control of noise pollution, Global warming & Climate Change, Ozone depletion, Greenhouse effect
Text Books:
1. Palancharmy, Basic Civil Engineering, McGraw Hill publishers.
2. Satheesh Gopi, Basic Civil Engineering, Pearson Publishers.
3. Ketki Rangwala Dalal, Essentials of Civil Engineering, Charotar Publishing House.
4. BCP, Surveying volume 1
BÀI TẬP DẠY THÊM TIẾNG ANH LỚP 7 CẢ NĂM FRIENDS PLUS SÁCH CHÂN TRỜI SÁNG TẠO ...
BÀI TẬP DẠY THÊM TIẾNG ANH LỚP 7 CẢ NĂM FRIENDS PLUS SÁCH CHÂN TRỜI SÁNG TẠO ...Nguyen Thanh Tu Collection
https://app.box.com/s/qhtvq32h4ybf9t49ku85x0n3xl4jhr15Level 3 NCEA - NZ: A Nation In the Making 1872 - 1900 SML.ppt
The History of NZ 1870-1900.
Making of a Nation.
From the NZ Wars to Liberals,
Richard Seddon, George Grey,
Social Laboratory, New Zealand,
Confiscations, Kotahitanga, Kingitanga, Parliament, Suffrage, Repudiation, Economic Change, Agriculture, Gold Mining, Timber, Flax, Sheep, Dairying,
How to Make a Field Mandatory in Odoo 17
In Odoo, making a field required can be done through both Python code and XML views. When you set the required attribute to True in Python code, it makes the field required across all views where it's used. Conversely, when you set the required attribute in XML views, it makes the field required only in the context of that particular view.
HYPERTENSION - SLIDE SHARE PRESENTATION.
IT WILL BE HELPFULL FOR THE NUSING STUDENTS
IT FOCUSED ON MEDICAL MANAGEMENT AND NURSING MANAGEMENT.
HIGHLIGHTS ON HEALTH EDUCATION.
Beyond Degrees - Empowering the Workforce in the Context of Skills-First.pptx
Iván Bornacelly, Policy Analyst at the OECD Centre for Skills, OECD, presents at the webinar 'Tackling job market gaps with a skills-first approach' on 12 June 2024
Leveraging Generative AI to Drive Nonprofit Innovation
In this webinar, participants learned how to utilize Generative AI to streamline operations and elevate member engagement. Amazon Web Service experts provided a customer specific use cases and dived into low/no-code tools that are quick and easy to deploy through Amazon Web Service (AWS.)
RHEOLOGY Physical pharmaceutics-II notes for B.pharm 4th sem students
Physical pharmaceutics notes for B.pharm students
What is Digital Literacy? A guest blog from Andy McLaughlin, University of Ab...
What is Digital Literacy? A guest blog from Andy McLaughlin, University of Aberdeen
The History of Stoke Newington Street Names
Presented at the Stoke Newington Literary Festival on 9th June 2024
www.StokeNewingtonHistory.com
Recently uploaded (20)
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...
Jemison, MacLaughlin, and Majumder "Broadening Pathways for Editors and Authors"
Jemison, MacLaughlin, and Majumder "Broadening Pathways for Editors and Authors"
Mule event processing models | MuleSoft Mysore Meetup #47
Mule event processing models | MuleSoft Mysore Meetup #47
ISO/IEC 27001, ISO/IEC 42001, and GDPR: Best Practices for Implementation and...
ISO/IEC 27001, ISO/IEC 42001, and GDPR: Best Practices for Implementation and...
How to Setup Warehouse & Location in Odoo 17 Inventory
How to Setup Warehouse & Location in Odoo 17 Inventory
Chapter wise All Notes of First year Basic Civil Engineering.pptx
Chapter wise All Notes of First year Basic Civil Engineering.pptx
BÀI TẬP DẠY THÊM TIẾNG ANH LỚP 7 CẢ NĂM FRIENDS PLUS SÁCH CHÂN TRỜI SÁNG TẠO ...
BÀI TẬP DẠY THÊM TIẾNG ANH LỚP 7 CẢ NĂM FRIENDS PLUS SÁCH CHÂN TRỜI SÁNG TẠO ...
Level 3 NCEA - NZ: A Nation In the Making 1872 - 1900 SML.ppt
Level 3 NCEA - NZ: A Nation In the Making 1872 - 1900 SML.ppt
NEWSPAPERS - QUESTION 1 - REVISION POWERPOINT.pptx
NEWSPAPERS - QUESTION 1 - REVISION POWERPOINT.pptx
Beyond Degrees - Empowering the Workforce in the Context of Skills-First.pptx
Beyond Degrees - Empowering the Workforce in the Context of Skills-First.pptx
Leveraging Generative AI to Drive Nonprofit Innovation
Leveraging Generative AI to Drive Nonprofit Innovation
RHEOLOGY Physical pharmaceutics-II notes for B.pharm 4th sem students
RHEOLOGY Physical pharmaceutics-II notes for B.pharm 4th sem students
What is Digital Literacy? A guest blog from Andy McLaughlin, University of Ab...
What is Digital Literacy? A guest blog from Andy McLaughlin, University of Ab...
#include iostream using namespace std; class Array { priva.pdf
- 1. #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++)
- 2. 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; }
- 3. 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) {
- 4. 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)
- 5. { 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 << " ";
- 6. Ary3 = Ary1 * Ary2; cout << "Ary3 array Multiply output" << endl; cout << Ary3 << endl; cout << " "; Ary3 = Ary1 / Ary2; cout << "Ary3 array Division output" << endl; cout << Ary3 << endl; cout << " "; cout << "Test boundary conditions" << endl; Ary1[8] = 100; Ary1[16] = 200; i = 100; cout < Solution #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);
- 7. 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;
- 8. 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;
- 9. } 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);
- 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++; };
- 11. 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; cout << Ary3 << endl; cout << " "; Ary3 = Ary1 / Ary2; cout << "Ary3 array Division output" << endl; cout << Ary3 << endl; cout << " "; cout << "Test boundary conditions" << endl; Ary1[8] = 100; Ary1[16] = 200; i = 100; cout <