Scribd
Upload
3 views2 pages

DSA Lab 2 task

The lab focuses on performance analysis of algorithms through time and space complexity, specifically using recursive algorithms for Fibonacci series and factorial calculations. It emphasizes the impact of recursion on memory usage and execution time. The hands-on experience reinforces the importance of efficient algorithm design in computational problem-solving.

Uploaded by

c.h.r.ist.in.ed.aler.oya
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as ODT, PDF, TXT or read online on Scribd
3 views2 pages

DSA Lab 2 task

The lab focuses on performance analysis of algorithms through time and space complexity, specifically using recursive algorithms for Fibonacci series and factorial calculations. It emphasizes the impact of recursion on memory usage and execution time. The hands-on experience reinforces the importance of efficient algorithm design in computational problem-solving.

Uploaded by

c.h.r.ist.in.ed.aler.oya
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as ODT, PDF, TXT or read online on Scribd
You are on page 1/ 2

Data Structures and Algorithm

Name: Rana Muhammad Musab Akram Roll No : 23-CSE-24 Lab: 02

Lab Objective:
 Show Performance Analysis (Time Complexity and Space Complexity)
 Make a program of recursive algorithms of Fibonacci series and Factorial numbers.

Abstract:
This lab focuses on analyzing the performance of algorithms using the concepts of time complexity
and space complexity. Understanding how algorithms perform under different inputs is crucial for
designing efficient programs. The lab tasks involve implementing recursive algorithms for Fibonacci
series and Factorial calculation, which help illustrate how time and space usage can vary
significantly depending on the algorithm design. The lab also highlights the concept of recursion and
its implications in terms of memory and computational cost.

Lab Tasks:

1. Make a program that prints the Fibonacci series.

2. Compile an algorithm to calculate the factorial and make a program.


Data Structures and Algorithm

Conclusion:
This lab provided hands-on experience in analyzing the performance of recursive algorithms through
time and space complexity. By implementing Fibonacci and factorial computations, we observed how
recursive calls increase memory usage and affect execution time. This exercise reinforced the
importance of choosing efficient algorithmic approaches and understanding computational costs when
solving problems.

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy