CS 3110: Functional Programming and Data Structures

CS 3110 at Cornell teaches you to think about programs differently. Using OCaml, you'll work with immutable data, pattern matching, higher-order functions, and algebraic data types. The course also covers modular software design, formal reasoning about…

Independent study archive Learn more

Materials are uploaded by users for self-study purposes. PwnHero is an independent platform, not affiliated with, sponsored by, or endorsed by any university or institution.

Common aliases: CS 3110

Resources 7
Types Midterms, Finals, Quizzes
Years 2010 – 2020
University Cornell University
Course Overview

Study Resources for Functional Programming and Data Structures

Assessment Inventory for CS 3110 (7 Documents)
Assessment inventory for CS 3110 at Cornell University
Document Format Year Access
Midterm (Exam 1) 2020 Midterm 2020 Illustrative Archive
Midterm (Exam 1) 2019 Midterm 2019 Illustrative Archive
Midterm (Exam 2) 2018 Midterm 2018 Illustrative Archive
Midterm (Exam 1) 2018 Midterm 2018 Illustrative Archive
Midterm (Exam 1) 2017 Midterm 2017 Illustrative Archive
Final Exam 2010 Final 2010 Illustrative Archive
Quiz 8 Quiz — Illustrative Archive

Complete inventory of all 7 assessments (sorted by most recent). Select any document to inspect or use the search bar above to filter.

Course Overview & Exam Syllabus

Course Description

CS 3110 at Cornell teaches you to think about programs differently. Using OCaml, you'll work with immutable data, pattern matching, higher-order functions, and algebraic data types. The course also covers modular software design, formal reasoning about correctness, and introductory concurrency — all through a functional programming lens.

This archive catalogs 7 free educational resources and past exams for CS 3110 (Functional Programming and Data Structures) at Cornell University, containing 5 midterm papers, 1 final examination, and 1 quiz. Dated documents represent 5 distinct academic years between 2010 and 2020.

Core Exam Topics & Learning Objectives

  • OCaml basics: pattern matching, let-bindings, recursive functions, and type inference
  • Higher-order functions: map, fold, filter, and function composition
  • Algebraic data types, variants, records, and option/result types
  • Module systems, signatures, functors, and abstraction barriers
  • Reasoning about correctness: specifications, testing strategies, and proof by structural induction
  • Mutable state in a functional world, promises, and concurrent programming models

Frequently Asked Questions

Which assessment formats are cataloged in this CS 3110 archive?

This collection for CS 3110 at Cornell University catalogs 7 total resources across the following formats: Midterms, Finals, Quizzes. Each document is listed in the assessment inventory table with its individual format tag and academic year where recorded.

What academic years are covered in this CS 3110 collection?

Dated materials in this archive span from 2010 to 2020, representing 5 distinct academic years. Coverage varies by the records currently cataloged for this course.

How can students access these free CS 3110 past exams?

All cataloged CS 3110 past exams and study materials are free to request. The catalog, metadata, assessment inventory, and illustrative thumbnails are public; source documents are not shown on this page. Use the connect options to request a study resource, and confirm current course topics and grading policies with the Cornell University course syllabus.

Related CS Courses at Cornell University