Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Scribd
Upload
1K views

CS3362 C Programming and Data Structures Laboratory

This document outlines the objectives, experiments, and outcomes of the C Programming and Data Structures Laboratory course. The objectives are to develop C applications, implement linear and non-linear data structures, understand tree operations, and get familiar with sorting and searching algorithms. The 12 listed experiments involve implementing various C concepts and data structures like lists, stacks, queues, trees, and hashes. Upon completing the course, students will be able to develop C applications, write functions for data structures, select appropriate data structures for problems, apply hash functions, and implement sorting and searching algorithms.

Uploaded by

anant
Copyright
© © All Rights Reserved
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
1K views

CS3362 C Programming and Data Structures Laboratory

This document outlines the objectives, experiments, and outcomes of the C Programming and Data Structures Laboratory course. The objectives are to develop C applications, implement linear and non-linear data structures, understand tree operations, and get familiar with sorting and searching algorithms. The 12 listed experiments involve implementing various C concepts and data structures like lists, stacks, queues, trees, and hashes. Upon completing the course, students will be able to develop C applications, write functions for data structures, select appropriate data structures for problems, apply hash functions, and implement sorting and searching algorithms.

Uploaded by

anant
Copyright
© © All Rights Reserved
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 1

CS3362 C PROGRAMMING AND DATA STRUCTURES LABORATORY LTPC

0 0 3 1.5

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

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

TOTAL: 45 PERIODS
COURSE OUTCOMES:

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

You might also like