Changes

'''Course Information''' <br>

== Course Description ==

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.

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.

{| style="text-align:left; width: 550PX;"

{| style="text-align:left; width: 550PX;"

! Day & Time

! Day & Time

! Location

! Location

|- style="vertical-align:top;" |

|- style="vertical-align:top;" |

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

| MW 2:00PM - 3:15PM || 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]

|}

''' Course Prerequisite(s) ''' <br>

''' Course Prerequisite(s) ''' <br>

We often refer to this course as "data structures in context."  

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.

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.