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
Lena [83]
2 years ago
15

Select the correct answer from the drop-down menu. Olivia composed a layout with the image below for a seasonal greeting card. W

hich layout principle is significant in this image? Alignment is very prominent in the image of the umbrellas. The other principle is *blank*
options:
balance
repetition
emphasis

Computers and Technology
1 answer:
amid [387]2 years ago
6 0

Answer:

repetition

Explanation:

the umbrellas are repeated

You might be interested in
With "read" function, which one of the following statements is NOT correct? a.If the read is successful, the number of bytes rea
worty [1.4K]

Answer:

a. If the read is successful, the number of bytes read is returned.

b. If the end of file is encountered, 0 is returned.

Explanation:

A read function is one of the functions used in computer programming. A read function is used to read an information or data that was written before into a file.

If any portion of a regular file before to the end of file has not been written and the end of file is encountered the read function will return the bytes with value 0.

If read function has read some data successfully, it returns the number of bytes it read.

3 0
2 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
Define file manager
Mama L [17]

Answer:

A file manager or file browser is a computer program that provides a user interface to manage files and folders.

3 0
3 years ago
Which of the following describes the IP address of a router to which packets destined for a remote network should be sent by def
Elena-2011 [213]

The term that describes the IP address of a router to which packets destined for a remote network should be sent by default is the a gateway of last resort.

<h3>What is 'Gateway Of Last Resort'? </h3>

A Gateway of Last Resort is known to be the Default gateway and this is said to be a route that is known to be often used by the router if no other known route is seen to transmit the IP packet.

Note that Known routes are seen in the routing table. but, any route not known by the routing table is said or known to be forwarded to the default route.

Hence the primary function of a router is so that it can forward packets toward a given destination.

Therefore, The term that describes the IP address of a router to which packets destined for a remote network should be sent by default is the a gateway of last resort.

Learn more about IP address from

brainly.com/question/24930846

#SPJ1

3 0
1 year ago
1. Changing from a major to a minor key signature in a composition can have what effect?
Amanda [17]

1. Answer A.

2. Answer. C.

3. singing.

4.?

5. I believe it would be B! The Melody!

Stand back and look at it in the eyes of someone that's not as music savvy - the thing that truly makes you relax and turn to bliss - is the melody. You tend to focus on it, listen for it.

I hope all is well, and you pass! Good luck, rockstar! (:



3 0
3 years ago
Other questions:
  • "So far this month you have achieved $100.00 in sales, which is 50% of your total monthly goal. With only 5 more workdays this m
    8·2 answers
  • How does coding work on computers?
    6·1 answer
  • What type of form control is typically used for displaying text or numbers?
    8·2 answers
  • In java Define a method printFeetInchShort, with int parameters numFeet and numInches, that prints using ' and " shorthand. Ex:
    7·1 answer
  • What are the characteristics of good blogs?
    8·1 answer
  • Software that was designed to serve the needs of a specific company or organization is called:
    11·1 answer
  • 1. Select the Volatile Memory *
    8·1 answer
  • Write code which takes a user input of a String and an integer. The code should print each letter of the String the number of ti
    15·2 answers
  • What does the top level domain in a url inducate? A. The organization or company that owns the website. B. The organization or c
    6·2 answers
  • A field value is currently not in any group. what happens when you try adding it to an existing group?
    15·1 answer
Add answer
Login
Not registered? Fast signup
Signup
Login Signup
Ask question!