Answer:
String word = "George slew the dragon";
int pos = word.indexOf("dr");
String drWord = word.substring(pos, pos+4);
System.out.println(drWord);
Explanation:
Assuming dr is always there, we don't have to check the validity of 'pos'. Normally, you would!
Answer:
The solution code is written in Python 3:
- def modifyList(listNumber):
- posCount = 0
- negCount = 0
-
- for x in listNumber:
- if x > 0:
- posCount += 1
- else:
- negCount += 1
-
- if(posCount == len(listNumber)):
- listNumber.append(max(listNumber))
-
- if(negCount == len(listNumber)):
- listNumber.append(min(listNumber))
-
- print(listNumber)
-
- modifyList([-1,-99,-81])
- modifyList([1,99,8])
- modifyList([-1,99,-81])
Explanation:
The key step to solve this problem is to define two variables, posCount and negCount, to track the number of positive value and negative value from the input list (Line 2 - 3).
To track the posCount and negCount, we can traverse through the for-loop and create if else statement to check if the current number x is bigger than 0 then increment posCount by 1 otherwise increment negCount (Line 5- 9).
If all number in the list are positive, the posCount should be equal to the length of the input list and the same rule is applied to negCount. If one of them happens, the listNumber will append either the maximum number (Line 11 -12) or append the minimum number (Line 14-15).
If both posCount and negCount are not equal to the list length, the block of code Line 11 -15 will be skipped.
At last we can print the listNumber (Line 17).
If we test our function using the three sets of input list, we shall get the following results:
[-1, -99, -81, -99]
[1, 99, 8, 99]
[-1, 99, -81]
Explanation:
By reducing the time the use on unnecessary tasks. And you would be able to operate on using your time on beneficial tasks
Answer:
// Program is written in C++ Programming Language
// Comments are used for explanatory purpose
// Program starts here
#include<iostream>
using namespace std;
int main()
{
// Declare integer variable n which serves as the quotient.
int n;
// Prompt to enter any number
cout<<"Enter any integer number: ";
cin>>n;
// Check for divisors using the iteration below
for(int I = 1; I<= n; I++)
{
// Check if current digit is a valid divisor
if(n%I == 0)
{
// Print all divisors
cout<<I<<" ";
}
}
return 0;
}
B, Parallel ports are faster than serial ports.
A parallel port can move a set of 8 bits at a time on eight different wires, it uses a 25 pin connector, called a DB-25 connector, whereas a serial port only has a DB-9 connector.