Description : Which algorithm is used for solving temporal probabilistic reasoning? a) Hill-climbing search b) Hidden markov model c) Depth-first search d) Breadth-first search
Last Answer : b) Hidden markov model
Description : Give the Baye's rule equation
Last Answer : W.K.T P(A ^ B) = P(A/B) P(B) -------------------------- 1 P(A ^ B) = P(B/A) P(A) -------------------------- 2 DIVIDING BY P(A) ; WE GET P(B/A) = P(A/B) P(B) -------------------- P(A)
Description : What is the major component/components for measuring the performance of problem solving? a) Completeness b) Optimality c) Time and Space complexity d) All of the mentioned
Last Answer : d) All of the mentioned
Description : How many terms are required for building a bayes model? a) 1 b) 2 c) 3 d) 4
Last Answer : c) 3
Description : In Bayes theorem, what is meant by P(Hi|E)? a) The probability that hypotheses Hi is true given evidence E b) The probability that hypotheses Hi is false given evidence E c) The probability ... Hi is true given false evidence E d) The probability that hypotheses Hi is false given false evidence E
Last Answer : a) The probability that hypotheses Hi is true given evidence E
Description : Define Naïve Bayes model.
Last Answer : In this model, the “class” variable C is the root and the “attribute” variable XI are the leaves. This model assumes that the attributes are conditionally independent of each other, given the class.
Description : Which will solve the conjuncts of the rule so that the total cost is minimized? a) Constraint variable b) Conjunct ordering c) Data complexity d) All of the mentioned
Last Answer : b) Conjunct ordering
Description : A plan that describe how to take actions in levels of increasing refinement and specificity is ____________ a) Problem solving b) Planning c) Non-hierarchical plan d) Hierarchical plan
Last Answer : d) Hierarchical plan
Description : The membership values of the membership function are nor strictly monotonically increasing or decreasing or strictly monoronically increasing than decreasing. A. Convex Fuzzy Set B. Non convex fuzzy set C. Normal Fuzzy set D. Sub normal fuzzy set
Last Answer : B. Non convex fuzzy set
Description : A fuzzy set has a membership function whose membership values are strictly monotonically increasing or strictly monotonically decreasing or strictly monotonically increasing than strictly monotonically decreasing with increasing ... fuzzy set C. Non concave Fuzzy set D. Non Convex Fuzzy set
Last Answer : A. convex fuzzy set
Description : What is viewed as problem of probabilistic inference? a) Speech recognition b) Speaking c) Hearing d) Utterance
Last Answer : a) Speech recognition
Description : What is needed to make probabilistic systems feasible in the world? a) Reliability b) Crucial robustness c) Feasibility d) None of the mentioned
Last Answer : b) Crucial robustness
Description : The primitives in probabilistic reasoning are random variables. a) True b) False
Last Answer : a) True
Description : Fuzzy Computing A . mimics human behaviour B. doesnt deal with 2 valued logic C. deals with information which is vague, imprecise, uncertain, ambiguous, inexact, or probabilistic D . All of the above
Last Answer : D . All of the above
Description : What are the tasks in probabilistic language model?
Last Answer : i. Information retrieval ii. Information Extraction iii. Machine Translation
Description : A function point is a measure of program size based on the number and complexity of inputs, outputs, queries, files and program interfaces.
Last Answer : Ans: True
Description : A(n) ____________ is a measure of program size based on the number and complexity of inputs, outputs, queries, files, and program interfaces. a. function point b. line of code c. project plan d. standard module e. workplan
Last Answer : a. function point
Description : Which of the following is not the function of client? A) Compile queries B) Query optimization C) Receive queries D) Result formatting and presentation
Last Answer : B) Query optimization
Description : Which of the following is/are the Database server functions? i) Data management ii) Transaction management iii) Compile queries iv) Query optimization A) i, ii, and iv only B) i, ii and iii only C) ii, iii and iv only D) All i, ii, iii, and iv
Last Answer : A) i, ii, and iv only
Description : Consider the following three SQL queries (Assume the data in the people table) : (a) Select Name from people where Age>21; (b) Select Name from people where Height>180; (c) Select Name from people where (Age>21) or (Height ... number of rows returned by the SQL query (c) ? (A) 3 (B) 7 (C) 10 (D) 21
Last Answer : (C) 10
Description : Suppose ORACLE relation R(A, B) currently has tuples {(1, 2), (1, 3), (3, 4)} and relation S(B, C) currently has {(2, 5), (4, 6), (7, 8)}. Consider the following two SQL queries SQ1 and SQ2 ... (A) 2 and 6 respectively (B) 6 and 2 respectively (C) 2 and 4 respectively (D) 4 and 2 respectively
Last Answer : (D) 4 and 2 respectively
Description : Consider the relations R(A,B) and S(B,C) and the following four relational algebra queries over R and S: I. πA,B(R⋈S) II. R⋈πB(S) III. R∩(πA(R) Χ πB(S)) IV. πA,R.B(R Χ S) where R.B refers to ... IV are the same query. (C) I, II and IV are the same query. (D) I, III and III are the same query.
Last Answer : (D) I, III and III are the same query.
Description : Computational learning theory analyzes the sample complexity and computational complexity of __________ a) Unsupervised Learning b) Inductive learning c) Forced based learning d) Weak learning
Last Answer : b) Inductive learning
Description : Which makes the complexity of the entire algorithm quadratic in the size? a) Clause b) Inference c) Resolution d) Occur check
Last Answer : d) Occur check
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 : How many possible sources of complexity are there in forward chaining? a) 1 b) 2 c) 3 d) 4
Description : The main idea of Bidirectional search is to reduce the time complexity by searching two way simultaneously from start node and another from goal node. a) True b) False
Description : The time and space complexity of BFS is (For time and space complexity problems consider b as branching factor and d as depth of the search tree.) a) O(bd+1) and O(bd+1) b) O(b2) and O(d2) c) O(d2) and O(b2) d) O(d2) and O(d2)
Last Answer : a) O(bd+1) and O(bd+1)
Description : What is the space complexity of Depth-first search? a) O(b) b) O(bl) c) O(m) d) O(bm)
Last Answer : d) O(bm)
Description : n(log n) is referred to A. A measure of the desired maximal complexity of data mining algorithms B. A database containing volatile data used for the daily operation of an organization C. Relational database management system D. None of these
Last Answer : A. A measure of the desired maximal complexity of data mining algorithms
Description : Computational learning theory analyzes the sample complexity and computational complexity of a) Unsupervised Learning b) Inductive learning c) Forced based learning d) Weak learning e) Knowledge based learning
Description : Write the time & space complexity associated with depth limited search.
Last Answer : Time complexity =O (bd) , b-branching factor, d-depth of tree Space complexity=o (bl)
Description : Choose form the following areas where NLP can be useful. a) Automatic Text Summarization b) Automatic Question-Answering Systems c) Information Retrieval d) All of the mentioned
Description : What will backward chaining algorithm will return? a) Additional statements b) Substitutes matching the query c) Logical statement d) All of the mentioned
Last Answer : b) Substitutes matching the query
Description : Searching using query on Internet is, use of ___________ type of agent. a) Offline agent b) Online agent c) Both Offline & Online agent d) Goal Based & Online agent
Last Answer : d) Goal Based & Online agent
Description : Transparency A . The large set of candidate solutions possible for a problem B. The information stored in a database that can be retrieved with a single query C. Worth of the output of a machine learning program that makes it understandable for humans D . None of these
Last Answer : C. Worth of the output of a machine learning program that makes it understandable for humans
Description : Quantitative attributes are A. A reference to the speed of an algorithm, which is quadratically dependent on the size of the data B. Attributes of a database table that can take only numerical values C. Tools designed to query a database D. None of these
Last Answer : B. Attributes of a database table that can take only numerical values
Description : Shallow knowledge A . The large set of candidate solutions possible for a problem B. The information stored in a database that can be, retrieved with a single query C. Worth of the output of a machine learning program that makes it understandable for humans D . None of these
Last Answer : B. The information stored in a database that can be, retrieved with a single query
Description : Search space A . The large set of candidate solutions possible for a problem B. The information stored in a database that can be, retrieved with a single query. C. Worth of the output of a machine learning program that makes it understandable for humans D . None of these
Last Answer : A . The large set of candidate solutions possible for a problem
Description : What are the two we use to query and answer in knowledge base?
Last Answer : ASK and TELL.
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 : Solving a constraint satisfaction problem on a finite domain is an/a ___________ problem with respect to the domain size. a) P complete b) NP complete c) NP hard
Last Answer : b) NP complete
Description : Web Crawler is a/an ____________ a) Intelligent goal-based agent b) Problem-solving agent
Last Answer : a) Intelligent goal-based agent
Description : A problem solving approach works well for ______________ a) 8-Puzzle problem b) 8-queen problem c) Finding a optimal path from a given source to a destination d) Mars Hover (Robot Navigation)
Last Answer : d) Mars Hover (Robot Navigation)
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
Description : What is the main task of a problem-solving agent? a) Solve the given problem and reach to goal b) To find out which sequence of action will get it to the goal state c) All of the mentioned d) None of the mentioned
Last Answer : c) All of the mentioned
Description : What is the term used for describing the judgmental or commonsense part of problem solving? a) Heuristic b) Critical c) Value based d) Analytical
Last Answer : a) Heuristic
Description : Which term is used for describing the judgmental or commonsense part of problem solving? a) Heuristic b) Critical c) Value based d) Analytical
Description : The CAI (Computer-Assisted Instruction) technique based on programmed instruction is __________ a) frame-based CAI b) generative CAI c) problem-solving CAI d) intelligent CAI
Last Answer : a) frame-based CAI
Description : Having multiple perceptrons can actually solve the XOR problem satisfactorily: this is because each perceptron can partition off a linear part of the space itself, and they can then combine their results. ... have to be explicitly hand-coded d) False - just having a single perceptron is enough
Last Answer : c) True – perceptrons can do this but are unable to learn to do it – they have to be explicitly hand-coded