15840_15840hw1ece434

Upload: amit-jaiswal

Post on 04-Apr-2018

214 views

Category:

Documents


0 download

TRANSCRIPT

  • 7/29/2019 15840_15840HW1ECE434

    1/6

    HOMEWORK -1

    DOA: 26/01/2013 DOS: 06/02/2013

    PartI

    Q1. What is Total Turing Test? How it is different from General Turing Test? What are the resources we require

    for passing Total Turing Test?

    Q2. Write a brief note on the following four approaches in AI and state its importance and their application area:

    (a). Acting Humanly: The Turing Test Approach.

    (b). Thinking Humanly: The Cognitive Modelling Approach.

    (c). Think Rationally: The Law of Thought Approach.

    (d). Acting Rationally: The Rational Agent Approach.

    Q3. Every year the Loebner prize is awarded to the program that comes closest to passing a version of Turing Tes

    Research and report on the winner of the Loebner prize for your respective year. What techniques does it use

    How it advance the state of art in AI? (Note: The Roll No. 1 will search for the year 1991, Roll No. 2 will search fo

    year 1992, and so on, Repeat again after the year 2012).

    Q4. Examine the AI Literature and explore the web to discover whether the following tasks can be currently be

    solved with the AI systems or no? If not possible what are the difficulties we face and predict how they can be

    overcome so as to make them feasible? The task to explore is assigned as per the following table:

    S.No. Roll No. Problem Assigned S.No. Roll No. Problem Assigned

    01. 01, 13, 21, 26, 34, 40 (a) 05. 02, 14, 25, 35 (e)

    02. 05, 09, 17, 29, 36 (b) 06. 06, 10, 18, 30, 37 (f)

    03. 03, 15, 19, 27, 31 (c) 07. 04,16, 28, 32 (g)

    04. 07, 11, 20, 23, 33, 38 (d) 08. 08, 12, 23, 39 (h)

    (a). Driving the Unmanned Vehicle in the centre of New Delhi.

    (b). Buying a weeks worth of groceries at the market.

  • 7/29/2019 15840_15840HW1ECE434

    2/6

    (c). Buying clothes on the web.

    (d). Discovering and proving new mathematical theorems.

    (e). Writing an intentionally funny story.

    (f). Translating spoken English into spoken Swedish in real time.

    (g). Performing a complex surgical problem by a robot.

    (h). An artificial hand or leg to an amputee.

    Q5. Explore the web to know about the following Expert Systems :

    S.No. Roll No. Problem Assigned S.No. Roll No. Problem Assigned

    01. 04, 14, 21, 25, 33,

    38

    (a) 05. 03, 15, 22, 27, 35,

    37

    (e)

    02. 07, 09, 18, 29 (b) 06. 08, 10, 17, 31 (f)

    03. 05, 13, 23, 32, 36 (c) 07. 06, 16, 24, 30, 34 (g)

    04. 01, 11, 20, 28, 39 (d) 08. 02, 12, 19, 26, 40 (h)

    (a). DENDRAL (b). MYCIN

    (c). XCON (d). PUFF

    (e). PROSPECTOR (f). DESIGN ADVISOR

    (g). LITHIAN (h). PEES (Power Electronics Expert System)

    PartII

    Q6. Give the initial state, goal state, successor function, and cost function for each of the famous AI problems

    Formulate the problem and tell why there is the need of searching. The problem is assigned as Roll Number wise a

    per table below:

    S.No. Roll No. Problem

    Assigned

    S.No. Roll No. Problem

    Assigned

    01. 01, 09, 17, 29, 33 (a) 05. 05, 13, 19, 32, 40 (e)

    02. 02, 10, 21, 31, 37 (b) 06. 06, 14, 24, 30, 35 (f)

    03. 03, 11, 23, 27, 36 (c) 07. 07, 15, 22, 26, 34 (g)

    04. 04, 12, 20, 25, 39 (d) 08. 08, 16, 18, 28, 38 (h)

  • 7/29/2019 15840_15840HW1ECE434

    3/6

    (a). You have to paint a planar map using only four colors, in such a way that no two adjacent regions have the

    same color. There are 16 small regions in a big square.

    (b). You have 3 jugs, measuring 12 gallons, 8 gallons and 3 gallons, and a water tank. You need to measure ou

    exactly one gallon.

    (c). Tic-Tac-Toe problem

    (d). Travelling Salesman Problem (TSP) where the number of cities given are 14. Draw the cities in such a way tha

    there will be a starting city, in between branches of starting city and last destination city.

    (e). You have 2 jugs, measuring 4 gallons and 3 gallons, and a water tank. You need to measure out exactly two

    gallon in a jug having capacity 4 gallons

    (f).There is a farmer having a Lion, Goat and a bundle of Grass. They all are at the North Bank of the river. The

    farmer has to take all of them to the other bank i.e. South Bank of the river. The constraint is this that farmer can

    take any one of them along with him on a boat and the Tiger can eat Goat and Goat can eat Grass in the absence o

    the farmer.

    (g). Formulate a 8-Puzzle problem. Define the initial state and the goal state by your own.

    (h). Formulate 8-Queen Problem. The 8 queens will be placed in such a way that no two queens would be able to

    attack each other. Given 8x8 board.

    (i). There are 3 pegs A, B and C. There are 4 dices which are placed at A in the increasing order of their diamete

    from top to bottom. You need to take all the dices to peg C using peg B in such a way that bigger dice will not be

    placed on the smaller dice.

    Q7. Solve the following Alpha Numeric Sequence Puzzle (or CRYPTARITHMETIC) according to the followin

    table below. Check your Roll Number and solve the problem. Note that each number is represented by a uniqu

    alphabet.

    S.No. Roll No. Problem Assigned S.No. Roll No. Problem Assigned

    01. 03, 14, 19, 22, 32 (b) 05. 02, 18, 25, 30 (e)

    02. 05, 10,13, 26, 33,

    39

    (c) 06. 06, 11, 24, 36 (g)

    03. 09, 15, 20, 27, 34,

    40

    (a) 07. 04, 07, 23, 37 (f)

    04. 01, 16, 21, 28, 31 (d) 08. 08, 12, 17, 29, 35 (c)

    (a). NO + MAN + NO = HAND

    (b). SPOT + A + TOP = GHOST

  • 7/29/2019 15840_15840HW1ECE434

    4/6

    (c). S E N D (d). R O A D S

    + M O R E + C R O S S

    M O N E Y D A N G E R

    (e). D O N A L D (f). L O G I C

    + G E R A L D + L O G I C

    R O B E R T P R O L O G

    (g). A S S

    x A S

    A L S O

    R O S E

    A L L L O

    Q8. . Define the following terms briefly(Within 3-4 lines) as per your roll no. and the term allotted to you?

    (a). Artificial Neural Network. (b). Swarm Intelligence

    (c). McCulloch-Pitts Model (d). Ant Colony Optimization

    (e). Pattern Recognition (f). Statistical Pattern Recognition

    (g). Syntactical Pattern Recognition (h). Synapse, Dendrites, Axon, Neuro Transmitters

    (i). Genetic Algorithm (GA) (j). Evolutionary Algorithms

    (k). Fuzzy Logic (l). Natural Language Processing (NLP)

    (m). Computer Vision (n). Intelligent Agents

    S.No. Roll No. Assigned Terms

    01. 01, 10, 11, 20, 21, 30, 31, 38 (a), (f), (k), (f)

    02. 02, 09, 12, 19, 22, 29, 32, 33 (b), (g), (l), (e)

    03. 03, 08, 13, 18, 23, 28, 34, 40 (c), (h), (m), d)

    04. 04, 07, 14, 17, 24, 27, 35, 39 (d), (i), (n), (c)

    05. 05, 06, 15, 16, 25, 26, 36, 37 (e), (j), (a), (b)

    Q9. Solve the following problems as per the Roll No. assigned to you as per table by the following Search

    Algorithms:

    (a). Water-Jug Problem using DFS. (b). Water-Jug Problem using BFS.

    (c). FWCD Problem using DFS. (d). FWCD Problem using BFS.

  • 7/29/2019 15840_15840HW1ECE434

    5/6

    (e). Travelling Salesman Problem using A

    *(A Star) Algorithm (Take 8 Cities and takes SLD by your own).

    (f).Consider a state space where start node is numbered as 1 and the successor function for state numbered as n

    returns two states numbered as 3n and 3n-1. Suppose the goal is 24. List the order in which nodes will be visited

    using Depth First Search (DFS). Draw the search tree for this case.

    (g). Consider a state space where start node is numbered as 1 and the successor function for state numbered asn

    returns two states numbered as 3n and 3n-1. Suppose the goal is 24. List the order in which nodes will be visitedusing Breadth First Search (BFS). Draw the search tree for this case.

    (h). Consider a state space where start node is numbered as 1 and the successor function for state numbered as n

    returns two states numbered as 3n and 3n-1. Suppose the goal is 24. List the order in which nodes will be visited

    using Iterative Deepening Search (IDLS). Draw the search tree for this case.

    S.No. Roll No. Problem Assigned S.No. Roll No. Problem Assigned

    01. 01, 13, 21, 26, 34, 40 (a) 05. 02, 14, 25, 35 (e)

    02. 05, 09, 17, 29, 36 (b) 06. 06, 10, 18, 30, 37 (f)

    03. 03, 15, 19, 27, 31 (c) 07. 04,16, 28, 32 (g)

    04. 07, 11, 20, 23, 33, 38 (d) 08. 08, 12, 23, 39 (h)

    Q.10 Following are the topics discussing various applications of Artificial Intelligence. Read some research papers

    magazine, explore web to know how this system is achieving its goal by the help of AI. Explain your finding in 100

    words explaining how AI is helping in that field? What are the challenges we have to have 100% potential in that

    field?.

    (a). ASIMO Robot by Honda. (b). TOPIO Robot playing Table Tennis

    (c). Artificial Hand or Leg to an Amputee (d). STANLEY Motor Car by Stanford

    (e). Automatic Voice Recognition (f). Automatic Grading of Apples

    (g). Chess Game in Windows Games (h). How Google Search Engine Works

    S.No. Roll No. Problem Assigned S.No. Roll No. Problem Assigned

    01. 04, 09, 17, 25, 35 (a) 05. 02, 13, 23, 27, 33 (e)

    02. 05, 11, 22, 30, 40 (b) 06. 08, 15, 18, 31, 38 (f)

    03. 07, 14, 19, 29, 39 (c) 07. 06, 12, 24, 32, 37 (g)

    04. 01, 16, 21, 28, 34 (d) 08. 03, 10, 20, 26, 36 (h)

  • 7/29/2019 15840_15840HW1ECE434

    6/6

    Instructions for doing the Assignment

    1. Explore books, notes, net , journals or IEEE papers to solve the problems.2. The assignment should be handwritten on A4 sheets. Write briefly and dont fill pages. The Purpose of

    assignment is to make you explore the things that are happening due to AI. Dont work on assignment to

    fetch more marks but to widen your knowledge about AI in real life problems and how it is achieved.

    3. The pages of the assignment will be duly stapled and your name, reg. no, section, course code shouldappear on the assignment.

    4. You should write on both the sides of the A4 sheet.5. In case of any doubt you should approach me in my cabin 33-210 (Chamber-1). Further any excuse will no

    be taken care on your account.

    6. Adhere to the deadline. Your assignment should reach me by 4pm of 6th February, 2013.