CloseHelpPrint
Kies de Nederlandse taal
Course module: JBP031-B-6
JBP031-B-6
Data-structures and Algorithms
Course info
Course moduleJBP031-B-6
Credits (ECTS)6
CategoryBA (Bachelor)
Course typeCourse
Language of instructionEnglish
Offered byTilburg University; Tilburg School of Economics and Management; TiSEM: Management; TiSEM: Management;
Is part of
PM Data Science & Entrepreneurship
Lecturer(s)
Lecturer
dr. K.A. Buchin
Other course modules lecturer
Academic year2019
Starting block
SM 2
Course mode
Full-time
Remarks-
Registration openfrom 07/01/2020 up to and including 21/08/2020
Aims
Many aspects of Data Science rely on computers to do the heavy lifting for computing results, handling data, etc. With larger datasets, it becomes crucial that such computations and the handling of data are performed efficiently in terms of the time needed for the computations and the space used to store the data.
In this course, you will develop basic skills and knowledge to create, select and reason about efficient algorithms and data structures. For this, we consider different basic algorithms and data structures for frequently appearing problems, techniques for designing efficient algorithms, how to establish that an algorithm is correct by a mathematical proof, and how to analyse the efficiency of an algorithm or data structure.

Specifics

The course will be based on a formal exam and practical assignments.


This course is open for students enrolled in the pre-master’s program Data Science and Entrepreneurship only.
 
The courses from the premaster’s program Data Science and Entrepreneurship program require specific prior knowledge. It is only possible to participate in this course if approved by the admission committee and if you are enrolled for the pre-master’s program.
 
Please note that this course will be taught in Mariënburg, ‘s-Hertogenbosch (JADS).
Content

Students will learn about basic algorithms and data structures, and how to select an algorithm or data structure for a given task. These include

  •  arrays, lists, stacks and queues,
  •  searching and sorting algorithms,
  •  search trees,
  •  hash tables,
  •  heaps,
  •  and basic graph algorithms.

In addition, students will learn how to design simple algorithms using techniques like incremental algorithms and divide&conquer, how to prove that an algorithm is correct, and how to analyze algorithms and data structures in terms of their efficiency.

Type of instructions

Lectures and labs/instructions

Compulsory Reading
  1. The class notes and material from reference books will be used in this course..
Course available for exchange students
Conditions of admission apply
Contact person
dr. K.A. Buchin
Timetable information
Data-structures and Algorithms
Written test opportunities
DescriptionTestBlockOpportunityDate
Written test opportunities (HIST)
DescriptionTestBlockOpportunityDate
Exam (60%) / Exam (60%)EXAM_01SM 2103-06-2020
Exam (60%) / Exam (60%)EXAM_01SM 2208-07-2020
Required materials
-
Recommended materials
-
Tests
Assignment (40%)

Exam (60%)

Final grade

CloseHelpPrint
Kies de Nederlandse taal