CSA 274 is a third-tier course in the CSA2 "Computer Programming" thematic sequence.

Computer software plays an important role in our daily lives: Our mobile phones, laptop computers, online banking, Internet applications such as YouTube, video games and movies, cars, and almost all aspects of daily life are touched by software. In your personal and professional life you will utilize computer software. It is also likely that you will select, or even influence the design of, software that is used in your professional or personal life. This thematic sequence will give you a deep understanding of how software works and is created, its limitations, and its potential. You will be able to read software and therefore be able to make informed decisions when selecting or participating in the design of business, scientific, or information systems that utilize computer software.

The CSA2 thematic sequence consists of both of the following introductory computer programming courses.

• CSA 174, Fundamentals of Programming and Problem Solving
• CSA 271, Object-Oriented Programming

Followed by one of the following courses...

• CSA 274, Data Abstraction and Data Structures
• CSA 252, Web Application Programming
• CSA 283, Data Communications and Networks

CSA  274 is a course in which you build upon the programming concepts and techniques learned in CSA 174 and CSA 271 to design and implement more software using sophisticated data structures such as lists, stacks and queues. You will expand your problem solving skills by analyzing and using more sophisticated algorithms and programming techniques.

Learning Outcomes:

LEP

CSA 274.1: To be able to apply the use of appropriate data structures, abstract data types, and algorithmic methods in problem solving
CSA 274.1.1         Describe the purpose and semantics of major data structures including: Bags, Sets, Lists, Stacks, Queues, Trees, Hash Tables, and Graphs
CSA 274.1.2         Create programs that utilize the major data structures
CSA 274.1.3         Use the appropriate data structures for solving search problems
CSA 274.1.4         Describe the purpose and implementation of common graph algorithms including Depth First Search, Breadth First Search, Minimum Spanning Trees, and All-pairs Shortest Path.

T

CSA 274.2: To be able to create implementations of data structures and abstract data types
CSA 274.2.1         Create implementations of Bags, Sets, Lists, Stacks, Queues, Trees, Hash Tables, and graphs
CSA 274.2.2         Create alternative implementations of data structures
CSA 274.2.3         Describe the relative differences of alternative implementations of a data structure
CSA 274.2.4         Implement common graph algorithms including Depth First Search, Breadth First Search, Minimum Spanning Trees, and All-pairs Shortest Path

T

CSA 274.3: To be able to apply object-oriented principles when implementing data structures and abstract data types
CSA 274.3.1         Ceate data structures using polymorphism
CSA 274.3.2         Create data structures using inheritance
CSA 274.3.3         Create data structures using generic programming

T

CSA 274.4: Determine time and space requirements of common data structure implementations and algorithms
CSA 274.4.1         Describe the purpose of asymptotic notations (e.g., O, W, and Q) for algorithm analysis
CSA 274.4.2         Apply the use of asymptotic notations (e.g., O, W, and Q) to analyze algorithms

U

CSA 274.5: To be able to apply the use of C++ in the development of object-oriented programs
CSA 274.5.1         Describe the differences between C++ and Java
CSA 274.5.2         Create classes and objects using C++
CSA 274.5.3         Describe the purpose of memory management in C++ programs
CSA 274.5.4         Correctly use dynamic variables in C++
CSA 274.5.5         Correctly use pass by value and pass by reference parameters in C++

T,U