− | {{ClassPage|CMSC420 Data Structures|Hanan Samet|See previous semester's website for more information http://www.cs.umd.edu/class/fall2014/cmsc420-0101/|Description, properties, and storage allocation of data structures including lists and trees. Algorithms for manipulating structures. Applications from areas such as data processing, information retrieval, symbol manipulation, and operating systems.|||Prerequisite: Minimum grade of C- in CMSC351 and CMSC330||See previous semester's website for more information http://www.cs.umd.edu/class/fall2014/cmsc420-0101/|0301 TuTh 11:00am - 12:15pm CSI 1122}} | + | {{ClassPage|CMSC420 Data Structures|Hanan Samet|http://www.cs.umd.edu/~hjs/hjs420.fall2016.pdf|See webpage - Description, properties, and storage allocation of data structures including lists and trees. Algorithms for manipulating structures. Applications from areas such as data processing, information retrieval, symbol manipulation, and operating systems.|varies from student to student|C or C++ and LISP|Be very comfortable with the use of pointers in programming - Prerequisite: Minimum grade of C- in CMSC351 and CMSC330|C or C++ and LISP|See webpage|0301 TuTh 11:00am - 12:15pm CSI 1122}} |