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 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 : 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.
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 : 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|λ
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
Description : Shift-Reduce parsers perform the following : (A) Shift step that advances in the input stream by K(K>1) symbols and Reduce step that applies a completed grammar rule to some recent parse trees, ... in the input stream and Reduce step that applies a completed grammar rule to form a single tree.
Last Answer : (B) Shift step that advances in the input stream by one symbol and Reduce step that applies a completed grammar rule to some recent parse trees, joining them together as one tree with a new root symbol.
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}
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.
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.
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.
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
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.
Description : Which one of the following is correct, when a class grants friend status to another class? (A) The member functions of the class generating friendship can access the members of the friend class. (B) ... the friendship. (C) Class friendship is reciprocal to each other (D) There is no such concept.
Last Answer : All member functions of the class granted friendship have unrestricted access to the members of the class granting the friendship.
Description : What is a finite set of rules that specifies a language? a) Signs b) Communication c) Grammar d) Phrase
Last Answer : c) Grammar
Description : Horn clauses are special kinds of propositions which can be described as (A) Single atomic proposition on left side. (B) Single or multiple atomic proposition on left side. (C) A single atomic ... proposition on right side. (D) A single atomic proposition on left side or an empty left side.
Last Answer : (D) A single atomic proposition on left side or an empty left side.
Description : Which one from the following is false ? (A) LALR parser is Bottom - Up parser (B) A parsing algorithm which performs a left to right scanning and a right most deviation is RL (1). (C) LR parser is Bottom - Up parser. (D) In LL(1), the 1 indicates that there is a one - symbol look - ahead.
Last Answer : (B) A parsing algorithm which performs a left to right scanning and a right most deviation is RL (1).
Description : Which of the following is true ? (A) Canonical LR parser is LR (1) parser with single look ahead terminal (B) All LR(K) parsers with K > 1 can be transformed into LR(1) parsers. (C) Both (A) and (B) (D) None of the above
Last Answer : (C) Both (A) and (B)
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
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
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.
Description : 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 ... context free language, L2 is not context free language. (4) L1 is not context free language, L2 is context free language.
Last Answer : L1 is context free language, L2 is not context free language.
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
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 | λ
Description : Refer the points as listed below: (a) What are the operator precedence rules ? (b) What are the operator associativity rules ? (c) What is the order of operand evaluation ? (d) Are there restrictions on operand evaluation side effects ? ... (d) (C) (a), (b) and (d) (D) (a), (b), (c) and (d)
Last Answer : (D) (a), (b), (c) and (d)
Description : The phrase 'tragedy of commons’ is in the context of (A) tragic event related to damage caused by release of poisonous gases. (B) tragic conditions of poor people. (C) degradation of renewable free access resources (D) climate change
Last Answer : (C) degradation of renewable free access resources
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
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
Description : Are there good arguments against unrestricted free trade?
Last Answer : answer:For me there are a number of things, one thing at least, I don't know if an 18th century economic model is capable of setting a standard for 21 century financial instruments, for example, the ... everything? Can the market really sort it all out for the best? Personally, I don't think so.
Description : Free Trade refers to - (1) free movement of goods from one country to another (2) movement of goods free of cost (3) unrestricted exchange of goods and service (4) trade free of duty
Last Answer : (1) free movement of goods from one country to another Explanation: Free trade is a policy by which a government does not discriminate against imports or interfere with exports by ... countries are determined by price strategies that may differ-from those that would emerge under deregulation.
Description : Free Trade refers to (1) free movement of goods from one country to another (2) movement of goods free of cost (3) unrestricted exchange of goods and service (4) trade free of duty
Last Answer : free movement of goods from one country to another
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
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
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
Description : Which of the following statement(s) is/are FALSE in the context of Relational DBMS ? I. Views in a database system are important because they help with access control by allowing users to see only a particular subset of the data ... (B) III and IV only (C) I, II and III only (D) II, III and IV only
Last Answer : (D) II, III and IV only
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
Description : ............... model is designed to bring prices down by increasing the number of customers who buy a particular product at once. (A) Economic Order Quantity (B) Inventory (C) Data Mining (D) Demand-Sensitive Pricing
Last Answer : (D) Demand-Sensitive Pricing
Description : What can you say about the following statements? I. XML tags are case-insensitive. II. In JavaScript, identifier names are case-sensitive. III. Cascading Style Sheets (CSS) cannot be used with XML. IV. All well-formed ... IV are false. (3) only I and III are false. (4) only II and IV are false.
Last Answer : Answer: Marks to all
Description : A 22-year-old man sustains a single stab wound to the left chest and presents to the emergency room with hypotension. Which of the following statement(s) is/are true concerning his ... diagnosis of pericardial tamponade d. The placement of bilateral chest tubes will likely resolve the problem
Last Answer : Answer: c Shock from cardiac compression occurs when external pressure on the heart impairs ventricular filling. Because ventricular filling is a function of venous return and myocardial compliance, ... sternotomy. Chest tube placement would not be appropriate as the sole treatment in this patient
Description : ……………. Allows definitions and query language statements to be entered; query results are formatted and displayed. A) Schema Processor B) Query Processor C) Terminal Interface D) None of the above
Last Answer : C) Terminal Interface
Description : The name of the protocol which provides virtual terminal in TCP/IP model is. A) Telnet B) SMTP C) HTTP
Last Answer : A) Telnet
Description : Which of the following is an application layer service? A) Network virtual terminal B) File transfer, access and management C) Mail service D) All of the above
Last Answer : C) Mail service
Description : Consider the following UNIX command: sort temp; head -30
Last Answer : (C) Sort, taking the input from "in" and writing the output to "temp" then prints 30 lines from temp on terminal. Finally "temp" is removed.
Description : A terminal multiplexer has six 1200 bps terminals and ‘n’ 300 bps terminals connected to it. If the outgoing line is 9600 bps, what is the value of n ? (A) 4 (B) 8 (C) 16 (D) 28
Last Answer : (B) 8
Description : Which statement is not correct about “init” process in Unix? (1) It is generally the parent of the login shell. (2) It has PID 1. (3) It is the first process in the system. (4) Init forks and execs a ‘getty’ process at every port connected to a terminal.
Last Answer : It is the first process in the system.
Description : Grammar question: does a one word or phrase answer in "social" have to be capitalized?
Last Answer : I’ve been dinged for it now & then. The gods must be forgiven for confusing omnipotence with perfection. We must not be allowed to forget who’s boss.
Description : In the system shown in the illustration, the station at section I is unable to signal any other station nor is any other station able to signal the station in section I. The station can, however, ring ... only a single station to respond to itself. D. The switch at component 'C' is stuck open.
Last Answer : Answer: B
Description : What does the phrase “bowing to their enthusiasm” mean What action on Captain Tucker’s part provides a context clue to help you understand the phrase as it’s used in the text?
Last Answer : Journeys book 5th grade, "Dangrous Crossing"
Description : Which phrase best describes an events historical context?
Last Answer : The energy in the auditorium.
Description : The teacher has been glorified by the phrase “Friend, philosopher and guide” because Options: A) He has to play all vital roles in the context of society B) He transmits the high value of humanity to students C) He is the great reformer of the society D) He is a great patriot
Last Answer : B) He transmits the high value of humanity to students