Scribd
Upload
54 views3 pages

2CEIT304 - DS - Practical List - Aug-2023

This document contains a practical list for the course Data Structures. It outlines 10 programming assignments involving implementing various data structures and algorithms in C including arrays, stacks, queues, linked lists, trees, sorting, searching and hashing. The assignments include writing programs to traverse arrays, implement recursion, pointers, stacks, queues, linked lists, binary trees, sorting algorithms, searching algorithms and hash tables.

Uploaded by

Temporary User
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
54 views3 pages

2CEIT304 - DS - Practical List - Aug-2023

This document contains a practical list for the course Data Structures. It outlines 10 programming assignments involving implementing various data structures and algorithms in C including arrays, stacks, queues, linked lists, trees, sorting, searching and hashing. The assignments include writing programs to traverse arrays, implement recursion, pointers, stacks, queues, linked lists, binary trees, sorting algorithms, searching algorithms and hash tables.

Uploaded by

Temporary User
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/ 3

Ganpat University

U.V.Patel College of Engineering

B. Tech in Computer Engineering/IT/CE-AI

Practical List
2CEIT304: Data Structures

B.Tech Semester: III

Academic Year: AUG-DEC-2023 (Odd Sem.)


Practical List

1 Write a C Program to Implement following:


1. To traverse elements of an array.
2. To calculate the factorial of a number using recursion.
3. To find the address of a variable using pointers.
4. To find out the Min, Max element and also Avg of the given Array.
5. Add two numbers using a pointer and display the sum of two numbers.
2 1. Write a C Program to Implement an Array representation of the sparse matrices.
2. Explain the Address Calculation of 1D Array.
3. Explain the Address Calculation of 2D Array using Row Major Order and Column
Major Order.
4. Write a C Program to create a 3D array, initialize the 3D Array then Print the value of
the 3D array.
5. Write a C Program to search the element in 2D Array.
3 Implement function of stack with following operations:
1. Push( )
2. Pop( )
3. Peep( )
4. Change( )
5. Display( )
6. Isempty( )
7. Isfull( )
4 Implement the application of Stack.
1. Write a program to recognize the string with language L={wcwR / w takes
multiple occurrences of {a,b}}.
2. Write a program to check the validity of expressions, which contains multiple
opening and closing brackets. (i.e., [{(a+b) * c} – d]).
3. Write a program to convert unparenthize infix expression to postfix.
4. Write a program to evaluate the given postfix expression.
5. Write a program to find the Fibonacci series using recursion for the given number.
6. Write a program for the Tower of Hanoi problem.
5 Implement function of Queue with following operations:
1. Write a program to Implement Simple Queue with following operations:
1. Insert( )
2. Delete( )
3. Display( )
2. Write a program to Implement Circular Queue with following operations:
1. Insert( )
2. Delete( )
3. Display( )
3. Write a program to Implement Deque with following operations:
1. InsertAtRear( )
2. InsertAtFront( )
3. DeleteAtRear( )
4. DeleteAtFront( )
5. Display( )
6 Implement Program for Linked List.
1. To implement singly linked list with following operations:
1. InsertAtFirst( )
2. InsertAtLast( )
3. InsertAfterspecifiednode( )
4. DeleteAtFirst( )
5. DeleteAtLast( )
6. DeleteAfterspecifiednode( )
7. Traverse (Display)
2. To implement a doubly linked list with above functions.
3. To implement a circular linked list with above functions.
7 Implement various sorting algorithms:
1. Selection Sort( )
2. Bubble Sort( )
3. Insertion Sort( )
4. Shellsort( )
5. Mergesort( )
6. Heapsort( )
7. Quicksort( )
8. Counting Sorting()
9. Radix sort ()
8 Write C Programs to Implement following operations of Binary Search Tree:
1. Insert
2. Delete
3. Create
9 Write C Program to implement searching algorithms for the following:
1. SequentialSearch( )
2. BinarySearch( )
10 Write C Programs to Implement Hash Tables.

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