1answer.
Ask question
Login Signup
Ask question
All categories
  • English
  • Mathematics
  • Social Studies
  • Business
  • History
  • Health
  • Geography
  • Biology
  • Physics
  • Chemistry
  • Computers and Technology
  • Arts
  • World Languages
  • Spanish
  • French
  • German
  • Advanced Placement (AP)
  • SAT
  • Medicine
  • Law
  • Engineering
kirza4 [7]
4 years ago
10

If a user cut a section from a photograph where is the cut sections location

Computers and Technology
1 answer:
madreJ [45]4 years ago
6 0

I would answer, but there isn't enough information to answer for. .

You might be interested in
Which type of server and network topology is preferable in a bank?
Mariana [72]

Answer:

1. Database

2. Tree

<u>Database</u>

An organized collection of data, that is stored form different computer system is called Database.

<u>Tree Topology</u>

A type of network in which multiple computers are connected in a tree like structure. This type of network topology is used to organize data in database.

<u>Explanation</u>

In banks database servers are used to organize and store large volumes of financial data.

<em>To organize such type of data with the help increasing number of employs on database, tree topology is used to connect all computers of that bank on the network,</em>

3 0
4 years ago
G Q1: What is RIP? Why is a routing protocol needed? Use the Answer Sheet to submit your answer
Lady_Fox [76]

Answer:

The answer is below

Explanation:

RIP in computer networking is an acronym that defines Routing Information Protocol. This Routine Information Protocol is utilized by routers to carry out the flow of routing information on a designated network.

Routing Protocol or Routing Information Protocol is needed because of the following:

1.  To finally pick the most beneficial means to route data on a given network

2.  To guide against routing loops.

5 0
4 years ago
Create union integer with members char c, short s, int i and long b. Write a program that inputs the values of type char, short,
Tom [10]

Answer:

The updated program in C is as follows:

#include <stdio.h>

union myUnion{ char c; short s; int i; long l; };

int main(){

   union myUnion inputs;

   printf("Character: ");    scanf("%c", &inputs.c);

   printf("Output: %c", inputs.c);

   printf("\nShort: ");    scanf("%hd", &inputs.s);

   printf("Short: %hd", inputs.s);

   printf("\nInteger: ");    scanf("%d", &inputs.i);

   printf("Output: %d", inputs.i);

   printf("\nLong: ");    scanf("%ld", &inputs.l);

   printf("Long: %ld", inputs.l);

   return 0;

   }

The pseudocode is as follows:

Function union myUnion {

character; short; int; long

}

main() {

myUnion inputs;

Input inputs.c;  Print inputs.c

Input inputs.s; Print inputs.s

Input inputs.i; Print inputs.i;

Input inputs.l; Print inputs.l

}

Explanation:

This defines the union function

<em>union myUnion{ char c; short s; int i; long l; };</em>

The main begins here

int main(){

This calls the union function to main

   union myUnion inputs;

This prompts and gets input for character variable

   printf("Character: ");    scanf("%c", &inputs.c);

This prints the character input

   printf("Output: %c", inputs.c);

This prompts and gets input for short variable

   printf("\nShort: ");    scanf("%hd", &inputs.s);

This prints the short input

   printf("Short: %hd", inputs.s);

This prompts and gets input for integer variable

   printf("\nInteger: ");    scanf("%d", &inputs.i);

This prints the integer input

   printf("Output: %d", inputs.i);

This prompts and gets input for long variable

   printf("\nLong: ");    scanf("%ld", &inputs.l);

This prints the long input

   printf("Long: %ld", inputs.l);

   return 0;

   }

5 0
3 years ago
Define a class named Doctor whose objects are records for a clinic’s doctors. Derive this class from the class Person given in L
pashok25 [27]

Answer:

Following is defined the required class having accessor methods and test program:

Explanation:

class Person

{

private String doc_name;

public Person(String doc_name)

{

this.doc_name = doc_name;

}

public String getDoc_Name()

{

return doc_name;

}

}

class Doctor extends Person

{

private double office_visit_fee;

private String Specialty;

public Doctor(String doc_name,double office_visit_fee,String Specialty)

{

super(doc_name);

this.office_visit_fee = office_visit_fee;

this.Specialty = Specialty;

}

//accessor methods

public double getOffice_Visit_Fee()

{

return office_visit_fee;

}

public String getSpecialty()

{

return Specialty;

}

public String toString()

{

return "Doctor Name "+getDoc_Name()+" Office Visit Fee :$"+office_visit_fee+

" Specialty : "+Specialty;

}

}

class Test

{

public static void main (String[] args)

{

 Doctor dctr = new Doctor("Joseph Lister",134.56,"Obstetrician");

 System.out.println(dctr);

}

}

Output:

Doctor Name Joseph Lister Office Visit Fee :$134.56 Speciality : Obstetrician

6 0
3 years ago
A computing company is running a set of processes every day. Each process has its own start time and finish time, during which i
Helga [31]

Answer:

Above all else, let us show that this issue has the greedy choice property.

This implies that worldwide ideal arrangement can be gotten by choosing local ideal arrangements. Presently notice the following:

The global optimal solution of the issue requests us to track down the minimum number of times process_check module should be run.

It is likewise referenced that during each running interaction, process_check module should be called atleast once. Along these lines, the minimum possible number of process_check calls happens when process_check is made close to the quantity of the processes that are run.

Along these lines, we see that the global optimal solution is shaped by choosing optimal answer for the nearby advances.

Along these lines, the issue shows greedy choice property. Thus, we can utilize a greedy algorithm for this issue.

The greedy step in this calculation is to postpone the process_check as far as might be feasible. Thus, it should be run towards the finish of each interaction. So the following algorithm can be utilized:

Sort the cycles by utilizing the completion times.

Towards the finish of the 1st process in the arranged list, run the process_check module. Right now any process that is now running is removed the arranged rundown. The main interaction is additionally removed from the sorted list.

Now repeat stage 2, till all processes are finished.

In the above mentioned algorithm, the costliest advance is the step of sorting. By utilizing the optimal sorting algorithm, for example, merge sort, we can achieve it in O(n log n) asymptotic time.

Along these lines, this greedy algorithm additionally takes O(n log n) asymptotic time complexity.

5 0
3 years ago
Other questions:
  • A ________ is a collection of computers connected to one another or to a common connection medium.
    12·2 answers
  • The article begins with the author mentioning the need to find something from “three years ago”. How long do you see yourself sa
    7·1 answer
  • 25 POINTS! Complete each sentence to describe the Excel interface.
    12·2 answers
  • Refer to the method f:
    6·1 answer
  • The early success of Microsoft was cemented by the release of which software product:
    12·1 answer
  • Files containing ____ are available from a variety of sources.
    10·1 answer
  • Two things every professional PowerPoint presentation should have
    8·1 answer
  • arjun ahs joined a work teams that assembles products what is the best way for arjun to build the teams trust in him
    9·1 answer
  • How am i supposed to add subtitles to a video without have to waist money???
    7·1 answer
  • what is the name of the program that enables the device and operating system to communicate with each other?
    7·1 answer
Add answer
Login
Not registered? Fast signup
Signup
Login Signup
Ask question!