CS607 Artificial Intelligence Assignment No-01 Last Date 18,November 2014

[Vuhelper]

CS607 Artificial Intelligence Assignment No-01 Last Date 18,November 2014



Question No. 1 [marks 10]
Part-A.

Complete the following series:



1 x 2 = 32



2 x 2 = 33



3 x 2 = 34



6 x 8 =?



Part-B.



Consider the following String:



“Hello VU”



Suppose we applied some encoding technique to encode it and the resulted string was”



“ifmm wv”



Similarly the string “Zubair” was encoded as “avcbjs”



Now try to encode the following string:



“My Name is Ali”



Part-C.



Suppose there are X birds on branch-1 and Y birds on branch-2. If the one bird from branch-1 flies to branch-2, the birds on branch-2 become double than those of left on branch-1, However, if one bird from branch-2 flies to branch-1, the birds on both of the branches become equal. You have to guess the initial bird count on both branches.



Question No. 2

Consider three glasses labeled “R”, “G” and “E”. Glass labeled “R” contains Red water, Glass labeled “G” contains Green water and the glass labeled “E” is empty. The problem is to swap the water of glass “R” and “G”, so that finally glass “R” contains green water and “G” contains red water. You can use the empty glass to complete the task. Draw the solution space for said problem showing initial and final state(s).

[Vuhelper]

#include <stdio.h>
#include <conio.h>
#include<iostream.h>
using namespace std;

int main()
{
int p;
p=32;
int ans;
for(int y=2; y<=8; y=y+2){ // y being even upto 8
for(int n=1; n<=9;n++){ // n being non zero digit
coutn"*"y"="p"\n";

p++;
}
}
system("PAUSE");
return EXIT_SUCCESS;
}

[education-2014]

estion No. 2
Consider three glasses labeled “R”, “G” and “E”. Glass labeled “R” contains Red water, Glass labeled “G” contains Green water and the glass labeled “E” is empty. The problem is to swap the water of glass “R” and “G”, so that finally glass “R” contains green water and “G” contains red water. You can use the empty glass to complete the task. Draw the solution space for said problem showing initial and final state(s)