Algorithms and Data Structures (AI)

Uitgebreide vaknaam	Algorithms and Data Structures (AI)
Leerdoelen	At the end of the course, students are able to 1) Implement common algorithms and data structures in C, including ◦ Linear data structures, including stacks, queues, and lists ◦ Trees, including search trees, heaps, and tries ◦ Graphs ◦ Dijkstra’s algorithm for shortest path ◦ Depth first search, Breadth first search, and A* search 2) Analyze simple computational problems in terms of data structures and algorithms 3) Design pseudocode algorithms for the data structures described above 4) Analyze algorithms in terms of their time and space complexity 5) Apply proper programming style and documentation practices
Omschrijving	This course builds on the course Imperative Programming. We will cover fundamental data structures and algorithms from three areas: linear structures (stacks, queues, linked lists), trees and graphs. For each structure we will see its definition, an implementation and applications. Further attention will be paid to 'good programming', i.e. the design of correct, efficient and understandable programs and their documentation. Besides lectures there will be tutorials with theoretical exercises and lab sessions where you will develop your own programs. The main programming language used in this course is C.
Uren per week
Onderwijsvorm	Hoorcollege (LC), Opdracht (ASM), Practisch werk (PRC), Werkcollege (T)
Toetsvorm	Opdracht (AST), Schriftelijk tentamen (WE) (The written exam is a digital exam. The average grade on the assignments (ASM) and the exam grade (DE) must both be at least a 5 to pass the course. If either one is below a 5, the final grade is the minimum of ASM and DE. Otherwise, the final grade is: 0.4 ASM + 0.6 DE)
Vaksoort	propedeuse
Coördinator	dr. H.A. de Weerd
Docent(en)	dr. H.A. de Weerd
Verplichte literatuur	Titel Auteur ISBN Prijs The C Programming Language, Second Edition (Prentice Hall, Inc., 1988). Brian W. Kernighan and Dennis M. Ritchie. 978-0-13-110362-7 Lecture Notes for Algorithms and Data Structures in C. Available on Nestor
Entreevoorwaarden	Mandatory: No mandatory entry requirements. Advised: Students are expected to have knowledge and programming skills sufficient to complete the Imperative Programming for AI course (WBAI003-05).
Opmerkingen	Artificial Intelligence (BSc) is a Fixed Quota (Numerus Fixus) programme. As a consequence, their courses (course code WBAI) are closed for students that are not registered under the AI BSc programme, unless the course is part of the mandatory curriculum of their programme. If you wish to take this course in your minor – or as part of a so-called ‘unofficial’ pre-master’s – please use the official procedure through the Board of Examiners form.
Opgenomen in	Opleiding Jaar Periode Type BSc Kunstmatige Intelligentie 1 semester II a verplicht Pre-master/Fast-track for MSc AI - CCS – CS - Math  (Artificial Intelligence) - semester II a -