Digital Commons @ IWU
metadata only
Fall 2009 CS 255 Sect. 1 Algorithm Design and Analysis
Introduction to procedural programming (with C) and continuation of functional programming (with Haskell). Sorting and searching. Advanced data structures. Symbol tables, binary search trees, and hashing. Trees, graphs, and recursion. Introduction to program verification. Prerequisites: 128 and Math
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Fall 2010 CS 255 Sect. 1 Algorithm Design and Analysis#1398494
- Spring 2017 CS 128 Sect. 1 Computer Science II#1398524
- Fall 2017 CS 128 Sect. 1 Computer Science II#1398523
- Spring 2017 CS 128 Sect. 2 Computer Science II#1398525
- Spring 2016 CS 128 Sect. 1 Computer Science II#1398521
Record · ID 1398493
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive