Answer: Provided in the explanation section
Explanation:
Str_find PROTO, pTarget:PTR BYTE, pSource:PTR BYTE
.data
target BYTE "01ABAAAAAABABCC45ABC9012",0
source BYTE "AAABA",0
str1 BYTE "Source string found at position ",0
str2 BYTE " in Target string (counting from zero).",0Ah,0Ah,0Dh,0
str3 BYTE "Unable to find Source string in Target string.",0Ah,0Ah,0Dh,0
stop DWORD ?
lenTarget DWORD ?
lenSource DWORD ?
position DWORD ?
.code
main PROC
INVOKE Str_find,ADDR target, ADDR source
mov position,eax
jz wasfound ; ZF=1 indicates string found
mov edx,OFFSET str3 ; string not found
call WriteString
jmp quit
wasfound: ; display message
mov edx,OFFSET str1
call WriteString
mov eax,position ; write position value
call WriteDec
mov edx,OFFSET str2
call WriteString
quit:
exit
main ENDP
;--------------------------------------------------------
Str_find PROC, pTarget:PTR BYTE, ;PTR to Target string
pSource:PTR BYTE ;PTR to Source string
;
; Searches for the first matching occurrence of a source
; string inside a target string.
; Receives: pointer to the source string and a pointer
; to the target string.
; Returns: If a match is found, ZF=1 and EAX points to
; the offset of the match in the target string.
; IF ZF=0, no match was found.
;--------------------------------------------------------
INVOKE Str_length,pTarget ; get length of target
mov lenTarget,eax
INVOKE Str_length,pSource ; get length of source
mov lenSource,eax
mov edi,OFFSET target ; point to target
mov esi,OFFSET source ; point to source
; Compute place in target to stop search
mov eax,edi ; stop = (offset target)
add eax,lenTarget ; + (length of target)
sub eax,lenSource ; - (length of source)
inc eax ; + 1
mov stop,eax ; save the stopping position
; Compare source string to current target
cld
mov ecx,lenSource ; length of source string
L1:
pushad
repe cmpsb ; compare all bytes
popad
je found ; if found, exit now
inc edi ; move to next target position
cmp edi,stop ; has EDI reached stop position?
jae notfound ; yes: exit
jmp L1 ; not: continue loop
notfound: ; string not found
or eax,1 ; ZF=0 indicates failure
jmp done
found: ; string found
mov eax,edi ; compute position in target of find
sub eax,pTarget
cmp eax,eax ; ZF=1 indicates success
done:
ret
Str_find ENDP
END main
cheers i hoped this helped !!
2 point) Express this problem formally with input and output conditions.2.(2 points) Describe a simple algorithm to compute the upper median. How manyoperations does it take asymptotically in the worst case?3.(7 points) Show how you can use the (upper) medians of the two lists to reduce thisproblem to its subproblems. State a precise self-reduction for your problem.4. (7 points) State a recursive algorithm that solves the problem based on your reduction.5.(2 point) State a tight asymptotic bound on the number of operations used by youralgorithm in the worst case.
Answer:
See attached images
Modify the selectionSort function presented in this chapter so it sorts an array of strings instead of an array of ints. Test the function with a driver program. Use program 8-8 as a skeleton to complete.
Program 8-8
#include
#include
using namespace std;
int main()
{
const int NUM_NAMES = 20
string names [NUM_NAMES] = {"Collins, Bill", "Smith, Bart", "Allen, Jim", "Griffin, Jim", "Stamey, Marty", "Rose,Geri", "Taylor, Terri", "Johnson, Jill", "Allison, Jeff", "Looney, Joe", "Wolfe, Bill", "James, Jean", "Weaver, Jim", "Pore, Bob", "Rutherford, Greg", "Javens, Renee", "Harrison, Rose", "Setzer, Cathy", "Pike, Gordon", "Holland, Beth" };
//Insert your code to complete this program
return 0;
}
Answer:
Following are the method to this question:
void selectionSort(string strArr[], int s) //defining selectionSort method
{
int i,ind; //defining integer variables
string val; //defining string variable
for (i= 0; i< (s-1);i++) //defining loop to count value
{
ind = i; //assign loop value in ind variable
val = strArr[i]; // strore array value in string val variable
for (int j = i+1;j< s;j++) // defining loop to compare value
{
if (strArr[j].compare(val) < 0) //using if block to check value
{
val = strArr[j]; //store value in val variable
ind= j; //change index value
}
}
strArr[ind] = strArr[i]; //assign string value in strArray
strArr[i] = val; // assign array index value
}
}
void print(string strArr[], int s) //defining print method
{
for (int i=0;i<s;i++) //using loop to print array values
{
cout << strArr[i] << endl; //print values
}
cout << endl;
}
Explanation:
In the above-given code, two methods "selectionsort and print" is declared, in which, both method stores two variable in its parameter, which can be described as follows:
Insides the selectionSort method, two integer variable "i and ind" and a string variable "val" is defined, inside the method a loop is declared, that uses the if block condition to sort the array. In the next line, another method print is declared that declared the loop to prints its value. Please find the attachment for full code.Write a function with this prototype:
#include
void numbers(ostream& outs, const string& prefix, unsigned int levels);
The function prints output to the ostream outs. The output consists of the String prefix followed by "section numbers" of the form 1.1., 1.2., 1.3., and so on. The levels argument determines how many levels the section numbers have. For example, if levels is 2, then the section numbers have the form x.y. If levels is 3, then section numbers have the form x.y.z. The digits permitted in each level are always '1' through '9'. As an example, if prefix is the string "THERBLIG" and levels is 2, then the function would start by printing:
THERBLIG1.1.THERBLIG1.2.THERBLIG1.3.and ends by printing:THERBLIG9.7.THERBLIG9.8.THERBLIG9.9.The stopping case occurs when levels reaches zero (in which case the prefix is printed once by itself followed by nothing else).The string class from has many manipulation functions, but you'll need only the ability to make a new string which consists of prefix followed by another character (such as '1') and a period ('.'). If s is the string that you want to create and c is the digit character (such as '1'), then the following statement will correctly form s:s = (prefix + c) + '.';This new string s can be passed as a parameter to recursive calls of the function.
Answer:
Following are the code to this question:
#include <iostream> //defining header file
using namespace std;
void numbers(ostream &outs, const string& prefix, unsigned int levels); // method declaration
void numbers(ostream &outs, const string& prefix, unsigned int levels) //defining method number
{
string s; //defining string variable
if(levels == 0) //defining condition statement that check levels value is equal to 0
{
outs << prefix << endl; //use value
}
else //define else part
{
for(char c = '1'; c <= '9'; c++) //define loop that calls numbers method
{
s = prefix + c + '.'; // holding value in s variable
numbers(outs, s, levels-1); //call method numbers
}
}
}
int main() //defining main method
{
numbers(cout, "THERBLIG", 2); //call method numbers method that accepts value
return 0;
}
Output:
please find the attachment.
Explanation:
Program description:
In the given program, a method number is declared, that accepts three arguments in its parameter that are "outs, prefix, levels", and all the variable uses the address operator to hold its value. Inside the method a conditional statement is used in which string variable s and a conditional statement is used, in if the block it checks level variable value is equal to 0. if it is false it will go to else block that uses the loop to call method. In the main method we call the number method and pass the value in its parameter.As citizens online or in real life, how, or why, do the choices we make, almost always seems to have an effect (positive or negative) on others?
Answer:
The choices we make as citizens online or in real life have both positive and negative effects on others because we are social beings, who live in an interconnected world. Every choice has some consequences on the decision maker or on others. We make the choices, but the consequences follow natural laws, which we cannot control. When Adam and Eve chose to disobey God, human beings down the ages lost their innocence and freedom. When the Nazis chose to purify their race of European Jews, there was the Holocaust between 1941 and 1945. When the Minneapolis police officer chose to slaughter George Floyd in cold blood, violent protests erupted throughout the U.S.
Another current example to buttress this is the ravaging coronavirus pandemic, which originated in Wuhan - China. When the Chinese Communist government chose to suppress the information about the virus as it usually does, the aftermath is the thousands of dead humans all over the world, the economic downturn, loss of jobs, virus infections with other public health side effects, plus many other untold consequences.
Had the Chinese government made a different choice, the virus could not have spread worldwide as it had. Similarly, some citizens online choose to circulate unverifiable ("fake news") information. Many people have been misled by their antics, some have lost their lives, while many others live in perpetual bigotry and hatred. All these are because of individual choices.
Explanation:
Choice is a concept in decision making. It is the judging of the merits of multiple options so that one or some of the options are selected. When a voter votes for one candidate against others, she has made a choice (decision). Of course, choices have consequences, which we must live with. Choices also define our present and our future.
Write short notes on a. Transaction Processing System (TPS)
Answer: A Transaction Processing System (TPS) is a type of information system that collects, stores, modifies and retrieves the data transactions of an enterprise. Rather than allowing the user to run arbitrary programs as time-sharing, transaction processing allows only predefined, structured transactions.
Three cycles: Transaction processing systems generally go through a five-stage cycle of 1) Data entry activities 2) Transaction processing activities 3) File and database processing 4) Document and report generation 5) Inquiry processing activities.
Explanation: hope this helps!
Only one calendar can be visible at a time
in Outlook.
Select one:
a. False
b. True
Answer:
a. False
Explanation:
It is false as more than one calendar is visible in outlook.
Explanation:
it is false
i think it helps you
Write a method that sums all the numbers in the major diagonal in an n x n matrix of double values using the following header: public static double sumMajorDiagonal(double[][] m) Write a test program that first prompts the user to enter the dimension n of an n x n matrix, then asks them to enter the matrix row by row (with the elements separated by spaces). The program should then print out the sum of the major diagonal of the matrix.
Answer:
Following are the code to this question:
import java.util.*; //import package for user input
public class Main //defining main class
{
public static double sumMajorDiagonal(double [][] m) //defining method sumMajorDiagonal
{
double sum = 0; //defining double variable sum
int i, j; //defining integer variable
for(i = 0; i <m.length; i++) //defining loop to count row
{
for(j = 0; j < m.length; j++) //defining loop to count column
{
if(i == j) //defining condition to value of i is equal to j
{
sum=sum+ m[i][j]; //add diagonal value in sum variable
}
}
}
return sum; //return sum
}
public static void main(String args[]) //defining main method
{
int n,i,j; //defining integer variable
System.out.print("Enter the dimension value: "); //print message
Scanner ox = new Scanner(System.in); //creating Scanner class object for user input
n = Integer.parseInt(ox.nextLine()); //input value and convert value into integer
double m[][] = new double[n][n]; //defining 2D array
for(i = 0; i < m.length; i++)
{
String t = ox.nextLine(); // providing space value
String a[] = t.split(" "); // split value
for(j = 0; j < a.length; j++) //defining loop to count array value
{
double val = Double.parseDouble(a[j]); //store value in val variable
m[i][j] = val; //assign val in to array
}
}
double d_sum = sumMajorDiagonal(m); //call method store its return value in d_sum variable
System.out.println("diagonal matrix sum: "+ d_sum); //print sum
}
}
output:
Enter the dimension value: 3
1 2 3
1 2 3
1 2 4
diagonal matrix sum: 7.0
Explanation:
Program description:
In the given java language code, a method "sumMajorDiagonal" is declared, that accepts a double array "m" in its parameter, inside the method two integer variable "i and j" and one double variable "sum" is defined, in which variable i and j are used in a loop to count array value, and a condition is defined that checks its diagonal value and use sum variable to add its value and return its value. In the main method first, we create the scanner class object, that takes array elements value and passes into the method, then we declared a double variable d_sum that calls the above static method, that is "sumMajorDiagonal" and print its return value with the message.What must be done to translate a posttest loop expressed in the form
repeat:
(. . . )
until (. . . )
into an equivalent posttest loop expressed in the form
do:
(. . . )
while (. . . )
Answer:
num = 0
while (num < 50):
if (num is Odd)
print(num is Odd)
num = num + 1
num = 0
repeat:
if (num is Odd)
print(num is Odd)
num = num + 1
until (num>=50)
A company wants to implement a wireless network with the following requirements:
i. All wireless users will have a unique credential.
ii. User certificate will not be required for authentication
iii. The company's AAA infrastructure must be utilized
iv. Local hosts should not store authentication tokesn
1. Which of the following should be used in the design to meet the requirements?
O EAP-TLS
O WPS
O PSK
O PEAP
Answer:
PEAP is the correct answer to the given question .
Explanation:
The PEAP are implemented to meet the demands because it is very much identical to the EAP-TTLS design also it includes the server-side PKI authentication .
The main objective of PEAP is to establish the protected TLS tunnel for protecting the authentication process, as well as a server-side encryption authentication.The PEAP is also used for validating the application it validating her process with the help of the TLS Tunnel encryption between the user and the verification.All the other options are not suitable for the to meet the requirements of the design that's why these are incorrect option .Write the method scrambleWord, which takes a given word and returns a string that contains a scrambled version of the word according to the following rules.
a. The scrambling process begins at the first letter of the word and continues from left to right.
b. If two consecutive letters consist of an "A" followed by a letter that is not an "A", then the two letters are swapped in the resulting string.
c. Once the letters in two adjacent positions have been swapped, neither of those two positions can be involved in a future swap.
The following table shows several examples of words and their scrambled versions.
word Result returned by scrambleWord(word)
"TAN" "TNA"
"ABRACADABRA" "BARCADABARA"
"WHOA" "WHOA"
"AARDVARK" "ARADVRAK"
"EGGS" "EGGS"
"A" "A"
"" ""
Answer:
Let's implement the program using JAVA code.
import java.util.*;
import java.util.ArrayList;
import java.io.*;
public class ScrambledStrings
{
/** Scrambles a given word.
* atparam word the word to be scrambled
* atreturn the scrambled word (possibly equal to word)
* Precondition: word is either an empty string or contains only uppercase letters.
* Postcondition: the string returned was created from word as follows:
* - the word was scrambled, beginning at the first letter and continuing from left to right
* - two consecutive letters consisting of "A" followed by a letter that was not "A" were swapped
* - letters were swapped at most once
*/
public static String scrambleWord(String word)
{
// iterating through each character
for(int i=0;i<word.length()-1;)
{
//if the condition matches
if(word.charAt(i)=='A' && word.charAt(i+1)!='A'){
//swapping the characters
word=word.substring(0,i)+word.charAt(i+1)+word.charAt(i)+word.substring(i+2);
//skipping the letter
i+=1;
}
//skipping the letter
i+=1;
}
return word;
}
Explanation:
Note: Please replace the "at" on the third and fourth line with at symbol that is shift 2.
what is the percentage of 20?
Hi!
I'm Happy to help you today!
The answer to this would be 20%!
The reason why is because percents are simple to make! Like theres always an end percent! But its always gonna end at 100% Let me show you some examples to help you understand!
So were gonna have the end percent at 100%
Lets turn 2 into a percent!
2 = 2% because its under 100%
Now lets go into a Higher number like 1000%
So lets turn 33 into a percent!
33 = 3.3% 30 turns into 3% because of the max percent of 1000% and then 3 turns into .3% because of the max of 1000%
I hope this helps!
-LimitedLegxnd
-If you enjoyed my answer make sure to hit that Heart! Also Rate me to show others how well i did! You can do that by clicking the stars!
-Question asker mark me brainliest if you really enjoyed my answer!
// isOrdered
//
// return true if the queue contents are in increasing order (back to front)
// Queue may be empty ; in which case the function should return true
// You must solve this USING RECURSION; you will need to use a helper function
// You may not use:
// any other Java classes, algorithms,
// the toString instance method
// You may not alter the invoking queue
//
// here are some conceptual examples ( they also mirror what your linked lists will look like)
// the back is on the left and the front is on the right.
// Example 1. A B C D E F G H I J --> answer true ,
// Example 2. C B A --> answer false
// Example 3. C --> answer true
//
Answer:
honestly i dont know but I used to have computer programming classes on java and I'd get all my answers from repl.it forums. Wist you best of luck!!
Highlights the possible risks and problems that should be addressed during the implementation process
Answer:
The answer is below
Explanation:
Since the type of Implementation is not stated specifically, it is believed that, the question is talking about ERP Implementation, because it is related to subject in which the question is asked.
Hence, Enterprise Resource Planning (ERP) implementation deals basically, by carrying out installation of the software, transferring of finanancial data over to the new system, configuring application users and processes, and training users on the software
ERP Implementation Risks involve the following:
1. Inefficient Management and Project Activities.
2. Inadequate or No Training and Retraining of Customers or End-Users.
3. Inability to Redesign Business Processes to meet the Software requirements.
3. Incompetent or lack of Technical Support Team and Infrastructure.
4. Incapability to Obtain Full-Time Commitment of Employee.
5. Failure to Recruit and Maintained Qualified Systems, and Developers.
ALAP Help
what is a computer
Answer:An electronic device for storing and processing data, typically in binary form
Explanation:
One factor in algorithm performance that we've not had a chance to speak much about this quarter, but one that is certainly relevant in practice, is parallelism, which refers to the ability to speed up an algorithm by doing more than one thing at once. Nowadays, with most personal laptop or desktop computers having multicore processors, and with many workloads running on cloud infrastructure (i.e., potentially large numbers of separate machines connected via networks), the ability to run an algorithm in parallel is more important than ever.
Of course, not all problems can be parallelized to the same degree. Broadly, problems lie on a spectrum between two extremes. (In truth, most problems lie somewhere between these extremes, but the best way to understand what's possible is to know what the extremes are.)
Embarrassingly parallel problems are those that are composed primarily of independent steps that can be run in isolation from others and without respect to the results of the others, which makes them very easy to parallelize. Given n cores or machines, you could expect to run n steps simultaneously without any trouble.
Inherently serial problems are those whose steps have to be run sequentially, because the output of the first step makes up part of the input to the second step, and so on. Multiple cores or machines aren't much help for problems like this.
Now consider all of the sorting algorithms we learned about in our conversation about Comparison-Based Sorting. For which of the algorithms would you expect a multicore processor to be able to solve the problem significantly faster than a single-core processor would be able to solve it? For each of the ones that would benefit, briefly explain, in a sentence or two, why multiple cores would be beneficial. (There's no need to do any heavy-duty analysis here; we just want to see if you've got a sense of which might benefit from parallelism and why.)
Answer:
Quick sort and Merge sort supports parallelism
Explanation:
When we talk about parallelism, we are referring to the idea of breaking down a problem into a number of many subproblems after which we combine the solutions of these subproblems into a single solution. Here we allocate these subtasks to the multicore processors where each core gets assigned each of the subtasks are assigned to a core according to its ability or functionality. After each of the core are through with its evaluation, all their results are collated and combined to come up with a full rounded and complete solution to the given problem.
If we take a look at sorting algorithms such as selection sort, bubble sort and insertion sort, we will find out that these algorithms cant be simulated on a multicore processor efficiently because they are sequential algorithms.
On the other hand, we have sorting algorithms that can easily be simulated in a multicore processor since they can divide the given problem into subproblems to solve after which the solutions can be combined together to arrive at or come up with a complete solution to the problem. This algorithms includes Quick sort and Merge sort, they make use of Divide and Conquer paradigm.
Research and a well-written problem statement are important because
ANSWER: A) they give a clear understanding of the problem and its solution
Answer:
they give a clear understanding of the problem and its solution
Answer:
The answer is in the question,A
Explanation:
They give a clear understanding of the problem and its solution
You are planning to use Spark to create a machine learning model that recommends restaurants to users based on user details and past ratings for restaurants What is the simplest way to implement this model? Use a Logistic Regression algorithm to train a classifier. Use a K-Means algorithm to create clusters. Use an alternating least squares (ALS) algorithm to create a collaborative filtering solution. Use a Decision Trees algorithm to train a regression model.
Answer:
The third point i.e " Use an alternating least squares (ALS) algorithm to create a collaborative filtering solution" is the correct answer .
Explanation:
The Alternating Less Squares is the different approach that main objective to enhancing the loss function.The Alternating Less Squares process divided the matrix into the two factors for optimizing the loss .The divided of two factor matrix is known as item matrix or the user matrix.
As we have to build the machine learning model which proposes restaurants to restaurants that are based on the customer information and the prior restaurant reviews the alternating least squares is the best model to implement this .All the other options are not the correct model also they are not related to given scenario that's why they are incorrect options.Which body of water is most likely to be a marine ecosystem?
Answer:
The body of water that is most likely to be a marine ecosystem would be an estuary.
Explanation:
An estuary is a widened, often funnel-shaped mouth of a river, where fresh river water and salt sea water are mixed and thus brackish water is created, and where tidal differences can be observed. When a river flows as a system of branches, it is called a delta.
Estuaries often have a great natural value. They typically consist of swallows and salt marshes that are very rich in invertebrates and thus have a great attraction for birds, among other things.
We have three containers whose sizes are 10 pints, 7 pints, and 4 pints, respectively. The 7-pint and 4-pint containers start out full of water, but the 10-pint container is initially empty. We are allowed one type of operation: pouring the contents of one container into another, stopping only when the source container is empty or the destination container is full. We want to know if there is a sequence of pourings that leaves exactly 2 pints in the 7-pint or 4-pint container.
(a) Model this as a graph problem: give a precise definition of the graph involved and state the specific question about this graph that needs to be answered.
(b) What algorithm should be applied to solve the problem?
(c) Find the answer by applying the algorithm.
Answer:
well, idc
Explanation:
Complete data are very rare because some data are usually missing. There are typically four strategies to handle missing data.
Ignore the variables with missing data.
Delete the records that have some missing values.
Impute the missing values (i.e., simply fill in the missing values with some other value, such as the mean of similar records with data).
Use a data mining technique that can handle missing values, such as CART, which is one of a few techniques that handle missing data pretty well.
Suppose you are working on a project to model a hotel company's customer base. The goal is to determine which customer attributes are correlated with a high number of hotel stays. You have access to data from a customer survey, but one field (which is optional) is yearly income and has some missing values equaling roughly 5% of the records. Which of the strategies should be used? Explain why. Suppose you chose the third strategy. Explain how you would impute the missing incomes.
Answer:
see explaination
Explanation:
If I am to select I will select the strategy Impute the missing values . Because rather than deleting and all the other strategies. This is the best option because, this is an optional field as described there is no need for such accurate information about salary.
If we want to maintain this field we can just fill the value by identifying the similar records which is the other customers who is visiting the same no of times and fill that.
How many seconds are required to make a left turn and join traffic?
Why is it difficult to convince top management to commit funds to develop and implement a Strategic Information System
Answer:
It is difficult to convince top management to commit funds to develop and implement an SIS because it can lead to reengineering, which requires businesses to revamp processes to undergo organizational change to gain an advantage.
Explanation:
Write a script that declares and sets a variable that’s equal to the total outstanding balance due. If that balance due is greater than $10,000.00, the script should return a result set consisting of VendorName, InvoiceNumber, InvoiceDueDate, and Balance for each invoice with a balance due, sorted with the oldest due date first. If the total outstanding balance due is less than $10,000.00, return the message "Balance due is less than $10,000.00."
Answer:
see explaination
Explanation:
SCRIPT :
drop table Vendor;
create table Vendor (VendorName varchar2(20), InvoiceNumber number (20), InvoiceDueDate date, Balance number(32,6));
insert into VENDOR (VENDORNAME,INVOICENUMBER,INVOICEDUEDATE,BALANCE) values ('ABC',121,TO_TIMESTAMP('01-01-18','DD-MM-RR HH12:MI:SSXFF AM'),1000);
Insert into Vendor (VENDORNAME,INVOICENUMBER,INVOICEDUEDATE,BALANCE) values ('XYZ',1212121,to_timestamp('02-01-18','DD-MM-RR HH12:MI:SSXFF AM'),100000);
declare
cursor c1 is select * from Vendor;
begin
for i in c1
loop
if I.BALANCE < 1001 then
DBMS_OUTPUT.PUT_LINE('Vendor Name '||I.VENDORNAME||', Invoice Number '||I.INVOICENUMBER||', Invoice DueDate '||I.INVOICEDUEDATE||',BALANCE '||I. BALANCE);
else
dbms_output.put_line('Vendor Name '||i.VendorName||', Invoice Number '||i.InvoiceNumber||', Invoice DueDate '|| i.InvoiceDueDate||' Balance due is less than $1000');
end if;
end LOOP;
end;
output : SCRIPT OUTPUT
table VENDOR dropped.
table VENDOR created.
1 rows inserted.
1 rows inserted.
anonymous block completed
dbms output :
Vendor Name ABC, Invoice Number 121, Invoice DueDate 01-JAN-18,BALANCE 1000
Vendor Name XYZ, Invoice Number 1212121, Invoice DueDate 02-JAN-18 Balance due is less than $1000
What are examples of common computer software problems? Check all that apply
Pages with fading ink come out of a printer.
Programs suddenly quit or stop working.
O Documents close without warning.
O A video file stops playing unexpectedly.
A program updates to the latest version.
A computer crashes and stops working.
Answer:
its A C E
Explanation:
A Transmission Control Protocol (TCP) connection is in working order and both sides can send each other data. What is the TCP socket state?
Answer:
The TCP socket state will be as 'Closed'.
Explanation:
TCP seems to be a framework that describes how well a web discussion can be established and maintained through which software applications could access information.
The accompanying is the finished status whenever the connection is suspended by TCP:
CLOSE-WAIT:
This means that the end destination had already chosen to take a similar requirement from the 'remote endpoint.'
CLOSING:
This indicates the position for the cancellation of server access verification from either the faraway TCP.
LAS-ACK:
This indicates the view for approval including its extermination previously sent through the cell tower TCP.
TIME-WAIT:
This symbolizes a lengthy delay for all the remote to accept verification of its cancellation request.
CLOSED:
This means that there is no link region or anything like that.
The data structure used for file directory is called
Select one
a. process table
b. mount table
C. hash table
d file table
Days of Each Month Design a program that displays the number of days in each month. The program’s output should be similar to this: January has 31 days. February has 28 days. March has 31 days. April has 30 days. May has 31 days. June has 30 days. July has 31 days. August has 31 days. September has 30 days. October has 31 days. November has 30 days. December has 31 days. Psuedocode
Answer:
A python script:
months = ["January", "February", "March", "April", "May", "June", "July", "August", "September", "October", "November", "December"]
numbers = [31,28,31,30,31,30,31,31,30,31,30,31]
counter = 0
numbers_length=len(numbers)-1
while counter <= numbers_length:
month=months[counter]
number=numbers[counter]
print (month + " has " + str(number) + " days")
counter = counter+1
Explanation:
The Python script above will generate this output:
January has 31 days.
February has 28 days.
March has 31 days.
April has 30 days.
May has 31 days.
June has 30 days.
July has 31 days.
August has 31 days.
September has 30 days.
October has 31 days.
November has 30 days.
December has 31 days.
If many programs are kept in main memory, then there is almostalways another program ready to run on the CPU when a page faultoccurs. Thus, CPU utilization is kept high. If, however, we allocate alarge amount of physical memory to just a few of the programs, theneach program produces a smaller number of page faults. Thus, CPUutilization is kept high among the programs in memory. What would the working set algorithm try to accomplish, and why?(Hint: These two cases represent extremes that could lead toproblematic behavior.)
Answer:
With the analysis of the case, we can infer that regarding the model or algorithm of the work set, we want to reduce page faults in each individual process, guaranteeing that the set of pages are included before executing the process.
There are things that should not change, such as the set of pages used in the process or the working set as they are called, they could only change if a program moves to a different phase of execution. In this way the most suitable and profitable approach is proposed for the use of time in the processor, by avoiding bringing oagines from the hard disk and instead of this the process is executed, because otherwise it would take a long time what was observed in decreased performance.
Regarding what was mentioned in the question, it follows that 2 extremes lead to a problematic behavior, to define the first as a page fault and the second refers to a small number of processes executed.
Write a Java code for the following requirement.
File encryption is the science of writing the contents of a file in a secret code.
The encryption program should work like a filter, reading the contents of one file, modifying the data into code, and then writing the code contents out to a second file. The second file will be a version of the first file, but written in a secret code.
Although there are complex encryption techniques, you should come up with a simple one of your own. For example, you could read the first file one character at a time and add 10 to the character code of each character before it is written to the second file.
Answer:
import java.io.File;
import java.io.FileInputStream;
import java.io.FileNotFoundException;
import java.io.FileOutputStream;
import java.io.IOException;
import java.util.Scanner;
public class EncryptFileData
{
public static void main(String args[]) throws IOException, FileNotFoundException
{
String inputFileName="input.txt";
String outputFileName="EncryptedFile.txt";
String decryptFileName="DecryptedFile.txt";
byte codeValue;
Scanner sc=new Scanner(System.in);
//Accept code value from user
System.out.println("Enter the value of code");
codeValue=sc.nextByte();
//Encrypt the input file
encryptFileContent(inputFileName, codeValue,outputFileName);
//Decrypt the input file
decryptFileContent(outputFileName, codeValue,decryptFileName);
}
//function to encrypt the input file
private static void encryptFileContent(String inputFileName,
byte encodeValue, String outputFileName) throws IOException, FileNotFoundException{
File file = new File(inputFileName);
FileInputStream fin = new FileInputStream(file);
FileOutputStream fout = new FileOutputStream(outputFileName);
try{
while(fin.available() != 0){
int inData = fin.read();
//For every character in input add code value and
//write result to file "EncryptedFile.txt"
fout.write(inData+encodeValue);
}
}finally{
fin.close();
fout.close();
}
}
//function to decrypt the encrypted file
private static void decryptFileContent(String inputFileName,
byte encodeValue, String outputFileName) throws IOException, FileNotFoundException{
File file = new File(inputFileName);
FileInputStream fin = new FileInputStream(file);
FileOutputStream fout = new FileOutputStream(outputFileName);
try{
while(fin.available() != 0){
int inData = fin.read();
//For every character in encrypted file
//subtract the code value from each character and
//write it to file "DecryptedFile.txt"
fout.write(inData-encodeValue);
}
}finally{
fin.close();
fout.close();
}
}
}
Explanation:
Given the following conditions to follow in the question;
=> "The encryption program should work like a filter, reading the contents of one file, modifying the data into code, and then writing the code contents out to a second file. "
=> "The second file will be a version of the first file, but written in a secret code."
Thus, the Java code is given below(one can just copy and run it to give a sample output of: Enter the value of code 1 2.
The Java code is;
import java.io.File;
import java.io.FileInputStream;
import java.io.FileNotFoundException;
import java.io.FileOutputStream;
import java.io.IOException;
import java.util.Scanner;
public class EncryptFileData
{
public static void main(String args[]) throws IOException, FileNotFoundException
{
String inputFileName="input.txt";
String outputFileName="EncryptedFile.txt";
String decryptFileName="DecryptedFile.txt";
byte codeValue;
Scanner sc=new Scanner(System.in);
//Accept code value from user
System.out.println("Enter the value of code");
codeValue=sc.nextByte();
//Encrypt the input file
encryptFileContent(inputFileName, codeValue,outputFileName);
//Decrypt the input file
decryptFileContent(outputFileName, codeValue,decryptFileName);
}
//function to encrypt the input file
private static void encryptFileContent(String inputFileName,
byte encodeValue, String outputFileName) throws IOException, FileNotFoundException{
File file = new File(inputFileName);
FileInputStream fin = new FileInputStream(file);
FileOutputStream fout = new FileOutputStream(outputFileName);
try{
while(fin.available() != 0){
int inData = fin.read();
//For every character in input add code value and
//write result to file "EncryptedFile.txt"
fout.write(inData+encodeValue);
}
}finally{
fin.close();
fout.close();
}
}
//function to decrypt the encrypted file
private static void decryptFileContent(String inputFileName,
byte encodeValue, String outputFileName) throws IOException, FileNotFoundException{
File file = new File(inputFileName);
FileInputStream fin = new FileInputStream(file);
FileOutputStream fout = new FileOutputStream(outputFileName);
try{
while(fin.available() != 0){
int inData = fin.read();
//For every character in encrypted file
//subtract the code value from each character and
//write it to file "DecryptedFile.txt"
fout.write(inData-encodeValue);
}
}finally{
fin.close();
fout.close();
}
}
}
You and your friends are driving to Tijuana for springbreak. You are saving your money for the trip and so you want to minimize the cost of gas on the way. In order to minimize your gas costs you and your friends have compiled the following information.
First your car can reliably travel m miles on a tank of gas (but no further). One of your friends has mined gas-station data off the web and has plotted every gas station along your route along with the price of gas at that gas station. Specifically they have created a list of n+1 gas station prices from closest to furthest and a list of n distances between two adjacent gas stations. Tacoma is gas station number 0 and Tijuana is gas station number n. For convenience they have converted the cost of gas into price per mile traveled in your car. In addition the distance in miles between two adjacent gas-stations has also been calculated. You will begin your journey with a full tank of gas and when you get to Tijuana you will fill up for the return trip.
You need to determine which gas stations to stop at to minimize the cost of gas on your trip.
1. Express this problem formally with input and output conditions.
2. State a self-reduction for your problem.
3. State a dynamic programming algorithm based off your seld reduction that computes the minimum gas cost.
Answer:
Explanation:
.Car can Travel a m miles tank on a gas
2.For N distance there are n+1 adjacent gas stations.
Output Conditions:
Tacoma will fill the gas station while going.
Tijuana will fill up gas for the return trip
3.Dynamic self Reduction Algorithm
Start
if(n==0)
Tacoma is a gas station number 0;
else
Tijuana is a gas station n+1;
stop