The regular expression for the complement of the language L = {anbm|n≥4, m≤3} is: (A) (λ + a + aa + aaa)b* + a*bbbb* + (a + b)*ba(a + b)* (B) (λ + a + aa + aaa)b* + a*bbbbb* + (a + b)*ab(a + b)* (C) (λ + a + aa + aaa) + a*bbbbb* + (a + b)*ab(a + b)* (D) (λ + a + aa + aaa)b* + a*bbbbb* + (a + b)*ba(a + b)*

The regular expression for the complement of the language L =

{anbm|n≥4, m≤3} is:

(A) (λ + a + aa + aaa)b* + a*bbbb* + (a + b)*ba(a + b)*

(B) (λ + a + aa + aaa)b* + a*bbbbb* + (a + b)*ab(a + b)*

(C) (λ + a + aa + aaa) + a*bbbbb* + (a + b)*ab(a + b)*

(D) (λ + a + aa + aaa)b* + a*bbbbb* + (a + b)*ba(a + b)*
by

1 Answer

Answer :

(D) (λ + a + aa + aaa)b* + a*bbbbb* + (a + b)*ba(a + b)*
by

Related questions

The context free grammar for the language L = {an bm | n≤m+3, n≥0, m≥0} is (A) S→aaaA; A→aAb|B, B→Bb|λ (B) S→aaaA|λ, A→aAb|B, B→Bb|λ (C) S→aaaA|aaA|λ, A→aAb|B, B→Bb|λ (D) S→aaaA|aaA|aA|λ, A→aAb|B, B→Bb|λ

Description : The context free grammar for the language L = {an bm | n≤m+3, n≥0, m≥0} is (A) S→aaaA; A→aAb|B, B→Bb|λ (B) S→aaaA|λ, A→aAb|B, B→Bb|λ (C) S→aaaA|aaA|λ, A→aAb|B, B→Bb|λ (D) S→aaaA|aaA|aA|λ, A→aAb|B, B→Bb|λ

Last Answer : (D) S→aaaA|aaA|aA|λ, A→aAb|B, B→Bb|λ

Given L1 = L(a*baa*) and L2 = L(ab*) The regular expression corresponding to language L3 = L1/L2 (right quotient) is given by (A) a*b (B) a*baa* (C) a*ba* (D) None of the above

Description : Given L1 = L(a*baa*) and L2 = L(ab*) The regular expression corresponding to language L3 = L1/L2 (right quotient) is given by (A) a*b (B) a*baa* (C) a*ba* (D) None of the above

Last Answer : (C) a*ba* 

Given the production rules of a grammar G1 as S1→AB | aaB A→a | Aa B→b and the production rules of a grammar G2 as S2→aS2bS2 | bS2aS2 | λ Which of the following is correct statement? (A) G1 is ambiguous and G2 is not ambiguous. (B) G1 is ambiguous and G2 is ambiguous. (C) G1 is not ambiguous and G2 is ambiguous. (D) G1 is not ambiguous and G2 is not ambiguous.

