➜
  KUMAR SHIVAM

Explain Fibonacci Sequence ? 

Data Structures and Algorithms

Answer in Short

 The Fibonacci sequence is a type series where each number is the sum of the two that precede it. It starts from 0 and 1 usually

Explanation
962    0

==> Fibonacci Sequence---

        Fibonacci series 0,1,1,2,3,5,8,13,21,…..

  1. if n=0 or n=1, then Fn =n
  2. if n>1 then Fn=Fn-1+Fn-2

         fib(n)

        {

         if(n==0)

         return 0;

         if(n==1) return 1;

         else

         return( fib(n-1)+fib(n-2));

          } 





Share:   

More Questions from Data Structures and Algorithms Module 2

Define stacks. Explain various operation of stacks ? 

Define stacks . Explain implementation of stacks ? 

 Explain Applications of Stack ? 

Explain briefly Infix expression, Polish Notation and Reverse Polish Notation ?

Define Evaluation of Postfix expression. Explain algorithm and example for it ? 

Explain Conversion to Infix expression to Postfix expression

Explain stacks using dynamic arrays ? 

Explain Multiple stacks ?

Explain Factorial of a number ? 

Explain Fibonacci Sequence ? 

Define Tower of Hanoi. Explain Problem statement for Tower of Hanoi ? 

Define Tower of Hanoi . Explain algorithm for Tower of Hanoi ? 

Explain Ackermann function in details ?

Define Queue. Explain Basic features of Queue ? 

Define Queue. Explain Applications of Queue ? 

Explain about Implementation of Queue ? 

Explain simple queue ? Brief disadvantages of simple queue.

Explain Algorithm for Enqueue operation  and Algorithm for Dequeue operation using array ? 

Define Circular Queue. Describe implementation of Circular Queue ? 

Explain Dequeues- Double Ended Queues ? 

Define Priority Queue. Explain Application and implementation of Priority Queue ?