Answer:
b. The names in the list should be in alphabetical order.
Explanation:
A binary search is an algorithm used for searching for an item in a list or array. The algorithm first sorts the data structure into order and then divides it into halves. If the searched item is less than the middle item in the list, then the algorithm searches for the target in the first half, else, in the second half. This reduces the time complexity of the search.
Answer
The best approach to handling the expectation of privacy by employees in the event an investigation needs to be carried out on company-owned digital assets:-<u>A well-defined published policy that clearly states that an employer has the right to examine, inspect or access company-owned assets.</u>
Answer:
Pretty sure it's assests.
Explanation:
Income - Intake of money.
Budget - How much money you can spend.
Finances - Things you need to pay ort fund.
Answer:
Disadvantage of having too many features in a language is that:
- There are many functions with same name but perform different function or task so it will create an issue or problem.
- Features do not duplicate one another as, there are different possible syntax for the same meaning.
- In a mathematical function, sometimes user function and mathematical variable name collide with language base features so it will create problem.
Answer:
Here is the program for the given question
Explanation:
class StringSet
{
ArrayList<String> arraylist; //a reference variable of ArrayList of generic type String
//A no argument constructor.
public StringSet()
{
arraylist=new ArrayList<String>(); //instantiating the ArrayList object
}
//A mutator that adds a String newStr to the StringSet object.
void add(String newStr)
{
arraylist.add(newStr); // add(String) method to add string to the arraylist
}
//An accessor that returns the number of String objects that have been added to this StringSet object.
int size()
{
return arraylist.size(); // size() method which gives the number of elements in the list
}
//An accessor that returns the total number of characters in all of the Strings that have been added to this StringSet object.
int numChars()
{
int sum = 0;
for(String str:arraylist) //for-each loop; can be read as for each string in arraylist
{
sum+=str.length();
}
return sum;
}
//An accessor that returns the number of Strings in the StringSet object that have exactly len characters.
int countStrings(int len)
{
int count = 0;
for(String str:arraylist)
{
if(str.length() == len)
count++;
}
return count;
}
}
