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?
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?
Show Hint
- <head> < h1> Title </h1> </head> <body> Text <a href="page.html"> Link </a> </body>
- <html> <h1> Title </h1> Text <a> Link </a> </html>
- <html> <body> <h1> Title </h1> Text <a href="page.html"> Link </a> </body> </html>
- <html> <title> Title </title> Text <link> page.html </link> </html>
The Correct Option is C
Solution and Explanation
Top Questions on Regular expressions and finite automata
Match LIST-I with LIST-II \[\begin{array}{|c|c|c|}\hline \text{ } & \text{LIST-I} & \text{LIST-II} \\ \hline \text{A.} & \text{A Language L can be accepted by a Finite Automata, if and only if, the set of equivalence classes of $L$ is finite.} & \text{III. Myhill-Nerode Theorem} \\ \hline \text{B.} & \text{For every finite automaton M = $(Q, \Sigma, q_0, A, \delta)$, the language L(M) is regular.} & \text{II. Regular Expression Equivalence} \\ \hline \text{C.} & \text{Let, X and Y be two regular expressions over $\Sigma$. If X does not contain null, then the equation $R = Y + RX$ in R, has a unique solution (i.e. one and only one solution) given by $R = YX^*$.} & \text{I. Arden's Theorem} \\ \hline \text{D.} & \text{The regular expressions X and Y are equivalent if the corresponding finite automata are equivalent.} & \text{IV. Kleen's Theorem} \\ \hline \end{array}\]
\[\text{Matching List-I with List-II}\]
Choose the correct answer from the options given below:
- CUET (PG) - 2025
- Data Science
- Regular expressions and finite automata
- Let \( \Sigma = \{1,2,3,4\} \). For \( x \in \Sigma^* \), let \( {prod}(x) \) be the product of symbols in \( x \) modulo 7. We take \( {prod}(\epsilon) = 1 \), where \( \epsilon \) is the null string. For example, \[ {prod}(124) = (1 \times 2 \times 4) \mod 7 = 1. \] Define \[ L = \{ x \in \Sigma^* \mid {prod}(x) = 2 \}. \] The number of states in a minimum state DFA for \( L \) is ___________. (Answer in integer)
- GATE CS - 2025
- Theory of Computation
- Regular expressions and finite automata
Which one of the following regular expressions correctly represents the language of the finite automaton given below?
- GATE CS - 2022
- Theory of Computation
- Regular expressions and finite automata
Consider the following language: \[ L = \{ w \in \{0,1\}^* \mid w \text{ ends with the substring } 011 \} \] Which one of the following deterministic finite automata accepts \(L\)?
- GATE CS - 2021
- Theory of Computation
- Regular expressions and finite automata
- Want to practice more? Try solving extra ecology questions todayView All Questions