• swapArrayEnds(int[] nums): swaps the first and last elements of its array parameter. Ex: {10, 20, 30, 40} becomes {40, 20, 30, 10}.
• removeTen(int[] nums): returns a version of the given array where all the 10's have been removed. The remaining elements should shift left towards the start of the array as needed, and the empty spaces at the end of the array should be set to 0. Ex: {1, 10, 10, 2} yields {1, 2, 0, 0}. You can make a new array and return the new array.

Note that swapArrayEnds() does not need to return the result, as it makes changes to the array referenced by the parameter, which is the same array reference by the argument. On the other hand, removeTen() does not direct make changes to the array, but creates a new array, which requires to be made.

• Java passes parameter by value, a method cannot change the actual argument. However, a method can make changes to the object that is referenced by the argument.
• If a method changes the array's contents, the method usually has a void return type.
• If the method does not change the array's contents, but create a new array, then the method needs to return the newly created array.

public class RemoveTen {
public static void main(String[] args) {
int[] nums = {1, 10, 10, 2};
  
swapArrayEnds(nums);

for(int i = 0; i < nums.length; i++)
System.out.print(nums[i] + " ");

int[] result = removeTen(nums);
  
for(int i = 0; i < result.length; i++)
System.out.print(result[i] + " ");
System.out.println();

for(int i = 0; i < nums.length; i++)
System.out.print(nums[i] + " ");
System.out.println();
}

public static void swapArrayEnds(int[] nums) {
/*FIXME Complete the implementation of the swapArrayEnds method*/
  
}

public static int[] removeTen(int[] nums) {
/*FIXME Complete the implementation of the removeTen method*/
  
}

  
}

#include <iostream>

#include "lib.hpp"

using namespace std;

int main() {

// declare the bool

bool a = true;

bool b= true;

//Print the Conjunction function

cout<<"\n\nConjunction Truth Table -"<<endl;

cout<< "\nP\tQ\t(P∧Q)" <<endl;

cout<< a <<"\t"<< b <<"\t"<< conjunction(a,b) <<endl;

cout<< a <<"\t"<< !b <<"\t"<< conjunction(a,!b) <<endl;

cout<< !a <<"\t"<< b <<"\t"<< conjunction(!a,b) <<endl;

cout<< !a <<"\t"<< !b <<"\t"<< conjunction(!a,!b)<<endl;

//Print the Disjunction function

cout<<"\n\nDisjunction Truth Table -"<<endl;

cout<< "\nP\tQ\t(PVQ)" <<endl;

cout<< a <<"\t"<< b <<"\t"<< disjunction(a,b) <<endl;

cout<< a <<"\t"<< !b <<"\t"<< disjunction(a,!b) <<endl;

cout<< !a <<"\t"<< b <<"\t"<< disjunction(!a,b) <<endl;

cout<< !a <<"\t"<< !b <<"\t"<< disjunction(!a,!b)<<endl;

//Print the ExclusiveOr function

cout<<"\n\nExclusiveOr Truth Table -"<<endl;

cout<< "\nP\tQ\t(P⊕Q)" <<endl;

cout<< a <<"\t"<< b <<"\t"<< exclusiveOr(a,b) <<endl;

cout<< a <<"\t"<< !b <<"\t"<< exclusiveOr(a,!b) <<endl;

cout<< !a <<"\t"<< b <<"\t"<< exclusiveOr(!a,b) <<endl;

cout<< !a <<"\t"<< !b <<"\t"<< exclusiveOr(!a,!b)<<endl;

//Print the Negation function

cout<<"\n\nNegation Truth Table -"<<endl;

cout<< "\nP\t~P" <<endl;

cout<< !a <<"\t" << negation(!a)<<endl;

cout<< a <<"\t" << negation(a) <<endl;

How can u do this code Using the enum keyword or a C++ class? To create a new type Boolean with the two values F and T defined.

Ask the user for a filename. In binary format, read all the integers in that file. Show the number of integers you read in, along with the maximum and minimum integer found. Language is Java.

/////////////input/////////

n1.dat

////////// output//////////

Enter a filename\n
Found 50 integers.\n
Max: 9944\n
Min: 74\n

Problem 1: Let’s start by practicing using logical operators and being careful about the order of execution when we use multiple of them in the same expression.

Recall that Boolean expressions use conditional operators to implement basic logic. If all three operators appear in the same expression, Java will evaluate ! first, then &&, and finally ||. If there are multiples of the same operator, they are evaluated from left to right. Relational operators (like <, ==, etc) are evaluated before && and ||, so there is generally no need for parentheses.

Show your work, step-by-step, as you evaluate the following expression in the same order that Java would evaluate this expression:

! (a > c) && b > c

• What if values of a,b,c are respectively 1,2,3? Result of expression is......

• What if values of a,b,c are respectively 3,2,1? Result of expression is......

• What if values of a,b,c are all equal to 3? Result of expression is......

Problem 2: In Java, && and || are short circuit operators, meaning they evaluate only what is necessary.

If the expression p is more likely to be true than the expression q, which one should you place

on the left of each operator to avoid doing extra work? Explain why.

a) left of the && expression:

b) left of the || expression:

Problem 3: What is the result of the following expressions? Do it by hand first, then check yourself by writing it as a code in JAVA.

a) 1 + 0 > 0 && 1 / 0 > 0

b) 1 + 0 > 0 || 1 / 0 > 0

Problem 4: Give four examples of boolean expressions that:

a) uses a, b, and !, and evaluates to false

b) uses b, c, and !, and evaluates to true

c) uses any variables, but evaluates to false

d) uses any variables, but evaluates to true

Write a program that reads a line of text input by the user and places each word in a TreeSet. Print the elements of the TreeSet to the screen. This will cause the elements to be printed in ascending order.

Using Eclipse for this.

TreeSetUse.java.

Java) Write a program to score the rock-paper-scissor game. Each of two users types in either R, P, S or Q to quit. The program then announces the winner as well as the basis for determining the winner: Paper covers rock, Rock breaks scissors, Scissors cut paper, or a Tie game. Allow the user to use lowercase as well as uppercase letters. Your program should loop until the user types a 'Q' to quit.

In the sample code, the game is enclosed within a do…while loop that keeps repeating while the user enters a 'Y' in response to the prompt "Do you want to play again? " The program exits if anything other than an upper-case or lower-case 'Y' is entered. For extra credit, add additional code at the end of the program to keep asking "Do you want to play again? " until the user enters either a 'Y' or 'N' and rejects any other response.(NEEDED)

Convert 11001001100101101011010011010111 from IEEE 754 to decimal show work

Write a method in java (with out using startwith,boolean true false) count that counts how many times a substring occurs in a string:For example: count("is", "Mississippi") will return 2. also add comment besides code.

In this lab you will be encrypting a message. It is a simple encryption described in the problem. To program it remember that the ASCII code for ‘A’ is 65 and the other capital letters are in order 66, 67, 68, … The ASCII code for ‘a’ is 97 and the lowercase continues 98, 99, and so on. The hint is that a if a user type in a char with an ASCII code between 65 and 90, or 97 and 122 then add 5 and print out the result. Otherwise, have a sequence of if-statements to encrypt the punctuation marks as given in the problem. Keep looping until the character typed in is a ‘#’ symbol.

1. Write a C++ program that encrypts a message. The program should read in a character, “encrypt” the character by giving the numeric place the character has in the alphabet then add 5. The program should then printout the encrypted message to the screen. The program should continue taking in characters until the user types in a # symbol. Punctuation should be handled as follows: . A , B ? C ! D. No other characters will be encrypted.

Given a list of negative integers, write a Python program to display each integer in the list that is evenly divisible by either 5 or 7. Also, print how many of those integers were found.

Sample input/output:

Enter a negative integer (0 or positive to end): 5
Number of integers evenly divisible by either 5 or 7: 0

Sample input/output:

Enter a negative integer (0 or positive to end): -5
-5 is evenly divisible by either 5 or 7.
Enter a negative integer (0 or positive to end): -35
-35 is evenly divisible by either 5 or 7.
Enter a negative integer (0 or positive to end): -3
Enter a negative integer (0 or positive to end): -7
-7 is evenly divisible by either 5 or 7.
Enter a negative integer (0 or positive to end): 0
Number of integers evenly divisible by either 5 or 7: 3

