Changes

<div id="TOC" style="float:right;">__TOC__</div>

<div id="TOC" style="float:right;">__TOC__</div>

This year, this course has three different instructors, all of whom teach this course differently. At present, we have information for only Michelle Hugue. We are currently working on getting information from Larry Davis and Venkatramanan Subrahmanian. If you have any questions about their sections of the courses and how they will be presenting the material, please ask them directly.<br>

This year, this course has three different instructors, all of whom teach this course differently. At present, we have information for only Michelle Hugue and Larry Davis. We are currently working on getting information from Venkatramanan Subrahmanian. If you have any questions about their section of the course and how they will be presenting the material, please ask them directly.<br>

== Michelle Hugue | 0101 & 0201 ==

 

== Michelle Hugue | 0101 ==

{| 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;" |

| 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]

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

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

| 0201 || 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 1122]

|}  

|}  

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

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

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.

 

== Larry Davis | 0301 ==

== Larry Davis | 0102 ==

{| 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;" |

| 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]

| 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 1122]

|}

|}

2 - 4 Hours per week<br>

2 - 4 Hours per week<br>

 

|- 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]

 

Usually 2-3 exams, 3 projects

 

Emphasis is on algorithms and data structures, not proofs. Projects designed to exercise methods covered in class.