· 5 years ago · May 26, 2020, 12:48 PM
1[
2 {
3 "name": "Question 0",
4 "desc": "In LISP, the function returns the list that results after the first element is removed (the rest f the list), is",
5 "ans": "d",
6 "opt": {
7 "a": " car",
8 "b": " last",
9 "c": " cons",
10 "d": " cdr"
11 }
12 },
13 {
14 "name": "Question 1",
15 "desc": "Output segments of Artificial Intelligence programming contain(s)",
16 "ans": "d",
17 "opt": {
18 "a": " Printed language and synthesized speech",
19 "b": " Manipulation of physical object",
20 "c": " Locomotion",
21 "d": " All of the mentioned"
22 }
23 },
24 {
25 "name": "Question 2",
26 "desc": "LISP was created by:",
27 "ans": "a",
28 "opt": {
29 "a": " John McCarthy",
30 "b": " Marvin Minsky",
31 "c": " Alan Turing",
32 "d": " Allen Newell and Herbert Simon"
33 }
34 },
35 {
36 "name": "Question 3",
37 "desc": "Expert Ease was developed under the direction of:",
38 "ans": "b",
39 "opt": {
40 "a": " John McCarthy",
41 "b": " Donald Michie",
42 "c": " Lofti Zadeh",
43 "d": " Alan Turing"
44 }
45 },
46 {
47 "name": "Question 4",
48 "desc": "An Artificial Intelligence system developed by Terry AWinograd to permit an interactive dialogue about a domain he called blocks-world.",
49 "ans": "a",
50 "opt": {
51 "a": " SHRDLU",
52 "b": " SIMD",
53 "c": " BACON",
54 "d": " STUDENT"
55 }
56 },
57 {
58 "name": "Question 5",
59 "desc": "MLMenu, a natural language interface for the TI Explorer, is similar to:",
60 "ans": "b",
61 "opt": {
62 "a": " Ethernet",
63 "b": " NaturalLink",
64 "c": " PROLOG",
65 "d": " The Personal Consultant"
66 }
67 },
68 {
69 "name": "Question 6",
70 "desc": "Strong Artificial Intelligence is",
71 "ans": "a",
72 "opt": {
73 "a": " the embodiment of human intellectual capabilities within a computer",
74 "b": " a set of computer programs that produce output that would be considered to reflect intelligence if it were generated by humans",
75 "c": " the study of mental faculties through the use of mental models implemented on a computer",
76 "d": " all of the mentioned"
77 }
78 },
79 {
80 "name": "Question 7",
81 "desc": "The traditional way to exit and LISP system is to enter",
82 "ans": "b",
83 "opt": {
84 "a": " quit",
85 "b": " exit",
86 "c": " bye",
87 "d": " ok"
88 }
89 },
90 {
91 "name": "Question 8",
92 "desc": "In which of the following situations might a blind search be acceptable?",
93 "ans": "c",
94 "opt": {
95 "a": " real-life situation",
96 "b": " complex game",
97 "c": " small search space",
98 "d": " all of the mentioned"
99 }
100 },
101 {
102 "name": "Question 9",
103 "desc": "What is Artificial intelligence?",
104 "ans": "c",
105 "opt": {
106 "a": " Putting your intelligence into Computer",
107 "b": " Programming with your own intelligence",
108 "c": " Making a Machine intelligent",
109 "d": " Playing a Game"
110 }
111 },
112 {
113 "name": "Question 10",
114 "desc": "Which search method takes less memory?",
115 "ans": "a",
116 "opt": {
117 "a": " Depth-First Search",
118 "b": " Breadth-First search",
119 "c": " Optimal search",
120 "d": " Linear Search"
121 }
122 },
123 {
124 "name": "Question 11",
125 "desc": "A heuristic is a way of trying",
126 "ans": "d",
127 "opt": {
128 "a": " To discover something or an idea embedded in a program",
129 "b": " To search and measure how far a node in a search tree seems to be from a goal",
130 "c": " To compare two nodes in a search tree to see if one is better than the other is",
131 "d": " All of the mentioned"
132 }
133 },
134 {
135 "name": "Question 12",
136 "desc": "How do you represent �All dogs have tails�?",
137 "ans": "a",
138 "opt": {
139 "a": " _x: dog(x) �hastail(x)",
140 "b": " _x: dog(x) �hastail(y)",
141 "c": " _x: dog(y) �hastail(x)",
142 "d": " _x: dog(x) �has�tail(x)"
143 }
144 },
145 {
146 "name": "Question 13",
147 "desc": "Which is not a property of representation of knowledge?",
148 "ans": "a",
149 "opt": {
150 "a": " Representational Verification",
151 "b": " Representational Adequacy",
152 "c": " Inferential Adequacy",
153 "d": " Inferential Efficiency"
154 }
155 },
156 {
157 "name": "Question 14",
158 "desc": "A series of Artificial Intelligence systems, developed by Pat Langley to explore the role of heuristics in scientific discovery is ________",
159 "ans": "b",
160 "opt": {
161 "a": " RAMD",
162 "b": " BACON",
163 "c": " MIT",
164 "d": " DU"
165 }
166 },
167 {
168 "name": "Question 15",
169 "desc": "A.Mturing developed a technique for determining whether a computer could or could not demonstrate the artificial Intelligence, Presently, this technique is called",
170 "ans": "a",
171 "opt": {
172 "a": " Turing Test",
173 "b": " Algorithm",
174 "c": " Boolean Algebra",
175 "d": " Logarithm"
176 }
177 },
178 {
179 "name": "Question 16",
180 "desc": "A Personal Consultant knowledge base contain information in the form of:",
181 "ans": "d",
182 "opt": {
183 "a": " parameters",
184 "b": " contexts",
185 "c": " production rules",
186 "d": " all of the mentioned"
187 }
188 },
189 {
190 "name": "Question 17",
191 "desc": "Which approach to speech recognition avoids the problem caused by the variation in speech patterns among different speakers?",
192 "ans": "d",
193 "opt": {
194 "a": " Continuous speech recognition",
195 "b": " Isolated word recognition",
196 "c": " Connected word recognition",
197 "d": " Speaker-dependent recognition"
198 }
199 },
200 {
201 "name": "Question 18",
202 "desc": "Which of the following, is a component of an expert system?",
203 "ans": "d",
204 "opt": {
205 "a": " inference engine",
206 "b": " knowledge base",
207 "c": " user interface",
208 "d": " all of the mentioned"
209 }
210 },
211 {
212 "name": "Question 19",
213 "desc": "A computer vision technique that relies on image templates is:",
214 "ans": "c",
215 "opt": {
216 "a": " edge detection",
217 "b": " binocular vision",
218 "c": " model-based vision",
219 "d": " robot vision"
220 }
221 },
222 {
223 "name": "Question 20",
224 "desc": "DARPA, the agency that has funded a great deal of American Artificial Intelligence research, is part of the Department of:",
225 "ans": "a",
226 "opt": {
227 "a": " Defense",
228 "b": " Energy",
229 "c": " Education",
230 "d": " Justice"
231 }
232 },
233 {
234 "name": "Question 21",
235 "desc": "Which of these schools was not among the early leaders in Artificial Intelligence research?",
236 "ans": "b",
237 "opt": {
238 "a": " Dartmouth University",
239 "b": " Harvard University",
240 "c": " Massachusetts Institute of Technology",
241 "d": " Stanford University"
242 }
243 },
244 {
245 "name": "Question 22",
246 "desc": "A certain Professor at the Stanford University coined the word �artificial intelligence� in 1956 at a conference held at Dartmouth collegeCan you name the Professor?",
247 "ans": "b",
248 "opt": {
249 "a": " David Levy",
250 "b": " John McCarthy",
251 "c": " Joseph Weizenbaum",
252 "d": " Hans Berliner"
253 }
254 },
255 {
256 "name": "Question 23",
257 "desc": "In LISP, the function (copy-list <list>)",
258 "ans": "a",
259 "opt": {
260 "a": " returns a new list that is equal to <list> by copying the top-level element of <list>",
261 "b": " returns the length of <list>",
262 "c": " returns t if <list> is empty",
263 "d": " all of the mentioned"
264 }
265 },
266 {
267 "name": "Question 24",
268 "desc": "Who is the �father� of artificial intelligence?",
269 "ans": "a",
270 "opt": {
271 "a": " Fisher Ada",
272 "b": " John McCarthy",
273 "c": " Allen Newell",
274 "d": " Alan Turning"
275 }
276 },
277 {
278 "name": "Question 25",
279 "desc": "In 1985, the famous chess player David Levy beat a world champion chess program in four straight games by using orthodox moves that confused the programWhat was the name of the chess program?",
280 "ans": "b",
281 "opt": {
282 "a": " Kaissa",
283 "b": " CRAY BLITZ",
284 "c": " Golf",
285 "d": " DIGDUG"
286 }
287 },
288 {
289 "name": "Question 26",
290 "desc": "The explanation facility of an expert system may be used to:",
291 "ans": "d",
292 "opt": {
293 "a": " construct a diagnostic model",
294 "b": " expedite the debugging process",
295 "c": " explain the system�s reasoning process",
296 "d": " expedite the debugging process & explain the system�s reasoning process"
297 }
298 },
299 {
300 "name": "Question 27",
301 "desc": "A process that is repeated, evaluated, and refined is called:",
302 "ans": "d",
303 "opt": {
304 "a": " diagnostic",
305 "b": " descriptive",
306 "c": " interpretive",
307 "d": " iterative"
308 }
309 },
310 {
311 "name": "Question 28",
312 "desc": "Visual clues that are helpful in computer vision include:",
313 "ans": "d",
314 "opt": {
315 "a": " color and motion",
316 "b": " depth and texture",
317 "c": " height and weight",
318 "d": " color and motion, depth and texture"
319 }
320 },
321 {
322 "name": "Question 29",
323 "desc": "The conference that launched the AI revolution in 1956 was held at:",
324 "ans": "a",
325 "opt": {
326 "a": " Dartmouth",
327 "b": " Harvard",
328 "c": " New York",
329 "d": " Stanford"
330 }
331 },
332 {
333 "name": "Question 30",
334 "desc": "Texas Instruments Incorporated produces a low-cost LISP machine called:",
335 "ans": "b",
336 "opt": {
337 "a": " The Computer-Based Consultant",
338 "b": " The Explorer",
339 "c": " Smalltalk",
340 "d": " The Personal Consultant"
341 }
342 },
343 {
344 "name": "Question 31",
345 "desc": "When a top-level function is entered, the LISP processor do(es)",
346 "ans": "d",
347 "opt": {
348 "a": " It reads the function entered",
349 "b": " It evaluates the function and the function�s operands",
350 "c": " It prints the results returned by the function",
351 "d": " All of the mentioned"
352 }
353 },
354 {
355 "name": "Question 32",
356 "desc": "One method of programming a computer to exhibit human intelligence is called modeling or:",
357 "ans": "a",
358 "opt": {
359 "a": " simulation",
360 "b": " cognitization",
361 "c": " duplication",
362 "d": " psychic amelioration"
363 }
364 },
365 {
366 "name": "Question 33",
367 "desc": "Graphic interfaces were first used in a Xerox product called:",
368 "ans": "c",
369 "opt": {
370 "a": " InterLISP",
371 "b": " Ethernet",
372 "c": " Smalltalk",
373 "d": " ZetaLISP"
374 }
375 },
376 {
377 "name": "Question 34",
378 "desc": "The Al researcher who co-authored both the Handbook of Artificial Intelligence and The Fifth Generation is:",
379 "ans": "c",
380 "opt": {
381 "a": " Bruce Lee",
382 "b": " Randy Davis",
383 "c": " Ed Feigenbaum",
384 "d": " Mark Fox"
385 }
386 },
387 {
388 "name": "Question 35",
389 "desc": "Which of the following is being investigated as a means of automating the creation of a knowledge base?",
390 "ans": "d",
391 "opt": {
392 "a": " automatic knowledge acquisition",
393 "b": " simpler tools",
394 "c": " discovery of new concepts",
395 "d": " all of the mentioned"
396 }
397 },
398 {
399 "name": "Question 36",
400 "desc": "The CAI (Computer-Assisted Instruction) technique based on programmed instruction is:",
401 "ans": "a",
402 "opt": {
403 "a": " frame-based CAI",
404 "b": " generative CAI",
405 "c": " problem-solving CAI",
406 "d": " intelligent CAI"
407 }
408 },
409 {
410 "name": "Question 37",
411 "desc": "A robot�s �arm� is also known as its:",
412 "ans": "c",
413 "opt": {
414 "a": " end effector",
415 "b": " actuator",
416 "c": " manipulator",
417 "d": " servomechanism"
418 }
419 },
420 {
421 "name": "Question 38",
422 "desc": "KEE is a product of:",
423 "ans": "b",
424 "opt": {
425 "a": " Teknowledge",
426 "b": " IntelliCorpn",
427 "c": " Texas Instruments",
428 "d": " Tech knowledge"
429 }
430 },
431 {
432 "name": "Question 39",
433 "desc": "In LISP, the function X (x)(2x+l) would be rendered as",
434 "ans": "a",
435 "opt": {
436 "a": " (lambda (x) (+(*2 x)l))",
437 "b": " (lambda (x) (+1 (* 2x)",
438 "c": " (+ lambda (x) 1 (*2x))",
439 "d": " (* lambda(x) (+2_1)"
440 }
441 },
442 {
443 "name": "Question 40",
444 "desc": "A natural language generation program must decide:",
445 "ans": "a",
446 "opt": {
447 "a": " what to say",
448 "b": " when to say something",
449 "c": " why it is being used",
450 "d": " both what to say & when to say something"
451 }
452 },
453 {
454 "name": "Question 41",
455 "desc": "The hardware features of LISP machines generally include:",
456 "ans": "d",
457 "opt": {
458 "a": " large memory and a high-speed processor",
459 "b": " letter-quality printers and 8-inch disk drives",
460 "c": " a mouse and a specialized keyboard",
461 "d": " large memory and a high-speed processor & a mouse and a specialized keyboard"
462 }
463 },
464 {
465 "name": "Question 42",
466 "desc": "In which of the following areas may ICAI programs prove to be useful?",
467 "ans": "a",
468 "opt": {
469 "a": " educational institutions",
470 "b": " corporations",
471 "c": " department of Defense",
472 "d": " all of the mentioned"
473 }
474 },
475 {
476 "name": "Question 43",
477 "desc": "A network with named nodes and labeled arcs that can be used to represent certain natural language grammars to facilitate parsing.",
478 "ans": "c",
479 "opt": {
480 "a": " Tree Network",
481 "b": " Star Network",
482 "c": " Transition Network",
483 "d": " Complete Network"
484 }
485 },
486 {
487 "name": "Question 44",
488 "desc": "Which of the following is true related to �Satisfiable� property?",
489 "ans": "b",
490 "opt": {
491 "a": " A statement is satisfiable if there is some interpretation for which it is false",
492 "b": " A statement is satisfiable if there is some interpretation for which it is true",
493 "c": " A statement is satisfiable if there is no interpretation for which it is true",
494 "d": " A statement is satisfiable if there is no interpretation for which it is false"
495 }
496 },
497 {
498 "name": "Question 45",
499 "desc": "Two literals are complementary if",
500 "ans": "c",
501 "opt": {
502 "a": " They are equal",
503 "b": " They are identical and of equal sign",
504 "c": " They are identical but of opposite sign",
505 "d": " They are unequal but of equal sign"
506 }
507 },
508 {
509 "name": "Question 46",
510 "desc": "Consider a good system for the representation of knowledge in a particular domainWhat property should it possess?",
511 "ans": "d",
512 "opt": {
513 "a": " Representational Adequacy",
514 "b": " Inferential Adequacy",
515 "c": " Inferential Efficiency",
516 "d": " All of the mentioned"
517 }
518 },
519 {
520 "name": "Question 47",
521 "desc": "What is Transposition rule?",
522 "ans": "d",
523 "opt": {
524 "a": " From P _ Q, infer ~Q _ P",
525 "b": " From P _ Q, infer Q _ ~P",
526 "c": " From P _ Q, infer Q _ P",
527 "d": " From P _ Q, infer ~Q _ ~P"
528 }
529 },
530 {
531 "name": "Question 48",
532 "desc": "Third component of a planning system is to",
533 "ans": "a",
534 "opt": {
535 "a": " Detect when a solution has been found",
536 "b": " Detect when solution will be found",
537 "c": " Detect whether solution exists or not",
538 "d": " Detect whether multiple solutions exist"
539 }
540 },
541 {
542 "name": "Question 49",
543 "desc": "Which of the following is true in Statistical reasoning?",
544 "ans": "a",
545 "opt": {
546 "a": " The representation is extended to allow some kind of numeric measure of certainty to be associated with each statement",
547 "b": " The representation is extended to allow �TRUE or FALSE� to be associated with each statement",
548 "c": " The representation is extended to allow some kind of numeric measure of certainty to be associated common to all statements",
549 "d": " The representation is extended to allow �TRUE or FALSE� to be associated common to all statements"
550 }
551 },
552 {
553 "name": "Question 50",
554 "desc": "In default logic, we allow inference rules of the form",
555 "ans": "a",
556 "opt": {
557 "a": " (A : B) / C",
558 "b": " A / (B : C)",
559 "c": " A / B",
560 "d": " A / B : C"
561 }
562 },
563 {
564 "name": "Question 51",
565 "desc": "In Bayes theorem, what is the meant by P(Hi|E)?",
566 "ans": "a",
567 "opt": {
568 "a": " The probability that hypotheses Hi is true given evidence E",
569 "b": " The probability that hypotheses Hi is false given evidence E",
570 "c": " The probability that hypotheses Hi is true given false evidence E",
571 "d": " The probability that hypotheses Hi is false given false evidence E"
572 }
573 },
574 {
575 "name": "Question 52",
576 "desc": "Default reasoning is another type of",
577 "ans": "d",
578 "opt": {
579 "a": " Monotonic reasoning",
580 "b": " Analogical reasoning",
581 "c": " Bitonic reasoning",
582 "d": " Non-monotonic reasoning"
583 }
584 },
585 {
586 "name": "Question 53",
587 "desc": "Generality is the measure of",
588 "ans": "a",
589 "opt": {
590 "a": " Ease with which the method can be adapted to different domains of application",
591 "b": " The average time required to construct the target knowledge structures from some specified initial structures",
592 "c": " A learning system to function with unreliable feedback and with a variety of training examples",
593 "d": " The overall power of the system"
594 }
595 },
596 {
597 "name": "Question 54",
598 "desc": "The performance of an agent can be improved by",
599 "ans": "a",
600 "opt": {
601 "a": " Learning",
602 "b": " Observing",
603 "c": " Perceiving",
604 "d": " None of the mentioned"
605 }
606 },
607 {
608 "name": "Question 55",
609 "desc": "External actions of the agent is selected by",
610 "ans": "b",
611 "opt": {
612 "a": " Perceive",
613 "b": " Performance",
614 "c": " Learning",
615 "d": " Actuator"
616 }
617 },
618 {
619 "name": "Question 56",
620 "desc": "The action of the Simple reflex agent completely depends upon",
621 "ans": "b",
622 "opt": {
623 "a": " Perception history",
624 "b": " Current perception",
625 "c": " Learning theory",
626 "d": " Utility functions"
627 }
628 },
629 {
630 "name": "Question 57",
631 "desc": "Following could be the approaches to Artificial Intelligence",
632 "ans": "d",
633 "opt": {
634 "a": " Strong Artificial Intelligence",
635 "b": " Weak Artificial Intelligence",
636 "c": " Applied Artificial Intelligence",
637 "d": " All of the mentioned"
638 }
639 },
640 {
641 "name": "Question 58",
642 "desc": "An Artificial Neural Network Is based on",
643 "ans": "c",
644 "opt": {
645 "a": " Strong Artificial Intelligence approach",
646 "b": " Weak Artificial Intelligence approach",
647 "c": " Cognitive Artificial Intelligence approach",
648 "d": " Applied Artificial Intelligence approach"
649 }
650 },
651 {
652 "name": "Question 59",
653 "desc": "The Face Recognition system is based on",
654 "ans": "d",
655 "opt": {
656 "a": " Strong Artificial Intelligence approach",
657 "b": " Weak Artificial Intelligence approach",
658 "c": " Cognitive Artificial Intelligence approach",
659 "d": " Applied Artificial Intelligence approach"
660 }
661 },
662 {
663 "name": "Question 60",
664 "desc": "A completely automated chess engine (Learn from previous games) is based on",
665 "ans": "a",
666 "opt": {
667 "a": " Strong Artificial Intelligence approach",
668 "b": " Weak Artificial Intelligence approach",
669 "c": " Cognitive Artificial Intelligence approach",
670 "d": " Applied Artificial Intelligence approach"
671 }
672 },
673 {
674 "name": "Question 61",
675 "desc": "A basic line following robot is based on",
676 "ans": "b",
677 "opt": {
678 "a": " Strong Artificial Intelligence approach",
679 "b": " Weak Artificial Intelligence approach",
680 "c": " Cognitive Artificial Intelligence approach",
681 "d": " Applied Artificial Intelligence approach"
682 }
683 },
684 {
685 "name": "Question 62",
686 "desc": "The following task/tasks Artificial Intelligence could not do yet",
687 "ans": "d",
688 "opt": {
689 "a": " Understand natural language robustly",
690 "b": " Web mining",
691 "c": " Construction of plans in real time dynamic systems",
692 "d": " All of the mentioned"
693 }
694 },
695 {
696 "name": "Question 63",
697 "desc": "What among the following is/are the example of the intelligent agent/agents?",
698 "ans": "d",
699 "opt": {
700 "a": " Human",
701 "b": " Robot",
702 "c": " Autonomous Spacecraft",
703 "d": " All of the mentioned"
704 }
705 },
706 {
707 "name": "Question 64",
708 "desc": "When talking to a speech recognition program, the program divides each second of your speech into 100 separate:",
709 "ans": "c",
710 "opt": {
711 "a": " Codes",
712 "b": " Phonemes",
713 "c": " Samples",
714 "d": " Words"
715 }
716 },
717 {
718 "name": "Question 65",
719 "desc": "Which term is used for describing the judgmental or commonsense part of problem solving?",
720 "ans": "a",
721 "opt": {
722 "a": " Heuristic",
723 "b": " Critical",
724 "c": " Value based",
725 "d": " Analytical"
726 }
727 },
728 {
729 "name": "Question 66",
730 "desc": "Which stage of the manufacturing process has been described as �the mapping of function onto form�?",
731 "ans": "a",
732 "opt": {
733 "a": " Design",
734 "b": " Distribution",
735 "c": " Project management",
736 "d": " Field service"
737 }
738 },
739 {
740 "name": "Question 67",
741 "desc": "Which kind of planning consists of successive representations of different levels of a plan?",
742 "ans": "a",
743 "opt": {
744 "a": " hierarchical planning",
745 "b": " non-hierarchical planning",
746 "c": " all of the mentioned",
747 "d": " project planning"
748 }
749 },
750 {
751 "name": "Question 68",
752 "desc": "What was originally called the �imitation game� by its creator?",
753 "ans": "a",
754 "opt": {
755 "a": " The Turing Test",
756 "b": " LISP",
757 "c": " The Logic Theorist",
758 "d": " Cybernetics"
759 }
760 },
761 {
762 "name": "Question 69",
763 "desc": "Decision support programs are designed to help managers make:",
764 "ans": "c",
765 "opt": {
766 "a": " budget projections",
767 "b": " visual presentations",
768 "c": " business decisions",
769 "d": " vacation schedules"
770 }
771 },
772 {
773 "name": "Question 70",
774 "desc": "PROLOG is an AI programming language, which solves problems with a form of symbolic logic known as predicate calculusIt was developed in 1972 at the University of Marseilles by a team of specialistsCan you name the person who headed this team?",
775 "ans": "a",
776 "opt": {
777 "a": " Alain Colmerauer",
778 "b": " Niklaus Wirth",
779 "c": " Seymour Papert",
780 "d": " John McCarthy"
781 }
782 },
783 {
784 "name": "Question 71",
785 "desc": "Programming a robot by physically moving it through the trajectory you want it to follow be called:",
786 "ans": "b",
787 "opt": {
788 "a": " contact sensing control",
789 "b": " continuous-path control",
790 "c": " robot vision control",
791 "d": " pick-and-place control"
792 }
793 },
794 {
795 "name": "Question 72",
796 "desc": "To invoke the LISP system, you must enter",
797 "ans": "b",
798 "opt": {
799 "a": " AI",
800 "b": " LISP",
801 "c": " CL (Common Lisp)",
802 "d": " Both LISP and CL"
803 }
804 },
805 {
806 "name": "Question 73",
807 "desc": "In LISP, the function (list-length <list>)",
808 "ans": "b",
809 "opt": {
810 "a": " returns a new list that is equal to <:list> by copying the top-level element of <list>",
811 "b": " returns the length of <list>",
812 "c": " returns t if <list> is empty",
813 "d": " all of the mentioned"
814 }
815 },
816 {
817 "name": "Question 74",
818 "desc": "ART (Automatic Reasoning Tool) is designed to be used on:",
819 "ans": "a",
820 "opt": {
821 "a": " LISP machines",
822 "b": " Personal computers",
823 "c": " Microcomputers",
824 "d": " All of the mentioned"
825 }
826 },
827 {
828 "name": "Question 75",
829 "desc": "Which particular generation of computers is associated with artificial intelligence?",
830 "ans": "c",
831 "opt": {
832 "a": " Second",
833 "b": " Fourth",
834 "c": " Fifth",
835 "d": " Third"
836 }
837 },
838 {
839 "name": "Question 76",
840 "desc": "Shaping teaching techniques to fit the learning patterns of individual students is the goal of:",
841 "ans": "c",
842 "opt": {
843 "a": " decision support",
844 "b": " automatic programming",
845 "c": " intelligent computer-assisted instruction",
846 "d": " expert systems"
847 }
848 },
849 {
850 "name": "Question 77",
851 "desc": "Which of the following function returns t If the object is a symbol m LISP?",
852 "ans": "b",
853 "opt": {
854 "a": " (* <object>)",
855 "b": " (symbolp <object>)",
856 "c": " (nonnumeric <object>)",
857 "d": " (constantp <object>)"
858 }
859 },
860 {
861 "name": "Question 78",
862 "desc": "The symbols used in describing the syntax of a programming language are",
863 "ans": "d",
864 "opt": {
865 "a": " 0",
866 "b": " {}",
867 "c": " ��",
868 "d": " <>"
869 }
870 },
871 {
872 "name": "Question 79",
873 "desc": "Ambiguity may be caused by:",
874 "ans": "d",
875 "opt": {
876 "a": " syntactic ambiguity",
877 "b": " multiple word meanings",
878 "c": " unclear antecedents",
879 "d": " all of the mentioned"
880 }
881 },
882 {
883 "name": "Question 80",
884 "desc": "Which company offers the LISP machine considered �the most powerful symbolic processor available�?",
885 "ans": "b",
886 "opt": {
887 "a": " LMI",
888 "b": " Symbolics",
889 "c": " Xerox",
890 "d": " Texas Instruments"
891 }
892 },
893 {
894 "name": "Question 81",
895 "desc": "What of the following is considered a pivotal event in the history of Artificial Intelligence?",
896 "ans": "c",
897 "opt": {
898 "a": " 1949, Donald O, The organization of Behavior",
899 "b": " 1950, Computing Machinery and Intelligence",
900 "c": " 1956, Dartmouth University Conference Organized by John McCarthy",
901 "d": " 1961, Computer and Computer Sense"
902 }
903 },
904 {
905 "name": "Question 82",
906 "desc": "Natural language processing is divided into the two subfields of:",
907 "ans": "c",
908 "opt": {
909 "a": " symbolic and numeric",
910 "b": " time and motion",
911 "c": " algorithmic and heuristic",
912 "d": " understanding and generation"
913 }
914 },
915 {
916 "name": "Question 83",
917 "desc": "High-resolution, bit-mapped displays are useful for displaying:",
918 "ans": "c",
919 "opt": {
920 "a": " clearer characters",
921 "b": " graphics",
922 "c": " more characters",
923 "d": " all of the mentioned"
924 }
925 },
926 {
927 "name": "Question 84",
928 "desc": "A bidirectional feedback loop links computer modeling with:",
929 "ans": "c",
930 "opt": {
931 "a": " artificial science",
932 "b": " heuristic processing",
933 "c": " human intelligence",
934 "d": " cognitive science"
935 }
936 },
937 {
938 "name": "Question 85",
939 "desc": "Which of the following have people traditionally done better than computers?",
940 "ans": "c",
941 "opt": {
942 "a": " recognizing relative importance",
943 "b": " finding similarities",
944 "c": " resolving ambiguity",
945 "d": " all of the mentioned"
946 }
947 },
948 {
949 "name": "Question 86",
950 "desc": "In LISP, the function evaluates both and is",
951 "ans": "a",
952 "opt": {
953 "a": " set",
954 "b": " setq",
955 "c": " add",
956 "d": " eva"
957 }
958 },
959 {
960 "name": "Question 87",
961 "desc": "Which type of actuator generates a good deal of power but tends to be messy?",
962 "ans": "b",
963 "opt": {
964 "a": " electric",
965 "b": " hydraulic",
966 "c": " pneumatic",
967 "d": " both hydraulic & pneumatic"
968 }
969 },
970 {
971 "name": "Question 88",
972 "desc": "Research scientists all over the world are taking steps towards building computers with circuits patterned after the complex interconnections existing among the human brain�s nerve cellsWhat name is given to such type of computers?",
973 "ans": "c",
974 "opt": {
975 "a": " Intelligent computers",
976 "b": " Supercomputers",
977 "c": " Neural network computers",
978 "d": " Smart computers"
979 }
980 },
981 {
982 "name": "Question 89",
983 "desc": "The integrated circuit was invented by Jack Kilby of:",
984 "ans": "b",
985 "opt": {
986 "a": " MIT",
987 "b": " Texas Instruments",
988 "c": " Xerox",
989 "d": " All of the mentioned"
990 }
991 },
992 {
993 "name": "Question 90",
994 "desc": "People overcome natural language problems by:",
995 "ans": "d",
996 "opt": {
997 "a": " grouping attributes into frames",
998 "b": " understanding ideas in context",
999 "c": " identifying with familiar situations",
1000 "d": " both understanding ideas in context & identifying with familiar situations"
1001 }
1002 },
1003 {
1004 "name": "Question 91",
1005 "desc": "The Cedar, BBN Butterfly, Cosmic Cube and Hypercube machine can be characterized as",
1006 "ans": "b",
1007 "opt": {
1008 "a": " SISD",
1009 "b": " MIMD",
1010 "c": " SIMD",
1011 "d": " MISD"
1012 }
1013 },
1014 {
1015 "name": "Question 92",
1016 "desc": "A series of AI systems, developed by Pat Langley to explore the role of heuristics in scientific discovery is ________",
1017 "ans": "b",
1018 "opt": {
1019 "a": " RAMD",
1020 "b": " BACON",
1021 "c": " MIT",
1022 "d": " DU"
1023 }
1024 },
1025 {
1026 "name": "Question 93",
1027 "desc": "Nils Nilsson headed a team at SRI that created a mobile robot named:",
1028 "ans": "c",
1029 "opt": {
1030 "a": " Robotics",
1031 "b": " Dedalus",
1032 "c": " Shakey",
1033 "d": " Vax"
1034 }
1035 },
1036 {
1037 "name": "Question 94",
1038 "desc": "An Artificial Intelligence technique that allows computers to understand associations and relationships between objects and events is called:",
1039 "ans": "c",
1040 "opt": {
1041 "a": " heuristic processing",
1042 "b": " cognitive science",
1043 "c": " relative symbolism",
1044 "d": " pattern matching"
1045 }
1046 },
1047 {
1048 "name": "Question 95",
1049 "desc": "The new organization established to implement the Fifth Generation Project is called:",
1050 "ans": "a",
1051 "opt": {
1052 "a": " ICOT (Institute for New Generation Computer Technology)",
1053 "b": " MITI (Ministry of International Trade and Industry)",
1054 "c": " MCC (Microelectronics and Computer Technology Corporation)",
1055 "d": " SCP (Strategic Computing Program)"
1056 }
1057 },
1058 {
1059 "name": "Question 96",
1060 "desc": "The field that investigates the mechanics of human intelligence is:",
1061 "ans": "b",
1062 "opt": {
1063 "a": " history",
1064 "b": " cognitive science",
1065 "c": " psychology",
1066 "d": " sociology"
1067 }
1068 },
1069 {
1070 "name": "Question 97",
1071 "desc": "What is the name of the computer program that simulates the thought processes of human beings?",
1072 "ans": "c",
1073 "opt": {
1074 "a": " Human logic",
1075 "b": " Expert reason",
1076 "c": " Expert system",
1077 "d": " Personal information"
1078 }
1079 },
1080 {
1081 "name": "Question 98",
1082 "desc": "What is the name of the computer program that contains the distilled knowledge of an expert?",
1083 "ans": "c",
1084 "opt": {
1085 "a": " Database management system",
1086 "b": " Management information System",
1087 "c": " Expert system",
1088 "d": " Artificial intelligence"
1089 }
1090 },
1091 {
1092 "name": "Question 99",
1093 "desc": "Claude Shannon described the operation of electronic switching circuits with a system of mathematical logic called:",
1094 "ans": "c",
1095 "opt": {
1096 "a": " LISP",
1097 "b": " XLISP",
1098 "c": " Neural networking",
1099 "d": " Boolean algebra"
1100 }
1101 },
1102 {
1103 "name": "Question 100",
1104 "desc": "A computer program that contains expertise in a particular domain is called an:",
1105 "ans": "c",
1106 "opt": {
1107 "a": " intelligent planner",
1108 "b": " automatic processor",
1109 "c": " expert system",
1110 "d": " operational symbolizer"
1111 }
1112 },
1113 {
1114 "name": "Question 101",
1115 "desc": "What is the term used for describing the judgmental or commonsense part of problem solving?",
1116 "ans": "a",
1117 "opt": {
1118 "a": " Heuristic",
1119 "b": " Critical",
1120 "c": " Value based",
1121 "d": " Analytical"
1122 }
1123 },
1124 {
1125 "name": "Question 102",
1126 "desc": "What was originally called the �imitation game� by its creator?",
1127 "ans": "a",
1128 "opt": {
1129 "a": " The Turing Test",
1130 "b": " LISP",
1131 "c": " The Logic Theorist",
1132 "d": " Cybernetics"
1133 }
1134 },
1135 {
1136 "name": "Question 103",
1137 "desc": "Decision support programs are designed to help managers make:",
1138 "ans": "c",
1139 "opt": {
1140 "a": " budget projections",
1141 "b": " visual presentations",
1142 "c": " business decisions",
1143 "d": " vacation schedules"
1144 }
1145 },
1146 {
1147 "name": "Question 104",
1148 "desc": "Programming a robot by physically moving it through the trajectory you want it to follow is called:",
1149 "ans": "b",
1150 "opt": {
1151 "a": " contact sensing control",
1152 "b": " continuous-path control",
1153 "c": " robot vision control",
1154 "d": " pick-and-place control"
1155 }
1156 },
1157 {
1158 "name": "Question 105",
1159 "desc": "The primary interactive method of communication used by humans is:",
1160 "ans": "c",
1161 "opt": {
1162 "a": " reading",
1163 "b": " writing",
1164 "c": " speaking",
1165 "d": " all of the mentioned"
1166 }
1167 },
1168 {
1169 "name": "Question 106",
1170 "desc": "Elementary linguistic units which are smaller than words are:",
1171 "ans": "d",
1172 "opt": {
1173 "a": " allophones",
1174 "b": " phonemes",
1175 "c": " syllables",
1176 "d": " all of the mentioned"
1177 }
1178 },
1179 {
1180 "name": "Question 107",
1181 "desc": "In LISP, the atom that stands for �true� is",
1182 "ans": "a",
1183 "opt": {
1184 "a": " t",
1185 "b": " ml",
1186 "c": " y",
1187 "d": " time"
1188 }
1189 },
1190 {
1191 "name": "Question 108",
1192 "desc": "A mouse device may be:",
1193 "ans": "d",
1194 "opt": {
1195 "a": " electro-chemical",
1196 "b": " mechanical",
1197 "c": " optical",
1198 "d": " both mechanical and optical"
1199 }
1200 },
1201 {
1202 "name": "Question 109",
1203 "desc": "An expert system differs from a database program in that only an expert system:",
1204 "ans": "b",
1205 "opt": {
1206 "a": " contains declarative knowledge",
1207 "b": " contains procedural knowledge",
1208 "c": " features the retrieval of stored information",
1209 "d": " expects users to draw their own conclusions"
1210 }
1211 },
1212 {
1213 "name": "Question 110",
1214 "desc": "Arthur Samuel is linked inextricably with a program that played:",
1215 "ans": "a",
1216 "opt": {
1217 "a": " checkers",
1218 "b": " chess",
1219 "c": " cricket",
1220 "d": " football"
1221 }
1222 },
1223 {
1224 "name": "Question 111",
1225 "desc": "Natural language understanding is used in:",
1226 "ans": "d",
1227 "opt": {
1228 "a": " natural language interfaces",
1229 "b": " natural language front ends",
1230 "c": " text understanding systems",
1231 "d": " all of the mentioned"
1232 }
1233 },
1234 {
1235 "name": "Question 112",
1236 "desc": "Which of the following are examples of software development tools?",
1237 "ans": "d",
1238 "opt": {
1239 "a": " debuggers",
1240 "b": " editors",
1241 "c": " assemblers, compilers and interpreters",
1242 "d": " all of the mentioned"
1243 }
1244 },
1245 {
1246 "name": "Question 113",
1247 "desc": "The first AI programming language was called:",
1248 "ans": "d",
1249 "opt": {
1250 "a": " BASIC",
1251 "b": " FORTRAN",
1252 "c": " IPL(Inductive logic programming)",
1253 "d": " LISP"
1254 }
1255 },
1256 {
1257 "name": "Question 114",
1258 "desc": "The Personal Consultant is based on:",
1259 "ans": "d",
1260 "opt": {
1261 "a": " EMYCIN",
1262 "b": " OPS5+",
1263 "c": " XCON",
1264 "d": " All of the mentioned"
1265 }
1266 },
1267 {
1268 "name": "Question 115",
1269 "desc": "Machine learning is",
1270 "ans": "a",
1271 "opt": {
1272 "a": " The autonomous acquisition of knowledge through the use of computer programs",
1273 "b": " The autonomous acquisition of knowledge through the use of manual programs",
1274 "c": " The selective acquisition of knowledge through the use of computer programs",
1275 "d": " The selective acquisition of knowledge through the use of manual programs"
1276 }
1277 },
1278 {
1279 "name": "Question 116",
1280 "desc": "Factors which affect the performance of learner system does not include",
1281 "ans": "d",
1282 "opt": {
1283 "a": " Representation scheme used",
1284 "b": " Training scenario",
1285 "c": " Type of feedback",
1286 "d": " Good data structures"
1287 }
1288 },
1289 {
1290 "name": "Question 117",
1291 "desc": "Different learning methods does not include",
1292 "ans": "d",
1293 "opt": {
1294 "a": " Memorization",
1295 "b": " Analogy",
1296 "c": " Deduction",
1297 "d": " Introduction"
1298 }
1299 },
1300 {
1301 "name": "Question 118",
1302 "desc": "In language understanding, the levels of knowledge that does not include",
1303 "ans": "c",
1304 "opt": {
1305 "a": " Phonological",
1306 "b": " Syntactic",
1307 "c": " Empirical",
1308 "d": " Logical"
1309 }
1310 },
1311 {
1312 "name": "Question 119",
1313 "desc": "A model of language consists of the categories which does not include",
1314 "ans": "d",
1315 "opt": {
1316 "a": " Language units",
1317 "b": " Role structure of units",
1318 "c": " System constraints",
1319 "d": " Structural units"
1320 }
1321 },
1322 {
1323 "name": "Question 120",
1324 "desc": "What is a top-down parser?",
1325 "ans": "a",
1326 "opt": {
1327 "a": " Begins by hypothesizing a sentence (the symbol S) and successively predicting lower level constituents until individual preterminal symbols are written",
1328 "b": " Begins by hypothesizing a sentence (the symbol S) and successively predicting upper level constituents until individual preterminal symbols are written",
1329 "c": " Begins by hypothesizing lower level constituents and successively predicting a sentence (the symbol S)",
1330 "d": " Begins by hypothesizing upper level constituents and successively predicting a sentence (the symbol S)"
1331 }
1332 },
1333 {
1334 "name": "Question 121",
1335 "desc": "Among the following which is not a horn clause?",
1336 "ans": "d",
1337 "opt": {
1338 "a": " p",
1339 "b": " �p V q",
1340 "c": " p _ q",
1341 "d": " p _ �q"
1342 }
1343 },
1344 {
1345 "name": "Question 122",
1346 "desc": "The action �STACK(A, B)� of a robot arm specify to",
1347 "ans": "d",
1348 "opt": {
1349 "a": " Place block B on Block A",
1350 "b": " Place blocks A, B on the table in that order",
1351 "c": " Place blocks B, A on the table in that order",
1352 "d": " Place block A on block B"
1353 }
1354 },
1355 {
1356 "name": "Question 123",
1357 "desc": "Which instruments are used for perceiving and acting upon the environment?",
1358 "ans": "a",
1359 "opt": {
1360 "a": " Sensors and Actuators",
1361 "b": " Sensors",
1362 "c": " Perceiver",
1363 "d": " None of the mentioned"
1364 }
1365 },
1366 {
1367 "name": "Question 124",
1368 "desc": "What is meant by agent�s percept sequence?",
1369 "ans": "c",
1370 "opt": {
1371 "a": " Used to perceive the environment",
1372 "b": " Complete history of actuator",
1373 "c": " Complete history of perceived things",
1374 "d": " None of the mentioned"
1375 }
1376 },
1377 {
1378 "name": "Question 125",
1379 "desc": "How many types of agents are there in artificial intelligence?",
1380 "ans": "d",
1381 "opt": {
1382 "a": " 1",
1383 "b": " 2",
1384 "c": " 3",
1385 "d": " 4"
1386 }
1387 },
1388 {
1389 "name": "Question 126",
1390 "desc": "What is the rule of simple reflex agent?",
1391 "ans": "b",
1392 "opt": {
1393 "a": " Simple-action rule",
1394 "b": " Condition-action rule",
1395 "c": " Simple & Condition-action rule",
1396 "d": " None of the mentioned"
1397 }
1398 },
1399 {
1400 "name": "Question 127",
1401 "desc": "What are the composition for agents in artificial intelligence?",
1402 "ans": "c",
1403 "opt": {
1404 "a": " Program",
1405 "b": " Architecture",
1406 "c": " Both Program & Architecture",
1407 "d": " None of the mentioned"
1408 }
1409 },
1410 {
1411 "name": "Question 128",
1412 "desc": "In which agent does the problem generator is present?",
1413 "ans": "a",
1414 "opt": {
1415 "a": " Learning agent",
1416 "b": " Observing agent",
1417 "c": " Reflex agent",
1418 "d": " None of the mentioned"
1419 }
1420 },
1421 {
1422 "name": "Question 129",
1423 "desc": "Which is used to improve the agents performance?",
1424 "ans": "b",
1425 "opt": {
1426 "a": " Perceiving",
1427 "b": " Learning",
1428 "c": " Observing",
1429 "d": " None of the mentioned"
1430 }
1431 },
1432 {
1433 "name": "Question 130",
1434 "desc": "Which agent deals with happy and unhappy states?",
1435 "ans": "d",
1436 "opt": {
1437 "a": " Simple reflex agent",
1438 "b": " Model based agent",
1439 "c": " Learning agent",
1440 "d": " Utility based agent"
1441 }
1442 },
1443 {
1444 "name": "Question 131",
1445 "desc": "Which action sequences are used to achieve the agent�s goal?",
1446 "ans": "d",
1447 "opt": {
1448 "a": " Search",
1449 "b": " Plan",
1450 "c": " Retrieve",
1451 "d": " Both Search & Plan"
1452 }
1453 },
1454 {
1455 "name": "Question 132",
1456 "desc": "Which element in agent are used for selecting external actions?",
1457 "ans": "b",
1458 "opt": {
1459 "a": " Perceive",
1460 "b": " Performance",
1461 "c": " Learning",
1462 "d": " Actuator"
1463 }
1464 },
1465 {
1466 "name": "Question 133",
1467 "desc": "What is Artificial intelligence?",
1468 "ans": "c",
1469 "opt": {
1470 "a": " Putting your intelligence into Computer",
1471 "b": " Programming with your own intelligence",
1472 "c": " Making a Machine intelligent",
1473 "d": " Playing a Game"
1474 }
1475 },
1476 {
1477 "name": "Question 134",
1478 "desc": "Which is not the commonly used programming language for AI?",
1479 "ans": "d",
1480 "opt": {
1481 "a": " PROLOG",
1482 "b": " Java",
1483 "c": " LISP",
1484 "d": " Perl"
1485 }
1486 },
1487 {
1488 "name": "Question 135",
1489 "desc": "Artificial Intelligence has its expansion in the following application(Mark all that apply)",
1490 "ans": "d",
1491 "opt": {
1492 "a": " Planning and Scheduling",
1493 "b": " Game Playing",
1494 "c": " Diagnosis",
1495 "d": " All of the mentioned"
1496 }
1497 },
1498 {
1499 "name": "Question 136",
1500 "desc": "An �agent� is anything that,",
1501 "ans": "d",
1502 "opt": {
1503 "a": " Perceives its environment through sensors and acting upon that environment through actuators",
1504 "b": " Takes input from the surroundings and uses its intelligence and performs the desired operations",
1505 "c": " A embedded program controlling line following robot",
1506 "d": " All of the mentioned"
1507 }
1508 },
1509 {
1510 "name": "Question 137",
1511 "desc": "Agents behavior can be best described by",
1512 "ans": "b",
1513 "opt": {
1514 "a": " Perception sequence",
1515 "b": " Agent function",
1516 "c": " Sensors and Actuators",
1517 "d": " Environment in which agent is performing"
1518 }
1519 },
1520 {
1521 "name": "Question 138",
1522 "desc": "Rational agent is the one who always does the right thingState true or false\ra) True\rb) False\rView Answer",
1523 "ans": "a",
1524 "opt": {
1525 "a": "",
1526 "b": "",
1527 "c": "",
1528 "d": ""
1529 }
1530 },
1531 {
1532 "name": "Question 139",
1533 "desc": "Performance Measures are fixed for all agentsState true or false\ra) True\rb) False\rView Answer",
1534 "ans": "a",
1535 "opt": {
1536 "a": "",
1537 "b": "",
1538 "c": "",
1539 "d": ""
1540 }
1541 },
1542 {
1543 "name": "Question 140",
1544 "desc": "What is rational at any given time depends on",
1545 "ans": "d",
1546 "opt": {
1547 "a": " The performance measure that defines the criterion of success",
1548 "b": " The agent�s prior knowledge of the environment",
1549 "c": " The actions that the agent can perform",
1550 "d": " All of the mentioned"
1551 }
1552 },
1553 {
1554 "name": "Question 141",
1555 "desc": "An omniscient agent knows the actual outcome of its actions and can act accordingly; but omniscience is impossible in realityRational Agent always does the right thing; but Rationality is possible in realityState true or false\ra) True\rb) False\rView Answer",
1556 "ans": "a",
1557 "opt": {
1558 "a": "",
1559 "b": "",
1560 "c": "",
1561 "d": ""
1562 }
1563 },
1564 {
1565 "name": "Question 142",
1566 "desc": "The Task Environment of an agent consists of",
1567 "ans": "d",
1568 "opt": {
1569 "a": " Sensors",
1570 "b": " Actuators",
1571 "c": " Performance Measures",
1572 "d": " All of the mentioned"
1573 }
1574 },
1575 {
1576 "name": "Question 143",
1577 "desc": "What could possibly be the environment of a Satellite Image Analysis System?",
1578 "ans": "d",
1579 "opt": {
1580 "a": " Computers in space and earth",
1581 "b": " Image categorization techniques",
1582 "c": " Statistical data on image pixel intensity value and histograms",
1583 "d": " All of the mentioned"
1584 }
1585 },
1586 {
1587 "name": "Question 144",
1588 "desc": "Categorize Crossword puzzle in Fully Observable / Partially Observable.",
1589 "ans": "a",
1590 "opt": {
1591 "a": " Fully Observable",
1592 "b": " partially Observable",
1593 "c": " All of the mentioned",
1594 "d": " None of the mentioned"
1595 }
1596 },
1597 {
1598 "name": "Question 145",
1599 "desc": "The game of Poker is a single agent.\ra) True\rb) False\rView Answer",
1600 "ans": "b",
1601 "opt": {
1602 "a": "",
1603 "b": "",
1604 "c": "",
1605 "d": ""
1606 }
1607 },
1608 {
1609 "name": "Question 146",
1610 "desc": "Satellite Image Analysis System is (Choose the one that is not applicable).",
1611 "ans": "d",
1612 "opt": {
1613 "a": " Episodic",
1614 "b": " Semi-Static",
1615 "c": " Single agent",
1616 "d": " Partially Observable"
1617 }
1618 },
1619 {
1620 "name": "Question 147",
1621 "desc": "An agent is composed of ________",
1622 "ans": "d",
1623 "opt": {
1624 "a": " Architecture",
1625 "b": " Agent Function",
1626 "c": " Perception Sequence",
1627 "d": " Architecture and Program"
1628 }
1629 },
1630 {
1631 "name": "Question 148",
1632 "desc": "Which search agent operates by interleaving computation and action?",
1633 "ans": "b",
1634 "opt": {
1635 "a": " Offline search",
1636 "b": " Online search",
1637 "c": " Breadth-first search",
1638 "d": " Depth-first search"
1639 }
1640 },
1641 {
1642 "name": "Question 149",
1643 "desc": "What is called as exploration problem?",
1644 "ans": "a",
1645 "opt": {
1646 "a": " State and actions are unknown to the agent",
1647 "b": " State and actions are known to the agent",
1648 "c": " Only actions are known to agent",
1649 "d": " None of the mentioned"
1650 }
1651 },
1652 {
1653 "name": "Question 150",
1654 "desc": "Which are necessary for an agent to solve an online search problem?",
1655 "ans": "d",
1656 "opt": {
1657 "a": " Actions",
1658 "b": " Step-cost function",
1659 "c": " Goal-test",
1660 "d": " All of the mentioned"
1661 }
1662 },
1663 {
1664 "name": "Question 151",
1665 "desc": "When do we call the states are safely explorable?",
1666 "ans": "c",
1667 "opt": {
1668 "a": " A goal state is unreachable from any state",
1669 "b": " A goal state is denied access",
1670 "c": " A goal state is reachable from every state",
1671 "d": " None of the mentioned"
1672 }
1673 },
1674 {
1675 "name": "Question 152",
1676 "desc": "In which state spaces does the online-dfs-agent will work?",
1677 "ans": "b",
1678 "opt": {
1679 "a": " Irreversible state spaces",
1680 "b": " Reversible state spaces",
1681 "c": " searchable state spaces",
1682 "d": " All of the mentioned"
1683 }
1684 },
1685 {
1686 "name": "Question 153",
1687 "desc": "Which of the following algorithm is online search algorithm?",
1688 "ans": "c",
1689 "opt": {
1690 "a": " Breadth-first search algorithm",
1691 "b": " Depth-first search algorithm",
1692 "c": " Hill-climbing search algorithm",
1693 "d": " None of the mentioned"
1694 }
1695 },
1696 {
1697 "name": "Question 154",
1698 "desc": "Which search algorithm will use limited amount of memory?",
1699 "ans": "d",
1700 "opt": {
1701 "a": " RBFS",
1702 "b": " SMA*",
1703 "c": " Hill-climbing search algorithm",
1704 "d": " Both RBFS & SMA*"
1705 }
1706 },
1707 {
1708 "name": "Question 155",
1709 "desc": "What is meant by simulated annealing in artificial intelligence?",
1710 "ans": "a",
1711 "opt": {
1712 "a": " Returns an optimal solution when there is a proper cooling schedule",
1713 "b": " Returns an optimal solution when there is no proper cooling schedule",
1714 "c": " It will not return an optimal solution when there is a proper cooling schedule",
1715 "d": " None of the mentioned"
1716 }
1717 },
1718 {
1719 "name": "Question 156",
1720 "desc": "How the new states are generated in genetic algorithm?",
1721 "ans": "d",
1722 "opt": {
1723 "a": " Composition",
1724 "b": " Mutation",
1725 "c": " Cross-over",
1726 "d": " Both Mutation & Cross-over"
1727 }
1728 },
1729 {
1730 "name": "Question 157",
1731 "desc": "Which method is effective for escaping from local minima?",
1732 "ans": "a",
1733 "opt": {
1734 "a": " Updating heuristic estimate",
1735 "b": " Reducing heuristic estimate",
1736 "c": " Eliminating heuristic estimate",
1737 "d": " None of the mentioned"
1738 }
1739 },
1740 {
1741 "name": "Question 158",
1742 "desc": "Which depends on the percepts and actions available to the agent?",
1743 "ans": "c",
1744 "opt": {
1745 "a": " Agent",
1746 "b": " Sensor",
1747 "c": " Design problem",
1748 "d": " None of the mentioned"
1749 }
1750 },
1751 {
1752 "name": "Question 159",
1753 "desc": "Which were built in such a way that humans had to supply the inputs and interpret the outputs?",
1754 "ans": "b",
1755 "opt": {
1756 "a": " Agents",
1757 "b": " AI system",
1758 "c": " Sensor",
1759 "d": " Actuators"
1760 }
1761 },
1762 {
1763 "name": "Question 160",
1764 "desc": "Which technology uses miniaturized accelerometers and gyroscopes?",
1765 "ans": "c",
1766 "opt": {
1767 "a": " Sensors",
1768 "b": " Actuators",
1769 "c": " MEMS",
1770 "d": " None of the mentioned"
1771 }
1772 },
1773 {
1774 "name": "Question 161",
1775 "desc": "What is used for tracking uncertain events?",
1776 "ans": "a",
1777 "opt": {
1778 "a": " Filtering algorithm",
1779 "b": " Sensors",
1780 "c": " Actuators",
1781 "d": " None of the mentioned"
1782 }
1783 },
1784 {
1785 "name": "Question 162",
1786 "desc": "What is not represented by using propositional logic?",
1787 "ans": "c",
1788 "opt": {
1789 "a": " Objects",
1790 "b": " Relations",
1791 "c": " Both Objects & Relations",
1792 "d": " None of the mentioned"
1793 }
1794 },
1795 {
1796 "name": "Question 163",
1797 "desc": "Which functions are used as preferences over state history?",
1798 "ans": "b",
1799 "opt": {
1800 "a": " Award",
1801 "b": " Reward",
1802 "c": " Explicit",
1803 "d": " Implicit"
1804 }
1805 },
1806 {
1807 "name": "Question 164",
1808 "desc": "Which kind of agent architecture should an agent an use?",
1809 "ans": "d",
1810 "opt": {
1811 "a": " Relaxed",
1812 "b": " Logic",
1813 "c": " Relational",
1814 "d": " All of the mentioned"
1815 }
1816 },
1817 {
1818 "name": "Question 165",
1819 "desc": "Specify the agent architecture name that is used to capture all kinds of actions.",
1820 "ans": "c",
1821 "opt": {
1822 "a": " Complex",
1823 "b": " Relational",
1824 "c": " Hybrid",
1825 "d": " None of the mentioned"
1826 }
1827 },
1828 {
1829 "name": "Question 166",
1830 "desc": "Which agent enables the deliberation about the computational entities and actions?",
1831 "ans": "b",
1832 "opt": {
1833 "a": " Hybrid",
1834 "b": " Reflective",
1835 "c": " Relational",
1836 "d": " None of the mentioned"
1837 }
1838 },
1839 {
1840 "name": "Question 167",
1841 "desc": "What can operate over the joint state space?",
1842 "ans": "d",
1843 "opt": {
1844 "a": " Decision-making algorithm",
1845 "b": " Learning algorithm",
1846 "c": " Complex algorithm",
1847 "d": " Both Decision-making & Learning algorithm"
1848 }
1849 },
1850 {
1851 "name": "Question 168",
1852 "desc": "What is the action of task environment in artificial intelligence?",
1853 "ans": "a",
1854 "opt": {
1855 "a": " Problem",
1856 "b": " Solution",
1857 "c": " Agent",
1858 "d": " Observation"
1859 }
1860 },
1861 {
1862 "name": "Question 169",
1863 "desc": "What is the expansion if PEAS in task environment?",
1864 "ans": "c",
1865 "opt": {
1866 "a": " Peer, Environment, Actuators, Sense",
1867 "b": " Perceiving, Environment, Actuators, Sensors",
1868 "c": " Performance, Environment, Actuators, Sensors",
1869 "d": " None of the mentioned"
1870 }
1871 },
1872 {
1873 "name": "Question 170",
1874 "desc": "What kind of observing environments are present in artificial intelligence?",
1875 "ans": "d",
1876 "opt": {
1877 "a": " Partial",
1878 "b": " Fully",
1879 "c": " Learning",
1880 "d": " Both Partial & Fully"
1881 }
1882 },
1883 {
1884 "name": "Question 171",
1885 "desc": "What kind of environment is strategic in artificial intelligence?",
1886 "ans": "a",
1887 "opt": {
1888 "a": " Deterministic",
1889 "b": " Rational",
1890 "c": " Partial",
1891 "d": " Stochastic"
1892 }
1893 },
1894 {
1895 "name": "Question 172",
1896 "desc": "What kind of environment is crossword puzzle?",
1897 "ans": "a",
1898 "opt": {
1899 "a": " Static",
1900 "b": " Dynamic",
1901 "c": " Semi Dynamic",
1902 "d": " None of the mentioned"
1903 }
1904 },
1905 {
1906 "name": "Question 173",
1907 "desc": "What kind of behavior does the stochastic environment posses?",
1908 "ans": "a",
1909 "opt": {
1910 "a": " Local",
1911 "b": " Deterministic",
1912 "c": " Rational",
1913 "d": " Primary"
1914 }
1915 },
1916 {
1917 "name": "Question 174",
1918 "desc": "",
1919 "ans": "b",
1920 "opt": {
1921 "a": " Environment creator",
1922 "b": " Environment Generator",
1923 "c": " Both Environment creator & Generator",
1924 "d": " None of the mentioned"
1925 }
1926 },
1927 {
1928 "name": "Question 175",
1929 "desc": "Which environment is called as semi dynamic?",
1930 "ans": "d",
1931 "opt": {
1932 "a": " Environment does not change with the passage of time",
1933 "b": " Agent performance changes",
1934 "c": " Environment will be changed",
1935 "d": " Environment does not change with the passage of time, but Agent performance changes"
1936 }
1937 },
1938 {
1939 "name": "Question 176",
1940 "desc": "Where does the performance measure is included?",
1941 "ans": "b",
1942 "opt": {
1943 "a": " Rational agent",
1944 "b": " Task environment",
1945 "c": " Actuators",
1946 "d": " Sensor"
1947 }
1948 },
1949 {
1950 "name": "Question 177",
1951 "desc": "Which is used to provide the feedback to the learning element?",
1952 "ans": "a",
1953 "opt": {
1954 "a": " Critic",
1955 "b": " Actuators",
1956 "c": " Sensor",
1957 "d": " None of the mentioned"
1958 }
1959 },
1960 {
1961 "name": "Question 178",
1962 "desc": "The main task of a problem-solving agent is",
1963 "ans": "c",
1964 "opt": {
1965 "a": " Solve the given problem and reach to goal",
1966 "b": " To find out which sequence of action will get it to the goal state",
1967 "c": " All of the mentioned",
1968 "d": " None of the mentioned"
1969 }
1970 },
1971 {
1972 "name": "Question 179",
1973 "desc": "What is state space?",
1974 "ans": "d",
1975 "opt": {
1976 "a": " The whole problem",
1977 "b": " Your Definition to a problem",
1978 "c": " Problem you design",
1979 "d": " Representing your problem with variable and parameter"
1980 }
1981 },
1982 {
1983 "name": "Question 180",
1984 "desc": "This process of looking for such a sequence is called SearchState True or False\ra) True\rb) False\rView Answer",
1985 "ans": "a",
1986 "opt": {
1987 "a": "",
1988 "b": "",
1989 "c": "",
1990 "d": ""
1991 }
1992 },
1993 {
1994 "name": "Question 181",
1995 "desc": "A search algorithm takes _________ as an input and returns ________ as an output.",
1996 "ans": "b",
1997 "opt": {
1998 "a": " Input, output",
1999 "b": " Problem, solution",
2000 "c": " Solution, problem",
2001 "d": " Parameters, sequence of actions"
2002 }
2003 },
2004 {
2005 "name": "Question 182",
2006 "desc": "A problem in a search space is defined by one of these state.",
2007 "ans": "a",
2008 "opt": {
2009 "a": " Initial state",
2010 "b": " Last state",
2011 "c": " Intermediate state",
2012 "d": " All of the above"
2013 }
2014 },
2015 {
2016 "name": "Question 183",
2017 "desc": "The Set of actions for a problem in a state space is formulated by a ___________",
2018 "ans": "c",
2019 "opt": {
2020 "a": " Intermediate states",
2021 "b": " Initial state",
2022 "c": " Successor function, which takes current action and returns next immediate state",
2023 "d": " None of the mentioned"
2024 }
2025 },
2026 {
2027 "name": "Question 184",
2028 "desc": "A solution to a problem is a path from the initial state to a goal stateSolution quality is measured by the path cost function, and an optimal solution has the highest path cost among all solutionsState whether true or false.\ra) True\rb) False\rView Answer",
2029 "ans": "a",
2030 "opt": {
2031 "a": "",
2032 "b": "",
2033 "c": "",
2034 "d": ""
2035 }
2036 },
2037 {
2038 "name": "Question 185",
2039 "desc": "The process of removing detail from a given state representation is called______",
2040 "ans": "b",
2041 "opt": {
2042 "a": " Extraction",
2043 "b": " Abstraction",
2044 "c": " Information Retrieval",
2045 "d": " Mining of data"
2046 }
2047 },
2048 {
2049 "name": "Question 186",
2050 "desc": "A problem solving approach works well for",
2051 "ans": "d",
2052 "opt": {
2053 "a": " 8-Puzzle problem",
2054 "b": " 8-queen problem",
2055 "c": " Finding a optimal path from a given source to a destination",
2056 "d": " Mars Hover (Robot Navigation)"
2057 }
2058 },
2059 {
2060 "name": "Question 187",
2061 "desc": "The _______ is a touring problem in which each city must be visited exactly onceThe aim is to find the shortest tour.",
2062 "ans": "b",
2063 "opt": {
2064 "a": " Finding shortest path between a source and a destination",
2065 "b": " Travelling Salesman problem",
2066 "c": " Map coloring problem",
2067 "d": " Depth first search traversal on a given map represented as a graph"
2068 }
2069 },
2070 {
2071 "name": "Question 188",
2072 "desc": "Web Crawler is a/an",
2073 "ans": "a",
2074 "opt": {
2075 "a": " Intelligent goal-based agent",
2076 "b": " Problem-solving agent",
2077 "c": " Simple reflex agent",
2078 "d": " Model based agent"
2079 }
2080 },
2081 {
2082 "name": "Question 189",
2083 "desc": "The major component/components for measuring the performance of problem solving",
2084 "ans": "d",
2085 "opt": {
2086 "a": " Completeness",
2087 "b": " Optimality",
2088 "c": " Time and Space complexity",
2089 "d": " All of the mentioned"
2090 }
2091 },
2092 {
2093 "name": "Question 190",
2094 "desc": "A production rule consists of",
2095 "ans": "c",
2096 "opt": {
2097 "a": " A set of Rule",
2098 "b": " A sequence of steps",
2099 "c": " Set of Rule & sequence of steps",
2100 "d": " Arbitrary representation to problem"
2101 }
2102 },
2103 {
2104 "name": "Question 191",
2105 "desc": "Which search method takes less memory?",
2106 "ans": "a",
2107 "opt": {
2108 "a": " Depth-First Search",
2109 "b": " Breadth-First search",
2110 "c": " Linear Search",
2111 "d": " Optimal search"
2112 }
2113 },
2114 {
2115 "name": "Question 192",
2116 "desc": "Which is the best way to go for Game playing problem?",
2117 "ans": "b",
2118 "opt": {
2119 "a": " Linear approach",
2120 "b": " Heuristic approach (Some knowledge is stored)",
2121 "c": " Random approach",
2122 "d": " An Optimal approach"
2123 }
2124 },
2125 {
2126 "name": "Question 193",
2127 "desc": "Which search strategy is also called as blind search?",
2128 "ans": "a",
2129 "opt": {
2130 "a": " Uninformed search",
2131 "b": " Informed search",
2132 "c": " Simple reflex search",
2133 "d": " All of the mentioned"
2134 }
2135 },
2136 {
2137 "name": "Question 194",
2138 "desc": "How many types are available in uninformed search method?",
2139 "ans": "c",
2140 "opt": {
2141 "a": " 3",
2142 "b": " 4",
2143 "c": " 5",
2144 "d": " 6"
2145 }
2146 },
2147 {
2148 "name": "Question 195",
2149 "desc": "Which search is implemented with an empty first-in-first-out queue?",
2150 "ans": "b",
2151 "opt": {
2152 "a": " Depth-first search",
2153 "b": " Breadth-first search",
2154 "c": " Bidirectional search",
2155 "d": " None of the mentioned"
2156 }
2157 },
2158 {
2159 "name": "Question 196",
2160 "desc": "When is breadth-first search is optimal?",
2161 "ans": "b",
2162 "opt": {
2163 "a": " When there is less number of nodes",
2164 "b": " When all step costs are equal",
2165 "c": " When all step costs are unequal",
2166 "d": " None of the mentioned"
2167 }
2168 },
2169 {
2170 "name": "Question 197",
2171 "desc": "How many successors are generated in backtracking search?",
2172 "ans": "a",
2173 "opt": {
2174 "a": " 1",
2175 "b": " 2",
2176 "c": " 3",
2177 "d": " 4"
2178 }
2179 },
2180 {
2181 "name": "Question 198",
2182 "desc": "What is the space complexity of Depth-first search?",
2183 "ans": "d",
2184 "opt": {
2185 "a": " O(b)",
2186 "b": " O(bl)",
2187 "c": " O(m)",
2188 "d": " O(bm)"
2189 }
2190 },
2191 {
2192 "name": "Question 199",
2193 "desc": "How many parts does a problem consists of?",
2194 "ans": "d",
2195 "opt": {
2196 "a": " 1",
2197 "b": " 2",
2198 "c": " 3",
2199 "d": " 4"
2200 }
2201 },
2202 {
2203 "name": "Question 200",
2204 "desc": "Which algorithm is used to solve any kind of problem?",
2205 "ans": "b",
2206 "opt": {
2207 "a": " Breadth-first algorithm",
2208 "b": " Tree algorithm",
2209 "c": " Bidirectional search algorithm",
2210 "d": " None of the mentioned"
2211 }
2212 },
2213 {
2214 "name": "Question 201",
2215 "desc": "Which search algorithm imposes a fixed depth limit on nodes?",
2216 "ans": "a",
2217 "opt": {
2218 "a": " Depth-limited search",
2219 "b": " Depth-first search",
2220 "c": " Iterative deepening search",
2221 "d": " Bidirectional search"
2222 }
2223 },
2224 {
2225 "name": "Question 202",
2226 "desc": "Which search implements stack operation for searching the states?",
2227 "ans": "b",
2228 "opt": {
2229 "a": " Depth-limited search",
2230 "b": " Depth-first search",
2231 "c": " Breadth-first search",
2232 "d": " None of the mentioned"
2233 }
2234 },
2235 {
2236 "name": "Question 203",
2237 "desc": "Blind searching is general term for",
2238 "ans": "b",
2239 "opt": {
2240 "a": " Informed Search",
2241 "b": " Uninformed Search",
2242 "c": " Informed & Unformed Search",
2243 "d": " Heuristic Search"
2244 }
2245 },
2246 {
2247 "name": "Question 204",
2248 "desc": "Strategies that know whether one non-goal state is �more promising� than another are called",
2249 "ans": "d",
2250 "opt": {
2251 "a": " Informed & Unformed Search",
2252 "b": " Unformed Search",
2253 "c": " Heuristic & Unformed Search",
2254 "d": " Informed & Heuristic Search"
2255 }
2256 },
2257 {
2258 "name": "Question 205",
2259 "desc": "Which of the following is/are Uninformed Search technique/techniques",
2260 "ans": "d",
2261 "opt": {
2262 "a": " Breadth First Search (BFS)",
2263 "b": " Depth First Search (DFS)",
2264 "c": " Bidirectional Search",
2265 "d": " All of the mentioned"
2266 }
2267 },
2268 {
2269 "name": "Question 206",
2270 "desc": "Which data structure conveniently used to implement BFS?",
2271 "ans": "b",
2272 "opt": {
2273 "a": " Stacks",
2274 "b": " Queues",
2275 "c": " Priority Queues",
2276 "d": " All of the mentioned"
2277 }
2278 },
2279 {
2280 "name": "Question 207",
2281 "desc": "Which data structure conveniently used to implement DFS?",
2282 "ans": "a",
2283 "opt": {
2284 "a": " Stacks",
2285 "b": " Queues",
2286 "c": " Priority Queues",
2287 "d": " All of the mentioned"
2288 }
2289 },
2290 {
2291 "name": "Question 208",
2292 "desc": "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.)",
2293 "ans": "a",
2294 "opt": {
2295 "a": " O(bd+1) and O(bd+1)",
2296 "b": " O(b2) and O(d2)",
2297 "c": " O(d2) and O(b2)",
2298 "d": " O(d2) and O(d2)"
2299 }
2300 },
2301 {
2302 "name": "Question 209",
2303 "desc": "Breadth-first search is not optimal when all step costs are equal, because it always expands the shallowest unexpanded nodeState whether true or false.\ra) True\rb) False\rView Answer",
2304 "ans": "b",
2305 "opt": {
2306 "a": "",
2307 "b": "",
2308 "c": "",
2309 "d": ""
2310 }
2311 },
2312 {
2313 "name": "Question 210",
2314 "desc": "uniform-cost search expands the node n with the__________",
2315 "ans": "a",
2316 "opt": {
2317 "a": " Lowest path cost",
2318 "b": " Heuristic cost",
2319 "c": " Highest path cost",
2320 "d": " Average path cost"
2321 }
2322 },
2323 {
2324 "name": "Question 211",
2325 "desc": "Depth-first search always expands the ______ node in the current fringe of the search tree.",
2326 "ans": "c",
2327 "opt": {
2328 "a": " Shallowest",
2329 "b": " Child node",
2330 "c": " Deepest",
2331 "d": " Minimum cost"
2332 }
2333 },
2334 {
2335 "name": "Question 212",
2336 "desc": "Breadth-first search always expands the ______ node in the current fringe of the search tree.",
2337 "ans": "a",
2338 "opt": {
2339 "a": " Shallowest",
2340 "b": " Child node",
2341 "c": " Deepest",
2342 "d": " Minimum cost"
2343 }
2344 },
2345 {
2346 "name": "Question 213",
2347 "desc": "Optimality of BFS is",
2348 "ans": "b",
2349 "opt": {
2350 "a": " When there is less number of nodes",
2351 "b": " When all step costs are equal",
2352 "c": " When all step costs are unequal",
2353 "d": " None of the mentioned"
2354 }
2355 },
2356 {
2357 "name": "Question 214",
2358 "desc": "LIFO is ______ where as FIFO is ________",
2359 "ans": "a",
2360 "opt": {
2361 "a": " Stack, Queue",
2362 "b": " Queue, Stack",
2363 "c": " Priority Queue, Stack",
2364 "d": " Stack. Priority Queue"
2365 }
2366 },
2367 {
2368 "name": "Question 215",
2369 "desc": "When the environment of an agent is partially observable in search space following problem/problems could occur.",
2370 "ans": "d",
2371 "opt": {
2372 "a": " Sensorless problems: If the agent has no sensors at all, then (as far as it knows) it could be in one of several possible initial states, and each action might therefore lead to one of several possible successor states",
2373 "b": " Contingency problems: If the environment is partially observable or if actions are uncertain, then the agent�s percepts provide new information after each action. Each possible percept defines a contingency that must be planned for. A problem is called adversarial if the uncertainty is caused by the actions of another agent",
2374 "c": " Exploration problems: When the states and actions of the environment are unknown, the agent must act to discover them. Exploration problems can be viewed as an extreme case of contingency problems",
2375 "d": " All of the mentioned"
2376 }
2377 },
2378 {
2379 "name": "Question 216",
2380 "desc": "For general graph, how one can get rid of repeated states?",
2381 "ans": "a",
2382 "opt": {
2383 "a": " By maintaining a list of visited vertices",
2384 "b": " By maintaining a list of traversed edges",
2385 "c": " By maintaining a list of non-visited vertices",
2386 "d": " By maintaining a list of non-traversed edges"
2387 }
2388 },
2389 {
2390 "name": "Question 217",
2391 "desc": "DFS is ______ efficient and BFS is __________ efficient.",
2392 "ans": "a",
2393 "opt": {
2394 "a": " Space, Time",
2395 "b": " Time, Space",
2396 "c": " Time, Time",
2397 "d": " Space, Space"
2398 }
2399 },
2400 {
2401 "name": "Question 218",
2402 "desc": "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.\ra) True\rb) False\rView Answer",
2403 "ans": "a",
2404 "opt": {
2405 "a": "",
2406 "b": "",
2407 "c": "",
2408 "d": ""
2409 }
2410 },
2411 {
2412 "name": "Question 219",
2413 "desc": "What is the other name of informed search strategy?",
2414 "ans": "b",
2415 "opt": {
2416 "a": " Simple search",
2417 "b": " Heuristic search",
2418 "c": " Online search",
2419 "d": " None of the mentioned"
2420 }
2421 },
2422 {
2423 "name": "Question 220",
2424 "desc": "How many types of informed search method are in artificial intelligence?",
2425 "ans": "d",
2426 "opt": {
2427 "a": " 1",
2428 "b": " 2",
2429 "c": " 3",
2430 "d": " 4"
2431 }
2432 },
2433 {
2434 "name": "Question 221",
2435 "desc": "Which search uses the problem specific knowledge beyond the definition of the problem?",
2436 "ans": "a",
2437 "opt": {
2438 "a": " Informed search",
2439 "b": " Depth-first search",
2440 "c": " Breadth-first search",
2441 "d": " Uninformed search"
2442 }
2443 },
2444 {
2445 "name": "Question 222",
2446 "desc": "Which function will select the lowest expansion node at first for evaluation?",
2447 "ans": "b",
2448 "opt": {
2449 "a": " Greedy best-first search",
2450 "b": " Best-first search",
2451 "c": " Depth-first search",
2452 "d": " None of the mentioned"
2453 }
2454 },
2455 {
2456 "name": "Question 223",
2457 "desc": "What is the heuristic function of greedy best-first search?",
2458 "ans": "c",
2459 "opt": {
2460 "a": " f(n) != h(n)",
2461 "b": " f(n) < h(n)",
2462 "c": " f(n) = h(n)",
2463 "d": " f(n) > h(n)"
2464 }
2465 },
2466 {
2467 "name": "Question 224",
2468 "desc": "Which search uses only the linear space for searching?",
2469 "ans": "b",
2470 "opt": {
2471 "a": " Best-first search",
2472 "b": " Recursive best-first search",
2473 "c": " Depth-first search",
2474 "d": " None of the mentioned"
2475 }
2476 },
2477 {
2478 "name": "Question 225",
2479 "desc": "Which method is used to search better by learning?",
2480 "ans": "c",
2481 "opt": {
2482 "a": " Best-first search",
2483 "b": " Depth-first search",
2484 "c": " Metalevel state space",
2485 "d": " None of the mentioned"
2486 }
2487 },
2488 {
2489 "name": "Question 226",
2490 "desc": "Which search is complete and optimal when h(n) is consistent?",
2491 "ans": "d",
2492 "opt": {
2493 "a": " Best-first search",
2494 "b": " Depth-first search",
2495 "c": " Both Best-first & Depth-first search",
2496 "d": " A* search"
2497 }
2498 },
2499 {
2500 "name": "Question 227",
2501 "desc": "Which is used to improve the performance of heuristic search?",
2502 "ans": "b",
2503 "opt": {
2504 "a": " Quality of nodes",
2505 "b": " Quality of heuristic function",
2506 "c": " Simple form of nodes",
2507 "d": " None of the mentioned"
2508 }
2509 },
2510 {
2511 "name": "Question 228",
2512 "desc": "Which search method will expand the node that is closest to the goal?",
2513 "ans": "b",
2514 "opt": {
2515 "a": " Best-first search",
2516 "b": " Greedy best-first search",
2517 "c": " A* search",
2518 "d": " None of the mentioned"
2519 }
2520 },
2521 {
2522 "name": "Question 229",
2523 "desc": "A heuristic is a way of trying",
2524 "ans": "d",
2525 "opt": {
2526 "a": " To discover something or an idea embedded in a program",
2527 "b": " To search and measure how far a node in a search tree seems to be from a goal",
2528 "c": " To compare two nodes in a search tree to see if one is better than another",
2529 "d": " All of the mentioned"
2530 }
2531 },
2532 {
2533 "name": "Question 230",
2534 "desc": "A* algorithm is based on",
2535 "ans": "c",
2536 "opt": {
2537 "a": " Breadth-First-Search",
2538 "b": " Depth-First �Search",
2539 "c": " Best-First-Search",
2540 "d": " Hill climbing"
2541 }
2542 },
2543 {
2544 "name": "Question 231",
2545 "desc": "The search strategy the uses a problem specific knowledge is known as",
2546 "ans": "d",
2547 "opt": {
2548 "a": " Informed Search",
2549 "b": " Best First Search",
2550 "c": " Heuristic Search",
2551 "d": " All of the mentioned"
2552 }
2553 },
2554 {
2555 "name": "Question 232",
2556 "desc": "Uninformed search strategies are better than informed search strategies.\ra) True\rb) False\rView Answer",
2557 "ans": "a",
2558 "opt": {
2559 "a": "",
2560 "b": "",
2561 "c": "",
2562 "d": ""
2563 }
2564 },
2565 {
2566 "name": "Question 233",
2567 "desc": "Best-First search is a type of informed search, which uses ________________ to choose the best next node for expansion.",
2568 "ans": "a",
2569 "opt": {
2570 "a": " Evaluation function returning lowest evaluation",
2571 "b": " Evaluation function returning highest evaluation",
2572 "c": " Evaluation function returning lowest & highest evaluation",
2573 "d": " None of them is applicable"
2574 }
2575 },
2576 {
2577 "name": "Question 234",
2578 "desc": "Best-First search can be implemented using the following data structure.",
2579 "ans": "c",
2580 "opt": {
2581 "a": " Queue",
2582 "b": " Stack",
2583 "c": " Priority Queue",
2584 "d": " Circular Queue"
2585 }
2586 },
2587 {
2588 "name": "Question 235",
2589 "desc": "The name �best-first search� is a venerable but inaccurate oneAfter all, if we could really expand the best node first, it would not be a search at all; it would be a straight march to the goalAll we can do is choose the node that appears to be best according to the evaluation functionState whether true or false.\ra) True\rb) False\rView Answer",
2590 "ans": "a",
2591 "opt": {
2592 "a": "",
2593 "b": "",
2594 "c": "",
2595 "d": ""
2596 }
2597 },
2598 {
2599 "name": "Question 236",
2600 "desc": "Heuristic function h(n) is ____",
2601 "ans": "c",
2602 "opt": {
2603 "a": " Lowest path cost",
2604 "b": " Cheapest path from root to goal node",
2605 "c": " Estimated cost of cheapest path from root to goal node",
2606 "d": " Average path cost"
2607 }
2608 },
2609 {
2610 "name": "Question 237",
2611 "desc": "Greedy search strategy chooses the node for expansion",
2612 "ans": "c",
2613 "opt": {
2614 "a": " Shallowest",
2615 "b": " Deepest",
2616 "c": " The one closest to the goal node",
2617 "d": " Minimum heuristic cost"
2618 }
2619 },
2620 {
2621 "name": "Question 238",
2622 "desc": "In greedy approach evaluation function is",
2623 "ans": "a",
2624 "opt": {
2625 "a": " Heuristic function",
2626 "b": " Path cost from start node to current node",
2627 "c": " Path cost from start node to current node + Heuristic cost",
2628 "d": " Average of Path cost from start node to current node and Heuristic cost"
2629 }
2630 },
2631 {
2632 "name": "Question 239",
2633 "desc": "What is the space complexity of Greedy search?",
2634 "ans": "d",
2635 "opt": {
2636 "a": " O(b)",
2637 "b": " O(bl)",
2638 "c": " O(m)",
2639 "d": " O(bm)"
2640 }
2641 },
2642 {
2643 "name": "Question 240",
2644 "desc": "In A* approach evaluation function is",
2645 "ans": "c",
2646 "opt": {
2647 "a": " Heuristic function",
2648 "b": " Path cost from start node to current node",
2649 "c": " Path cost from start node to current node + Heuristic cost",
2650 "d": " Average of Path cost from start node to current node and Heuristic cost"
2651 }
2652 },
2653 {
2654 "name": "Question 241",
2655 "desc": "A* is optimal if h(n) is an admissible heuristic-that is, provided that h(n) never underestimates the cost to reach the goal.\ra) True\rb) False\rView Answer",
2656 "ans": "a",
2657 "opt": {
2658 "a": "",
2659 "b": "",
2660 "c": "",
2661 "d": ""
2662 }
2663 },
2664 {
2665 "name": "Question 242",
2666 "desc": "In many problems the path to goal is irrelevant, this class of problems can be solved using,",
2667 "ans": "c",
2668 "opt": {
2669 "a": " Informed Search Techniques",
2670 "b": " Uninformed Search Techniques",
2671 "c": " Local Search Techniques",
2672 "d": " Informed & Uninformed Search Techniques"
2673 }
2674 },
2675 {
2676 "name": "Question 243",
2677 "desc": "Though local search algorithms are not systematic, key advantages would include",
2678 "ans": "d",
2679 "opt": {
2680 "a": " Less memory",
2681 "b": " More time",
2682 "c": " Finds a solution in large infinite space",
2683 "d": " Less memory & Finds a solution in large infinite space"
2684 }
2685 },
2686 {
2687 "name": "Question 244",
2688 "desc": "A complete, local search algorithm always finds goal if one exists, an optimal algorithm always finds a global minimum/maximumState whether True or False.\ra) True\rb) False\rView Answer",
2689 "ans": "a",
2690 "opt": {
2691 "a": "",
2692 "b": "",
2693 "c": "",
2694 "d": ""
2695 }
2696 },
2697 {
2698 "name": "Question 245",
2699 "desc": "_______________ Is an algorithm, a loop that continually moves in the direction of increasing value � that is uphill",
2700 "ans": "b",
2701 "opt": {
2702 "a": " Up-Hill Search",
2703 "b": " Hill-Climbing",
2704 "c": " Hill algorithm",
2705 "d": " Reverse-Down-Hill search"
2706 }
2707 },
2708 {
2709 "name": "Question 246",
2710 "desc": "Hill-Climbing algorithm terminates when,",
2711 "ans": "c",
2712 "opt": {
2713 "a": " Stopping criterion met",
2714 "b": " Global Min/Max is achieved",
2715 "c": " No neighbor has higher value",
2716 "d": " All of the mentioned"
2717 }
2718 },
2719 {
2720 "name": "Question 247",
2721 "desc": "One of the main cons of hill-climbing search is,",
2722 "ans": "a",
2723 "opt": {
2724 "a": " Terminates at local optimum & Does not find optimum solution",
2725 "b": " Terminates at global optimum & Does not find optimum solution",
2726 "c": " Does not find optimum solution & Fail to find a solution",
2727 "d": " Fail to find a solution"
2728 }
2729 },
2730 {
2731 "name": "Question 248",
2732 "desc": "Stochastic hill climbing chooses at random from among the uphill moves; the probability of selection can vary with the steepness of the uphil1 move.\ra) True\rb) False\rView Answer",
2733 "ans": "a",
2734 "opt": {
2735 "a": "",
2736 "b": "",
2737 "c": "",
2738 "d": ""
2739 }
2740 },
2741 {
2742 "name": "Question 249",
2743 "desc": "Hill climbing sometimes called ____________ because it grabs a good neighbor state without thinking ahead about where to go next.",
2744 "ans": "c",
2745 "opt": {
2746 "a": " Needy local search",
2747 "b": " Heuristic local search",
2748 "c": " Greedy local search",
2749 "d": " Optimal local search"
2750 }
2751 },
2752 {
2753 "name": "Question 250",
2754 "desc": "Hill-Climbing approach stuck for the following reasons",
2755 "ans": "d",
2756 "opt": {
2757 "a": " Local maxima",
2758 "b": " Ridges",
2759 "c": " Plateaux",
2760 "d": " All of the mentioned"
2761 }
2762 },
2763 {
2764 "name": "Question 251",
2765 "desc": "___________ algorithm keeps track of k states rather than just one.",
2766 "ans": "b",
2767 "opt": {
2768 "a": " Hill-Climbing search",
2769 "b": " Local Beam search",
2770 "c": " Stochastic hill-climbing search",
2771 "d": " Random restart hill-climbing search"
2772 }
2773 },
2774 {
2775 "name": "Question 252",
2776 "desc": "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.\ra) True\rb) False\rView Answer",
2777 "ans": "a",
2778 "opt": {
2779 "a": "",
2780 "b": "",
2781 "c": "",
2782 "d": ""
2783 }
2784 },
2785 {
2786 "name": "Question 253",
2787 "desc": "Mark two main features of Genetic Algorithm",
2788 "ans": "a",
2789 "opt": {
2790 "a": " Fitness function & Crossover techniques",
2791 "b": " Crossover techniques & Random mutation",
2792 "c": " Individuals among the population & Random mutation",
2793 "d": " Random mutation & Fitness function"
2794 }
2795 },
2796 {
2797 "name": "Question 254",
2798 "desc": "Searching using query on Internet is, use of ___________ type of agent",
2799 "ans": "d",
2800 "opt": {
2801 "a": " Offline agent",
2802 "b": " Online agent",
2803 "c": " Both Offline & Online agent",
2804 "d": " Goal Based & Online agent"
2805 }
2806 },
2807 {
2808 "name": "Question 255",
2809 "desc": "_________________ are mathematical problems defined as a set of objects whose state must satisfy a number of constraints or limitations.",
2810 "ans": "a",
2811 "opt": {
2812 "a": " Constraints Satisfaction Problems",
2813 "b": " Uninformed Search Problems",
2814 "c": " Local Search Problems",
2815 "d": " All of the mentioned"
2816 }
2817 },
2818 {
2819 "name": "Question 256",
2820 "desc": "Which of the Following problems can be modeled as CSP?",
2821 "ans": "d",
2822 "opt": {
2823 "a": " 8-Puzzle problem",
2824 "b": " 8-Queen problem",
2825 "c": " Map coloring problem",
2826 "d": " All of the mentioned"
2827 }
2828 },
2829 {
2830 "name": "Question 257",
2831 "desc": "What among the following constitutes to the incremental formulation of CSP?",
2832 "ans": "d",
2833 "opt": {
2834 "a": " Path cost",
2835 "b": " Goal cost",
2836 "c": " Successor function",
2837 "d": " All of the mentioned"
2838 }
2839 },
2840 {
2841 "name": "Question 258",
2842 "desc": "The term ___________ is used for a depth-first search that chooses values for one variable at a time and returns when a variable has no legal values left to assign.",
2843 "ans": "b",
2844 "opt": {
2845 "a": " Forward search",
2846 "b": " Backtrack search",
2847 "c": " Hill algorithm",
2848 "d": " Reverse-Down-Hill search"
2849 }
2850 },
2851 {
2852 "name": "Question 259",
2853 "desc": "To overcome the need to backtrack in constraint satisfaction problem can be eliminated by",
2854 "ans": "a",
2855 "opt": {
2856 "a": " Forward Searching",
2857 "b": " Constraint Propagation",
2858 "c": " Backtrack after a forward search",
2859 "d": " Omitting the constraints and focusing only on goals"
2860 }
2861 },
2862 {
2863 "name": "Question 260",
2864 "desc": "The BACKTRACKING-SEARCH algorithm in Figure 5.3 has a very simple policy for what to do when a branch of the search fails: back up to the preceding variable and try a different value for itThis is called chronological-backtrackingIt is also possible to go all the way to set of variable that caused failureState whether True or False.\ra) True\rb) False\rView Answer",
2865 "ans": "a",
2866 "opt": {
2867 "a": "",
2868 "b": "",
2869 "c": "",
2870 "d": ""
2871 }
2872 },
2873 {
2874 "name": "Question 261",
2875 "desc": "Consider a problem of preparing a schedule for a class of studentThis problem is a type of",
2876 "ans": "c",
2877 "opt": {
2878 "a": " Search Problem",
2879 "b": " Backtrack Problem",
2880 "c": " CSP",
2881 "d": " Planning Problem"
2882 }
2883 },
2884 {
2885 "name": "Question 262",
2886 "desc": "Constraint satisfaction problems on finite domains are typically solved using a form of ___________",
2887 "ans": "d",
2888 "opt": {
2889 "a": " Search Algorithms",
2890 "b": " Heuristic Search Algorithms",
2891 "c": " Greedy Search Algorithms",
2892 "d": " All of the mentioned"
2893 }
2894 },
2895 {
2896 "name": "Question 263",
2897 "desc": "Solving a constraint satisfaction problem on a finite domain is an/a ___________ problem with respect to the domain size.",
2898 "ans": "b",
2899 "opt": {
2900 "a": " P complete",
2901 "b": " NP complete",
2902 "c": " NP hard",
2903 "d": " Domain dependent"
2904 }
2905 },
2906 {
2907 "name": "Question 264",
2908 "desc": " ____________ is/are useful when the original formulation of a problem is altered in some way, typically because the set of constraints to consider evolves because of the environment.",
2909 "ans": "b",
2910 "opt": {
2911 "a": " Static CSPs",
2912 "b": " Dynamic CSPs",
2913 "c": " Flexible CSPs",
2914 "d": " None of the mentioned"
2915 }
2916 },
2917 {
2918 "name": "Question 265",
2919 "desc": "Flexible CSPs relax on _______",
2920 "ans": "a",
2921 "opt": {
2922 "a": " Constraints",
2923 "b": " Current State",
2924 "c": " Initial State",
2925 "d": " Goal State"
2926 }
2927 },
2928 {
2929 "name": "Question 266",
2930 "desc": "Language/Languages used for programming Constraint Programming includes",
2931 "ans": "a",
2932 "opt": {
2933 "a": " Prolog",
2934 "b": " C#",
2935 "c": " C",
2936 "d": " Fortrun"
2937 }
2938 },
2939 {
2940 "name": "Question 267",
2941 "desc": "Backtracking is based on,",
2942 "ans": "d",
2943 "opt": {
2944 "a": " Last in first out",
2945 "b": " First in first out",
2946 "c": " Recursion",
2947 "d": " Both Last in first out & Recursion"
2948 }
2949 },
2950 {
2951 "name": "Question 268",
2952 "desc": "Constraint Propagation technique actually modifies the CSP problem.\ra) True\rb) False\rView Answer",
2953 "ans": "a",
2954 "opt": {
2955 "a": "",
2956 "b": "",
2957 "c": "",
2958 "d": ""
2959 }
2960 },
2961 {
2962 "name": "Question 269",
2963 "desc": "When do we call the states are safely explored?",
2964 "ans": "c",
2965 "opt": {
2966 "a": " A goal state is unreachable from any state",
2967 "b": " A goal state is denied access",
2968 "c": " A goal state is reachable from every state",
2969 "d": " None of the mentioned"
2970 }
2971 },
2972 {
2973 "name": "Question 270",
2974 "desc": "Which of the following algorithm is generally used CSP search algorithm?",
2975 "ans": "b",
2976 "opt": {
2977 "a": " Breadth-first search algorithm",
2978 "b": " Depth-first search algorithm",
2979 "c": " Hill-climbing search algorithm",
2980 "d": " None of the mentioned"
2981 }
2982 },
2983 {
2984 "name": "Question 271",
2985 "desc": "General games involves",
2986 "ans": "d",
2987 "opt": {
2988 "a": " Single-agent",
2989 "b": " Multi-agent",
2990 "c": " Neither Single-agent nor Multi-agent",
2991 "d": " Only Single-agent and Multi-agent"
2992 }
2993 },
2994 {
2995 "name": "Question 272",
2996 "desc": "Adversarial search problems uses",
2997 "ans": "a",
2998 "opt": {
2999 "a": " Competitive Environment",
3000 "b": " Cooperative Environment",
3001 "c": " Neither Competitive nor Cooperative Environment",
3002 "d": " Only Competitive and Cooperative Environment"
3003 }
3004 },
3005 {
3006 "name": "Question 273",
3007 "desc": "Mathematical game theory, a branch of economics, views any multi-agent environment as a game provided that the impact of each agent on the others is �significant,� regardless of whether the agents are cooperative or competitive.\ra) True\rb) False\rView Answer",
3008 "ans": "a",
3009 "opt": {
3010 "a": "",
3011 "b": "",
3012 "c": "",
3013 "d": ""
3014 }
3015 },
3016 {
3017 "name": "Question 274",
3018 "desc": "Zero sum games are the one in which there are two agents whose actions must alternate and in which the utility values at the end of the game are always the same.\ra) True\rb) False\rView Answer",
3019 "ans": "b",
3020 "opt": {
3021 "a": "",
3022 "b": "",
3023 "c": "",
3024 "d": ""
3025 }
3026 },
3027 {
3028 "name": "Question 275",
3029 "desc": "Zero sum game has to be a ______ game.",
3030 "ans": "c",
3031 "opt": {
3032 "a": " Single player",
3033 "b": " Two player",
3034 "c": " Multiplayer",
3035 "d": " Three player"
3036 }
3037 },
3038 {
3039 "name": "Question 276",
3040 "desc": "A game can be formally defined as a kind of search problem with the following components:",
3041 "ans": "d",
3042 "opt": {
3043 "a": " Initial State",
3044 "b": " Successor Function",
3045 "c": " Terminal Test",
3046 "d": " All of the mentioned"
3047 }
3048 },
3049 {
3050 "name": "Question 277",
3051 "desc": "The initial state and the legal moves for each side define the __________ for the game.",
3052 "ans": "b",
3053 "opt": {
3054 "a": " Search Tree",
3055 "b": " Game Tree",
3056 "c": " State Space Search",
3057 "d": " Forest"
3058 }
3059 },
3060 {
3061 "name": "Question 278",
3062 "desc": "General algorithm applied on game tree for making decision of win/lose is ____________",
3063 "ans": "d",
3064 "opt": {
3065 "a": " DFS/BFS Search Algorithms",
3066 "b": " Heuristic Search Algorithms",
3067 "c": " Greedy Search Algorithms",
3068 "d": " MIN/MAX Algorithms"
3069 }
3070 },
3071 {
3072 "name": "Question 279",
3073 "desc": "The minimax algorithm (Figure 6.3) computes the minimax decision from the current stateIt uses a simple recursive computation of the minimax values of each successor state, directly implementing the defining equationsThe recursion proceeds all the way down to the leaves of the tree, and then the minimax values are backed up through the tree as the recursion unwinds.\ra) True\rb) False\rView Answer",
3074 "ans": "a",
3075 "opt": {
3076 "a": "",
3077 "b": "",
3078 "c": "",
3079 "d": ""
3080 }
3081 },
3082 {
3083 "name": "Question 280",
3084 "desc": "The complexity of minimax algorithm is",
3085 "ans": "a",
3086 "opt": {
3087 "a": " Same as of DFS",
3088 "b": " Space � bm and time � bm",
3089 "c": " Time � bm and space � bm",
3090 "d": " Same as BFS"
3091 }
3092 },
3093 {
3094 "name": "Question 281",
3095 "desc": "Which is the most straightforward approach for planning algorithm?",
3096 "ans": "b",
3097 "opt": {
3098 "a": " Best-first search",
3099 "b": " State-space search",
3100 "c": " Depth-first search",
3101 "d": " Hill-climbing search"
3102 }
3103 },
3104 {
3105 "name": "Question 282",
3106 "desc": "What are taken into account of state-space search?",
3107 "ans": "d",
3108 "opt": {
3109 "a": " Postconditions",
3110 "b": " Preconditions",
3111 "c": " Effects",
3112 "d": " Both Preconditions & Effects"
3113 }
3114 },
3115 {
3116 "name": "Question 283",
3117 "desc": "How many ways are available to solve the state-space search?",
3118 "ans": "b",
3119 "opt": {
3120 "a": " 1",
3121 "b": " 2",
3122 "c": " 3",
3123 "d": " 4"
3124 }
3125 },
3126 {
3127 "name": "Question 284",
3128 "desc": "What is the other name for forward state-space search?",
3129 "ans": "a",
3130 "opt": {
3131 "a": " Progression planning",
3132 "b": " Regression planning",
3133 "c": " Test planning",
3134 "d": " None of the mentioned"
3135 }
3136 },
3137 {
3138 "name": "Question 285",
3139 "desc": "How many states are available in state-space search?",
3140 "ans": "d",
3141 "opt": {
3142 "a": " 1",
3143 "b": " 2",
3144 "c": " 3",
3145 "d": " 4"
3146 }
3147 },
3148 {
3149 "name": "Question 286",
3150 "desc": "What is the main advantage of backward state-space search?",
3151 "ans": "c",
3152 "opt": {
3153 "a": " Cost",
3154 "b": " Actions",
3155 "c": " Relevant actions",
3156 "d": " All of the mentioned"
3157 }
3158 },
3159 {
3160 "name": "Question 287",
3161 "desc": "What is the other name of backward state-space search?",
3162 "ans": "a",
3163 "opt": {
3164 "a": " Regression planning",
3165 "b": " Progression planning",
3166 "c": " State planning",
3167 "d": " Test planning"
3168 }
3169 },
3170 {
3171 "name": "Question 288",
3172 "desc": "What is meant by consistent in state-space search?",
3173 "ans": "b",
3174 "opt": {
3175 "a": " Change in the desired literals",
3176 "b": " Not any change in the literals",
3177 "c": " No change in goal state",
3178 "d": " None of the mentioned"
3179 }
3180 },
3181 {
3182 "name": "Question 289",
3183 "desc": "What will happen if a predecessor description is generated that is satisfied by the initial state of the planning problem?",
3184 "ans": "d",
3185 "opt": {
3186 "a": " Success",
3187 "b": " Error",
3188 "c": " Compilation",
3189 "d": " Termination"
3190 }
3191 },
3192 {
3193 "name": "Question 290",
3194 "desc": "Which approach is to pretend that a pure divide and conquer algorithm will work?",
3195 "ans": "b",
3196 "opt": {
3197 "a": " Goal independence",
3198 "b": " Subgoal independence",
3199 "c": " Both Goal & Subgoal independence",
3200 "d": " None of the mentioned"
3201 }
3202 },
3203 {
3204 "name": "Question 291",
3205 "desc": "Which search is equal to minimax search but eliminates the branches that can�t influence the final decision?",
3206 "ans": "c",
3207 "opt": {
3208 "a": " Depth-first search",
3209 "b": " Breadth-first search",
3210 "c": " Alpha-beta pruning",
3211 "d": " None of the mentioned"
3212 }
3213 },
3214 {
3215 "name": "Question 292",
3216 "desc": "Which values are independant in minimax search algorithm?",
3217 "ans": "a",
3218 "opt": {
3219 "a": " Pruned leaves x and y",
3220 "b": " Every states are dependant",
3221 "c": " Root is independant",
3222 "d": " None of the mentioned"
3223 }
3224 },
3225 {
3226 "name": "Question 293",
3227 "desc": "To which depth does the alpha-beta pruning can be applied?",
3228 "ans": "d",
3229 "opt": {
3230 "a": " 10 states",
3231 "b": " 8 States",
3232 "c": " 6 States",
3233 "d": " Any depth"
3234 }
3235 },
3236 {
3237 "name": "Question 294",
3238 "desc": "Which search is similar to minimax search?",
3239 "ans": "b",
3240 "opt": {
3241 "a": " Hill-climbing search",
3242 "b": " Depth-first search",
3243 "c": " Breadth-first search",
3244 "d": " All of the mentioned"
3245 }
3246 },
3247 {
3248 "name": "Question 295",
3249 "desc": "Which value is assigned to alpha and beta in the alpha-beta pruning?",
3250 "ans": "d",
3251 "opt": {
3252 "a": " Alpha = max",
3253 "b": " Beta = min",
3254 "c": " Beta = max",
3255 "d": " Both Alpha = max & Beta = min"
3256 }
3257 },
3258 {
3259 "name": "Question 296",
3260 "desc": "Where does the values of alpha-beta search get updated?",
3261 "ans": "a",
3262 "opt": {
3263 "a": " Along the path of search",
3264 "b": " Initial state itself",
3265 "c": " At the end",
3266 "d": " None of the mentioned"
3267 }
3268 },
3269 {
3270 "name": "Question 297",
3271 "desc": "How the effectiveness of the alpha-beta pruning gets increased?",
3272 "ans": "a",
3273 "opt": {
3274 "a": " Depends on the nodes",
3275 "b": " Depends on the order in which they are executed",
3276 "c": " All of the mentioned",
3277 "d": " None of the mentioned"
3278 }
3279 },
3280 {
3281 "name": "Question 298",
3282 "desc": "What is called as transposition table?",
3283 "ans": "b",
3284 "opt": {
3285 "a": " Hash table of next seen positions",
3286 "b": " Hash table of previously seen positions",
3287 "c": " Next value in the search",
3288 "d": " None of the mentioned"
3289 }
3290 },
3291 {
3292 "name": "Question 299",
3293 "desc": "Which is identical to the closed list in Graph search?",
3294 "ans": "c",
3295 "opt": {
3296 "a": " Hill climbing search algorithm",
3297 "b": " Depth-first search",
3298 "c": " Transposition table",
3299 "d": " None of the mentioned"
3300 }
3301 },
3302 {
3303 "name": "Question 300",
3304 "desc": "Which function is used to calculate the feasibility of whole game tree?",
3305 "ans": "a",
3306 "opt": {
3307 "a": " Evaluation function",
3308 "b": " Transposition",
3309 "c": " Alpha-beta pruning",
3310 "d": " All of the mentioned"
3311 }
3312 },
3313 {
3314 "name": "Question 301",
3315 "desc": "There exist only two types of quantifiers, Universal Quantification and Existential Quantification.\ra) True\rb) False\rView Answer",
3316 "ans": "a",
3317 "opt": {
3318 "a": "",
3319 "b": "",
3320 "c": "",
3321 "d": ""
3322 }
3323 },
3324 {
3325 "name": "Question 302",
3326 "desc": "Translate the following statement into FOL.",
3327 "ans": "a",
3328 "opt": {
3329 "a": "or every a, if a is a philosopher, then a is a scholar�",
3330 "b": " _ a philosopher(a) scholar(a)",
3331 "c": " _ a philosopher(a) scholar(a)",
3332 "d": " All of the mentioned"
3333 }
3334 },
3335 {
3336 "name": "Question 303",
3337 "desc": "A _________ is used to demonstrate, on a purely syntactic basis, that one formula is a logical consequence of another formula.",
3338 "ans": "a",
3339 "opt": {
3340 "a": " Deductive Systems",
3341 "b": " Inductive Systems",
3342 "c": " Reasoning with Knowledge Based Systems",
3343 "d": " Search Based Systems"
3344 }
3345 },
3346 {
3347 "name": "Question 304",
3348 "desc": "The statement comprising the limitations of FOL is/are",
3349 "ans": "d",
3350 "opt": {
3351 "a": " Expressiveness",
3352 "b": " Formalizing Natural Languages",
3353 "c": " Many-sorted Logic",
3354 "d": " All of the mentioned"
3355 }
3356 },
3357 {
3358 "name": "Question 305",
3359 "desc": "A common convention is:\r� is evaluated first\r� and are evaluated next\r� Quantifiers are evaluated next\r� is evaluated last.\ra) True\rb) False\rView Answer",
3360 "ans": "a",
3361 "opt": {
3362 "a": "",
3363 "b": "",
3364 "c": "",
3365 "d": ""
3366 }
3367 },
3368 {
3369 "name": "Question 306",
3370 "desc": "A Term is either an individual constant (a 0-ary function), or a variable, or an n-ary function applied to n terms: F(t1 t2 ..tn).\ra) True\rb) False\rView Answer",
3371 "ans": "a",
3372 "opt": {
3373 "a": "",
3374 "b": "",
3375 "c": "",
3376 "d": ""
3377 }
3378 },
3379 {
3380 "name": "Question 307",
3381 "desc": "First Order Logic is also known as ___________",
3382 "ans": "d",
3383 "opt": {
3384 "a": " First Order Predicate Calculus",
3385 "b": " Quantification Theory",
3386 "c": " Lower Order Calculus",
3387 "d": " All of the mentioned"
3388 }
3389 },
3390 {
3391 "name": "Question 308",
3392 "desc": "The adjective �first-order� distinguishes first-order logic from ___________ in which there are predicates having predicates or functions as arguments, or in which one or both of predicate quantifiers or function quantifiers are permitted.",
3393 "ans": "c",
3394 "opt": {
3395 "a": " Representational Verification",
3396 "b": " Representational Adequacy",
3397 "c": " Higher Order Logic",
3398 "d": " Inferential Efficiency"
3399 }
3400 },
3401 {
3402 "name": "Question 309",
3403 "desc": "Which is created by using single propositional symbol?",
3404 "ans": "b",
3405 "opt": {
3406 "a": " Complex sentences",
3407 "b": " Atomic sentences",
3408 "c": " Composition sentences",
3409 "d": " None of the mentioned"
3410 }
3411 },
3412 {
3413 "name": "Question 310",
3414 "desc": "Which is used to construct the complex sentences?",
3415 "ans": "c",
3416 "opt": {
3417 "a": " Symbols",
3418 "b": " Connectives",
3419 "c": " Logical connectives",
3420 "d": " All of the mentioned"
3421 }
3422 },
3423 {
3424 "name": "Question 311",
3425 "desc": "How many proposition symbols are there in artificial intelligence?",
3426 "ans": "b",
3427 "opt": {
3428 "a": " 1",
3429 "b": " 2",
3430 "c": " 3",
3431 "d": " 4"
3432 }
3433 },
3434 {
3435 "name": "Question 312",
3436 "desc": "How many logical connectives are there in artificial intelligence?",
3437 "ans": "d",
3438 "opt": {
3439 "a": " 2",
3440 "b": " 3",
3441 "c": " 4",
3442 "d": " 5"
3443 }
3444 },
3445 {
3446 "name": "Question 313",
3447 "desc": "Which is used to compute the truth of any sentence?",
3448 "ans": "a",
3449 "opt": {
3450 "a": " Semantics of propositional logic",
3451 "b": " Alpha-beta pruning",
3452 "c": " First-order logic",
3453 "d": " Both Semantics of propositional logic & Alpha-beta pruning"
3454 }
3455 },
3456 {
3457 "name": "Question 314",
3458 "desc": "Which are needed to compute the logical inference algorithm?",
3459 "ans": "d",
3460 "opt": {
3461 "a": " Logical equivalence",
3462 "b": " Validity",
3463 "c": " Satisfiability",
3464 "d": " All of the mentioned"
3465 }
3466 },
3467 {
3468 "name": "Question 315",
3469 "desc": "From which rule does the modus ponens are derived?",
3470 "ans": "a",
3471 "opt": {
3472 "a": " Inference rule",
3473 "b": " Module rule",
3474 "c": " Both Inference & Module rule",
3475 "d": " None of the mentioned"
3476 }
3477 },
3478 {
3479 "name": "Question 316",
3480 "desc": "Which is also called single inference rule?",
3481 "ans": "b",
3482 "opt": {
3483 "a": " Reference",
3484 "b": " Resolution",
3485 "c": " Reform",
3486 "d": " None of the mentioned"
3487 }
3488 },
3489 {
3490 "name": "Question 317",
3491 "desc": "Which form is called as conjunction of disjunction of literals?",
3492 "ans": "a",
3493 "opt": {
3494 "a": " Conjunctive normal form",
3495 "b": " Disjunctive normal form",
3496 "c": " Normal form",
3497 "d": " All of the mentioned"
3498 }
3499 },
3500 {
3501 "name": "Question 318",
3502 "desc": "What can be viewed as single lateral of disjunction?",
3503 "ans": "c",
3504 "opt": {
3505 "a": " Multiple clause",
3506 "b": " Combine clause",
3507 "c": " Unit clause",
3508 "d": " None of the mentioned"
3509 }
3510 },
3511 {
3512 "name": "Question 319",
3513 "desc": "Which is a refutation complete inference procedure for propositional logic?",
3514 "ans": "c",
3515 "opt": {
3516 "a": " Clauses",
3517 "b": " Variables",
3518 "c": " Propositional resolution",
3519 "d": " Proposition"
3520 }
3521 },
3522 {
3523 "name": "Question 320",
3524 "desc": "What kind of clauses are available in Conjunctive Normal Form?",
3525 "ans": "a",
3526 "opt": {
3527 "a": " Disjunction of literals",
3528 "b": " Disjunction of variables",
3529 "c": " Conjunction of literals",
3530 "d": " Conjunction of variables"
3531 }
3532 },
3533 {
3534 "name": "Question 321",
3535 "desc": "What is the condition of literals in variables?",
3536 "ans": "b",
3537 "opt": {
3538 "a": " Existentially quantified",
3539 "b": " Universally quantified",
3540 "c": " Quantified",
3541 "d": " None of the mentioned"
3542 }
3543 },
3544 {
3545 "name": "Question 322",
3546 "desc": "Which can be converted to inferred equivalent CNF sentence?",
3547 "ans": "c",
3548 "opt": {
3549 "a": " Every sentence of propositional logic",
3550 "b": " Every sentence of inference",
3551 "c": " Every sentence of first-order logic",
3552 "d": " All of the mentioned"
3553 }
3554 },
3555 {
3556 "name": "Question 323",
3557 "desc": "Which sentence will be unsatisfiable if the CNF sentence is unsatisfiable?",
3558 "ans": "d",
3559 "opt": {
3560 "a": " Search statement",
3561 "b": " Reading statement",
3562 "c": " Replaced statement",
3563 "d": " Original statement"
3564 }
3565 },
3566 {
3567 "name": "Question 324",
3568 "desc": "Which rule is equal to resolution rule of first-order clauses?",
3569 "ans": "a",
3570 "opt": {
3571 "a": " Propositional resolution rule",
3572 "b": " Inference rule",
3573 "c": " Resolution rule",
3574 "d": " None of the mentioned"
3575 }
3576 },
3577 {
3578 "name": "Question 325",
3579 "desc": "At which state does the propositional literals are complementary?",
3580 "ans": "b",
3581 "opt": {
3582 "a": " If one variable is less",
3583 "b": " If one is the negation of the other",
3584 "c": " All of the mentioned",
3585 "d": " None of the mentioned"
3586 }
3587 },
3588 {
3589 "name": "Question 326",
3590 "desc": "What is meant by factoring?",
3591 "ans": "b",
3592 "opt": {
3593 "a": " Removal of redundant variable",
3594 "b": " Removal of redundant literal",
3595 "c": " Addition of redundant literal",
3596 "d": " Addition of redundant variable"
3597 }
3598 },
3599 {
3600 "name": "Question 327",
3601 "desc": "What will happen if two literals are identical?",
3602 "ans": "c",
3603 "opt": {
3604 "a": " Remains the same",
3605 "b": " Added as three",
3606 "c": " Reduced to one",
3607 "d": " None of the mentioned"
3608 }
3609 },
3610 {
3611 "name": "Question 328",
3612 "desc": "When the resolution is called as refutation-complete?",
3613 "ans": "b",
3614 "opt": {
3615 "a": " Sentence is satisfiable",
3616 "b": " Sentence is unsatisfiable",
3617 "c": " Sentence remains the same",
3618 "d": " None of the mentioned"
3619 }
3620 },
3621 {
3622 "name": "Question 329",
3623 "desc": "Which condition is used to cease the growth of forward chaining?",
3624 "ans": "c",
3625 "opt": {
3626 "a": " Atomic sentences",
3627 "b": " Complex sentences",
3628 "c": " No further inference",
3629 "d": " All of the mentioned"
3630 }
3631 },
3632 {
3633 "name": "Question 330",
3634 "desc": "Which closely resembles propositional definite clause?",
3635 "ans": "d",
3636 "opt": {
3637 "a": " Resolution",
3638 "b": " Inference",
3639 "c": " Conjunction",
3640 "d": " First-order definite clauses"
3641 }
3642 },
3643 {
3644 "name": "Question 331",
3645 "desc": "What is the condition of variables in first-order literals?",
3646 "ans": "b",
3647 "opt": {
3648 "a": " Existentially quantified",
3649 "b": " Universally quantified",
3650 "c": " Both Existentially & Universally quantified",
3651 "d": " None of the mentioned"
3652 }
3653 },
3654 {
3655 "name": "Question 332",
3656 "desc": "Which are more suitable normal form to be used with definite clause?",
3657 "ans": "c",
3658 "opt": {
3659 "a": " Positive literal",
3660 "b": " Negative literal",
3661 "c": " Generalized modus ponens",
3662 "d": " Neutral literal"
3663 }
3664 },
3665 {
3666 "name": "Question 333",
3667 "desc": "Which will be the instance of the class datalog knowledge bases?",
3668 "ans": "b",
3669 "opt": {
3670 "a": " Variables",
3671 "b": " No function symbols",
3672 "c": " First-order definite clauses",
3673 "d": " None of the mentioned"
3674 }
3675 },
3676 {
3677 "name": "Question 334",
3678 "desc": "Which knowledge base is called as fixed point?",
3679 "ans": "a",
3680 "opt": {
3681 "a": " First-order definite clause are similar to propositional forward chaining",
3682 "b": " First-order definite clause are mismatch to propositional forward chaining",
3683 "c": " All of the mentioned",
3684 "d": " None of the mentioned"
3685 }
3686 },
3687 {
3688 "name": "Question 335",
3689 "desc": "How to eliminate the redundant rule matching attempts in the forward chaining?",
3690 "ans": "b",
3691 "opt": {
3692 "a": " Decremental forward chaining",
3693 "b": " Incremental forward chaining",
3694 "c": " Data complexity",
3695 "d": " None of the mentioned"
3696 }
3697 },
3698 {
3699 "name": "Question 336",
3700 "desc": "From where did the new fact inferred on new iteration is derived?",
3701 "ans": "c",
3702 "opt": {
3703 "a": " Old fact",
3704 "b": " Narrow fact",
3705 "c": " New fact",
3706 "d": " All of the mentioned"
3707 }
3708 },
3709 {
3710 "name": "Question 337",
3711 "desc": "Which will solve the conjuncts of the rule so that the total cost is minimized?",
3712 "ans": "b",
3713 "opt": {
3714 "a": " Constraint variable",
3715 "b": " Conjunct ordering",
3716 "c": " Data complexity",
3717 "d": " All of the mentioned"
3718 }
3719 },
3720 {
3721 "name": "Question 338",
3722 "desc": "How many possible sources of complexity are there in forward chaining?",
3723 "ans": "c",
3724 "opt": {
3725 "a": " 1",
3726 "b": " 2",
3727 "c": " 3",
3728 "d": " 4"
3729 }
3730 },
3731 {
3732 "name": "Question 339",
3733 "desc": "Which algorithm will work backward from the goal to solve a problem?",
3734 "ans": "b",
3735 "opt": {
3736 "a": " Forward chaining",
3737 "b": " Backward chaining",
3738 "c": " Hill-climb algorithm",
3739 "d": " None of the mentioned"
3740 }
3741 },
3742 {
3743 "name": "Question 340",
3744 "desc": "Which is mainly used for automated reasoning?",
3745 "ans": "c",
3746 "opt": {
3747 "a": " Backward chaining",
3748 "b": " Forward chaining",
3749 "c": " Logic programming",
3750 "d": " Parallel programming"
3751 }
3752 },
3753 {
3754 "name": "Question 341",
3755 "desc": "What will backward chaining algorithm will return?",
3756 "ans": "b",
3757 "opt": {
3758 "a": " Additional statements",
3759 "b": " Substitutes matching the query",
3760 "c": " Logical statement",
3761 "d": " All of the mentioned"
3762 }
3763 },
3764 {
3765 "name": "Question 342",
3766 "desc": "How can be the goal is thought of in backward chaining algorithm?",
3767 "ans": "d",
3768 "opt": {
3769 "a": " Queue",
3770 "b": " List",
3771 "c": " Vector",
3772 "d": " Stack"
3773 }
3774 },
3775 {
3776 "name": "Question 343",
3777 "desc": "What are used in backward chaining algorithm?",
3778 "ans": "c",
3779 "opt": {
3780 "a": " Conjuncts",
3781 "b": " Substitution",
3782 "c": " Composition of substitution",
3783 "d": " None of the mentioned"
3784 }
3785 },
3786 {
3787 "name": "Question 344",
3788 "desc": "Which algorithm are in more similar to backward chaining algorithm?",
3789 "ans": "a",
3790 "opt": {
3791 "a": " Depth-first search algorithm",
3792 "b": " Breadth-first search algorithm",
3793 "c": " Hill-climbing search algorithm",
3794 "d": " All of the mentioned"
3795 }
3796 },
3797 {
3798 "name": "Question 345",
3799 "desc": "Which problem can frequently occur in backward chaining algorithm?",
3800 "ans": "d",
3801 "opt": {
3802 "a": " Repeated states",
3803 "b": " Incompleteness",
3804 "c": " Complexity",
3805 "d": " Both Repeated states & Incompleteness"
3806 }
3807 },
3808 {
3809 "name": "Question 346",
3810 "desc": "How the logic programming can be constructed?",
3811 "ans": "b",
3812 "opt": {
3813 "a": " Variables",
3814 "b": " Expressing knowledge in a formal language",
3815 "c": " Graph",
3816 "d": " All of the mentioned"
3817 }
3818 },
3819 {
3820 "name": "Question 347",
3821 "desc": "What form of negation does the prolog allows?",
3822 "ans": "a",
3823 "opt": {
3824 "a": " Negation as failure",
3825 "b": " Proposition",
3826 "c": " Substitution",
3827 "d": " Negation as success"
3828 }
3829 },
3830 {
3831 "name": "Question 348",
3832 "desc": "Which is omitted in prolog unification algorithm?",
3833 "ans": "b",
3834 "opt": {
3835 "a": " Variable check",
3836 "b": " Occur check",
3837 "c": " Proposition check",
3838 "d": " Both Occur & Proposition check"
3839 }
3840 },
3841 {
3842 "name": "Question 349",
3843 "desc": "Knowledge and reasoning also play a crucial role in dealing with __________________ environment.",
3844 "ans": "b",
3845 "opt": {
3846 "a": " Completely Observable",
3847 "b": " Partially Observable",
3848 "c": " Neither Completely nor Partially Observable",
3849 "d": " Only Completely and Partially Observable"
3850 }
3851 },
3852 {
3853 "name": "Question 350",
3854 "desc": "Treatment chosen by doctor for a patient for a disease is based on",
3855 "ans": "c",
3856 "opt": {
3857 "a": " Only current symptoms",
3858 "b": " Current symptoms plus some knowledge from the textbooks",
3859 "c": " Current symptoms plus some knowledge from the textbooks plus experience",
3860 "d": " All of the mentioned"
3861 }
3862 },
3863 {
3864 "name": "Question 351",
3865 "desc": "A knowledge-based agent can combine general knowledge with current percepts to infer hidden aspects of the current state prior to selecting actionsState whether True or False.\ra) True\rb) False\rView Answer",
3866 "ans": "a",
3867 "opt": {
3868 "a": "",
3869 "b": "",
3870 "c": "",
3871 "d": ""
3872 }
3873 },
3874 {
3875 "name": "Question 352",
3876 "desc": "A) Knowledge base (KB) is consists of set of statements.",
3877 "ans": "a",
3878 "opt": {
3879 "a": " Inference is deriving a new sentence from the KB.",
3880 "b": "oose the correct option.",
3881 "c": " A is true, B is true",
3882 "d": " A is false, B is false"
3883 }
3884 },
3885 {
3886 "name": "Question 353",
3887 "desc": "Wumpus World is a classic problem, best example of _______",
3888 "ans": "c",
3889 "opt": {
3890 "a": " Single player Game",
3891 "b": " Two player Game",
3892 "c": " Reasoning with Knowledge",
3893 "d": " Knowledge based Game"
3894 }
3895 },
3896 {
3897 "name": "Question 354",
3898 "desc": "�_ |= _ �(to mean that the sentence _ entails the sentence _) if and only if, in every model in which _ is _____ _ is also _____",
3899 "ans": "a",
3900 "opt": {
3901 "a": " True, true",
3902 "b": " True, false",
3903 "c": " False, true",
3904 "d": " False, false"
3905 }
3906 },
3907 {
3908 "name": "Question 355",
3909 "desc": "Which is not a property of representation of knowledge?",
3910 "ans": "a",
3911 "opt": {
3912 "a": " Representational Verification",
3913 "b": " Representational Adequacy",
3914 "c": " Inferential Adequacy",
3915 "d": " Inferential Efficiency"
3916 }
3917 },
3918 {
3919 "name": "Question 356",
3920 "desc": "Which is not Familiar Connectives in First Order Logic?",
3921 "ans": "d",
3922 "opt": {
3923 "a": " and",
3924 "b": " iff",
3925 "c": " or",
3926 "d": " not"
3927 }
3928 },
3929 {
3930 "name": "Question 357",
3931 "desc": "Inference algorithm is complete only if,",
3932 "ans": "d",
3933 "opt": {
3934 "a": " It can derive any sentence",
3935 "b": " It can derive any sentence that is an entailed version",
3936 "c": " It is truth preserving",
3937 "d": " It can derive any sentence that is an entailed version & It is truth preserving"
3938 }
3939 },
3940 {
3941 "name": "Question 358",
3942 "desc": "An inference algorithm that derives only entailed sentences is called sound or truth-preserving.\ra) True\rb) False\rView Answer",
3943 "ans": "a",
3944 "opt": {
3945 "a": "",
3946 "b": "",
3947 "c": "",
3948 "d": ""
3949 }
3950 },
3951 {
3952 "name": "Question 359",
3953 "desc": "The rule of Universal Instantiation (UI for short) says that we can infer any sentence obtained by substituting a ground term (a term without variables) for the variable.\ra) True\rb) False\rView Answer",
3954 "ans": "a",
3955 "opt": {
3956 "a": "",
3957 "b": "",
3958 "c": "",
3959 "d": ""
3960 }
3961 },
3962 {
3963 "name": "Question 360",
3964 "desc": "The corresponding Existential Instantiation rule: for the existential quantifier is slightly more complicatedFor any sentence a, variable v, and constant symbol k that does not appear elsewhere in the knowledge base\ra) True\rb) False\rView Answer",
3965 "ans": "a",
3966 "opt": {
3967 "a": "",
3968 "b": "",
3969 "c": "",
3970 "d": ""
3971 }
3972 },
3973 {
3974 "name": "Question 361",
3975 "desc": "What among the following could the universal instantiation of ___________",
3976 "ans": "d",
3977 "opt": {
3978 "a": "r all x King(x) ^ Greedy(x) => Evil(x)",
3979 "b": " King(John) ^ Greedy(John) => Evil(John)",
3980 "c": " King(y) ^ Greedy(y) => Evil(y)",
3981 "d": " King(Richard) ^ Greedy(Richard) => Evil(Richard)"
3982 }
3983 },
3984 {
3985 "name": "Question 362",
3986 "desc": "Lifted inference rules require finding substitutions that make different logical expressions looks identical.",
3987 "ans": "c",
3988 "opt": {
3989 "a": " Existential Instantiation",
3990 "b": " Universal Instantiation",
3991 "c": " Unification",
3992 "d": " Modus Ponen"
3993 }
3994 },
3995 {
3996 "name": "Question 363",
3997 "desc": "Which of the following is not the style of inference?",
3998 "ans": "d",
3999 "opt": {
4000 "a": " Forward Chaining",
4001 "b": " Backward Chaining",
4002 "c": " Resolution Refutation",
4003 "d": " Modus Ponen"
4004 }
4005 },
4006 {
4007 "name": "Question 364",
4008 "desc": "In order to utilize generalized Modus Ponens, all sentences in the KB must be in the form of Horn sentences.\ra) True\rb) False\rView Answer",
4009 "ans": "a",
4010 "opt": {
4011 "a": "",
4012 "b": "",
4013 "c": "",
4014 "d": ""
4015 }
4016 },
4017 {
4018 "name": "Question 365",
4019 "desc": "For resolution to apply, all sentences must be in conjunctive normal form, a conjunction of disjunctions of literals.\ra) True\rb) False\rView Answer",
4020 "ans": "a",
4021 "opt": {
4022 "a": "",
4023 "b": "",
4024 "c": "",
4025 "d": ""
4026 }
4027 },
4028 {
4029 "name": "Question 366",
4030 "desc": "Two basic types of inferences are",
4031 "ans": "a",
4032 "opt": {
4033 "a": " ____________",
4034 "b": " ____________",
4035 "c": " Reduction to propositional logic, Manipulate rules directly",
4036 "d": " Reduction to propositional logic, Apply modus ponen"
4037 }
4038 },
4039 {
4040 "name": "Question 367",
4041 "desc": "What among the following could the Existential instantiation of",
4042 "ans": "b",
4043 "opt": {
4044 "a": " _x Crown(x) ^ OnHead(x, Johnny)",
4045 "b": " Crown(John) ^ OnHead(John, Jonny)",
4046 "c": " Crown(y) ^ OnHead(y, Jonny)",
4047 "d": " Crown(x) ^ OnHead(x, Jonny)"
4048 }
4049 },
4050 {
4051 "name": "Question 368",
4052 "desc": "Translate the following statement into FOL.",
4053 "ans": "a",
4054 "opt": {
4055 "a": " �For every a, if a is a PhD student, then a has a master degree�",
4056 "b": " _ a PhD(a) -> Master(a)",
4057 "c": " _ a PhD(a) -> Master(a)",
4058 "d": " A is true, B is true"
4059 }
4060 },
4061 {
4062 "name": "Question 369",
4063 "desc": "Instead of representing knowledge in a relatively declarative, static way (as a bunch of things that are true), rule-based system represent knowledge in terms of___________ that tell you what you should do or what you could conclude in different situations.",
4064 "ans": "b",
4065 "opt": {
4066 "a": " Raw Text",
4067 "b": " A bunch of rules",
4068 "c": " Summarized Text",
4069 "d": " Collection of various Texts"
4070 }
4071 },
4072 {
4073 "name": "Question 370",
4074 "desc": "A rule-based system consists of a bunch of IF-THEN rulesState whether true or false.\ra) True\rb) False\rView Answer",
4075 "ans": "a",
4076 "opt": {
4077 "a": "",
4078 "b": "",
4079 "c": "",
4080 "d": ""
4081 }
4082 },
4083 {
4084 "name": "Question 371",
4085 "desc": "In a backward chaining system you start with the initial facts, and keep using the rules to draw new conclusions (or take certain actions) given those factsState whether true or false.\ra) True\rb) False\rView Answer",
4086 "ans": "b",
4087 "opt": {
4088 "a": "",
4089 "b": "",
4090 "c": "",
4091 "d": ""
4092 }
4093 },
4094 {
4095 "name": "Question 372",
4096 "desc": "In a backward chaining system, you start with some hypothesis (or goal) you are trying to prove, and keep looking for rules that would allow you to conclude that hypothesis, perhaps setting new sub-goals to prove as you goState whether true or false.\ra) True\rb) False\rView Answer",
4097 "ans": "a",
4098 "opt": {
4099 "a": "",
4100 "b": "",
4101 "c": "",
4102 "d": ""
4103 }
4104 },
4105 {
4106 "name": "Question 373",
4107 "desc": "Forward chaining systems are _____________ where as backward chaining systems are ___________",
4108 "ans": "c",
4109 "opt": {
4110 "a": " Goal-driven, goal-driven",
4111 "b": " Goal-driven, data-driven",
4112 "c": " Data-driven, goal-driven",
4113 "d": " Data-driven, data-driven"
4114 }
4115 },
4116 {
4117 "name": "Question 374",
4118 "desc": "A Horn clause is a clause with _______ positive literal.",
4119 "ans": "b",
4120 "opt": {
4121 "a": " At least one",
4122 "b": " At most one",
4123 "c": " None",
4124 "d": " All"
4125 }
4126 },
4127 {
4128 "name": "Question 375",
4129 "desc": "___________ trees can be used to infer in Horn clause systems.",
4130 "ans": "b",
4131 "opt": {
4132 "a": " Min/Max Tree",
4133 "b": " And/Or Trees",
4134 "c": " Minimum Spanning Trees",
4135 "d": " Binary Search Trees"
4136 }
4137 },
4138 {
4139 "name": "Question 376",
4140 "desc": "An expert system is a computer program that contains some of the subject-specific knowledge of one or more human expertsState whether true or false.\ra) True\rb) False\rView Answer",
4141 "ans": "a",
4142 "opt": {
4143 "a": "",
4144 "b": "",
4145 "c": "",
4146 "d": ""
4147 }
4148 },
4149 {
4150 "name": "Question 377",
4151 "desc": "A knowledge engineer has the job of extracting knowledge from an expert and building the expert system knowledge baseState whether true or false.\ra) True\rb) False\rView Answer",
4152 "ans": "a",
4153 "opt": {
4154 "a": "",
4155 "b": "",
4156 "c": "",
4157 "d": ""
4158 }
4159 },
4160 {
4161 "name": "Question 378",
4162 "desc": "Autonomous Question/Answering systems are",
4163 "ans": "d",
4164 "opt": {
4165 "a": " Expert Systems",
4166 "b": " Rule Based Expert Systems",
4167 "c": " Decision Tree Based Systems",
4168 "d": " All of the mentioned"
4169 }
4170 },
4171 {
4172 "name": "Question 379",
4173 "desc": "Following are the applications of Expert systems",
4174 "ans": "d",
4175 "opt": {
4176 "a": " Disease Diagnosis",
4177 "b": " Planning and Scheduling",
4178 "c": " Decision making",
4179 "d": " All of the mentioned"
4180 }
4181 },
4182 {
4183 "name": "Question 380",
4184 "desc": "_________ is/are the well known Expert System/s for medical diagnosis systems",
4185 "ans": "a",
4186 "opt": {
4187 "a": " MYSIN",
4188 "b": " CADUCEUS",
4189 "c": " DENDRAL",
4190 "d": " SMH.PAL"
4191 }
4192 },
4193 {
4194 "name": "Question 381",
4195 "desc": "The main components of the expert systems is/are,",
4196 "ans": "c",
4197 "opt": {
4198 "a": " Inference Engine",
4199 "b": " Knowledge Base",
4200 "c": " Inference Engine & Knowledge Base",
4201 "d": " None of the mentioned"
4202 }
4203 },
4204 {
4205 "name": "Question 382",
4206 "desc": "There are primarily two modes for an inference engine: forward chaining and backward chaining.\ra) True\rb) False\rView Answer",
4207 "ans": "a",
4208 "opt": {
4209 "a": "",
4210 "b": "",
4211 "c": "",
4212 "d": ""
4213 }
4214 },
4215 {
4216 "name": "Question 383",
4217 "desc": "PXDES is medical expert system, for diagnosis of lung disease.\ra) True\rb) False\rView Answer",
4218 "ans": "a",
4219 "opt": {
4220 "a": "",
4221 "b": "",
4222 "c": "",
4223 "d": ""
4224 }
4225 },
4226 {
4227 "name": "Question 384",
4228 "desc": "CaDet is used for early cancer detection.\ra) True\rb) False\rView Answer",
4229 "ans": "a",
4230 "opt": {
4231 "a": "",
4232 "b": "",
4233 "c": "",
4234 "d": ""
4235 }
4236 },
4237 {
4238 "name": "Question 385",
4239 "desc": "MYSIN attempts to recommend appropriate therapies for patients with bacterial infections.\ra) True\rb) False\rView Answer",
4240 "ans": "a",
4241 "opt": {
4242 "a": "",
4243 "b": "",
4244 "c": "",
4245 "d": ""
4246 }
4247 },
4248 {
4249 "name": "Question 386",
4250 "desc": "GERMWATCHER is used to control infections caused by bacteria.\ra) True\rb) False\rView Answer",
4251 "ans": "a",
4252 "opt": {
4253 "a": "",
4254 "b": "",
4255 "c": "",
4256 "d": ""
4257 }
4258 },
4259 {
4260 "name": "Question 387",
4261 "desc": "ARGEX is an agricultural expert system that gives correct advice to farmers.\ra) True\rb) False\rView Answer",
4262 "ans": "a",
4263 "opt": {
4264 "a": "",
4265 "b": "",
4266 "c": "",
4267 "d": ""
4268 }
4269 },
4270 {
4271 "name": "Question 388",
4272 "desc": "What among the following constitutes to the representation of the knowledge in different forms?",
4273 "ans": "d",
4274 "opt": {
4275 "a": " Relational method where each fact is set out systematically in columns",
4276 "b": " Inheritable knowledge where relational knowledge is made up of objects",
4277 "c": " Inferential knowledge",
4278 "d": " All of the mentioned"
4279 }
4280 },
4281 {
4282 "name": "Question 389",
4283 "desc": "Semantic Networks is",
4284 "ans": "a",
4285 "opt": {
4286 "a": " A way of representing knowledge",
4287 "b": " Data Structure",
4288 "c": " Data Type",
4289 "d": " None of the mentioned"
4290 }
4291 },
4292 {
4293 "name": "Question 390",
4294 "desc": "Graph used to represent semantic network is,",
4295 "ans": "b",
4296 "opt": {
4297 "a": " Undirected graph",
4298 "b": " Directed graph",
4299 "c": " Directed Acyclic graph (DAG)",
4300 "d": " Directed complete graph"
4301 }
4302 },
4303 {
4304 "name": "Question 391",
4305 "desc": "Following are the Semantic Relations used in Semantic Networks.",
4306 "ans": "d",
4307 "opt": {
4308 "a": " Meronymy",
4309 "b": " Holonymy",
4310 "c": " Hyponymy",
4311 "d": " All of the mentioned"
4312 }
4313 },
4314 {
4315 "name": "Question 392",
4316 "desc": "Meronymy relation means,",
4317 "ans": "a",
4318 "opt": {
4319 "a": " A is part of B",
4320 "b": " B has A as a part of itself",
4321 "c": " A is a kind of B",
4322 "d": " A is superordinate of B"
4323 }
4324 },
4325 {
4326 "name": "Question 393",
4327 "desc": "Hypernym relation means,",
4328 "ans": "d",
4329 "opt": {
4330 "a": " A is part of B",
4331 "b": " B has A as a part of itself",
4332 "c": " A is a kind of B",
4333 "d": " A is superordinate of B"
4334 }
4335 },
4336 {
4337 "name": "Question 394",
4338 "desc": "Holonymy relation means,",
4339 "ans": "b",
4340 "opt": {
4341 "a": " A is part of B",
4342 "b": " B has A as a part of itself",
4343 "c": " A is a kind of B",
4344 "d": " A is superordinate of B"
4345 }
4346 },
4347 {
4348 "name": "Question 395",
4349 "desc": "The basic inference mechanism in semantic network is to follow the links between the nodes.\ra) True\rb) False\rView Answer",
4350 "ans": "a",
4351 "opt": {
4352 "a": "",
4353 "b": "",
4354 "c": "",
4355 "d": ""
4356 }
4357 },
4358 {
4359 "name": "Question 396",
4360 "desc": "There exists two way to infer using semantic networks.\r1) Intersection Search\r2) Inheritance Search\ra) True\rb) False\rView Answer",
4361 "ans": "a",
4362 "opt": {
4363 "a": "",
4364 "b": "",
4365 "c": "",
4366 "d": ""
4367 }
4368 },
4369 {
4370 "name": "Question 397",
4371 "desc": "Following is an extension of the semantic network.",
4372 "ans": "d",
4373 "opt": {
4374 "a": " Expert Systems",
4375 "b": " Rule Based Expert Systems",
4376 "c": " Decision Tree Based networks",
4377 "d": " Partitioned Networks"
4378 }
4379 },
4380 {
4381 "name": "Question 398",
4382 "desc": "Basic idea of an partitioned nets is to break network into spaces which consist of groups of nodes and arcs and regard each space as a node.\ra) True\rb) False\rView Answer",
4383 "ans": "a",
4384 "opt": {
4385 "a": "",
4386 "b": "",
4387 "c": "",
4388 "d": ""
4389 }
4390 },
4391 {
4392 "name": "Question 399",
4393 "desc": "Semantic Network represents",
4394 "ans": "b",
4395 "opt": {
4396 "a": " Syntactic relation between concepts",
4397 "b": " Semantic relations between concepts",
4398 "c": " All of the mentioned",
4399 "d": " None of the mentioned"
4400 }
4401 },
4402 {
4403 "name": "Question 400",
4404 "desc": "A semantic network is used when one has knowledge that is best understood as a set of concepts that are related to one another.\ra) True\rb) False\rView Answer",
4405 "ans": "a",
4406 "opt": {
4407 "a": "",
4408 "b": "",
4409 "c": "",
4410 "d": ""
4411 }
4412 },
4413 {
4414 "name": "Question 401",
4415 "desc": "What are the limitations of the semantic networks?",
4416 "ans": "b",
4417 "opt": {
4418 "a": " Intractability",
4419 "b": " Lack in expressing some of the properties",
4420 "c": " Incomplete",
4421 "d": " Has memory constraints"
4422 }
4423 },
4424 {
4425 "name": "Question 402",
4426 "desc": "What among the following is/are the best example of semantic networks?",
4427 "ans": "a",
4428 "opt": {
4429 "a": " Wordnet",
4430 "b": " Human Food Chain",
4431 "c": " MYSIN",
4432 "d": " Autonomous car driver"
4433 }
4434 },
4435 {
4436 "name": "Question 403",
4437 "desc": "Semantic Network is also known as Frame networks.\ra) True\rb) False\rView Answer",
4438 "ans": "a",
4439 "opt": {
4440 "a": "",
4441 "b": "",
4442 "c": "",
4443 "d": ""
4444 }
4445 },
4446 {
4447 "name": "Question 404",
4448 "desc": "Synonymy relation means,",
4449 "ans": "b",
4450 "opt": {
4451 "a": " A is part of B",
4452 "b": " A denotes same as B",
4453 "c": " A is a kind of B",
4454 "d": " A is superordinate of B"
4455 }
4456 },
4457 {
4458 "name": "Question 405",
4459 "desc": "Antonymy relation means,",
4460 "ans": "c",
4461 "opt": {
4462 "a": " A is part of B",
4463 "b": " B has A as a part of itself",
4464 "c": " A denotes opposite of B",
4465 "d": " A is superordinate of B"
4466 }
4467 },
4468 {
4469 "name": "Question 406",
4470 "desc": "Most semantic networks are not cognitive based.\ra) True\rb) False\rView Answer",
4471 "ans": "b",
4472 "opt": {
4473 "a": "",
4474 "b": "",
4475 "c": "",
4476 "d": ""
4477 }
4478 },
4479 {
4480 "name": "Question 407",
4481 "desc": "Frames is",
4482 "ans": "a",
4483 "opt": {
4484 "a": " A way of representing knowledge",
4485 "b": " Data Structure",
4486 "c": " Data Type",
4487 "d": " None of the mentioned"
4488 }
4489 },
4490 {
4491 "name": "Question 408",
4492 "desc": "Frames in artificial intelligence is derived from semantic nets.\ra) True\rb) False\rView Answer",
4493 "ans": "a",
4494 "opt": {
4495 "a": "",
4496 "b": "",
4497 "c": "",
4498 "d": ""
4499 }
4500 },
4501 {
4502 "name": "Question 409",
4503 "desc": "Following are the elements, which constitutes to the frame structure.",
4504 "ans": "a",
4505 "opt": {
4506 "a": " Facts or Data",
4507 "b": " Procedures and default values",
4508 "c": " Frame names",
4509 "d": " Frame reference in hierarchy"
4510 }
4511 },
4512 {
4513 "name": "Question 410",
4514 "desc": "Like semantic networks, frames can be queried using spreading activation.\ra) True\rb) False\rView Answer",
4515 "ans": "a",
4516 "opt": {
4517 "a": "",
4518 "b": "",
4519 "c": "",
4520 "d": ""
4521 }
4522 },
4523 {
4524 "name": "Question 411",
4525 "desc": "Hyponymy relation means,",
4526 "ans": "c",
4527 "opt": {
4528 "a": " A is part of B",
4529 "b": " B has A as a part of itself",
4530 "c": " A is subordinate of B",
4531 "d": " A is superordinate of B"
4532 }
4533 },
4534 {
4535 "name": "Question 412",
4536 "desc": "The basic inference mechanism in semantic network in which knowledge is represented as Frames is to follow the links between the nodes.\ra) True\rb) False\rView Answer",
4537 "ans": "a",
4538 "opt": {
4539 "a": "",
4540 "b": "",
4541 "c": "",
4542 "d": ""
4543 }
4544 },
4545 {
4546 "name": "Question 413",
4547 "desc": "There exists two way to infer using semantic networks in which knowledge is represented as Frames.\r1) Intersection Search\r2) Inheritance Search\ra) True\rb) False\rView Answer",
4548 "ans": "a",
4549 "opt": {
4550 "a": "",
4551 "b": "",
4552 "c": "",
4553 "d": ""
4554 }
4555 },
4556 {
4557 "name": "Question 414",
4558 "desc": "What is the process of capturing inference process as a single inference rule?",
4559 "ans": "c",
4560 "opt": {
4561 "a": " Ponens",
4562 "b": " Clauses",
4563 "c": " Generalized Modus Ponens",
4564 "d": " Variables"
4565 }
4566 },
4567 {
4568 "name": "Question 415",
4569 "desc": "Which process makes different logical expression looks identical?",
4570 "ans": "b",
4571 "opt": {
4572 "a": " Lifting",
4573 "b": " Unification",
4574 "c": " Inference process",
4575 "d": " None of the mentioned"
4576 }
4577 },
4578 {
4579 "name": "Question 416",
4580 "desc": "Which algorithm takes two sentences and returns an unifier?",
4581 "ans": "d",
4582 "opt": {
4583 "a": " Inference",
4584 "b": " Hill-climbing search",
4585 "c": " Depth-first search",
4586 "d": " Unify algorithm"
4587 }
4588 },
4589 {
4590 "name": "Question 417",
4591 "desc": "Which is a lifted version of modus ponens?",
4592 "ans": "a",
4593 "opt": {
4594 "a": " Generalized modus ponens",
4595 "b": " Inference",
4596 "c": " Clauses",
4597 "d": " None of the mentioned"
4598 }
4599 },
4600 {
4601 "name": "Question 418",
4602 "desc": "Which is unique up to renaming of variables?",
4603 "ans": "b",
4604 "opt": {
4605 "a": " Unifier",
4606 "b": " Most general unifier",
4607 "c": " Unifier & Most general unifier",
4608 "d": " None of the mentioned"
4609 }
4610 },
4611 {
4612 "name": "Question 419",
4613 "desc": "Which makes the complexity of the entire algorithm quadratic in the size?",
4614 "ans": "d",
4615 "opt": {
4616 "a": " Clause",
4617 "b": " Inference",
4618 "c": " Resolution",
4619 "d": " Occur check"
4620 }
4621 },
4622 {
4623 "name": "Question 420",
4624 "desc": "How many functions are available in the unification and lifting process?",
4625 "ans": "d",
4626 "opt": {
4627 "a": " 1",
4628 "b": " 2",
4629 "c": " 3",
4630 "d": " 4"
4631 }
4632 },
4633 {
4634 "name": "Question 421",
4635 "desc": "Where did all the facts are stored to implement store and fetch function?",
4636 "ans": "b",
4637 "opt": {
4638 "a": " Database",
4639 "b": " Knowledge base",
4640 "c": " Datamart",
4641 "d": " All of the mentioned"
4642 }
4643 },
4644 {
4645 "name": "Question 422",
4646 "desc": "What is meant by predicate indexing?",
4647 "ans": "a",
4648 "opt": {
4649 "a": " All the one kind of facts in one bucket and another kind in other bucket",
4650 "b": " Acts like index for facts",
4651 "c": " All of the mentioned",
4652 "d": " None of the mentioned"
4653 }
4654 },
4655 {
4656 "name": "Question 423",
4657 "desc": "How the buckets are stored in predicate indexing?",
4658 "ans": "c",
4659 "opt": {
4660 "a": " Lists",
4661 "b": " Stack",
4662 "c": " Hashes",
4663 "d": " None of the mentioned"
4664 }
4665 },
4666 {
4667 "name": "Question 424",
4668 "desc": "The process by which the brain incrementally orders actions needed to complete a specific task is referred as,",
4669 "ans": "b",
4670 "opt": {
4671 "a": " Planning problem",
4672 "b": " Partial order planning",
4673 "c": " Total order planning",
4674 "d": " Both Planning problem & Partial order planning"
4675 }
4676 },
4677 {
4678 "name": "Question 425",
4679 "desc": "To complete any task, the brain needs to plan out the sequence by which to execute the behaviorOne way the brain does this is with a partial-order planState whether true or false.\ra) True\rb) False\rView Answer",
4680 "ans": "a",
4681 "opt": {
4682 "a": "",
4683 "b": "",
4684 "c": "",
4685 "d": ""
4686 }
4687 },
4688 {
4689 "name": "Question 426",
4690 "desc": "In partial order plan.",
4691 "ans": "a",
4692 "opt": {
4693 "a": " Relationships between the actions of the behavior are set prior to the actions",
4694 "b": " Relationships between the actions of the behavior are not set until absolutely necessary",
4695 "c": "oose the correct option.",
4696 "d": " A is true"
4697 }
4698 },
4699 {
4700 "name": "Question 427",
4701 "desc": "Partial-order planning exhibits the Principle of Least Commitment, which contributes to the efficiency of this planning system as a whole.\ra) True\rb) False\rView Answer",
4702 "ans": "a",
4703 "opt": {
4704 "a": "",
4705 "b": "",
4706 "c": "",
4707 "d": ""
4708 }
4709 },
4710 {
4711 "name": "Question 428",
4712 "desc": "Following is/are the components of the partial order planning.",
4713 "ans": "d",
4714 "opt": {
4715 "a": " Bindings",
4716 "b": " Goal",
4717 "c": " Causal Links",
4718 "d": " All of the mentioned"
4719 }
4720 },
4721 {
4722 "name": "Question 429",
4723 "desc": "Partial-order planning is the opposite of total-order planning.\ra) True\rb) False\rView Answer",
4724 "ans": "a",
4725 "opt": {
4726 "a": "",
4727 "b": "",
4728 "c": "",
4729 "d": ""
4730 }
4731 },
4732 {
4733 "name": "Question 430",
4734 "desc": "Sussman Anomaly can be easily and efficiently solved by partial order planning.\ra) True\rb) False\rView Answer",
4735 "ans": "a",
4736 "opt": {
4737 "a": "",
4738 "b": "",
4739 "c": "",
4740 "d": ""
4741 }
4742 },
4743 {
4744 "name": "Question 431",
4745 "desc": "Sussman Anomaly illustrates a weakness of interleaved planning algorithm.\ra) True\rb) False\rView Answer",
4746 "ans": "b",
4747 "opt": {
4748 "a": "",
4749 "b": "",
4750 "c": "",
4751 "d": ""
4752 }
4753 },
4754 {
4755 "name": "Question 432",
4756 "desc": "One the main drawback of this type of planning system is that it requires a lot of computational powers at each node.\ra) True\rb) False\rView Answer",
4757 "ans": "a",
4758 "opt": {
4759 "a": "",
4760 "b": "",
4761 "c": "",
4762 "d": ""
4763 }
4764 },
4765 {
4766 "name": "Question 433",
4767 "desc": "What are you predicating by the logic: _x: �y: loyalto(x, y).",
4768 "ans": "a",
4769 "opt": {
4770 "a": " Everyone is loyal to someone",
4771 "b": " Everyone is loyal to all",
4772 "c": " Everyone is not loyal to someone",
4773 "d": " Everyone is loyal"
4774 }
4775 },
4776 {
4777 "name": "Question 434",
4778 "desc": "A plan that describe how to take actions in levels of increasing refinement and specificity is",
4779 "ans": "d",
4780 "opt": {
4781 "a": " Problem solving",
4782 "b": " Planning",
4783 "c": " Non-hierarchical plan",
4784 "d": " Hierarchical plan"
4785 }
4786 },
4787 {
4788 "name": "Question 435",
4789 "desc": "A constructive approach in which no commitment is made unless it is necessary to do so, is",
4790 "ans": "a",
4791 "opt": {
4792 "a": " Least commitment approach",
4793 "b": " Most commitment approach",
4794 "c": " Nonlinear planning",
4795 "d": " Opportunistic planning"
4796 }
4797 },
4798 {
4799 "name": "Question 436",
4800 "desc": "Uncertainty arises in the Wumpus world because the agent�s sensors give only",
4801 "ans": "c",
4802 "opt": {
4803 "a": " Full & Global information",
4804 "b": " Partial & Global Information",
4805 "c": " Partial & local Information",
4806 "d": " Full & local information"
4807 }
4808 },
4809 {
4810 "name": "Question 437",
4811 "desc": "Which of the following search belongs to totally ordered plan search?",
4812 "ans": "a",
4813 "opt": {
4814 "a": " Forward state-space search",
4815 "b": " Hill-climbing search",
4816 "c": " Depth-first search",
4817 "d": " Breadth-first search"
4818 }
4819 },
4820 {
4821 "name": "Question 438",
4822 "desc": "Which cannot be taken as advantage for totally ordered plan search?",
4823 "ans": "c",
4824 "opt": {
4825 "a": " Composition",
4826 "b": " State search",
4827 "c": " Problem decomposition",
4828 "d": " None of the mentioned"
4829 }
4830 },
4831 {
4832 "name": "Question 439",
4833 "desc": "What is the advantage of totally ordered plan in constructing the plan?",
4834 "ans": "b",
4835 "opt": {
4836 "a": " Reliability",
4837 "b": " Flexibility",
4838 "c": " Easy to use",
4839 "d": " All of the mentioned"
4840 }
4841 },
4842 {
4843 "name": "Question 440",
4844 "desc": "Which strategy is used for delaying a choice during search?",
4845 "ans": "b",
4846 "opt": {
4847 "a": " First commitment",
4848 "b": " Least commitment",
4849 "c": " Both First & Least commitment",
4850 "d": " None of the mentioned"
4851 }
4852 },
4853 {
4854 "name": "Question 441",
4855 "desc": "Which algorithm place two actions into a plan without specifying which should come first?",
4856 "ans": "d",
4857 "opt": {
4858 "a": " Full-order planner",
4859 "b": " Total-order planner",
4860 "c": " Semi-order planner",
4861 "d": " Partial-order planner"
4862 }
4863 },
4864 {
4865 "name": "Question 442",
4866 "desc": "How many possible plans are available in partial-order solution?",
4867 "ans": "d",
4868 "opt": {
4869 "a": " 3",
4870 "b": " 4",
4871 "c": " 5",
4872 "d": " 6"
4873 }
4874 },
4875 {
4876 "name": "Question 443",
4877 "desc": "What is the other name of each and every total-order plans?",
4878 "ans": "b",
4879 "opt": {
4880 "a": " Polarization",
4881 "b": " Linearization",
4882 "c": " Solarization",
4883 "d": " None of the mentioned"
4884 }
4885 },
4886 {
4887 "name": "Question 444",
4888 "desc": "What are present in the empty plan?",
4889 "ans": "d",
4890 "opt": {
4891 "a": " Start",
4892 "b": " Finish",
4893 "c": " Modest",
4894 "d": " Both Start & Finish"
4895 }
4896 },
4897 {
4898 "name": "Question 445",
4899 "desc": "What are not present in start actions?",
4900 "ans": "a",
4901 "opt": {
4902 "a": " Preconditions",
4903 "b": " Effect",
4904 "c": " Finish",
4905 "d": " None of the mentioned"
4906 }
4907 },
4908 {
4909 "name": "Question 446",
4910 "desc": "What are not present in finish actions?",
4911 "ans": "b",
4912 "opt": {
4913 "a": " Preconditions",
4914 "b": " Effect",
4915 "c": " Finish",
4916 "d": " None of the mentioned"
4917 }
4918 },
4919 {
4920 "name": "Question 447",
4921 "desc": "Which can be adapted for planning algorithm?",
4922 "ans": "a",
4923 "opt": {
4924 "a": " Most-constrained variable",
4925 "b": " Most-constrained literal",
4926 "c": " constrained",
4927 "d": " None of the mentioned"
4928 }
4929 },
4930 {
4931 "name": "Question 448",
4932 "desc": "Which data structure is used to give better heuristic estimates?",
4933 "ans": "c",
4934 "opt": {
4935 "a": " Forwards state-space",
4936 "b": " Backward state-space",
4937 "c": " Planning graph algorithm",
4938 "d": " None of the mentioned"
4939 }
4940 },
4941 {
4942 "name": "Question 449",
4943 "desc": "Which is used to extract solution directly from the planning graph?",
4944 "ans": "b",
4945 "opt": {
4946 "a": " Planning algorithm",
4947 "b": " Graphplan",
4948 "c": " Hill-climbing search",
4949 "d": " All of the mentioned"
4950 }
4951 },
4952 {
4953 "name": "Question 450",
4954 "desc": "What are present in the planning graph?",
4955 "ans": "a",
4956 "opt": {
4957 "a": " Sequence of levels",
4958 "b": " Literals",
4959 "c": " Variables",
4960 "d": " Heuristic estimates"
4961 }
4962 },
4963 {
4964 "name": "Question 451",
4965 "desc": "What is the starting level of planning graph?",
4966 "ans": "d",
4967 "opt": {
4968 "a": " Level 3",
4969 "b": " Level 2",
4970 "c": " Level 1",
4971 "d": " Level 0"
4972 }
4973 },
4974 {
4975 "name": "Question 452",
4976 "desc": "What are present in each level of planning graph?",
4977 "ans": "d",
4978 "opt": {
4979 "a": " Literals",
4980 "b": " Actions",
4981 "c": " Variables",
4982 "d": " Both Literals & Actions"
4983 }
4984 },
4985 {
4986 "name": "Question 453",
4987 "desc": "Which kind of problem are suitable for planning graph?",
4988 "ans": "a",
4989 "opt": {
4990 "a": " Propositional planning problem",
4991 "b": " Planning problem",
4992 "c": " Action problem",
4993 "d": " None of the mentioned"
4994 }
4995 },
4996 {
4997 "name": "Question 454",
4998 "desc": "What is meant by persistence actions?",
4999 "ans": "b",
5000 "opt": {
5001 "a": " Allow a literal to remain false",
5002 "b": " Allow a literal to remain true",
5003 "c": " Allow a literal to remain false & true",
5004 "d": " None of the mentioned"
5005 }
5006 },
5007 {
5008 "name": "Question 455",
5009 "desc": "When will further expansion is unnecessary for planning graph?",
5010 "ans": "a",
5011 "opt": {
5012 "a": " Identical",
5013 "b": " Replicate",
5014 "c": " Not identical",
5015 "d": " None of the mentioned"
5016 }
5017 },
5018 {
5019 "name": "Question 456",
5020 "desc": "How many conditions are available between two actions in mutex relation?",
5021 "ans": "c",
5022 "opt": {
5023 "a": " 1",
5024 "b": " 2",
5025 "c": " 3",
5026 "d": " 4"
5027 }
5028 },
5029 {
5030 "name": "Question 457",
5031 "desc": "What is called inconsistent support?",
5032 "ans": "b",
5033 "opt": {
5034 "a": " If two literals are not negation of other",
5035 "b": " If two literals are negation of other",
5036 "c": " Mutually exclusive",
5037 "d": " None of the mentioned"
5038 }
5039 },
5040 {
5041 "name": "Question 458",
5042 "desc": "The process by which the brain orders actions needed to complete a specific task is referred as,",
5043 "ans": "d",
5044 "opt": {
5045 "a": " Planning problem",
5046 "b": " Partial order planning",
5047 "c": " Total order planning",
5048 "d": " Both Planning problem & Partial order planning"
5049 }
5050 },
5051 {
5052 "name": "Question 459",
5053 "desc": "The famous spare tire problem or Scheduling classes for bunch of students or Air cargo transport are the best example of",
5054 "ans": "a",
5055 "opt": {
5056 "a": " Planning problem",
5057 "b": " Partial Order planning problem",
5058 "c": " Total order planning",
5059 "d": " None of the mentioned"
5060 }
5061 },
5062 {
5063 "name": "Question 460",
5064 "desc": "To eliminate the inaccuracy problem in planning problem or partial order planning problem we can use ___________________ data structure/s.",
5065 "ans": "d",
5066 "opt": {
5067 "a": " Stacks",
5068 "b": " Queue",
5069 "c": " BST (Binary Search Tree)",
5070 "d": " Planning Graphs"
5071 }
5072 },
5073 {
5074 "name": "Question 461",
5075 "desc": "Planning graphs consists of",
5076 "ans": "b",
5077 "opt": {
5078 "a": " a sequence of levels",
5079 "b": " a sequence of levels which corresponds to time steps in the plan",
5080 "c": " a sequence of actions which corresponds to the state of the system",
5081 "d": " none of the mentioned"
5082 }
5083 },
5084 {
5085 "name": "Question 462",
5086 "desc": "Planning graphs works only for prepositional planning problems.\ra) True\rb) False\rView Answer",
5087 "ans": "a",
5088 "opt": {
5089 "a": "",
5090 "b": "",
5091 "c": "",
5092 "d": ""
5093 }
5094 },
5095 {
5096 "name": "Question 463",
5097 "desc": "_____________ algorithms is used to extract the plan directly from the planning graph, rather than using graph to provide heuristic.",
5098 "ans": "c",
5099 "opt": {
5100 "a": " BFS/DFS",
5101 "b": " A*",
5102 "c": " Graph-Plan",
5103 "d": " Greedy"
5104 }
5105 },
5106 {
5107 "name": "Question 464",
5108 "desc": "Planning problem can be described as a propositional logic.\ra) True\rb) False\rView Answer",
5109 "ans": "a",
5110 "opt": {
5111 "a": "",
5112 "b": "",
5113 "c": "",
5114 "d": ""
5115 }
5116 },
5117 {
5118 "name": "Question 465",
5119 "desc": "What is the other name of each plan resulted in partial order planning?",
5120 "ans": "b",
5121 "opt": {
5122 "a": " Polarization",
5123 "b": " Linearization",
5124 "c": " Solarization",
5125 "d": " None of the mentioned"
5126 }
5127 },
5128 {
5129 "name": "Question 466",
5130 "desc": "Planning problem combines the two major aspects of AI",
5131 "ans": "a",
5132 "opt": {
5133 "a": " Search & Logic",
5134 "b": " Logic & Knowledge Based Systems",
5135 "c": " FOL & Logic",
5136 "d": " Knowledge Based Systems"
5137 }
5138 },
5139 {
5140 "name": "Question 467",
5141 "desc": "__________ algorithm translates a planning problem in to prepositional axioms.",
5142 "ans": "b",
5143 "opt": {
5144 "a": " GraphPlan",
5145 "b": " SatPlan",
5146 "c": " Greedy",
5147 "d": " None of the mentioned"
5148 }
5149 },
5150 {
5151 "name": "Question 468",
5152 "desc": "____________ planning allows the agent to take advice from the domain designer in the form of decomposition rules.",
5153 "ans": "b",
5154 "opt": {
5155 "a": " GraphPlan",
5156 "b": " Hierarchical task network (HTN)",
5157 "c": " SatPlan",
5158 "d": " None of the mentioned"
5159 }
5160 },
5161 {
5162 "name": "Question 469",
5163 "desc": "Standard planning algorithms assumes environment to be",
5164 "ans": "a",
5165 "opt": {
5166 "a": " Deterministic",
5167 "b": " Fully observable",
5168 "c": " Single agent",
5169 "d": " Stochastic"
5170 }
5171 },
5172 {
5173 "name": "Question 470",
5174 "desc": "Conditional Plans allows the agent to sense the world during execution to decide what branch of plan to follow.\ra) True\rb) False\rView Answer",
5175 "ans": "a",
5176 "opt": {
5177 "a": "",
5178 "b": "",
5179 "c": "",
5180 "d": ""
5181 }
5182 },
5183 {
5184 "name": "Question 471",
5185 "desc": "A re planning agent uses execution monitoring and splices in repairs as needed.\ra) True\rb) False\rView Answer",
5186 "ans": "a",
5187 "opt": {
5188 "a": "",
5189 "b": "",
5190 "c": "",
5191 "d": ""
5192 }
5193 },
5194 {
5195 "name": "Question 472",
5196 "desc": "Incorrect information results in unsatisfied preconditions for actions and plans _____________ detects violations of the preconditions for successful completion of the plan.",
5197 "ans": "c",
5198 "opt": {
5199 "a": " Conditional Plan",
5200 "b": " Conformant Planning",
5201 "c": " Execution monitoring",
5202 "d": " Both Conditional Plan & Execution monitoring"
5203 }
5204 },
5205 {
5206 "name": "Question 473",
5207 "desc": "Using logic to represent and reason we can represent knowledge about the world with facts and rules.\ra) True\rb) False\rView Answer",
5208 "ans": "a",
5209 "opt": {
5210 "a": "",
5211 "b": "",
5212 "c": "",
5213 "d": ""
5214 }
5215 },
5216 {
5217 "name": "Question 474",
5218 "desc": "Uncertainty arises in the wumpus world because the agent�s sensors give only",
5219 "ans": "c",
5220 "opt": {
5221 "a": " Full & Global information",
5222 "b": " Partial & Global Information",
5223 "c": " Partial & local Information",
5224 "d": " Full & local information"
5225 }
5226 },
5227 {
5228 "name": "Question 475",
5229 "desc": "A Hybrid Bayesian network contains",
5230 "ans": "a",
5231 "opt": {
5232 "a": " Both discrete and continuous variables",
5233 "b": " Only Discrete variables",
5234 "c": " Only Discontinuous variable",
5235 "d": " Both Discrete and Discontinuous variable"
5236 }
5237 },
5238 {
5239 "name": "Question 476",
5240 "desc": "How is Fuzzy Logic different from conventional control methods?",
5241 "ans": "a",
5242 "opt": {
5243 "a": " IF and THEN Approach",
5244 "b": " FOR Approach",
5245 "c": " WHILE Approach",
5246 "d": " DO Approach"
5247 }
5248 },
5249 {
5250 "name": "Question 477",
5251 "desc": "If a hypothesis says it should be positive, but in fact it is negative, we call it",
5252 "ans": "c",
5253 "opt": {
5254 "a": " A consistent hypothesis",
5255 "b": " A false negative hypothesis",
5256 "c": " A false positive hypothesis",
5257 "d": " A specialized hypothesis"
5258 }
5259 },
5260 {
5261 "name": "Question 478",
5262 "desc": "The primitives in probabilistic reasoning are random variables.\ra) True\rb) False\rView Answer",
5263 "ans": "a",
5264 "opt": {
5265 "a": "",
5266 "b": "",
5267 "c": "",
5268 "d": ""
5269 }
5270 },
5271 {
5272 "name": "Question 479",
5273 "desc": "Which is true for Decision theory?",
5274 "ans": "c",
5275 "opt": {
5276 "a": " Decision Theory = Probability theory + utility theory",
5277 "b": " Decision Theory = Inference theory + utility theory",
5278 "c": " Decision Theory = Uncertainty + utility theory",
5279 "d": " Decision Theory = Probability theory + preference"
5280 }
5281 },
5282 {
5283 "name": "Question 480",
5284 "desc": "A constructive approach in which no commitment is made unless it is necessary to do so, is",
5285 "ans": "a",
5286 "opt": {
5287 "a": " Least commitment approach",
5288 "b": " Most commitment approach",
5289 "c": " Nonlinear planning",
5290 "d": " Opportunistic planning"
5291 }
5292 },
5293 {
5294 "name": "Question 481",
5295 "desc": "What is the extraction of the meaning of utterance?",
5296 "ans": "b",
5297 "opt": {
5298 "a": " Syntactic",
5299 "b": " Semantic",
5300 "c": " Pragmatic",
5301 "d": " None of the mentioned"
5302 }
5303 },
5304 {
5305 "name": "Question 482",
5306 "desc": "What is the process of associating an FOL expression with a phrase?",
5307 "ans": "c",
5308 "opt": {
5309 "a": " Interpretation",
5310 "b": " Augmented reality",
5311 "c": " Semantic interpretation",
5312 "d": " Augmented interpretation"
5313 }
5314 },
5315 {
5316 "name": "Question 483",
5317 "desc": "What is meant by compositional semantics?",
5318 "ans": "a",
5319 "opt": {
5320 "a": " Determining the meaning",
5321 "b": " Logical connectives",
5322 "c": " Semantics",
5323 "d": " None of the mentioned"
5324 }
5325 },
5326 {
5327 "name": "Question 484",
5328 "desc": "What is used to augment a grammar for arithmetic expression with semantics?",
5329 "ans": "b",
5330 "opt": {
5331 "a": " Notation",
5332 "b": " DCG notation",
5333 "c": " Constituent",
5334 "d": " All of the mentioned"
5335 }
5336 },
5337 {
5338 "name": "Question 485",
5339 "desc": "What can�t be done in the semantic interpretation?",
5340 "ans": "c",
5341 "opt": {
5342 "a": " Logical term",
5343 "b": " Complete logical sentence",
5344 "c": " Both Logical term & Complete logical sentence",
5345 "d": " None of the mentioned"
5346 }
5347 },
5348 {
5349 "name": "Question 486",
5350 "desc": "How many verb tenses are there in english language?",
5351 "ans": "c",
5352 "opt": {
5353 "a": " 1",
5354 "b": " 2",
5355 "c": " 3",
5356 "d": " 4"
5357 }
5358 },
5359 {
5360 "name": "Question 487",
5361 "desc": "Which is used to mediate between syntax and semantics?",
5362 "ans": "b",
5363 "opt": {
5364 "a": " Form",
5365 "b": " Intermediate form",
5366 "c": " Grammer",
5367 "d": " All of the mentioned"
5368 }
5369 },
5370 {
5371 "name": "Question 488",
5372 "desc": "What is meant by quasi-logical form?",
5373 "ans": "a",
5374 "opt": {
5375 "a": " Sits between syntactic and logical form",
5376 "b": " Logical connectives",
5377 "c": " All of the mentioned",
5378 "d": " None of the mentioned"
5379 }
5380 },
5381 {
5382 "name": "Question 489",
5383 "desc": "How many types of quantification are available in artificial intelligence?",
5384 "ans": "b",
5385 "opt": {
5386 "a": " 1",
5387 "b": " 2",
5388 "c": " 3",
5389 "d": " 4"
5390 }
5391 },
5392 {
5393 "name": "Question 490",
5394 "desc": "What kind of interpretation is done by adding context-dependant information?",
5395 "ans": "c",
5396 "opt": {
5397 "a": " Semantic",
5398 "b": " Syntactic",
5399 "c": " Pragmatic",
5400 "d": " None of the mentioned"
5401 }
5402 },
5403 {
5404 "name": "Question 491",
5405 "desc": "What enables people to recognize people, animals and inanimate objects reliably?",
5406 "ans": "b",
5407 "opt": {
5408 "a": " Speech",
5409 "b": " Vision",
5410 "c": " Hear",
5411 "d": " Perception"
5412 }
5413 },
5414 {
5415 "name": "Question 492",
5416 "desc": "How many types of recognition are there in artificial intelligence?",
5417 "ans": "c",
5418 "opt": {
5419 "a": " 1",
5420 "b": " 2",
5421 "c": " 3",
5422 "d": " 4"
5423 }
5424 },
5425 {
5426 "name": "Question 493",
5427 "desc": "Which are recognized by vision?",
5428 "ans": "d",
5429 "opt": {
5430 "a": " Objects",
5431 "b": " Activities",
5432 "c": " Motion",
5433 "d": " Both Objects & Activities"
5434 }
5435 },
5436 {
5437 "name": "Question 494",
5438 "desc": "Which provides a framework for studying object recognition?",
5439 "ans": "c",
5440 "opt": {
5441 "a": " Learning",
5442 "b": " Unsupervised learning",
5443 "c": " Supervised learning",
5444 "d": " None of the mentioned"
5445 }
5446 },
5447 {
5448 "name": "Question 495",
5449 "desc": "Which object recognition process is an error-prone process?",
5450 "ans": "a",
5451 "opt": {
5452 "a": " Bottom-up segmentation",
5453 "b": " Top-down segmentation",
5454 "c": " Both Bottom-up & Top-down segmentation",
5455 "d": " None of the mentioned"
5456 }
5457 },
5458 {
5459 "name": "Question 496",
5460 "desc": "Which is the only way to learn about the different kinds of human faces?",
5461 "ans": "c",
5462 "opt": {
5463 "a": " Perception",
5464 "b": " Speech",
5465 "c": " Learning",
5466 "d": " Hearing"
5467 }
5468 },
5469 {
5470 "name": "Question 497",
5471 "desc": "What can be represented by using histograms or empirical frequency distributions?",
5472 "ans": "d",
5473 "opt": {
5474 "a": " Words",
5475 "b": " Color",
5476 "c": " Texture",
5477 "d": " Both Color & Texture"
5478 }
5479 },
5480 {
5481 "name": "Question 498",
5482 "desc": "Which can be deformed into alignment using simple coordinate transformations?",
5483 "ans": "b",
5484 "opt": {
5485 "a": " Matching",
5486 "b": " Deformable matching",
5487 "c": " Feature",
5488 "d": " All of the mentioned"
5489 }
5490 },
5491 {
5492 "name": "Question 499",
5493 "desc": "Which describes the coarse arrangement of the rest of the shape with respect to the point?",
5494 "ans": "c",
5495 "opt": {
5496 "a": " Shape",
5497 "b": " Context",
5498 "c": " Shape context",
5499 "d": " None of the mentioned"
5500 }
5501 },
5502 {
5503 "name": "Question 500",
5504 "desc": "How the distance between two shapes can be defined?",
5505 "ans": "a",
5506 "opt": {
5507 "a": " Weighted sum of the shape",
5508 "b": " Size of the shape",
5509 "c": " Shape context",
5510 "d": " None of the mentioned"
5511 }
5512 },
5513 {
5514 "name": "Question 501",
5515 "desc": "How many issues are available in describing degree of belief?",
5516 "ans": "b",
5517 "opt": {
5518 "a": " 1",
5519 "b": " 2",
5520 "c": " 3",
5521 "d": " 4"
5522 }
5523 },
5524 {
5525 "name": "Question 502",
5526 "desc": "What is used for probability theory sentences?",
5527 "ans": "c",
5528 "opt": {
5529 "a": " Conditional logic",
5530 "b": " Logic",
5531 "c": " Extension of propositional logic",
5532 "d": " None of the mentioned"
5533 }
5534 },
5535 {
5536 "name": "Question 503",
5537 "desc": "Where does the dependance of experience is reflected in prior probability sentences?",
5538 "ans": "a",
5539 "opt": {
5540 "a": " Syntactic distinction",
5541 "b": " Semantic distinction",
5542 "c": " Both Syntactic & Semantic distinction",
5543 "d": " None of the mentioned"
5544 }
5545 },
5546 {
5547 "name": "Question 504",
5548 "desc": "Where does the degree of belief are applied?",
5549 "ans": "a",
5550 "opt": {
5551 "a": " Propositions",
5552 "b": " Literals",
5553 "c": " Variables",
5554 "d": " Statements"
5555 }
5556 },
5557 {
5558 "name": "Question 505",
5559 "desc": "How many formal languages are used for stating propositions?",
5560 "ans": "b",
5561 "opt": {
5562 "a": " 1",
5563 "b": " 2",
5564 "c": " 3",
5565 "d": " 4"
5566 }
5567 },
5568 {
5569 "name": "Question 506",
5570 "desc": "What is the basic element for a language?",
5571 "ans": "c",
5572 "opt": {
5573 "a": " Literal",
5574 "b": " Variable",
5575 "c": " Random variable",
5576 "d": " All of the mentioned"
5577 }
5578 },
5579 {
5580 "name": "Question 507",
5581 "desc": "How many types of random variables are available?",
5582 "ans": "c",
5583 "opt": {
5584 "a": " 1",
5585 "b": " 2",
5586 "c": " 3",
5587 "d": " 4"
5588 }
5589 },
5590 {
5591 "name": "Question 508",
5592 "desc": "Which is the complete specification of the state of the world?",
5593 "ans": "a",
5594 "opt": {
5595 "a": " Atomic event",
5596 "b": " Complex event",
5597 "c": " Simple event",
5598 "d": " None of the mentioned"
5599 }
5600 },
5601 {
5602 "name": "Question 509",
5603 "desc": "Which variable cannot be written in entire distribution as a table?",
5604 "ans": "b",
5605 "opt": {
5606 "a": " Discrete",
5607 "b": " Continuous",
5608 "c": " Both Discrete & Continuous",
5609 "d": " None of the mentioned"
5610 }
5611 },
5612 {
5613 "name": "Question 510",
5614 "desc": "What is meant by probability density function?",
5615 "ans": "d",
5616 "opt": {
5617 "a": " Probability distributions",
5618 "b": " Continuous variable",
5619 "c": " Discrete variable",
5620 "d": " Probability distributions for Continuous variables"
5621 }
5622 },
5623 {
5624 "name": "Question 511",
5625 "desc": "How many terms are required for building a bayes model?",
5626 "ans": "c",
5627 "opt": {
5628 "a": " 1",
5629 "b": " 2",
5630 "c": " 3",
5631 "d": " 4"
5632 }
5633 },
5634 {
5635 "name": "Question 512",
5636 "desc": "What is needed to make probabilistic systems feasible in the world?",
5637 "ans": "b",
5638 "opt": {
5639 "a": " Reliability",
5640 "b": " Crucial robustness",
5641 "c": " Feasibility",
5642 "d": " None of the mentioned"
5643 }
5644 },
5645 {
5646 "name": "Question 513",
5647 "desc": "Where does the bayes rule can be used?",
5648 "ans": "d",
5649 "opt": {
5650 "a": " Solving queries",
5651 "b": " Increasing complexity",
5652 "c": " Decreasing complexity",
5653 "d": " Answering probabilistic query"
5654 }
5655 },
5656 {
5657 "name": "Question 514",
5658 "desc": "What does the bayesian network provides?",
5659 "ans": "a",
5660 "opt": {
5661 "a": " Complete description of the domain",
5662 "b": " Partial description of the domain",
5663 "c": " Complete description of the problem",
5664 "d": " None of the mentioned"
5665 }
5666 },
5667 {
5668 "name": "Question 515",
5669 "desc": "How the entries in the full joint probability distribution can be calculated?",
5670 "ans": "b",
5671 "opt": {
5672 "a": " Using variables",
5673 "b": " Using information",
5674 "c": " Both Using variables & information",
5675 "d": " None of the mentioned"
5676 }
5677 },
5678 {
5679 "name": "Question 516",
5680 "desc": "How the bayesian network can be used to answer any query?",
5681 "ans": "b",
5682 "opt": {
5683 "a": " Full distribution",
5684 "b": " Joint distribution",
5685 "c": " Partial distribution",
5686 "d": " All of the mentioned"
5687 }
5688 },
5689 {
5690 "name": "Question 517",
5691 "desc": "How the compactness of the bayesian network can be described?",
5692 "ans": "a",
5693 "opt": {
5694 "a": " Locally structured",
5695 "b": " Fully structured",
5696 "c": " Partial structure",
5697 "d": " All of the mentioned"
5698 }
5699 },
5700 {
5701 "name": "Question 518",
5702 "desc": "To which does the local structure is associated?",
5703 "ans": "c",
5704 "opt": {
5705 "a": " Hybrid",
5706 "b": " Dependant",
5707 "c": " Linear",
5708 "d": " None of the mentioned"
5709 }
5710 },
5711 {
5712 "name": "Question 519",
5713 "desc": "Which condition is used to influence a variable directly by all the others?",
5714 "ans": "b",
5715 "opt": {
5716 "a": " Partially connected",
5717 "b": " Fully connected",
5718 "c": " Local connected",
5719 "d": " None of the mentioned"
5720 }
5721 },
5722 {
5723 "name": "Question 520",
5724 "desc": "What is the consequence between a node and its predecessors while creating bayesian network?",
5725 "ans": "c",
5726 "opt": {
5727 "a": " Functionally dependent",
5728 "b": " Dependant",
5729 "c": " Conditionally independent",
5730 "d": " Both Conditionally dependant & Dependant"
5731 }
5732 },
5733 {
5734 "name": "Question 521",
5735 "desc": "Fuzzy logic is a form of",
5736 "ans": "c",
5737 "opt": {
5738 "a": " Two-valued logic",
5739 "b": " Crisp set logic",
5740 "c": " Many-valued logic",
5741 "d": " Binary set logic"
5742 }
5743 },
5744 {
5745 "name": "Question 522",
5746 "desc": "Traditional set theory is also known as Crisp Set theory.\ra) True\rb) False\rView Answer",
5747 "ans": "a",
5748 "opt": {
5749 "a": "",
5750 "b": "",
5751 "c": "",
5752 "d": ""
5753 }
5754 },
5755 {
5756 "name": "Question 523",
5757 "desc": "The truth values of traditional set theory is ____________ and that of fuzzy set is __________",
5758 "ans": "a",
5759 "opt": {
5760 "a": " Either 0 or 1, between 0 & 1",
5761 "b": " Between 0 & 1, either 0 or 1",
5762 "c": " Between 0 & 1, between 0 & 1",
5763 "d": " Either 0 or 1, either 0 or 1"
5764 }
5765 },
5766 {
5767 "name": "Question 524",
5768 "desc": "Fuzzy logic is extension of Crisp set with an extension of handling the concept of Partial Truth.\ra) True\rb) False\rView Answer",
5769 "ans": "a",
5770 "opt": {
5771 "a": "",
5772 "b": "",
5773 "c": "",
5774 "d": ""
5775 }
5776 },
5777 {
5778 "name": "Question 525",
5779 "desc": "The room temperature is hotHere the hot (use of linguistic variable is used) can be represented by _______",
5780 "ans": "a",
5781 "opt": {
5782 "a": " Fuzzy Set",
5783 "b": " Crisp Set",
5784 "c": " Fuzzy & Crisp Set",
5785 "d": " None of the mentioned"
5786 }
5787 },
5788 {
5789 "name": "Question 526",
5790 "desc": "The values of the set membership is represented by",
5791 "ans": "b",
5792 "opt": {
5793 "a": " Discrete Set",
5794 "b": " Degree of truth",
5795 "c": " Probabilities",
5796 "d": " Both Degree of truth & Probabilities"
5797 }
5798 },
5799 {
5800 "name": "Question 527",
5801 "desc": "Japanese were the first to utilize fuzzy logic practically on high-speed trains in Sendai.\ra) True\rb) False\rView Answer",
5802 "ans": "a",
5803 "opt": {
5804 "a": "",
5805 "b": "",
5806 "c": "",
5807 "d": ""
5808 }
5809 },
5810 {
5811 "name": "Question 528",
5812 "desc": "Fuzzy Set theory defines fuzzy operatorsChoose the fuzzy operators from the following.",
5813 "ans": "d",
5814 "opt": {
5815 "a": " AND",
5816 "b": " OR",
5817 "c": " NOT",
5818 "d": " All of the mentioned"
5819 }
5820 },
5821 {
5822 "name": "Question 529",
5823 "desc": "There are also other operators, more linguistic in nature, called __________ that can be applied to fuzzy set theory.",
5824 "ans": "a",
5825 "opt": {
5826 "a": " Hedges",
5827 "b": " Lingual Variable",
5828 "c": " Fuzz Variable",
5829 "d": " None of the mentioned"
5830 }
5831 },
5832 {
5833 "name": "Question 530",
5834 "desc": "Fuzzy logic is usually represented as",
5835 "ans": "b",
5836 "opt": {
5837 "a": " IF-THEN-ELSE rules",
5838 "b": " IF-THEN rules",
5839 "c": " Both IF-THEN-ELSE rules & IF-THEN rules",
5840 "d": " None of the mentioned"
5841 }
5842 },
5843 {
5844 "name": "Question 531",
5845 "desc": "Like relational databases there does exists fuzzy relational databases.\ra) True\rb) False\rView Answer",
5846 "ans": "a",
5847 "opt": {
5848 "a": "",
5849 "b": "",
5850 "c": "",
5851 "d": ""
5852 }
5853 },
5854 {
5855 "name": "Question 532",
5856 "desc": "______________ is/are the way/s to represent uncertainty.",
5857 "ans": "d",
5858 "opt": {
5859 "a": " Fuzzy Logic",
5860 "b": " Probability",
5861 "c": " Entropy",
5862 "d": " All of the mentioned"
5863 }
5864 },
5865 {
5866 "name": "Question 533",
5867 "desc": "____________ are algorithms that learn from their more complex environments (hence eco) to generalize, approximate and simplify solution logic.",
5868 "ans": "c",
5869 "opt": {
5870 "a": " Fuzzy Relational DB",
5871 "b": " Ecorithms",
5872 "c": " Fuzzy Set",
5873 "d": " None of the mentioned"
5874 }
5875 },
5876 {
5877 "name": "Question 534",
5878 "desc": "Which algorithm is used for solving temporal probabilistic reasoning?",
5879 "ans": "b",
5880 "opt": {
5881 "a": " Hill-climbing search",
5882 "b": " Hidden markov model",
5883 "c": " Depth-first search",
5884 "d": " Breadth-first search"
5885 }
5886 },
5887 {
5888 "name": "Question 535",
5889 "desc": " How does the state of the process is described in HMM?",
5890 "ans": "c",
5891 "opt": {
5892 "a": " Literal",
5893 "b": " Single random variable",
5894 "c": " Single discrete random variable",
5895 "d": " None of the mentioned"
5896 }
5897 },
5898 {
5899 "name": "Question 536",
5900 "desc": "What are the possible values of the variable?",
5901 "ans": "d",
5902 "opt": {
5903 "a": " Variables",
5904 "b": " Literals",
5905 "c": " Discrete variable",
5906 "d": " Possible states of the world"
5907 }
5908 },
5909 {
5910 "name": "Question 537",
5911 "desc": "Where does the additional variables are added in HMM?",
5912 "ans": "a",
5913 "opt": {
5914 "a": " Temporal model",
5915 "b": " Reality model",
5916 "c": " Probability model",
5917 "d": " All of the mentioned"
5918 }
5919 },
5920 {
5921 "name": "Question 538",
5922 "desc": "Which allows for a simple and matrix implementation of all the basic algorithm?",
5923 "ans": "b",
5924 "opt": {
5925 "a": " HMM",
5926 "b": " Restricted structure of HMM",
5927 "c": " Temporary model",
5928 "d": " Reality model"
5929 }
5930 },
5931 {
5932 "name": "Question 539",
5933 "desc": "Where does the Hidden Markov Model is used?",
5934 "ans": "a",
5935 "opt": {
5936 "a": " Speech recognition",
5937 "b": " Understanding of real world",
5938 "c": " Both Speech recognition & Understanding of real world",
5939 "d": " None of the mentioned"
5940 }
5941 },
5942 {
5943 "name": "Question 540",
5944 "desc": "Which variable can give the concrete form to the representation of the",
5945 "ans": "d",
5946 "opt": {
5947 "a": "ansition model?",
5948 "b": " Single variable",
5949 "c": " Discrete state variable",
5950 "d": " Random variable"
5951 }
5952 },
5953 {
5954 "name": "Question 541",
5955 "desc": "Which algorithm works by first running the standard forward pass to compute?",
5956 "ans": "b",
5957 "opt": {
5958 "a": " Smoothing",
5959 "b": " Modified smoothing",
5960 "c": " HMM",
5961 "d": " Depth-first search algorithm"
5962 }
5963 },
5964 {
5965 "name": "Question 542",
5966 "desc": "Which reveals an improvement in online smoothing?",
5967 "ans": "a",
5968 "opt": {
5969 "a": " Matrix formulation",
5970 "b": " Revelation",
5971 "c": " HMM",
5972 "d": " None of the mentioned"
5973 }
5974 },
5975 {
5976 "name": "Question 543",
5977 "desc": "Which suggests the existence of efficient recursive algorithm for online smoothing?",
5978 "ans": "b",
5979 "opt": {
5980 "a": " Matrix",
5981 "b": " Constant space",
5982 "c": " Constant time",
5983 "d": " None of the mentioned"
5984 }
5985 },
5986 {
5987 "name": "Question 544",
5988 "desc": "In LISP, the function returns t if <integer> is even and nil otherwise:",
5989 "ans": "a",
5990 "opt": {
5991 "a": " (evenp <integer>)",
5992 "b": " (even <integer>)",
5993 "c": " (numeven <integer>)",
5994 "d": " (numnevenp <integer>)"
5995 }
5996 },
5997 {
5998 "name": "Question 545",
5999 "desc": "Which of the following is an advantage of using an expert system development tool?",
6000 "ans": "d",
6001 "opt": {
6002 "a": " imposed structure",
6003 "b": " knowledge engineering assistance",
6004 "c": " rapid prototyping",
6005 "d": " all of the mentioned"
6006 }
6007 },
6008 {
6009 "name": "Question 546",
6010 "desc": "An AI system developed by Daniel Bobrow to read and solve algebra word problems",
6011 "ans": "d",
6012 "opt": {
6013 "a": " SHRDLU",
6014 "b": " SIMD",
6015 "c": " BACON",
6016 "d": " STUDENT"
6017 }
6018 },
6019 {
6020 "name": "Question 547",
6021 "desc": "The �Turing Machine� showed that you could use a/an _____ system to program any algorithmic task.",
6022 "ans": "a",
6023 "opt": {
6024 "a": " binary",
6025 "b": " electro-chemical",
6026 "c": " recursive",
6027 "d": " semantic"
6028 }
6029 },
6030 {
6031 "name": "Question 548",
6032 "desc": "MCC is investigating the improvement of the relationship between people and computers through a technology called:",
6033 "ans": "b",
6034 "opt": {
6035 "a": " computer-aided design",
6036 "b": " human factors",
6037 "c": " parallel processing",
6038 "d": " all of the mentioned"
6039 }
6040 },
6041 {
6042 "name": "Question 549",
6043 "desc": "The first widely-used commercial form of Artificial Intelligence (Al) is being used in many popular products like microwave ovens, automobiles and plug in circuit boards for desktop PCsIt allows machines to handle vague information with a deftness that mimics human intuitionWhat is the name of this Artificial Intelligence?",
6044 "ans": "c",
6045 "opt": {
6046 "a": " Boolean logic",
6047 "b": " Human logic",
6048 "c": " Fuzzy logic",
6049 "d": " Functional logic"
6050 }
6051 },
6052 {
6053 "name": "Question 550",
6054 "desc": "In his landmark book Cybernetics, Norbert Wiener suggested a way of modeling scientific phenomena using not energy, but:",
6055 "ans": "c",
6056 "opt": {
6057 "a": " mathematics",
6058 "b": " intelligence",
6059 "c": " information",
6060 "d": " history"
6061 }
6062 },
6063 {
6064 "name": "Question 551",
6065 "desc": "Input segments of AI programming contain(s)",
6066 "ans": "d",
6067 "opt": {
6068 "a": " sound",
6069 "b": " smell",
6070 "c": " touch",
6071 "d": " None of the mentioned"
6072 }
6073 },
6074 {
6075 "name": "Question 552",
6076 "desc": "The applications in the Strategic Computing Program include:",
6077 "ans": "d",
6078 "opt": {
6079 "a": " battle management",
6080 "b": " autonomous systems",
6081 "c": " pilot�s associate",
6082 "d": " all of the mentioned"
6083 }
6084 },
6085 {
6086 "name": "Question 553",
6087 "desc": "In LISP, the function evaluates <object> and assigns this value to the unevaluated <sconst>.",
6088 "ans": "b",
6089 "opt": {
6090 "a": " (constant <sconst> <object>)",
6091 "b": " (defconstant <sconst> <object>)",
6092 "c": " (eva <sconst> <object>)",
6093 "d": " (eva <object> <sconst>)"
6094 }
6095 },
6096 {
6097 "name": "Question 554",
6098 "desc": "What will take place as the agent observes its interactions with the world?",
6099 "ans": "a",
6100 "opt": {
6101 "a": " Learning",
6102 "b": " Hearing",
6103 "c": " Perceiving",
6104 "d": " Speech"
6105 }
6106 },
6107 {
6108 "name": "Question 555",
6109 "desc": "Which modifies the performance element so that it makes better decision?",
6110 "ans": "c",
6111 "opt": {
6112 "a": " Performance element",
6113 "b": " Changing element",
6114 "c": " Learning element",
6115 "d": " None of the mentioned"
6116 }
6117 },
6118 {
6119 "name": "Question 556",
6120 "desc": "How many things are concerned in design of a learning element?",
6121 "ans": "c",
6122 "opt": {
6123 "a": " 1",
6124 "b": " 2",
6125 "c": " 3",
6126 "d": " 4"
6127 }
6128 },
6129 {
6130 "name": "Question 557",
6131 "desc": "What is used in determining the nature of the learning problem?",
6132 "ans": "b",
6133 "opt": {
6134 "a": " Environment",
6135 "b": " Feedback",
6136 "c": " Problem",
6137 "d": " All of the mentioned"
6138 }
6139 },
6140 {
6141 "name": "Question 558",
6142 "desc": "How many types are available in machine learning?",
6143 "ans": "c",
6144 "opt": {
6145 "a": " 1",
6146 "b": " 2",
6147 "c": " 3",
6148 "d": " 4"
6149 }
6150 },
6151 {
6152 "name": "Question 559",
6153 "desc": "Which is used for utility functions in game playing algorithm?",
6154 "ans": "d",
6155 "opt": {
6156 "a": " Linear polynomial",
6157 "b": " Weighted polynomial",
6158 "c": " Polynomial",
6159 "d": " Linear weighted polynomial"
6160 }
6161 },
6162 {
6163 "name": "Question 560",
6164 "desc": "Which is used to choose among multiple consistent hypotheses?",
6165 "ans": "b",
6166 "opt": {
6167 "a": " Razor",
6168 "b": " Ockham razor",
6169 "c": " Learning element",
6170 "d": " None of the mentioned"
6171 }
6172 },
6173 {
6174 "name": "Question 561",
6175 "desc": "What will happen if the hypothesis space contains the true function?",
6176 "ans": "b",
6177 "opt": {
6178 "a": " Realizable",
6179 "b": " Unrealizable",
6180 "c": " Both Realizable & Unrealizable",
6181 "d": " None of the mentioned"
6182 }
6183 },
6184 {
6185 "name": "Question 562",
6186 "desc": "What takes input as an object described by a set of attributes?",
6187 "ans": "d",
6188 "opt": {
6189 "a": " Tree",
6190 "b": " Graph",
6191 "c": " Decision graph",
6192 "d": " Decision tree"
6193 }
6194 },
6195 {
6196 "name": "Question 563",
6197 "desc": "How the decision tree reaches its decision?",
6198 "ans": "c",
6199 "opt": {
6200 "a": " Single test",
6201 "b": " Two test",
6202 "c": " Sequence of test",
6203 "d": " No test"
6204 }
6205 },
6206 {
6207 "name": "Question 564",
6208 "desc": "Factors which affect the performance of learner system does not include",
6209 "ans": "d",
6210 "opt": {
6211 "a": " Representation scheme used",
6212 "b": " Training scenario",
6213 "c": " Type of feedback",
6214 "d": " Good data structures"
6215 }
6216 },
6217 {
6218 "name": "Question 565",
6219 "desc": "Different learning method does not include:",
6220 "ans": "d",
6221 "opt": {
6222 "a": " Memorization",
6223 "b": " Analogy",
6224 "c": " Deduction",
6225 "d": " Introduction"
6226 }
6227 },
6228 {
6229 "name": "Question 566",
6230 "desc": "Which of the following is the model used for learning?",
6231 "ans": "d",
6232 "opt": {
6233 "a": " Decision trees",
6234 "b": " Neural networks",
6235 "c": " Propositional and FOL rules",
6236 "d": " All of the mentioned"
6237 }
6238 },
6239 {
6240 "name": "Question 567",
6241 "desc": "Automated vehicle is an example of ______",
6242 "ans": "a",
6243 "opt": {
6244 "a": " Supervised learning",
6245 "b": " Unsupervised learning",
6246 "c": " Active learning",
6247 "d": " Reinforcement learning"
6248 }
6249 },
6250 {
6251 "name": "Question 568",
6252 "desc": "Following is an example of active learning:",
6253 "ans": "a",
6254 "opt": {
6255 "a": " News Recommender system",
6256 "b": " Dust cleaning machine",
6257 "c": " Automated vehicle",
6258 "d": " None of the mentioned"
6259 }
6260 },
6261 {
6262 "name": "Question 569",
6263 "desc": "In which of the following learning the teacher returns reward and punishment to learner?",
6264 "ans": "b",
6265 "opt": {
6266 "a": " Active learning",
6267 "b": " Reinforcement learning",
6268 "c": " Supervised learning",
6269 "d": " Unsupervised learning"
6270 }
6271 },
6272 {
6273 "name": "Question 570",
6274 "desc": "Decision trees are appropriate for the problems where:",
6275 "ans": "d",
6276 "opt": {
6277 "a": " Attributes are both numeric and nominal",
6278 "b": " Target function takes on a discrete number of values.",
6279 "c": " Data may have errors",
6280 "d": " All of the mentioned"
6281 }
6282 },
6283 {
6284 "name": "Question 571",
6285 "desc": "Which of the following is not an application of learning?",
6286 "ans": "d",
6287 "opt": {
6288 "a": " Data mining",
6289 "b": " WWW",
6290 "c": " Speech recognition",
6291 "d": " None of the mentioned"
6292 }
6293 },
6294 {
6295 "name": "Question 572",
6296 "desc": "Which of the following is the component of learning system?",
6297 "ans": "d",
6298 "opt": {
6299 "a": " Goal",
6300 "b": " Model",
6301 "c": " Learning rules",
6302 "d": " All of the mentioned"
6303 }
6304 },
6305 {
6306 "name": "Question 573",
6307 "desc": "Following is also called as exploratory learning:",
6308 "ans": "c",
6309 "opt": {
6310 "a": " Supervised learning",
6311 "b": " Active learning",
6312 "c": " Unsupervised learning",
6313 "d": " Reinforcement learning"
6314 }
6315 },
6316 {
6317 "name": "Question 574",
6318 "desc": "Which is not a desirable property of a logical rule-based system?",
6319 "ans": "b",
6320 "opt": {
6321 "a": " Locality",
6322 "b": " Attachment",
6323 "c": " Detachment",
6324 "d": " Truth-Functionality"
6325 }
6326 },
6327 {
6328 "name": "Question 575",
6329 "desc": "How is Fuzzy Logic different from conventional control methods?",
6330 "ans": "a",
6331 "opt": {
6332 "a": " IF and THEN Approach",
6333 "b": " FOR Approach",
6334 "c": " WHILE Approach",
6335 "d": " DO Approach"
6336 }
6337 },
6338 {
6339 "name": "Question 576",
6340 "desc": "In an Unsupervised learning",
6341 "ans": "b",
6342 "opt": {
6343 "a": " Specific output values are given",
6344 "b": " Specific output values are not given",
6345 "c": " No specific Inputs are given",
6346 "d": " Both inputs and outputs are given"
6347 }
6348 },
6349 {
6350 "name": "Question 577",
6351 "desc": "Inductive learning involves finding a",
6352 "ans": "a",
6353 "opt": {
6354 "a": " Consistent Hypothesis",
6355 "b": " Inconsistent Hypothesis",
6356 "c": " Regular Hypothesis",
6357 "d": " Irregular Hypothesis"
6358 }
6359 },
6360 {
6361 "name": "Question 578",
6362 "desc": "Computational learning theory analyzes the sample complexity and computational complexity of",
6363 "ans": "b",
6364 "opt": {
6365 "a": " Unsupervised Learning",
6366 "b": " Inductive learning",
6367 "c": " Forced based learning",
6368 "d": " Weak learning"
6369 }
6370 },
6371 {
6372 "name": "Question 579",
6373 "desc": "If a hypothesis says it should be positive, but in fact, it is negative, we call it",
6374 "ans": "c",
6375 "opt": {
6376 "a": " A consistent hypothesis",
6377 "b": " A false negative hypothesis",
6378 "c": " A false positive hypothesis",
6379 "d": " A specialized hypothesis"
6380 }
6381 },
6382 {
6383 "name": "Question 580",
6384 "desc": "Neural Networks are complex ______________with many parameters.",
6385 "ans": "b",
6386 "opt": {
6387 "a": " Linear Functions",
6388 "b": " Nonlinear Functions",
6389 "c": " Discrete Functions",
6390 "d": " Exponential Functions"
6391 }
6392 },
6393 {
6394 "name": "Question 581",
6395 "desc": "A perceptron is a ______________",
6396 "ans": "a",
6397 "opt": {
6398 "a": " Feed-forward neural network",
6399 "b": " Backpropagation algorithm",
6400 "c": " Backtracking algorithm",
6401 "d": " Feed Forward-backward algorithm"
6402 }
6403 },
6404 {
6405 "name": "Question 582",
6406 "desc": "Which of the following statement is true?",
6407 "ans": "a",
6408 "opt": {
6409 "a": " Not all formal languages are context-free",
6410 "b": " All formal languages are Context free",
6411 "c": " All formal languages are like natural language",
6412 "d": " Natural languages are context-oriented free"
6413 }
6414 },
6415 {
6416 "name": "Question 583",
6417 "desc": "Which of the following statement is not true?",
6418 "ans": "d",
6419 "opt": {
6420 "a": " The union and concatenation of two context-free languages is context-free",
6421 "b": " The reverse of a context-free language is context-free, but the complement need not be",
6422 "c": " Every regular language is context-free because it can be described by a regular grammar",
6423 "d": " The intersection two context-free languages is context-free"
6424 }
6425 },
6426 {
6427 "name": "Question 584",
6428 "desc": "A 3-input neuron is trained to output a zero when the input is 110 and a one when the input is 111After generalization, the output will be zero when and only when the input is:",
6429 "ans": "c",
6430 "opt": {
6431 "a": " 000 or 110 or 011 or 101",
6432 "b": " 010 or 100 or 110 or 101",
6433 "c": " 000 or 010 or 110 or 100",
6434 "d": " 100 or 111 or 101 or 001"
6435 }
6436 },
6437 {
6438 "name": "Question 585",
6439 "desc": "A perceptron is:",
6440 "ans": "a",
6441 "opt": {
6442 "a": " a single layer feed-forward neural network with pre-processing",
6443 "b": " an auto-associative neural network",
6444 "c": " a double layer auto-associative neural network",
6445 "d": " a neural network that contains feedback"
6446 }
6447 },
6448 {
6449 "name": "Question 586",
6450 "desc": "An auto-associative network is:",
6451 "ans": "b",
6452 "opt": {
6453 "a": " a neural network that contains no loops",
6454 "b": " a neural network that contains feedback",
6455 "c": " a neural network that has only one loop",
6456 "d": " a single layer feed-forward neural network with pre-processing"
6457 }
6458 },
6459 {
6460 "name": "Question 587",
6461 "desc": "A 4-input neuron has weights 1, 2, 3 and 4The transfer function is linear with the constant of proportionality being equal to 2The inputs are 4, 10, 5 and 20 respectivelyThe output will be:",
6462 "ans": "a",
6463 "opt": {
6464 "a": " 238",
6465 "b": " 76",
6466 "c": " 119",
6467 "d": " 123"
6468 }
6469 },
6470 {
6471 "name": "Question 588",
6472 "desc": "Which of the following is true?",
6473 "ans": "a",
6474 "opt": {
6475 "a": ") On average, neural networks have higher computational rates than conventional computers.",
6476 "b": "i) Neural networks learn by example.",
6477 "c": "ii) Neural networks mimic the way the human brain works.",
6478 "d": " All of the mentioned are true"
6479 }
6480 },
6481 {
6482 "name": "Question 589",
6483 "desc": "Which of the following is true for neural networks?",
6484 "ans": "c",
6485 "opt": {
6486 "a": ") The training time depends on the size of the network.",
6487 "b": "i) Neural networks can be simulated on a conventional computer.",
6488 "c": "ii) Artificial neurons are identical in operation to biological ones.",
6489 "d": " All of the mentioned"
6490 }
6491 },
6492 {
6493 "name": "Question 590",
6494 "desc": "What are the advantages of neural networks over conventional computers?",
6495 "ans": "d",
6496 "opt": {
6497 "a": ") They have the ability to learn by example",
6498 "b": "i) They are more fault tolerant",
6499 "c": "ii)They are more suited for real time operation due to their high �computational� rates",
6500 "d": " (i) and (ii) are true"
6501 }
6502 },
6503 {
6504 "name": "Question 591",
6505 "desc": "Which of the following is true?",
6506 "ans": "a",
6507 "opt": {
6508 "a": "ngle layer associative neural networks do not have the ability to:",
6509 "b": ") perform pattern recognition",
6510 "c": "i) find the parity of a picture",
6511 "d": "ii)determine whether two or more shapes in a picture are connected or not"
6512 }
6513 },
6514 {
6515 "name": "Question 592",
6516 "desc": "Which is true for neural networks?",
6517 "ans": "d",
6518 "opt": {
6519 "a": " It has set of nodes and connections",
6520 "b": " Each node computes it�s weighted input",
6521 "c": " Node could be in excited state or non-excited state",
6522 "d": " All of the mentioned"
6523 }
6524 },
6525 {
6526 "name": "Question 593",
6527 "desc": "Neuro software is:",
6528 "ans": "b",
6529 "opt": {
6530 "a": " A software used to analyze neurons",
6531 "b": " It is powerful and easy neural network",
6532 "c": " Designed to aid experts in real world",
6533 "d": " It is software used by Neurosurgeon"
6534 }
6535 },
6536 {
6537 "name": "Question 594",
6538 "desc": "Why is the XOR problem exceptionally interesting to neural network researchers?",
6539 "ans": "d",
6540 "opt": {
6541 "a": " Because it can be expressed in a way that allows you to use a neural network",
6542 "b": " Because it is complex binary operation that cannot be solved using neural networks",
6543 "c": " Because it can be solved by a single layer perceptron",
6544 "d": " Because it is the simplest linearly inseparable problem that exists."
6545 }
6546 },
6547 {
6548 "name": "Question 595",
6549 "desc": "What is back propagation?",
6550 "ans": "c",
6551 "opt": {
6552 "a": " It is another name given to the curvy function in the perceptron",
6553 "b": " It is the transmission of error back through the network to adjust the inputs",
6554 "c": " It is the transmission of error back through the network to allow weights to be adjusted so that the network can learn",
6555 "d": " None of the mentioned"
6556 }
6557 },
6558 {
6559 "name": "Question 596",
6560 "desc": "Why are linearly separable problems of interest of neural network researchers?",
6561 "ans": "b",
6562 "opt": {
6563 "a": " Because they are the only class of problem that network can solve successfully",
6564 "b": " Because they are the only class of problem that Perceptron can solve successfully",
6565 "c": " Because they are the only mathematical functions that are continue",
6566 "d": " Because they are the only mathematical functions you can draw"
6567 }
6568 },
6569 {
6570 "name": "Question 597",
6571 "desc": "Which of the following is not the promise of artificial neural network?",
6572 "ans": "a",
6573 "opt": {
6574 "a": " It can explain result",
6575 "b": " It can survive the failure of some nodes",
6576 "c": " It has inherent parallelism",
6577 "d": " It can handle noise"
6578 }
6579 },
6580 {
6581 "name": "Question 598",
6582 "desc": "Neural Networks are complex ______________ with many parameters.",
6583 "ans": "a",
6584 "opt": {
6585 "a": " Linear Functions",
6586 "b": " Nonlinear Functions",
6587 "c": " Discrete Functions",
6588 "d": " Exponential Functions"
6589 }
6590 },
6591 {
6592 "name": "Question 599",
6593 "desc": "A perceptron adds up all the weighted inputs it receives, and if it exceeds a certain value, it outputs a 1, otherwise it just outputs a 0.",
6594 "ans": "a",
6595 "opt": {
6596 "a": " True",
6597 "b": " False",
6598 "c": " Sometimes � it can also output intermediate values as well",
6599 "d": " Can�t say"
6600 }
6601 },
6602 {
6603 "name": "Question 600",
6604 "desc": "The name for the function in question 16 is",
6605 "ans": "b",
6606 "opt": {
6607 "a": " Step function",
6608 "b": " Heaviside function",
6609 "c": " Logistic function",
6610 "d": " Perceptron function"
6611 }
6612 },
6613 {
6614 "name": "Question 601",
6615 "desc": "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",
6616 "ans": "c",
6617 "opt": {
6618 "a": " True � this works always, and these multiple perceptrons learn to classify even complex problems",
6619 "b": " False � perceptrons are mathematically incapable of solving linearly inseparable functions, no matter what you do",
6620 "c": " True � perceptrons can do this but are unable to learn to do it � they have to be explicitly hand-coded",
6621 "d": " False � just having a single perceptron is enough"
6622 }
6623 },
6624 {
6625 "name": "Question 602",
6626 "desc": "The network that involves backward links from output to the input and hidden layers is called as ____",
6627 "ans": "c",
6628 "opt": {
6629 "a": " Self organizing maps",
6630 "b": " Perceptrons",
6631 "c": " Recurrent neural network",
6632 "d": " Multi layered perceptron"
6633 }
6634 },
6635 {
6636 "name": "Question 603",
6637 "desc": "Which of the following is an application of NN (Neural Network)?",
6638 "ans": "d",
6639 "opt": {
6640 "a": " Sales forecasting",
6641 "b": " Data validation",
6642 "c": " Risk management",
6643 "d": " All of the mentioned"
6644 }
6645 },
6646 {
6647 "name": "Question 604",
6648 "desc": "A _________ is a decision support tool that uses a tree-like graph or model of decisions and their possible consequences, including chance event outcomes, resource costs, and utility.",
6649 "ans": "a",
6650 "opt": {
6651 "a": " Decision tree",
6652 "b": " Graphs",
6653 "c": " Trees",
6654 "d": " Neural Networks"
6655 }
6656 },
6657 {
6658 "name": "Question 605",
6659 "desc": "Decision Tree is a display of an algorithm.\ra) True\rb) False\rView Answer",
6660 "ans": "a",
6661 "opt": {
6662 "a": "",
6663 "b": "",
6664 "c": "",
6665 "d": ""
6666 }
6667 },
6668 {
6669 "name": "Question 606",
6670 "desc": "Decision Tree is",
6671 "ans": "c",
6672 "opt": {
6673 "a": " Flow-Chart",
6674 "b": " Structure in which internal node represents test on an attribute, each branch represents outcome of test and each leaf node represents class label",
6675 "c": " Flow-Chart & Structure in which internal node represents test on an attribute, each branch represents outcome of test and each leaf node represents class label",
6676 "d": " None of the mentioned"
6677 }
6678 },
6679 {
6680 "name": "Question 607",
6681 "desc": "Decision Trees can be used for Classification Tasks.\ra) True\rb) False\rView Answer",
6682 "ans": "a",
6683 "opt": {
6684 "a": "",
6685 "b": "",
6686 "c": "",
6687 "d": ""
6688 }
6689 },
6690 {
6691 "name": "Question 608",
6692 "desc": "Choose from the following that are Decision Tree nodes",
6693 "ans": "d",
6694 "opt": {
6695 "a": " Decision Nodes",
6696 "b": " End Nodes",
6697 "c": " Chance Nodes",
6698 "d": " All of the mentioned"
6699 }
6700 },
6701 {
6702 "name": "Question 609",
6703 "desc": "Decision Nodes are represented by ____________",
6704 "ans": "b",
6705 "opt": {
6706 "a": " Disks",
6707 "b": " Squares",
6708 "c": " Circles",
6709 "d": " Triangles"
6710 }
6711 },
6712 {
6713 "name": "Question 610",
6714 "desc": "Chance Nodes are represented by,",
6715 "ans": "c",
6716 "opt": {
6717 "a": " Disks",
6718 "b": " Squares",
6719 "c": " Circles",
6720 "d": " Triangles"
6721 }
6722 },
6723 {
6724 "name": "Question 611",
6725 "desc": "End Nodes are represented by __________",
6726 "ans": "d",
6727 "opt": {
6728 "a": " Disks",
6729 "b": " Squares",
6730 "c": " Circles",
6731 "d": " Triangles"
6732 }
6733 },
6734 {
6735 "name": "Question 612",
6736 "desc": "Following are the advantage/s of Decision TreesChoose that apply.",
6737 "ans": "d",
6738 "opt": {
6739 "a": " Possible Scenarios can be added",
6740 "b": " Use a white box model, If given result is provided by a model",
6741 "c": " Worst, best and expected values can be determined for different scenarios",
6742 "d": " All of the mentioned"
6743 }
6744 },
6745 {
6746 "name": "Question 613",
6747 "desc": "Which combines inductive methods with the power of first-order representations?",
6748 "ans": "c",
6749 "opt": {
6750 "a": " Inductive programming",
6751 "b": " Logic programming",
6752 "c": " Inductive logic programming",
6753 "d": " Lisp programming"
6754 }
6755 },
6756 {
6757 "name": "Question 614",
6758 "desc": "How many reasons are available for the popularity of ILP?",
6759 "ans": "c",
6760 "opt": {
6761 "a": " 1",
6762 "b": " 2",
6763 "c": " 3",
6764 "d": " 4"
6765 }
6766 },
6767 {
6768 "name": "Question 615",
6769 "desc": "Which cannot be represented by a set of attributes?",
6770 "ans": "b",
6771 "opt": {
6772 "a": " Program",
6773 "b": " Three-dimensional configuration of a protein molecule",
6774 "c": " Agents",
6775 "d": " None of the mentioned"
6776 }
6777 },
6778 {
6779 "name": "Question 616",
6780 "desc": "Which is an appropriate language for describing the relationships?",
6781 "ans": "a",
6782 "opt": {
6783 "a": " First-order logic",
6784 "b": " Propositional logic",
6785 "c": " ILP",
6786 "d": " None of the mentioned"
6787 }
6788 },
6789 {
6790 "name": "Question 617",
6791 "desc": "Which produces hypotheses that are easy to read for humans?",
6792 "ans": "a",
6793 "opt": {
6794 "a": " ILP",
6795 "b": " Artificial intelligence",
6796 "c": " Propositional logic",
6797 "d": " First-order logic"
6798 }
6799 },
6800 {
6801 "name": "Question 618",
6802 "desc": "What need to be satisfied in inductive logic programming?",
6803 "ans": "b",
6804 "opt": {
6805 "a": " Constraint",
6806 "b": " Entailment constraint",
6807 "c": " Both Constraint & Entailment constraint",
6808 "d": " None of the mentioned"
6809 }
6810 },
6811 {
6812 "name": "Question 619",
6813 "desc": "How many literals are available in top-down inductive learning methods?",
6814 "ans": "c",
6815 "opt": {
6816 "a": " 1",
6817 "b": " 2",
6818 "c": " 3",
6819 "d": " 4"
6820 }
6821 },
6822 {
6823 "name": "Question 620",
6824 "desc": "Which inverts a complete resolution strategy?",
6825 "ans": "a",
6826 "opt": {
6827 "a": " Inverse resolution",
6828 "b": " Resolution",
6829 "c": " Trilogy",
6830 "d": " None of the mentioned"
6831 }
6832 },
6833 {
6834 "name": "Question 621",
6835 "desc": "Which method can�t be used for expressing relational knowledge?",
6836 "ans": "c",
6837 "opt": {
6838 "a": " Literal system",
6839 "b": " Variable-based system",
6840 "c": " Attribute-based system",
6841 "d": " None of the mentioned"
6842 }
6843 },
6844 {
6845 "name": "Question 622",
6846 "desc": "Which approach is used for refining a very general rule through ILP?",
6847 "ans": "a",
6848 "opt": {
6849 "a": " Top-down approach",
6850 "b": " Bottom-up approach",
6851 "c": " Both Top-down & Bottom-up approach",
6852 "d": " None of the mentioned"
6853 }
6854 },
6855 {
6856 "name": "Question 623",
6857 "desc": "What is the intentional exchange of information brought about by production and perception?",
6858 "ans": "b",
6859 "opt": {
6860 "a": " Hearing",
6861 "b": " Communication",
6862 "c": " Speech",
6863 "d": " None of the mentioned"
6864 }
6865 },
6866 {
6867 "name": "Question 624",
6868 "desc": "What is the complex system of structured message?",
6869 "ans": "a",
6870 "opt": {
6871 "a": " Languages",
6872 "b": " Words",
6873 "c": " Signs",
6874 "d": " Speech"
6875 }
6876 },
6877 {
6878 "name": "Question 625",
6879 "desc": "How many things are present in conventional communication signs?",
6880 "ans": "c",
6881 "opt": {
6882 "a": " 3",
6883 "b": " 4",
6884 "c": " 5",
6885 "d": " 6"
6886 }
6887 },
6888 {
6889 "name": "Question 626",
6890 "desc": "What is defined by set of strings?",
6891 "ans": "b",
6892 "opt": {
6893 "a": " Signs",
6894 "b": " Formal language",
6895 "c": " Communication",
6896 "d": " None of the mentioned"
6897 }
6898 },
6899 {
6900 "name": "Question 627",
6901 "desc": "What is a finite set of rules that specifies a language?",
6902 "ans": "c",
6903 "opt": {
6904 "a": " Signs",
6905 "b": " Communication",
6906 "c": " Grammer",
6907 "d": " Phrase"
6908 }
6909 },
6910 {
6911 "name": "Question 628",
6912 "desc": "What kind of perception is used in printing?",
6913 "ans": "a",
6914 "opt": {
6915 "a": " Optical character recognition",
6916 "b": " Speech recognition",
6917 "c": " Perception",
6918 "d": " None of the mentioned"
6919 }
6920 },
6921 {
6922 "name": "Question 629",
6923 "desc": "Why the parsing is used?",
6924 "ans": "b",
6925 "opt": {
6926 "a": " Interpretation",
6927 "b": " Building a parse tree",
6928 "c": " Recognition",
6929 "d": " All of the mentioned"
6930 }
6931 },
6932 {
6933 "name": "Question 630",
6934 "desc": "How many objects are available in closed classes?",
6935 "ans": "d",
6936 "opt": {
6937 "a": " 1",
6938 "b": " 2",
6939 "c": " 3",
6940 "d": " 4"
6941 }
6942 },
6943 {
6944 "name": "Question 631",
6945 "desc": "How many states are present in parsing?",
6946 "ans": "c",
6947 "opt": {
6948 "a": " 1",
6949 "b": " 2",
6950 "c": " 3",
6951 "d": " 4"
6952 }
6953 },
6954 {
6955 "name": "Question 632",
6956 "desc": "Pick out the correct option about the types of parsing.",
6957 "ans": "a",
6958 "opt": {
6959 "a": " Top-down and bottom-up parsing",
6960 "b": " Interpretation and communication",
6961 "c": " Roll-up and roll-down",
6962 "d": " None of the mentioned"
6963 }
6964 },
6965 {
6966 "name": "Question 633",
6967 "desc": "Semantic grammars:",
6968 "ans": "a",
6969 "opt": {
6970 "a": " Encode semantic information into a syntactic grammar",
6971 "b": " Decode semantic information into a syntactic grammar",
6972 "c": " Encode syntactic information into a semantic grammar",
6973 "d": " Decode syntactic information into a semantic grammar"
6974 }
6975 },
6976 {
6977 "name": "Question 634",
6978 "desc": "What is a top-down parser?",
6979 "ans": "a",
6980 "opt": {
6981 "a": " Begins by hypothesizing a sentence (the symbol S) and successively predicting lower level constituents until individual pre-terminal symbols are written",
6982 "b": " Begins by hypothesizing a sentence (the symbol S) and successively predicting upper level constituents until individual pre-terminal symbols are written",
6983 "c": " Begins by hypothesizing lower level constituents and successively predicting a sentence (the symbol S)",
6984 "d": " Begins by hypothesizing upper level constituents and successively predicting a sentence (the symbol S)"
6985 }
6986 },
6987 {
6988 "name": "Question 635",
6989 "desc": "Perception involves",
6990 "ans": "a",
6991 "opt": {
6992 "a": " Sights, sounds, smell and touch",
6993 "b": " Hitting",
6994 "c": " Boxing",
6995 "d": " Dancing"
6996 }
6997 },
6998 {
6999 "name": "Question 636",
7000 "desc": "The process by which you become aware of messages through your sense is called",
7001 "ans": "d",
7002 "opt": {
7003 "a": " Organization",
7004 "b": " Sensation",
7005 "c": " Interpretation-Evaluation",
7006 "d": " Perception"
7007 }
7008 },
7009 {
7010 "name": "Question 637",
7011 "desc": "Susan is so beautiful; I bet she is smart tooThis is an example of",
7012 "ans": "a",
7013 "opt": {
7014 "a": " The halo effect",
7015 "b": " The primary effect",
7016 "c": " A self-fulfilling prophecy",
7017 "d": " The recency effect"
7018 }
7019 },
7020 {
7021 "name": "Question 638",
7022 "desc": "_____ prevents you from seeing an individual as an individual rather than as a member of a group.",
7023 "ans": "c",
7024 "opt": {
7025 "a": " Cultural mores",
7026 "b": " Stereotypes",
7027 "c": " Schematas",
7028 "d": " Attributions"
7029 }
7030 },
7031 {
7032 "name": "Question 639",
7033 "desc": "When you get fired from your job and you determine it is because your boss dislikes you, you are most likely exhibiting",
7034 "ans": "d",
7035 "opt": {
7036 "a": " Self-promotion",
7037 "b": " Fundamental attribution error",
7038 "c": " Over-attribution",
7039 "d": " Self-serving bias"
7040 }
7041 },
7042 {
7043 "name": "Question 640",
7044 "desc": "Mindless processing is",
7045 "ans": "c",
7046 "opt": {
7047 "a": " careful, critical thinking",
7048 "b": " inaccurate and faulty processing",
7049 "c": " information processing that relies heavily on familiar schemata",
7050 "d": " processing that focuses on unusual or novel events"
7051 }
7052 },
7053 {
7054 "name": "Question 641",
7055 "desc": "Selective retention occurs when",
7056 "ans": "a",
7057 "opt": {
7058 "a": " we process, store, and retrieve information that we have already selected, organized, and interpreted",
7059 "b": " we make choices to experience particular stimuli",
7060 "c": " we make choices to avoid particular stimuli",
7061 "d": " we focus on specific stimuli while ignoring other stimuli"
7062 }
7063 },
7064 {
7065 "name": "Question 642",
7066 "desc": "Which of the following strategies would NOT be effective at improving your communication competence?",
7067 "ans": "a",
7068 "opt": {
7069 "a": " Recognize the people, objects, and situations remain stable over time",
7070 "b": " Recognize that each person�s frame of perception is unique",
7071 "c": " Be active in perceiving",
7072 "d": " Distinguish facts from inference"
7073 }
7074 },
7075 {
7076 "name": "Question 643",
7077 "desc": "_____________ is measured by the number of mental structures we use, how abstract they are, and how elaborate they interact to shape our perceptions.",
7078 "ans": "d",
7079 "opt": {
7080 "a": " intrapersonal structure",
7081 "b": " perceptual set",
7082 "c": " self-justification",
7083 "d": " none of the mentioned"
7084 }
7085 },
7086 {
7087 "name": "Question 644",
7088 "desc": "A perception check is",
7089 "ans": "d",
7090 "opt": {
7091 "a": " a cognitive bias that makes us listen only to information we already agree with",
7092 "b": " a method teachers use to reward good listeners in the classroom",
7093 "c": " any factor that gets in the way of good listening and decreases our ability to interpret correctly",
7094 "d": " a response that allows you to state your interpretation and ask your partner whether or not that interpretation is correct"
7095 }
7096 },
7097 {
7098 "name": "Question 645",
7099 "desc": "What is the dominant modality for communication between humans?",
7100 "ans": "b",
7101 "opt": {
7102 "a": " Hear",
7103 "b": " Speech",
7104 "c": " Smell",
7105 "d": " None of the mentioned"
7106 }
7107 },
7108 {
7109 "name": "Question 646",
7110 "desc": "What kind of signal is used in speech recognition?",
7111 "ans": "c",
7112 "opt": {
7113 "a": " Electromagnetic signal",
7114 "b": " Electric signal",
7115 "c": " Acoustic signal",
7116 "d": " Radar"
7117 }
7118 },
7119 {
7120 "name": "Question 647",
7121 "desc": "What is viewed as problem of probabilistic inference?",
7122 "ans": "a",
7123 "opt": {
7124 "a": " Speech recognition",
7125 "b": " Speaking",
7126 "c": " Hearing",
7127 "d": " Utterance"
7128 }
7129 },
7130 {
7131 "name": "Question 648",
7132 "desc": "Which specifies the prior probability of each utterance?",
7133 "ans": "c",
7134 "opt": {
7135 "a": " Sound model",
7136 "b": " Model",
7137 "c": " Language model",
7138 "d": " All of the mentioned"
7139 }
7140 },
7141 {
7142 "name": "Question 649",
7143 "desc": "Which model gives the probability of each word following each other word?",
7144 "ans": "a",
7145 "opt": {
7146 "a": " Bigram model",
7147 "b": " Diagram model",
7148 "c": " Gram model",
7149 "d": " Speech model"
7150 }
7151 },
7152 {
7153 "name": "Question 650",
7154 "desc": "What is the study of how the language sounds?",
7155 "ans": "d",
7156 "opt": {
7157 "a": " Speechology",
7158 "b": " Biology",
7159 "c": " Trilogy",
7160 "d": " Phonology"
7161 }
7162 },
7163 {
7164 "name": "Question 651",
7165 "desc": "What are periodic changes in pressure that propagate through the air?",
7166 "ans": "b",
7167 "opt": {
7168 "a": " Air waves",
7169 "b": " Sound waves",
7170 "c": " Rate",
7171 "d": " None of the mentioned"
7172 }
7173 },
7174 {
7175 "name": "Question 652",
7176 "desc": "What is called as the properties of the signal that extend over interval?",
7177 "ans": "c",
7178 "opt": {
7179 "a": " Hops",
7180 "b": " Rate",
7181 "c": " Frames",
7182 "d": " All of the mentioned"
7183 }
7184 },
7185 {
7186 "name": "Question 653",
7187 "desc": "Which is used to capture the internal structure of the phones?",
7188 "ans": "c",
7189 "opt": {
7190 "a": " One-state phone model",
7191 "b": " Two-state phone model",
7192 "c": " Three-state phone mone",
7193 "d": " All of the mentioned"
7194 }
7195 },
7196 {
7197 "name": "Question 654",
7198 "desc": "Which are partially captured by triphone model?",
7199 "ans": "b",
7200 "opt": {
7201 "a": " Articulation effects",
7202 "b": " Coarticulation effects",
7203 "c": " Both Articulation & Coarticulation effects",
7204 "d": " None of the mentioned"
7205 }
7206 },
7207 {
7208 "name": "Question 655",
7209 "desc": "Which provides agents with information about the world they inhabit?",
7210 "ans": "b",
7211 "opt": {
7212 "a": " Sense",
7213 "b": " Perception",
7214 "c": " Reading",
7215 "d": " Hearing"
7216 }
7217 },
7218 {
7219 "name": "Question 656",
7220 "desc": "What is used to initiate the perception in the environment?",
7221 "ans": "a",
7222 "opt": {
7223 "a": " Sensor",
7224 "b": " Read",
7225 "c": " Actuators",
7226 "d": " None of the mentioned"
7227 }
7228 },
7229 {
7230 "name": "Question 657",
7231 "desc": "What is the study of light?",
7232 "ans": "c",
7233 "opt": {
7234 "a": " Biology",
7235 "b": " Lightology",
7236 "c": " Photometry",
7237 "d": " All of the mentioned"
7238 }
7239 },
7240 {
7241 "name": "Question 658",
7242 "desc": "How to increase the brightness of the pixel?",
7243 "ans": "b",
7244 "opt": {
7245 "a": " Sound",
7246 "b": " Amount of light",
7247 "c": " Surface",
7248 "d": " Waves"
7249 }
7250 },
7251 {
7252 "name": "Question 659",
7253 "desc": "How many kinds of reflection are available in image perception?",
7254 "ans": "b",
7255 "opt": {
7256 "a": " 1",
7257 "b": " 2",
7258 "c": " 3",
7259 "d": " 4"
7260 }
7261 },
7262 {
7263 "name": "Question 660",
7264 "desc": "What is meant by predicting the value of a state variable from the past?",
7265 "ans": "d",
7266 "opt": {
7267 "a": " Specular reflection",
7268 "b": " Diffuse reflection",
7269 "c": " Gaussian filter",
7270 "d": " Smoothing"
7271 }
7272 },
7273 {
7274 "name": "Question 661",
7275 "desc": "How many types of image processing techniques are there in image perception?",
7276 "ans": "c",
7277 "opt": {
7278 "a": " 1",
7279 "b": " 2",
7280 "c": " 3",
7281 "d": " 4"
7282 }
7283 },
7284 {
7285 "name": "Question 662",
7286 "desc": "Which is meant by assuming any two neighboring that are both edge pixels with consistent orientation?",
7287 "ans": "a",
7288 "opt": {
7289 "a": " Canny edge detection",
7290 "b": " Smoothing",
7291 "c": " Segmentation",
7292 "d": " None of the mentioned"
7293 }
7294 },
7295 {
7296 "name": "Question 663",
7297 "desc": "What is the process of breaking an image into groups?",
7298 "ans": "c",
7299 "opt": {
7300 "a": " Edge detection",
7301 "b": " Smoothing",
7302 "c": " Segmentation",
7303 "d": " None of the mentioned"
7304 }
7305 },
7306 {
7307 "name": "Question 664",
7308 "desc": "How many types of 3-D image processing techniques are there in image perception?",
7309 "ans": "c",
7310 "opt": {
7311 "a": " 3",
7312 "b": " 4",
7313 "c": " 5",
7314 "d": " 6"
7315 }
7316 },
7317 {
7318 "name": "Question 665",
7319 "desc": "What is the name for information sent from robot sensors to robot controllers?",
7320 "ans": "c",
7321 "opt": {
7322 "a": " temperature",
7323 "b": " pressure",
7324 "c": " feedback",
7325 "d": " signal"
7326 }
7327 },
7328 {
7329 "name": "Question 666",
7330 "desc": "Which of the following terms refers to the rotational motion of a robot arm?",
7331 "ans": "d",
7332 "opt": {
7333 "a": " swivel",
7334 "b": " axle",
7335 "c": " retrograde",
7336 "d": " roll"
7337 }
7338 },
7339 {
7340 "name": "Question 667",
7341 "desc": "What is the name for the space inside which a robot unit operates?",
7342 "ans": "c",
7343 "opt": {
7344 "a": " environment",
7345 "b": " spatial base",
7346 "c": " work envelope",
7347 "d": " exclusion zone"
7348 }
7349 },
7350 {
7351 "name": "Question 668",
7352 "desc": "Which of the following terms IS NOT one of the five basic parts of a robot?",
7353 "ans": "a",
7354 "opt": {
7355 "a": " peripheral tools",
7356 "b": " end effectors",
7357 "c": " controller",
7358 "d": " drive"
7359 }
7360 },
7361 {
7362 "name": "Question 669",
7363 "desc": "Decision support programs are designed to help managers make:",
7364 "ans": "c",
7365 "opt": {
7366 "a": " budget projections",
7367 "b": " visual presentations",
7368 "c": " business decisions",
7369 "d": " vacation schedules"
7370 }
7371 },
7372 {
7373 "name": "Question 670",
7374 "desc": "PROLOG is an AI programming language which solves problems with a form of symbolic logic known as predicate calculusIt was developed in 1972 at the University of Marseilles by a team of specialistsCan you name the person who headed this team?",
7375 "ans": "a",
7376 "opt": {
7377 "a": " Alain Colmerauer",
7378 "b": " Niklaus Wirth",
7379 "c": " Seymour Papert",
7380 "d": " John McCarthy"
7381 }
7382 },
7383 {
7384 "name": "Question 671",
7385 "desc": "The number of moveable joints in the base, the arm, and the end effectors of the robot determines_________",
7386 "ans": "a",
7387 "opt": {
7388 "a": " degrees of freedom",
7389 "b": " payload capacity",
7390 "c": " operational limits",
7391 "d": " flexibility"
7392 }
7393 },
7394 {
7395 "name": "Question 672",
7396 "desc": "Which of the following places would be LEAST likely to include operational robots?",
7397 "ans": "d",
7398 "opt": {
7399 "a": " warehouse",
7400 "b": " factory",
7401 "c": " hospitals",
7402 "d": " private homes"
7403 }
7404 },
7405 {
7406 "name": "Question 673",
7407 "desc": "For a robot unit to be considered a functional industrial robot, typically, how many degrees of freedom would the robot have?",
7408 "ans": "c",
7409 "opt": {
7410 "a": " three",
7411 "b": " four",
7412 "c": " six",
7413 "d": " eight"
7414 }
7415 },
7416 {
7417 "name": "Question 674",
7418 "desc": "Which of the basic parts of a robot unit would include the computer circuitry that could be programmed to determine what the robot would do?",
7419 "ans": "b",
7420 "opt": {
7421 "a": " sensor",
7422 "b": " controller",
7423 "c": " arm",
7424 "d": " end effector"
7425 }
7426 },
7427 {
7428 "name": "Question 675",
7429 "desc": "Which of the following terms refers to the use of compressed gasses to drive (power) the robot device?",
7430 "ans": "a",
7431 "opt": {
7432 "a": " pneumatic",
7433 "b": " hydraulic",
7434 "c": " piezoelectric",
7435 "d": " photosensitive"
7436 }
7437 },
7438 {
7439 "name": "Question 676",
7440 "desc": "With regard to the physics of power systems used operate robots, which statement or statements is most correct?",
7441 "ans": "c",
7442 "opt": {
7443 "a": " hydraulics involves the compression of liquids",
7444 "b": " hydraulics involves the compression of air",
7445 "c": " pneumatics involve the compression of air",
7446 "d": " chemical batteries produce AC power"
7447 }
7448 },
7449 {
7450 "name": "Question 677",
7451 "desc": "The original LISP machines produced by both LMI and Symbolics were based on research performed at:",
7452 "ans": "b",
7453 "opt": {
7454 "a": " CMU",
7455 "b": " MIT",
7456 "c": " Stanford University",
7457 "d": " RAMD"
7458 }
7459 },
7460 {
7461 "name": "Question 678",
7462 "desc": "Which of the following statements concerning implementation of robotic systems is correct?",
7463 "ans": "d",
7464 "opt": {
7465 "a": " implementation of robots CAN save existing jobs",
7466 "b": " implementation of robots CAN create new jobs",
7467 "c": " robotics could prevent a business from closing",
7468 "d": " all of the mentioned"
7469 }
7470 },
7471 {
7472 "name": "Question 679",
7473 "desc": "Which of the following IS NOT one of the advantages associated with a robotics implementation program?",
7474 "ans": "a",
7475 "opt": {
7476 "a": " Low costs for hardware and software",
7477 "b": " Robots work continuously around the clock",
7478 "c": " Quality of manufactured goods can be improved",
7479 "d": " Reduced company cost for worker fringe benefits"
7480 }
7481 },
7482 {
7483 "name": "Question 680",
7484 "desc": "Which of the following �laws� is Asimov�s first and most important law of robotics?",
7485 "ans": "b",
7486 "opt": {
7487 "a": " robot actions must never result in damage to the robot",
7488 "b": " robots must never take actions harmful to humans",
7489 "c": " robots must follow the directions given by humans",
7490 "d": " robots must make business a greater profit"
7491 }
7492 },
7493 {
7494 "name": "Question 681",
7495 "desc": "In LISP, the function returns t if is a CONS cell and nil otherwise:",
7496 "ans": "b",
7497 "opt": {
7498 "a": " (cons <object>)",
7499 "b": " (consp <object>)",
7500 "c": " (eq <object>)",
7501 "d": " (cous = <object>)"
7502 }
7503 },
7504 {
7505 "name": "Question 682",
7506 "desc": "In a rule-based system, procedural domain knowledge is in the form of:",
7507 "ans": "a",
7508 "opt": {
7509 "a": " production rules",
7510 "b": " rule interpreters",
7511 "c": " meta-rules",
7512 "d": " control rules"
7513 }
7514 },
7515 {
7516 "name": "Question 683",
7517 "desc": "If a robot can alter its own trajectory in response to external conditions, it is considered to be:",
7518 "ans": "a",
7519 "opt": {
7520 "a": " intelligent",
7521 "b": " mobile",
7522 "c": " open loop",
7523 "d": " non-servo"
7524 }
7525 },
7526 {
7527 "name": "Question 684",
7528 "desc": "One of the leading American robotics centers is the Robotics Institute located at:",
7529 "ans": "a",
7530 "opt": {
7531 "a": " CMU",
7532 "b": " MIT",
7533 "c": " RAND",
7534 "d": " SRI"
7535 }
7536 },
7537 {
7538 "name": "Question 685",
7539 "desc": "Natural Language Processing (NLP) is field of",
7540 "ans": "d",
7541 "opt": {
7542 "a": " Computer Science",
7543 "b": " Artificial Intelligence",
7544 "c": " Linguistics",
7545 "d": " All of the mentioned"
7546 }
7547 },
7548 {
7549 "name": "Question 686",
7550 "desc": "NLP is concerned with the interactions between computers and human (natural) languages.\ra) True\rb) False\rView Answer",
7551 "ans": "a",
7552 "opt": {
7553 "a": "",
7554 "b": "",
7555 "c": "",
7556 "d": ""
7557 }
7558 },
7559 {
7560 "name": "Question 687",
7561 "desc": "One of the main challenge/s of NLP Is _____________",
7562 "ans": "a",
7563 "opt": {
7564 "a": " Handling Ambiguity of Sentences",
7565 "b": " Handling Tokenization",
7566 "c": " Handling POS-Tagging",
7567 "d": " All of the mentioned"
7568 }
7569 },
7570 {
7571 "name": "Question 688",
7572 "desc": "Modern NLP algorithms are based on machine learning, especially statistical machine learning.\ra) True\rb) False\rView Answer",
7573 "ans": "a",
7574 "opt": {
7575 "a": "",
7576 "b": "",
7577 "c": "",
7578 "d": ""
7579 }
7580 },
7581 {
7582 "name": "Question 689",
7583 "desc": "Choose form the following areas where NLP can be useful.",
7584 "ans": "d",
7585 "opt": {
7586 "a": " Automatic Text Summarization",
7587 "b": " Automatic Question-Answering Systems",
7588 "c": " Information Retrieval",
7589 "d": " All of the mentioned"
7590 }
7591 },
7592 {
7593 "name": "Question 690",
7594 "desc": "The major tasks of NLP includes",
7595 "ans": "d",
7596 "opt": {
7597 "a": " Automatic Summarization",
7598 "b": " Discourse Analysis",
7599 "c": " Machine Translation",
7600 "d": " All of the mentioned"
7601 }
7602 },
7603 {
7604 "name": "Question 691",
7605 "desc": "Coreference Resolution is",
7606 "ans": "b",
7607 "opt": {
7608 "a": " Anaphora Resolution",
7609 "b": " Given a sentence or larger chunk of text, determine which words (�mentions�) refer to the same objects (�entities�)",
7610 "c": " All of the mentioned",
7611 "d": " None of the mentioned"
7612 }
7613 },
7614 {
7615 "name": "Question 692",
7616 "desc": "Machine Translation",
7617 "ans": "a",
7618 "opt": {
7619 "a": " Converts one human language to another",
7620 "b": " Converts human language to machine language",
7621 "c": " Converts any human language to English",
7622 "d": " Converts Machine language to human language"
7623 }
7624 },
7625 {
7626 "name": "Question 693",
7627 "desc": "The more general task of coreference resolution also includes identifying so-called �bridging relationships� involving referring expressions.\ra) True\rb) False\rView Answer",
7628 "ans": "a",
7629 "opt": {
7630 "a": "",
7631 "b": "",
7632 "c": "",
7633 "d": ""
7634 }
7635 },
7636 {
7637 "name": "Question 694",
7638 "desc": "Morphological Segmentation",
7639 "ans": "b",
7640 "opt": {
7641 "a": " Does Discourse Analysis",
7642 "b": " Separate words into individual morphemes and identify the class of the morphemes",
7643 "c": " Is an extension of propositional logic",
7644 "d": " None of the mentioned"
7645 }
7646 },
7647 {
7648 "name": "Question 695",
7649 "desc": "Given a stream of text, Named Entity Recognition determines which pronoun maps to which noun.\ra) False\rb) True\rView Answer",
7650 "ans": "a",
7651 "opt": {
7652 "a": "",
7653 "b": "",
7654 "c": "",
7655 "d": ""
7656 }
7657 },
7658 {
7659 "name": "Question 696",
7660 "desc": "Natural Language generation is the main task of Natural language processing.\ra) True\rb) False\rView Answer",
7661 "ans": "a",
7662 "opt": {
7663 "a": "",
7664 "b": "",
7665 "c": "",
7666 "d": ""
7667 }
7668 },
7669 {
7670 "name": "Question 697",
7671 "desc": "OCR (Optical Character Recognition) uses NLP.\ra) True\rb) False\rView Answer",
7672 "ans": "a",
7673 "opt": {
7674 "a": "",
7675 "b": "",
7676 "c": "",
7677 "d": ""
7678 }
7679 },
7680 {
7681 "name": "Question 698",
7682 "desc": "Parts-of-Speech tagging determines",
7683 "ans": "d",
7684 "opt": {
7685 "a": " part-of-speech for each word dynamically as per meaning of the sentence",
7686 "b": " part-of-speech for each word dynamically as per sentence structure",
7687 "c": " all part-of-speech for a specific word given as input",
7688 "d": " all of the mentioned"
7689 }
7690 },
7691 {
7692 "name": "Question 699",
7693 "desc": "Parsing determines Parse Trees (Grammatical Analysis) for a given sentence.\ra) True\rb) False\rView Answer",
7694 "ans": "a",
7695 "opt": {
7696 "a": "",
7697 "b": "",
7698 "c": "",
7699 "d": ""
7700 }
7701 },
7702 {
7703 "name": "Question 700",
7704 "desc": "IR (information Retrieval) and IE (Information Extraction) are the two same thing.\ra) True\rb) False\rView Answer",
7705 "ans": "b",
7706 "opt": {
7707 "a": "",
7708 "b": "",
7709 "c": "",
7710 "d": ""
7711 }
7712 },
7713 {
7714 "name": "Question 701",
7715 "desc": "Many words have more than one meaning; we have to select the meaning which makes the most sense in contextThis can be resolved by",
7716 "ans": "b",
7717 "opt": {
7718 "a": " Fuzzy Logic",
7719 "b": " Word Sense Disambiguation",
7720 "c": " Shallow Semantic Analysis",
7721 "d": " All of the mentioned"
7722 }
7723 },
7724 {
7725 "name": "Question 702",
7726 "desc": "Given a sound clip of a person or people speaking, determine the textual representation of the speech.",
7727 "ans": "b",
7728 "opt": {
7729 "a": " Text-to-speech",
7730 "b": " Speech-to-text",
7731 "c": " All of the mentioned",
7732 "d": " None of the mentioned"
7733 }
7734 },
7735 {
7736 "name": "Question 703",
7737 "desc": "Speech Segmentation is a subtask of Speech Recognition.\ra) True\rb) False\rView Answer",
7738 "ans": "a",
7739 "opt": {
7740 "a": "",
7741 "b": "",
7742 "c": "",
7743 "d": ""
7744 }
7745 },
7746 {
7747 "name": "Question 704",
7748 "desc": "In linguistic morphology, _____________ is the process for reducing inflected words to their root form.",
7749 "ans": "b",
7750 "opt": {
7751 "a": " Rooting",
7752 "b": " Stemming",
7753 "c": " Text-Proofing",
7754 "d": " Both Rooting & Stemming"
7755 }
7756 },
7757 {
7758 "name": "Question 705",
7759 "desc": "DEC advertises that it helped to create �the world�s first expert system routinely used in an industrial environment,� called XCON or:",
7760 "ans": "b",
7761 "opt": {
7762 "a": " PDP-11",
7763 "b": " Rl",
7764 "c": " VAX",
7765 "d": " MAGNOM"
7766 }
7767 },
7768 {
7769 "name": "Question 706",
7770 "desc": "Prior to the invention of time-sharing, the prevalent method of computer access was:",
7771 "ans": "a",
7772 "opt": {
7773 "a": " batch processing",
7774 "b": " telecommunication",
7775 "c": " remote access",
7776 "d": " all of the mentioned"
7777 }
7778 },
7779 {
7780 "name": "Question 707",
7781 "desc": "Seymour Papert of the MIT AI lab created a programming environment for children called:",
7782 "ans": "b",
7783 "opt": {
7784 "a": " BASIC",
7785 "b": " LOGO",
7786 "c": " MYCIN",
7787 "d": " FORTRAN"
7788 }
7789 },
7790 {
7791 "name": "Question 708",
7792 "desc": "The Strategic Computing Program is a project of the:",
7793 "ans": "a",
7794 "opt": {
7795 "a": " Defense Advanced Research Projects Agency",
7796 "b": " National Science Foundation",
7797 "c": " Jet Propulsion Laboratory",
7798 "d": " All of the mentioned"
7799 }
7800 },
7801 {
7802 "name": "Question 709",
7803 "desc": "The original LISP machines produced by both LMI and Symbolics were based on research performed at:",
7804 "ans": "b",
7805 "opt": {
7806 "a": " CMU",
7807 "b": " MIT",
7808 "c": " Stanford University",
7809 "d": " RAMD"
7810 }
7811 },
7812 {
7813 "name": "Question 710",
7814 "desc": "In LISP, the addition 3 + 2 is entered as",
7815 "ans": "b",
7816 "opt": {
7817 "a": " 3 + 2",
7818 "b": " 3 add 2",
7819 "c": " 3 + 2 =",
7820 "d": " (+ 3 2)"
7821 }
7822 },
7823 {
7824 "name": "Question 711",
7825 "desc": "Weak AI is",
7826 "ans": "c",
7827 "opt": {
7828 "a": " the embodiment of human intellectual capabilities within a computer",
7829 "b": " a set of computer programs that produce output that would be considered to reflect intelligence if it were generated by humans",
7830 "c": " the study of mental faculties using mental models implemented on a computer",
7831 "d": " all of the mentioned"
7832 }
7833 },
7834 {
7835 "name": "Question 712",
7836 "desc": "In LISP, the function returns t if is a CONS cell and nil otherwise:",
7837 "ans": "b",
7838 "opt": {
7839 "a": " (cons )",
7840 "b": " (consp )",
7841 "c": " (eq )",
7842 "d": " (cous =)"
7843 }
7844 },
7845 {
7846 "name": "Question 713",
7847 "desc": "In a rule-based system, procedural domain knowledge is in the form of:",
7848 "ans": "a",
7849 "opt": {
7850 "a": " production rules",
7851 "b": " rule interpreters",
7852 "c": " meta-rules",
7853 "d": " control rules"
7854 }
7855 },
7856 {
7857 "name": "Question 714",
7858 "desc": "If a robot can alter its own trajectory in response to external conditions, it is considered to be:",
7859 "ans": "a",
7860 "opt": {
7861 "a": " intelligent",
7862 "b": " mobile",
7863 "c": " open loop",
7864 "d": " non-servo"
7865 }
7866 },
7867 {
7868 "name": "Question 715",
7869 "desc": "In LISP, the function assigns the symbol x to y is",
7870 "ans": "d",
7871 "opt": {
7872 "a": " (setq y x)",
7873 "b": " (set y = �x�)",
7874 "c": " (setq y = �x�)",
7875 "d": " (setq y �x�)"
7876 }
7877 },
7878 {
7879 "name": "Question 716",
7880 "desc": "One of the leading American robotics centers is the Robotics Institute located at:",
7881 "ans": "a",
7882 "opt": {
7883 "a": " CMU",
7884 "b": " MIT",
7885 "c": " RAND",
7886 "d": " SRI"
7887 }
7888 },
7889 {
7890 "name": "Question 717",
7891 "desc": "In LISP, the function (minusp (-20 4 8 8 1) returns",
7892 "ans": "a",
7893 "opt": {
7894 "a": " T",
7895 "b": " F",
7896 "c": " NIL",
7897 "d": " -20"
7898 }
7899 },
7900 {
7901 "name": "Question 718",
7902 "desc": "In LISP, which of the following function assigns the value 10 to the symbol a?",
7903 "ans": "a",
7904 "opt": {
7905 "a": " (setq a 10)",
7906 "b": " (a = b) where b = 10",
7907 "c": " (a = 10) (d) (setq 10 a)",
7908 "d": " All of the mentioned"
7909 }
7910 },
7911 {
7912 "name": "Question 719",
7913 "desc": "In LISP, the atom that stands for �False� is",
7914 "ans": "b",
7915 "opt": {
7916 "a": " t",
7917 "b": " nil",
7918 "c": " y",
7919 "d": " time"
7920 }
7921 },
7922 {
7923 "name": "Question 720",
7924 "desc": "The expert system developed at MIT to solve mathematical problems is known as:",
7925 "ans": "c",
7926 "opt": {
7927 "a": " RAND",
7928 "b": " ISIS",
7929 "c": " MACSYMA",
7930 "d": " MOLGEN"
7931 }
7932 },
7933 {
7934 "name": "Question 721",
7935 "desc": "Which approach to speech recognition avoids the problem caused by the differences in the way words are pronounced according to context?",
7936 "ans": "c",
7937 "opt": {
7938 "a": " continuous speech recognition",
7939 "b": " connected word recognition",
7940 "c": " isolated word recognition",
7941 "d": " speaker-dependent recognition"
7942 }
7943 },
7944 {
7945 "name": "Question 722",
7946 "desc": "A KES knowledge base contains information in the form of:",
7947 "ans": "d",
7948 "opt": {
7949 "a": " associations",
7950 "b": " actions",
7951 "c": " free text",
7952 "d": " all of the mentioned"
7953 }
7954 },
7955 {
7956 "name": "Question 723",
7957 "desc": "In AI programming, a list may contain:",
7958 "ans": "d",
7959 "opt": {
7960 "a": " cells",
7961 "b": " fields",
7962 "c": " pointers",
7963 "d": " all of the mentioned"
7964 }
7965 },
7966 {
7967 "name": "Question 724",
7968 "desc": "In LISP, the function (minusp (-20 4 8 8 1) returns",
7969 "ans": "a",
7970 "opt": {
7971 "a": " T",
7972 "b": " F",
7973 "c": " NIL",
7974 "d": " -20"
7975 }
7976 },
7977 {
7978 "name": "Question 725",
7979 "desc": "Special programs that assist programmers are called:",
7980 "ans": "c",
7981 "opt": {
7982 "a": " heuristic processors",
7983 "b": " symbolic programmers",
7984 "c": " intelligent programming tools",
7985 "d": " program recognizers"
7986 }
7987 },
7988 {
7989 "name": "Question 726",
7990 "desc": "If the English Philosopher Thomas Hobbes could be called �grandfather� of artificial intelligence, then who could be called its father?",
7991 "ans": "a",
7992 "opt": {
7993 "a": " A.M. Turning",
7994 "b": " John McCarthy",
7995 "c": " Allen Newell",
7996 "d": " Herbert Simon"
7997 }
7998 },
7999 {
8000 "name": "Question 727",
8001 "desc": "LISP machines also are known as:",
8002 "ans": "a",
8003 "opt": {
8004 "a": " AI workstations",
8005 "b": " Time-sharing terminals",
8006 "c": " Super mini computers",
8007 "d": " All of the mentioned"
8008 }
8009 },
8010 {
8011 "name": "Question 728",
8012 "desc": "Natural language processing can be divided into the two subfields of:",
8013 "ans": "b",
8014 "opt": {
8015 "a": " context and expectations",
8016 "b": " generation and understanding",
8017 "c": " semantics of pragmatics",
8018 "d": " recognition and synthesis"
8019 }
8020 },
8021 {
8022 "name": "Question 729",
8023 "desc": "How many ALU(s) is/are control by one control unit is SIMD (single instruction stream, multiple data stream) architecture?",
8024 "ans": "a",
8025 "opt": {
8026 "a": " one or more ALUs",
8027 "b": " One ALU",
8028 "c": " Only two ALU",
8029 "d": " Impossible to say"
8030 }
8031 },
8032 {
8033 "name": "Question 730",
8034 "desc": " Which of the following function returns t if the object is a number in LISP?",
8035 "ans": "b",
8036 "opt": {
8037 "a": " (number <object>)",
8038 "b": " (numberp <object>)",
8039 "c": " (numericp <object>)",
8040 "d": " (numeric <object>)"
8041 }
8042 },
8043 {
8044 "name": "Question 731",
8045 "desc": "Which of the following have computers traditionally done better than people?",
8046 "ans": "d",
8047 "opt": {
8048 "a": " storing information",
8049 "b": " responding flexibly",
8050 "c": " computing numerically",
8051 "d": " both storing information & computing numerically"
8052 }
8053 },
8054 {
8055 "name": "Question 732",
8056 "desc": "The characteristics of the computer system capable of thinking, reasoning and learning is known is",
8057 "ans": "c",
8058 "opt": {
8059 "a": " machine intelligence",
8060 "b": " human intelligence",
8061 "c": " artificial intelligence",
8062 "d": " virtual intelligence"
8063 }
8064 },
8065 {
8066 "name": "Question 733",
8067 "desc": "What part of the manufacturing process relate to each stage of the process and to the process as a whole?",
8068 "ans": "d",
8069 "opt": {
8070 "a": " field service",
8071 "b": " design",
8072 "c": " distribution",
8073 "d": " project management"
8074 }
8075 },
8076 {
8077 "name": "Question 734",
8078 "desc": "The area of AI that investigates methods of facilitating communication between people and computers is:",
8079 "ans": "a",
8080 "opt": {
8081 "a": " natural language processing",
8082 "b": " symbolic processing",
8083 "c": " decision support",
8084 "d": " robotics"
8085 }
8086 },
8087 {
8088 "name": "Question 735",
8089 "desc": "In the 16th century, a Czech rabbi reportedly created a living clay man whose name has become a synonym for an artificial humanThe clay man�s name was:",
8090 "ans": "b",
8091 "opt": {
8092 "a": " Frankenstein",
8093 "b": " Golem",
8094 "c": " Paracelsus",
8095 "d": " Hal"
8096 }
8097 },
8098 {
8099 "name": "Question 736",
8100 "desc": "For speech understanding systems to gain widespread acceptance in office automation, they must feature:",
8101 "ans": "a",
8102 "opt": {
8103 "a": " speaker independence",
8104 "b": " speaker dependence",
8105 "c": " isolated word recognition",
8106 "d": " all of the mentioned"
8107 }
8108 },
8109 {
8110 "name": "Question 737",
8111 "desc": "What is a Cybernetics?",
8112 "ans": "b",
8113 "opt": {
8114 "a": " Study of communication between two machines",
8115 "b": " Study of communication between human and machine",
8116 "c": " Study of communication between two humans",
8117 "d": " Study of Boolean values"
8118 }
8119 },
8120 {
8121 "name": "Question 738",
8122 "desc": "What is the goal of artificial intelligence?",
8123 "ans": "c",
8124 "opt": {
8125 "a": " To solve real-world problems",
8126 "b": " To solve artificial problems",
8127 "c": " To explain various sorts of intelligence",
8128 "d": " To extract scientific causes"
8129 }
8130 },
8131 {
8132 "name": "Question 739",
8133 "desc": "An algorithm is complete if",
8134 "ans": "a",
8135 "opt": {
8136 "a": " It terminates with a solution when one exists",
8137 "b": " It starts with a solution",
8138 "c": " It does not terminate with a solution",
8139 "d": " It has a loop"
8140 }
8141 },
8142 {
8143 "name": "Question 740",
8144 "desc": "Which is true regarding BFS (Breadth First Search)?",
8145 "ans": "b",
8146 "opt": {
8147 "a": " BFS will get trapped exploring a single path",
8148 "b": " The entire tree so far been generated must be stored in BFS",
8149 "c": " BFS is not guaranteed to find a solution, if exists",
8150 "d": " BFS is nothing but Binary First Search"
8151 }
8152 },
8153 {
8154 "name": "Question 741",
8155 "desc": "What is a heuristic function?",
8156 "ans": "d",
8157 "opt": {
8158 "a": " A function to solve mathematical problems",
8159 "b": " A function which takes parameters of type string and returns an integer value",
8160 "c": " A function whose return type is nothing",
8161 "d": " A function that maps from problem state descriptions to measures of desirability"
8162 }
8163 },
8164 {
8165 "name": "Question 742",
8166 "desc": "The traveling salesman problem involves n cities with paths connecting the citiesThe time taken for traversing through all the cities, without knowing in advance the length of a minimum tour, is",
8167 "ans": "c",
8168 "opt": {
8169 "a": " O(n)",
8170 "b": " O(n2)",
8171 "c": " O(n!)",
8172 "d": " O(n/2)"
8173 }
8174 },
8175 {
8176 "name": "Question 743",
8177 "desc": "The problem space of means-end analysis has",
8178 "ans": "a",
8179 "opt": {
8180 "a": " An initial state and one or more goal states",
8181 "b": " One or more initial states and one goal state",
8182 "c": " One or more initial states and one or more goal state",
8183 "d": " One initial state and one goal state"
8184 }
8185 },
8186 {
8187 "name": "Question 744",
8188 "desc": "An algorithm A is admissible if",
8189 "ans": "b",
8190 "opt": {
8191 "a": " It is not guaranteed to return an optimal solution when one exists",
8192 "b": " It is guaranteed to return an optimal solution when one exists",
8193 "c": " It returns more solutions, but not an optimal one",
8194 "d": " It guarantees to return more optimal solutions"
8195 }
8196 },
8197 {
8198 "name": "Question 745",
8199 "desc": "Knowledge may be",
8200 "ans": "d",
8201 "opt": {
8202 "a": " Declarative.",
8203 "b": ". Procedural.",
8204 "c": "I. Non-procedural.",
8205 "d": " Only (I) above"
8206 }
8207 },
8208 {
8209 "name": "Question 746",
8210 "desc": "Idempotency law is",
8211 "ans": "a",
8212 "opt": {
8213 "a": " P � P = P.",
8214 "b": ". P � P = P.",
8215 "c": "I. P + P = P.",
8216 "d": " Only (I) above"
8217 }
8218 },
8219 {
8220 "name": "Question 747",
8221 "desc": "In 1985, the famous chess player David Levy beat a world champion chess program in four straight games by using orthodox moves that confused the programWhat was the name of the chess program?",
8222 "ans": "b",
8223 "opt": {
8224 "a": " Kaissa",
8225 "b": " CRAY BLITZ",
8226 "c": " Golf",
8227 "d": " DIGDUG"
8228 }
8229 },
8230 {
8231 "name": "Question 748",
8232 "desc": "The explanation facility of an expert system may be used to:",
8233 "ans": "d",
8234 "opt": {
8235 "a": " construct a diagnostic model",
8236 "b": " expedite the debugging process",
8237 "c": " explain the system�s reasoning process",
8238 "d": " explain the system�s reasoning process & expedite the debugging process"
8239 }
8240 },
8241 {
8242 "name": "Question 749",
8243 "desc": "Visual clues that are helpful in computer vision include:",
8244 "ans": "d",
8245 "opt": {
8246 "a": " color and motion",
8247 "b": " depth and texture",
8248 "c": " height and weight",
8249 "d": " color and motion, depth and texture"
8250 }
8251 },
8252 {
8253 "name": "Question 750",
8254 "desc": "In which of the following areas may ICAI programs prove to be useful?",
8255 "ans": "d",
8256 "opt": {
8257 "a": " educational institutions",
8258 "b": " corporations",
8259 "c": " department of Defense",
8260 "d": " all of the mentioned"
8261 }
8262 },
8263 {
8264 "name": "Question 751",
8265 "desc": "A network with named nodes and labeled arcs that can be used to represent certain natural language grammars to facilitate parsing.",
8266 "ans": "c",
8267 "opt": {
8268 "a": " Tree Network",
8269 "b": " Star Network",
8270 "c": " Transition Network",
8271 "d": " Complete Network"
8272 }
8273 },
8274 {
8275 "name": "Question 752",
8276 "desc": "Computers normally solve problem by breaking them down into a series of yes-or-no decisions represented by 1s and 0sWhat is the name of the logic that allows computers to assign numerical values that fail somewhere between 0 and 1?",
8277 "ans": "b",
8278 "opt": {
8279 "a": " Human logic",
8280 "b": " Fuzzy logic",
8281 "c": " Boolean logic",
8282 "d": " Operational logic"
8283 }
8284 },
8285 {
8286 "name": "Question 753",
8287 "desc": "The company that grew out of research at the MIT AI lab is:",
8288 "ans": "d",
8289 "opt": {
8290 "a": " AI corp",
8291 "b": " LMI",
8292 "c": " Symbolics",
8293 "d": " both LMI & Symbolics"
8294 }
8295 },
8296 {
8297 "name": "Question 754",
8298 "desc": "Which technique is being investigated as an approach to automatic programming?",
8299 "ans": "b",
8300 "opt": {
8301 "a": " generative CAI",
8302 "b": " specification by example",
8303 "c": " non-hierarchical planning",
8304 "d": " all of the mentioned"
8305 }
8306 },
8307 {
8308 "name": "Question 755",
8309 "desc": "The primary method that people use to sense their environment is:",
8310 "ans": "d",
8311 "opt": {
8312 "a": " reading",
8313 "b": " writing",
8314 "c": " speaking",
8315 "d": " seeing"
8316 }
8317 },
8318 {
8319 "name": "Question 756",
8320 "desc": "The Newell and Simon program that proved theorems of Principal Mathematical was:",
8321 "ans": "c",
8322 "opt": {
8323 "a": " Elementary Perceiver",
8324 "b": " General Problem Solver",
8325 "c": " Logic Theorist",
8326 "d": " Boolean Algebra"
8327 }
8328 },
8329 {
8330 "name": "Question 757",
8331 "desc": "The cray X-MP, IBM 3090 and connection machine can he characterized as",
8332 "ans": "b",
8333 "opt": {
8334 "a": " SISD",
8335 "b": " SIMD",
8336 "c": " MISD",
8337 "d": " MIMD"
8338 }
8339 },
8340 {
8341 "name": "Question 758",
8342 "desc": "Output segments of AI programming contain?",
8343 "ans": "d",
8344 "opt": {
8345 "a": " Printed language and synthesized",
8346 "b": " Manipulation of physical object",
8347 "c": " Locomotion",
8348 "d": " All of the mentioned"
8349 }
8350 },
8351 {
8352 "name": "Question 759",
8353 "desc": "In LISP, the square root of X is referenced as?",
8354 "ans": "b",
8355 "opt": {
8356 "a": " sqrt(x)",
8357 "b": " (sqrt x)",
8358 "c": " x/2",
8359 "d": " x/3"
8360 }
8361 },
8362 {
8363 "name": "Question 760",
8364 "desc": "How can you evaluate 1.25 + sqrt (144) in LISP?",
8365 "ans": "c",
8366 "opt": {
8367 "a": " 1.25+sqrt (1.44)",
8368 "b": " (1.25+sqrt (1.44))",
8369 "c": " (+1.25 sqrt (1.44)",
8370 "d": " All of the mentioned"
8371 }
8372 },
8373 {
8374 "name": "Question 761",
8375 "desc": "When a top-level function is entered, the LISP processor does?",
8376 "ans": "b",
8377 "opt": {
8378 "a": " It reads the function entered",
8379 "b": " It prints the result returned by the function",
8380 "c": " Large memory and high-speed processor",
8381 "d": " All of the mentioned"
8382 }
8383 },
8384 {
8385 "name": "Question 762",
8386 "desc": "Which kind of planning consists of successive representations of different levels of plan?",
8387 "ans": "a",
8388 "opt": {
8389 "a": " Hierarchical planning",
8390 "b": " Non-hierarchical planning",
8391 "c": " Project planning",
8392 "d": " All of the mentioned"
8393 }
8394 },
8395 {
8396 "name": "Question 763",
8397 "desc": "The component of an ICAI (Intelligent Computer Assisted Instruction) presenting information to the student is the?",
8398 "ans": "c",
8399 "opt": {
8400 "a": " Student model",
8401 "b": " Problem solving expertise",
8402 "c": " Tutoring module",
8403 "d": " All of the mentioned"
8404 }
8405 },
8406 {
8407 "name": "Question 764",
8408 "desc": "In which of the following situations might a blind search be acceptable",
8409 "ans": "c",
8410 "opt": {
8411 "a": " Real life situation",
8412 "b": " Complex game",
8413 "c": " Small search space",
8414 "d": " All of the mentioned"
8415 }
8416 },
8417 {
8418 "name": "Question 765",
8419 "desc": "The hardware feature of LISP machines generally include?",
8420 "ans": "d",
8421 "opt": {
8422 "a": " Large memory and high-speed processor",
8423 "b": " Letter quality printers and eight -inch disk drives",
8424 "c": " A mouse and specialized keyboard",
8425 "d": " A mouse and specialized keyboard, Letter quality printers and eight -inch disk drives"
8426 }
8427 }
8428]