A Plus Topper

Improve your Grades

CS3362 - C Programming and Data Structures Laboratory Syllabus Regulation 2021 Anna University

by

The article contains the subject code CS3362, which deals with the Anna University B.E Electrical and Electronics Engineering Semester – III C Programming and Data Structures Laboratory Syllabus. Unit-wise detailed syllabus of this subject CS3362 is included in this article. You can get assistance for note preparation or can understand the chapters contain topics in one place.

Effective results need effective preparation and having the required knowledge of the topics included in the subject. If you want to perform well in academics proper guidance and the subject syllabus in mind are necessary, this article CS3362 – C Programming and Data Structures Laboratory Syllabus will fulfill the details regarding your preparation.

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

Aim Of Objectives:

  • To develop applications in C.
  • To implement linear and non-linear data structures.
  • To understand the different operations of search trees.
  • To get familiarized with sorting and searching algorithms.

List Of Experiments:

  1. Practice of C programming using statements, expressions, decision-making, and iterative statements.
  2. Practice of C programming using Functions and Arrays.
  3. Implement C programs using Pointers and Structures.
  4. Implement C programs using Files.
  5. Development of real-time C applications.
  6. Array implementation of List ADT.
  7. Array implementation of Stack and Queue ADTs.
  8. Linked list implementation of List, Stack, and Queue ADTs.
  9. Applications of List, Stack, and Queue ADTs.
  10. Implementation of Binary Trees and operations of Binary Trees.
  11. Implementation of Binary Search Trees.
  12. Implementation of searching techniques.
  13. Implementation of Sorting algorithms: Insertion Sort, Quick Sort, Merge Sort.
  14. Implementation of Hashing – any two collision techniques.

Related Posts Of Semester – III: