0% found this document useful (0 votes)
6 views2 pages

DATA STRUCHER WITH C LAB

This lab file belongs to Chahat Aryan, a second-year student in the Diploma in Computer Science and Engineering program at IIMT University. It outlines various experiments related to data structures using C, including search algorithms, sorting techniques, stack and queue implementations, and tree data structures. The file includes a table for proposed and actual conduction dates for each experiment, along with a signature section for the lab in-charge.

Uploaded by

chahataryan13
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
0% found this document useful (0 votes)
6 views2 pages

DATA STRUCHER WITH C LAB

This lab file belongs to Chahat Aryan, a second-year student in the Diploma in Computer Science and Engineering program at IIMT University. It outlines various experiments related to data structures using C, including search algorithms, sorting techniques, stack and queue implementations, and tree data structures. The file includes a table for proposed and actual conduction dates for each experiment, along with a signature section for the lab in-charge.

Uploaded by

chahataryan13
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/ 2

SCHOOL OF ENGINEERING AND

TECHNOLOGY
DEPARTMENT OF COMPUTER SCIENCE & ENGINEERING

LAB FILE
STUDENT NAME : CHAHAT ARYAN
ROLL NUMBER : 2362016041

LAB NAME : DATA STRUCTURE USING C LAB

LAB CODE : DICS-420P


COURSE NAME : DIPLOMA (CSE)
YEAR : II YEAR (IV SEM)
SUBJECT TEACHER: Mrs. DEEPTI KAUSHIK (A.P, CSE)

School of Engineering and Technology


IIMT University, Meerut

Contents of Lab File


S.No. Experiment Name Proposed Actual Conduction Sign. of lab
Conduction Date Date in-charge

1 To implement Linear and Binary Search.

To implement Bubble, selection, Merge, Heap,


2
Quick and insertion Sorting.

3 To implement stack using array and linked list.

4 To implement linked list.

To implement queue and circular queue using


5
array.

Write Program in C for implementation of


6
Insertion and Deletion in BST Using Linked List.

To implement binary tree, binary search tree


7
and tree traversal using linked list.

Write a program in C to implement depth-first


8
search and breadth first search.

You might also like