Description : Given the production rules of a grammar G1 as S1→AB | aaB A→a | Aa B→b and the production rules of a grammar G2 as S2→aS2bS2 | bS2aS2 | λ Which of the following is correct statement? ( ... G1 is not ambiguous and G2 is ambiguous. (D) G1 is not ambiguous and G2 is not ambiguous.

Last Answer : (B) G1 is ambiguous and G2 is ambiguous.

The grammar with production rules S → aSb |SS|λ generates language L given by: (A) L = {w∈{a, b}* | na(w) = nb(w) and na(v) ≥ nb(v) where v is any prefix of w} (B) L = {w∈{a, b}* | na(w) = nb(w) and na(v) ≤ nb(v) where v is any prefix of w} (C) L = {w∈{a, b}* | na(w) ≠ nb(w) and na(v) ≥ nb(v) where v is any prefix of w} (D) L = {w∈{a, b}* | na(w) ≠ nb(w) and na(v) ≤ nb(v) where v is any prefix of w}

Description : The grammar with production rules S → aSb |SS|λ generates language L given by: (A) L = {w∈{a, b}* | na(w) = nb(w) and na(v) ≥ nb(v) where v is any prefix of w} (B) L = {w∈{a, b}* | na(w) = nb(w) and na(v ... (D) L = {w∈{a, b}* | na(w) ≠ nb(w) and na(v) ≤ nb(v) where v is any prefix of w}

Last Answer : (A) L = {w∈{a, b}* | na(w) = nb(w) and na(v) ≥ nb(v) where v is any prefix of w} 

The Greibach normal form grammar for the language L={an bn+1|n≥0} is (A) S→a SB, B→bB|λ (B) S→a SB, B→bB|b (C) S→a SB|b, B→b (D) S→a Sb|b

Description : The Greibach normal form grammar for the language L={an bn+1|n≥0} is (A) S→a SB, B→bB|λ (B) S→a SB, B→bB|b (C) S→a SB|b, B→b (D) S→a Sb|b

Last Answer : (C) S→a SB|b, B→b 

The regular expression corresponding to the language L where L={x∈{0,1}* | x ends with 1 and does not contain substring 00 } is: (A) (1 + 01)* (10 + 01) (B) (1 + 01)* 01 (C) (1 + 01)* (1 + 01) (D) (10 + 01)* 01

Description : The regular expression corresponding to the language L where L={x∈{0,1}* | x ends with 1 and does not contain substring 00 } is: (A) (1 + 01)* (10 + 01) (B) (1 + 01)* 01 (C) (1 + 01)* (1 + 01) (D) (10 + 01)* 01

Last Answer : (C) (1 + 01)* (1 + 01) 

Let L be the language generated by regular expression 0*10* and accepted by the deterministic finite automata M. Consider the relation RM defined by M. As all states are reachable from the start state, RM has ................ equivalence classes. (A) 2 (B) 4 (C) 5 (D) 6

Description : Let L be the language generated by regular expression 0*10* and accepted by the deterministic finite automata M. Consider the relation RM defined by M. As all states are reachable from the start state, RM has ................ equivalence classes. (A) 2 (B) 4 (C) 5 (D) 6

Last Answer : (D) 6

Given the following statements : S1 : If L is a regular language then the language {uv | uϵL, vϵLR} is also regular. S2 : L = {wwR} is regular language. Which of the following is true ? (A) S1 is not correct and S2 is not correct. (B) S1 is not correct and S2 is correct. (C) S1 is correct and S2 is not correct. (D) S1 is correct and S2 is correct.

Description : Given the following statements : S1 : If L is a regular language then the language {uv | uϵL, vϵLR} is also regular. S2 : L = {wwR} is regular language. Which of the following is true ? (A) S1 is not ... S2 is correct. (C) S1 is correct and S2 is not correct. (D) S1 is correct and S2 is correct.

Last Answer : (C) S1 is correct and S2 is not correct.

Does a device exist where one can use AAA batteries in AA slots?

Description : Does a device exist where one can use AAA batteries in AA slots?

Last Answer : Not in the way you are describing. There are several battery chargers - Energizer makes some, Samsung does too, wherein the same slot will charge an AA and an AAA - but not at the same time. They ... controls - I suppose it is theoretically possibly do build it, but I have never seen one for sale.

How easily could you find a store that sells a battery tester for AA, AAA etc. in your neighborhood stores?

Description : How easily could you find a store that sells a battery tester for AA, AAA etc. in your neighborhood stores?

Last Answer : I local hardware store used to have a battery testing service. Maybe you could call around your area and find someplace like that.

AAA and AA which one is greater?

Description : AAA and AA which one is greater?

Last Answer : Hi Ruth, both AA and AAA has the same 1.5V. But the capacity of AA is bigger than AAA. The AAA battery is smaller in size than AA. The amount of current carrying though the battery vary in AA ... . It depends on the specific size devices that you have and how long do you want the device work for.

Each year the company receives bond ratings. The range of these bond ratings from best to worse is: a. A to F. b. A to C. c. D to AA. d. D to AAA. e. AAA to D.

Description : Each year the company receives bond ratings. The range of these bond ratings from best to worse is: a. A to F. b. A to C. c. D to AA. d. D to AAA. e. AAA to D.

Last Answer : e. AAA to D.

What is your bond rate? The prime rate is 10%; your current bond rating slipped one category (from AAA to AA). a. 12.1% b. 10.5% c. 11.4% d. 11.2%

Description : What is your bond rate? The prime rate is 10%; your current bond rating slipped one category (from AAA to AA). a. 12.1% b. 10.5% c. 11.4% d. 11.2%

Last Answer : b. 10.5%

What does BA/AA mean?

Description : What does BA/AA mean?

Last Answer : That’s right

. What is the hexadecimal equivalentof the Ethernet address 01011010 0001000101010101 00011000 10101010 00001111? A) 5A:88:AA:18:55:F0 B) 5A:81:BA:81:AA:0F C) 5A:18:5A:18:55:0F D) 5A:11:55:18:AA:0F

