All categories

3 years ago

Help! I’ll mark you brainly! Please help me.

Computers and Technology

1 answer:

nika2105 [10]3 years ago

4 0

Answer:

11. There are four main alignments: left, right, center, and justified

12. Symmetrical balance occurs when equal weights are on equal sides of a composition, balanced around a fulcrum or axis in the center.

13. Asymmetrical balance results from unequal visual weight on each side of the composition.

14. White space

15. Most modern TVs are 16:9, which causes letterboxing when viewing 21:9 content, and pillarboxing when viewing 4:3 content such as older films or TV broadcasts, unless the content is cropped or stretched to fill the entire display. The Napoléon (1927 film) was released in 4:1 aspect ratio.

16. ??? im sorry idk

17. The Rule of Thirds is the process of dividing an image into thirds, using two horizontal and two vertical lines.

Explanation:

You might be interested in

Given the variables full_admission_price and discount_amount (already defined), write an expression corresponding to the price o

stiks02 [169]

Answer:

if full_admission_price = f and discount_amount = d

=> Price of a discount admission = d/f

total_weight

quantity

weight of one item = total_weight/quantity

for i in range(80, 18, -2):

print(i, end=' ')

Explanation:

The first two questions are just mathematical to get a single quantity given some relationship. So, its basically division

For the python code, I used the python's range function which takes in three arguments. The first one is the starting value, the second one is the terminating value which is the number before the terminating value and the last one specifies the common difference popularly known as step in the language. Since the step is 2, only even numbers are printed out. In the print function, I made use of the end keyword specifying a space (' ') as the end. This ensures that the print is done in the same line with a space seperating them. Without that specification, each result will printed in a newline

7 0

3 years ago

What is the function of a slide transition in a presentation program? A. It enables you to change the presentation layouts. B. I

Lelechka [254]

The answer would be

C. It adds visual effects when you move from one slide to another.

Hope this has helped you! :)

5 0

3 years ago

Read 2 more answers

Advatages and disadvantages of power-concentrated train

allochka39001 [22]

Answer:

1. Safety:

2. Cheap:

3. Increases Employment:

4. Bulk Quantity:

The Disadvantages of Rail Transport are as Follows:

1. Loss of Goods:

2. Unsafe for Fragile Items:

3. Late Bookings:

4. Unsuitable for Short Distances:

5. Unsuitable for Rural Areas:

Explanation:1. Safety:

Transportation by the means of railway ensures safety for the desired goods because unlike the road transports a train only stops at a desired station instead of the will of the driver. In case of road transports for example, the drivers can at any point of time decide to rest or stop for tea, refreshments, lunch or dinner.

2. Cheap:

Railway transport any day is cheaper as compared to air transport. As a matter of fact, railway transport is even cheaper than road transport because of the reason that goods in bulk quantities are carried from a desired destination to the other. In cases of road transport for instance, less goods as compared to road transport can be carried.

3. Increases Employment:

Railway transport helps people to carry cheap products from a place to another and sell them at high prices. As a result of this, a number of people who are unemployed find a source of their daily bread.

4. Bulk Quantity:

ADVERTISEMENTS:

Because railway transportation is cheaper as compared to air and road transport, goods can be carried in bulk quantities as a result of which a lot of time is saved.

It is true that as compared to air transport and road transport, rail transport is easier and cheaper but still it has a few disadvantages.

The Disadvantages of Rail Transport are as Follows:

1. Loss of Goods:

Because goods in bulk quantities are carried chances of goods getting lost are high in case of railway transport as compared to air and road transport.

2. Unsafe for Fragile Items:

Railway transportation is particularly unsafe for carrying fragile items like glass because these items can easily break at times when a train halts unexpectedly of when the train is speeding up at times.

3. Late Bookings:

ADVERTISEMENTS:

Because railway is the cheapest medium of transport, it is hard to find suitable bookings for the transportation of your goods. Railway transport is not suitable in cases of emergency.

4. Unsuitable for Short Distances:

Railway transport is unsuitable for carrying goods at shorter distances; road transport is most suitable in this case.

5. Unsuitable for Rural Areas:

Proper railway system is not build up in the Indian villages as a result of which railway transport is unsuitable in the villages of India. Whatever be the disadvantages of railway transport it was, it is and it will always be the safest and the best means for the transportation of goods.

