0% found this document useful (0 votes)
7 views1 page

DS Assignment II

The document is an assignment on data structures, covering various topics such as stacks, recursion, Fibonacci series, Tower of Hanoi, queues, and trees. It includes specific questions asking for definitions, algorithms, and examples related to each topic. The assignment aims to assess understanding of fundamental data structure concepts and their applications.
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
7 views1 page

DS Assignment II

The document is an assignment on data structures, covering various topics such as stacks, recursion, Fibonacci series, Tower of Hanoi, queues, and trees. It includes specific questions asking for definitions, algorithms, and examples related to each topic. The assignment aims to assess understanding of fundamental data structure concepts and their applications.
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd

Data Structure

Assignment-II
Q.1) What is stack? Write an algorithm to PUSH and POP the element into
stack
with example.

Q.2) What is recursion? Explain the recursion algorithm to find the factorial of
given number.

Q3) Write an algorithm to generate Fibonacci series using recursion.


Q4) Explain Tower of Hanoi problem with suitable example.
Q.5) What is Queue? Explain the algorithm to delete the element from the
queue.
Q.6) Explain the types of Queue in detail.
Q.7) Define tree. Explain its family and representation.
Q.8) What is Binary tree? Explain the memory representation of Binary Tree.

You might also like