A Plus Topper

Improve your Grades

CS3311- Data Structures Laboratory Syllabus Regulation 2021 Anna University

by

Anna University, Subject code – CS3311, deals with the B.E Computer Science and Engineering  Semester -III Data Structures Laboratory syllabus regulation 2021 relating to affiliated institutions. From here, Students can get assistance in preparing notes to excel in academic performance.

We include every topic of the Data Structures Laboratory Syllabus, to understand the subject very well. It will help you to improve your idea of syllabus of CS3311-Data Structures Laboratory Syllabus on your finger tips to go ahead in a clear path of preparation. In this following article Data Structures Laboratory Syllabus, will help you, Hope you share with your friends.

If you want to know more about the syllabus of B.E Computer Science and Engineering connected to an affiliated institution’s under four-year undergraduate degree programme. We provide you with a detailed Year-wise, semester-wise, and Subject-wise syllabus in the following link B.E Computer Science and Engineering Syllabus Anna University, Regulation 2021.

Aim Of Concept:

  1. To demonstrate array implementation of linear data structure algorithms.
  2. To implement the applications using Stack.
  3. To implement the applications using Linked list
  4. To implement Binary search tree and AVL tree algorithms.
  5. To implement the Heap algorithm.
  6. To implement Dijkstra’s algorithm.
  7. To implement Prim’s algorithm
  8. To implement Sorting, Searching and Hashing algorithms.

CS3311- Data Structures Laboratory Syllabus

List Of Exercises:

  1. Array implementation of Stack, Queue and Circular Queue ADTs
  2. Implementation of Singly Linked List
  3. Linked list implementation of Stack and Linear Queue ADTs
  4. Implementation of Polynomial Manipulation using Linked list
  5. Implementation of Evaluating Postfix Expressions, Infix to Postfix conversion
  6. Implementation of Binary Search Trees
  7. Implementation of AVL Trees
  8. Implementation of Heaps using Priority Queues
  9. Implementation of Dijkstra’s Algorithm
  10. Implementation of Prim’s Algorithm
  11. Implementation of Linear Search and Binary Search
  12. Implementation of Insertion Sort and Selection Sort
  13. Implementation of Merge Sort
  14. Implementation of Open Addressing (Linear Probing and Quadratic Probing)

Related Posts On Semester III: