Standard Article

Data Structures and Algorithms

  1. Carlos A.S. Oliveira1,
  2. Panos M. Pardalos2,
  3. Oleg A. Prokopyev2

Published Online: 14 DEC 2007

DOI: 10.1002/9780470050118.ecse097

Wiley Encyclopedia of Computer Science and Engineering

Wiley Encyclopedia of Computer Science and Engineering

How to Cite

Oliveira, C. A., Pardalos, P. M. and Prokopyev, O. A. 2007. Data Structures and Algorithms. Wiley Encyclopedia of Computer Science and Engineering. .

Author Information

  1. 1

    Oklahoma State University, Stillwater, Oklahoma

  2. 2

    University of Florida, Gainesville, Florida

Publication History

  1. Published Online: 14 DEC 2007

Abstract

Algorithms and data structures are the basic building blocks employed in computer sciences research and applications. We present the fundamental concepts in the area of analysis of algorithms and data structures. The concept of abstract data type is introduced, along with some useful data types such as lists, queues, stacks, trees, and graphs. More advanced data structures are also mentioned along with applications where they occur. Techniques for algorithm construction, including divide and conquer, dynamic programming, and backtracking, are introduced. Standard algorithms are presented, such as sorting, searching, and matrix multiplication. Finally, more advanced topics such as approximation algorithms, parallel algorithms, and randomized algorithms are discussed.

Keywords:

  • algorithms;
  • data structures;
  • parallel algorithms;
  • randomized algorithms;
  • approximation algorithms