Programming and Data Structures in C (CS4170.01)

Andrew Cencini

In this class, students will learn the C programming language, as well as the design and implementation of computer science’s foundational data structures: stacks, queues, linked lists, trees, and their various and sundry variants. Since virtually every piece of software in existence relies upon several of these key data structures, the class will also look at examples of occurrences of these data structures in the wild, such as the Linux kernel and in other free and open-source software. Students will also learn to analyze the performance and suitability of algorithms and data structures, and how they are also connected to essential systems concepts. No prior knowledge of the C programming language is necessary, but at least one semester of programming experience (or its equivalent) is required.

Prerequisites: Permission of the instructor.
Credits: 4
T 2:10pm - 6:00pm
Maximum Enrollment: 10
Course Frequency:
This course is categorized as All courses, Four Credit, 4000, Computing, Andrew Cencini, and tagged , , , , , , , .