Which of the following filenames is acceptable on both Windows and Mac<br> operating systems?

_______ allows you to add formatting such as shapes and colors to text.

Svetach [21]

Worddesign allows you to add formatting such as shapes and colours to text

7 0

3 years ago

How do I connect my CSS file and HTML page together? it's just not wanting to work for me. I have 3 other HTML pages that have t

kotegsom [21]

Hey I wasn't able to replicate your css loading issue using most of the code you provided

In general you have the *.htm files/pages with <html> and <body> tags like you have and the link which references the same file (so just copy that part and it should work for all files)

There are possibly 4 issues which might still exist:
1) the css&htm files are not in the same folder, so the file isn't found
2) the browser cached an old version off the css file which was empty -> try cleaning the browser cache
3) you have many errors in your html which might confuse/break the browser
3.1) you have multiple html and body tags in one file, keep it to only <html><head/><body><stuff></body></html> per file
3.2) your list of many links has links inside of links
3.3) your links in the list of many links has a style tag as the href for the inner link, use class="menulinks" instead and then style it in the css with .menulinks{...}
3.4) the open tag of the inner links is not closed before the text content starts (<em>|FAQ</em> and so on )
3.5) in theory the order of the closing of tags is wrong for the inner links (but fixed if you remove the previously mentioned wrong style tag)
you open a->a->style->em and close em->a->a->style so style should be before the 2 closing </a> tags
3.6) in general you should indent everything, makes everything much clearer, also windows notepad isn't really the best in supporting you to write stuff like that
you might want to consider other editors like notepad++ which are free to download and highlght the syntax for you, have autocomplete and help with the indention and closing tags
4) make sure you have saved the changes and that they aren't there yet (try flashy colors like red or something else obvious)

Also it is easier to help when one has access to the code and doesn't have to retype important parts, copy&pasting it into the question would help, but brainly doesn't really support code so it's not nice and brainly might even reformat it a bit
websites like pastebin or for webdevelopment jsfiddle are useful, but really anything would help even if not intended for that purpose, like a viewable google doc link

I suggest you try fixing the issues from above and if it still doesn't work share the code in some (hopefully better) way

4 0

3 years ago

In ____, data can move in both directions at the same time, such as with a telephone.

gtnhenbr [62]

The answer is d. full-duplex transmission. This communication setup allows for simultaneous transmit and receive for both parties. As signals are able to be transmitted at the same time two way for both parties, for both directions along the same data carrier medium.

4 0

2 years ago

How to solve level 53 on rapid router?

alexgriva [62]

<img src=/static/game/image/actions/go.svg alt=' + ugettext(play= button)= += '= style=width: 4%;> ) def noPermissionMessage():

6 0

1 year ago

Professor Midas drives an automobile from Newark to Reno along Interstate 80. His carâ€™s gas tank, when full, holds enough gas

zmey [24]

Answer:

The GREEDY Algorithm

Explanation:

Based on the situation given in question, the Greedy algorithm shall give the optimal solution to professor

Suppose that the cities are at locations0 =x0< x1< . . . < x

We shall use the induction method to prove that G is the optimal solution valid for numbers less than n

We assume another solution Z which we initially consider to be optimum as well, based on that when Z fills the tank, it fills it to full level

Let us state the values in case of n intervals. Given below, we say that g1 is the first stop and z1 is also the first stop.

This can be written as ;

G=g1, g2, . . . , gk

Z=z1, z2, . . . , zk’

Here k’ <= k and k < n

Let I be an idex where for the first time gi is not equal to zi

Considering t= maxi Zi

Z′=g1, z2, z3, . . . , zk′

Now since z2, z3, . . . , zk′ should be an optimal stopping pattern for the problem otherwise we have chosen Z, with smaller gas filling (not feasible)

Using induction hypothesis we conclude thatg2, . . . , gk is an optimal stopping pattern, which is based on greedy algorithm

7 0

3 years ago

Which of the following filenames is acceptable on both Windows and Mac operating systems?