CE213-5-FY-KS:
Artificial Intelligence

The details
2024/25
Computer Science and Electronic Engineering (School of)
Kaplan Singapore
Full Year
Undergraduate: Level 5
Current
Thursday 03 October 2024
Friday 27 June 2025
15
08 November 2023

 

Requisites for this module
(none)
(none)
(none)
(none)

 

CE345

Key module for

BSC G610KS Computer Games

Module description

This module provides an introduction to three fundamental areas of artificial intelligence: search, knowledge representation and learning. These underpin all more advanced areas of artificial intelligence and are of central importance to related fields such as computer games and robotics.

Within each area, a range of methodologies and techniques are presented; emphasis is placed on understanding their strengths and weaknesses and hence on assessing which is most suited to a particular task. The module also provides an introduction to the philosophical arguments about the possibility of a machine being able to think. It concludes with a brief overview of systems based on interacting intelligent agents.

Module aims

This module aims to provide an introduction to three fundamental areas of artificial intelligence: search, knowledge representation and learning.

Module learning outcomes

After completing this module, students will be expected to be able to:

1. Explain and criticise the arguments that have been advanced both for and against the possibility of artificial intelligence.
2. Explain and implement standard blind and heuristic search procedures, demonstrate an understanding of their strengths and weaknesses and of how they may be applied to solve well-defined problems.
3. Explain the operation of standard production system interpreters, and demonstrate an understanding of their relative merits.
4. Explain the operation of a range of established machine learning procedures and demonstrate an understanding of the types of problems for which they are appropriate.
5. Demonstrate an understanding of the agent-oriented approach to artificial intelligence, and explain how a multi-agent system of purely reactive agents may be built using a subsumption architecture.

Module information

Outline Syllabus

1. Introduction
What AI is and is not
The debate about whether AI is possible

2. Solving problems by searching
State space representation
Search trees and graphs
Blind search strategies - depth first, breadth first and iterative deepening
Heuristic search - greedy search and A* search
Hill climbing
Game playing - minimax search
Means ends analysis
Implementing search

3. Using knowledge to solve problems
The importance of domain knowledge
Rule based systems
Forward chaining rule interpreters
Backward chaining rule interpreters

4. Acquiring knowledge - machine learning
Decision tree induction
Neural networks - back propagation
Clustering - k means algorithm
Reinforcement learning - Q algorithm
Genetic algorithms

5. Intelligent agents
Reactive v. deliberative agents
Subsumption architectures for purely reactive agents

Learning and teaching methods

Lectures and Classes

Bibliography

The above list is indicative of the essential reading for the course.
The library makes provision for all reading list items, with digital provision where possible, and these resources are shared between students.
Further reading can be obtained from this module's reading list.

Assessment items, weightings and deadlines

Coursework / exam Description Deadline Coursework weighting

Exam format definitions

  • Remote, open book: Your exam will take place remotely via an online learning platform. You may refer to any physical or electronic materials during the exam.
  • In-person, open book: Your exam will take place on campus under invigilation. You may refer to any physical materials such as paper study notes or a textbook during the exam. Electronic devices may not be used in the exam.
  • In-person, open book (restricted): The exam will take place on campus under invigilation. You may refer only to specific physical materials such as a named textbook during the exam. Permitted materials will be specified by your department. Electronic devices may not be used in the exam.
  • In-person, closed book: The exam will take place on campus under invigilation. You may not refer to any physical materials or electronic devices during the exam. There may be times when a paper dictionary, for example, may be permitted in an otherwise closed book exam. Any exceptions will be specified by your department.

Your department will provide further guidance before your exams.

Overall assessment

Coursework Exam
40% 0%

Reassessment

Coursework Exam
40% 60%
Module supervisor and teaching staff
Dr Vishal Singh, email: v.k.singh@essex.ac.uk.
CSEE School Office, email: csee-schooloffice non-Essex users should add @essex.ac.uk to create full e-mail address), Telephone 01206 872770

 

Availability
No
No
No

External examiner

No external examiner information available for this module.
Resources
Available via Moodle
No lecture recording information available for this module.

 

Further information

Disclaimer: The University makes every effort to ensure that this information on its Module Directory is accurate and up-to-date. Exceptionally it can be necessary to make changes, for example to programmes, modules, facilities or fees. Examples of such reasons might include a change of law or regulatory requirements, industrial action, lack of demand, departure of key personnel, change in government policy, or withdrawal/reduction of funding. Changes to modules may for example consist of variations to the content and method of delivery or assessment of modules and other services, to discontinue modules and other services and to merge or combine modules. The University will endeavour to keep such changes to a minimum, and will also keep students informed appropriately by updating our programme specifications and module directory.

The full Procedures, Rules and Regulations of the University governing how it operates are set out in the Charter, Statutes and Ordinances and in the University Regulations, Policy and Procedures.