 | Select the Course Number to get further detail on the course. Select the desired Schedule Type to find available classes for the course. The Schedule Type links will be available only when the schedule of classes is available for the selected term. |
| CS 25300 - Data Structures And Algorithms For DS/AI |
|
Credit Hours: 3.00. This course gives a broad introduction to the most important data structures and algorithms in computer science. The emphasis is on data structures and their use in algorithms relevant for data science and AI and their applications. The course focuses on developing and comparing efficient implementations, assessing suitability of data structures for massive data sets, and understanding effective use, modifications, and extensions. This course will not fulfill CS 25100 requirement for any Computer Science major or minor.
0.000 OR 3.000 Credit hours Syllabus Available Levels: Undergraduate, Graduate, Professional Schedule Types: Distance Learning, Lecture, Practice Study Observation 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. Apply an asymptotic analysis to given code and explain its significance. 2. Analyze asymptotic performance of data structures and algorithms with respect to time and space. 3. Describe different implementations of a data structure and explain when what implementation is most efficient. 4. Demonstrate how to add functionality to a data structure to efficiently handle new operations and queries. 5. Assess how the choice of data structures and algorithm design methods impacts the performance of programs. 6. Make effective and appropriate use of data structures such as stacks, queues, linked lists, hash tables, Bloom filters, priority queues, dictionaries, search trees, tries, and graphs. |
 |