## Where are the GATE (GATE – General Architecture of Text Engineering ) example files?

Just installed the Open Source software, GATE, with what appears to be the most recent stable version of GATE – Release 8.6 (June 10th 2019), using the “Platform Specific Installer for Windows”. The installation went smoothly and finished with a “Done Screen” that indicated, “Installation has completed successfully”.

I’ve run the application and followed some basic orientation tutorials. The application appears to be functioning as designed. Some later tutorials demonstrate opening the “Example” files used with these tutorials. I cannot find these example files. I’ve searched the application’s folders and there are no such files. Is there a separate folder located elsewhere for saving / opening the GATE files?

Link to the Gate website: https://gate.ac.uk/overview.html

## Total number of WW, WR, RW conflicts in the given example?

+---+------+------+ |   | T1   | T2   | +---+------+------+ | 1 | W(A) |      | | 2 |      | R(A) | | 3 | W(A) |      | | 4 |      | R(A) | | 5 | W(A) |      | | 6 |      | W(A) | | 7 | W(A) |      | | 8 |      | W(A) | +---+------+------+ 

In the above scenario can someone tell me how many WW, WR, RW conflicts are there? Can we say that there is a WR(write read) conflict between transactions 1 and 2 from statement 1 to statement 4? As the A value is updated at statement 3, 4th statement read conflicts only with 3rd statement write but not 1st statement write. Can someone tell me in total how many WW, WR, RW conflicts are there between the two transactions?

## What is an example of a schedule that is strict but not serial?

According to the definition of a strict schedule a value written by a transaction T is not read or overwritten by other transactions until T either aborts or commits.

Also, we say that the set of serial schedules is a proper subset of the set of strict schedules.

So what can be an example of a schedule that is strict but not serial? I am just not able to imagine one.

Thanks.

## Example of two undecidable languages that cannot be reduced to each other

I want to find two undecidable languages $$A$$ and $$B$$ that $$A$$ cannot reduce to $$B$$, $$B$$ cannot reduce to $$A$$(Turing-reduce). One of my thought is to let $$A$$ be the halting problem, let $$B$$ be some non-Turing-recognizable language, then it is clear that $$B$$ cannot reduce to $$A$$, but I don’t know which $$B$$ can I pick to show that $$A$$ cannot reduce to $$B$$

## Is there an example of when DFS will not return the min. spanning tree?

If we have a connected, weighted, undirected graph. Can anyone provide an example where DFS will not return the MST? No matter what vertex we start from ?

## Example of non-regular context free language L such that prefix(L) is regular

Suppose we have some non-regular context free language L. Suppose we also have language of all prefixes of words in L.

What can be an example of non-regular language L such that language of it’s prefixes is regular (Can be represented by a finite automaton)?

I don’t understand how language of prefixes can ever be regular, since the set of prefixes of a word include the word itself.

For example $$L= a^nb^n$$ is my non-regular language. The language of it’s prefixes would include : $$\epsilon,a^n$$ where $$n\ge 1$$,$$a^nb$$ where $$n\ge 1$$ etc…

But what about b’s ? We need to know how many a’s there were in the first place. Therefore I don’t see how the language of prefixes can be regular.

## Good example of a multi-column form

What is a good example(s) of such form? I know that the general rule is to stick to the single-column pattern, but in my opinion many of such “rules” comes from people working on relatively simple websites. And too often the reference is a registration/purchase form. I am thinking about business apps, where users are using the form repeatedly.

## How exactly works this SQL injection example related to the DVWA application?

I am a software developer converting do application security and I have some doubts about SQL injection example.

I am following a tutorial related the famous DVWA: http://www.dvwa.co.uk/

So I have the following doubt (probably pretty trivial).

I have this PHP code defining the query and the code to perform it:

<?php  if( isset( $_GET[ 'Submit' ] ) ) { // Get input$  id = $_GET[ 'id' ]; // Check database$  getid  = "SELECT first_name, last_name FROM users WHERE user_id = '$id';";$  result = mysqli_query($GLOBALS["___mysqli_ston"],$  getid ); // Removed 'or die' to suppress mysql errors      // Get results     $num = @mysqli_num_rows($  result ); // The '@' character suppresses errors     if( $num > 0 ) { // Feedback for end user$  html .= '<pre>User ID exists in the database.</pre>';     }     else {         // User wasn't found, so the page wasn't!         header( $_SERVER[ 'SERVER_PROTOCOL' ] . ' 404 Not Found' ); // Feedback for end user$  html .= '<pre>User ID is MISSING from the database.</pre>';     }      ((is_null($___mysqli_res = mysqli_close($  GLOBALS["___mysqli_ston"]))) ? false : $___mysqli_res); } ?>  As you can see the query is definied as string concatenation: $  getid  = "SELECT first_name, last_name FROM users WHERE user_id = '$id';";  So I can inject what I want into the$ id variable and perform extra SQL code as: