How many states are present in parsing?

a) 1

b) 2

c) 3

d) 4

1 Answer

Answer :

c) 3

Related questions

Description : Pick out the correct option about the types of parsing. a) Top-down and bottom-up parsing b) Interpretation and communication c) Roll-up and roll-down d) None of the mentioned

Last Answer : a) Top-down and bottom-up parsing

Description : A network with named nodes and labeled arcs that can be used to represent certain natural language grammars to facilitate parsing. a) Tree Network b) Star Network c) Transition Network d) Complete Network

Last Answer : c) Transition Network

Description : What are the algorithms to have efficient parsing?

Last Answer : i. Left to right parsing algorithm  ii. Chart Parsing algorithm.  iii. Left corner parsing

Description : Define Bottom up parsing.

Last Answer :  We start from the leaf nodes (i.e.) with the words and search for a tree with root S. 

Description : Define Top down parsing. 

Last Answer :  It starts with root node S and search for a tree that has the words as it leaves. 

Description : What are the types of parsing?

Last Answer : i. Top down parsing  ii. Bottom up parsing

Description : Define Parsing.

Last Answer : Parsing is the process of finding a parse tree for a given input string. It is also known as syntactic analysis.

Description : How to setup Vision Helpdesk Two Way Email Parsing?

Last Answer : I do not, but I went to there website and I see that they have live support which is online right now. If you get frusturated with it I reccomend www.zendesk.com and http://www.jazzdesk.com/

Description : Easy ICS Embedding / Parsing?

Last Answer : I’ve never used it but this looks like it might be useful? http://phpicalendar.net/documentation/index.php/Main_Page

Description : Which of the following derivations does a top-down parser use while parsing an input string ? The input is scanned from left to right. (A) Leftmost derivation (B) Leftmost derivation traced out in reverse (C) Rightmost derivation traced out in reverse (D) Rightmost derivation

Last Answer : (A) Leftmost derivation

Description : The process of assigning load addresses to the various parts of the program and adjusting the code and data in the program to reflect the assigned addresses is called .................. (A) Symbol resolution (B) Parsing (C) Assembly (D) Relocation

Last Answer : (D) Relocation

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 : How many things are present in conventional communication signs? a) 3 b) 4 c) 5 d) 6

Last Answer : c) 5

Description : What are present in each level of planning graph? a) Literals b) Actions c) Variables d) Both Literals & Actions

Last Answer : d) Both Literals & Actions

Description : What are not present in finish actions? a) Preconditions b) Effect c) Finish d) None of the mentioned

Last Answer : b) Effect

Description : What are not present in start actions? a) Preconditions b) Effect c) Finish d) None of the mentioned

Last Answer : a) Preconditions

Description : What are present in the empty plan? a) Start b) Finish c) Modest d) Both Start & Finish

Last Answer : d) Both Start & Finish

Description : What kind of observing environments are present in artificial intelligence? a) Partial b) Fully c) Learning d) Both Partial & Fully

Last Answer : d) Both Partial & Fully

Description : In which agent does the problem generator is present? a) Learning agent b) Observing agent c) Reflex agent d) None of the mentioned

Last Answer : a) Learning agent

Description : What is the problem space of means-end analysis? a) An initial state and one or more goal states b) One or more initial states and one goal state c) One or more initial states and one or more goal state d) One initial state and one goal state

Last Answer : a) An initial state and one or more goal states

Description : Which problem can frequently occur in backward chaining algorithm? a) Repeated states b) Incompleteness c) Complexity d) Both Repeated states & Incompleteness

Last Answer : d) Both Repeated states & Incompleteness

Description : To which depth does the alpha-beta pruning can be applied? a) 10 states b) 8 States c) 6 States d) Any depth

Last Answer : d) Any depth

Description : Which values are independant in minimax search algorithm? a) Pruned leaves x and y b) Every states are dependant c) Root is independant d) None of the mentioned

Last Answer : a) Pruned leaves x and y

Description : How many states are available in state-space search? a) 1 b) 2 c) 3 d) 4

Last Answer : d) 4

Description : A genetic algorithm (or GA) is a variant of stochastic beam search in which successor states are generated by combining two parent states, rather than by modifying a single state. a) True b) False

Last Answer : a) True

Description : __________ algorithm keeps track of k states rather than just one. a) Hill-Climbing search b) Local Beam search c) Stochastic hill-climbing search d) Random restart hill-climbing search

Last Answer : b) Local Beam search

Description : For general graph, how one can get rid of repeated states? a) By maintaining a list of visited vertices b) By maintaining a list of traversed edges c) By maintaining a list of non-visited vertices d) By maintaining a list of non-traversed edges

Last Answer : a) By maintaining a list of visited vertices

Description : Which search implements stack operation for searching the states? a) Depth-limited search b) Depth-first search c) Breadth-first search d) None of the mentioned

Last Answer : b) Depth-first search

Description : The Set of actions for a problem in a state space is formulated by a ___________ a) Intermediate states b) Initial state c) Successor function, which takes current action and returns next immediate state d) None of the mentioned

Last Answer : c) Successor function, which takes current action and returns next immediate state

Description : The problem-solving agent with several immediate options of unknown value can decide what to do by just examining different possible sequences of actions that lead to states of known value, and then choosing the ... . This process of looking for such a sequence is called Search. a) True b) False

Last Answer : a) True

Description : How the new states are generated in genetic algorithm? a) Composition b) Mutation c) Cross-over d) Both Mutation & Cross-over

Last Answer : d) Both Mutation & Cross-over

Description : When do we call the states are safely explorable? a) A goal state is unreachable from any state b) A goal state is denied access c) A goal state is reachable from every state d) None of the mentioned

Last Answer : c) A goal state is reachable from every state

Description : Which agent deals with happy and unhappy states? a) Simple reflex agent b) Model based agent c) Learning agent d) Utility based agent

Last Answer : d) Utility based agent

Description : The hardware feature of LISP machines generally includes _____________ a) Large memory and high-speed processorb) Letter quality printers and eight-inch disk drives c) A mouse and specialized keyboard d) A mouse and specialized keyboard, Letter quality printers and eight-inch disk drives

Last Answer : d) A mouse and specialized keyboard, Letter quality printers and eight-inch disk drives

Description : In which of the following situations might a blind search be acceptable? a) Real life situation b) Complex game c) Small search space d) All of the mentioned

Last Answer : c) Small search space

Description : The component of an ICAI (Intelligent Computer Assisted Instruction) presenting information to the student is the? a) Student model b) Problem solving expertise c) Tutoring module d) All of the mentioned

Last Answer : c) Tutoring module

Description : Which kind of planning consists of successive representations of different levels of a plan? a) Hierarchical planning b) Non-hierarchical planning c) Project planning

Last Answer : a) Hierarchical planning

Description : When a top-level function is entered, the LISP processor does? a) It reads the function entered b) It prints the result returned by the function c) Large memory and high-speed processor d) All of the mentioned

Last Answer : b) It prints the result returned by the function

Description : How can you evaluate 1.25 + sqrt (144) in LISP? a) 1.25+sqrt (1.44) b) (1.25+sqrt (1.44)) c) (+1.25 sqrt (1.44) d) All of the mentioned

Last Answer : c) (+1.25 sqrt (1.44)

Description : In LISP, the square root of X is referenced as _____________ a) sqrt(x) b) (sqrt x) c) x/2 d) x/3

Last Answer : b) (sqrt x)

Description : Which of the following contains output segments of AI programming? a) Printed language and synthesized b) Manipulation of physical object c) Locomotion d) All of the mentioned

Last Answer : d) All of the mentioned

Description : The cray X-MP, IBM 3090 and connection machine can be characterized as ____________ a) SISD b) SIMD c) MISD d) MIMD

Last Answer : b) SIMD

Description : The Newell and Simon program that proved theorems of Principal Mathematical was ____________ a) Elementary Perceiver b) General Problem Solver c) Logic Theorist d) Boolean Algebra

Last Answer : c) Logic Theorist

Description : The primary method that people use to sense their environment is ____________ a) reading b) writing c) speaking d) seeing

Last Answer : d) seeing

Description : Which technique is being investigated as an approach to automatic programming? a) generative CAI b) specification by example c) non-hierarchical planning d) all of the mentioned

Last Answer : b) specification by example

Description : The company that grew out of research at the MIT AI lab is ____________ a) AI corp b) LMI c) Symbolics d) Both LMI & Symbolics

Last Answer : d) Both LMI & Symbolics

Description : Computers normally solve problem by breaking them down into a series of yes-or-no decisions represented by 1s and 0s. What is the name of the logic that allows computers to assign numerical values that fail ... 0 and 1? a) Human logic b) Fuzzy logic c) Boolean logic d) Operational logic

Last Answer : b) Fuzzy logic

Description : In which of the following areas may ICAI programs prove to be useful? a) educational institutions b) corporations c) department of Defense d) all of the mentioned

Last Answer : d) all of the mentioned

Description : Visual clues that are helpful in computer vision include __________ a) color and motion b) depth and texture c) height and weight d) color and motion, depth and texture

Last Answer : d) color and motion, depth and texture

Description : The explanation facility of an expert system may be used to ____________ a) construct a diagnostic model b) expedite the debugging process c) explain the system’s reasoning process d) explain the system’s reasoning process & expedite the debugging process

Last Answer : d) explain the system’s reasoning process & expedite the debugging process