This laboratory course enables students to:

  • Compute the time and space complexity of searching and sorting algorithms with asymptotic notations.
  • Implement all the operations of linear data structures to store and retrieve the given data.
  • Apply Algorithm for solving problems like sorting, searching, insertion and deletion of data
  • Create a hierarchical data structure to represent the given data using tree data structure.
  • Design graph algorithms to compute the shortest path of the given graph and to identify the Minimum spanning tree.

To know more about UG & PG Programs, Eligibility, Admission Procedure, Fee Structure and Scholarship, please fill this request information form.

Admission Open

Join the Conversation on Social Media