Algorithms and Data Structures Part 1

Course Description

This course if for those who are comfortable with Algorithmic Thinking Part 1 and Part 2 courses. This course covers; -Brute force, complete search, range search -Inverse array concept and related problems -Simulation problems -Rectangle geometry and cartesian coordinate system -Data structures such as arrays, array lists (or vectors), tuples or pairs, strings, sets, etc. -Time complexity The programming language, of course, is not specific. Mainly C++ will be used in the course. However, if there are students who use Java or Python in class then the instructions will definitely cover those languages too. The main focus in this course is learning algorithms rather than learning syntax of a language. Since algorithms are mathematical tools it is possible to combine students from different language backgrounds.