Answer:
Following up on Stefan's repsonse, this means that first, from the Insert tab you need to insert a line or shape. Once you've inserted something, select it and the contextual tab DRAWING TOOLS - FORMAT will appear.
Explanation:
Bytes, metadata, storage, documents are what come to mind without know the specifics. Sorry, Hope this helps.
Answer:
The solution code is written in Python 3
- def findStr(stringList, c):
- output = []
- for currentStr in stringList:
- if c not in currentStr.lower():
- output.append(currentStr)
- return output
-
- strList = ["Apple", "Banana", "Grape", "Orange", "Watermelon"]
- print(findStr(strList, "g"))
Explanation:
Firstly, we can create a function and name it as findStr which takes two input parameters stringList and a character, c (Line 1).
Create a list that will hold the list of strings that do not contain the input character (Line 2).
Create a for-loop to traverse through each string in the list (Line 3).
In the loop, check if the input character is not found in the current string (Line 4), if so, add the current string to the output list (Line 5). Please note we also need to convert the current string to lowercase as this program should ignore the casing.
After completion the loop, return the output list (Line 7).
We can test the function using a sample string list and input character "g" (Line 9 - 10). We shall get the output as follows:
['Apple', 'Banana', 'Watermelon']
Answer:
Answered below
Explanation:
//Program is written using Java programming language.
Class Person {
private string firstName;
private string lastName;
void set firstName(string a){
firstName = a;
}
string getFirstName(){
return firstName;
}
void setLastname( string b){
lastName = b;
}
string getLastName( ){
return lastName;
}
void displayDetails( ) {
System.out.print(firstName);
System.out.print (lastName);
}
}
//Test program
Class Main{
public static void main(String args [] ){
Person person = new Person( )
person.setFirstName("Karen")
System.out.print(person.getFirstName)
person.displayDetails()
}
}
Answer:
Since we are using three disk allocation strategies,continuous linked and indexed,therof to process and read allocation strategies we need 99830 disk blocks.
