https://wiki.eecs.yorku.ca/course_archive/2012-13/S/2011/ 2026-04-04T14:04:48+00:00 https://wiki.eecs.yorku.ca/course_archive/2012-13/S/2011/ https://wiki.eecs.yorku.ca/course_archive/2012-13/S/2011/_media/wiki:dokuwiki-128.png text/html 2013-06-20T17:54:47+00:00 Anonymous (anonymous@undisclosed.example.com) https://wiki.eecs.yorku.ca/course_archive/2012-13/S/2011/contact?rev=1371750887&do=diff Contact Instructor and TAs Instructor * Mehdi Kargar <http://www.cse.yorku.ca/~kargar/> * Email: kargar@gmail.com * Office: LAS 2057 (The building was previously called CSE) * Office Hour: Wednesdays 2:00pm - 4:00pm text/html 2013-07-31T22:09:33+00:00 Anonymous (anonymous@undisclosed.example.com) https://wiki.eecs.yorku.ca/course_archive/2012-13/S/2011/course_outline?rev=1375308573&do=diff Course Outline 1. Course Information 2. Algorithm Analysis Part 1-Chapter 4 3. Algorithm Analysis Part 2-Chapter 4 4. Recursion-Section 3.5 5. Merge sort-Section 11.1 6. Quick sort-Section 11.2 7. Arrays and Linked Lists-Sections 3.1,3.2,3.3 text/html 2007-08-02T17:22:57+00:00 Anonymous (anonymous@undisclosed.example.com) https://wiki.eecs.yorku.ca/course_archive/2012-13/S/2011/forums?rev=1186075377&do=diff Forums This page acts as a future placeholder for a link to a forum system. text/html 2013-08-22T19:11:47+00:00 Anonymous (anonymous@undisclosed.example.com) https://wiki.eecs.yorku.ca/course_archive/2012-13/S/2011/grades?rev=1377198707&do=diff Grades The weight distribution of the course components is as follows: * 15% - 4-5 Assignments * 30% - Midterm * 55% - Final Exam Conversion from numeric to letter grade is applied to the overall mark only and in accordance with the following departmental standard: text/html 2013-07-24T22:56:07+00:00 Anonymous (anonymous@undisclosed.example.com) https://wiki.eecs.yorku.ca/course_archive/2012-13/S/2011/important_dates?rev=1374706567&do=diff Important Dates First assignment due is June 10 2013 at 3:00pm. Midterm will be held on Wednesday June 26th in CLH F. On June 26th, we will have a lecture from 7:00pm to 8:15pm and then the exam will be from 8:30pm to 10:00pm. Please note that the lecture and the exam will be held in CLH F on June 26th. text/html 2013-07-31T22:38:59+00:00 Anonymous (anonymous@undisclosed.example.com) https://wiki.eecs.yorku.ca/course_archive/2012-13/S/2011/lecture_notes?rev=1375310339&do=diff Lecture Notes Please note that the slides might be updated up to one week after the lecture. May 8: Course Information PDF.Course Information May 8: Algorithm Analysis Part 1 PDF.Algorithm Analysis P.1 May 15: Algorithm Analysis Part 2 PDF.Algorithm Analysis P.2 May 15: Recursion PDF.Recursion May 22: Merge Sort PDF.Merge Sort May 22: Quick Sort text/html 2013-05-13T15:58:53+00:00 Anonymous (anonymous@undisclosed.example.com) https://wiki.eecs.yorku.ca/course_archive/2012-13/S/2011/policies?rev=1368460733&do=diff Policies Academic Dishonesty For more information on Academic Dishonesty, click here. text/html 2013-05-12T03:09:59+00:00 Anonymous (anonymous@undisclosed.example.com) https://wiki.eecs.yorku.ca/course_archive/2012-13/S/2011/resources?rev=1368328199&do=diff Resources * Department of CSE Home Page * York Exam Schedule text/html 2024-03-08T14:02:31+00:00 Anonymous (anonymous@undisclosed.example.com) https://wiki.eecs.yorku.ca/course_archive/2012-13/S/2011/sidebar?rev=1709906551&do=diff * Home * What's New * Textbook * Lecture Notes * Course Outline * Important Dates * Grades * Assignments * Forums * Contact * Policies * Resources * FAQs * Academic Dishonesty text/html 2013-05-25T15:24:01+00:00 Anonymous (anonymous@undisclosed.example.com) https://wiki.eecs.yorku.ca/course_archive/2012-13/S/2011/start?rev=1369495441&do=diff CSE 2011 - Fundamentals of Data Structures Welcome to CSE2011 for Summer 2013. Materials, instructions, and notices for the course will accumulate here over the semester. Description This course focuses on the fundamental data structures which are commonly used in the design of algorithms. text/html 2013-06-05T15:56:10+00:00 Anonymous (anonymous@undisclosed.example.com) https://wiki.eecs.yorku.ca/course_archive/2012-13/S/2011/textbook?rev=1370447770&do=diff Textbook You will require the following textbook for this course: * M. T. Goodrich and R. Tamassia. Data Structures and Algorithms in Java. 5th edition. John Wiley and Sons, 2010. You may purchase this book through the York University Bookstore. Optional/Recommended * T. H. Cormen, C. E. Leiserson, R. L. Rivest and C. Stein text/html 2013-08-22T19:12:52+00:00 Anonymous (anonymous@undisclosed.example.com) https://wiki.eecs.yorku.ca/course_archive/2012-13/S/2011/whats_new?rev=1377198772&do=diff What's New? The first assignment has been posted. The midterm is finalized. See the Important Dates. The second assignment has been posted. The midterm will be until the end of lecture 12, binary trees, inclusive. The marks of the first assignment has been posted.