![]() ![]() By assigning a small (but non-zero) weight to passing the online quiz, CS instructors can significantly enhance their students' mastery of these basic concepts, as they have access to an almost unlimited number of practice questions that can be instantly verified before taking the online quiz. As more CS instructors adopt this online quiz system worldwide, it could effectively eliminate manual basic data structure and algorithm questions from standard Computer Science exams in many universities. Questions are randomly generated based on specific rules, and students' answers are automatically graded upon submission to our grading server. At present, the platform features 24 visualization modules.Įquipped with a built-in question generator and answer verifier, VisuAlgo's "online quiz system" enables students to test their knowledge of basic data structures and algorithms. VisuAlgo remains a work in progress, with the ongoing development of more complex visualizations. However, since April 2022, a mobile (lite) version of VisuAlgo has been made available, making it possible to use a subset of VisuAlgo features on smartphone screens. ![]() For an optimal user experience, a minimum screen resolution of 1366x768 is recommended. Initially, VisuAlgo was not designed for small touch screens like smartphones, as intricate algorithm visualizations required substantial pixel space and click-and-drag interactions. While primarily designed for National University of Singapore (NUS) students enrolled in various data structure and algorithm courses (e.g., CS1010/equivalent, CS2040/equivalent (including IT5003), CS3230, CS3233, and CS4234), VisuAlgo also serves as a valuable resource for inquisitive minds worldwide, promoting online learning. Suhendry Effendy - VisuAlgo remains the exclusive platform for visualizing and animating several of these complex algorithms even after a decade. Steven Halim's book, 'Competitive Programming' - co-authored with Dr. Initially conceived in 2011 by Associate Professor Steven Halim, VisuAlgo aimed to facilitate a deeper understanding of data structures and algorithms for his students by providing a self-paced, interactive learning platform.įeaturing numerous advanced algorithms discussed in Dr. Some keys may have '-' (actual frequency) in random fashion.ĭiscussion: It is actually possible to omit the parent pointer from each vertex. In the example above, (key) 15 has 6 as its left child and 23 as its right child. The (integer) key of each vertex is drawn inside the circle that represent that vertex and if there are duplicated insertion of the same (integer) key, there will be an additional hyphen '-' and the actual frequency (≥ 2) of that key. The parent of a vertex (except root) is drawn above that vertex. The left/right child of a vertex (except leaf) is drawn on the left/right and below of that vertex, respectively. Some other implementation separates key (for ordering of vertices in the BST) with the actual satellite data associated with the keys. ![]() Not all attributes will be used for all vertices, e.g., the leaf vertex will have both their left and right child attributes = NULL. Each vertex has several key attributes: pointer to the left child, pointer to the right child, pointer to the parent vertex, key/value/data, and special for this visualization that implements 'multiset': frequency of each key (there are potential other attributes). ![]()
0 Comments
Leave a Reply. |
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |