Featured Programs
Experiential Learning Opportunities
Claim up to $500 in flight credits!
Get up to $500 in flight credits or grants toward study or internship programs abroad when you apply by March 15, 2025. See our Official Rules for full details.
Data Structures and Algorithms- Period 1
Social Sciences & Humanities Program
Amsterdam, Netherlands
Dates: 8/21/21 - 12/24/21
Data Structures and Algorithms- Period 1
OVERVIEW
CEA CAPA Partner Institution: Vrije Universiteit Amsterdam
Location: Amsterdam, Netherlands
Primary Subject Area: Mathematics
Instruction in: English
Course Code: X_400614
Transcript Source: Partner Institution
Course Details: Level 200
Recommended Semester Credits: 3
Contact Hours: 84
Prerequisites: Concerning algorithmics: recursive procedures, arrays, elementary Java. For instance the course Programming (X-400554) of year I of the Bachelor Computer Science.
Concerning discrete mathematics: some familiarity with mathematical reasoning in general and induction in particular. For instance the course Logic and Sets (X_401090) of year I of the Bachelor Computer Science. Moreover elementary knowledge of graphs. For instance the course Networks and Graphs of year I of the Bachelor Computer Science.
DESCRIPTION
Concerning data structures: Linear data structures: stacks, queues, linked lists. Tree-like data structures: binary trees, binary search trees, heaps, red-black trees or AVL-trees. Graphs-like data structures. Hash tables.
Concerning algorithms: sorting algorithms, the divide-and-conquer programming paradigm, dynamic programming, greedy algorithms, string matching.
Complexity analysis: big-Oh notation, worst-case time complexity, amortized analysis.
Contact hours listed under a course description may vary due to the combination of lecture-based and independent work required for each course therefore, CEA's recommended credits are based on the ECTS credits assigned by VU Amsterdam. 1 ECTS equals 28 contact hours assigned by VU Amsterdam.
Concerning algorithms: sorting algorithms, the divide-and-conquer programming paradigm, dynamic programming, greedy algorithms, string matching.
Complexity analysis: big-Oh notation, worst-case time complexity, amortized analysis.
Contact hours listed under a course description may vary due to the combination of lecture-based and independent work required for each course therefore, CEA's recommended credits are based on the ECTS credits assigned by VU Amsterdam. 1 ECTS equals 28 contact hours assigned by VU Amsterdam.