Difference between revisions of "CMSC420 - Data Structures"
From CS 400 Level Course Wiki
(Created page with "{{ClassPage|CMSC420 Advanced Data Structures|Michelle Hugue|This will be available in August. For now, visit http://www.cs.umd.edu/class which will allow you to see what has ...") |
|||
| Line 1: | Line 1: | ||
{{ClassPage|CMSC420 Advanced Data Structures|Michelle Hugue|This will be available in August. For now, visit http://www.cs.umd.edu/class which will allow you to see what has been done previously. She has taught this course yearly since 2000 or so.|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.|The workload for this course is at least the 10 hours associated with a 3 credit class. Programming and debugging skills, or a lack thereof, make it hard to give a decent estimate here.|Projects will be in JAVA|Prerequisite: Minimum grade of C- in CMSC351 and CMSC330; and permission of CMNS-Computer Science department. Or must be in the (Computer Science (Doctoral), Computer Science (Master's)) program.|see this semester's webpage http://www.cs.umd.edu/class/|We often refer to this course as "data structures in context." | {{ClassPage|CMSC420 Advanced Data Structures|Michelle Hugue|This will be available in August. For now, visit http://www.cs.umd.edu/class which will allow you to see what has been done previously. She has taught this course yearly since 2000 or so.|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.|The workload for this course is at least the 10 hours associated with a 3 credit class. Programming and debugging skills, or a lack thereof, make it hard to give a decent estimate here.|Projects will be in JAVA|Prerequisite: Minimum grade of C- in CMSC351 and CMSC330; and permission of CMNS-Computer Science department. Or must be in the (Computer Science (Doctoral), Computer Science (Master's)) program.|see this semester's webpage http://www.cs.umd.edu/class/|We often refer to this course as "data structures in context." | ||
| − | The class presents a practical approach to data structures for computer intensive products that can be proven to satisfy correctness and performance requirements. | + | The class presents a practical approach to data structures for computer intensive products that can be proven to satisfy correctness and performance requirements. One can obtain almost any data structure from a book or online. However, it takes experience to identify data structures known to provide the desired behavior; to extend them to satisfy the specific application; and to evaluate the deliverables to show that they satisfy the composite standard and custom requirements. The lectures, the project (three linked parts) and the exams are designed to provide students with such experience. This includes having projects which require sustained effort rather than last minute code-a-thons, exams written to elicit knowledge, not empty verbiage, and course policies which reward hard work and learning from mistakes. To put it bluntly, I'll do my best to help you to make mistakes and then support your efforts to learn from them. This is a thinking class, not an echo information class.|0101 TuTh 2:00pm - 3:15pm CSI 3117}} |
| − | |||