Description : . What is the hexadecimal equivalentof the Ethernet address 01011010 0001000101010101 00011000 10101010 00001111? A) 5A:88:AA:18:55:F0 B) 5A:81:BA:81:AA:0F C) 5A:18:5A:18:55:0F D) 5A:11:55:18:AA:0F

Last Answer : 5A:11:55:18:AA:0F

A fuzzy set A on R is ................. iff A(λx1 + (1 – λ)x2) ≥ min [A(x1), A(x2)] for all x1, x2 ∈ R and all λ ∈ [0, 1], where min denotes the minimum operator. (A) Support (B) α-cut (C) Convex (D) Concave

Description : A fuzzy set A on R is ................. iff A(λx1 + (1 – λ)x2) ≥ min [A(x1), A(x2)] for all x1, x2 ∈ R and all λ ∈ [0, 1], where min denotes the minimum operator. (A) Support (B) α-cut (C) Convex (D) Concave 

Last Answer : (C) Convex 

A pushdown automation M = (Q, Σ, Γ, δ, q0, z, F) is set to be deterministic subject to which of the following condition(s), for every q ∈ Q, a ∈ Σ ∪ {λ} and b ∈ Γ (s1) δ(q, a, b) contains at most one element (s2) if δ(q, λ, b) is not empty then δ(q, c, b) must be empty for every c ∈ Σ (A) only s1 (B) only s2 (C) both s1 and s2 (D) neither s1 nor s2

Description : A pushdown automation M = (Q, Σ, Γ, δ, q0, z, F) is set to be deterministic subject to which of the following condition(s), for every q ∈ Q, a ∈ Σ ∪ {λ} and b ∈ Γ (s1) δ(q, a, b) contains at most one ... ) must be empty for every c ∈ Σ (A) only s1 (B) only s2 (C) both s1 and s2 (D) neither s1 nor s2

Last Answer : (C) both s1 and s2

The equivalent production rules corresponding to the production rules S→Sα1|Sα2|β1|β2 is (A) S→β1 | β2, A→α1A | α2A | λ (B) S→β1 | β2 | β1A | β2A, A→α1A | α2A (C) S→β1 | β2, A→α1A | α2A (D) S→β1 | β2 | β1A | β2A, A→α1A | α2A | λ

Description : The equivalent production rules corresponding to the production rules S→Sα1|Sα2|β1|β2 is (A) S→β1 | β2, A→α1A | α2A | λ (B) S→β1 | β2 | β1A | β2A,  A→α1A | α2A (C) S→β1 | β2, A→α1A | α2A (D) S→β1 | β2 | β1A | β2A,  A→α1A | α2A | λ

Last Answer : (D) S→β1 | β2 | β1A | β2A,  A→α1A | α2A | λ

Given the following statements: S1 : The grammars S→asb | bsa | ss | a and S→asb | bsa | a are not equivalent. S2: The grammars S→ss | sss | asb | bsa | λ and S→ss | asb | bsa | λ are equivalent. Which of the following is true? (A) S1 is correct and S2 is not correct. (B) Both S1 and S2 are correct (C) S1 is not correct and S2 is correct (D) Both S1 and S2 are not correct.

