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
pentagon [3]
3 years ago
13

a machine needs a minimum of 100 sec to sort 1000 names by quicksort what is the approximate worst case time needed to sort 100

names
Computers and Technology
1 answer:
alexira [117]3 years ago
4 0

Answer:

6.7seconds

Explanation:

You might be interested in
A computer with a single cpu has 4gb ram, with the operating system taking up 512mb and each user program also taking up 256mb.
lutik1710 [3]

Let's assume a condition where ram is 256 MB and the program size is more than 256 MB

in that case, CPU has to wait for I/O to load the remaining part of the program..in this case  

CPU utilization is much poorer.

So adding gives benefit only when your CPU is fast enough to take advantage like if a process waiting for I/O

it can put the current process in the run queue and take another process from the ready queue.

This way a better CPU utilization can be achieved.  

So by adding ram we can load more programs while waiting for I/O . CPU utilisation will be better.

here by adding 2GB ram we can load 2048/256 = 8 new process into ram at the same time.

2. if cpu have to execute the cpu bound process that wait for I/O cpu will be idle most of the time while  

waiting for I/O to be done..this way CPU utilization will be  poorer as compare to earlier.

3 0
3 years ago
Jjhb ft fv tuning Denise l Debbie
Vitek1552 [10]
What








What the debbie



7 0
3 years ago
Once a virus has been removed by your anti-virus program, all traces of it are gone from your computer.
pychu [463]
Im pretty sure that is false
5 0
3 years ago
Which printing method transfers the ink from a metal plate to a rubber blanket?
gizmo_the_mogwai [7]

Answer:

B. Offset printer is the correct answer

7 0
3 years ago
What is a collision in a hash table?
Maru [420]

Answer: Collision is defined as the event that takes place when the clash appear due to the information persisting the same hash value get in contact. This mechanism occurring in the hash table is called collision and is dependent on the type of application.

Collision becomes difficult to be avoided in a large set of the hash table as the data set is difficult to be found while in small hash table it is still detectable but cannot be avoided completely.

7 0
3 years ago
Other questions:
  • Categorize the following relationships into generalization, aggregation, or association. Beware, there may be n-ary associations
    14·1 answer
  • Suppose you have a 12-hour clock on a very fancy chair (noon is 12 PM and midnight is 12 AM). Write a C++ program that reads in
    7·1 answer
  • Two of the goals of community mobilization are getting the community interested and
    6·1 answer
  • Which is the most common drive letter where Windows stores most data and programs? A. A B. B C. C D. E
    12·2 answers
  • Select the correct answer,
    14·1 answer
  • E-mail messages, instant messages (IMs), or text messages sent and/or received within an organization a. are not included on a r
    9·1 answer
  • What is the possible output from system.out.println((int)math.random() * 4)?
    8·1 answer
  • A water park will let a visitor on a ride if they are 48 or more inches tall OR they are 14 years old or older. WILL MARK BRAINL
    5·1 answer
  • The following statements regarding centralized administration concepts are presented to you in an interview in which only one of
    5·1 answer
  • What are two reasons why a switch port would have a status of errdisable? (choose two. )
    14·1 answer
Add answer
Login
Not registered? Fast signup
Signup
Login Signup
Ask question!