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

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
by

1 Answer

Answer :

(C) 10
by

Related questions

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

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

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

Which of the following are not regular? (A) Strings of even number of a’s. (B) Strings of a’s, whose length is a prime number. (C) Set of all palindromes made up of a’s and b’s. (D) Strings of a’s whose length is a perfect square. (1) (A) and (B) only (2) (A), (B) and (C) only (3) (B), (C) and (D) only (4) (B) and (D) only

Description : Which of the following are not regular? (A) Strings of even number of a's. (B) Strings of a's, whose length is a prime number. (C) Set of all palindromes made up of a's and b's. (D) Strings of a's whose length is a ... ) (A), (B) and (C) only (3) (B), (C) and (D) only (4) (B) and (D) only

Last Answer : (B), (C) and (D) only

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:

What does the following expression means ? char *(*(* a[N]) ( )) ( ); (A) a pointer to a function returning array of n pointers to function returning character pointers. (B) a function return array of N pointers to functions returning pointers to characters (C) an array of n pointers to function returning pointers to characters (D) an array of n pointers to function returning pointers to functions returning pointers to characters.

Description : What does the following expression means ? char *(*(* a[N]) ( )) ( ); (A) a pointer to a function returning array of n pointers to function returning character pointers. (B) a ... to characters (D) an array of n pointers to function returning pointers to functions returning pointers to characters.

Last Answer : Answer: A,B,C,D

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) 

Indicate the number of Regional Offices of University Grants Commission of India. (A) 10 (B) 07 (C) 08 (D) 09

Description : Indicate the number of Regional Offices of University Grants Commission of India. (A) 10 (B) 07 (C) 08 (D) 09

Last Answer : (B) 07

Hexadecimal number system has ..............base. A) 16 B) 14 C) 12 D) 08

Description : Hexadecimal number system has ..............base. A) 16 B) 14 C) 12 D) 08

Last Answer : A) 16

For like predicate which of the following is true. i) % matches zero of more characters. ii) _ matches exactly one character. A) i-only B) ii-only C) Both of them D) None of them

Description : For like predicate which of the following is true. i) % matches zero of more characters. ii) _ matches exactly one character. A) i-only B) ii-only C) Both of them D) None of them

Last Answer : C) Both of them

Assume that we need to download text documents at the rate of 100 pages per minute. A page is an average of 24 lines with 80 characters in each line and each character requires 8 bits. Then the required bit rate of the channel is ................ (A) 1.636 Kbps (B) 1.636 Mbps (C) 2.272 Mbps (D) 3.272 Kbps

Description : Assume that we need to download text documents at the rate of 100 pages per minute. A page is an average of 24 lines with 80 characters in each line and each character requires 8 bits. Then the required bit rate of the channel is ... ...... (A) 1.636 Kbps (B) 1.636 Mbps (C) 2.272 Mbps (D) 3.272 Kbps

Last Answer : Answer: Marks given to all

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 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)*

Description : 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 ... *bbbbb* + (a + b)*ab(a + b)* (D) (λ + a + aa + aaa)b* + a*bbbbb* + (a + b)*ba(a + b)*

Last Answer : (D) (λ + a + aa + aaa)b* + a*bbbbb* + (a + b)*ba(a + b)*

Chomsky’s linguistic computational theory generated a model for syntactic analysis through __________ A. Regular Grammar B. Regular Expression C. Regular Word D. None of these

Description : Chomsky’s linguistic computational theory generated a model for syntactic analysis through __________ A. Regular Grammar B. Regular Expression C. Regular Word D. None of these

Last Answer : A. Regular Grammar

…………. Refer to the names of variables, functions, arrays, classes etc. created by the programmer. A) Keywords B) Identifiers C) Constraints D) Strings

Description : …………. Refer to the names of variables, functions, arrays, classes etc. created by the programmer. A) Keywords B) Identifiers C) Constraints D) Strings

Last Answer : B) Identifiers

What arithmetic operators cannot be used with strings ? a) + b) * c) – d) All of the mentioned

Description : What arithmetic operators cannot be used with strings ? a) + b) * c) – d) All of the mentioned

Last Answer : c) –

Which is the correct statement(s) for Non Recursive predictive parser? S1: First(α) = {t | α => * t β for some string β } => *tβ S2: Follow(X) = { a | S => * αXa β for some strings α and β } (A) Both statements S1 and S2 are incorrect. (B) S1 is incorrect and S2 is correct. (C) S1 is correct and S2 is incorrect. (D) Both statements S1 and S2 are correct.

