ANALYSIS AND DESIGN OF DATA STRUCTURES AND ALGORITHMS

Catalog description

Three hours of lecture per week. This course is an introduction to data structures and algorithm design as fundamental topics in computer engineering. This course includes the design of efficient algorithms, abstract data types such as linked lists, queues, stacks, binary trees, complex analysis, sorting, searching, and recursive algorithms. The study of data structures and algorithms is important because complex problems usually require computer solutions that run algorithms and manipulate data. In addition, students develop the critical thinking skills that allow them to apply the right set of tools to solve a specific problem and communicate the results. COMP 315L ANALYSIS AND DESIGN OF DATA STRUCTURES AND ALGORITHMS LAB 1 CREDIT One three-hour lab session per week. This course supplements the topics and activities presented in COMP 315. It offers students the opportunity to hone their skills with additional practice in a programming language as applied to data structures and desig n of algorithms. The study of data structures and algorithms is important because complex problems usually require computer solutions that run algorithms and manipulate data. In addition, students develop the critical thinking skills that allow them to apply the right set of tools to solve a specific problem and communicate the results.