0% found this document useful (0 votes)
10 views5 pages

Assignment

The lab report discusses two data structures: stack and queue. A stack operates on the LIFO principle with push and pop operations, while a queue operates on the FIFO principle with enqueue and dequeue operations. Both data structures are essential in various applications such as backtracking, expression evaluation, task management, and search algorithms.

Uploaded by

ahanafsabbir83
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)
10 views5 pages

Assignment

The lab report discusses two data structures: stack and queue. A stack operates on the LIFO principle with push and pop operations, while a queue operates on the FIFO principle with enqueue and dequeue operations. Both data structures are essential in various applications such as backtracking, expression evaluation, task management, and search algorithms.

Uploaded by

ahanafsabbir83
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/ 5

LAB REPORT : 03

DATE : 24-11-2024
TOPIC : STACK

OBJECTIVE:A stack is a data structure that operates on the LIFO (Last In, First Out) principle,
meaning the last element added is the first to be removed. It supports two main operations:
push (to add an element) and pop (to remove an element). Stacks are commonly used in
backtracking, expression evaluation, and managing function calls in recursion.

SOURCE CODE :

Output :
Topic name : queue
Objective : A queue is a data structure that operates on the FIFO (First In, First Out) principle,
meaning the first element added is the first to be removed. It supports two main operations:
enqueue (to add an element) and dequeue (to remove an element). Queues are widely used in
scheduling, task management, and breadth-first search algorithms.
Source code :
Output :

You might also like