Basic algorithms. Recursion. Data structures including linked lists, queues, stacks, trees, graphs, and hash tables. Searching and sorting. Introduction to complexity including Big-O notation, efficiency, and scalability. Prerequisite: All of DSCI 511, DSCI 521. This course is not eligible for Credit/D/Fail grading.
Basic algorithms. Recursion. Data structures including linked lists, queues, stacks, trees, graphs, and hash tables. Searching and sorting. Introduction to complexity including Big-O notation, efficiency, and scalability. Prerequisite: All of DSCI 511, DSCI 521. This course is not eligible for Credit/D/Fail grading.
