Changes

{{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. 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}}

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.

 

| Michelle Hugue || style="vertical-align:top;" | 0101 || TuTh 3:30PM - 4:45PM || style="vertical-align:top;" | [http://maps.umd.edu/map/index.html?Welcome=False&MapView=Detailed&LocationType=Building&LocationName=406 CSI 3117]<br>

| Larry Davis || 0102 || style="vertical-align:top;" | MW 3:30PM - 4:45PM || style="vertical-align:top;" | [http://maps.umd.edu/map/index.html?Welcome=False&MapView=Detailed&LocationType=Building&LocationName=406 CSI 2117]

| Venkatramanan Subrahmanian|| 0301 || style="vertical-align:top;" | TuTh 11:00AM - 12:15PM || style="vertical-align:top;" | [http://maps.umd.edu/map/index.html?Welcome=False&MapView=Detailed&LocationType=Building&LocationName=406 CSI 2117]

|}

 

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.

 

 

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.

 

''' Languages Used ''' <br>

 

A B or better in 216, or experience in another C-based course (possibly 417) or heavy programming course. Concretely, a student should have no question on whether to use the & operator or the * operator when dealing with pointers and should understand the difference between sizeof() and strlen().

 

https://www.cs.umd.edu/class/fall2015/cmsc412/syllabus.pdf ~45% exams, ~35% projects, some quizzes, participation, etc.  No group work outside 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. 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.