3rd Sem, IT

CD3281: Data Structures and Algorithms Laboratory syllabus for IT 2021 regulation

Data Structures and Algorithms Laboratory detailed syllabus for Information Technology (IT) for 2021 regulation curriculum has been taken from the Anna University official website and presented for the IT students. For course code, course name, number of credits for a course and other scheme related information, do visit full semester subjects post given below.

For Information Technology 3rd Sem scheme and its subjects, do visit IT 3rd Sem 2021 regulation scheme. The detailed syllabus of data structures and algorithms laboratory is as follows.

Data Structures and Algorithms Laboratory

Course Objectives:

  • To implement ADTs in Python
  • To design and implement linear data structures – lists, stacks, and queues
  • To implement sorting, searching and hashing algorithms
  • To solve problems using tree and graph structures

List of Experiments:

  1. Implement simple ADTs as Python classes
  2. Implement recursive algorithms in Python
  3. Implement List ADT using Python arrays
  4. Linked list implementations of List
  5. Implementation of Stack and Queue ADTs
  6. Applications of List, Stack and Queue ADTs
  7. Implementation of sorting and searching algorithms
  8. Implementation of Hash tables
  9. Tree representation and traversal algorithms
  10. Implementation of Binary Search Trees
  11. Implementation of Heaps
  12. Graph representation and Traversal algorithms
  13. Implementation of single source shortest path algorithm
  14. Implementation of minimum spanning tree algorithms

Course Outcomes:

At the end of the course, the student should be able to:

  1. Implement ADTs as Python classes
  2. Design, implement, and analyse linear data structures, such as lists, queues, and stacks, according to the needs of different applications
  3. Design, implement, and analyse efficient tree structures to meet requirements such as searching, indexing, and sorting
  4. Model problems as graph problems and implement efficient graph algorithms to solve them

Text Books:

  1. Michael T. Goodrich, Roberto Tamassia, and Michael H. Goldwasser, Data Structures & Algorithms in Python, John Wiley & Sons Inc., 2013

Reference Books:

  1. Rance D. Necaise, Data Structures and Algorithms Using Python, John Wiley & Sons, 2011
  2. Aho, Hopcroft, and Ullman, Data Structures and Algorithms, Pearson Education, 1983.
  3. Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, and Clifford Stein, Introduction to Algorithms”, Second Edition, McGraw Hill, 2002.
  4. Mark Allen Weiss, Data Structures and Algorithm Analysis in C++, Fourth Edition, Pearson Education, 2014

For detailed syllabus of all other subjects of Information Technology, 2021 regulation curriculum do visit IT 3rd Sem subject syllabuses for 2021 regulation.

For all Information Technology results, visit Anna University IT all semester results direct link.

Leave a Reply

Your email address will not be published. Required fields are marked *

*