LLOYD INSTITUTE OF ENGINEERING & TECHNOLOGY (153)

NAME: MOHD BILAL BJECT - DATA STRUCTURE LAB

CLASS-B. TECH CSE(LATERAL ENTRY) SUBMITTED TO: Dr. SUDESHNA

Lab Number : 01
Write Implementing Sorting Programs:
• BUBBLE SORT

MOHDBILAL

1|Page
LLOYD INSTITUTE OF ENGINEERING & TECHNOLOGY (153)

• OUTPUT:

2|Page
LLOYD INSTITUTE OF ENGINEERING & TECHNOLOGY (153)

• MERGE SORT

3|Page
LLOYD INSTITUTE OF ENGINEERING & TECHNOLOGY (153)

• OUTPUT

4|Page
LLOYD INSTITUTE OF ENGINEERING & TECHNOLOGY (153)

• INSERTION SORT

MOHD BILAL

• OUTPUT

5|Page
LLOYD INSTITUTE OF ENGINEERING & TECHNOLOGY (153)

• SELECTION SORT

MOHD BILAL

• OUTPUT

6|Page
LLOYD INSTITUTE OF ENGINEERING & TECHNOLOGY (153)

• QUICK SORT

MOHD BILAL

• OUTPUT

7|Page
LLOYD INSTITUTE OF ENGINEERING & TECHNOLOGY (153)

Lab Number: 02
To write programs implementing searching program:
• LINEAR SEARCH

MOHD BILAL

• OUTPUT

8|Page
 LLOYD INSTITUTE OF ENGINEERING & TECHNOLOGY (153)

• BINARY SEARCH

MOHD BILAL

• OUTPUT

9|Page
LLOYD INSTITUTE OF ENGINEERING & TECHNOLOGY (153)

Lab Number: 03
To Write programs implementing:
• STACKS

MOHD BILAL

10 | P a g e
LLOYD INSTITUTE OF ENGINEERING & TECHNOLOGY (153)

• OUTPUT

11 | P a g e
LLOYD INSTITUTE OF ENGINEERING & TECHNOLOGY (153)

• QUEUE

MOHD BILAL

MOHD BILAL

12 | P a g e
LLOYD INSTITUTE OF ENGINEERING & TECHNOLOGY (153)

• OUTPUT

13 | P a g e
LLOYD INSTITUTE OF ENGINEERING & TECHNOLOGY (153)

Lab Number:04
To write programs implementing Linked List using dynamic memory allocation.

MOHD BILAL

• OUTPUT

14 | P a g e
LLOYD INSTITUTE OF ENGINEERING & TECHNOLOGY (153)

Lab Number: 05
To write program implementing Binary tree

15 | P a g e
LLOYD INSTITUTE OF ENGINEERING & TECHNOLOGY (153)

• OUTPUT

Lab Number:06
To write programs implementing graph traversal
BFS – Breadth First Search

16 | P a g e
LLOYD INSTITUTE OF ENGINEERING & TECHNOLOGY (153)

• OUTPUT

17 | P a g e