- Trending Categories
- Data Structure
- Networking
- RDBMS
- Operating System
- Java
- iOS
- HTML
- CSS
- Android
- Python
- C Programming
- C++
- C#
- MongoDB
- MySQL
- Javascript
- PHP

- Selected Reading
- UPSC IAS Exams Notes
- Developer's Best Practices
- Questions and Answers
- Effective Resume Writing
- HR Interview Questions
- Computer Glossary
- Who is Who

# For the given figure, which one is the mirror line, $ l_{1} $ or $ l_{2} $ ?

"

To do:

We have to find the mirror line in the given figure.

Solution:

**Mirror line:**

A mirror line is a line which can be drawn onto a shape to show that both sides have reflective symmetry.

When the given figure is folded about the line $l_2$ the left part exactly covers the right part and vice versa.

Therefore,

In the given figure, $l_2$ is the mirror line.

- Related Questions & Answers
- Show that every SLR (1) is unambiguous, but some unambiguous grammars are not SLR (1). Check this for the following productions. S → L = R S → R L →* R L → id R → L
- Queries for Bitwise OR in the Index Range [L, R] of the Given Array using C++
- Design NPDA for accepting the language L = {am b(2m) | m>=1}
- What is Algorithm of Predictive Parsing and compute FIRST and FOLLOW for the following Grammar S → L = R S → R L →* R L → id R → L
- Construct a Turing Machine for language L = {0n1n2n | n≥1}
- Construct PDA for L = {0n1m2(n+m) | m,n >=1}
- C Program to construct a DFA which accepts L = {aN | N ≥ 1}
- Construct a PDA for language L = {0n 1m2m3n | n>=1, m>=1}
- Construct a Turing Machine for language L = {wwr | w ∈ {0, 1}}
- Construct a ∈-NFA for the language L = (a* + b*)
- Construct ∈-NFA of Regular Language L = 0(0+1)*1
- Queries for bitwise AND in the index range [L, R] of the given Array using C++
- Construct PDA for accepting L = {anb(2n) | n>=1} U {anbn | n>=1}
- XOR of all the elements in the given range [L, R] in C++
- Construct a Turing Machine for L = {a^n b^n | n>=1}
- Construct a TM for the language L= {ww : w ∈ {0,1}}

Advertisements