MET CS 342 Data Structures with Java

REGISTERED STUDENTS: PLEASE GO TO http://blackboard.bu.edu
TO SEE THE CURRENT SYLLABUS ETC.

PLEASE NOTE: BELOW IS FROM THE 2008 VERSION OF THE CLASS

Last updated 1/7/09 text usually in red if changed since last posting

Catalog Description Home Page of Eric Braude
Contacting Eric Braude Learning Objectives
Course Materials and References Policies in all of Eric Braude’s Classes
Due Dates for Homework and Project Topics and class dates
Evaluation of Students corrected since last posting Warning concerning plagiarism

Catalog Description

Prerequisites: MET CS 232 or consent of the instructor

This course covers data structures using the Java Programming Language. Topics include data abstraction, encapsulation, information hiding, and the use of recursion, creation and manipulation of various data structures: lists, queues, tables, trees, heaps, and graphs, and searching and sorting algorithms. Laboratory course. 4 credits

Learning Objectives

  • Understand the idea of data structures
  • Relate data structures to algorithms
  • Use Linked lists
  • Apply sorting and searching
  • Use hashing
  • Understand trees, queues and graphs

Materials

Textbook: ” Data Structures and Algorithms in Java,” Goodrich, Tamassia, (Wiley) 4th Edition

The Notes are posted in the Yahoo forum.  See the last heading in this page for the forum.

Evaluation of Students

The course will consist of homework’s, a midterm, and a final, weighted as follows.

  • Homework:                   50%
  • Midterm:                       25%
  • Final:                            25%

Late homework without a reason why it was impossible will not be accepted. If there is such impossibility, the work will be graded on a pass/fail basis.  Reasons should be clearly written on the front of the paper.  The fax (617) 353-2367 should be used if you cannot be at class.

Further details on the grading system used

Syllabus

The syllabus may be adjusted somewhat during the semester.

Class

Num

 Date Topic Readings: Goodrich …
1 Jan 19 Review of Java; Programming standards

Class creation and design

 1,2
2 Jan 26 Arrays, Linked Lists and Recursion 3
3 Feb 2 Analysis Tools 4
4 Feb 9 Stacks and Queues 5
5 Feb 16 Lists and Integers

Linked and unlinked lists

 6
6 Feb 23 Trees 7
7 Mar 2 Priority Queues 8
8 Note: Mar 16 Maps and Dictionaries 9
9 Mar 23 Midterm
10 Apr 6 Search Trees 10
11 Apr 13 Sorting, Set, and Selection 11
12 Apr 20 Graphs 13
13 Apr 27 Review for final 14
14 May 4, 11 Final 15

Warning Concerning Plagiarism

The College has serious penalties for plagiarism, including expulsion from the degree program. Please be very careful not to use the work of others without very clear and specific acknowledgment.
e-mail, see or call me if you have any doubts. In any case, clearly acknowledge all sources in the context they are used, including code, of course.  Please see examples of plagiarism

Forum

Group home page:    http://groups.yahoo.com/group/342F08

Group email:    342F08@yahoogroups.com