CS3362 C PROGRAMMING AND DATA STRUCTURES LABORATORY
Anna University – CS3362 C PROGRAMMING AND DATA STRUCTURES LABORATORY Regulation 2021 Syllabus, Notes, Lab Manual Important Questions, Question Paper with Answers, Previous Year Question Paper.
LIST OF EXPERIMENTS CS3362 C PROGRAMMING AND DATA STRUCTURES LABORATORY
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
| Syllabus | Click Here |
| Lab Manual | Click Here |
| Important Questions | Click Here |
| Previous Year Question Paper | Click Here |
| Question Bank | Click Here |
COURSE 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 to sorting and searching algorithms
COURSE OUTCOMES: CS3362 C PROGRAMMING AND DATA STRUCTURES LABORATORY
At the end of the course, the students will be able to:
CO1 Use different constructs of C and develop applications
CO2 Write functions to implement linear and non-linear data structure operations
CO3 Suggest and use the appropriate linear / non-linear data structure operations for a given
problem
CO4 Apply appropriate hash functions that result in a collision free scenario for data storage and
Retrieval
CO5 Implement Sorting and searching algorithms for a given application