Services such as water, electricity, and phone communications are called:

Suppose you are consulting for a bank that's concerned about fraud detection, and they come to you with the following problem. T

iren [92.7K]

Answer:

Explanation:

( n cards are there initially )

we pick out the first card in random it takes n-1 comparisons to figure out

its Equivalence card - n-1 steps

Two cards have been eliminated ( this leaves us with 2 and n-2 cards)

we pick out the 2nd card in random it takes n-3 comparisons to figure out

its Equivalence card - n-3 steps

we continue to do this.. till all cards are exhausted ( leaves us with 2

and n-4 cards again)

the last comparison will

have

- n-(n-3)

the sum of all these steps - (n-1) + (n-3) + (n-5) + .........+

(n-(n-3))

if you draw this in the form of a tree.

n - n

2

n-2 - n

2

n-4 - n-2

2

n-6 - n-4

2

n-8 - n- 6

the height of the tree will be log n , sum @ each level is at most n

8 0

2 years ago

**NEED HELP??!! Computer Science Questions!! KNOWING GIMP!!!!

Svetlanka [38]

<span>1. If my memory serves me well, the answer is true. Free select tool is also called lasso and it’s used to free-hand selection. You can also combine free select tool segments with polygonal segments or other shapes.

2. I think this statement is definitely “False”. As I’ve mentioned before you can combine free selection with other selection features like polygonal by using anchors.

3. I’m not 100% sure, but I guess this one is true. As far as I remember, add to selection mode lets you to add new selection to any existing areas. So I think it’s possible to add selection to the existing one.

4. I think this one is also true. But it allows you just paint it, but it’s also kinda modification. Quick Mask allows you to isolate subject and paint selected object. It helps you not to brush subject accidentally. It’s a very useful tool as for me.

5. Yes, this statement is 100% true. But it could be gray for GIMP, because the mask is coded in gray tones, but I think that black is also gray tone. Color black or gray removes part of selection, and color white adds area to existing selection.

6. According to what I’ve mentioned before this one is also true, so there’s no need for additional explanation.

7. Another tool, similar to the Lasso/Free Select tool is the B) Scissors Tool. As there was mentioned intelligent scissors tool is almost the same as lasso but more user-friendly.

8. It’s false. You must click to the first point of your selection to finish the process or you will lose your selection.

9. I think this one is true. Paths tool includes two or more line segments connected by handle points. These points are kinda anchors I guess.

10. After making a selection using the Paths Tool, I must select the the D) Selection from Path button to turn my path into a selection. You can find it in path tool options.

11. Yes, it’s true, it allows you to make complex selections with curved or straight lines. Just drag one of the anchors to curve the line. Also you can create different geometrical figures with this tool.

12. Yes this is true. But there are much more cool blur filters than only Gaussian blur. Experiment on your own.

13. You can do all of the following given above. Every layer is kinda isolated image and you can modify it however you want.
<span>
14. I’m definitely sure that this statement is true. Just find layer drop down menu and follow the instructions given in this question. It’s simple.</span></span>

8 0

3 years ago

"Write a program that calculates the balance of a savings account at the end of a period of time. It should ask the user for the

Akimi4 [234]

Answer:

#include <iostream>

#include <fstream>

using namespace std;

