ARTIFICIAL INTELLIGENCE OBJECTIVE QUESTIONS PART-1 FREE DOWNLOAD

UGC NET JUNE 2013 SYLLABUS, MODEL PAPER/ PREVIOUS YEARS SOLVED QUESTION PAPERS. 

UGC NET (NATIONAL ELIGIBILITY TEST) : OLD SOLVED/PREVIOUS EXAM QUESTION PAPERS WITH SOLUTIONS AND EXPLANATIONS AND FREE STUDY MATERIALS.

COMPUTER MEMORY BASED PREVIOUS YEARS SOLVED PAPERS I, II AND III TO PREPARE AND PASS THE UGC NET/SLET ENTRANCE EXAMINATION WITH HIGH PERCENTAGE.

COMPUTER BASIC QUESTIONS FOR BANK EXAM, HTET, CTET, TET, UGC-NET, INTERVIEW AND OTHER EXAM'S, WHERE BASIC QUESTION'S ARE REQUIRED.

IF YOU KNOW ANSWER OF ANY QUESTIONS PLEASE TELL ME. THAT ANSWER HELP THE OTHER STUDENT IN FUTURE. THANKS. PLEASE REPLY RIGHT ANSWER.

COMPUTER ARCHITECTURE OBJECTIVE  QUESTIONS WITH SOLUTIONS FREE DOWNLOAD

COMPUTER ARCHITECTURE SAMPLE PAPER WITH ANSWER FREE DOWNLOAD

1. What is Artificial intelligence?
(a) Putting your intelligence into Computer
(b) Programming with your own intelligence
(c) Making a Machine intelligent
(d) Playing a Game
(e) Putting more memory into Computer

2. Which is not the commonly used programming language for AI?
(a) PROLOG
(b) Java
(c) LISP
(d) Perl
(e) Java script.

3. What is state space?
(a) The whole problem
(b) Your Definition to a problem
(c) Problem you design
(d) Representing your problem with variable and parameter
(e) A space where You know the solution.

4. A production rule consists of
(a) A set of Rule (b) A sequence of steps
(c) Both (a) and (b) (d) Arbitrary representation to problem
(e) Directly getting solution.

5. Which search method takes less memory?
(a) Depth-First Search (b) Breadth-First search
(c) Both (a) and (b) (d) Linear Search.
(e) Optimal search.

6. A heuristic is a way of trying
(a) To discover something or an idea embedded in a program
(b) To search and measure how far a node in a search tree seems to be from a goal
(c) To compare two nodes in a search tree to see if one is better than the other
(d) Only (a) and (b)
(e) Only (a), (b) and (c).

7. A* algorithm is based on
(a) Breadth-First-Search (b) Depth-First –Search
(c) Best-First-Search (d) Hill climbing.
(e) Bulkworld Problem.

8. Which is the best way to go for Game playing problem?
(a) Linear approach (b) Heuristic approach
(c) Random approach (d) Optimal approach
(e) Stratified approach.

9. How do you represent “All dogs have tails”.
(a) ۷x: dog(x)àhastail(x) (b) ۷x: dog(x)àhastail(y)
(c) ۷x: dog(y)àhastail(x) (d) ۷x: dog(x)àhasàtail(x)
(e) ۷x: dog(x)àhasàtail(y)

10. Which is not a property of representation of knowledge?
(a) Representational Verification (b) Representational Adequacy
(c) Inferential Adequacy (d) Inferential Efficiency
(e) Acquisitional Efficiency.

  FOR MORE QUESTIONS CLICK BELOW LINKS..IT'S FREE
ARTIFICIAL INTELLIGENCE QUESTIONS PART-1 FREE DOWNLOAD

OR

 ARTIFICIAL INTELLIGENCE QUESTIONS PART-2 FREE DOWNLOAD

IF YOU FIND ANY ANSWER WRONG,COMMENT ME, SO THAT I RIGHT THAT ANSWER

IF YOU HAVE ANY STOCK OF QUESTION, THEN PLEASE SEND ME FOR OTHER HELP FULL STUDENTS.
THANK 

Posted in: ARTIFICIAL INTELLIGENCE