Data Structures Lab

Lab Objectives:

The Lab experiments aims:

  1. To use data structures as the introductory foundation for computer automation to engineering problems.
  2.  To use the basic principles of programming as applied to complex data structures.
  3. To learn the principles of stack, queue, linked lists and its various operations.
  4. To learn fundamentals of binary search tree, implementation and use of advanced tree like AVL, B trees and graphs.
  5. To learn about searching, hashing and sorting.
  6. To learn the applications of linked lists, stacks, queues, trees and graphs.
Lab Outcomes:

On successful completion, of course, learner/student will be able to:
  1. Understand and use the basic concepts and principles of various linked lists, stacks and queues. L1, L2, L3
  2. Understand the concepts and apply the methods in basic trees. L1, L2
  3. Use and identify the methods in advanced trees. L3, L4
  4. Understand the concepts and apply the methods in graphs. L2, L3
  5. Understand the concepts and apply the techniques of searching, hashing and sorting L2, L3
  6. Illustrate and examine the methods of linked lists, stacks, queues, trees and graphs to various real time problems L3, L4