Given the following two languages: L1 = {anbn|n≥0, n≠100} L2 = {w ϵ {a,b,c}*| na(w) = nb(w) = nc(w)} Which of the following options is correct? (1) Both L1 and L2 are not context free language. (2) Both L1 and L2 are context free language. (3) L1 is context free language, L2 is not context free language. (4) L1 is not context free language, L2 is context free language.

Given the following two languages:

L1 = {anbn|n≥0, n≠100}

L2 = {w ϵ {a,b,c}*| na(w) = nb(w) = nc(w)}

Which of the following options is correct?

(1) Both L1 and L2 are not context free language.

(2) Both L1 and L2 are context free language.

(3) L1 is context free language, L2 is not context free language.

(4) L1 is not context free language, L2 is context free language.
by

1 Answer

Answer :

L1 is context free language, L2 is not context free language.
by

Related questions

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. 

Given the following two statements: S1: If L1 and L2 are recursively enumerable languages over ∑, then L1⋃L2 and L1⋂L2 are also recursively enumerable. S2: The set of recursively enumerable languages is countable. Which of the following is correct? (A) S1 is correct and S2 is not correct (B) S1 is not correct and S2 is correct (C) Both S1 and S2 are not correct (D) Both S1 and S2 are correct

Description : Given the following two statements: S1: If L1 and L2 are recursively enumerable languages over ∑, then L1⋃L2 and L1⋂L2 are also recursively enumerable. S2: The set of recursively enumerable languages is countable. ... correct (C) Both S1 and S2 are not correct (D) Both S1 and S2 are correct

Last Answer : (D) Both S1 and S2 are correct

Consider the languages L1 = ϕ, and L2 = {1}. Which one of the following represents L1* U L2* L1* ? (1) {ε} (2) {ε,1} (3) ϕ (4) 1*

Description : Consider the languages L1 = ϕ, and L2 = {1}. Which one of the following represents L1* U L2* L1* ? (1) {ε} (2) {ε,1} (3) ϕ (4) 1*

Last Answer : 1*

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

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* 

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|λ

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 statements s1 and s2 are given as: s1: Context sensitive languages are closed under intersection, concatenation, substitution and inverse homomorphism. s2: Context free languages are closed under complementation, substitution and homomorphism. Which of the following is correct statement? (A) Both s1 and s2 are correct. (B) s1 is correct and s2 is not correct. (C) s1 is not correct and s2 is correct. (D) Both s1 and s2 are not correct.

Description : The statements s1 and s2 are given as: s1: Context sensitive languages are closed under intersection, concatenation, substitution and inverse homomorphism. s2: Context free languages are closed under complementation, ... is not correct and s2 is correct. (D) Both s1 and s2 are not correct.

Last Answer : (B) s1 is correct and s2 is not correct.

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 

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

If l1 and l2 are the lengths of long and short spans of a two way slab simply supported on four edges and carrying a load w per unit area, the ratio of the loads split into w1 and w2acting on strips parallel to l2 and l1 is (A) w1/w2 = l2/l1 (B) w1/w2 = (l2/l1)² (C) w1/w2 = (l2/l1)3 (D) w1/w2 = (l2/l1)

Description : If l1 and l2 are the lengths of long and short spans of a two way slab simply supported on four edges and carrying a load w per unit area, the ratio of the loads split into w1 and w2acting on strips parallel to l2 and l1 is (A) ... l1 (B) w1/w2 = (l2/l1)² (C) w1/w2 = (l2/l1)3 (D) w1/w2 = (l2/l1)

Last Answer : Answer: Option D

A compound pipe of diameter d1, d2 and d3 having lengths l1, l2 and l3 is to be replaced by an equivalent pipe of uniform diameter d and of the same length (l) as that of the compound pipe. The size of the equivalent pipe is given by (A) l/d² = + + (B) l/d³ = + ) + (C) = + + (D)

Description : A compound pipe of diameter d1, d2 and d3 having lengths l1, l2 and l3 is to be replaced by an equivalent pipe of uniform diameter d and of the same length (l) as that of the compound pipe. The size of the equivalent pipe is given by (A) l/d² = + + (B) l/d³ = + ) + (C) = + + (D)

Last Answer : Answer: Option D

Which one of the following statements is correct regarding the GPS satellites? (A) The nominal altitude is about 20,200 km (B) The inclination of axis satellite is 55° (C) The satellite transmits two L band signals (L1 with 1575.42 MHz and L2 with 1276.6 MHz) (D) All of these

Description : Which one of the following statements is correct regarding the GPS satellites? (A) The nominal altitude is about 20,200 km (B) The inclination of axis satellite is 55° (C) The satellite transmits two L band signals (L1 with 1575.42 MHz and L2 with 1276.6 MHz) (D) All of these

