Question 6 (1 point)

Write a program that takes in a line of text as input, and outputs that line of text in reverse. The program repeats, ending whe

Nana76 [90]

Answer:

using System;

public class Program

{

public static void Main()

{

String input ;

while(true)

{

input = Console.ReadLine();

if(input.Equals(""quit""))

break;

Reverse_String(input);

}

return;

}

static void Reverse_String(string input_text)

{

char[] text = input_text.ToCharArray();

Array.Reverse(text);

Console.WriteLine(text);

}

Explanation:

In the above program a separate function is written to reverse the string.

This method takes the string as an argument and place it in a array and then use the built-in function reverse and print the reversed string in the console.

In the main(), the input is obtained from the console and it is passed to the reversestring(). 

7 0

3 years ago

Read 2 more answers

The LList class is (mostly) the same one discussed in lecture, but you must write a sort() function that uses one of the three i

Vladimir79 [104]

Answer:

see explaination

Explanation:

#include <iostream>

#include <string>

using namespace std;

class LinkedList{

class Node{

public :

int data;

Node* next;

Node(int data){

this->data = data;

next = NULL;

}

};

public :

Node *head;

LinkedList(){

this->head = NULL;

}

void insert(int d){

Node* new_node = new Node(d);

new_node->next = head;

head = new_node;

}

// sort the list with selection sort algorithm.

// Pick the smallest element in the unsorted array and place in the first element in the unsorted.

void sort_list(){

if (head == NULL){

return;

}

Node* current = head;

while (current->next != NULL){

Node* min_node = current;

Node* traverse = current->next;

while(traverse != NULL){

if(traverse->data < min_node->data){

min_node = traverse;

}

traverse = traverse->next;

}

int temp = current->data;

current->data = min_node->data;

min_node->data = temp;

current = current->next;

}

void print_list(){

Node* current = head;

while(current !=NULL){

cout<<current->data<<" ";

current = current->next;

}

cout<<"\n";

}

};

int main(){

LinkedList ll;

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

ll.insert(i);

}

ll.print_list();

cout<<"*******************************************\n";

ll.sort_list();

ll.print_list();

cout<<"*******************************************\n";

}

8 0

3 years ago

Heya!! •DEFINE DATA SCIENCE?? (∩_∩) #kavya#

anastassius [24]

Answer:

Explanation:

Data science defined

Data science encompasses preparing data for analysis, including cleansing, aggregating, and manipulating the data to perform advanced data analysis. Analytic applications and data scientists can then review the results to uncover patterns and enable business leaders to draw informed insights.

5 0

3 years ago

The Subset Sum problem is a generalization of the Knapsack problem. Group of answer choices True False g

Katarina [22]

Answer: True

Explanation:

Subset sum problem and Knapsack problem can be solved using dynamic programming.

In case of Knapsack problem there is a set of weights associative with objects and a set of profits associated with each object and a total capacity of knapsack let say C. With the help of dynamic programming we try to include object's weight such that total profit is maximized without fragmenting any weight of objects and without exceeding the capacity of knapsack, it is also called as 0/1 knapsack problem.

Similar to knapsack problem, in subset sum problem there is set of items and a set of weights associated with the items and a capacity let say C, task is to choose the subset of items such that total sum of weights associated with items of subset is maximized without exceeding the total capacity.

On the basis of above statements we can say that subset sum problem is generalization of knapsack problem.

4 0

3 years ago

A function defined beginning with void SetNegativesToZeros(int userValues[], ... should modify userValues such that any negative

Stels [109]

Answer:

public static void setNegativesToZero(int userValues[]){

System.out.println("Array before setting negatives to zero "+Arrays.toString(userValues));

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

if(userValues[i]< 1){

userValues[i] = 0;

}

System.out.println();

System.out.println("Array After setting negatives to zero "+Arrays.toString(userValues));

}

Explanation:

Using Java programming Language, the method is created to receive an array of ints as parameter (as specified in the question)

Using a for loop, we iterate over the entire array checking for values that are negative (<0) and setting them to zero.

See a complete program below

import java.util.Arrays;

import java.util.Scanner;

public class num1 {

public static void main(String[] args) {

// Create an array and assign values

int [] arr = {1,2,3,-1,1,2,-4};

//Calling the method setNegativesToZero

setNegativesToZero(arr);

}

//Creating the Method

public static void setNegativesToZero(int userValues[]){

System.out.println("Array before setting negatives to zero "+Arrays.toString(userValues));

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

if(userValues[i]< 1){

userValues[i] = 0;

}

System.out.println();

System.out.println("Array After setting negatives to zero "+Arrays.toString(userValues));

}

3 0

3 years ago