Create an array of size 10 Assign values to the array Print the arra.docx
•Download as DOCX, PDF•
0 likes•6 views
Create an array of size 10 Assign values to the array Print the array Swap the first and last elements in the array Print the array Shift all elements by one to the right Print the array Replace even elements with 0 Replace each element except the first and last by the larger of its two neighbors Print the array Solution /*Program to replace EVEN elements by 0 and ODD elements by 1.*/ #include <stdio.h> /** funtion : readArray() input : arr ( array of integer ), size to read ONE-D integer array from standard input device (keyboard). **/ void readArray(int arr[], int size) { int i =0; printf(\"\ Enter elements : \ \"); for(i=0; i < size; i++) { printf(\"Enter arr[%d] : \",i); scanf(\"%d\",&arr[i]); } } /** funtion : printArray() input : arr ( array of integer ), size to display ONE-D integer array on standard output device (moniter). **/ void printArray(int arr[], int size) { int i =0; printf(\"\ Elements are : \"); for(i=0; i < size; i++) { printf(\"\ \\tarr[%d] : %d\",i,arr[i]); } printf(\"\ \"); } /** funtion : replaceEvenOdd() input : arr ( array of integer ), size to replace EVEN elements by 0 and ODD elements by 1. **/ void replaceEvenOdd(int arr[], int size) { int i=0; for(i=0; i < size; i++) { if( arr[i] % 2 == 0 ) arr[i] = 0 ; else arr[i] = i; } } int main() { int arr[10]; readArray(arr,10); printf(\"\ Before replacement : \"); printArray(arr,10); replaceEvenOdd(arr,10); printf(\"\ After replacement : \"); printArray(arr,10); return 0; } .
Report
Share
Report
Share
![Create an array of size 10 Assign values to the array Print the array Swap the first and last
elements in the array Print the array Shift all elements by one to the right Print the array Replace
even elements with 0 Replace each element except the first and last by the larger of its two
neighbors Print the array
Solution
/*Program to replace EVEN elements by 0 and ODD elements by 1.*/
#include <stdio.h>
/** funtion : readArray()
input : arr ( array of integer ), size
to read ONE-D integer array from standard input device (keyboard).
**/
void readArray(int arr[], int size)
{
int i =0;
printf(" Enter elements : ");
for(i=0; i < size; i++)
{
printf("Enter arr[%d] : ",i);
scanf("%d",&arr[i]);
}
}
/** funtion : printArray()
input : arr ( array of integer ), size
to display ONE-D integer array on standard output device (moniter).
**/
void printArray(int arr[], int size)
{
int i =0;
printf(" Elements are : ");](https://image.slidesharecdn.com/createanarrayofsize10assignvaluestothearrayprintthearra-230131011209-1851b2b6/85/Create-an-array-of-size-10-Assign-values-to-the-array-Print-the-arra-docx-1-320.jpg)
![for(i=0; i < size; i++)
{
printf(" tarr[%d] : %d",i,arr[i]);
}
printf(" ");
}
/** funtion : replaceEvenOdd()
input : arr ( array of integer ), size
to replace EVEN elements by 0 and ODD elements by 1.
**/
void replaceEvenOdd(int arr[], int size)
{
int i=0;
for(i=0; i < size; i++)
{
if( arr[i] % 2 == 0 )
arr[i] = 0 ;
else
arr[i] = i;
}
}
int main()
{
int arr[10];
readArray(arr,10);
printf(" Before replacement : ");
printArray(arr,10);
replaceEvenOdd(arr,10);
printf(" After replacement : ");
printArray(arr,10);
return 0;
}](data:image/gif;base64,R0lGODlhAQABAIAAAAAAAP///yH5BAEAAAAALAAAAAABAAEAAAIBRAA7)
Recommended
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.
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,
(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, .
Array Programs.pdf
The document contains C program code snippets for performing various operations on 1D and 2D arrays such as calculating sum and average of elements, printing elements in reverse order, finding elements greater than average, storing elements in reverse order in another array, searching for an element, finding maximum and minimum elements, sorting elements, adding two 2D arrays, printing upper and lower triangles of a matrix, calculating row and column sums, and adding diagonals of a matrix.
Common problems solving using c
These problems are so common that you will find in any C learning curriculum. Either in your college or in any IT institute.
I have provided solutions to these problems as well.
Happy learning...
Write a program to implement and test the following sorting algorithm.docx
The document describes implementing and testing three sorting algorithms - insertion sort, heapsort, and shellsort - on arrays of 1,000 and 10,000 elements. It provides code samples to perform each algorithm and print the number of comparisons and item movements for analysis. The sorting algorithms are tested on sample arrays and the sorted output is displayed.
1D Array
An array is a collection of homogeneous data items stored in successive memory locations. It allows storing multiple elements of the same type using a single name. Elements in an array can be accessed using the array name and index number. Common operations on arrays include storing/retrieving elements, searching for a particular element or largest/smallest element, and calculating sum of elements based on certain criteria like even/odd indexing. Arrays can also be modified by inserting or deleting elements.
Basic c programs updated on 31.8.2020
The document provides examples of basic C programs that demonstrate fundamental programming concepts like printing values, arithmetic operations, arrays, functions, conditionals, loops, and matrices. The programs cover topics such as printing and reading integers, adding/multiplying numbers, swapping values, checking vowels/consonants, Armstrong numbers, palindromes, summing matrices, and finding the transpose of a matrix.
Recommended
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.
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,
(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, .
Array Programs.pdf
The document contains C program code snippets for performing various operations on 1D and 2D arrays such as calculating sum and average of elements, printing elements in reverse order, finding elements greater than average, storing elements in reverse order in another array, searching for an element, finding maximum and minimum elements, sorting elements, adding two 2D arrays, printing upper and lower triangles of a matrix, calculating row and column sums, and adding diagonals of a matrix.
Common problems solving using c
These problems are so common that you will find in any C learning curriculum. Either in your college or in any IT institute.
I have provided solutions to these problems as well.
Happy learning...
Write a program to implement and test the following sorting algorithm.docx
The document describes implementing and testing three sorting algorithms - insertion sort, heapsort, and shellsort - on arrays of 1,000 and 10,000 elements. It provides code samples to perform each algorithm and print the number of comparisons and item movements for analysis. The sorting algorithms are tested on sample arrays and the sorted output is displayed.
1D Array
An array is a collection of homogeneous data items stored in successive memory locations. It allows storing multiple elements of the same type using a single name. Elements in an array can be accessed using the array name and index number. Common operations on arrays include storing/retrieving elements, searching for a particular element or largest/smallest element, and calculating sum of elements based on certain criteria like even/odd indexing. Arrays can also be modified by inserting or deleting elements.
Basic c programs updated on 31.8.2020
The document provides examples of basic C programs that demonstrate fundamental programming concepts like printing values, arithmetic operations, arrays, functions, conditionals, loops, and matrices. The programs cover topics such as printing and reading integers, adding/multiplying numbers, swapping values, checking vowels/consonants, Armstrong numbers, palindromes, summing matrices, and finding the transpose of a matrix.
Data Structure using C
This document contains some programs of C using Data structures, like Stack, LinkedList, queue, Fibonacci series, addition and multiplication of two matrices,etc.
python practicals-solution-2019-20-class-xii.pdf
The document provides source code solutions to 20 programming problems in Python. For each problem, it includes the problem statement, source code, and sample output. The problems cover a range of concepts like checking if a number is prime, palindrome, compound interest calculation, ASCII conversions, data type checking, recursion, searching, sorting, and plotting graphs. It also includes examples of creating libraries and importing modules in Python. The solutions demonstrate basic programming concepts and techniques in Python.
Xi CBSE Computer Science lab programs
This document contains 14 programming problems and their solutions in Python. It also contains 5 SQL queries and their expected outputs to demonstrate basic SQL commands like creating tables, inserting data, selecting records, aggregating data, and ordering results. The Python programs cover topics like calculating area of a rectangle, finding even/odd numbers, checking for prime numbers, printing patterns, calculating series sums, checking for palindromes, and more. The SQL queries demonstrate creating a student database table, inserting records, calculating totals and percentages, and retrieving results.
Write a C code to perform the following tasks In main Define an arr.pdf
Write a C code to perform the following tasks: In main: Define an array of SIZE = 7 and
initialize them with 3, 5, 7, 9, 11, 13, 15 Call function sum with the array and size, both passed in
pointer representations Print each element of the array Print the sum In function sum: Take the
parameters in pointer representations,
Solution
// C code
#include
#include
#include
#include
// sum function using pointers to add elements of array
int sumArray(int *array, int *SIZE)
{
int i;
int sum = 0;
for (i = 0; i < *SIZE; ++i)
{
sum = sum + *(array+i);
}
return sum;
}
int main()
{
int SIZE = 7;
int array[] = {3,5,7,9,11,13,15};
// ddeclare and initialize pointer
int *ptr;
ptr = array;
// pass array pointer and size of array to function
int sum = sumArray(ptr,&SIZE);
printf(\"Array: \");
int i;
for (i = 0; i < SIZE; ++i)
{
printf(\"%d \",array[i]);
}
printf(\"\ \");
printf(\"Sum of array: %d\ \",sum);
return 0;
}
/*
output:
Array: 3 5 7 9 11 13 15
Sum of array: 63
*/.
VIT351 Software Development VI Unit2
The document provides information about arrays, strings, and character handling functions in C language. It discusses:
1. Definitions and properties of arrays, including declaring, initializing, and accessing single and multi-dimensional arrays.
2. Built-in functions for testing and mapping characters from the ctype.h library, including isalnum(), isalpha(), iscntrl(), isdigit(), ispunct(), and isspace().
3. Strings in C being arrays of characters terminated by a null character. It discusses common string handling functions from string.h like strlen(), strrev(), strlwr(), strupr(), strcpy(), strcat(), and strcmp().
Program to print all combination of size r in an array of size n.pdf
// Program to print all combination of size r in an array of size n
#include
void combinationUtil(int arr[], int data[], int start, int end,
int index, int r);
// The main function that prints all combinations of size r
// in arr[] of size n. This function mainly uses combinationUtil()
void printCombination(int arr[], int n, int r)
{
// A temporary array to store all combination one by one
int data[r];
// Print all combination using temprary array \'data[]\'
combinationUtil(arr, data, 0, n-1, 0, r);
}
/* arr[] ---> Input Array
data[] ---> Temporary array to store current combination
start & end ---> Staring and Ending indexes in arr[]
index ---> Current index in data[]
r ---> Size of a combination to be printed */
void combinationUtil(int arr[], int data[], int start, int end,
int index, int r)
{
// Current combination is ready to be printed, print it
if (index == r)
{
if (data[0]+data[1]+data[2]+data[3]==24)
{
for (int j=0; j= r-index\" makes sure that including one element
// at index will make a combination with remaining elements
// at remaining positions
for (int i=start; i<=end && end-i+1 >= r-index; i++)
{
data[index] = arr[i];
combinationUtil(arr, data, i+1, end, index+1, r);
}
}
// Driver program to test above functions
int main()
{
int arr[] = {1, 2, 3, 4, 5, 6, 7, 8, 9};
int r = 4;
int n = sizeof(arr)/sizeof(arr[0]);
printCombination(arr, n, r);
}
Solution
// Program to print all combination of size r in an array of size n
#include
void combinationUtil(int arr[], int data[], int start, int end,
int index, int r);
// The main function that prints all combinations of size r
// in arr[] of size n. This function mainly uses combinationUtil()
void printCombination(int arr[], int n, int r)
{
// A temporary array to store all combination one by one
int data[r];
// Print all combination using temprary array \'data[]\'
combinationUtil(arr, data, 0, n-1, 0, r);
}
/* arr[] ---> Input Array
data[] ---> Temporary array to store current combination
start & end ---> Staring and Ending indexes in arr[]
index ---> Current index in data[]
r ---> Size of a combination to be printed */
void combinationUtil(int arr[], int data[], int start, int end,
int index, int r)
{
// Current combination is ready to be printed, print it
if (index == r)
{
if (data[0]+data[1]+data[2]+data[3]==24)
{
for (int j=0; j= r-index\" makes sure that including one element
// at index will make a combination with remaining elements
// at remaining positions
for (int i=start; i<=end && end-i+1 >= r-index; i++)
{
data[index] = arr[i];
combinationUtil(arr, data, i+1, end, index+1, r);
}
}
// Driver program to test above functions
int main()
{
int arr[] = {1, 2, 3, 4, 5, 6, 7, 8, 9};
int r = 4;
int n = sizeof(arr)/sizeof(arr[0]);
printCombination(arr, n, r);
}.
PROVIDE COMMENTS TO FELLOW STUDENTS ANSWERS AND PLEASE DON’T SAY G.docx
PROVIDE COMMENTS TO FELLOW STUDENTS ANSWERS AND PLEASE DON’T SAY GOOD WORK NICE FORMULA OR SOMETHING LIKE THAT, BUT ACTULLY HE CAN USE. THANK YOU.
Hartleys Function Code
Contains unread posts
Actions for Hartleys Function Code
Chad Hartley posted Nov 5, 2015 5:10 PM
Subscribe
This program will add an integer number and a decimal number up to 2 decimal places. I have included notes in the code to explain what each thing does. I hope I did this right. It compiles successfully.
PseudoCode
Start
Declare int O1; Stands for Output1
O1=sum; Sum is the functions name
Int sum()
Declare variables
Int num1;
Float num2;
Write “Enter a number.”
Scanf num1
Write”Enter a decimal number.”
Scanf num2
Return num1+num2
end
C Code
#include <stdio.h>
int sum();//prototype
int main()//calling program
{
//Declare a varaiable
int O1;
O1=sum();//main is calling sum one time.
//if I listed this twice it would run the function 'sum' twice.
// Example: if I add a new int (int O1, O2) and declare O2 to
//be O2=sum then the function would run twice.
}
int sum ()//function 'sum'
{
int num1;// Declare intergers/variables
float num2;
printf("Enter a number.\n");
scanf("%d",&num1);// Take first input and assign it to num1
printf("Enter a decimal number.\n");
scanf("%.2f",&num2);
//Can use the printf statement but when you are calling an integer you can use the return.
//printf("The sum of %d, %d, is %d", num1,num2,num1+num2);
return num1+num2;
}
ADD COMMENT HERE
Chaotic Function
Contains unread posts
Actions for Chaotic Function
Joshua Ray posted Nov 5, 2015 2:33 PM
Subscribe
float tmp
int i
function float chaos(float num)
{
for i < 20
num = 3.9*num*(1-num)
print num
}
main
print "Program description"
print "Request input btw 0 and 1"
tmp = input
chaos(tmp)
/*
* File: main.c
* Author: JaiEllRei
*
* Created on November 5, 2015, 2:04 PM
*/
#include <stdio.h>
#include <stdlib.h>
float chaos(float num);
int main(void)
{
float tmp;
printf("This program illustrates a choatic function. \n");
printf("Input a number between 0 and 1: ");
scanf("%f", &tmp);
chaos(tmp);
}
float chaos(float num)
{
for (int i=0; i<20; i++){
/*Chaotic Formula*/
num = 3.9 * num * (1-num);
printf("%.3f \n", num);
}
}
This program illustrates a choatic function.
Input a number between 0 and 1: .2
0.624
0.915
0.303
0.824
0.566
0.958
0.156
0.514
0.974
0.098
0.345
0.881
0.409
0.943
0.210
0.647
0.891
0.379
0.918
0.293
ADD COMMENT HERE
//MPH to KPH Conversion Function
Function KPHConv(value) as float
Set KPHConv = value*1.609344
End Function
Pseudocode for simple conversion program calling function
//Declare function
// MPH to KPH Conversion Function
Functio ...
Computer programming subject notes. Quick easy notes for C Programming.Cheat ...
The document provides an overview of C programming concepts including data types, variables, operators, conditional statements, loops, functions, arrays and more.
It begins with basic explanations and examples of comments, print statements, data types, input/output functions. Next, it covers conditional statements like if-else and examples to check even/odd and prime numbers. Loops like for and while are explained along with examples to iterate, count and print patterns. Other topics include functions, arrays, strings, structures and examples programs for calculations, pattern printing and sorting. Overall, the document serves as a useful reference for learning C programming fundamentals and common programming concepts.
PCA-2 Programming and Solving 2nd Sem.pdf
The document contains 14 code snippets that provide solutions to common programming problems in C including: printing patterns like numbers, stars, triangles using loops; finding sum of digits, checking palindrome, Armstrong number; sorting arrays using bubble, selection sort; string operations like concatenation; matrix addition; factorial; checking even-odd; Floyd's triangle. Each code snippet includes the header files, function definitions and main function to accept input, call functions and print output.
PCA-2 Programming and Solving 2nd Sem.docx
The document contains 14 code snippets that provide solutions to common programming problems in C including: printing patterns like numbers, stars, triangles using loops; finding sum of digits, checking palindrome, Armstrong number; sorting arrays using bubble sort, selection sort; string operations like concatenation; matrix addition; factorial calculation; checking even/odd number. Each code snippet includes the header files, function definitions and main function to accept input, call functions and print output.
C++ Nested loops, matrix and fuctions.pdf
Nested loops allow executing a set of statements multiple times in a loop within another loop. This can be used to iterate over multidimensional data structures. The outer loop completes one full iteration for each iteration of the inner loop, nesting the loops within each other. Functions allow breaking programs into reusable blocks of code to perform specific tasks, with declarations informing the compiler of functions' names, return types, and parameters, while definitions contain the function body.
Chapter 8 c solution
The document provides code snippets to copy the contents of one array into another array in reverse order using different approaches like loops, pointers, and functions. It also includes code to reverse an array without using additional memory by swapping elements, and to reverse an array using pointers.
Basic C Programming Lab Practice
The document contains the answers to 12 tasks/problems involving C programming concepts like arrays, matrices, strings, functions, recursion, structures, files etc. Each answer provides the full code to solve the problem. The tasks include programs to sort arrays, add matrices, count characters in strings, check palindromes, find prime numbers using functions, calculate factorials and Fibonacci terms recursively, define nested structures, and read/write numbers to files.
1sequences and sampling. Suppose we went to sample the x-axis from X.pdf
1sequences and sampling. Suppose we went to sample the x-axis from Xmin to Xmax using a
step size of step
A)Draw a picture of what is going on.
B) Write a expression for n the total number of samples involved (in terms of Xmin, Xmax and
step)
C) Write out the sequence of x-samples
D) Write a direct and general expression for xi that captures the sequence
E) Write a recursive expression for the sequence
F) Write a program to compute and store the x-samples over the range -5x5 using a step size of
0.1 do everything in main ()
2 . We talked about the following string functions that are available in C (as long as you include
string.h):
int strlen(char str[])
void strcpy(char str1[], char str2[])
void strcat(char str1[], str2[])
Write your own versions of these functions; for example: int paul_strlen(int char str[]). Hint: for
your version of the strlen function, start at the first character in the array and keep counting until
you find the ‘\\0’ character (use a while loop for this). Note: Use your version of the strlen
function in the strcpy and strcat functions.
9. We want to insert a number into an array.
(a) Formulate the problem mathematically with two sequences: x and y. (b) Write a function of
the form:
insertNumIntoArray(int n, int array[], int num, int index)
The function inserts num into the array at the specified index. The rest of the array then follows.
For example, if num = 9 and index = 3 and array = [7 2 8 8 3 1 2] then the function will produce:
array = [7 2 8 9 8 3 1 2]
Note: assume that array is properly dimensioned to have at least 1 extra space for storage.
10. Repeat #2 by for the delete operation; that is, we want to delete a single element (at a
specified index) from an array; for example, suppose index = 3 and array = [50 70 10 90 60 20],
then the result will be
array: [50 70 10 60 20]
11. Repeat #2 by for an insert operation where we are inserting several values into the array. The
function should be of the form:
int insertArrayIntoArray(int n, int inArray[],
int nInsert, int insertArray[], int outArray[], int index)
The dimension of outArray is returned (explicitly). For example:
inArrayarray: [7 2 8 6 3 9]
insertArray: [50 60 70]
index: 2
outArray: [7 2 50 60 70 8 6 3 9]
Assume that outArray is large enough to hold all n + nInsert values.
Solution
#include
//Simulates strlen() library function
int paul_strlen(char str[])
{
int l;
for(l = 0; str[l] != \'\\0\'; l++) ;
return l;
}
//Simulates strcpy() library function
void paul_strcpy(char str1[], char str2[])
{
int c;
for(c = 0; str1[c] != \'\\0\'; c++)
str2[c] = str1[c];
str2[c] = \'\\0\';
printf(\"\ Original String: %s\", str1);
printf(\"\ Copied String: %s\", str2);
}
//Simulates strcat() library function
void paul_strcat(char str1[], char str2[])
{
int i, j;
for(i = 0; str1[i] != \'\\0\'; i++) ;
for (j = 0; str2[j] != \'\\0\'; i++, j++)
{
str1[i] = str2[j];
}
str1[i] = \'\\0\';
printf(\"\ Concatenated String: %s\", str1);
}
int main()
{
char data1[20], data2[20];
pri.
Arrays_in_c++.pptx
Here is the program to copy elements of an array into another array in reverse order:
#include <iostream>
using namespace std;
int main() {
int arr1[10], arr2[10];
cout << "Enter 10 integer inputs: ";
for(int i=0; i<10; i++) {
cin >> arr1[i];
}
for(int i=0, j=9; i<10; i++, j--) {
arr2[j] = arr1[i];
}
cout << "Array 1: ";
for(int i=0; i<10; i++) {
cout << arr1[i
Modify this code to use multiple threads with the same data1.Modif.pdf
Modify this code to use multiple threads with the same data
1.Modify the main function to implement a loop that reads 10 integers from the console (user
input) and stores these numbers in a one-dimensional (1D) array (this code will go right after the
comment that says “Add code to perform any needed initialization or to process user input”).
You should use a global array for this.
2.Implement a separatepthread function function for each one of the following operations:
a.Count and print out how many of the entered numbers are negative. This function must be
named countNegatives
b.Calculate and print the average value of all the numbers entered. This function must be named
average
c.Print the numbers in reverse order from the order in which they were entered. This function
must be named reverse
3.Modify the main function to create one pthread for each one of the functions that you
implemented in (3) above (this code will go between the comment that says “TODO: Modify
according to assignment requirements” and the “if (rc)” check).
Compile your program and run it several times. If the output of your program is garbled, you
may need to add a small delay in between creating the next thread.
#include
#include
using namespace std;
void *routineName(void *arg)
{
// TODO: Add code that implements
// the thread\'s functionality
cout << \"Thread is running...\" << endl;
return 0;
}
int main()
{
pthread_t id;
int rc;
int ints;
for(int x; x<10; x++)
{
cout << \"Enter Integer: \" <>
}
rc = pthread_create(&id, NULL, routineName, NULL);
if (rc){
cout << \"ERROR; return code from pthread_create() is \" << rc << endl;
return -1;
}
pthread_exit(0);
}
Solution
#include
#include
#include
using namespace std;
int ints[10];
//Method to count negatives in the input array
void *countNegatives(void*){
int count = 0;
for(int i=0;i<10;i++){
if(ints[i]<0){
count++;
}
}
cout<<\"Number of negatives: \"<=0;i--){
cout<> ints[x];
}
//Creating pthread to countNegatives
rc = pthread_create(&t1, NULL, countNegatives, NULL);
if(rc){
cout << \"Error:unable to create thread,\" << rc << endl;
}
//Adding delay
sleep(1);
//Creating pthread to compute average
rc = pthread_create(&t2, NULL, average, NULL);
if(rc){
cout << \"Error:unable to create thread,\" << rc << endl;
}
//Adding delay
sleep(1);
//Creating pthread to print in reverse
rc = pthread_create(&t3, NULL, reverse, NULL);
if(rc){
cout << \"Error:unable to create thread,\" << rc << endl;
}
//Adding delay
sleep(1);
void* status;
//waiting for t1 to join
rc = pthread_join(t1,&status);
if(rc){
cout << \"Error:unable to join,\" << rc << endl;
}
//waiting for t2 to join
rc = pthread_join(t2,&status);
if(rc){
cout << \"Error:unable to join,\" << rc << endl;
}
//waiting for t3 to join
rc = pthread_join(t3,&status);
if(rc){
cout << \"Error:unable to join,\" << rc << endl;
}
pthread_exit(0);
}.
For this homework, you will write a program to create and manipulate.pdf
For this homework, you will write a program to create and manipulate a simple linked list. For
each node in the linked list you will generate a random number, create a node that holds that
number, and insert that node into its sorted position in the linked list. Once the nodes are
inserted, you will traverse the list, printing the value held in each node. Then you will clean up
the list (deleting all the nodes) and exit the program. You will also learn about a tool that you can
use to help you check for memory errors in your code.
Specifications:
Define a struct appropriate for holding a random integer. This struct will also contain a \"next\"
pointer to reference a separate instance of the struct.
You may use the typedef keyword to give your struct a separate typename if you wish, but this is
not a requirement.
The program will read command line arguments. The first argument is the program name (as it
will always be) followed by a random number seed, the number of random numbers to generate
and ending with the Maximum Possible Value of the Random numbers generated (i.e. argc
should be 4).
Your program will use a \"dummy node\" for the linked list. In other words, the head of the list
will be an actual node, but the data field in that node will not be used for sorting purposes.
Your program must contain the following functions:
main() (for obvious reasons)
insertNodeSorted() - You may implement this either of two ways.
One way is to use the head of the list as one parameter and the integer value as the second. The
function will allocate memory for the node, initialize it and then insert it in the proper location in
the list.
The other way is to pass the head of the list as one parameter and a previously allocated and
initialized node as the other. The existing node is inserted in the proper location in the list.
printList() - Takes the head of the list as its only parameter, traverses the list, printing out the
data in sorted order.
deleteList() - Takes the head of the list as its only parameter, traverses the list, deleting all nodes.
The basic algorithm of your program is
Use a loop (based upon command line input values) that:
Generates a random number
Prints the number to stdout
Creates a node that contains that random number
Inserts the new node in sorted order into the existing list
Print the sorted linked list
Delete the linked list
You will use a Makefile to compile your program
Solution
#include
#include
#include
struct test_struct
{
int val;
struct test_struct *next;
};
struct test_struct *head = NULL;
struct test_struct *curr = NULL;
struct test_struct* create_list(int val)
{
printf(\"\ creating list with headnode as [%d]\ \",val);
struct test_struct *ptr = (struct test_struct*)malloc(sizeof(struct test_struct));
if(NULL == ptr)
{
printf(\"\ Node creation failed \ \");
return NULL;
}
ptr->val = val;
ptr->next = NULL;
head = curr = ptr;
return ptr;
}
struct test_struct* add_to_list(int val, bool add_to_end)
{
if(NULL == head)
{
retur.
Interesting facts on c
Highlighted key points on the following concepts of C Language,I/O Functions,Bitwise operators, preincrement operator,post increment operator ,storage class,functions,Sample Code Snippets
C#.net
The document discusses C#.NET programs and various simple console applications that demonstrate basic programming concepts like input/output, conditional statements, loops, arrays, and pattern printing. It includes 10 programs that perform tasks like calculating sums, swapping values, checking odd/even, and more. It also covers 4 programs using different looping structures and 5 programs that print numeric patterns using nested loops.
UNIT-II CP DOC.docx
The document discusses various input and output functions in C programming. It describes formatted and unformatted input/output functions. Formatted functions like scanf() and printf() require format specifiers to identify the data type being read or written. Unformatted functions like getchar() and putchar() only work with character data. The document also covers control statements like if, if-else, switch case that allow conditional execution of code in C. Examples are provided to demonstrate the use of various input, output and control functions.
A rigid- well-insulated gas cylinder contains N0 moles of an ideal gas.docx
A rigid, well-insulated gas cylinder contains N0 moles of an ideal gas at a temperature To  and pressure Po. A venting valve is opened and the gas is pumped out of the tank. Derive an expression for the instantaneous temperature in the cylinder as a function of the number of moles of gas remaining in the cylinder. What is the final temperature Tf, if the tank is evacuated to Nf = 0? Is the prediction physically realistic? The heat  capacity at constant volume of the gas is independent of temperature.
Solution
PV = nRT
nT = PV/R = constant
nT = K
Tdn + ndT = 0
Tdn = - ndT
dT/dn = - T/n
dT/T = -dn/n
Integrating both sides
ln T = - ln n + C
at n=No ; T =To
so
ln To = - ln No + C
C = ln To + ln No = ln To*No
so
ln T = ln To*No - ln n
ln T = ln (To*No/n)
T = (To*No)/n
as n = Nf = 0
Twill tend to infinity...this is not practically possible
.
A soil is shaken with water and then allowed to stand- After standing-.docx
A soil is shaken with water and then allowed to stand. After standing:
the soil particles will settle out of the water
only the soluble metals will remain in the water
the insoluble metals will settle to the bottom with the soil
all of the above will occur
Solution
Option d is The correct answer that is all the above will occur as per given options.
.
More Related Content
Similar to Create an array of size 10 Assign values to the array Print the arra.docx
Data Structure using C
This document contains some programs of C using Data structures, like Stack, LinkedList, queue, Fibonacci series, addition and multiplication of two matrices,etc.
python practicals-solution-2019-20-class-xii.pdf
The document provides source code solutions to 20 programming problems in Python. For each problem, it includes the problem statement, source code, and sample output. The problems cover a range of concepts like checking if a number is prime, palindrome, compound interest calculation, ASCII conversions, data type checking, recursion, searching, sorting, and plotting graphs. It also includes examples of creating libraries and importing modules in Python. The solutions demonstrate basic programming concepts and techniques in Python.
Xi CBSE Computer Science lab programs
This document contains 14 programming problems and their solutions in Python. It also contains 5 SQL queries and their expected outputs to demonstrate basic SQL commands like creating tables, inserting data, selecting records, aggregating data, and ordering results. The Python programs cover topics like calculating area of a rectangle, finding even/odd numbers, checking for prime numbers, printing patterns, calculating series sums, checking for palindromes, and more. The SQL queries demonstrate creating a student database table, inserting records, calculating totals and percentages, and retrieving results.
Write a C code to perform the following tasks In main Define an arr.pdf
Write a C code to perform the following tasks: In main: Define an array of SIZE = 7 and
initialize them with 3, 5, 7, 9, 11, 13, 15 Call function sum with the array and size, both passed in
pointer representations Print each element of the array Print the sum In function sum: Take the
parameters in pointer representations,
Solution
// C code
#include
#include
#include
#include
// sum function using pointers to add elements of array
int sumArray(int *array, int *SIZE)
{
int i;
int sum = 0;
for (i = 0; i < *SIZE; ++i)
{
sum = sum + *(array+i);
}
return sum;
}
int main()
{
int SIZE = 7;
int array[] = {3,5,7,9,11,13,15};
// ddeclare and initialize pointer
int *ptr;
ptr = array;
// pass array pointer and size of array to function
int sum = sumArray(ptr,&SIZE);
printf(\"Array: \");
int i;
for (i = 0; i < SIZE; ++i)
{
printf(\"%d \",array[i]);
}
printf(\"\ \");
printf(\"Sum of array: %d\ \",sum);
return 0;
}
/*
output:
Array: 3 5 7 9 11 13 15
Sum of array: 63
*/.
VIT351 Software Development VI Unit2
The document provides information about arrays, strings, and character handling functions in C language. It discusses:
1. Definitions and properties of arrays, including declaring, initializing, and accessing single and multi-dimensional arrays.
2. Built-in functions for testing and mapping characters from the ctype.h library, including isalnum(), isalpha(), iscntrl(), isdigit(), ispunct(), and isspace().
3. Strings in C being arrays of characters terminated by a null character. It discusses common string handling functions from string.h like strlen(), strrev(), strlwr(), strupr(), strcpy(), strcat(), and strcmp().
Program to print all combination of size r in an array of size n.pdf
// Program to print all combination of size r in an array of size n
#include
void combinationUtil(int arr[], int data[], int start, int end,
int index, int r);
// The main function that prints all combinations of size r
// in arr[] of size n. This function mainly uses combinationUtil()
void printCombination(int arr[], int n, int r)
{
// A temporary array to store all combination one by one
int data[r];
// Print all combination using temprary array \'data[]\'
combinationUtil(arr, data, 0, n-1, 0, r);
}
/* arr[] ---> Input Array
data[] ---> Temporary array to store current combination
start & end ---> Staring and Ending indexes in arr[]
index ---> Current index in data[]
r ---> Size of a combination to be printed */
void combinationUtil(int arr[], int data[], int start, int end,
int index, int r)
{
// Current combination is ready to be printed, print it
if (index == r)
{
if (data[0]+data[1]+data[2]+data[3]==24)
{
for (int j=0; j= r-index\" makes sure that including one element
// at index will make a combination with remaining elements
// at remaining positions
for (int i=start; i<=end && end-i+1 >= r-index; i++)
{
data[index] = arr[i];
combinationUtil(arr, data, i+1, end, index+1, r);
}
}
// Driver program to test above functions
int main()
{
int arr[] = {1, 2, 3, 4, 5, 6, 7, 8, 9};
int r = 4;
int n = sizeof(arr)/sizeof(arr[0]);
printCombination(arr, n, r);
}
Solution
// Program to print all combination of size r in an array of size n
#include
void combinationUtil(int arr[], int data[], int start, int end,
int index, int r);
// The main function that prints all combinations of size r
// in arr[] of size n. This function mainly uses combinationUtil()
void printCombination(int arr[], int n, int r)
{
// A temporary array to store all combination one by one
int data[r];
// Print all combination using temprary array \'data[]\'
combinationUtil(arr, data, 0, n-1, 0, r);
}
/* arr[] ---> Input Array
data[] ---> Temporary array to store current combination
start & end ---> Staring and Ending indexes in arr[]
index ---> Current index in data[]
r ---> Size of a combination to be printed */
void combinationUtil(int arr[], int data[], int start, int end,
int index, int r)
{
// Current combination is ready to be printed, print it
if (index == r)
{
if (data[0]+data[1]+data[2]+data[3]==24)
{
for (int j=0; j= r-index\" makes sure that including one element
// at index will make a combination with remaining elements
// at remaining positions
for (int i=start; i<=end && end-i+1 >= r-index; i++)
{
data[index] = arr[i];
combinationUtil(arr, data, i+1, end, index+1, r);
}
}
// Driver program to test above functions
int main()
{
int arr[] = {1, 2, 3, 4, 5, 6, 7, 8, 9};
int r = 4;
int n = sizeof(arr)/sizeof(arr[0]);
printCombination(arr, n, r);
}.
PROVIDE COMMENTS TO FELLOW STUDENTS ANSWERS AND PLEASE DON’T SAY G.docx
PROVIDE COMMENTS TO FELLOW STUDENTS ANSWERS AND PLEASE DON’T SAY GOOD WORK NICE FORMULA OR SOMETHING LIKE THAT, BUT ACTULLY HE CAN USE. THANK YOU.
Hartleys Function Code
Contains unread posts
Actions for Hartleys Function Code
Chad Hartley posted Nov 5, 2015 5:10 PM
Subscribe
This program will add an integer number and a decimal number up to 2 decimal places. I have included notes in the code to explain what each thing does. I hope I did this right. It compiles successfully.
PseudoCode
Start
Declare int O1; Stands for Output1
O1=sum; Sum is the functions name
Int sum()
Declare variables
Int num1;
Float num2;
Write “Enter a number.”
Scanf num1
Write”Enter a decimal number.”
Scanf num2
Return num1+num2
end
C Code
#include <stdio.h>
int sum();//prototype
int main()//calling program
{
//Declare a varaiable
int O1;
O1=sum();//main is calling sum one time.
//if I listed this twice it would run the function 'sum' twice.
// Example: if I add a new int (int O1, O2) and declare O2 to
//be O2=sum then the function would run twice.
}
int sum ()//function 'sum'
{
int num1;// Declare intergers/variables
float num2;
printf("Enter a number.\n");
scanf("%d",&num1);// Take first input and assign it to num1
printf("Enter a decimal number.\n");
scanf("%.2f",&num2);
//Can use the printf statement but when you are calling an integer you can use the return.
//printf("The sum of %d, %d, is %d", num1,num2,num1+num2);
return num1+num2;
}
ADD COMMENT HERE
Chaotic Function
Contains unread posts
Actions for Chaotic Function
Joshua Ray posted Nov 5, 2015 2:33 PM
Subscribe
float tmp
int i
function float chaos(float num)
{
for i < 20
num = 3.9*num*(1-num)
print num
}
main
print "Program description"
print "Request input btw 0 and 1"
tmp = input
chaos(tmp)
/*
* File: main.c
* Author: JaiEllRei
*
* Created on November 5, 2015, 2:04 PM
*/
#include <stdio.h>
#include <stdlib.h>
float chaos(float num);
int main(void)
{
float tmp;
printf("This program illustrates a choatic function. \n");
printf("Input a number between 0 and 1: ");
scanf("%f", &tmp);
chaos(tmp);
}
float chaos(float num)
{
for (int i=0; i<20; i++){
/*Chaotic Formula*/
num = 3.9 * num * (1-num);
printf("%.3f \n", num);
}
}
This program illustrates a choatic function.
Input a number between 0 and 1: .2
0.624
0.915
0.303
0.824
0.566
0.958
0.156
0.514
0.974
0.098
0.345
0.881
0.409
0.943
0.210
0.647
0.891
0.379
0.918
0.293
ADD COMMENT HERE
//MPH to KPH Conversion Function
Function KPHConv(value) as float
Set KPHConv = value*1.609344
End Function
Pseudocode for simple conversion program calling function
//Declare function
// MPH to KPH Conversion Function
Functio ...
Computer programming subject notes. Quick easy notes for C Programming.Cheat ...
The document provides an overview of C programming concepts including data types, variables, operators, conditional statements, loops, functions, arrays and more.
It begins with basic explanations and examples of comments, print statements, data types, input/output functions. Next, it covers conditional statements like if-else and examples to check even/odd and prime numbers. Loops like for and while are explained along with examples to iterate, count and print patterns. Other topics include functions, arrays, strings, structures and examples programs for calculations, pattern printing and sorting. Overall, the document serves as a useful reference for learning C programming fundamentals and common programming concepts.
PCA-2 Programming and Solving 2nd Sem.pdf
The document contains 14 code snippets that provide solutions to common programming problems in C including: printing patterns like numbers, stars, triangles using loops; finding sum of digits, checking palindrome, Armstrong number; sorting arrays using bubble, selection sort; string operations like concatenation; matrix addition; factorial; checking even-odd; Floyd's triangle. Each code snippet includes the header files, function definitions and main function to accept input, call functions and print output.
PCA-2 Programming and Solving 2nd Sem.docx
The document contains 14 code snippets that provide solutions to common programming problems in C including: printing patterns like numbers, stars, triangles using loops; finding sum of digits, checking palindrome, Armstrong number; sorting arrays using bubble sort, selection sort; string operations like concatenation; matrix addition; factorial calculation; checking even/odd number. Each code snippet includes the header files, function definitions and main function to accept input, call functions and print output.
C++ Nested loops, matrix and fuctions.pdf
Nested loops allow executing a set of statements multiple times in a loop within another loop. This can be used to iterate over multidimensional data structures. The outer loop completes one full iteration for each iteration of the inner loop, nesting the loops within each other. Functions allow breaking programs into reusable blocks of code to perform specific tasks, with declarations informing the compiler of functions' names, return types, and parameters, while definitions contain the function body.
Chapter 8 c solution
The document provides code snippets to copy the contents of one array into another array in reverse order using different approaches like loops, pointers, and functions. It also includes code to reverse an array without using additional memory by swapping elements, and to reverse an array using pointers.
Basic C Programming Lab Practice
The document contains the answers to 12 tasks/problems involving C programming concepts like arrays, matrices, strings, functions, recursion, structures, files etc. Each answer provides the full code to solve the problem. The tasks include programs to sort arrays, add matrices, count characters in strings, check palindromes, find prime numbers using functions, calculate factorials and Fibonacci terms recursively, define nested structures, and read/write numbers to files.
1sequences and sampling. Suppose we went to sample the x-axis from X.pdf
1sequences and sampling. Suppose we went to sample the x-axis from Xmin to Xmax using a
step size of step
A)Draw a picture of what is going on.
B) Write a expression for n the total number of samples involved (in terms of Xmin, Xmax and
step)
C) Write out the sequence of x-samples
D) Write a direct and general expression for xi that captures the sequence
E) Write a recursive expression for the sequence
F) Write a program to compute and store the x-samples over the range -5x5 using a step size of
0.1 do everything in main ()
2 . We talked about the following string functions that are available in C (as long as you include
string.h):
int strlen(char str[])
void strcpy(char str1[], char str2[])
void strcat(char str1[], str2[])
Write your own versions of these functions; for example: int paul_strlen(int char str[]). Hint: for
your version of the strlen function, start at the first character in the array and keep counting until
you find the ‘\\0’ character (use a while loop for this). Note: Use your version of the strlen
function in the strcpy and strcat functions.
9. We want to insert a number into an array.
(a) Formulate the problem mathematically with two sequences: x and y. (b) Write a function of
the form:
insertNumIntoArray(int n, int array[], int num, int index)
The function inserts num into the array at the specified index. The rest of the array then follows.
For example, if num = 9 and index = 3 and array = [7 2 8 8 3 1 2] then the function will produce:
array = [7 2 8 9 8 3 1 2]
Note: assume that array is properly dimensioned to have at least 1 extra space for storage.
10. Repeat #2 by for the delete operation; that is, we want to delete a single element (at a
specified index) from an array; for example, suppose index = 3 and array = [50 70 10 90 60 20],
then the result will be
array: [50 70 10 60 20]
11. Repeat #2 by for an insert operation where we are inserting several values into the array. The
function should be of the form:
int insertArrayIntoArray(int n, int inArray[],
int nInsert, int insertArray[], int outArray[], int index)
The dimension of outArray is returned (explicitly). For example:
inArrayarray: [7 2 8 6 3 9]
insertArray: [50 60 70]
index: 2
outArray: [7 2 50 60 70 8 6 3 9]
Assume that outArray is large enough to hold all n + nInsert values.
Solution
#include
//Simulates strlen() library function
int paul_strlen(char str[])
{
int l;
for(l = 0; str[l] != \'\\0\'; l++) ;
return l;
}
//Simulates strcpy() library function
void paul_strcpy(char str1[], char str2[])
{
int c;
for(c = 0; str1[c] != \'\\0\'; c++)
str2[c] = str1[c];
str2[c] = \'\\0\';
printf(\"\ Original String: %s\", str1);
printf(\"\ Copied String: %s\", str2);
}
//Simulates strcat() library function
void paul_strcat(char str1[], char str2[])
{
int i, j;
for(i = 0; str1[i] != \'\\0\'; i++) ;
for (j = 0; str2[j] != \'\\0\'; i++, j++)
{
str1[i] = str2[j];
}
str1[i] = \'\\0\';
printf(\"\ Concatenated String: %s\", str1);
}
int main()
{
char data1[20], data2[20];
pri.
Arrays_in_c++.pptx
Here is the program to copy elements of an array into another array in reverse order:
#include <iostream>
using namespace std;
int main() {
int arr1[10], arr2[10];
cout << "Enter 10 integer inputs: ";
for(int i=0; i<10; i++) {
cin >> arr1[i];
}
for(int i=0, j=9; i<10; i++, j--) {
arr2[j] = arr1[i];
}
cout << "Array 1: ";
for(int i=0; i<10; i++) {
cout << arr1[i
Modify this code to use multiple threads with the same data1.Modif.pdf
Modify this code to use multiple threads with the same data
1.Modify the main function to implement a loop that reads 10 integers from the console (user
input) and stores these numbers in a one-dimensional (1D) array (this code will go right after the
comment that says “Add code to perform any needed initialization or to process user input”).
You should use a global array for this.
2.Implement a separatepthread function function for each one of the following operations:
a.Count and print out how many of the entered numbers are negative. This function must be
named countNegatives
b.Calculate and print the average value of all the numbers entered. This function must be named
average
c.Print the numbers in reverse order from the order in which they were entered. This function
must be named reverse
3.Modify the main function to create one pthread for each one of the functions that you
implemented in (3) above (this code will go between the comment that says “TODO: Modify
according to assignment requirements” and the “if (rc)” check).
Compile your program and run it several times. If the output of your program is garbled, you
may need to add a small delay in between creating the next thread.
#include
#include
using namespace std;
void *routineName(void *arg)
{
// TODO: Add code that implements
// the thread\'s functionality
cout << \"Thread is running...\" << endl;
return 0;
}
int main()
{
pthread_t id;
int rc;
int ints;
for(int x; x<10; x++)
{
cout << \"Enter Integer: \" <>
}
rc = pthread_create(&id, NULL, routineName, NULL);
if (rc){
cout << \"ERROR; return code from pthread_create() is \" << rc << endl;
return -1;
}
pthread_exit(0);
}
Solution
#include
#include
#include
using namespace std;
int ints[10];
//Method to count negatives in the input array
void *countNegatives(void*){
int count = 0;
for(int i=0;i<10;i++){
if(ints[i]<0){
count++;
}
}
cout<<\"Number of negatives: \"<=0;i--){
cout<> ints[x];
}
//Creating pthread to countNegatives
rc = pthread_create(&t1, NULL, countNegatives, NULL);
if(rc){
cout << \"Error:unable to create thread,\" << rc << endl;
}
//Adding delay
sleep(1);
//Creating pthread to compute average
rc = pthread_create(&t2, NULL, average, NULL);
if(rc){
cout << \"Error:unable to create thread,\" << rc << endl;
}
//Adding delay
sleep(1);
//Creating pthread to print in reverse
rc = pthread_create(&t3, NULL, reverse, NULL);
if(rc){
cout << \"Error:unable to create thread,\" << rc << endl;
}
//Adding delay
sleep(1);
void* status;
//waiting for t1 to join
rc = pthread_join(t1,&status);
if(rc){
cout << \"Error:unable to join,\" << rc << endl;
}
//waiting for t2 to join
rc = pthread_join(t2,&status);
if(rc){
cout << \"Error:unable to join,\" << rc << endl;
}
//waiting for t3 to join
rc = pthread_join(t3,&status);
if(rc){
cout << \"Error:unable to join,\" << rc << endl;
}
pthread_exit(0);
}.
For this homework, you will write a program to create and manipulate.pdf
For this homework, you will write a program to create and manipulate a simple linked list. For
each node in the linked list you will generate a random number, create a node that holds that
number, and insert that node into its sorted position in the linked list. Once the nodes are
inserted, you will traverse the list, printing the value held in each node. Then you will clean up
the list (deleting all the nodes) and exit the program. You will also learn about a tool that you can
use to help you check for memory errors in your code.
Specifications:
Define a struct appropriate for holding a random integer. This struct will also contain a \"next\"
pointer to reference a separate instance of the struct.
You may use the typedef keyword to give your struct a separate typename if you wish, but this is
not a requirement.
The program will read command line arguments. The first argument is the program name (as it
will always be) followed by a random number seed, the number of random numbers to generate
and ending with the Maximum Possible Value of the Random numbers generated (i.e. argc
should be 4).
Your program will use a \"dummy node\" for the linked list. In other words, the head of the list
will be an actual node, but the data field in that node will not be used for sorting purposes.
Your program must contain the following functions:
main() (for obvious reasons)
insertNodeSorted() - You may implement this either of two ways.
One way is to use the head of the list as one parameter and the integer value as the second. The
function will allocate memory for the node, initialize it and then insert it in the proper location in
the list.
The other way is to pass the head of the list as one parameter and a previously allocated and
initialized node as the other. The existing node is inserted in the proper location in the list.
printList() - Takes the head of the list as its only parameter, traverses the list, printing out the
data in sorted order.
deleteList() - Takes the head of the list as its only parameter, traverses the list, deleting all nodes.
The basic algorithm of your program is
Use a loop (based upon command line input values) that:
Generates a random number
Prints the number to stdout
Creates a node that contains that random number
Inserts the new node in sorted order into the existing list
Print the sorted linked list
Delete the linked list
You will use a Makefile to compile your program
Solution
#include
#include
#include
struct test_struct
{
int val;
struct test_struct *next;
};
struct test_struct *head = NULL;
struct test_struct *curr = NULL;
struct test_struct* create_list(int val)
{
printf(\"\ creating list with headnode as [%d]\ \",val);
struct test_struct *ptr = (struct test_struct*)malloc(sizeof(struct test_struct));
if(NULL == ptr)
{
printf(\"\ Node creation failed \ \");
return NULL;
}
ptr->val = val;
ptr->next = NULL;
head = curr = ptr;
return ptr;
}
struct test_struct* add_to_list(int val, bool add_to_end)
{
if(NULL == head)
{
retur.
Interesting facts on c
Highlighted key points on the following concepts of C Language,I/O Functions,Bitwise operators, preincrement operator,post increment operator ,storage class,functions,Sample Code Snippets
C#.net
The document discusses C#.NET programs and various simple console applications that demonstrate basic programming concepts like input/output, conditional statements, loops, arrays, and pattern printing. It includes 10 programs that perform tasks like calculating sums, swapping values, checking odd/even, and more. It also covers 4 programs using different looping structures and 5 programs that print numeric patterns using nested loops.
UNIT-II CP DOC.docx
The document discusses various input and output functions in C programming. It describes formatted and unformatted input/output functions. Formatted functions like scanf() and printf() require format specifiers to identify the data type being read or written. Unformatted functions like getchar() and putchar() only work with character data. The document also covers control statements like if, if-else, switch case that allow conditional execution of code in C. Examples are provided to demonstrate the use of various input, output and control functions.
Similar to Create an array of size 10 Assign values to the array Print the arra.docx (20)
Write a C code to perform the following tasks In main Define an arr.pdf
Write a C code to perform the following tasks In main Define an arr.pdf
Program to print all combination of size r in an array of size n.pdf
Program to print all combination of size r in an array of size n.pdf
PROVIDE COMMENTS TO FELLOW STUDENTS ANSWERS AND PLEASE DON’T SAY G.docx
PROVIDE COMMENTS TO FELLOW STUDENTS ANSWERS AND PLEASE DON’T SAY G.docx
Computer programming subject notes. Quick easy notes for C Programming.Cheat ...
Computer programming subject notes. Quick easy notes for C Programming.Cheat ...
1sequences and sampling. Suppose we went to sample the x-axis from X.pdf
1sequences and sampling. Suppose we went to sample the x-axis from X.pdf
Modify this code to use multiple threads with the same data1.Modif.pdf
Modify this code to use multiple threads with the same data1.Modif.pdf
For this homework, you will write a program to create and manipulate.pdf
For this homework, you will write a program to create and manipulate.pdf
More from mrichard5
A rigid- well-insulated gas cylinder contains N0 moles of an ideal gas.docx
A rigid, well-insulated gas cylinder contains N0 moles of an ideal gas at a temperature To  and pressure Po. A venting valve is opened and the gas is pumped out of the tank. Derive an expression for the instantaneous temperature in the cylinder as a function of the number of moles of gas remaining in the cylinder. What is the final temperature Tf, if the tank is evacuated to Nf = 0? Is the prediction physically realistic? The heat  capacity at constant volume of the gas is independent of temperature.
Solution
PV = nRT
nT = PV/R = constant
nT = K
Tdn + ndT = 0
Tdn = - ndT
dT/dn = - T/n
dT/T = -dn/n
Integrating both sides
ln T = - ln n + C
at n=No ; T =To
so
ln To = - ln No + C
C = ln To + ln No = ln To*No
so
ln T = ln To*No - ln n
ln T = ln (To*No/n)
T = (To*No)/n
as n = Nf = 0
Twill tend to infinity...this is not practically possible
.
A soil is shaken with water and then allowed to stand- After standing-.docx
A soil is shaken with water and then allowed to stand. After standing:
the soil particles will settle out of the water
only the soluble metals will remain in the water
the insoluble metals will settle to the bottom with the soil
all of the above will occur
Solution
Option d is The correct answer that is all the above will occur as per given options.
.
a societal right- None of the above- a group right- Both A and B- an i.docx
a societal right.
None of the above.
a group right.
Both A and B.
an individual right.
Solution
1) quota , goal
2) By the end of 19th century , the supreme court was interpreting statutes and amendments in such a way that freedom for black americans were expanded
3) an individual right for owns a fire arm and may posses a gun on his person may consider his gun ownership in district of columbia.
.
A simple camera telephoto lens consists of two How far behind the conc.docx
A simple camera telephoto lens consists of two How far behind the concave lens should the film be placed? Express your answer using two significant figures concave lens with a focal length f210.1 cm The object to be photographed is 4.01 m in front of the objective lens. cm Submit Part B What is the linear magnification of this lens combination? Express your answer using two significant figures.
Solution
The image from the first (convex) lens is formed at a distance i1 from the object
1/o1 + 1/i1 = 1/f1
1/401 + 1/i1 = 1/39
i1 = 43.2 cm
This image is formed 43.2 - 36.0 = 7.2 cm behind the second lens. That becomes the virtual image of the convex lens at i2 = -7.2 cm.
The object for that image is 1/o2 + 1/i2 = -1/f2
1/o2 - 1/7.2 = -1/10.1
o2 = 25.1 cm
o2 is actually the image of the lens system (interchange object and image in the concave lens formula).
Image i1 has magnification 43.2/401 = 0.108, and the image i2 has magnification 25.1/7.2 = 3.5. Overall magnification is 0.108*3.5 = 0.378
.
A priniciple purpose of a representation letter from management is to-.docx
A priniciple purpose of a representation letter from management is to:
Solution
Management representation is a letter issued by an auditor\'s client to the auditor in writing as one of audit evidences. The date of the document must not be later than the date of audit work completion. It is used to let the client\'s management declare in writing that the financial statements and other presentations to the auditor are sufficient and appropriate and without omission of material facts to the financial statements, to the best of the management\'s knowledge. it is a form letter written by a company\'s external auditors, which is signed by senior company management.
The letter states that all of the information submitted is accurate, and that all material information has been disclosed to the auditors. The auditors use this letter as part of their audit evidence. The letter also shifts some blame to management, if it turns out that some elements of the audited financial statements do not fairly represent the financial results, condition, or cash flows of the business.
.
A process or task in Linux is represented by a Answer data structure-S.docx
Each process in Linux is represented by a task_struct data structure that contains information about the process's state. A process can be in one of five states - running, interruptible sleep, uninterruptible sleep, zombie, or stopped - which is indicated by a flag in the task_struct. The task vector stores pointers to all current task_struct structures.
Crystal clear water sports has 14-000 shares of $1 par value common st.docx
Crystal clear water sports has 14,000 shares of $1 par value common stock outstanding. Crystal Clear distributes a 10% stock dividend when the market value of its stock is $20 per share. Journalize Crystal Clear\'s declaration of the stock dividend on July 15 and distribution on July 31. What is the overall effect of the stock dividend on Crystal Clear\'s total assets? What is the overall effect on total stockholder\'s equity?
Solution
Date Account heads Debit Credit 15-Jul To record declaration of stock dividend Retained earnings (14000 * 10% = 1400 * $20) 28000 Stock dividend distributable (1400 * 1) 1400 Paid in Capital in excess of par (1400 * 19) 26600 31-Jul To record distribution of stock dividend Stock dividend distributable (1400 * 1) 1400 Common stock account 1400 2. Unlike cash dividend, stock dividend involves no distribution of assets or liabilities. So, it has no effect on the Assets or Liabilities 3. Stockholders\' equity, also called owners\' equity, is the surplus of a company\'s assets over its liabilities. Cash dividends reduce stockholders\' equity by distributing excess cash to shareholders. Stock dividends distribute additional shares to shareholders and do not affect the balance of stockholders\' equity. Net worth (Share capital + retained earnings) is not affected. It is an inter change of Numbers between the two. Equity capital balance is increased and retained earnings balance is reduced
.
Critical thinking question- what structural features (hint- there are.docx
Critical thinking question: what structural features (hint: there are four) do all ten of these opioid drugs have in common?
Opioids Opioids are a powerful class of alkaloids that act on the central nervous narcotic analgesics. All opioids presumably bind to the same mu-opioid receptor sites in the brain and spinal cord. The most prevalent naturally occurring isolated from the opium poppy-is morphine (named after Morpheus, the sod of dreams). A methoxy derivative of morphine that is also isolated from opium poppy is codeine, which is both less addictive and less effective as a reliever than morphine. By contrast, the diacetyl derivative of morphine (heroin) isanalgesic not only a more powerful as a narcotic but also more addictive than morphine Many other synthetic derivatives of morphine are opioid agonists that are used as narcotic analgesics (including oxycodone, oxymorphone, hyd system as a plant-derived nitrogenout bases that have pronounced physiologial acevity on humans the arcotic a drug dhas numbs the ngonisa molecule that combines antagonist a molecule that inhibits senses and induces stupor a druE hat with a receptor to initiate and meperidine), while others (such as methadone and buprenorphine) are used to treat opioid addiction. Naloxone is an opioid antagonist that is used to counteract opioid overdose the physiological action of anocher CHyo 0 CH, Ho* CH CH (OxyContin) (Opana) Dlaudid) (Demerol Ph N-CH3 CHa (where Ph (Butrans, Suboxone) ritical Thinking Question Phat structural features (hint: there are four) do all ten of these opioid drugs have in commom? mene ving, Contein nivonen
Solution
Common features in all the given opiod structures are -
1. Presnece of a tertiary amine group.
2. Presence of a phenyl ring.
3. At least two rings are there in all the molecules.
4.All the opioids are polar compounds.
.
Create a text file that contains ten person objects where each object.docx
Create a text file that contains ten person objects where each object is represented on a separated line with each attribute separated by a comma. Create a method that reads form the file, creates one person object per line, and stores the object in an Array List object. Write the stored objects out by last name of the console.
Solution
//Program
package person;
import java.io.FileNotFoundException;
import java.io.FileReader;
import java.util.ArrayList;
import java.util.Scanner;
//person class
class Person
{
String lastname;
String firstname;
int age;
public Person(String last, String first, int a)
{
firstname=first;
lastname=last;
age=a;
}
@Override
public String toString()
{
return (lastname+\" \"+firstname+\" \"+age);
}
}
public class PersonDemo {
public static void main(String[] args) throws FileNotFoundException {
//creating array list
ArrayList <Person> persons=new ArrayList<>();
//reading person data file
Scanner infile=new Scanner(new FileReader(\"person.txt\"));
while(infile.hasNextLine())
{
String words[]=infile.nextLine().split(\",\");
persons.add(new Person(words[0],words[1],Integer.parseInt(words[2])));
}
//display person s details
System.out.println(\"Person details: \");
for(int i=0;i<persons.size();i++)
{
System.out.println(persons.get(i).toString());
}
}
}
///////////////////////////////////////////////////////////////////
//person.txt input file
Joseph,Daniel,23
Jhon,Stephen,34
Joseph,Maria,25
Fernandez,George,67
Jaitely,Arun,29
Kumar,Narendra,50
Victor,Prince,40
George,Jincy,35
Roldan,Tinu,28
Antony,Tim,27
.
Create a polynomial function that meets the following conditions- Expl.docx
Create a polynomial function that meets the following conditions. Explain how you created your polynomial.
4. Degree 3, 2 positive real zeros, 1 negative real zero, 0 complex zeros.
Polynomial:
Solution
Polynomial may be : f(x) = -x^3 + x^2 + x - 1 Reasoning : the number of positive roots of the polynomial is either equal to the number of sign differences between consecutive nonzero coefficients. so here has two sign change(the sequence of pairs of successive signs is -+, ++, +-). So it has 2 positive roots. for negative root we change the signs of the coefficients of the terms with odd exponents, i.e., apply Descartes\' rule of signs to the polynomial f(-x), to obtain a second polynomial f(-x) = x^3 + x^2 - x - 1 it has 1 sign change so f(-x) has one positive root so f(x) has 1 negative root.
.
Create a method assuming we have a listed list- use linear search in j.docx
Create a method a ssuming we have a listed list, use linear search in java
Create a method assuming we have a listed list, use linear search in java//Linear Search in a Linked List public static void LinkedListSearch(intNode head, int key)
Solution
Since you have not specified structure of IntNode class,so I am assuming that structure of IntNode:
class IntNode{
int data;
IntNode next;
//other methods and constructors
}
public static void LinkedListSearch(IntNode head, int key){
while(head != null){
if(head.data == key){ // if found, then print message and return
System.out.println(key+\" is founded!!\");
return;
}
head = head.next;
}
System.out.println(key+ \"is not in linked list\");
}
.
Create a JAVA Program that traverses through an array recursively- rat.docx
Create a JAVA Program that traverses through an array recursively, rather than with a loop, and prints out each element in the array. Java only, this will be a short program.
Solution
public void dosomethingtoall(List list)
{
//begin recurssion dosomethingtoall(list,0);
}
private void dosomethingtoall(Last list,int index)
{
//break recurssion when to proceed entire list.
if(index>=list.size())
return;
//do what ever you want with the list.
process(list.get(index));
//recursive step.process the next element.
dosomethingtoall(list,index+1);
}
or by using traversal
import java.util.Listiterator;
import java.util.Arraylist;
public class
traverseforwordingusingListiteratorexample
{
public static void main(String args[])
{
//create an array of object list
Arraylist alist=new Arraylist();
//add elements to arraylist object
alist.add(\"1\");
alist.add(\"2\");
alist.add(\"3\");
alist.add(\"4\");
alist.add(\"5\");
//get an object of Listiterator using listiteratot()
Listiterator listiterator=alist.listiterator();
/*traverse arraylist in forward direction using hasNext and next methods of listiterator.hasNEXT Returns true if Listiterator has more elements to traverse in forwrd direction.next methid returns next element in the list*/
Sysytem.out.println(\"traversing arraylist in forward direction using Listiterator\");
while(listiterator.hasNext())
system.out.println(listiterator.next());
}
}
.
Create a Java Applet that uses two integer (int) variables x and y to.docx
Create a Java Applet that uses two integer (int) variables x and y to place the picture of four circles on the screen. Alternate the colors by setting the g.setColor method . Also, use the g.drawString to place your name above the circles.
Solution
import java.applet.*;
import java.awt.*;
public class Bullseye extends Applet {
public void paint(Graphics g) {
int appletHeight = this .getSize().height;
int appletWidth = this .getSize().width;
for ( int i=8; i >= 0; i--) {
if ((i % 2) == 0) g.setColor(Color.red);
else g.setColor(Color.white);
// Center the rectangle
int rectHeight = appletHeight*i/8;
int rectWidth = appletWidth*i/8;
int rectLeft  = appletWidth/2 - i*appletWidth/16;
int rectTop   = appletHeight/2 - i*appletHeight/16;
g.fillOval(rectLeft, rectTop, rectWidth, rectHeight);
}
}
}
.
Create a function called findChar that will return the index of where.docx
Create a function called findChar that will return the index of where a particular character is found within a CString.
Your function should take as parameters the CString to search through and a character variable to search for.
The function will return the index of where the character was first found.
If the array does not have the character in it, your function should return -1.
NOTE: Do not convert or cast the characters to int\'s to do the searching. At this point you should be able to traverse a CString.
Solution
import java.util.Scanner;
import java.io.*;
import java.lang.*;
public class FindingIndex{
public static void main(String args[]){
String [] Cstring = new String [10];
System.out.println(\"Please enter the string \");
System.out.println(\"Character to search\");
Scanner in = new Scanner(System.in);
Cstring = in.nextLine();
char c = in.nextChar();
CstringIndex(Cstring,c);
}
public static int CstringIndex(String[] Cstring2,char newchar){
for(int i=0;i<Cstring2.length();i++)
{
if(c == Cstring2[i])
{
System.out.println(\"Index of the character \"+i);
break;
}
else
{
System.out.println(\"-1\");
}
}
}
}
.
Could someone help me with this Linux system program- Using C language.docx
Could someone help me with this Linux system program. Using C language.
Write your own simple client/server set of processes. The client should use a shared memory segment to send a command message to the server. The server process should monitor the shared memory segment, and respond as follows:
\"HI\" -- The server prints \"Greetings\" to the screen.
\"PID\" -- The server prints it\'s process id to the screen.
\"QUIT\" -- The server terminates gracefully, detaching and releasing the shared memory segment.
Sample run:
Client :
Server:
HI PID QUIT
Solution
#include #include #include #include #include #include #include #include #include #include int main(int argc, char *argv[]) { int listenfd = 0, connfd = 0; struct sockaddr_in serv_addr; char sendBuff[1025]; time_t ticks; listenfd = socket(AF_INET, SOCK_STREAM, 0); memset(&serv_addr, \'0\', sizeof(serv_addr)); memset(sendBuff, \'0\', sizeof(sendBuff)); serv_addr.sin_family = AF_INET; serv_addr.sin_addr.s_addr = htonl(INADDR_ANY); serv_addr.sin_port = htons(5000); bind(listenfd, (struct sockaddr*)&serv_addr, sizeof(serv_addr)); listen(listenfd, 10); while(1) { connfd = accept(listenfd, (struct sockaddr*)NULL, NULL); ticks = time(NULL); snprintf(sendBuff, sizeof(sendBuff), \"%.24s\ \ \", ctime(&ticks)); write(connfd, sendBuff, strlen(sendBuff)); close(connfd); sleep(1); } }
.
Contrast the argument that terrorist acts are easy to predict with the.docx
Contrast the argument that terrorist acts are easy to predict with the argument that they cannot be identified or predicted. Write it 4-5 paragraph with resources(References).
Solution
By using technology it was easy to predict the terrorist acts. This is because terrorists use social media sites for communication and now-a-days there are many pattern recognization and data mining algorithms are implemented to identify the words and to predict the next action of the terrorists
reference:http://www.iflscience.com/technology/how-technology-help-predict-terrorist-attacks/
And even though advancement of technology cannot predict the terrorist act all the time, because if the terrorists are at one place then they don\'t use the internet or social media sites, so there will be no chance of prediction.
But NSA, which have access to almost every device in the world can easily predict the action of every human being in the world and there are many other security agencies like NSA also can do this thing. Majorly, technology plays an important role in identifying or predicting the action of terrorists
.
contemporary financial management What are the differences between the.docx
contemporary financial management What are the differences between the primary and secondary markets?
Solution
The difference between the primary capital market and the secondary capital market is that in the primary market, investors buy securities directly from the company issuing them, while in the secondary market, investors trade securities among themselves, and the company with the security being traded does not participate in the transaction.
.
Constants Part A By measurement you determine that sound waves are spr.docx
Constants Part A By measurement you determine that sound waves are spreading out equally in all directions from a point source and that the intensity is 2.7x10-2 W/m2 at a distance of 4.5 Im from the source What is the intensity at a distance of 3.5 m from the source? Express your answer using two significant figures W/m2 Submit Incorrect. Try Again; 6 attempts remaining Part B How much sound energy does the source emit in one hour if its power output remains constant? Express your answer using two significant figures Submit
Solution
Part A.
Intensity is given by:
I = P/A = P/(4*pi*r^2)
Since Source is same at both distance, So Power is constant, which means intensity is inversely proportional to square of distance from source.
I2/I1 = (r1/r2)^2
I2 = I1*(r1/r2)^2
I2 = 2.7*10^-2*(4.5/3.5)^2
I2 = 4.5*10^-2 W/m^2
Part B.
Power of source will be
P = I*4*pi*r^2
P = 2.7*10^-2*4*pi*4.5^2
P = 6.87 W
Now energy is given by:
E = Power*time
E = P*t
t = 1 hr = 3600 sec
E = 6.87*3600
E = 24732 J = 2.5*10^4 J
Please Upvote.
.
More from mrichard5 (18)
A rigid- well-insulated gas cylinder contains N0 moles of an ideal gas.docx
A rigid- well-insulated gas cylinder contains N0 moles of an ideal gas.docx
A soil is shaken with water and then allowed to stand- After standing-.docx
A soil is shaken with water and then allowed to stand- After standing-.docx
a societal right- None of the above- a group right- Both A and B- an i.docx
a societal right- None of the above- a group right- Both A and B- an i.docx
A simple camera telephoto lens consists of two How far behind the conc.docx
A simple camera telephoto lens consists of two How far behind the conc.docx
A priniciple purpose of a representation letter from management is to-.docx
A priniciple purpose of a representation letter from management is to-.docx
A process or task in Linux is represented by a Answer data structure-S.docx
A process or task in Linux is represented by a Answer data structure-S.docx
Crystal clear water sports has 14-000 shares of $1 par value common st.docx
Crystal clear water sports has 14-000 shares of $1 par value common st.docx
Critical thinking question- what structural features (hint- there are.docx
Critical thinking question- what structural features (hint- there are.docx
Create a text file that contains ten person objects where each object.docx
Create a text file that contains ten person objects where each object.docx
Create a polynomial function that meets the following conditions- Expl.docx
Create a polynomial function that meets the following conditions- Expl.docx
Create a method assuming we have a listed list- use linear search in j.docx
Create a method assuming we have a listed list- use linear search in j.docx
Create a JAVA Program that traverses through an array recursively- rat.docx
Create a JAVA Program that traverses through an array recursively- rat.docx
Create a Java Applet that uses two integer (int) variables x and y to.docx
Create a Java Applet that uses two integer (int) variables x and y to.docx
Create a function called findChar that will return the index of where.docx
Create a function called findChar that will return the index of where.docx
Could someone help me with this Linux system program- Using C language.docx
Could someone help me with this Linux system program- Using C language.docx
Contrast the argument that terrorist acts are easy to predict with the.docx
Contrast the argument that terrorist acts are easy to predict with the.docx
contemporary financial management What are the differences between the.docx
contemporary financial management What are the differences between the.docx
Constants Part A By measurement you determine that sound waves are spr.docx
Constants Part A By measurement you determine that sound waves are spr.docx
Recently uploaded
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.
How to Create a More Engaging and Human Online Learning Experience
How to Create a More Engaging and Human Online Learning Experience Wahiba Chair Training & Consulting
Wahiba Chair's Talk at the 2024 Learning Ideas Conference. How to Fix the Import Error in the Odoo 17
An import error occurs when a program fails to import a module or library, disrupting its execution. In languages like Python, this issue arises when the specified module cannot be found or accessed, hindering the program's functionality. Resolving import errors is crucial for maintaining smooth software operation and uninterrupted development processes.
BÀI TẬP BỔ TRỢ TIẾNG ANH LỚP 9 CẢ NĂM - GLOBAL SUCCESS - NĂM HỌC 2024-2025 - ...
BÀI TẬP BỔ TRỢ TIẾNG ANH LỚP 9 CẢ NĂM - GLOBAL SUCCESS - NĂM HỌC 2024-2025 - ...Nguyen Thanh Tu Collection
https://app.box.com/s/tacvl9ekroe9hqupdnjruiypvm9rdaneSouth African Journal of Science: Writing with integrity workshop (2024)
South African Journal of Science: Writing with integrity workshop (2024)Academy of Science of South Africa
A workshop hosted by the South African Journal of Science aimed at postgraduate students and early career researchers with little or no experience in writing and publishing journal articles.How to Add Chatter in the odoo 17 ERP Module
In Odoo, the chatter is like a chat tool that helps you work together on records. You can leave notes and track things, making it easier to talk with your team and partners. Inside chatter, all communication history, activity, and changes will be displayed.
Chapter 4 - Islamic Financial Institutions in Malaysia.pptx
Chapter 4 - Islamic Financial Institutions in Malaysia.pptxMohd Adib Abd Muin, Senior Lecturer at Universiti Utara Malaysia
This slide is special for master students (MIBS & MIFB) in UUM. Also useful for readers who are interested in the topic of contemporary Islamic banking.
clinical examination of hip joint (1).pdf
described clinical examination all orthopeadic conditions .
PCOS corelations and management through Ayurveda.
This presentation includes basic of PCOS their pathology and treatment and also Ayurveda correlation of PCOS and Ayurvedic line of treatment mentioned in classics.
How to deliver Powerpoint Presentations.pptx
"How to make and deliver dynamic presentations by making it more interactive to captivate your audience attention"
BÀI TẬP BỔ TRỢ TIẾNG ANH 8 CẢ NĂM - GLOBAL SUCCESS - NĂM HỌC 2023-2024 (CÓ FI...
BÀI TẬP BỔ TRỢ TIẾNG ANH 8 CẢ NĂM - GLOBAL SUCCESS - NĂM HỌC 2023-2024 (CÓ FI...Nguyen Thanh Tu Collection
https://app.box.com/s/y977uz6bpd3af4qsebv7r9b7s21935vdBBR 2024 Summer Sessions Interview Training
Qualitative research interview training by Professor Katrina Pritchard and Dr Helen Williams
Pollock and Snow "DEIA in the Scholarly Landscape, Session One: Setting Expec...
Pollock and Snow "DEIA in the Scholarly Landscape, Session One: Setting Expec...National Information Standards Organization (NISO)
This presentation was provided by Steph Pollock of The American Psychological Association’s Journals Program, and Damita Snow, of The American Society of Civil Engineers (ASCE), for the initial session of NISO's 2024 Training Series "DEIA in the Scholarly Landscape." Session One: 'Setting Expectations: a DEIA Primer,' was held June 6, 2024.Reimagining Your Library Space: How to Increase the Vibes in Your Library No ...
Librarians are leading the way in creating future-ready citizens – now we need to update our spaces to match. In this session, attendees will get inspiration for transforming their library spaces. You’ll learn how to survey students and patrons, create a focus group, and use design thinking to brainstorm ideas for your space. We’ll discuss budget friendly ways to change your space as well as how to find funding. No matter where you’re at, you’ll find ideas for reimagining your space in this session.
Your Skill Boost Masterclass: Strategies for Effective Upskilling
Your Skill Boost Masterclass: Strategies for Effective UpskillingExcellence Foundation for South Sudan
Strategies for Effective Upskilling is a presentation by Chinwendu Peace in a Your Skill Boost Masterclass organisation by the Excellence Foundation for South Sudan on 08th and 09th June 2024 from 1 PM to 3 PM on each day.Recently uploaded (20)
How to Create a More Engaging and Human Online Learning Experience
How to Create a More Engaging and Human Online Learning Experience
BÀI TẬP BỔ TRỢ TIẾNG ANH LỚP 9 CẢ NĂM - GLOBAL SUCCESS - NĂM HỌC 2024-2025 - ...
BÀI TẬP BỔ TRỢ TIẾNG ANH LỚP 9 CẢ NĂM - GLOBAL SUCCESS - NĂM HỌC 2024-2025 - ...
South African Journal of Science: Writing with integrity workshop (2024)
South African Journal of Science: Writing with integrity workshop (2024)
Chapter 4 - Islamic Financial Institutions in Malaysia.pptx
Chapter 4 - Islamic Financial Institutions in Malaysia.pptx
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...
Liberal Approach to the Study of Indian Politics.pdf
Liberal Approach to the Study of Indian Politics.pdf
Pollock and Snow "DEIA in the Scholarly Landscape, Session One: Setting Expec...
Pollock and Snow "DEIA in the Scholarly Landscape, Session One: Setting Expec...
Reimagining Your Library Space: How to Increase the Vibes in Your Library No ...
Reimagining Your Library Space: How to Increase the Vibes in Your Library No ...
Your Skill Boost Masterclass: Strategies for Effective Upskilling
Your Skill Boost Masterclass: Strategies for Effective Upskilling
Create an array of size 10 Assign values to the array Print the arra.docx
- 1. Create an array of size 10 Assign values to the array Print the array Swap the first and last elements in the array Print the array Shift all elements by one to the right Print the array Replace even elements with 0 Replace each element except the first and last by the larger of its two neighbors Print the array Solution /*Program to replace EVEN elements by 0 and ODD elements by 1.*/ #include <stdio.h> /** funtion : readArray() input : arr ( array of integer ), size to read ONE-D integer array from standard input device (keyboard). **/ void readArray(int arr[], int size) { int i =0; printf(" Enter elements : "); for(i=0; i < size; i++) { printf("Enter arr[%d] : ",i); scanf("%d",&arr[i]); } } /** funtion : printArray() input : arr ( array of integer ), size to display ONE-D integer array on standard output device (moniter). **/ void printArray(int arr[], int size) { int i =0; printf(" Elements are : ");
- 2. for(i=0; i < size; i++) { printf(" tarr[%d] : %d",i,arr[i]); } printf(" "); } /** funtion : replaceEvenOdd() input : arr ( array of integer ), size to replace EVEN elements by 0 and ODD elements by 1. **/ void replaceEvenOdd(int arr[], int size) { int i=0; for(i=0; i < size; i++) { if( arr[i] % 2 == 0 ) arr[i] = 0 ; else arr[i] = i; } } int main() { int arr[10]; readArray(arr,10); printf(" Before replacement : "); printArray(arr,10); replaceEvenOdd(arr,10); printf(" After replacement : "); printArray(arr,10); return 0; }