[go: up one dir, main page]
Scribd
Upload
64 views3 pages

DS Lab File Front Page

This document is a lab file for the Bachelor of Technology in Information Technology program at G. L. Bajaj Institute of Technology and Management for the session 2023-24. It includes an index of various programming tasks and experiments related to data structures and algorithms, such as implementing arrays, stacks, queues, linked lists, sorting algorithms, and graph algorithms. The document is structured for students to fill in their details and complete the specified programming tasks.

Uploaded by

pramodkaushik6455
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
64 views3 pages

DS Lab File Front Page

This document is a lab file for the Bachelor of Technology in Information Technology program at G. L. Bajaj Institute of Technology and Management for the session 2023-24. It includes an index of various programming tasks and experiments related to data structures and algorithms, such as implementing arrays, stacks, queues, linked lists, sorting algorithms, and graph algorithms. The document is structured for students to fill in their details and complete the specified programming tasks.

Uploaded by

pramodkaushik6455
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

G. L.

Bajaj Institute of Technology and Management,


Greater Noida

BACHELOR OF TECHNOLOGY
IN
INFORMATION TECHNOLOGY

SUBJECT NAME
LAB FILE (SUBJECT CODE)
SESSION: 2023-24

SUBMITTED BY SUBMITTED TO
Name:

Section:

Roll No:

Year / Semester:
INDEX
S. Program Name Execution Submission Signature Remarks
No. Date Date

1 To Implement addition and multiplication


of two 2D arrays.

2 To implement Stack using array.

3 To implement Queue using array

4 To implement Circular Queue using array

5 To implement Stack using Linked list.


6 To implement queue using Linked list.

7 To implement Circular queue using Linked list.

8 To implement Linear linked list and operations


on it

1. Insertion
 Insert at Beginning
 Insert at middle Position
 Insert at End
2. Deletion.
 Delete at Beginning
 Delete at middle Position
 Delete at End

9 To implement Doubly linked list and operations


on it

3. Insertion
 Insert at Beginning
 Insert at middle Position
 Insert at End
4. Deletion.
 Delete at Beginning
 Delete at middle Position
 Delete at End
10 To implement circular Singly Linked List and
Circular doubly linked list.

11 Sorting Algorithms Non-Recursive


12 Sorting Algorithms-Recursive
 Insertion Sort
 Merge Sort
 Quick Sort
 Heap Sort
 Bubble Sort
 Selection Sort
 Radix Sort
13 Implementation of Binary search tree, Insertion
and Deletion in BST
14
Graph implementation, BFS, DFS, Minimum Cost
Spanning tree, Shortest path algorithm.

Experiment No. -1
Objective: -…………………………………………………………………………….

Code: -

You might also like