Description

This course covers the organization of data and algorithms that act upon them. The topics include analysis of algorithms, linked lists, stacks, queues, trees, graphs, heaps, and hashing. Algorithms manipulating data structures, like searching and sorting, memory allocation and file management are included. The concept of abstract data types is also introduced. Moreover, the course gives an introduction to algorithm design techniques.

Program

IS -132 CRs

Objectives

• • Understand the difference between static and dynamic data types.
  • Understand the concept of pointers & dynamic memory allocation.
  • Acquire practical programming experience using dynamic structures.
  • Analyze the organizations of proposed data structures and how to use them efficiently.
  • Apply the acquired knowledge in many practical applications like database, network, compiler and others.
  • Demonstrate the ability to design abstract data types using various data structures.