Description : Given the following statements: S1 : The grammars S→asb | bsa | ss | a and S→asb | bsa | a are not equivalent. S2: The grammars S→ss | sss | asb | bsa | λ and S→ss | asb | bsa | λ are equivalent. ... and S2 are correct (C) S1 is not correct and S2 is correct (D) Both S1 and S2 are not correct.

Last Answer : (A) S1 is correct and S2 is not correct.

The number of strings of length 4 that are generated by the regular expression (0|∈) 1+2* (3|∈), where | is an alternation character, {+, *} are quantification characters, and ∈ is the null string, is: (A) 08 (B) 10 (C) 11 (D) 12

Description : The number of strings of length 4 that are generated by the regular expression (0|∈) 1+2* (3|∈), where | is an alternation character, {+, *} are quantification characters, and ∈ is the null string, is: (A) 08 (B) 10 (C) 11 (D) 12

Last Answer : (D) 12

The number of strings of length 4 that are generated by the regular expression (0+1 +|2+3 + )*, where | is an alternation character and {+, *} are quantification characters, is: (A) 08 (B) 09 (C) 10 (D) 12

Description : The number of strings of length 4 that are generated by the regular expression (0+1 +|2+3 + )*, where | is an alternation character and {+, *} are quantification characters, is: (A) 08 (B) 09 (C) 10 (D) 12

Last Answer : (C) 10

Which of the following strings would match the regular expression: p+[3-5]*[xyz]? I. p443y Il. p6y III. 3xyz IV. p35z V. p353535x Vl. ppp5 (1) I, III and Vl only (2) IV, V and VI only (3) II, IV and V only (4) I, IV and V only

Description : Which of the following strings would match the regular expression: p+[3-5]*[xyz]? I. p443y Il. p6y III. 3xyz IV. p35z V. p353535x Vl. ppp5 (1) I, III and Vl only (2) IV, V and VI only (3) II, IV and V only (4) I, IV and V only

Last Answer : Answer: 4

Which of the following statement is not true? a) The union and concatenation of two context-free languages is context-free b) The reverse of a context-free language is context-free, but the complement need not be c) Every regular language is context-free because it can be described by a regular grammar d) The intersection two context-free languages is context-free

Description : Which of the following statement is not true? a) The union and concatenation of two context-free languages is context-free b) The reverse of a context-free language is context-free, but the ... it can be described by a regular grammar d) The intersection two context-free languages is context-free

Last Answer : d) The intersection two context-free languages is context-free

Which of the following statement is not true? a) The union and concatenation of two context-free languages is context-free b) The reverse of a context-free language is context-free, but the complement need not be c) Every regular language is context-free because it can be described by a regular grammar d) The intersection of a context-free language and a regular language is always context-free e) The intersection two context-free languages is context-free

Description : Which of the following statement is not true? a) The union and concatenation of two context-free languages is context-free b) The reverse of a context-free language is context-free, but ... a regular language is always context-free e) The intersection two context-free languages is context-free

Last Answer : e) The intersection two context-free languages is context-free

Consider the following statements related to compiler construction: I. Lexical Analysis is specified by context-free grammars and implemented by pushdown automata. II. Syntax Analysis is specified by regular expressions and implemented by finite-state machine. Which of the above statement(s) is/are correct? (1) Only l (2) Only ll (3) Both I and II (4) Neither I nor Il

Description : Consider the following statements related to compiler construction: I. Lexical Analysis is specified by context-free grammars and implemented by pushdown automata. II. Syntax Analysis is specified by regular expressions and implemented by ... Only l (2) Only ll (3) Both I and II (4) Neither I nor Il

Last Answer : Answer: 4

Which one of the following is decimal value of a signed binary number 1101010, if it is in 2's complement form? (A) -42 (B) - 22 (C) -21 (D) -106

Description : Which one of the following is decimal value of a signed binary number 1101010, if it is in 2's complement form? (A) -42 (B) - 22 (C) -21 (D) -106

Last Answer : (B) - 22

The size of the ROM required to build an 8-bit adder/subtractor with mode control, carry input, carry output and two’s complement overflow output is given as

Description : The size of the ROM required to build an 8-bit adder/subtractor with mode control, carry input, carry output and two’s complement overflow output is given as

