{"id":35,"date":"2019-03-28T11:17:03","date_gmt":"2019-03-28T15:17:03","guid":{"rendered":"https:\/\/sites.bu.edu\/braude\/?page_id=35"},"modified":"2019-03-28T11:43:23","modified_gmt":"2019-03-28T15:43:23","slug":"met-cs-342","status":"publish","type":"page","link":"https:\/\/sites.bu.edu\/braude\/courses\/met-cs-342\/","title":{"rendered":"MET CS 342 Data Structures with Java"},"content":{"rendered":"<p>REGISTERED STUDENTS: PLEASE GO TO <a href=\"http:\/\/www.bu.edu\/tech\/services\/teaching\/lms\/blackboard-8\/\" target=\"_blank\" rel=\"noopener\">http:\/\/blackboard.bu.edu<\/a><br \/>\nTO SEE THE CURRENT SYLLABUS ETC.<\/p>\n<p>PLEASE NOTE: BELOW IS FROM THE 2008 VERSION OF THE CLASS<\/p>\n<p>Last updated 1\/7\/09 text usually in red if changed since last posting<\/p>\n<table border=\"1\" cellspacing=\"0\" cellpadding=\"0\">\n<tbody>\n<tr>\n<td width=\"295\" valign=\"top\">Catalog Description<\/td>\n<td width=\"295\" valign=\"top\"><a href=\"https:\/\/sites.bu.edu\/braude\/\">Home Page of Eric Braude<\/a><\/td>\n<\/tr>\n<tr>\n<td width=\"295\" valign=\"top\"><a href=\"https:\/\/sites.bu.edu\/braude\/contact\/\">Contacting Eric Braude<\/a><\/td>\n<td width=\"295\" valign=\"top\">Learning Objectives<\/td>\n<\/tr>\n<tr>\n<td width=\"295\" valign=\"top\">Course Materials and References<\/td>\n<td width=\"295\" valign=\"top\"><a href=\"https:\/\/sites.bu.edu\/braude\/policies-and-practices-eric-braudes-classes\/\">Policies in all of Eric Braude\u2019s Classes<\/a><\/td>\n<\/tr>\n<tr>\n<td width=\"295\" valign=\"top\">Due Dates for Homework and Project<\/td>\n<td width=\"295\" valign=\"top\">Topics and class dates<\/td>\n<\/tr>\n<tr>\n<td width=\"295\" valign=\"top\">Evaluation of Students corrected since last posting<\/td>\n<td width=\"295\" valign=\"top\">Warning concerning plagiarism<em> <\/em><\/td>\n<\/tr>\n<\/tbody>\n<\/table>\n<p><span style=\"text-decoration: underline;\">Catalog Description<\/span><\/p>\n<p>Prerequisites: MET CS 232 or consent of the instructor<\/p>\n<p>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<\/p>\n<p><span style=\"text-decoration: underline;\">Learning Objectives<\/span><\/p>\n<ul>\n<li>Understand the idea of data structures<\/li>\n<li>Relate data structures to algorithms<\/li>\n<li>Use Linked lists<\/li>\n<li>Apply sorting and searching<\/li>\n<li>Use hashing<\/li>\n<li>Understand trees, queues and graphs<\/li>\n<\/ul>\n<p><span style=\"text-decoration: underline;\">Materials<\/span><\/p>\n<p>Textbook: &#8221; Data Structures and Algorithms in Java,&#8221; Goodrich, Tamassia, (Wiley) 4th Edition<\/p>\n<p>The Notes are posted in the Yahoo forum.\u00a0 See the last heading in this page for the forum.<\/p>\n<p><span style=\"text-decoration: underline;\">Evaluation of Students<\/span><\/p>\n<p>The course will consist of homework\u2019s, a midterm, and a final, weighted as follows.<\/p>\n<ul>\n<li>Homework: \u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 50%<\/li>\n<li>Midterm: \u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 25%<\/li>\n<li>Final:\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 25%<\/li>\n<\/ul>\n<p>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.\u00a0 Reasons should be clearly written on the front of the paper.\u00a0 The fax (617) 353-2367 should be used if you cannot be at class.<\/p>\n<p><a href=\"https:\/\/sites.bu.edu\/braude\/policies-and-practices-eric-braudes-classes\/grading-policies\/\">Further details on the grading system used<\/a><\/p>\n<h4><span style=\"text-decoration: underline;\">Syllabus<\/span><\/h4>\n<p>The syllabus may be adjusted somewhat during the semester.<\/p>\n<table border=\"1\" cellspacing=\"0\" cellpadding=\"0\">\n<tbody>\n<tr>\n<td width=\"55\"><span style=\"text-decoration: underline;\">Class<\/span><\/p>\n<p><span style=\"text-decoration: underline;\">Num<\/span><\/td>\n<td width=\"64\"><span style=\"text-decoration: underline;\">Date<\/span><\/td>\n<td width=\"300\">Topic<\/td>\n<td width=\"115\"><span style=\"text-decoration: underline;\">Readings<\/span><span style=\"text-decoration: underline;\">: Goodrich \u2026<\/span><\/td>\n<\/tr>\n<tr>\n<td width=\"55\">1<\/td>\n<td width=\"64\">Jan 19<\/td>\n<td width=\"334\">Review of Java; Programming standards<\/p>\n<p>Class creation and design<\/td>\n<td width=\"114\">1,2<\/td>\n<\/tr>\n<tr>\n<td width=\"55\">2<\/td>\n<td width=\"64\">Jan 26<\/td>\n<td width=\"334\">Arrays, Linked Lists and Recursion<\/td>\n<td width=\"114\">3<\/td>\n<\/tr>\n<tr>\n<td width=\"55\">3<\/td>\n<td width=\"64\">Feb 2<\/td>\n<td width=\"334\">Analysis Tools<\/td>\n<td width=\"114\">4<\/td>\n<\/tr>\n<tr>\n<td width=\"55\">4<\/td>\n<td width=\"64\">Feb 9<\/td>\n<td width=\"334\">Stacks and Queues<\/td>\n<td width=\"114\">5<\/td>\n<\/tr>\n<tr>\n<td width=\"55\">5<\/td>\n<td width=\"64\">Feb 16<\/td>\n<td width=\"334\">Lists and Integers<\/p>\n<p>Linked and unlinked lists<\/td>\n<td width=\"114\">6<\/td>\n<\/tr>\n<tr>\n<td width=\"55\">6<\/td>\n<td width=\"64\">Feb 23<\/td>\n<td width=\"334\">Trees<\/td>\n<td width=\"114\">7<\/td>\n<\/tr>\n<tr>\n<td width=\"55\">7<\/td>\n<td width=\"64\">Mar 2<\/td>\n<td width=\"334\">Priority Queues<\/td>\n<td width=\"114\">8<\/td>\n<\/tr>\n<tr>\n<td width=\"55\">8<\/td>\n<td width=\"64\">Note: Mar 16<\/td>\n<td width=\"334\">Maps and Dictionaries<\/td>\n<td width=\"114\">9<\/td>\n<\/tr>\n<tr>\n<td width=\"55\">9<\/td>\n<td width=\"64\">Mar 23<\/td>\n<td width=\"334\">Midterm<\/td>\n<td width=\"114\"><\/td>\n<\/tr>\n<tr>\n<td width=\"55\">10<\/td>\n<td width=\"64\">Apr 6<\/td>\n<td width=\"334\">Search Trees<\/td>\n<td width=\"114\">10<\/td>\n<\/tr>\n<tr>\n<td width=\"55\">11<\/td>\n<td width=\"64\">Apr 13<\/td>\n<td width=\"334\">Sorting, Set, and Selection<\/td>\n<td width=\"114\">11<\/td>\n<\/tr>\n<tr>\n<td width=\"55\">12<\/td>\n<td width=\"64\">Apr 20<\/td>\n<td width=\"334\">Graphs<\/td>\n<td width=\"114\">13<\/td>\n<\/tr>\n<tr>\n<td width=\"55\">13<\/td>\n<td width=\"64\">Apr 27<\/td>\n<td width=\"334\">Review for final<\/td>\n<td width=\"114\">14<\/td>\n<\/tr>\n<tr>\n<td width=\"55\">14<\/td>\n<td width=\"64\">May 4, 11<\/td>\n<td width=\"334\">Final<\/td>\n<td width=\"114\">15<\/td>\n<\/tr>\n<\/tbody>\n<\/table>\n<h2>Warning <span style=\"text-decoration: underline;\">Concerning Plagiarism<\/span><\/h2>\n<p>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.<br \/>\ne-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.\u00a0 Please see examples of <a href=\"https:\/\/sites.bu.edu\/braude\/policies-and-practices-eric-braudes-classes\/plagiarism\/\">plagiarism<\/a><\/p>\n<p><span style=\"text-decoration: underline;\">Forum<\/span><\/p>\n<p>Group home page:\u00a0\u00a0\u00a0 http:\/\/groups.yahoo.com\/group\/342F08<\/p>\n<p>Group email:\u00a0\u00a0\u00a0 342F08@yahoogroups.com<\/p>\n","protected":false},"excerpt":{"rendered":"<p>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 [&hellip;]<\/p>\n","protected":false},"author":2828,"featured_media":0,"parent":22,"menu_order":1,"comment_status":"closed","ping_status":"closed","template":"","meta":[],"_links":{"self":[{"href":"https:\/\/sites.bu.edu\/braude\/wp-json\/wp\/v2\/pages\/35"}],"collection":[{"href":"https:\/\/sites.bu.edu\/braude\/wp-json\/wp\/v2\/pages"}],"about":[{"href":"https:\/\/sites.bu.edu\/braude\/wp-json\/wp\/v2\/types\/page"}],"author":[{"embeddable":true,"href":"https:\/\/sites.bu.edu\/braude\/wp-json\/wp\/v2\/users\/2828"}],"replies":[{"embeddable":true,"href":"https:\/\/sites.bu.edu\/braude\/wp-json\/wp\/v2\/comments?post=35"}],"version-history":[{"count":6,"href":"https:\/\/sites.bu.edu\/braude\/wp-json\/wp\/v2\/pages\/35\/revisions"}],"predecessor-version":[{"id":93,"href":"https:\/\/sites.bu.edu\/braude\/wp-json\/wp\/v2\/pages\/35\/revisions\/93"}],"up":[{"embeddable":true,"href":"https:\/\/sites.bu.edu\/braude\/wp-json\/wp\/v2\/pages\/22"}],"wp:attachment":[{"href":"https:\/\/sites.bu.edu\/braude\/wp-json\/wp\/v2\/media?parent=35"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}