Utilize the Outdoor Clubs & Product database to create a PL/SQL anonymous block program unit that lists the product_name attribute value and a demand status text display. The demand status text display is determined by counting the number of times a product has been ordered so far. The demand status text display will be either “Low Demand” or “High Demand”. Low Demand is displayed if the product has been ordered less than 2 times. High Demand is displayed if the product has been ordered more than 2 times. Save the PL/SQL anonymous block program unit as a script file. Due to the business rule of not carrying products that have low demand, reduce the price of products (by $1) that have low demand.

--- Database Tables --- _

id varchar2(4) constraint supplier_pk primary key, name varchar2(30), street varchar2(30), city varchar2(15), state char(2), zip number(5), phone varchar2(10)); create table product (product_id number(5) constraint product_pk primary key, product_name varchar2(30), quantity_in_stock number(3), reorder_point number(2), price number(5,2), supplier_id varchar2(4) constraint product_fk references supplier, reorder_qty number(2)); create table purchase_order (po_no varchar2(4) constraint purchase_order_pk primary key, po_date date, product_id number(5) constraint purchase_order_fk1 references product, quantity number(3), supplier_id varchar2(4) constraint purchase_order_fk2 references supplier); create table customer (customer_id number(3) constraint customer_pk primary key, first_name varchar2(10), last_name varchar2(10), street varchar2(30), city varchar2(15), state char(2)default 'MO', zip number(5), phone varchar2(10)); create table club_membership (membership_id number(5) constraint club_membership_pk primary key, membership_date date, duration number(2), amount number(4), payment_type varchar2(5)constraint membership_payment_type_ck check ((payment_type = 'CC') or (payment_type = 'Check')), club_id number(3) constraint club_membership_fk1 references sporting_clubs, customer_id number(3) constraint club_membership_fk2 references customer); create table product_order (order_id number(4) constraint product_order_pk primary key, order_date date, ship_date date, payment_type varchar2(5)constraint prod_order_payment_type_ck check ((payment_type = 'CC') or (payment_type = 'Check')), total number (6,2), customer_id number(3) constraint product_order_fk1 references customer); create table order_details (order_id number(4), product_id number(5), quantity number(2), constraint order_details_pk primary key (order_id,product_id), constraint order_details_fk1 foreign key (order_id) references product_order, constraint order_details_fk2 foreign key (product_id) references product); create sequence club_sequence start with 100 increment by 10 nocache; insert into sporting_clubs values(club_sequence.nextval, 'Hillside Mountain Club', '1 Winona St','Wichita','KS',34342,'3163997676'); insert into sporting_clubs values(club_sequence.nextval, 'Branson Climbing Club', '2 Sherwood Dr.','Branson','MO',65670,'4174485676'); insert into sporting_clubs values(club_sequence.nextval, 'Cherokee Rafting Club', '44 Kent Ave.','St. Charles','MO',66572,'3147780870'); insert into sporting_clubs values(club_sequence.nextval, 'White Plains Club', '225 Tracy St.','New York','NY',13567,'2126678090'); insert into club_activity values(100,'Hiking'); insert into club_activity values(100,'Climbing'); insert into club_activity values(100,'Walking'); insert into club_activity values(110,'Hiking'); insert into club_activity values(110,'Climbing'); insert into club_activity values(110,'Conservation'); insert into club_activity values(110,'Walking'); insert into club_activity values(120,'Conservation'); insert into club_activity values(120,'Canoeing'); insert into club_activity values(130,'Conservation'); insert into club_activity values(130,'Canoeing'); insert into club_activity values(130,'Walking'); create sequence supplier_sequence start with 500 increment by 10 nocache; insert into supplier values('S'||supplier_sequence.nextval,'Hillside Ski','2717 S. Western Ave.','Los Angeles','CA',90006,'7146654959'); insert into supplier values('S'||supplier_sequence.nextval,'Tiger Mountain','2600 S. Vermont Ave.','Los Angeles','CA',90006,'7143327878'); insert into supplier values('S'||supplier_sequence.nextval,'Asha Outdoor','44 S. LaSalle St.','Chicago','IL',60603,'3125554678'); insert into supplier values('S'||supplier_sequence.nextval,'Sheraton Recreation','225 Tracy St.','New York','NY',13567,'2128889569'); create sequence product_id_sequence start with 10010 increment by 1 nocache; insert into product values(product_id_sequence.nextval,'Beginner''s Ski Boot',20,5,9.75,'S500',25); insert into product values(product_id_sequence.nextval,'Intermediate Ski Boot',18,5,12.99,'S500',20); insert into product values(product_id_sequence.nextval,'Pro Ski Boot',21,7,15.49,'S510',25); insert into product values(product_id_sequence.nextval,'Beginner''s Ski Pole',15,3,25.49,'S500',20); insert into product values(product_id_sequence.nextval,'Intermediate Ski Pole',20,3,29.99,'S520',22); insert into product values(product_id_sequence.nextval,'Pro Ski Pole',21,5,34.99,'S530',25); insert into product values(product_id_sequence.nextval,'Road Bicycle',15,4,34.95,'S520',18); insert into product values(product_id_sequence.nextval,'Mountain Bicycle',19,4,49.99,'S520',20); insert into product values(product_id_sequence.nextval,'Tire Pump',8,2,7.99,'S530',10); insert into product values(product_id_sequence.nextval,'Water Bottle',25,4,2.49,'S510',25); insert into product values(product_id_sequence.nextval,'Bicycle Tires',30,5,4.99,'S500',33); insert into product values(product_id_sequence.nextval,'Bicycle Helmet',23,6,10.95,'S510',25); create sequence po_sequence start with 11 nocache; insert into purchase_order values('PO'||po_sequence.nextval,to_date('5/25/12','mm/dd/yy'),10011,20,'S500'); insert into purchase_order values('PO'||po_sequence.nextval,to_date('5/12/12','mm/dd/yy'),10015,25,'S530'); insert into purchase_order values('PO'||po_sequence.nextval,to_date('6/25/12','mm/dd/yy'),10011,20,'S500'); insert into purchase_order values('PO'||po_sequence.nextval,to_date('6/15/12','mm/dd/yy'),10018,10,'S530'); insert into purchase_order values('PO'||po_sequence.nextval,to_date('7/10/12','mm/dd/yy'),10015,25,'S530'); insert into purchase_order values('PO'||po_sequence.nextval,to_date('7/25/12','mm/dd/yy'),10019,25,'S510'); create sequence customer_sequence start with 101 nocache; insert into customer values(customer_sequence.nextval,'Jack','Russell','25 North Madison Ave.','Springfield','MO',65807,'4178823434'); insert into customer values(customer_sequence.nextval,'Betty','Trumbell','550 South Court Dr.','St. Louis','MO',63140,'3125556670'); insert into customer values(customer_sequence.nextval,'Anil','Kaul','400 South Circle St.','Kansas City','MO',64530,'4316667070'); insert into customer values(customer_sequence.nextval,'Tom','Wiley','1500 North Grand St.','Springfield','MO',65810,'4178825560'); insert into customer values(customer_sequence.nextval,'Sharon','Stone','200 West Wagner St.','Springfield','MO',65807,'4176668890'); create sequence membership_sequence start with 10010 increment by 10 nocache; insert into club_membership values(membership_sequence.nextval,to_date('6/12/12','mm/dd/yy'),4,200,'CC',100,101); insert into club_membership values(membership_sequence.nextval,to_date('6/15/12','mm/dd/yy'),2,100,'Check',110,102); insert into club_membership values(membership_sequence.nextval,to_date('6/21/12','mm/dd/yy'),5,250,'Check',120,103); create sequence product_order_sequence start with 1001 nocache; insert into product_order values(product_order_sequence.nextval,to_date('5/27/12','mm/dd/yy'),to_date('6/1/12','mm/dd/yy'),'CC',134.95,102); insert into product_order values(product_order_sequence.nextval,to_date('5/28/12','mm/dd/yy'),to_date('6/2/12','mm/dd/yy'),'CC',134.85,103); insert into product_order values(product_order_sequence.nextval,to_date('5/28/12','mm/dd/yy'),to_date('6/3/12','mm/dd/yy'),'Check',12.45,104); insert into product_order values(product_order_sequence.nextval,to_date('6/5/12','mm/dd/yy'),to_date('6/10/12','mm/dd/yy'),'CC',44.43,105); insert into product_order values(product_order_sequence.nextval,to_date('6/6/12','mm/dd/yy'),to_date('6/8/12','mm/dd/yy'),'Check',52.48,103); insert into product_order values(product_order_sequence.nextval,to_date('6/8/12','mm/dd/yy'),to_date('6/12/12','mm/dd/yy'),'CC',131.94,104); insert into order_details values(1001,10011,2); insert into order_details values(1001,10015,3); insert into order_details values(1002,10011,5); insert into order_details values(1002,10016,2); insert into order_details values(1003,10019,5); insert into order_details values(1004,10018,3); insert into order_details values(1004,10011,1); insert into order_details values(1004,10019,3); insert into order_details values(1005,10017,1); insert into order_details values(1005,10019,1); insert into order_details values(1005,10021,1); insert into order_details values(1006,10012,4); insert into order_details values(1006,10015,2); commit;

Form for a user to enter billing and shipping information. Checkbox that when clicked copies all of the billing information to the shipping information. A submit button to make sure the text fields have been filled. Just trying to make a simple small webpage to order a couple Items like toys for instance nothing fancy or big just small and simple, a couple of text fields. That's all

JavaScript/HTML

Suppose you are given a string containing only the characters ( and ). In this problem, you will write a function to determine whether the string has balanced parentheses. Your algorithm should use no more than O (1) space beyond the input; any algorithms that use space not in O (1) will receive half credit at most. Any solutions that always return true (or always return false) or otherwise try to game the distribution of test cases will receive zero credit.

Balanced parentheses means that every open parenthesis has exactly one close parenthesis corresponding to it and vice versa, and that for each pair the opening parenthesis precedes the closed parenthesis. The following strings have balanced parentheses: () (()()) ((())())

The following strings do not have balanced parentheses: )( (() ())(()))())

We consider the empty string to have balanced parentheses, as there is no imbalance. Your program should accept as input a single string containing only the characters ) and (, and output a single line stating true or false .

The functionality for reading and printing answers is written in the class; your task is to complete the hasBalancedParentheses() method.

HOW WOULD YOU WRITE THIS IN PYTHON?
SHOW THIS IN PYTHON CODE PLEASE

# DEFINE 'all_keywords', A LIST COMPRISED OF ALL OUR NEGATIVE SEARCH KEYWORDS AS REQUIRED BY THE PROJECT
# FOR EACH ELEMENT IN 'full_list' (THE LIST OF LISTS YOU WOULD HAVE CREATD ABOVE THE PREVIOUS LINE)
#       INITIALIZE THE SET 'detected_keywords' TO EMPTY
#       DEFINE VARIABLE 'current_reviewer' FROM CURRENT ELEMENT OF 'full_list' BY EXTRACTING ITS FIRST SUB-ELEMENT,...
#       ...CONVERTING IT TO A STRING, AND THEN STRIPPING THE SUBSTRING '<Author>' OFF THIS STRING
#       GENERATE THE LIST 'separated_words' COMPRISED OF EACH SEPARATE WORD IN THIS REVIEWER'S COMMENTS, BY EXTRACTING THE SECOND SUB-ELEMENT...
#       ...FROM THE CURRENT ELEMENT AND EXECUTING THE '.split' METHOD ON IT
#       FOR EACH ELEMENT IN 'separated_words'
#               FOR EACH ELEMENT IN 'all_keywords'
#                       if LOWER-CASE OF 'all_keywords' IS CONTAINED IN LOWER-CASE OF 'separated_words'
#                               ADD THE CURRENT ELEMENT OF 'all_keywords' TO THE SET 'detected_keywords'
#       IF LENGTH OF 'detected_keywords' IS MORE THAN ZERO
#               PRINT A LINE SUCH AS -- XYZ USED THE FOLLOWING KEYWORDS: {'bad,'rough'}
#       ELSE
#               PRINT A LINE SUCH AS -- XYZ DID NOT USE ANY NEGATIVE KEYWORDS.