5 0

3 years ago

Which of the following is a trend that began during the Vietnam War and continued with the Internet?

Blizzard [7]

<span>As far as I remember, this one - a. a move toward stricter control of mass-media communications by Congress and the FCC </span><span>is a trend that began during the Vietnam War and continued with the Internet.</span>

7 0

3 years ago

What are the major differences between searching and sorting in Java? What are some of the differences in the techniques used in

Studentka2010 [4]

Answer:

Searching is a technique to look for an item or target value in a data structure like searching for a phone number in a directory.Data structure can be an array,List etc. Searching algorithms are used for searching. Most common examples are Linear Search and Binary Search. Lets take the example Linear Search in order to explain it using JAVA. Its the simplest searching algorithm. To search for a specific element, look at each element in the data structure sequentially and check if it matches with the element being searched for.

Sorting is a technique of arranging the elements in a specific order e.g. numerical sorting, ordering students according to their exam score. This order can be ascending or descending or alphabetical order. Contrary to search it returns the data structure e.g. an array in which the elements of array are sorted in a particular order. Sorting algorithms are used to sort elements in a data structure. Some common examples of sorting algorithms are Bubble Sort, Insertion Sort, Selection Sort, Merge Sort, Quick Sort, Heap Sort etc. JAVA uses Array.Sort() built-in function for sorting an array. By default it sorts the input array in ascending order.

Selection Sort: It is a sorting technique which divides an array into two subarrays. One subarray in the left is sorted and the other one at right is unsorted. This is an in-place algorithm. It is not a good option for large data. Initially the sorted part is empty and all elements are placed in unsorted array. First the element which is the smallest in the unsorted array is selected and swapped with the leftmost array element and becomes part of the sorted array. In each iteration the smallest element from the unsorted array is selected and moved to sorted part of the array.The worst case time complexity of this algorithm is O(n)^2 as we have to find the smallest for every element in the array.

Merge Sort: It is a comparison based algorithm. It works on divide and conquer technique. It uses recursion approach for sorting. This means it breaks the problem(lets say array list to be sorted) into sub problems (smaller parts) and then solves (in this case sorts) each sub problem in a recursive manner. At the end it merges the solutions (hence the merged sorted array). Although selection sort works faster when data set is small merge sort outperforms it for larger data sets. Merge sort is a stable algorithm and works best for linked lists. Its not an in place algorithm. Time complexity of merge sort is O(n*log n) for best, average and worst cases because it always divides the array in two parts and takes linear time to merge these part. O(n(logn)) time complexity makes it better,more efficient and faster to sort large data sets.

Big Oh O notation is an asymptotic annotation written as O(n) which is a mathematical way to represent the upper bound of the running time of algorithm (sorting algorithm in this case). It computes the worst case time complexity. Worst case time complexity means that the longest amount of time or maximum number of operations that will be required for a sorting algorithm to complete. The time complexity mostly gets affected as the size of the input varies.
For example lets find out the worst-case time complexity of Bubble Sort for a list of n elements. Worst case is when the array is reversed sorted. At first iteration it would make n-1 comparisons. At iteration 1, for n-2 times and so total comparison will be O(n^)2. So the time to run program is proportional to the square of the input size.

Searching algorithms are used when there is a need to find a specific data item from bulk of data item. Searching algorithms make this hectic process easier. For example you want to find phone number of person from directory. without searching algorithm looking for each phone number in the directory manually can be very time consuming. For example you have to find address of a customer number 254 from database to deliver a product. Instead of manually looking for customer numbers you can simply use linear search algorithm that will start from customer 1 and sequentially searches for specific customer 254 number and provides the address in a shorter time.
Sorting reduces complexity of problems e.g reducing the searching complexity. It is easier to locate data elements in a sorted list than unsorted. For example comparing two large data sets containing millions of records. If both the data sets are ordered, the comparison gets easier. Moreover every sorting algorithm has certain usage. Like merge sort is useful for linked lists,heap sort is good with arrays and uses less memory. If data is small with large values, selections sort is better for this. It doesn’t require any additional space. Databases use merge sort to arrange data that is too large to be loaded completely into memory. Heap sort is used in reading bar codes on plastic cards. Quick sort is used to maintain sports score on the basis of win-loss ratio.

5 0

3 years ago