All categories

2 years ago

Which features should a study schedule include? Check all that apply.

Computers and Technology

2 answers:

Ivenika [448]2 years ago

7 0

Answer: time of day, duration, due dates

Explanation: I am awsome

ankoles [38]2 years ago

3 0

Answer:

classes

due dates

duration

time of day

Explanation:

got it on edgenuity

You might be interested in

How efficient would a 6-bit code be in asynchronous transmission if it had 1 parity bit, 1 start bit, and 2 stop bits?

Lana71 [14]

How efficient well if we are transmitting 6bits and we need 10 to transmit the 6 bits that would be 6/10 = .6 = 60% efficient.

7 0

2 years ago

Mile markers appear as _____ green signs.

german

Answer:

A.Big,Rectangular

Explanation:

mile markers are sign on high ways they are green signs they are big and rectangular shape

6 0

2 years ago

Read 2 more answers

You are consulting for a trucking company that does a large amount ofbusiness shipping packages between New York and Boston. The

likoan [24]

Answer:

Answer explained with detail below

Explanation:

Consider the solution given by the greedy algorithm as a sequence of packages, here represented by indexes: 1, 2, 3, ... n. Each package i has a weight, w_i, and an assigned truck t_i. { t_i } is a non-decreasing sequence (as the k'th truck is sent out before anything is placed on the k+1'th truck). If t_n = m, that means our solution takes m trucks to send out the n packages.

If the greedy solution is non-optimal, then there exists another solution { t'_i }, with the same constraints, s.t. t'_n = m' < t_n = m.

Consider the optimal solution that matches the greedy solution as long as possible, so \for all i < k, t_i = t'_i, and t_k != t'_k.

t_k != t'_k => Either

1) t_k = 1 + t'_k

i.e. the greedy solution switched trucks before the optimal solution.

But the greedy solution only switches trucks when the current truck is full. Since t_i = t'_i i < k, the contents of the current truck after adding the k - 1'th package are identical for the greedy and the optimal solutions.

So, if the greedy solution switched trucks, that means that the truck couldn't fit the k'th package, so the optimal solution must switch trucks as well.

So this situation cannot arise.

2) t'_k = 1 + t_k

i.e. the optimal solution switches trucks before the greedy solution.

Construct the sequence { t"_i } s.t.

t"_i = t_i, i <= k

t"_k = t'_i, i > k

This is the same as the optimal solution, except package k has been moved from truck t'_k to truck (t'_k - 1). Truck t'_k cannot be overpacked, since it has one less packages than it did in the optimal solution, and truck (t'_k - 1)

cannot be overpacked, since it has no more packages than it did in the greedy solution.

So { t"_i } must be a valid solution. If k = n, then we may have decreased the number of trucks required, which is a contradiction of the optimality of { t'_i }. Otherwise, we did not increase the number of trucks, so we created an optimal solution that matches { t_i } longer than { t'_i } does, which is a contradiction of the definition of { t'_i }.

So the greedy solution must be optimal.

6 0

2 years ago

In computing, a(n) _____ is an attack on an information system that takes advantage of a particular system vulnerability. Select

tensa zangetsu [6.8K]

Answer: d) Exploit

Explanation: Exploit is a type computer attack that successful when the computer system of an user is vulnerable and attacker can do the exploitation. This happens due to the weakness of the system, applications software, network etc.

Other given option are incorrect because exit door,glitch and bad are not any type of attack in the computer field that causes harm to the system.Thus the correct option is option(d).

4 0

2 years ago

You have several pictures of different sizes that you would like to frame.A local picture framing store offers two types of fram

exis [7]

Answer:

written in java

Note : Package name was excluded

import java.util.Scanner;

public class Main {

public static void main(String[] args) {

//declared 8 uninitialised variable

String input;

double cost, colorC, frameC, paperC, glassC, crownC;

char crowns;

int type, color, crown, length, width, area, perimeter;

//creating an instance of the Scanner class to accept value from user

Scanner scanner = new Scanner(System.in);

System.out.print("Enter length of frame: ");

length = scanner.nextInt();

System.out.print("Enter width of frame: ");

width = scanner.nextInt();

System.out.print("Do you want a fancy frame or a regular frame\nEnter 1 for fancy, 2 for regular: ");

type = scanner.nextInt();

if (type == 1) {

frameC = 0.25;

} else {

frameC = 0.15;

}

System.out.print("Do you want a white frame or a colored frame\nEnter 1 for white, 2 for colored: ");

color = scanner.nextInt();

if (color == 2) {

colorC = .10;

} else{

colorC = 0;

}

System.out.print("Do you want crowns \nEnter y for yes, n for no ");

input = scanner.next();

crowns = input.charAt(0);

if (crowns == 'y' || crowns == 'Y') {

System.out.print("How many crowns?");

crown = scanner.nextInt();

} else

crown = 0;

if (crown > 0)

crownC = crown * .35;

else

crownC = 0;

area = length * width;

perimeter = length * 2 + width * 2;

paperC = area * .02;

glassC = area * .07;

cost = glassC + paperC + crownC + colorC * perimeter + frameC * perimeter;

System.out.println("The cost of your frame is: $" + cost);

}

5 0

2 years ago