Knowledge-representation
Question 1 |

(a)-(iii), (b)-(iv), (c)-(i), (d)-(ii) | |
(a)-(iii), (b)-(iv), (c)-(ii), (d)-(i) | |
(a)-(iv), (b)-(iii), (c)-(i), (d)-(ii) | |
(a)-(iv), (b)-(iii), (c)-(ii), (d)-(i) |
Question 1 Explanation:
Intelligence → Judgemental
Knowledge → Codifiable, endorsed with relevance and purpose
Information → Scattered facts, easily transferable
Data → Contextual, tacit, transfer needs learning
Knowledge → Codifiable, endorsed with relevance and purpose
Information → Scattered facts, easily transferable
Data → Contextual, tacit, transfer needs learning
Question 2 |
An agent can improve its performance by
Learning
| |
Responding
| |
Observing
| |
Perceiving
|
Question 2 Explanation:
→ An intelligent agent (IA) is an autonomous entity which observes through sensors and acts upon an environment using actuators (i.e. it is an agent) and directs its activity towards achieving goals (i.e. it is "rational", as defined in economics).
→ Intelligent agents may also learn or use knowledge to achieve their goals. They may be very simple or very complex. A reflex machine, such as a thermostat, is considered an example of an intelligent agent.
→ Intelligent agents may also learn or use knowledge to achieve their goals. They may be very simple or very complex. A reflex machine, such as a thermostat, is considered an example of an intelligent agent.

Question 3 |
In Challenge-Response authentication the claimant
Proves that she knows the secret without revealing it | |
Proves that she doesn’t know the secret | |
Reveals the secret
| |
Gives a challenge |
Question 3 Explanation:
→ Challenge-Response authentication is a family of protocols in which one party presents a question ("challenge") and another party must provide a valid answer ("response") to be authenticated.
→ The simplest example of a challenge–response protocol is password authentication, where the challenge is asking for the password and the valid response is the correct password.
→ A more interesting challenge–response technique works as follows. Say, Bob is controlling access to some resource. Alice comes along seeking entry. Bob issues a challenge, perhaps "52w72y". Alice must respond with the one string of characters which "fits" the challenge Bob issued. The "fit" is determined by an algorithm "known" to Bob and Alice. (The correct response might be as simple as "63x83z" (each character of response one more than that of challenge), but in the real world, the "rules" would be much more complex.) Bob issues a different challenge each time, and thus knowing a previous correct response (even if it isn't "hidden" by the means of communication used between Alice and Bob) is of no use.
→ The simplest example of a challenge–response protocol is password authentication, where the challenge is asking for the password and the valid response is the correct password.
→ A more interesting challenge–response technique works as follows. Say, Bob is controlling access to some resource. Alice comes along seeking entry. Bob issues a challenge, perhaps "52w72y". Alice must respond with the one string of characters which "fits" the challenge Bob issued. The "fit" is determined by an algorithm "known" to Bob and Alice. (The correct response might be as simple as "63x83z" (each character of response one more than that of challenge), but in the real world, the "rules" would be much more complex.) Bob issues a different challenge each time, and thus knowing a previous correct response (even if it isn't "hidden" by the means of communication used between Alice and Bob) is of no use.
There are 3 questions to complete.