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
ratelena [41]
3 years ago
9

Normally you depend on the JVM to perform garbage collection automatically. However, you can explicitly use ________ to request

garbage collection.
Computers and Technology
1 answer:
Naddik [55]3 years ago
7 0

Answer:

System.gc()

Explanation:

System.gc() can be defined as the method which can be used to effectively request for garbage collection because they runs the garbage collector, which in turn enables JMV which is fully known as JAVA VIRTUAL MACHINE to claim back the already unused memory space of the objects that was discarded for quick reuse of the memory space , although Java virtual machine often perform garbage collection automatically.

You might be interested in
Characteristics of a cohesive group include all of the following EXCEPT: a. ​support b. a lack of bonding c. mutuality within th
Brilliant_brown [7]

Answer:

Option B i.e., a lack of bonding is the correct answer.

Explanation:

Cohesion is defined as the ability to work in a group, so many time the following situation or problems that are lack of bonding occurs between the mates or the group members because while they achieving their goals there is the understanding problem may occur between them or sometime their ideas should be a mismatch.

4 0
4 years ago
Choose the term that completes the sentence.
klio [65]

Answer: BUBBLE SORT

I hope I've been helpful to you.

6 0
3 years ago
Read 2 more answers
Heeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeelp pt.3
Luda [366]

Answer:

i guess option 1

5 0
3 years ago
Write a C++ program that reads from the standard input and counts the number of times each word is seen. A word is a number of n
Rufina [12.5K]

Answer:

#include <stdio.h>

#include <string.h>

#include <ctype.h>

 

struct detail

{

   char word[20];

   int freq;

};

 

int update(struct detail [], const char [], int);

 

int main()

{

   struct detail s[10];

   char string[100], unit[20], c;

   int i = 0, freq = 0, j = 0, count = 0, num = 0;

 

   for (i = 0; i < 10; i++)

   {

      s[i].freq = 0;

   }

   printf("Enter string: ");

   i = 0;

   do

   {

       fflush(stdin);

       c = getchar();

       string[i++] = c;

 

   } while (c != '\n');

   string[i - 1] = '\0';

   printf("The string entered is: %s\n", string);

   for (i = 0; i < strlen(string); i++)

   {

       while (i < strlen(string) && string[i] != ' ' && isalnum(string[i]))

       {

           unit[j++] = string[i++];

       }

       if (j != 0)

       {

           unit[j] = '\0';

           count = update(s, unit, count);

           j = 0;

       }

   }

 

   printf("*****************\nWord\tFrequency\n*****************\n");

   for (i = 0; i < count; i++)

   {

       printf("%s\t   %d\n", s[i].word, s[i].freq);

       if (s[i].freq > 1)

       {

           num++;

       }

   }

   printf("The number of repeated words are %d.\n", num);

 

   return 0;

}

 

int update(struct detail s[], const char unit[], int count)

{

   int i;

 

   for (i = 0; i < count; i++)

   {

       if (strcmp(s[i].word, unit) == 0)

       {

           s[i].freq++;

 

           return count;

       }

   }

   /*If control reaches here, it means no match found in struct*/

   strcpy(s[count].word, unit);

   s[count].freq++;

 

   /*count represents the number of fields updated in array s*/

   return (count + 1);

}

4 0
3 years ago
What is the maximum number of edges for an undirected graph? A directed graph?
siniylev [52]

Answer:

For undirected graph n(n-1) for directed graph \frac{n(n-1)}{2}

Explanation:

The maximum number of edges for a undirected graph is given by n(n-1), where n is number of vertices

The maximum number of edges in directed graph is given by \frac{n(n-1)}{2}, where n is number of vertices

The maximum number of edges is greater in undirected graph than directed graph

5 0
4 years ago
Other questions:
  • Which of the following statements about Java Class Libraries is false: a. Java class libraries consist of classes that consist o
    9·1 answer
  • The IT person most involved with system development is the _________
    14·1 answer
  • Sending a employee an email with important criticism represents a problem which communication process
    9·1 answer
  • You have compiled a new kernel using rpm. when you reboot, the new kernel is not the default selection on the boot menu. you use
    10·1 answer
  • Select the correct answer. Steve wants to change shooting and exposure settings while on his photo shoot. Which camera part will
    7·2 answers
  • I am sorting data that is stored over a network connection. Based on the properties of that connection, it is extremely expensiv
    14·1 answer
  • Where is the "delete account" button in my profile? And please give me a legit answer and not just a word.
    10·2 answers
  • Write a program that accepts a positive integer N as command-line argument, and outputs True if N is the square of some integer,
    13·1 answer
  • a term to describe article that can be displayed in their entirety as opposed to abstract and reference only?​
    10·1 answer
  • 30 POINTS FOR THE CORRECT ANSWERS
    12·1 answer
Add answer
Login
Not registered? Fast signup
Signup
Login Signup
Ask question!