Last Answer : (B) 218 × 10

The Excess-3 decimal code is a self-complementing code because (A) The binary sum of a code and its 9’s complement is equal to 9. (B) It is a weighted code. (C) Complement can be generated by inverting each bit pattern. (D) The binary sum of a code and its 10’s complement is equal to 9.

Description : The Excess-3 decimal code is a self-complementing code because (A) The binary sum of a code and its 9’s complement is equal to 9. (B) It is a weighted code. (C) Complement can be generated by inverting each bit pattern. (D) The binary sum of a code and its 10’s complement is equal to 9.

Last Answer : Answer: A, C

Which of the following is the most efficient to perform arithmetic operations on the numbers? (A) Sign-magnitude (B) 1’s complement (C) 2’s complement (D) 9’s complement

Description : Which of the following is the most efficient to perform arithmetic operations on the numbers? (A) Sign-magnitude (B) 1’s complement (C) 2’s complement (D) 9’s complement

Last Answer : (C) 2’s complement

ABCD is a trapezium in which AB || DC and AD = BC. If P, Q, R and S be respectively the mid-points of BA, BD, CD and CA, then PQRS is a -Maths 9th

Description : ABCD is a trapezium in which AB || DC and AD = BC. If P, Q, R and S be respectively the mid-points of BA, BD, CD and CA, then PQRS is a -Maths 9th

Last Answer : Here is your First of all we will draw a quadrilateral ABCD with AD = BC and join AC, BD, P,Q,R,S are the mid points of AB, AC, CD and BD respectively. In the triangle ABC, P and Q are mid points of AB and AC respectively. All sides are equal so PQRS is a Rhombus.

To set out a parallel from a given inaccessible point to a given line AB, the following observations are made: Distance AB and angle PAM = a and angle PBA = b are measured where M is a point on the line BA produced. The perpendicular to the desired parallel line from A and B are: (A) AB/(cot b - cot a) (B) AB/(cos b - cos a) (C) AB/(cot a - cot b) (D) AB/(cot a - cos b)

Description : To set out a parallel from a given inaccessible point to a given line AB, the following observations are made: Distance AB and angle PAM = a and angle PBA = b are measured where M is a point on the line BA produced. The ... cos b - cos a) (C) AB/(cot a - cot b) (D) AB/(cot a - cos b)

Last Answer : (A) AB/(cot b - cot a)

There are two stations A and B. Which of the following statements is correct? (A) The fore bearing of AB is AB (B) The back bearing of AB is BA (C) The fore and back bearings of AB differ by 180° (D) All the above

Description : There are two stations A and B. Which of the following statements is correct? (A) The fore bearing of AB is AB (B) The back bearing of AB is BA (C) The fore and back bearings of AB differ by 180° (D) All the above

Last Answer : (D) All the above

Given the following statements: S1: Every context-sensitive language L is recursive. S2: There exists a recursive language that is not context sensitive. Which statement is correct? (A) S1 is not correct and S2 is not correct. (B) S1 is not correct and S2 is correct. (C) S1 is correct and S2 is not correct. (D) S1 is correct and S2 is correct.

Description : Given the following statements: S1: Every context-sensitive language L is recursive. S2: There exists a recursive language that is not context sensitive. Which statement is correct? (A) S1 is not correct and S2 is ... (C) S1 is correct and S2 is not correct. (D) S1 is correct and S2 is correct.

Last Answer : (D) S1 is correct and S2 is correct. 

The transition function for the language L = {w|na(w) and nb(w) are both odd} is given by: δ(q0, a)=q1 ; δ(q0, b)=q2 δ(q1, a)=q0 ; δ(q1, b)=q3 δ(q2, a)=q3 ; δ(q2, b)=q0 δ(q3, a)=q2 ; δ(q3, b)=q1

