Match the following internet related terms to their definition
Answer:
1st buble goes to web address 2nd goes to browser 3rd goes to chat 4th goes to email
Explanation:
Question #3
Multiple Choice
Which statement is true?
O A collection is a type of deque.
O A list is a type of deque.
O A deque is a type of list.
O Adeque is a type of collection.
Answer:
D. A deque i a type of collection
Explanation:
I do computer science too ;3
Drag the tiles to the correct boxes to complete the palrs.
Match the types of letters with their descriptions.
letter of interest
cover letter
thank you letter
letter of recommendation
discusses how you meet job requirements
>
reiterates why you're the best candidate for the job
>
tells more about your character and who you are
expresses your interest in working for a company
Answer:
Letter of interest> tells you more about your character and who you are expresses your interest in working for a company
Letter of recommendation> reiterates why you're the best candidate for the job
Cover letter> discusses how you meet job requirements
Hope this helped!
Answer:
Discusses how you meet job requirements = Cover Letter
Expresses your interest in working for a company = Letter of Interest
Tells more about your character and who you are = Letter of Recommendation
Reiterates why you're the best candidate for the job = Thank You Letter
FELLING GENEROUS GIVING AWAY POINTS:)
Who plays Lol btw (league of legends)
ADD me ign : Davidoxkiller (euw server)
Answer:
thanksssssssss
An algorithm whose worst-case time complexity is bounded above by a polynomial function of its size is called a(n)
Answer:
polynomial-bounded algorithms
Explanation:
There are two algorithm complexities and they are time and space complexities. They can be denoted with the big-O notation. The big-o notation for a time and space complexity gets the worst-case time and space respectively.
The time complexity gets the measure of the execution time of an algorithm. When the time function is a polynomial ( k^n + k^n-1 ...) then the algorithm is said to be a polynomial-bounded algorithm.
To prevent long page load times for pages containing images, it is best to use a compressed file format such as JPG, as well as appropriate image dimensions and
resolution.
magnification.
orientation.
colors.
Answer:
The answer to this question is given below in the explanation section.
Explanation:
The given options to this question are:
resolution. magnification. orientation. colors.The correct option to this question is 1. i.e.
Resolution.
The resolution of an image determines how many pixels per inch an image contains. Image having a higher resolution takes long page load times for a page and lower resolution takes less page load time. So, to prevent long page load times for pages containing images, it is best to use compressed file formation as well as appropriate image dimension and resolution.
While other options are not correct because:
Magnification, orientation, and color does not affect the page load time. Page load time for images only affected by the dimension and resolution of the images.
Answer:
B C E
A web page is taking too long to load. It contains only a small amount of text and two images. Choose all items that represent possible causes.
large font size
images do not use a compressed format like JPG
image resolution too high
image resolution too low
image dimensions too large