diff --git a/Data Structure & Algorithm/nqueen.c b/Data Structure & Algorithm/backtracking/nqueen.c
similarity index 100%
rename from Data Structure & Algorithm/nqueen.c
rename to Data Structure & Algorithm/backtracking/nqueen.c
diff --git a/Data Structure & Algorithm/dynamic programming/fibbonacci.c b/Data Structure & Algorithm/dynamic programming/fibbonacci.c
new file mode 100644
index 0000000..1d6c172
--- /dev/null
+++ b/Data Structure & Algorithm/dynamic programming/fibbonacci.c	
@@ -0,0 +1,36 @@
+
+/*
+Description :- This program will print 'n'th term of fibbonacci series using dynamic programming
+Input Format: Enter an intger :- 10
+Output Format: 55
+*/
+#include<stdio.h> 
+
+int fib(int n) 
+{ 
+
+int f[n+2]; 
+int i; 
+
+
+f[0] = 0; 
+f[1] = 1; 
+
+for (i = 2; i <= n; i++) 
+{ 
+	
+	f[i] = f[i-1] + f[i-2]; 
+} 
+
+return f[n]; 
+} 
+
+int main () 
+{ 
+int n;
+printf("Enter an intger :-\n");
+scanf("%d",&n);
+printf("%d", fib(n)); 
+getchar(); 
+return 0; 
+}