Description : The transition function for the language L = {w|na(w) and nb(w) are both odd} is given by: δ(q0, a)=q1 ; δ(q0, b)=q2 δ(q1, a)=q0 ; δ(q1, b)=q3 δ(q2, a)=q3 ; δ(q2, b ... the automata are: (A) q0 and q0 respectively (B) q0 and q1 respectively (C) q0 and q2 respectively (D) q0 and q3 respectively 

Last Answer : (D) q0 and q3 respectively

Minimal deterministic finite automaton for the language L={ 0n | n≥0, n≠4 } will have: (A) 1 final state among 5 states (B) 4 final states among 5 states (C) 1 final state among 6 states (D) 5 final states among 6 states

Description : Minimal deterministic finite automaton for the language L={ 0n | n≥0, n≠4 } will have: (A) 1 final state among 5 states (B) 4 final states among 5 states (C) 1 final state among 6 states (D) 5 final states among 6 states

Last Answer : (D) 5 final states among 6 states

Given the following two statements: A. L = {w|na(w) = nb(w)} is deterministic context free language, but not linear B. L = {an bn} U {an b2n} is linear, but not deterministic context free language. Which of the following options is correct? (1) Both (A) and (B) are false. (2) Both (A) and (B) are true. (3) (A) is true, (B) is false. (4) (A) is false, (B) is true.

Description : Given the following two statements: A. L = {w|na(w) = nb(w)} is deterministic context free language, but not linear B. L = {an bn} U {an b2n} is linear, but not deterministic context free language. Which of the following ... are true. (3) (A) is true, (B) is false. (4) (A) is false, (B) is true.

Last Answer : Both (A) and (B) are true. 

The torque expression of a current carrying conductor is a) T = BIA cos θ b) T = BA cos θ c) T = BIA sin θ d) T = BA sin θ

Description : The torque expression of a current carrying conductor is a) T = BIA cos θ b) T = BA cos θ c) T = BIA sin θ d) T = BA sin θ

Last Answer : c) T = BIA sin θ

The complement of AB+BC’+CD’ is:

Description : The complement of AB+BC’+CD’ is:  (1) A’CD+B’C’+B’D (2) A’C’+BC+AB’D’ (3) AC+BC+ABD (4) A’C’+B’C’+A’B’D’ 

Last Answer : The complement of AB+BC’+CD’ is: A’CD+B’C’+B’D.

Which one of the following statements in not correct? [CDS 2003] (a) India is the highest oil-seeds and vegetable oil producing country in the world (b) India is the second largest exporter of jute goods in the world In d ian Ag r ic u l t u r ea n d An i ma l H u s ba n d r y (c) India is the largest producer of silk in world (d) India is the second largest producer of three-wheeler motor vehicles in the world

Description : Which one of the following statements in not correct? [CDS 2003] (a) India is the highest oil-seeds and vegetable oil producing country in the world (b) India is the second largest exporter of ... silk in world (d) India is the second largest producer of three-wheeler motor vehicles in the world

Last Answer : Ans: (c)

What is the output when following statement is executed ? >>>"abcd"[2:] a) a b) ab c) cd d) dc

Description : What is the output when following statement is executed ? >>>"abcd"[2:] a) a b) ab c) cd d) dc

Last Answer : c) cd

What is the output of the following? x = ['ab', 'cd'] for i in x: x.append(i.upper()) print(x) a) [‘AB’, ‘CD’]. b) [‘ab’, ‘cd’, ‘AB’, ‘CD’]. c) [‘ab’, ‘cd’]. d) none of the mentioned

Description : What is the output of the following? x = ['ab', 'cd'] for i in x: x.append(i.upper()) print(x) a) [‘AB’, ‘CD’]. b) [‘ab’, ‘cd’, ‘AB’, ‘CD’]. c) [‘ab’, ‘cd’]. d) none of the mentioned

Last Answer : d) none of the mentioned

What is the output of the following? x = ['ab', 'cd'] for i in x: i.upper() print(x) a) [‘ab’, ‘cd’]. b) [‘AB’, ‘CD’]. c) [None, None]. d) none of the mentioned

Description : What is the output of the following? x = ['ab', 'cd'] for i in x: i.upper() print(x) a) [‘ab’, ‘cd’]. b) [‘AB’, ‘CD’]. c) [None, None]. d) none of the mentioned

Last Answer : a) [‘ab’, ‘cd’].

Given a grammar : S1→Sc, S→SA|A, A→aSb|ab, there is a rightmost derivation S1=>Sc =>SAC=>SaSbc. Thus, SaSbc is a right sentential form, and its handle is (A) SaS (B) be (C) Sbe (D) aSb

Description : Given a grammar : S1→Sc, S→SA|A, A→aSb|ab, there is a rightmost derivation S1=>Sc =>SAC=>SaSbc. Thus, SaSbc is a right sentential form, and its handle is (A) SaS (B) be (C) Sbe (D) aSb 

Last Answer : (D) aSb

A relation R={A,B,C,D,E,F,G} is given with following set of functional dependencies: F={AD→E, BE→F, B→C, AF→G} Which of the following is a candidate key? (A) A (B) AB (C) ABC (D) ABD

Description : A relation R={A,B,C,D,E,F,G} is given with following set of functional dependencies: F={AD→E, BE→F, B→C, AF→G} Which of the following is a candidate key? (A) A (B) AB (C) ABC (D) ABD

Last Answer : Answer: D

Let R be the rectangular window against which the lines are to be clipped using 2D Sutherland-Cohen line clipping algorithm. The rectangular window has lower left-hand corner at (-5,1) and upper righthand corner at (3,7). Consider the following three lines for clipping with the given end point co-ordinates: Line AB: A(-6,2) and B(-1,8) Line CD: C(-1,5) and D(4,8) Line EF: E(-2,3) and F(1,2) Which of the following line(s) is/are candidate for clipping? (A) AB (B) CD (C) EF (D) AB and CD

Description : Let R be the rectangular window against which the lines are to be clipped using 2D Sutherland-Cohen line clipping algorithm. The rectangular window has lower left-hand corner at (-5,1) and upper righthand corner at (3,7). ... s) is/are candidate for clipping? (A) AB (B) CD (C) EF (D) AB and CD

Last Answer : (D) AB and CD

The simplified form of a Boolean equation (AB’+AB’C+AC)(A’C’+B’) is : (A) AB’ (B) AB’C (C) A’B (D) ABC

Description : The simplified form of a Boolean equation (AB’+AB’C+AC)(A’C’+B’) is : (A) AB’ (B) AB’C (C) A’B (D) ABC

Last Answer : (A) AB’

The Karnaugh map for a Boolean function is given as Image The simplified Boolean equation for the above Karnaugh Map is (A) AB + CD + AB’ + AD (B) AB + AC + AD + BCD (C) AB + AD + BC + ACD (D) AB + AC + BC + BCD

Description : The Karnaugh map for a Boolean function is given as The simplified Boolean equation for the above Karnaugh Map is (A) AB + CD + AB’ + AD (B) AB + AC + AD + BCD (C) AB + AD + BC + ACD (D) AB + AC + BC + BCD

Last Answer : (B) AB + AC + AD + BCD

Consider a line AB with A = (0,0) and B = (8, 4). Apply a simple DDA algorithm and compute the first four plots on this line. (1) [(0, 0), (1, 1), (2, 1), (3, 2)] (2) [(0, 0), (1, 1.5), (2, 2), (3, 3)] (3) [(0, 0), (1, 1), (2, 2.5), (3, 3)] (4) [(0, 0), (1, 2), (2, 2), (3, 2)]

Description : Consider a line AB with A = (0,0) and B = (8, 4). Apply a simple DDA algorithm and compute the first four plots on this line. (1) [(0, 0), (1, 1), (2, 1), (3, 2)] (2) [(0, 0), (1, 1.5), (2, 2), (3, 3)] (3) [(0, 0), (1, 1), (2, 2.5), (3, 3)] (4) [(0, 0), (1, 2), (2, 2), (3, 2)]

Last Answer : [(0, 0), (1, 1), (2, 1), (3, 2)] 

Which of the following control expressions are valid for an if statement? A) An integer expression B) A Boolean expression C) Either A or B D) Neither A nor B

Description : Which of the following control expressions are valid for an if statement? A) An integer expression B) A Boolean expression C) Either A or B D) Neither A nor B

Last Answer : B) A Boolean expression