Scribd
Upload
57 views

Syllabus 2331

This document provides information about the CSE 2331 Introduction to Analysis of Algorithms and Data Structures course offered in Autumn 2012 at Ohio State University. It outlines the course summary, prerequisites, required text book, instructor contact information, topics to be covered over the semester, and grading breakdown. The course focuses on analyzing algorithm and data structure performance and covers topics like asymptotic analysis, sorting algorithms, searching trees, graphs, and probabilistic analysis.

Uploaded by

codenamed00m
Copyright
© Attribution Non-Commercial (BY-NC)
Available Formats
Download as PDF, TXT or read online on Scribd
57 views

Syllabus 2331

This document provides information about the CSE 2331 Introduction to Analysis of Algorithms and Data Structures course offered in Autumn 2012 at Ohio State University. It outlines the course summary, prerequisites, required text book, instructor contact information, topics to be covered over the semester, and grading breakdown. The course focuses on analyzing algorithm and data structure performance and covers topics like asymptotic analysis, sorting algorithms, searching trees, graphs, and probabilistic analysis.

Uploaded by

codenamed00m
Copyright
© Attribution Non-Commercial (BY-NC)
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

CSE 2331 Introduction to Analysis of Algorithms and Data Structures Autumn, 2012

Instructor: R. Wenger Oce: Dreese 485 Telephone: 292-6253 e-mail: [email protected] url: http://www.cse.ohio-state.edu/~wenger COURSE SUMMARY: Performance analysis considerations in design of algorithms and data structures; Order of magnitude analysis, recurrence relations, probabilistic analysis, divide and conquer; searching, sorting and graph processing algorithms. COREREQUISITE: (CSE 560 2231 or CSE 321) and (CSE 2321 or Math 366) and (Math 2566 or Math 566) and (Stat 3470 or Stat 427). TEXT (required): Introduction to Algorithms, Second or Third Edition by Cormen, Leiserson, Rivest and Stein. COURSE NOTES (required) : Order from SBX (or directly from www.zippublishing.com.) CARMEN: https://carmen.osu.edu. SEQUENCE OF TOPICS (tentative): 1. 2. 3. 4. 5. 6. 7. 8. 9. 10. 11. 12. 13. 14. 15. 16. Analyzing algorithms (CLRS, Chapter 1). Asymptotic notation (CLRS, Chapter 3). Insertion sort (CLRS, Sections 2.1, 2.2). Recurrence relations (CLRS, Sections 4.1, 4.2). Merge Sort (CLRS, Section 2.3). Heapsort (CLRS, Sections 6.1-6.4). Binary Search Trees (CLRS, Chapter 12) Red Black Trees (CLRS, Chapter 13) Graphs and graph algorithms (CLRS, Chapter 22). Minimum spanning trees (CLRS, Chapter 23.) Shortest paths (CLRS, Section 24.3). Probabilistic analysis (CLRS, Chapter 5). Quicksort (CLRS, Chapter 7). Median nd (CLRS, Chapter 9). Hashing (CLRS, Chapter 11). NP-completeness (CLRS, Chapter 34) (over)

GRADING: HW 25%, Midterm I 20%, Midterm II 20%, Final 35%. Homeworks may include programming assignments. Students are expected to attend class regularly. In the event that a student must miss a class, the student is responsible for nding out what assignments were made, what due dates were announced, and what material was covered. Late homework will NOT receive credit.

You might also like