Description : Which is the correct statement(s) for Non Recursive predictive parser? S1: First(α) = {t | α => * t β for some string β } => *tβ S2: Follow(X) = { a | S => * αXa β for some strings ... and S2 is correct. (C) S1 is correct and S2 is incorrect. (D) Both statements S1 and S2 are correct. 

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

In Unix, how do you check that two given strings a and b are equal ? (A) test $a -eq $b (B) test $a -equal $b (C) test $a=$b (D) Sh -C test $a==$b

Description : In Unix, how do you check that two given strings a and b are equal ? (A) test $a -eq $b (B) test $a -equal $b (C) test $a=$b (D) Sh -C test $a==$b

Last Answer : (C) test $a=$b Answer: C Explanation: Tests for a zero-length string: test -z string Tests for a nonzero string length: test -n string Tests two strings for equality: ... Tests two strings for inequality: test string1 != string2 Tests for a nonzero string length: test string

How many strings of 5 digits have the property that the sum of their digits is 7 ? (A) 66 (B) 330 (C) 495 (D) 99

Description : How many strings of 5 digits have the property that the sum of their digits is 7 ? (A) 66 (B) 330 (C) 495 (D) 99

Last Answer : (B) 330

The virtual address generated by a CPU is 32 bits. The Translation Lookaside Buffer (TLB) can hold total 64 page table entries and a 4-way set associative (i.e. with 4- cache lines in the set). The page size is 4 KB. The minimum size of TLB tag is (A) 12 bits (B) 15 bits (C) 16 bits (D) 20 bits

Description : The virtual address generated by a CPU is 32 bits. The Translation Lookaside Buffer (TLB) can hold total 64 page table entries and a 4-way set associative (i.e. with 4- cache lines in the set). The page size is 4 KB. The minimum size of TLB tag is (A) 12 bits (B) 15 bits (C) 16 bits (D) 20 bits

Last Answer : (C) 16 bits Explanation: VirtualAddress = 32 bits PageSize = 4KB = 12 bits therefore : VPNTag = 20 bits, OffsetTag = 12 bits TLBEntryLength = VPNTag = 20 bits TotalTLBEntries = 64, 4-way implies ... therefore : TLBIndex = 4 bits TLBTag = TLBEntryLength - TLBIndex = 20 - 4 = 16 bits

A data file of 1,00,000 characters contains only the characters g-l, with the frequencies as indicated in table: using the variable-length code by Huffman codes, the file can be encoded with (A) 2,52,000 bits (B) 2,64,000 bits (C) 2,46,000 bits (D) 2,24,000 bits

Description : A data file of 1,00,000 characters contains only the characters g-l, with the frequencies as indicated in table:  using the variable-length code by Huffman codes, the file can be encoded with (A) 2,52,000 bits (B) 2,64,000 bits (C) 2,46,000 bits (D) 2,24,000 bits

Last Answer : (D) 2,24,000 bits 

Which command is used to copy all files having the string chap and any two characters after that to the progs directory? A. cp chap?? progs B. cp chap* progs C. cp chap[12] /progs/*.*

Description : Which command is used to copy all files having the string chap and any two characters after that to the progs directory? A. cp chap?? progs B. cp chap* progs C. cp chap[12] /progs/*.*

Last Answer : A. cp chap?? progs

In how many ways can the string A ∩ B - A ∩ B - A be fully parenthesized to yield an infix expression? (A) 15 (B) 14 (C) 13 (D) 12

Description : In how many ways can the string A ∩ B - A ∩ B - A be fully parenthesized to yield an infix expression? (A) 15 (B) 14 (C) 13 (D) 12

Last Answer : (B) 14

Let the page fault service time be 10 millisecond(ms) in a computer with average memory access time being 20 nanosecond(ns). If one page fault is generated for every 106 memory accesses, what is the effective access time for memory? (A) 21 ns (B) 23 ns (C) 30 ns (D) 35 ns

Description : Let the page fault service time be 10 millisecond(ms) in a computer with average memory access time being 20 nanosecond(ns). If one page fault is generated for every 106 memory accesses, what is the effective access time for memory? (A) 21 ns (B) 23 ns (C) 30 ns (D) 35 ns

Last Answer : (C) 30 ns

The output generated by the LINUX command : $ seq 1 2 10 will be (A) 1 2 10 (B) 1 2 3 4 5 6 7 8 9 10 (C) 1 3 5 7 9 (D) 1 5 10

Description : The output generated by the LINUX command : $ seq 1 2 10 will be (A) 1 2 10 (B) 1 2 3 4 5 6 7 8 9 10 (C) 1 3 5 7 9 (D) 1 5 10

Last Answer : (C) 1 3 5 7 9

The character set used in Windows 2000 operating system is .... (A) 8 bit ASCII (B) Extended ASCII (C) 16 bit UNICODE (D) 12 bit UNICODE

Description : The character set used in Windows 2000 operating system is .... (A) 8 bit ASCII (B) Extended ASCII (C) 16 bit UNICODE (D) 12 bit UNICODE

Last Answer : (C) 16 bit UNICODE

Usually, it takes10-bits to represent one character. How many characters can betransmittedat a speed of 1200 BPS? A. 10 B. 12 C. 120 D. 1200 E. None of the above

Description : Usually, it takes10-bits to represent one character. How many characters can betransmittedat a speed of 1200 BPS? A. 10 B. 12 C. 120 D. 1200 E. None of the above

Last Answer : 120

The number of distinct binary images which can be generated from a given binary image of right M × N are (A) M + N (B) M × N (C) 2M + N (D) 2MN

Description : The number of distinct binary images which can be generated from a given binary image of right M × N are (A) M + N (B) M × N (C) 2M + N (D) 2MN

Last Answer : (D) 2MN

Consider a source with symbols A, B, C, D with probabilities 1/2, 1/4, 1/8, 1/8 respectively. What is the average number of bits per symbol for the Huffman code generated from above information? (A) 2 bits per symbol (B) 1.75 bits per symbol (C) 1.50 bits per symbol (D) 1.25 bits per symbol

Description : Consider a source with symbols A, B, C, D with probabilities 1/2, 1/4, 1/8, 1/8 respectively. What is the average number of bits per symbol for the Huffman code generated from above information? (A) 2 bits per symbol (B) 1.75 bits per symbol (C) 1.50 bits per symbol (D) 1.25 bits per symbol

Last Answer : (B) 1.75 bits per symbol

Which of the following statement(s) is/are correct with reference to curve generation? I. Hermite curves are generated using the concepts of interpolation. II. Bezier curves are generated using the concepts of approximation. III. The Bezier curves lies entirely within the convex hull of its control points. IV. The degree of Bezier curve does not depend on the number of control points. (A) I, II and IV only (B) II and III only (C) I and II only (D) I, II and III only

Description : Which of the following statement(s) is/are correct with reference to curve generation? I. Hermite curves are generated using the concepts of interpolation. II. Bezier curves are generated using the concepts of approximation. III. The ... (B) II and III only (C) I and II only (D) I, II and III only

Last Answer : (D) I, II and III only

A three phase induction motor is drawing 16 Ampere at 440 Volts. If the operating power factor of the motor is 0.90 and the motor efficiency is 92%, then the mechanical shaft power output of the motor is a) 12.04 kW b) 10.09 kW c) 10.97 kW d) None of the above

Description : A three phase induction motor is drawing 16 Ampere at 440 Volts. If the operating power factor of the motor is 0.90 and the motor efficiency is 92%, then the mechanical shaft power output of the motor is a) 12.04 kW b) 10.09 kW c) 10.97 kW d) None of the above

Last Answer : b) 10.09 kW

Which command is used to concatenate all files beginning with the string 'emp' and followed by a non-numeric characters? A. cat emp[!0-9] B. more [emp][!0-9] C. cat emp[x-z]

Description : Which command is used to concatenate all files beginning with the string 'emp' and followed by a non-numeric characters? A. cat emp[!0-9] B. more [emp][!0-9] C. cat emp[x-z]

Last Answer : A. cat emp[!0-9]

A DMA controller transfers 32-bit words to memory using cycle Stealing. The words are assembled from a device that transmits characters at a rate of 4800 characters per second. The CPU is fetching and executing instructions at an average rate of one million instructions per second. By how much will the CPU be slowed down because of the DMA transfer? (A) 0.06% (B) 0.12% (C) 1.2% (D) 2.5%

Description : A DMA controller transfers 32-bit words to memory using cycle Stealing. The words are assembled from a device that transmits characters at a rate of 4800 characters per second. The CPU is fetching and executing instructions at an average ... of the DMA transfer? (A) 0.06% (B) 0.12% (C) 1.2% (D) 2.5%

Last Answer : Answer: B

How many types of quantification are available in artificial intelligence? a) 1 b) 2 c) 3 d) 4

Description : How many types of quantification are available in artificial intelligence? a) 1 b) 2 c) 3 d) 4

Last Answer : b) 2

First Order Logic is also known as ___________ a) First Order Predicate Calculus b) Quantification Theory c) Lower Order Calculus d) All of the mentioned

Description : First Order Logic is also known as ___________ a) First Order Predicate Calculus b) Quantification Theory c) Lower Order Calculus d) All of the mentioned

Last Answer : d) All of the mentioned

There exist only two types of quantifiers, Universal Quantification and Existential Quantification. a) True b) False

Description : There exist only two types of quantifiers, Universal Quantification and Existential Quantification. a) True b) False

Last Answer : a) True

A Goal is an open ended statement of what one wants to accomplish with no quantification of what is to be achieved and no time criteria for completion

Description : A Goal is an open ended statement of what one wants to accomplish with no quantification of what is to be achieved and no time criteria for completion

Last Answer : False

Explain the simple steps that can be followed in shop – floor for quantification of compressed air leakages.

Description : Explain the simple steps that can be followed in shop – floor for quantification of compressed air leakages.  

Last Answer : The following steps can be followed for quantification of compressed air leakages. Shut off compressed air operated equipments (or conduct test when no equipment is using compressed air). Run the compressor to ... per minute (cmm) T = Time on load in minutes T = Time unload in minutes 

What error will be generated if a space is given between the logical AND operator (&&)? Will it be a compile-time or a run-time error?

Description : What error will be generated if a space is given between the logical AND operator (&&)? Will it be a compile-time or a run-time error?

Last Answer : Example: if(5>2 & & 6

................ allows individual row operation to be performed on a given result set or on the generated by a selected by a selected statement. A) Procedure B) Trigger C) Curser D) None of above

Description : ................ allows individual row operation to be performed on a given result set or on the generated by a selected by a selected statement. A) Procedure B) Trigger C) Curser D) None of above

Last Answer : C) Curser

In a two-pass assembler, symbol table is (A) Generated in first pass (B) Generated in second pass (C) Not generated at all (D) Generated and used only in second pass

Description : In a two-pass assembler, symbol table is (A) Generated in first pass (B) Generated in second pass (C) Not generated at all (D) Generated and used only in second pass

Last Answer : (A) Generated in first pass

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

If m and n are int type variables, what will be the result of the expression m% n when m=5 and n=2 ? A) 0 B) 1 C) 2 D) None of the above

Description : If m and n are int type variables, what will be the result of the expression m% n when m=5 and n=2 ? A) 0 B) 1 C) 2 D) None of the above

Last Answer : B) 1

A Boolean operator Ө is defined as follows: 1Ө1=1, 1Ө0=0, 0Ө1=0 and 0Ө0=1 What will be the truth value of the expression (xӨy)Өz = xӨ(yӨz)? (A) Always false (B) Always true (C) Sometimes true (D) True when x, y, z are all true

Description : A Boolean operator Ө is defined as follows: 1Ө1=1, 1Ө0=0, 0Ө1=0 and 0Ө0=1 What will be the truth value of the expression (xӨy)Өz = xӨ(yӨz)? (A) Always false (B) Always true (C) Sometimes true (D) True when x, y, z are all true

Last Answer : (B) Always true

What is the result of the expression (1&2)+(3/4) ? (A) 1 (B) 2 (C) 3 (D) 0

Description : What is the result of the expression (1&2)+(3/4) ? (A) 1 (B) 2 (C) 3 (D) 0

Last Answer : (D) 0

The percentage of fluoride present in normal bone is (A) 0.01–0.03 (B) 0.04–0.08 (C) 0.10–0.12 (D) 0.15–0.2

Description : The percentage of fluoride present in normal bone is (A) 0.01–0.03 (B) 0.04–0.08 (C) 0.10–0.12 (D) 0.15–0.2

Last Answer : Answer : A

Which command is used to count just the number of characters in a file? A. wc - 1 B. wc -c C. wc -w D. wc -r E. None of the above

Description : Which command is used to count just the number of characters in a file? A. wc - 1 B. wc -c C. wc -w D. wc -r E. None of the above

Last Answer : B. wc -c

The diffusion co-efficient in m2 /s. of acetic acid in benzene (liquid in liquid) is (A) 2.09 × 10 -4 (B) 2.09 × 10 -5 (C) 2.09 × 10 -9 (D) 2.09 × 10 -12

Description : The diffusion co-efficient in m2 /s. of acetic acid in benzene (liquid in liquid) is (A) 2.09 × 10 -4 (B) 2.09 × 10 -5 (C) 2.09 × 10 -9 (D) 2.09 × 10 -12

Last Answer : (A) 2.09 × 10 -4 (B) 2.09 × 10 -5

A horn clause is ...................... (A) A clause in which no variables occur in the expression (B) A clause that has at least one negative literal (C) A disjunction of a number of literals (D) A clause that has at most one positive literal

Description : A horn clause is ...................... (A) A clause in which no variables occur in the expression (B) A clause that has at least one negative literal (C) A disjunction of a number of literals (D) A clause that has at most one positive literal

Last Answer : (D) A clause that has at most one positive literal