Scribd
Upload
6 views3 pages

DSindex (Nitin)

The document outlines practical work related to Data Structures using C and C++, submitted by Nitin Dixit for the Bachelor of Computer Application program at Naraina College of Management. It includes a list of programs and algorithms, such as inserting elements in arrays, searching in linked lists, and implementing various data structures like stacks, queues, and trees. The work is guided by Assistant Professor Sneha Singh and is part of the curriculum for the academic year 2024-25.

Uploaded by

harshitsinha095
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
6 views3 pages

DSindex (Nitin)

The document outlines practical work related to Data Structures using C and C++, submitted by Nitin Dixit for the Bachelor of Computer Application program at Naraina College of Management. It includes a list of programs and algorithms, such as inserting elements in arrays, searching in linked lists, and implementing various data structures like stacks, queues, and trees. The work is guided by Assistant Professor Sneha Singh and is part of the curriculum for the academic year 2024-25.

Uploaded by

harshitsinha095
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

PRACTICAL WORK

OF
Data Structure using C & C ++

Submitted for
Partial fulfillment of award of

BACHELOR OF COMPUTER APPLICATION


BY
NITIN DIXIT
Guided by
SNEHA SINGH
(Assistant professor)

NARAINA COLLEGE OF MANAGEMENT


YEAR (2024-25)
INDEX
Sr. PROGRAMS PAGE NO. SIGNATURE
no

Write a C program to insert an


1 element in array.

Write an algorithm to search an


2 element in linked list.

WAP in C for binary search in


3 array.

WAP for PUSH and POP in stack.


4

Write an algorithm to traverse in


5 linked list.

WAP to delete an element at rear


6 end in D-queue.

WAP to find a given matrix is


7 sparse matrix or not.

WAP to create a singly linked list.


8

Write an algorithm to implement


9 graph traversal in BFS and
DFS.
WAP to delete an
10 element at the
beginning of linked list.
WAP to implement insertion in BST.
11

WAP for deletion in queue.


12

WAP for linear search in an array.


13

WAP in C for tree traversal (In-


14 order).

Write an algorithm to delete an


15 element in tree.

You might also like