# CST 261 - Data Structures This course investigates abstract data types (ADTs), recursion, algorithms for searching and sorting, and basic algorithmic analysis using an object-oriented language. Data structures to be covered include, but not limited to strings, arrays, lists, stacks, queues, trees, and heaps. Students also will explore the use of a variety of data structures and useful algorithms, such as searching and sorting, in the context of modeling and simulation. \ Prerequisite(s): CST 162\ 4 lecture hours per week\ 4 credit hours --- # Agent Instructions: Querying This Documentation If you need additional information that is not directly available in this page, you can query the documentation dynamically by asking a question. Perform an HTTP GET request on the current page URL with the `ask` query parameter: ``` GET https://www.datastructures.xyz/cst-261-data-structures.md?ask= ``` The question should be specific, self-contained, and written in natural language. The response will contain a direct answer to the question and relevant excerpts and sources from the documentation. Use this mechanism when the answer is not explicitly present in the current page, you need clarification or additional context, or you want to retrieve related documentation sections.