Skip to content

Padhai By Astra Cloud

Tribhuvan University
BSc CSIT1 2 3 4 5 6 7 8
BCA1 2 3 4 5 6 7 8
BIT1 2 3 4 5 6 7 8
BIM1 2 3 4 5 6 7 8
BBA1 2 3 4 5 6 7 8
BBS1 2 3 4
Pokhara University
BE Computer (PU)1 2 3 4 5 6 7 8
BBA (PU)1 2 3 4 5 6 7 8
National Examinations Board (+2)
+2 Science1 2
+2 Management1 2
Every subject’s units and teaching hours.
TU
- BSc CSIT
- BCA
- BIT
- BIM
- BBA
- BBS
PU
- BE Computer (PU)
- BBA (PU)
NEB
- +2 Science
- +2 Management
Chapter notes, unit by unit.
TU
- BSc CSIT
- BCA
- BIT
- BIM
- BBA
- BBS
PU
- BE Computer (PU)
- BBA (PU)
NEB
- +2 Science
- +2 Management
Past board questions with worked answers.
TU
- BSc CSIT
- BCA
- BIT
- BIM
- BBA
- BBS
PU
- BE Computer (PU)
- BBA (PU)
NEB
- +2 Science
- +2 Management
Answer, check and learn why.
TU
- BSc CSIT
- BCA
- BIT
- BIM
- BBA
- BBS
PU
- BE Computer (PU)
- BBA (PU)
NEB
- +2 Science
- +2 Management
Notices
- GPA calculatorTU, PU and NEB grade points
- SearchEvery note and question

CSC211 Data Structures and Algorithms

Data Structures and AlgorithmsModel question

Write recursive algorithm to get Fibonacci term. Illustrate it drawing recursive tree.

5

A worked answer is on its wayMeanwhile, read the Data Structures and Algorithms notes for this topic.

Discussion

Loading…

More Data Structures and Algorithms questions

Define circular queue. How queue differ from stack. Write a program to implement linear queue.TU Board 208110 What is AVL tree? How heap differ from tree? Construct an AVL tree for data 24,12,8,15,35,30,57,40,45 and 78.TU Board 208110 Define list. How can you use linked list to implement stack? Explain circular linked list.TU Board 208110 Explain big oh notation in brief. Find big oh of the following function: f(x) = 5x^4 + 9x^2 + 7x + 9.TU Board 20815 Convert the infix expression A+(((B C) (D E)+F)/G)$(H I) into post expression using stack.TU Board 20815 Write a program to find GCD of two numbers using recursion.TU Board 20815

All Data Structures and Algorithms old questions