 | Select the desired Level or Schedule Type to find available classes for the course. |
| CS 25100 - Data Structures And Algorithms |
|
Credit Hours: 3.00. Running time analysis of algorithms and their implementations, one-dimensional data structures, trees, heaps, additional sorting algorithms, binary search trees, hash tables, graphs, directed graphs, weighted graph algorithms, additional topics.
0.000 OR 3.000 Credit hours Syllabus Available Levels: Undergraduate, Graduate, Professional Schedule Types: Distance Learning, Lecture, Practice Study Observation All Sections for this Course Offered By: College of Science Department: Computer Science Course Attributes: Lower Division May be offered at any of the following campuses: Indianapolis and W Lafayette West Lafayette Learning Outcomes: 1. Understand fundamental data structures, fundamental algorithms, and their implementation. Restrictions: Must be enrolled in one of the following Fields of Study (Major, Minor, or Concentration): Computer Science Computer Science Honors Data Science IM/Computer Science Mathematics-Computer Science Prerequisites: Undergraduate level CS 18200 Minimum Grade of C and (Undergraduate level CS 24000 Minimum Grade of C or Undergraduate level CS 24200 Minimum Grade of C or Undergraduate level STAT 24200 Minimum Grade of C) |
| Return to Previous | New Search |
 |