:(.

Write a program that gets a list of integers from input, and outputs the integers in ascending order (lowest to highest). The fi

Travka [436]

Answer:

Explanation:

Since no programming language is stated, I'll use Microsoft Visual C# in answering this question.

// C# program sort an array in ascending order

using System;

class SortingArray {

int n; //number of array elements

int [] numbers; //Array declaration

public static void Main() {

n = Convert.ToInt32(Console.ReadLine());

numbers = new int[n];

for(int i = 0; i<n; I++)

{

numbers [n] = Convert.ToInt32(Console.ReadLine());

}

SortArray();

foreach(int value in numbers)

{

Console.Write(value + " ");

}

void SortArray()

{

int temp;

// traverse 0 to array length

for (int i = 0; i < numbers.Length - 1; i++)

// traverse i+1 to array length

for (int j = i + 1; j < numbers.Length; j++){

// compare array element with all next element

if (numbers[i] < numbers[j])

{

temp = numbers[i];

numbers[i] = numbers[j];

numbers[j] = temp;

}

5 0

3 years ago

- Consider the relation R = {A, B, C, D, E, F, G, H, I, J} and the set of functional dependencies F = { {B, C} -> {D}, {B} -&

Olenka [21]

Answer:

The key of R is {A, B}

Explanation:

A key can be seen as a minimal set of attributes whose closure includes all the attributes in R.

Given that the closure of {A, B}, {A, B}+ = R, one key of R is {A, B} But in this case, it is the only key.

In order for us to to normalize R intuitively into 2NF then 3NF, we have to make use of these approaches;

First thing we do is to identify partial dependencies that violate 2NF. These are attributes that are

functionally dependent on either parts of the key, {A} or {B}, alone.

We can calculate

the closures {A}+ and {B}+ to determine partially dependent attributes:

{A}+ = {A, D, E, I, J}. Hence {A} -> {D, E, I, J} ({A} -> {A} is a trivial dependency)

{B}+ = {B, F, G, H}, hence {A} -> {F, G, H} ({B} -> {B} is a trivial dependency)

To normalize into 2NF, we remove the attributes that are functionally dependent on

part of the key (A or B) from R and place them in separate relations R1 and R2,

along with the part of the key they depend on (A or B), which are copied into each of

these relations but also remains in the original relation, which we call R3 below:

R1 = {A, D, E, I, J}, R2 = {B, F, G, H}, R3 = {A, B, C}

The new keys for R1, R2, R3 are underlined. Next, we look for transitive

dependencies in R1, R2, R3. The relation R1 has the transitive dependency {A} ->

{D} -> {I, J}, so we remove the transitively dependent attributes {I, J} from R1 into a

relation R11 and copy the attribute D they are dependent on into R11. The remaining

attributes are kept in a relation R12. Hence, R1 is decomposed into R11 and R12 as

follows: R11 = {D, I, J}, R12 = {A, D, E} The relation R2 is similarly decomposed into R21 and R22 based on the transitive

dependency {B} -> {F} -> {G, H}:

R2 = {F, G, H}, R2 = {B, F}

The final set of relations in 3NF are {R11, R12, R21, R22, R3}

4 0

3 years ago

Create a Card class that represents a playing card. It should have an int instance variable named rank and a char variable named

Helen [10]

Answer:

Explanation:

The following code is written in Java. It creates the Card class and then uses it to create a full house and print out the rank and suit of every card in that hand.

class Card {

int rank;

char suit;

public Card(int rank, char suit) {

this.rank = rank;

this.suit = suit;

}

public int getRank() {

return rank;

}

public char getSuit() {

return suit;

}

class CardTester {

public static void main(String[] args) {

Card card1 = new Card(3, '♥');

Card card2 = new Card(3, '♠');

Card card3 = new Card(3, '♦');

Card card4 = new Card(2, '♦');

Card card5 = new Card(2, '♣');

System.out.println("Card 1: " + card1.getRank() + " of " + card1.getSuit());

System.out.println("Card 2: " + card2.getRank() + " of " + card2.getSuit());

System.out.println("Card 3: " + card3.getRank() + " of " + card3.getSuit());

System.out.println("Card 4: " + card4.getRank() + " of " + card4.getSuit());

System.out.println("Card 5: " + card5.getRank() + " of " + card5.getSuit());

}

3 0

3 years ago

What are voter purges

diamong [38]

Answer:

Voter registration lists, also called voter rolls, are the gateway to voting because a citizen typically cannot cast a vote that will count unless his or her name appears on the voter registration rolls. State and local officials regularly remove—or purge—citizens from voter rolls. In fact, 39 states and the District of Columbiareported purging more than 13 million voters from registration rolls between 2004 and 2006.

Explanation:

7 0

3 years ago

What was the strategy the company adopted for ERP implementation?

SashulF [63]

Answer:

Big Bang or Phased Approach – ERP Implementation strategies include Big Bang, Phased, Hybrid, and Parallel Adoption. Each organization requirements are different and as such, the project management method is itself evolving using PPM, SCRUM, and DevOps.

8 0

2 years ago