Get's Answer

 1. You are given a number n. 2. You are required to print the nth element of fibonnaci sequence. Note -> Notice precisely how we have defined the fibonnaci sequence 0th element -> 0 1st element -> 1 2nd element -> 1 3rd element -> 2 4th element -> 3 5th element -> 5 6th element -> 8 Input Format A number n Output Format A number representing the nth element of fibonnaci sequence Constraints 0 <= n <= 45 Sample Input 10 Sample Output 55 Solution: import java.io.*; import java.util.*; public class Main{ public static void main(String[] args) throws Exception {     // write your code here     Scanner sc = new Scanner(System.in);     int n = sc.nextInt();     int[] A = new int[n+1];     A[0] = 0;     A[1] = 1;     for(int i=2;i<=n;i++){         A[i] = A[i-1] + A[i-2];     }     System.out.println(A[n]);  } }

Problem: Chef opened a company which manufactures cars and bikes. Each car requires   4 4  tyres while each bike requires  2 2  tyres. Chef has a total of  N N  tyres ( N N  is even). He wants to manufacture maximum number of cars from these tyres and then manufacture bikes from the remaining tyres. Chef's friend went to Chef to purchase a bike. If Chef's company has manufactured even a single bike then Chef's friend will be able to purchase it. Determine whether he will be able to purchase the bike or not. Input Format The first line contains an integer  T T  denoting the number of test cases. The  T T  test cases then follow. The first line of each test case contains an integer  N N  denoting the number of tyres. Output Format For each test case, output  YES  or  NO  depending on whether Chef's friend will be able to purchase the bike or not. Output is case insensitive. Constraints 1 ≤ T ≤ 100 1 ≤ T ≤...

Algorithm Analysis and Design Concepts       Data Structure and Algorithms            Post-Quiz  

Algorithm Analysis and Design Concepts       Data Structure and Algorithms            Pre-Quiz  

 Algorithm Analysis and Design Concepts       Analysis of Algorithms            Post-Quiz