Please tell most efficient algo....
1. Write a method to find the prime fibonacci numbers.
eg. 1,1,2,3,5,8,13.... are fibonacci
2,3,5,7,11,12... are prime.
2,3,5,13.....are prime fibonacci.
2. Write a program to reverse a linked list using O(1) space.
3. Write the traversal of a tree into a file and then recreate the tree
using the file.
4. There is a matrix where a[i][j] =-1 if there is no train going from i
station to j station.
= 0 if i=j.
= n if there is a train going
from station i to j taking n hours.
Given a starting station and destination station, find the minimum possible
path from s to d.
--
**Regards
SAGAR PAREEK
COMPUTER SCIENCE AND ENGINEERING
NIT ALLAHABAD
--
You received this message because you are subscribed to the Google Groups
"Algorithm Geeks" group.
To post to this group, send email to [email protected].
To unsubscribe from this group, send email to
[email protected].
For more options, visit this group at
http://groups.google.com/group/algogeeks?hl=en.
