Blog

Important: Please do not use any programming tools. Which of the following function removes all leading and trailing whitespace in string? Just name the function like myFunction()

Important: Please do not use any programming tools. Name the error that doesn’t cause program to stop/end, but the output is not the desired result or is incorrect.

Important: Please do not use any programming tools. What would you do if the requirement is to make float 3.39 to an int 3

Important: Please do not use any programming tools. Which one of the following if statements will not execute successfully:

(1) How many three digit positive integers are divisible by 13? (Please enter your answer as an integer.)  [a1]  (2) What is the probability of randomly selecting an integer divisible by 11 from among the three digit positive integers? (Please enter your answer in the form m/n, where m and n are positive integers.) [a2] 

Suppose there are five roads from city A to city B and three roads from city B to city C.  (1) How many way is it possible to travel from city A to city C via city B? [a1] (2) How many round-trip routs are there from city A to B to C to B and back to A? [a2] (3) How many different routs are there from cities A to B to C to B and back to A in which no road is traversed twice? [a3] (Please enter your answers as integers.) 

A certain passcode is required to be a sequence of any 3 digits chosen from the ten digits followed by 2 letter chosen from the set {a, b, c, d}. (1) How many passcodes are possible if repetition of digits and letters is allowed?  [a1] (2) How many passcodes contain no repeated digits and no repeated letters? [a2] (3) How many passcodes are possible if repetition of digits is allowed but no repeated letters? [a3] (4) What is the probability that a passcode chosen at random has at least one repeated digit or one repeated letter,  assuming that all passcodes are equally likely? (Please fill the blank with a numerical value in the form of m/n, where m and n are positive integers.) [a4] In (1), (2) and (3), please enter your answers as integers.

 Assume you have the following jobs to execute with oneprocessor:Process Arrival time  Burst time p_0        0                    7 p_1        1                    5 p_2        2                    3 Calculate and show the average wait time for this set of processes using the followingalgorithms.  Specify the arbitration rule used for each algorithm, ifneeded. Assume no time taken by scheduler. Show your work.a) Shortest job next (non-preemptive)b) Shortest remaining time next (pre-emptive)c) Round robin, with a quantum of 3

The linux fair scheduler always schedules the processes in the highest priority queue. How does it make sure that the lower priority processes are not starved?

Which of the following situations would require an additional blood pressure measurement?