CODE | CSA1017 | |||||||||
TITLE | Data Structures and Algorithms 1 | |||||||||
UM LEVEL | 01 - Year 1 in Modular Undergraduate Course | |||||||||
MQF LEVEL | 5 | |||||||||
ECTS CREDITS | 6 | |||||||||
DEPARTMENT | Artificial Intelligence | |||||||||
DESCRIPTION | This unit aims to introduce the concepts of algorithm and data structure, highlighting the relation that exists between the two. The concepts are introduced in a gradual fashion, proceeding from abstract principles to concrete examples. Correctness and efficiency will be emphasized as the main properties of algorithms. A number of algorithms will be discussed, with emphasis on sorting and searching. Abstract data types (ADTs) will be formally defined and illustrated with case studies for list, stack, queue, priority queues and heaps, and the ADT table. Finally, the structure of binary trees and the associated algorithms will be investigated. Textbooks: • Mark Allen Weiss, Data Structures and Algorithm Analysis, Benjamin Cummings. • D Harel, Algorithmics: The Spirit of Computing, Addison-Wesley. • Cormen, Leiserson, Rivest, Introduction to Algorithms, McGraw Hill. |
|||||||||
RULES/CONDITIONS | Before TAKING THIS UNIT YOU ARE ADVISED TO TAKE ICS1251 | |||||||||
STUDY-UNIT TYPE | Lecture | |||||||||
METHOD OF ASSESSMENT |
|
|||||||||
LECTURER/S | John M. Abela (Co-ord.) Kristian Guillaumier |
|||||||||
The University makes every effort to ensure that the published Courses Plans, Programmes of Study and Study-Unit information are complete and up-to-date at the time of publication. The University reserves the right to make changes in case errors are detected after publication.
The availability of optional units may be subject to timetabling constraints. Units not attracting a sufficient number of registrations may be withdrawn without notice. It should be noted that all the information in the description above applies to study-units available during the academic year 2023/4. It may be subject to change in subsequent years. |