CS213

DATA STRUCTURES LABORATORY

Objectives

  • To analyze the time and space complexities and efficiency of various algorithms.
  • To understand the practical application of linear and nonlinear data structures.
  • To introduce and practice advanced algorithms, programming techniques necessary for developing sophisticated computer application programs.

 

Outcomes

  • Ability to apply and implement the learned algorithm for problem solving
  • Ability to identify the data structure to develop program for real time applications

 

Experiments

  1. Problems in C/C++/ Java using data structures involving arrays, stacks, queues, strings, linked lists, trees, graphs.
  2. Operations on stacks, queues and linked lists
  3. Conversion of infix expressions to postfix and evaluation of postfix expressions
  4. Implementation of priority queue
  5. Implementation of Binary Tree and Binary Search Tree
  6. Implementation of Sorting Techniques