All categories

3 years ago

What Type of diploma do you need in order To the get into JMU

1 answer:

3 0

I think a high school diploma should be fine but look more into it on the website https://www.jmu.edu/registrar/students/diploma_main.shtml

You might be interested in

Two vehicles arrive at an uncontrolled intersection from different streets at the same time 1.The driver on the right must yield

ss7ja [257]

3. Both vehicles must stop

4 0

3 years ago

Describe each occupation

vitfil [10]

Answer:

Carpenter — A carpenter is someone who works with wood. They build houses and make cabinets etc.

Logging — Loggers are people who cut trees. They use strong chain saws to cut trees.

Shipwrights — Shipwrights build, design, and repair all sizes of boats.

Wood Machinist — Wood Machinists repair and cut timber or any kind of wood for construction projects. They also operate woodworking machines, as their name suggest.

Furniture finishers — Furniture finishers shape, decorate, and restore damaged and worn out furniture.

5 0

2 years ago

Hằng số phổ biến chất khí

drek231 [11]

Answer:

Business activities may broadly be classified into two categories namely (A) Industry and (B) Commerce. Industry involves production of goods and services whereas commerce is concerned with the distribution of goods and services.

Explanation:

hope helps

7 0

3 years ago

(40 points) Program the following sorting algorithms: InsertionSort, MergeSort, and QuickSort. There are 9 test les uploaded for

babunello [35]

Answer:

Explanation:

MERGE SORT

#include<stdlib.h>

#include<stdio.h>

#include<string.h>

void merge(int arr[], int l, int m, int r)

{

int i, j, k;

int n1 = m - l + 1;

int n2 = r - m;

int L[n1], R[n2];

for (i = 0; i < n1; i++)

L[i] = arr[l + i];

for (j = 0; j < n2; j++)

R[j] = arr[m + 1+ j];

i = 0;

j = 0;

k = l;

while (i < n1 && j < n2)

{

if (L[i] <= R[j])

{

arr[k] = L[i];

i++;

}

else

{

arr[k] = R[j];

j++;

}

k++;

}

while (i < n1)

{

arr[k] = L[i];

i++;

k++;

}

while (j < n2)

{

arr[k] = R[j];

j++;

k++;

}

void mergeSort(int arr[], int l, int r)

{

if (l < r)

{

int m = l+(r-l)/2;

mergeSort(arr, l, m);

mergeSort(arr, m+1, r);

merge(arr, l, m, r);

}

void printArray(int A[], int size)

{

int i;

for (i=0; i < size; i++)

printf("%d ", A[i]);

printf("\n");

}

int main()

{

int arr[1000] = {0};

int arr_size =0;

int data;

char file1[20];

strcpy(file1,"data.txt");

FILE *fp;

fp = fopen(file1,"r+");

if (fp == NULL) // if file not opened return error

{

perror("Unable to open file");

return -1;

}

else

{

fscanf (fp, "%d", &data);

arr[arr_size]=data;

arr_size++;

while (!feof (fp))

{

fscanf (fp, "%d", &data);

arr[arr_size]=data;

arr_size++;

}

printf("Given array is \n");

printArray(arr, arr_size);

mergeSort(arr, 0, arr_size - 1);

printf("\nSorted array Using MERGE SORT is \n");

printArray(arr, arr_size);

return 0;

}

3 0

3 years ago

Express (118)10 and (-49)10 in 8-bit binary one’s complement form and then add the numbers. What would be the representation (-0

stealth61 [152]

Answer:

$118_{10}= 0110111$ 2) $-49_{10}=110001_{2}$ 3) $0_{10}=0:16 \Rightarrow 0_{10}=0_{16}$

Explanation:

1) Expressing the Division as the summation of the quotient and the remainder

for

118, knowing it is originally a decimal form:

118:2=59 +(0), 59/2 =29 + 1, 29/2=14+1, 14/2=7+0, 7/2=3+1, 3/2=1+1, 1/2=0+1

$118_{10}= 0110111$

2) $-49_{10}$

Similarly, we'll start the process with the absolute value of -49 since we want the positive value of it. Then let's start the successive divisions till zero.

|-49|=49

49:2=24+1, 24:2=12+0,12:2=6+0,6:2=3+0,3:2=1+1,1:2=0+1

100011

$-49_{10}=110001_{2}$

3) $(-0)_{10}$

The first step on that is dividing by 16, and then dividing their quotient again by 16, so on and adding their remainders. Simply put:

$(-0)_{10}=0:16=0 \Rightarrow (0)_{10}=0_{16} \:or\\(0)_{16}=0000000000000000$

5 0

3 years ago