List of top Computer Science and IT Engineering Questions on Regular expressions and finite automata

Consider the following two finite automata 𝐷1 and 𝐷2.
Which of the following statements is/are true?

A web developer is creating a webpage where:
• A heading is displayed at the top
• A paragraph of text follows
• A link is provided to navigate to another webpage
Which of the following HTML code snippets correctly represents this structure?

In a Client-Server computing model, "Stateful" servers are characterized by:

In Public Key Cryptography (RSA), if 'A' wants to send a confidential message to 'B', 'A' should encrypt the message using:

Software coupling is a measure of the degree of interdependence between modules. Which of the following is the most desirable (best) type of coupling?

In a relational schema, a "Foreign Key" is used to enforce:

Which phase of a compiler checks variable declaration?

In a compiler, which phase is responsible for identifying the token types from the source program's stream of characters?

Which of the following intermediate code representations is typically used to represent expressions where each instruction has at most three operands?

In the context of code optimization, "Loop Invariant Code Motion" refers to:

A lexical analyser processes the input string int x = a + 10; How many tokens are generated?

Consider the code:
$X = a * 2$
$Y = a * 2$
After optimization, what is the most efficient transformation?

What type of automaton is mainly used for simple pattern matching?

In a deterministic finite automaton, the behaviour of transitions is strictly defined for every input symbol at each state. Identify the statement that correctly describes this property.