Last Answer : Answer: Option D

Which of the following statements is false? (1) Every context-sensitive language is recursive. (2) The set of all languages that are not recursively enumerable is countable. (3) The family of recursively enumerable languages is closed under union. (4) The families of recursively enumerable and recursive languages are closed under reversal.

Description : Which of the following statements is false? (1) Every context-sensitive language is recursive. (2) The set of all languages that are not recursively enumerable is countable. (3) The family ... under union. (4) The families of recursively enumerable and recursive languages are closed under reversal.

Last Answer : The set of all languages that are not recursively enumerable is countable.

Pentium Pro Processor contains: a. L1 Cache b. L2 Cache c. Both L1 & L2 d. None of these

Description : Pentium Pro Processor contains: a. L1 Cache b. L2 Cache c. Both L1 & L2 d. None of these

Last Answer : c. Both L1 & L2

Two lines L1 and L2 having Parametric equations are P1=[3 4 7]+u[2 2 -6] and P2=[15 -2]+u[1 4 2]. Tangent vector for line L1 a.2i+2j-6k b.2i+2j+6k c.2i-2j-6k d.6-2j-2k

Description : Two lines L1 and L2 having Parametric equations are P1=[3 4 7]+u[2 2 -6] and P2=[15 -2]+u[1 4 2]. Tangent vector for line L1 a.2i+2j-6k b.2i+2j+6k c.2i-2j-6k d.6-2j-2k

Last Answer : a.2i+2j-6k

What does conus is seen terminating at the L1-L2 level mean?

Description : What does conus is seen terminating at the L1-L2 level mean?

Last Answer : What is the answer ?

When an operating motor is connected to the controller shown in the illustration, the a path of current flow through the circuit is ____________. EL-0010 A. 'L1', stop button, start button, coil 'CR', 'L2' B. 'L1', stop button, 'CR' and 'M' contacts, 'M' coil, 'OL contacts, the 'CR' coil in parallel, 'L2' C. 'L1', stop button, jog button, 'CR' contact, 'CR' relay, 'L2' D. 'L1', stop button, start button, 'CR' contact, 'M' contact, 'CR' coil, 'L2'

Description : When an operating motor is connected to the controller shown in the illustration, the a path of current flow through the circuit is ____________. EL-0010 A. 'L1', stop button, start button, coil 'CR', 'L2' B. 'L1' ... L2' D. 'L1', stop button, start button, 'CR' contact, 'M' contact, 'CR' coil, 'L2'

Last Answer : Answer: B

In the illustration if the compressor fails to start but the condenser fan motor is running the problem is _______. EL-0042 A. no power between L1 and L2 B. the yellow wire is open at the freezer temperature control switch C. the overload is open D. the blue wire from the defrost heater is open

Description : In the illustration if the compressor fails to start but the condenser fan motor is running the problem is _______. EL-0042 A. no power between L1 and L2 B. the yellow wire is open at the freezer temperature control switch C. the overload is open D. the blue wire from the defrost heater is open

Last Answer : Answer: C

In the illustration if the compressor fails to start but the condenser fan motor is running the problem is _______. EL-0043 A. no power between L1 and L2 B. the yellow wire is open at the freezer temperature control switch C. the overload is open D. the blue wire from the defrost heater is open

Description : In the illustration if the compressor fails to start but the condenser fan motor is running the problem is _______. EL-0043 A. no power between L1 and L2 B. the yellow wire is open at the freezer temperature control switch C. the overload is open D. the blue wire from the defrost heater is open

Last Answer : Answer: C

The direction of rotation of the winch shown in the illustration is changed by reversing the _____________. EL-0102 A. direction of current through the shunt field B. polarity of voltage at 'S1' and 'S2' C. direction of current through the armature D. polarity of voltage at 'L1' and 'L2'

Description : The direction of rotation of the winch shown in the illustration is changed by reversing the _____________. EL-0102 A. direction of current through the shunt field B. polarity of voltage at 'S1' and 'S2' C. direction of current through the armature D. polarity of voltage at 'L1' and 'L2'

Last Answer : Answer: C

In an emergency, the fastest way to interrupt power and stop the winch shown in the illustration is for the ____________. EL-0102 A. mate to open the disconnect switch at 'L1' and 'L2' B. winch operator to open the 'safe switch' at the 'master switch' C. engine room watch engineer to open the winch circuit breaker D. electrician to open the test link at the controller

Description : In an emergency, the fastest way to interrupt power and stop the winch shown in the illustration is for the ____________. EL-0102 A. mate to open the disconnect switch at 'L1' and 'L2' B. ... watch engineer to open the winch circuit breaker D. electrician to open the test link at the controller

Last Answer : Answer: B

The horizontal angles from the boat between A and B and B and C, the stations on the shore are 1 2. The distances AB = L1 and BC = L2 2 at C between the boat and station B between A and C at B). (A) 1 2) = (L2 1/L1 2) = K (B) t 2 = 360° - 1 2 (C) 2 = sin /(K + ) (D) All the above

Description : The horizontal angles from the boat between A and B and B and C, the stations on the shore are 1 2. The distances AB = L1 and BC = L2 2 at C between the boat and station B between A and C at B). (A) 1 2) = (L2 1/L1 2) = K (B) t 2 = 360° - 1 2 (C) 2 = sin /(K + ) (D) All the above

Last Answer : (D) All the above

The total extension in a bar, consists of 3 bars of same material, of varying sections is a. P/E(L1/A1+L2/A2+L3/A3) b. P/E(L1A1+L2A2+L3A3) c. PE(L1/A1+L2/A2+L3/A3) d. PE(L1/A1+L2/A2+L3/A3)

Description : The total extension in a bar, consists of 3 bars of same material, of varying sections is a. P/E(L1/A1+L2/A2+L3/A3) b. P/E(L1A1+L2A2+L3A3) c. PE(L1/A1+L2/A2+L3/A3) d. PE(L1/A1+L2/A2+L3/A3)

Last Answer : a. P/E(L1/A1+L2/A2+L3/A3)

Given the following statements : (A) A class of languages that is closed under union and complementation has to be closed under intersection. (B) A class of languages that is closed under union and intersection has to be closed under complementation. 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 statements : (A) A class of languages that is closed under union and complementation has to be closed under intersection. (B) A class of languages that is closed under union and intersection has to be closed under ... (3) (A) is true, (B) is false. (4) (A) is false, (B) is true.

Last Answer : (A) is true, (B) is false. 

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. 

A context free grammar for L={w|n0(w)>n1(w)} is given by: (A) S→0|0S|1SS (B) S→0S|1S|0SS|1SS|0|1 (C) S→0|0S|1SS|S1S|SS1 (D) S→0S|1S|0|1

Description : A context free grammar for L={w|n0(w)>n1(w)} is given by: (A) S→0|0S|1SS (B) S→0S|1S|0SS|1SS|0|1 (C) S→0|0S|1SS|S1S|SS1 (D) S→0S|1S|0|1

Last Answer : (C) S→0|0S|1SS|S1S|SS1 

The family of context sensitive languages is ................. under union and ................. under reversal. (A) closed, not closed (B) not closed, not closed (C) closed, closed (D) not closed, closed

Description : The family of context sensitive languages is ................. under union and ................. under reversal. (A) closed, not closed (B) not closed, not closed (C) closed, closed (D) not closed, closed

Last Answer : (C) closed, closed 

Electric field strength on a dust particle having charge equal to 8 × 10- 19 when plates are separated by distance of 2 cm and have a potential difference of 5 kV is A. 2.0 × 10-13 NB. 3 NC. 5 ND. 20 N

Description : Electric field strength on a dust particle having charge equal to 8 × 10- 19 when plates are separated by distance of 2 cm and have a potential difference of 5 kV is A. 2.0 × 10-13 N B. 3 N C. 5 N D. 20 N

Last Answer : 2.0 × 10-13 N

Given the following statements : S1 : SLR uses follow information to guide reductions. In case of LR and LALR parsers, the look-aheads are associated with the items and they make use of the left context available to the parser. S2 : LR grammar is a larger sub-class of context free grammar as compared to that SLR and LALR grammars. 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 : SLR uses follow information to guide reductions. In case of LR and LALR parsers, the look-aheads are associated with the items and they make use of the left context available to ... (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 language of all non-null strings of a’s can be defined by a context free grammar as follow : S→a S|S a| a The word a3 can be generated by ................ different trees. (A) Two (B) Three (C) Four (D) Five

Description : The language of all non-null strings of a’s can be defined by a context free grammar as follow : S→a S|S a| a The word a3 can be generated by ................ different trees. (A) Two (B) Three (C) Four (D) Five

Last Answer : (C) Four Explanation:

For every context free grammar (G) there exists an algorithm that passes any w ∈ L(G) in number of steps proportional to (A) ln|w| (B) |w| (C) |w|2 (D) |w|3

Description : For every context free grammar (G) there exists an algorithm that passes any w ∈ L(G) in number of steps proportional to (A) ln|w| (B) |w| (C) |w|2 (D) |w|3

Last Answer : (D) |w|3

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

The value of NA/(NA + NB), for steady state equimolal counter diffusion of two gases 'A' and 'B' is (A) 1 (B) ∞ (C) 0.5

Description : The value of NA/(NA + NB), for steady state equimolal counter diffusion of two gases 'A' and 'B' is (A) 1 (B) ∞ (C) 0.5

Last Answer : (B) ∞

The value of NA/(NA + NB) for steady state molecular diffusion of gas 'A' through non-diffusing gas 'B' is (A) 1 (B) ∞ (C) 0.5 (D) 2

Description : The value of NA/(NA + NB) for steady state molecular diffusion of gas 'A' through non-diffusing gas 'B' is (A) 1 (B) ∞ (C) 0.5 (D) 2

Last Answer : (A) 1

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

Which of the following statement is true? a) Not all formal languages are context-free b) All formal languages are Context free c) All formal languages are like natural language d) Natural languages are context-oriented free

Description : Which of the following statement is true? a) Not all formal languages are context-free b) All formal languages are Context free c) All formal languages are like natural language d) Natural languages are context-oriented free

Last Answer : a) Not all formal languages are context-free

Which of the following statement is true? a) Not all formal languages are context-free b) All formal languages are Context free c) All formal languages are like natural language d) Natural languages are context-oriented free e) Natural language is formal

Description : Which of the following statement is true? a) Not all formal languages are context-free b) All formal languages are Context free c) All formal languages are like natural language d) Natural languages are context-oriented free e) Natural language is formal

Last Answer : a) Not all formal languages are context-free

Colebrook equation for friction factor in turbulent flow is given by, f -0.5 = -4 loge [(ε/D) + (1.26/NRe √F). It reduces to Nikuradse equation for a value of (ϵ/D) equal to (A) 0(B) 1 (C) ∞ (D) 0.5

Description : Colebrook equation for friction factor in turbulent flow is given by, f -0.5 = -4 loge [(ε/D) + (1.26/NRe √F). It reduces to Nikuradse equation for a value of (ϵ/D) equal to (A) 0 (B) 1 (C) ∞ (D) 0.5

Last Answer : (B) 1

If all the production rules have single non - terminal symbol on the left side, the grammar defined is : (A) context free grammar (B) context sensitive grammar (C) unrestricted grammar (D) phrase grammar

Description : If all the production rules have single non - terminal symbol on the left side, the grammar defined is : (A) context free grammar (B) context sensitive grammar (C) unrestricted grammar (D) phrase grammar

Last Answer : (A) context free grammar

Given the following statements: (a) Strategic value of data mining is time stamping (b) Information collection is an expensive process in building an expert system. Which of the following options is correct ? (A) Both (a) and (b) are false (B) Both (a) and (b) are true (C) (a) is true, (b) is false (D) (a) is false, (b) is true

Description : Given the following statements: (a) Strategic value of data mining is time stamping (b) Information collection is an expensive process in building an expert system. Which of the following options is correct ? (A) Both (a) and (b) ... true (C) (a) is true, (b) is false (D) (a) is false, (b) is true

Last Answer :  (B) Both (a) and (b) are true

A context diagram is used A) as the first step in developing a detailed DFD of a system B) in systems analysis of very complex systems C) as an aid to system design D) as an aid to programmer

Description : A context diagram is used A) as the first step in developing a detailed DFD of a system B) in systems analysis of very complex systems C) as an aid to system design D) as an aid to programmer

Last Answer : A) as the first step in developing a detailed DFD of a system

A context diagram A) Describes the context of a system B) is a DFD which gives an overview of the system C) is a detailed description of a system D) is not used in drawing a detailed DFD

Description : A context diagram A) Describes the context of a system B) is a DFD which gives an overview of the system C) is a detailed description of a system D) is not used in drawing a detailed DFD

Last Answer : B) is a DFD which gives an overview of the system

High level knowledge which relates to the use of sentences in different contexts and how the context affect the meaning of the sentences? (A) Morphological (B) Syntactic (C) Semantic (D) Pragmatic

Description : High level knowledge which relates to the use of sentences in different contexts and how the context affect the meaning of the sentences? (A) Morphological (B) Syntactic (C) Semantic (D) Pragmatic

Last Answer : (D) Pragmatic

Consider three CPU intensive processes P1, P2, P3 which require 20, 10 and 30 units of time, arrive at times 1, 3 and 7 respectively. Suppose operating system is implementing Shortest Remaining Time first (preemptive scheduling) algorithm, then .............. context switches are required (suppose context switch at the beginning of Ready queue and at the end of Ready queue are not counted). (A) 3 (B) 2 (C) 4 (D) 5

Description : Consider three CPU intensive processes P1, P2, P3 which require 20, 10 and 30 units of time, arrive at times 1, 3 and 7 respectively. Suppose operating system is implementing Shortest Remaining Time first (preemptive scheduling) ... end of Ready queue are not counted). (A) 3 (B) 2 (C) 4 (D) 5

Last Answer : (A) 3