Algorithms are step-by-step plans for solving problems. They are a starting point when writing a program. Algorithms can be designed using pseudo-code and flowcharts.

Once an algorithm has been designed and perfected, it must be translated – or programmed close programming The process of writing computer software. – into code that a computer can read.

Such algorithms are often quite efficient and provide useful bounds on the optimal solutions. The learning will be supported by instructor provided notes, readings from textbooks and assignments.

Cross-listed with DTSA 5503. Course Type: Pathway | Breadth Specialization: Foundations of Data Structures and Algorithms Instructor: Dr. Sriram Sankaranarayanan, Professor of Computer Science Prior ...

1 Describe key models of computation and associated programming language paradigms based on them.; 2 Evaluate the advantages and disadvantages of various programming languages for different ...