All categories

3 years ago

Need help with these

Computers and Technology

1 answer:

kolbaska11 [484]3 years ago

3 0

The first one is d the second one is true the third one is false

You might be interested in

Web designers use programming languages to write websites. A True <br> B False

KonstantinChe [14]

Answer: False

Explanation:

Web designers are not using programming languages to write websites.

6 0

2 years ago

Read 2 more answers

Click to review the online content. Then answer the question(s) below, using complete sentences. Scroll down to view additional

kumpel [21]

Explanation:

hope this help here is the answer

3 0

3 years ago

Whenever I ask a question I loose points I just asked a question before and I had 56 points now I have 12 now I'll probably have

lilavasa [31]

Just try to answer some questions as well, then you can keep a nice balance.
ps. Only answer the questions you know.

5 0

2 years ago

Determine whether or not the following pairs of predicates are unifiable. If they are, give the most-general unifier and show th

Evgen [1.6K]

Answer:

a) P(B,A,B), P(x,y,z)

=> P(B,A,B) , P(B,A,B}

Hence, most general unifier = {x/B , y/A , z/B }.

b. P(x,x), Q(A,A)

No mgu exists for this expression as any substitution will not make P(x,x), Q(A, A) equal as one function is of P and the other is of Q.

c. Older(Father(y),y), Older(Father(x),John)

Thus , mgu ={ y/x , x/John }.

d) Q(G(y,z),G(z,y)), Q(G(x,x),G(A,B))

=> Q(G(x,x),G(x,x)), Q(G(x,x),G(A,B))

This is not unifiable as x cannot be bound for both A and B.

e) P(f(x), x, g(x)), P(f(y), A, z)

=> P(f(A), A, g(A)), P(f(A), A, g(A))

Thus , mgu = {x/y, z/y , y/A }.

Explanation:

Unification: Any substitution that makes two expressions equal is called a unifier.

a) P(B,A,B), P(x,y,z)

Use { x/B}

=> P(B,A,B) , P(B,y,z)

Now use {y/A}

=> P(B,A,B) , P(B,A,z)

Now, use {z/B}

=> P(B,A,B) , P(B,A,B}

Hence, most general unifier = {x/B , y/A , z/B }

b. P(x,x), Q(A,A)

No mgu exists for this expression as any substitution will not make P(x,x), Q(A, A) equal as one function is of P and the other is of Q

c. Older(Father(y),y), Older(Father(x),John)

Use {y/x}

=> Older(Father(x),x), Older(Father(x),John)

Now use { x/John }

=> Older(Father(John), John), Older(Father(John), John)

Thus , mgu ={ y/x , x/John }

d) Q(G(y,z),G(z,y)), Q(G(x,x),G(A,B))

Use { y/x }

=> Q(G(x,z),G(z,x)), Q(G(x,x),G(A,B))

Use {z/x}

=> Q(G(x,x),G(x,x)), Q(G(x,x),G(A,B))

This is not unifiable as x cannot be bound for both A and B

e) P(f(x), x, g(x)), P(f(y), A, z)

Use {x/y}

=> P(f(y), y, g(y)), P(f(y), A, z)

Now use {z/g(y)}

P(f(y), y, g(y)), P(f(y), A, g(y))

Now use {y/A}

=> P(f(A), A, g(A)), P(f(A), A, g(A))

Thus , mgu = {x/y, z/y , y/A }.

7 0

3 years ago

Write a generator function named count_seq that doesn't take any parameters and generates a sequence that starts like this: 2, 1

-BARSIC- [3]

Answer:

#required generator function

def count_seq():

#starting with number 2. using string instead of integers for easy manipulation

n='2'

#looping indefinitely

while True:

#yielding the integer value of current n

yield int(n)

#initializing an empty string

next_value=''

#looping until n is an empty string

while len(n)>0:

#extracting first digit (as char)

first=n[0]

#consecutive count of this digit

count=0

#looping as long as n is non empty and first digit of n is same as first

while len(n)>0 and n[0]==first:

#incrementing count

count+=1

#removing first digit from n

n=n[1:]

#now appending count and first digit to next_value

next_value+='{}{}'.format(count,first)

#replacing n with next_value

n=next_value

#testing, remove if you don't need this

if __name__ == '__main__':

#creating a generator from count_seq()

gen=count_seq()

#looping for 10 times, printing next value

for i in range(10):

print(next(gen))

Explanation:

6 0

3 years ago