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
Description : Which of the following is FALSE ? (A) The grammar S ⟶ aSb|bSa|SS|∈, where S is the only non-terminal symbol and ∈ is the null string, is ambiguous. (B) SLR is powerful than LALR. (C) An LL(1) parser is a top-down parser. (D) YACC tool is an LALR(1) parser generator.
Last Answer : (B) SLR is powerful than LALR.
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:
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
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
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
Description : In a relational database model, NULL values can be used for all but which one of the following? (A) To allow duplicate tuples in the table by filling the primary key column(s) with NULL. (B) To ... D) To fill a column in a tuple when that column does not really exist for that particular tuple.
Last Answer : (A) To allow duplicate tuples in the table by filling the primary key column(s) with NULL.
Description : The ..................... is essentially used to search for patterns in target string. A) Like Predicate B) Null Predicate C) In Predicate D) Out Predicate
Last Answer : A) Like Predicate
Description : Suppose that the virtual Address space has eight pages and physical memory with four page frames. If LRU page replacement algorithm is used, .............. number of page faults occur with the reference string. 0 2 1 3 5 4 6 3 7 4 7 3 3 5 5 3 1 1 1 7 2 3 4 1 (A) 11 (B) 12 (C) 10 (D) 9
Last Answer : (A) 11
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.
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
Description : NULL is (A) the same as 0 for integer (B) the same as blank for character (C) the same as 0 for integer and blank for character (D) not a value
Last Answer : (D) not a value
Description : A veena player compares with a tuning fork the fundamental frequency generated by one of the strings of the veena and hears 4 beats per second. He then tightens the string a bit and hears only 3 ... d) The string has a higher frequency than the fork and has to be loosened for equality with fork
Last Answer : Ans:(b)
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
Description : Which of the following is a legal expression in SQL? (A) SELECT NULL FROM EMPLOYEE; (B) SELECT NAME FROM EMPLOYEE; (C) SELECT NAME FROM EMPLOYEE WHERE SALARY = NULL; (D) None of the above
Last Answer : B) SELECT NAME FROM EMPLOYEE;
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
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
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
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]
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
Description : A vertex cover of an undirected graph G(V, E) is a subset V1 ⊆ V vertices such that (A) Each pair of vertices in V1 is connected by an edge (B) If (u, v) ∈ E then u ∈ V1 and v ∈ V1 (C) If (u, v) ∈ E then u ∈ V1 or v ∈ V1 (D) All pairs of vertices in V1 are not connected by an edge
Last Answer : (C) If (u, v) ∈ E then u ∈ V1 or v ∈ V1
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)
Description : The control string in C++ consists of three important classifications of characters (A) Escape sequence characters, Format specifiers and Whitespace characters (B) Special characters, White-space ... and Non-white space characters (D) Special characters, White-space characters and Format specifiers
Last Answer : (C) Format specifiers, White-space characters and Non-white space characters
Description : An instrument has two strings. Both have the same length and are uniform. One of the strings is under twice as much tension as the other and also twice the mass of the other. Then which of ... d) Both strings vibrate with the same frequency and have the same wave-length and the same wave velocity.
Last Answer : Ans:(d)
Description : A string of length L is fixed between two points. If a standing wave of 5 nodes is produced, what is the relationship between the string's length, L, and its wavelength?
Last Answer : ANSWER: WAVELENGTH = 1/2 L
Description : Which of the following is not an inherent application of stack? (A) Implementation of Stack (B) Evaluation of a postfix expression (C) Job Scheduling (D) Reverse a string
Last Answer : (C) Job Scheduling
Description : Hexadecimal number system has ..............base. A) 16 B) 14 C) 12 D) 08
Last Answer : A) 16
Description : What is the probability that a randomly selected bit string of length 10 is a palindrome? (A) 1/64 (B) 1/32 (C) 1/8 (D) ¼
Last Answer : (B) 1/32
Description : Suppose that the time to do a null remote procedure call (RPC) (i.e, 0 data bytes) is 1.0 msec, with an additional 1.5 msec for every 1K of data. How long does it take to read 32 K from the file server as 32 1K RPCs? (A) 49 msec (B) 80 msec (C) 48 msec (D) 100 msec
Last Answer : (B) 80 msec
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
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
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*
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)*
Description : Ten identical masses (m each) are connected one below the other with 10 strings. Holding the topmost string,
Last Answer : Ten identical masses (m each) are connected one below the other with 10 strings. Holding the ... the top (Topmost string being the first string)?
Description : Design black box test suits for a function that checks whether a character or string upto ten characters in a palindrome?
Last Answer : Ans Following may be the test cases: - Try with Even number of characters (MALAYALAM) - Try with Odd number of characters (ADDA) - Try with maximum length of string The following are negative test ... come for the following) - Try with empty string - Try with numbers - Try with special characters
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
Description : Which of the following methods belong to the string class? A) length( ) B) compare To ( ) C) equals ( ) D) All of them
Last Answer : D) All of them
Description : Consider a program that consists of 8 pages (from 0 to 7) and we have 4 page frames in the physical memory for the pages. The page reference string is : 1 2 3 2 5 6 3 4 6 3 7 3 1 5 3 6 3 4 2 4 3 4 5 ... to fill available page frames with pages): (A) 9 and 6 (B) 10 and 7 (C) 9 and 7 (D) 10 and 6
Last Answer : (B) 10 and 7
Description : Consider the reference string 0 1 2 3 0 1 4 0 1 2 3 4 If FIFO page replacement algorithm is used, then the number of page faults with three page frames and four page frames are .......... and ........... respectively. (A) 10, 9 (B) 9, 9 (C) 10, 10 (D) 9, 10
Last Answer : (D) 9, 10
Description : Pointer holds A) Value of variable B) Address of variable C) Value and address of variable D) Always null
Last Answer : B) Address of variable
Description : The property of binary tree is A) The first subset is called left subtree B) The second subtree is called right subtree C) The root cannot contain NULL D) The right subtree can be empty
Last Answer : D) The right subtree can be empty
Description : Reflexivity property says that X Y is true if Y is …………………. A) Subset of X B) Null set of X C) Super set of Y D) Subset of Y
Last Answer : A) Subset of X
Description : …………….. is used to determine whether of a table contains duplicate rows. A) Unique predicate B) Like Predicate C) Null predicate D) In predicate
Last Answer : A) Unique predicate
Description : Which one of the following is true? (A) The resolvent of two Horn clauses is not a Horn clause. (B) The resolvent of two Horn clauses is a Horn Clause. (C) If we resolve a negated goal G against a ... negated goal G against a fact or rule A to get clause C then C has positive literal or null goal.
Last Answer : (B) The resolvent of two Horn clauses is a Horn Clause.
Description : In RDBMS, the constraint that no key attribute (column) may be NULL is referred to as: (A) Referential integrity (B) Multi-valued dependency (C) Entity Integrity (D) Functional dependency
Last Answer : (C) Entity Integrity
Description : Consider the following statements regarding relational database model: (a) NULL values can be used to opt a tuple out of enforcement of a foreign key. (b) Suppose that table T has only one candidate key. If Q is in 3NF, then it is ... true. (C) (b) and (c) are true. (D) (a), (b) and (c) are true.
Last Answer : (D) (a), (b) and (c) are true.
Description : Integrity constraints ensure that changes made to the database by authorized users do not result into loss of data consistency. Which of the following statement(s) is (are) true w.r.t. the examples of integrity constraints? (A) An ... ) and (B) are true; (C) false. (4) (A), (B) and (C) are false.
Last Answer : Answer: 3
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
Description : What arithmetic operators cannot be used with strings ? a) + b) * c) – d) All of the mentioned
Last Answer : c) –