Scribd
Upload
3 views

322CST07-C PROGRAMMING AND DATA STRUCTURES LAB

The C Programming and Data Structures Laboratory course focuses on implementing basic and advanced data structures using C, including functions, recursion, and various algorithms. Students will complete exercises involving arrays, linked lists, trees, and graph traversals, as well as searching and sorting algorithms. By the end of the course, students will be able to apply different data structures to solve practical problems and implement real-time applications.

Uploaded by

Mary Sasi Axm
Copyright
© © All Rights Reserved
Available Formats
Download as DOC, PDF, TXT or read online on Scribd
3 views

322CST07-C PROGRAMMING AND DATA STRUCTURES LAB

The C Programming and Data Structures Laboratory course focuses on implementing basic and advanced data structures using C, including functions, recursion, and various algorithms. Students will complete exercises involving arrays, linked lists, trees, and graph traversals, as well as searching and sorting algorithms. By the end of the course, students will be able to apply different data structures to solve practical problems and implement real-time applications.

Uploaded by

Mary Sasi Axm
Copyright
© © All Rights Reserved
Available Formats
Download as DOC, PDF, TXT or read online on Scribd
You are on page 1/ 2

322ECP07 C PROGRAMMING AND DATA STRUCTURES LABORATORY L T P C

0 0 2 1

PREREQUISITES: Nil

OBJECTIVES:
 Understand and implement basic data structures using C
 Apply linear and non-linear data structures in problem solving
 Learn to implement functions and recursive functions by means of data structures
 Implement searching and sorting algorithms.

LIST OF EXERCISES:

1. Basic C Programs – Looping, Decision- Making


2. Programming using Arrays and String functions
3. Programming using Functions and Recursion
4. Programs using Structures and Union
5. Program using Pointers
6. Program using Memory Management Functions
7. Linked list implementation of List, Stacks and Queues
8. Implementation of Tree Traversals
9. Implementation of Binary Search trees
10. Implementation of Graph Traversals
11. Implementation of Shortest Path Algorithm
12. Implementation of Linear search and binary search
13. Implementation of Insertion sort, Quick sort and Merge Sort

COURSE OUTCOMES:

At the end of the course, the students will be able to:

CO1: Implement basic and advanced programs in C


CO2: Implement functions and recursive functions in C
CO3: Apply the different Linear Data Structures for Implementing Solutions to Practical Problems.
CO4: Apply and implement Graph Data Structures for Real Time Applications.
CO5: Implement various Searching, Sorting and hashing Algorithms.
LIST OF EQUIPMENTS AND SOFTWARE FOR A BATCH OF 30 STUDENTS
Hardware:
LAN System with 30 Nodes (OR) Stand-alone PCs -30 No’s.
Printer – 3 No’s.
Software:
OS: Windows
Turbo C

CO-PO MAPPING
Course Name CO’S Program outcomes (Washington Accord Attributes)
PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2 PSO3
C CO1 2 3 1 2 2 1 1 - 1 2 1 3 2 1 3
PROGRAMMIN CO2 1 2 1 2 2 - - - 1 1 1 2 2 2 2
G AND DATA CO3 2 3 1 2 3 - - - 1 1 1 2 2 1 2
STRUCTURES CO4 2 1 - 1 1 - - - 2 1 1 2 2 3 1
LABORATORY CO5 1 2 1 2 2 1 1 - 1 2 1 3 2 2 3
AVERAGE 2 2 1 2 2 1 1 - 1 1 1 2 2 2 2

You might also like