- 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

# Let $l$ be a line and $P$ be a point not on $l$. Through $P$, draw a line $m$ parallel to $l$. Now join $P$ to any point $Q$ on $l$. Choose any other point $R$ on $m$. Through $R$, draw a line parallel to $PQ$. Let this meet $l$ at $S$. What shape do the two sets of parallel lines enclose?

**Steps of construction:**

- Draw a line l, take a point A on it.
- Take a point P, not on l, and join A to P.
- Taking A as a center and with a convenient radius draw an arc cutting l at B and AP at C.
- Taking P as the center and with the same radius as before, draw an arc DE to intersect AP at F.
- Adjust the compass up to the length of BC and without changing the opening of the compass and taking F as the center, draw an arc to intersect the previous drawn arc DE at point G.
- Join P to point G to draw a line m. Line m will be parallel to l.
- Join P to any point Q on line l. Choose another point R on line m.
- Similarly, a line can be drawn through point R and parallel to PQ using the above steps. Let it meet line l at point S.

Thus, line PQ is parallel to RS. The shape enclosed by these two sets of parallel lines is a parallelogram PQRS with PR || QS and PQ || RS.

- Related Questions & Answers
- Write about profit and loss(P/L) on financial statement.
- Construct PDA for L = {0n1m2(n+m) | m,n >=1}
- Construct Pushdown automata for L = {0n1m2(n+m) | m,n = 0} in C++
- 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 Turing machine for L = {an bm a(n+m) - n,m≥1} in C++
- Generate a Context-free grammar for the language L = {anbm| m≠n}?
- Construct Pushdown automata for L = {0(n+m)1m2n | m, n = 0} in C++
- Construct Pushdown automata for L = {0m1(n+m)2n | m,n = 0} in C++
- Construct Pushdown automata for L = {a(2*m)c(4*n)dnbm | m,n = 0} in C++
- Construct Pushdown automata for L = {0n1m2m3n | m,n = 0} in C++
- Construct a PDA for language L = {0n 1m2m3n | n>=1, m>=1}
- 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
- How to create a point chart with point size increment based on the position of the point in R?
- Check whether the point (x, y) lies on a given line in Python
- Count pairs (p, q) such that p occurs in array at least q times and q occurs at least p times in C++
- Design NPDA for accepting the language L = {am b(2m) | m>=1}

Advertisements