C S 235

Data Computing Fundamentals

Utilize fundamental data types including lists, stacks, queues, priority queues, sets, maps, and trees. This mastery of organizational structures is intellectually enlarging, as students learn to apply precise logical frameworks to represent complex information.

Implementing Fundamental Data Types

Understand and implement major techniques for data storage, such as linked lists, binary search trees, hashing, and heaps. This deep dive into technical implementation is character building, requiring the meticulous attention to detail and personal integrity necessary to build reliable systems.

Select Data Structures

Properly select and use data structures from language-provided libraries. Making these informed choices is a form of stewardship, helping students develop the wisdom to use available resources effectively in a life of service.

Analysis

Classify the runtime complexity of algorithms using Big O notation. This ability to evaluate efficiency is intellectually enlarging, providing a rigorous mathematical lens through which to view the physical constraints of computation.

Recursion

Understand and apply recursive logic to solve complex problems. Mastering this powerful mental model is spiritually strengthening, as students learn to find elegant, simple truths within layered and repetitive challenges.

Usage of Algorithms

Make informed decisions regarding sorting and searching algorithms in specific contexts. This evaluative skill fosters a capacity for lifelong learning, equipping students with the critical thinking needed to adapt to new technologies and methodologies.

Program Writing

Write substantial programs requiring approximately 500 lines of code. The endurance required to complete these projects is character building, fostering the resilience and work ethic needed to see significant commitments through to completion.