All categories

3 years ago

What do you think is the most fascinating aspect of the internet?

1 answer:

7 0

I think the most fascinating aspect of the internet is the information it produces. You can access information on different topics from the comfort of your own home, office or anywhere else. Think of a world without the internet. A world without the internet will loose a lot of it's people daily. The reason is because, imagine if there is a tsunami coming. Because there is no internet, many people will not know the weather forecast. The only people that will hear about the tsunami are those that work with satellite networks. So then, what will happen? A country can have it's people wiped out, and have only satellite network workers left. What if there are only two satellite network workers and they can't have kids. So that country will be wiped out because of the fact that they didn't have access to information. Hope i helped.

You might be interested in

Consider an array inarr containing atleast two non-zero unique positive integers. Identify and print, outnum, the number of uniq

Delvig [45]

Answer:

Program.java

import java.util.Scanner;

public class Program {

public static boolean isPalindrome(String str){

int start = 0, end = str.length()-1;

while (start < end){

if(str.charAt(start) != str.charAt(end)){

return false;

}

start++;

end--;

}

return true;

}

public static int countPalindromePairs(String[] inarr){

int count = 0;

for(int i=0; i<inarr.length; i++){

for(int j=i+1; j<inarr.length; j++){

StringBuilder sb = new StringBuilder();

sb.append(inarr[i]).append(inarr[j]);

if(isPalindrome(sb.toString())){

count++;

}

return count == 0 ? -1 : count;

}

public static void main(String[] args) {

Scanner sc = new Scanner(System.in);

String line = sc.next();

String[] inarr = line.split(",");

int count = countPalindromePairs(inarr);

System.out.println("RESULT: "+count);

}

Explanation:

OUTPUT:

3 0

3 years ago

A Python data model defining the state of a game for Tic-Tac-Toe. You must fully describe the notion of a state of the game, lim

Artist 52 [7]

Answer:

Check the explanation

Explanation:

Here in this game of Tic-Tac-Toe, it is using the TPGE engine which is a Tiny Python Game Engine. Let's talk about its functions like:-

def image_type(img): In this function, it is simply taking image as a parameter and returning its object type like DISC if the image is in graphical form, TEXT if it is a string, and LINE if it is other than the mentioned object.

def convert_image(img): In this function, it is simply taking image as a parameter and returning an equivalent graphical object as understood by John Zelle's. Mainly comparing for three things in this function and those are: if image equals to DISC then it is calling convert_circle(function), if image equals to LINE then it is calling convert_line(function), and if image equals to TEXT then it is calling convert_text(function),

def convert_circle(x): This function takes a list( a group of values) and makes a circle at the center of the window and the circle's radius is coming from the list.

convert_text, convert_line, convert_circle are only creating text, line, and circle and then returning it.

def graphical_elements(images): This function is taking image as a parameter and then extracting shape and color from the image and then calling convert_image(shape) and convert_type(shape) and it gives us graphic and kind respectively. Now it is checking whether kind equals to DISC If yes then filling color on the window else, setting the outline of the window

def run(): Here it is finally running the game with required parameters, the whole game is continously running under the while loop.

That's all

8 0

3 years ago

A contiguous subsequence of a list S is a subsequence made up of consecutive elements of S. For example, if S is 5,15,-30,10,-5,

Sindrei [870]

Answer:

We made use of the dynamic programming method to solve a linear-time algorithm which is given below in the explanation section.

Explanation:

Solution

(1) By making use of the dynamic programming, we can solve the problem in linear time.

Now,

We consider a linear number of sub-problems, each of which can be solved using previously solved sub-problems in constant time, this giving a running time of O(n)

Let G[t] represent the sum of a maximum sum contiguous sub-sequence ending exactly at index t

Thus, given that:

G[t+1] = max{G[t] + A[t+1] ,A[t+1] } (for all 1<=t<= n-1)

Then,

G[0] = A[0].

Using the above recurrence relation, we can compute the sum of the optimal sub sequence for array A, which would just be the maximum over G[i] for 0 <= i<= n-1.

However, we are required to output the starting and ending indices of an optimal sub-sequence, we would use another array V where V[i] would store the starting index for a maximum sum contiguous sub sequence ending at index i.

Now the algorithm would be:

Create arrays G and V each of size n.

G[0] = A[0];

V[0] = 0;

max = G[0];

max_start = 0, max_end = 0;

For i going from 1 to n-1:

// We know that G[i] = max { G[i-1] + A[i], A[i] .

If ( G[i-1] > 0)

G[i] = G[i-1] + A[i];

V[i] = V[i-1];

Else

G[i] = A[i];

V[i] = i;

If ( G[i] > max)

max_start = V[i];

max_end = i;

max = G[i];

EndFor.

Output max_start and max_end.

The above algorithm takes O(n) time .

4 0

2 years ago

What is application launchers functions

andrey2020 [161]

An app launcher replaces the stock user interface for organizing the home screen and app icons predominantly in the Android world; however, they are also available for jailbroken iPhones (see iPhone jailbreaking and Cydia). See Launchpad.

5 0

3 years ago

Given an list of N integers, Insertion Sort will, for each element in the list starting from the second element: Compare the ele

Elena L [17]

Answer:

def insSort(arr):

ct=0;

for i in range(1, len(arr)):

key = arr[i]

j = i-1

while j >=0 and key < arr[j] :

arr[j+1] = arr[j]

j -= 1

ct=ct+1;

arr[j+1] = key

return arr,ct;

print(insSort([2,1]))

Output of the program is also attached.

8 0

3 years ago