int main() {

// Definitions

double annualInterest; // The annual interest rate

double balance; // The account balance

int months; // Total number of months

double totalDeposit = 0.0; // Total deposited value

double totalWithdraw = 0.0; // Total withdrawn value

double earnedInterest= 0.0; // The earned amount

double deposited; // Monthly deposited value

double withdrawn; // Monthly withdrawn value

// Get the initial required data.

cout<<"Please enter the annual interest rate,\n";

cout<<" Interest rate: ";

cin >>annualInterest;

cout<<"--------------------------------------------\n";

cout<<"Please enter the starting balance,\n";

do{

cout<<"[the number could not be negative]\n";

cout<<"Starting Balance: ";

cin >>balance;

}while(balance<0);

cout<<"--------------------------------------------\n";

cout<<"Please enter the number of months,\n";

do{

cout<<"[the number could not be less than 0]\n";

cout<<"Number of months: ";

cin >>months;

}while(months<0);

// Iterated Loop to get all the months data.

for(int month=1; month <= months; month++){

// Get the deposited value during that month.

cout<<"Enter the deposited value during month "

<<month<<",\n";

do{

cout<<"[the value could not be less than 0]\n";

cout<<" Deposited value: ";

cin >>deposited;

}while(deposited<0);

totalDeposit += deposited;

balance += deposited;

// Get the withdrawn value during that month.

cout<<"Enter the withdrawn value during month "

<<month<<",\n";

do{

cout<<"[the value could not be less than 0]\n";

cout<<" Withdrawn value: ";

cin >>withdrawn;

}while(withdrawn<0);

totalWithdraw += withdrawn;

balance -= withdrawn;

// Negative balance close the program.

if(balance < 0){

cout<<"Sorry, the account has been closed due to\n";

cout<<"the negative balance.\n";

break;

// Calculate value due to the interest rate.

}

else {

earnedInterest += (annualInterest/12) * balance;

// monthly interest rate

balance += (annualInterest/12) * balance;

}

// Display the statistics,

ofstream file;

file.open ("Report written to Report.txt");

file << "Report written to Report.txt\n";

file.close();

cout<<"The ending balance: "<<balance<<std::endl;

cout<<" Total deposited: "<< totalDeposit<<std::endl;

cout<<" Total withdrawals: "<< totalWithdraw<<std::endl;

cout<<" Earned interest: "<< earnedInterest<<std::endl;

cout<<"============================================\n";

return 0;

}

6 0

3 years ago

The vast amount of data collected from Internet searches, social media posts, customer transactions, military

Brums [2.3K]

Answer:

A. Big Data

Explanation:

It is big data. The internet searches, customer transactions, social media posts, medical tests, weather sensors, military surveillance, and all the data source you are seeing around yourself forms together with the big data. And a big social media company gathers around so many petabytes of data each day. And there are so many such companies, plus all sorts like eLearning sites, etc. And all these together form the big data.

3 0

3 years ago

Show the array that results from the following sequence of key insertions using a hashing system under the given conditions: 5,

sergejj [24]

Answer:

a) Linear probing is one of the hashing technique in which we insert values into the hash table indexes based on hash value.

Hash value of key can be calculated as :

H(key) = key % size ;

Here H(key) is the index where the value of key is stored in hash table.

----------

Given,

Keys to be inserted are : 5 , 205, 406,5205, 8205 ,307

and size of the array : 100.

First key to be inserted is : 5

So, H(5) = 5%100 = 5,

So, key 5 is inserted at 5th index of hash table.

-----

Next key to inserted is : 205

So, H(205) = 205%100 = 5 (here collision happens)

Recompute hash value as follows:

H(key) =(key+i) % size here i= 1,2,3...

So, H(205) =( 205+1)%100 = 206%100 = 6

So, key 205 is inserted in the 6th index of the hash table.

----------

Next Key to be inserted : 406

H(406) = 406%100 = 6(collision occurs)

H(406) =(406+1) %100 = 407%100 = 7

So, the value 406 is inserted in 7the index of the hash table.

-----------------

Next key : 5205

H(5205) = 5205%100 = 5(collision)

So, H(5205) = (5205+1)%100 = 6( again collision)

So, H(5205) = 5205+2)%100 = 7(again collision)

So, H(5205) = (5205+3)%100 = 8 ( no collision)

So, value 5205 is inserted at 8th index of the hash table.

-------------

Similarly 8205 is inserted at 9th index of the hash table because , we have collisions from 5th to 8th indexes.

-------------

Next key value is : 307

H(307) = 307%100 = 7(collision)

So, (307+3)%100 = 310%100 = 10(no collision)

So, 307 is inserted at 10th index of the hash table.

So, hash table will look like this:

Key index

5 5

205 6

406 7

5205 8

8205 9

307 10

b) Quadratic probing:

Quadratic probing is also similar to linear probing but the difference is in collision resolution. In linear probing in case of collision we use : H(key) = (key+i)%size but here we use H(key) =( key+i^2)%size.

Applying Quadratic probing on above keys:.

First key to be inserted : 5.

5 will go to index 5 of the hash table.

-------

Next key = 205 .

H(205) = 205%100 = 5(collision)

So. H(key)= (205+1^2)%100 = 6(no collision)

So, 205 is inserted into 6th index of the hash table.

--------

Next key to be inserted 406:

So, 406 %100 = 6 (collision)

(406+1^2)%100 = 7(no collision)

So, 406 is moved to 7th index of the hash table.

----------

Next key is : 5205

So, 5205%100 = 5 (collision)

So, (5205+1^2)%100 = 6 ( again collision)

So, (5205+2^2)%100 = 9 ( no collision)

So, 5205 inserted into 9th index of hash table.

-----------

Next key is 8205:

Here collision happens at 5the , 6the , 9th indexes,

So H(8205) = (8205+4^2)%100 = 8221%100 = 21

So, value 8205 is inserted in 21st index of hash table.

--------

Next value is 307.

Here there is collision at 7the index.

So, H(307) = (307+1^2)%100 = 308%100= 8.

So, 307 is inserted at 8the index of the hash table.

Key Index

5 5

205 6

406 7

5205 9

8205 21

307 8

3 0

3 years ago