Assessment

Question 1 of 7

1

Tick the answer(s). There can be more than one answers

In order to recursively define an entity, we need

Select one or more of the following:

A number of base cases - describes simple instances of the entity
A number of step cases - describes complicated instances of the entity
Define the operations should do for each base cases
Define the operations should do for each step cases
Come out with the algorithm first

Explanation

Question 2 of 7

1

[40, 20, 3] = ❌
= ❌
= ❌

Drag and drop to complete the text.

40 : [20, 3]

40 : 20 : [3]

40 : 20 : 3 : [ ]

Explanation

Question 3 of 7

1

Is the mathematical recursive definition related to programming?

Select one of the following:

Yes
No
I am not very sure. But since recursion is used in programming, they should be related?

Explanation

Question 4 of 7

1

add[2, 4, 10] = ❌
= 2 + ❌
= 2 + ❌
= 2 + 4 + ❌
= 2 + 4 + ❌
= ❌
= 2 + 4 + 10
= 16

Drag and drop to complete the text.

add( 2 : [4, 10] )

2 + 4 + 10 + add[ ]

add( 10 : [ ] )

add[4, 10]

add( 4 : [10] )

add[10]

Explanation

Question 5 of 7

1

[99, 9] ++ [23, 1] = ❌
= 99 : ❌
= 99 : ❌
= 99 : ❌
= 99 : ❌
= 99 : 9 : [23, 1]
= [99, 9, 23, 1]

Drag and drop to complete the text.

(99 : [9]) ++ [23, 1]

([9] ++ [23, 1])

((9 : [ ]) ++ [23, 1])

(9 : ([ ] ++ [23, 1]))

(9 : ([23, 1]))

Explanation

Question 6 of 7

1

Can we prove the property by induction?

Select one of the following:

Why do we need to prove? Its already proven!
Yes we need to prove this

Explanation

Question 7 of 7

1

What are the orders to prove them?

1) Replace the statement with ❌
2) Prove the replaced statement using ❌
3) Replace the statement with ❌
4) Prove the replaced statement using ❌
5) Make us of ❌

Drag and drop to complete the text.

the base case of Lists

the properties given

the step case of Lists

the property given

the induction hypothesis

	Created by kanghsien92 over 9 years ago

Assessment

Assessment

Question 1 of 7

Tick the answer(s). There can be more than one answers In order to recursively define an entity, we need

Select one or more of the following:

Explanation

Question 2 of 7

[40, 20, 3] = ❌ = ❌ = ❌

Drag and drop to complete the text.

Explanation

Question 3 of 7

Is the mathematical recursive definition related to programming?

Select one of the following:

Explanation

Question 4 of 7

add[2, 4, 10] = ❌ = 2 + ❌ = 2 + ❌ = 2 + 4 + ❌ = 2 + 4 + ❌ = ❌ = 2 + 4 + 10 = 16

Drag and drop to complete the text.

Explanation

Question 5 of 7

[99, 9] ++ [23, 1] = ❌ = 99 : ❌ = 99 : ❌ = 99 : ❌ = 99 : ❌ = 99 : 9 : [23, 1] = [99, 9, 23, 1]

Drag and drop to complete the text.

Explanation

Question 6 of 7

Can we prove the property by induction?

Select one of the following:

Explanation

Question 7 of 7

What are the orders to prove them? 1) Replace the statement with ❌ 2) Prove the replaced statement using ❌ 3) Replace the statement with ❌ 4) Prove the replaced statement using ❌ 5) Make us of ❌

Drag and drop to complete the text.

Explanation

Tick the answer(s). There can be more than one answers

In order to recursively define an entity, we need

[40, 20, 3] = ❌
= ❌
= ❌

add[2, 4, 10] = ❌
= 2 + ❌
= 2 + ❌
= 2 + 4 + ❌
= 2 + 4 + ❌
= ❌
= 2 + 4 + 10
= 16

[99, 9] ++ [23, 1] = ❌
= 99 : ❌
= 99 : ❌
= 99 : ❌
= 99 : ❌
= 99 : 9 : [23, 1]
= [99, 9, 23, 1]

What are the orders to prove them?

1) Replace the statement with ❌
2) Prove the replaced statement using ❌
3) Replace the statement with ❌
4) Prove the replaced statement using ❌
5) Make us of ❌