Scribd
Upload
39 views1 page

SNO Exp No Description Number

This document contains a table of contents that lists 18 experiments related to data structures and algorithms. The experiments cover topics like recursion, searching and sorting algorithms, stacks, queues, linked lists, binary trees, binary search trees, graphs, and additional optional experiments. The table provides a brief description and page number reference for each experiment.

Uploaded by

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

SNO Exp No Description Number

This document contains a table of contents that lists 18 experiments related to data structures and algorithms. The experiments cover topics like recursion, searching and sorting algorithms, stacks, queues, linked lists, binary trees, binary search trees, graphs, and additional optional experiments. The table provides a brief description and page number reference for each experiment.

Uploaded by

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

CONTENTS

SNO 1 2 3 4 5 6 1 2(A) 2(B) 2(C) 7 3(A) 3(B) 3(C) 8 4(A) 4(B) 4(C) 9 5(A) 5(B) 5(C) 10 6(A) 6(B) 11 7(A) 7(B) 7(C) 12 8(A) 8(B) 8(C) 13 9(A) 9(B) 9(C) 9(D) 9(E) 14 10(A) 10(B) 10(C) 15 11(A) 11(B) 11(C) 16 12(A) 12(B) Exp No DESCRIPTION LAB OBJECTIVE JNTU Syllabus List of Experiments SCHEDULE/CYCLE CHART Fibonacci Number using recursion Factorial using recursion GCD using recursion Towers of Hanoi using recursion Linear search using recursive & non-recursive functions Binary search using recursive & non-recursive functions Fibonacci search using recursive & non-recursive functions Bubble sort Quick sort Insertion sort Heap sort Radix sort Merge sort Stack using array Stack using linked lists Infix to postfix Queue using array Queue using linked list Creating a single linked list Insertion operation on a single linked list Deletion operation on a single linked list Addition of two large integers using linked list Reverse elements of a single linked list Store a polynomial expression in memory using linked list Represent the given Sparse matrix using arrays Represent the given Sparse matrix using linked list Create a Binary Tree of integers Traversing a binary tree in preorder, inorder and postorder using recursion Traversing a binary tree in preorder, inorder and postorder not using recursion Create a BST Insert a node into a BST delete a node from a BST Compute the shortest path of a graph using Dijkstras algorithm Find the minimum spanning tree using Warshalls Algorithm Additional Experiments 17 18 13 14 Circular queue using array Creation & Operations on DLL APPENDIX REFERNCE 104 107 Page Number 1 2 5 8 10 12 14 16 18 21 24 29 31 33 35 38 40 42 46 51 54 57 62 65 70 75 77 81 83 84 86 87 90 93 95 98 100 103

You might also like