Hello There,

This is discussion Question

For Advanced Database Systems

Question:

(a) Please define what a “trigger” is. If your answer is from the textbook, please state which page of the textbook from which you got the definition. If your answer is not from the textbook, please also include the complete reference.

(b) Please define what “PL/SQL” is. If your answer is from the textbook, please state which page of the textbook from which you got the definition. If your answer is not from the textbook, please also include the complete reference.

(c) Please define what a “transaction” is. If your answer is from the textbook, please state which page of the textbook from which you got the definition. If your answer is not from the textbook, please also include the complete reference.

(d) Please define “concurrency control” in database operations. If your answer is from the textbook, please state which page of the textbook from which you got the definition. If your answer is not from the textbook, please also include the complete reference.

Thank you

How do I make this sort in true alphabetical order instead of ascii(ABCabc) order? I am trying to get AaBbCc. Currently I get ABCabc. please help... here is the code using VB:

Public Class frmTransfer

    Dim strSortArray() As String

    Private Sub txtInput_TextChanged(sender As Object, e As EventArgs) Handles txtInput.TextChanged

        Dim intUpper As Integer

        Dim intCount As Integer

        intUpper = Len(txtInput.Text) - 1       REM -1 because array starts at 0

        For Each chr As Char In txtInput.Text       REM for each chr(character) entered as a character in the text box

            If ((Asc(chr) > 64) And (Asc(chr) < 91)) Or ((Asc(chr) > 96) And (Asc(chr) < 123)) Or ((Asc(chr) > 31) And (Asc(chr) < 65)) Then     REM If the character entered is a letter

                ReDim Preserve strSortArray(intUpper)           REM preservers previous data and adds new slot to array

                strSortArray(intCount) = chr            REM sets the array at position intCount equal to chr

                intCount = intCount + 1                 REM increases intCount by 1

            End If

        Next chr

    End Sub

    Private Sub btnTransfer_Click(sender As Object, e As EventArgs) Handles btnTransfer.Click

        Dim X As Integer

        Dim Y As Integer

        Dim temp As String

        For X = LBound(strSortArray) To (UBound(strSortArray) - 1)

            For Y = LBound(strSortArray) To (UBound(strSortArray) - 1)

                If Asc(strSortArray(Y)) > Asc(strSortArray(Y + 1)) Then

                    ' exchange the items

                    temp = strSortArray(Y)

                    strSortArray(Y) = strSortArray(Y + 1)

                    strSortArray(Y + 1) = temp

                End If

            Next Y

        Next X

        lblOutput.Text = String.Join("", strSortArray)

    End Sub

End Class

Write a Bash script called move that could replace the UNIX command mv. 'move' tries to rename the source file (using the UNIX command mv), but if the destination file exists, appends an index number, a sort of version number, to the destination file. So if the user types:

move a.txt b.txt

and b.txt already exists, move will rename the file to b.txt.1. If b.txt.1 already exists, move must rename the file to be b.txt.2, and so on, until the file can be successfully renamed with a name that does not already exist.

This is what I have so far but for some reason instead of indexing the filenames .1, .2, .3 it does .1, .1.1, .1.1.1 which I am confused on how to fix.

#!/bin/bash

if [ -f "$1" ] && [ -f "$2" ]; then
x = 1

while [ -f $2"."$x ]
do
x=$((x+1))
done

mv $1 $2"."$x

else
mv $1 $2
fi

1. Write program in C language using Pthreads API to simulate the real problem, the Sleeping Teaching Assistant, using what we have studied IPC and synchronization. Refer to Section 5.9.4 for specific instructions on mutex lock and semaphore.
2. If there are multiple files in your submission, you need to provide a makefile.
3. Include the compilation command with required options at the very beginning of your code.

he Sleeping Teaching AssistantA university computer science department has a teaching assistant (TA) whohelps undergraduate students with their programming assignments duringregular ofFce hours. The TA’s ofFce is rather small and has room for only onedesk with a chair and computer. There are three chairs in the hallway outsidethe ofFce where students can sit and wait if the TA is currently helping anotherstudent. When there are no students who need help during ofFce hours, theTA sits at the desk and takes a nap. If a student arrives during ofFce hoursand Fnds the TA sleeping, the student must awaken the TA to ask for help. If astudent arrives and Fnds the TA currently helping another student, the studentsits on one of the chairs in the hallway and waits. If no chairs are available, thestudent will come back at a later time

: Write a paragraph to reflect on what you have learned about Microsoft access in terms of the difference between relational databases versus spreadsheets. Discuss ways in which a relational database could be useful for your work (if you have a job) or for your personal or professional projects (if you are a full-time student)

Assignment 4, Fraction Comparable

Instructions

For this assignment, you will be updating the Fraction class from Assignment 1. To get started, you can either make a copy of your Assignment 1 Fraction.java or download the Fraction.java template at the bottom of this assignment.

You will need to update Fraction so that it implements the Comparable interface. This will require adding an implements statement to the class declaration as well as the compareTo method. You will also add a simplify method which reduces a fraction to its lowest terms and, to help you with this, a static method gcd which finds the greatest common divisor of two integers.

The requirements of the methods to be added are as follows:

• int compareTo(Object other): Return -1 if this fraction is smaller than the fraction other, return 0 if this fraction is equal to the fraction other, and return 1 if this fraction is greater than the fraction other. Hint: To compare the two fractions, it will help to first convert them to fractions with a common (equal) denominator.
• static int gcd(int a, int b): return the greatest common divisor of a and b. To find the gcd of two numbers there are several possible algorithms. One of these was showcased in term 1 lesson 19 - More Loops.
• void simplify(): reduce the fraction to its simplest possible form: e.g. the fraction 12/18 should be reduced to 2/3. The static method gcd provides a useful helper for this method.

When you have successfully written your simplify method, you should add calls to this method at the end of the Fraction(int n, int d) constructor and the add method. This will ensure that fractions are always stored in their simplest possible form.

To test your code, download the runner class student_fraction_runner.java (Links to an external site.) into the same folder that holds your Fraction.java. Execute the method student_fraction_runner.main, and verify that the output matches the sample run listed below. Remember to change the runner to test with other values to make sure your program fits all the requirements. We will use a similar but different runner to grade the program.

When you are ready, paste your entire Fraction.java class in the box below, click run to test the output, and click submit when you are satisfied with your results.

Note: once you have completely finished the assignment feel free to add more methods (e.g. multiply) or extend the functionality of your Fraction class to include, for example, negative fractions. Make sure you submit your assignment first before making any changes like this.

Sample Run

Fraction 1: 4/5
Fraction 2: 3/2
Fraction 3: 4/5

Compare fraction 1 to fraction 2: -1
Compare fraction 2 to fraction 1: 1

Compare fraction 1 to fraction 3: 0
Compare fraction 3 to fraction 1: 0

Compare fraction 2 to fraction 3: 1
Compare fraction 3 to fraction 2: -1

Milestones

As you work on this assignment, you can use the milestones below to inform your development process:

Milestone 1: Write the static gcd method and test this by calling it on pairs of integers from another class.

Milestone 2: Write the simplify method (you will probably find it useful to call the gcd method). Add calls to this method at the end of the constructor and the add method.

Milestone 3: Implement the Comparable interface and write the method compareTo. Download the runner file and ensure the results are as expected.

Site map for your e-commerce site. How many webpages this site has? What’s the name of each page? (You may use a rectangle box to represent a page).

I'm trying to Generate number every 3 seconds and update the currenet number.I'm able to generate number every 3 seconds; However, the current number isn't update. I apperciate any help.

public static void main(String[] args) {
    
    Runnable helloRunnable = new Runnable() {
        public void run() {
      
            CurrentNum=task2();
        
            System.out.println("Result    ====    "+CurrentNum);

        }
    };

    ScheduledExecutorService executor = Executors.newScheduledThreadPool(1);
    executor.scheduleAtFixedRate(helloRunnable, 0, 3, TimeUnit.SECONDS);
    
     System.out.println("CurrentNum    ====    "+CurrentNum);
     
    
}
public static int task2() {
    // create instance of Random class 
    Random rand = new Random(); 

    // Generate random integers in range 0 to 999 
    int rand_int1 = rand.nextInt(1000); 
    
    return rand_int1;
}

outPut:

    CurrentNum    ====    0
    Result    ====    631
    Result    ====    789
    Result    ====    958

I want the output tobe:

    Result    ====    631
    CurrentNum ====    631
    Result    ====    789
    CurrentNum====    789

Question: Use backtracking algorithm design to write Java code to solve the subset problem: given a set of distinct integers, return all possible subsets. for example, input: new int[] {1,2,3}

output: [], [3], [2], [2,3], [1], [1,3], [1,2], [1,2,3]

Visual Basic program in visual studio please

Write a function that checks whether a string has a number based. Use what we learned about Asc to complete the following:

Function CheckLength (S As String) As Boolean

‘add a do loop to start at first character

‘if Ascii current character is between Asc (“0”) and Asc (“9”)

‘then we have a hit Return True

‘else check the next character

‘if loop is over, that means no hit was found Return False

End Function

Use this function in an application that allows the user to enter the string/text that should be tested by your CheckLength function.

Please submit your completed application.

Dirac's Theorem states that "A simple graph with n vertices (n >= 3) is Hamiltonian if every vertex has degree n / 2 or greater". Show that K n,n is Hamiltonian for all n >= 3

2. Compare and compare the matrix multiplication algorithm and the Floyd-Warshall algorithm to find all pairs shortest paths from the perspective below.

1. greedy vs dynamic programming
2. recurrence relation
3. relaxation process
4. time & space complexity

You are the network administrator for your organization. Your DHCP server (Server1) has a scope of 10.10.16.0 to 10.10.16.254 with a subnet mask of /20.

How would the Get-DhcpServerv4Scope ensure that all of the client computers obtain an IP address from Server1.

python3

Let x0,...,xn−1 be n numbers stored in the list x. The median of x, denoted median(x) is the “middle”-value of the numbers in x in the sense that half of the numbers in x are less than the median and the other half of the numbers in x are greater than the median. Let y denote a copy of x sorted in ascending order. Then median(x)=(y[n+1 2 −1] if n is oddy [n 2−1]+y[n 2] 2 if n is even. Complete the function my_median with the following specifications: • It that takes in one parameter, x, which is a list of numbers. • It returns median(x). • Do not alter x. Evaluating your function my_median(x) should not change the value of the list x. • Do not use Python’s built-in median function.