Scribd
Upload
29 views1 page

R22B.Tech - .CSE IIIyr Scheme Syllabus2 9 23 57

The document outlines a course on data structures lab for a B.Tech program. It includes 10 experiments covering topics like linked lists, stacks, queues, sorting algorithms and trees. The course objectives are to introduce C programming concepts and data structures. On completion, students will be able to develop C programs using data structures and implement searching and sorting algorithms.

Uploaded by

22641a66c8
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
29 views1 page

R22B.Tech - .CSE IIIyr Scheme Syllabus2 9 23 57

The document outlines a course on data structures lab for a B.Tech program. It includes 10 experiments covering topics like linked lists, stacks, queues, sorting algorithms and trees. The course objectives are to introduce C programming concepts and data structures. On completion, students will be able to develop C programs using data structures and implement searching and sorting algorithms.

Uploaded by

22641a66c8
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 1

B.

Tech-CSE R22 Regulations

VAAGDEVI COLLEGE OF ENGINEERING


(AUTONOMOUS)
DATA STRUCTURES LAB
B.Tech. II Year I Sem. L T P C
0 0 3 1.5
Prerequisites: A Course on “Programming for problem solving”.

Course Objectives:
 It covers various concepts of C programming language
 It introduces searching and sorting algorithms
 It provides an understanding of data structures such as stacks and queues.

List of Experiments:
1. Write a program that uses functions to perform the following operations on singly linked list.:
i) Creation ii) Insertion iii) Deletion iv) Traversal
2. Write a program that uses functions to perform the following operations on doubly linked list.:
i) Creation ii) Insertion iii) Deletion iv) Traversal
3. Write a program that uses functions to perform the following operations on circular linked list.:
i) Creation ii) Insertion iii) Deletion iv) Traversal
4. Write a program that implement stack (its operations) using
i) Arrays ii) Pointers
5. Write a program that implement Queue (its operations) using
i) Arrays ii) Pointers
6. Write a program that implements the following sorting methods to sort a given list of integers in
ascending order
i) Quick sort ii) Heap sort iii) Merge sort
7. Write a program to implement the tree traversal methods( Recursive and Non Recursive).
8. Write a program to implement
i) Binary Search tree ii) B Trees iii) B+ Trees
iv) AVLtrees v) Red - Black trees
9. Write a program to implement the graph traversal methods.
10. Implement a Pattern matching algorithms using Boyer- Moore, Knuth-Morris-Pratt

Course Outcomes:
CO-1: Ability to develop C programs for computing and real-life applications using basic elements
like control statements, arrays, functions, pointers and strings, and data structures like
stacks, queues and linked lists.
CO-2: Ability to Implement searching and sorting algorithms

TEXT BOOKS:
1. Fundamentals of Data Structures in C, 2nd Edition, E. Horowitz, S. Sahni and Susan
Anderson Freed, Universities Press.
2. Data Structures using C – A. S. Tanenbaum, Y. Langsam, and M. J. Augenstein,
PHI/PearsonEducation.

REFERENCE BOOK:
1. Data Structures: A Pseudocode Approach with C, 2nd Edition, R. F. Gilberg and B. A. Forouzan,
Cengage Learning.

57

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy