Software Engineering Concepts Software Engineering Fundamentals Post-Quiz

Software Engineering Concepts

Software Engineering Fundamentals

Post-Quiz

Comments

Must Read:

Software Engineering Concepts Configuration Management And Version Control Post-Quiz

Software Engineering Concepts Software Maintenance Test Your Understanding

Number Pattern

/* @ToDo Number Pattern 1 1 2 1 2 3 1 2 3 4 1 2 3 4 5 */ #include <iost...

Climb Stairs With Variable Jumps

1. You are given a number n, representing the number of stairs in a staircase. 2. You are on the 0th step and are required to climb to the top. 3. You are given n numbers, where ith element's value represents - till how far from the step you could jump to in a single move. You can of course jump fewer number of steps in the move. 4. You are required to print the number of different paths via which you can climb to the top. Input Format A number n .. n more elements Output Format A number representing the number of ways to climb the stairs from 0 to top. Constraints 0 <= n <= 20 0 <= n1, n2, .. <= 20 Sample Input 10 3 3 0 2 1 2 4 2 0 0 Sample Output 5 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); ...

Software Engineering Concepts Requirement Analysis Post-Quiz

Software Engineering Concepts Requirement Analysis Post-Quiz Software Engineering Concepts Requirement Analysis Post-Quiz Software Engineering Concepts Requirement Analysis Test Your Understanding Software Engineering Concepts Requirement Analysis Pre-Quiz Software Engineering Concepts Software Maintenance Test Your Understanding Software Engineering Concepts Software Maintenance Post-Quiz Software Engineering Concepts Software Maintenance Pre-Quiz Software Engineering Concepts Software Engineering Fundamentals Post-Quiz Software Engineering Concepts Software Engineering Fundamentals Pre-Quiz Algorithm Analysis and Design Concepts Data Structure and Algorithms Post-Quiz Software Engineering Concepts Configuration Management And Version Control Configuration Management And Version Contro...

Count Binary Strings

1. You are given a number n. 2. You are required to print the number of binary strings of length n with no consecutive 0's. Note: In this problem, you are given a number n. All we need to print is the number of binary strings of length n with no consecutive 0's For example: Sample Input: 3 Sample Output: 5 How 5? We have a total of eight binary numbers for length 3, out of which we have 5 numbers in which there are no consecutive zeros. Input Format A number n Output Format A number representing the number of binary strings of length n with no consecutive 0's. Constraints 0 < n <= 45 Sample Input 6 Sample Output 21 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 dp[][] = new int[n+1][2]; dp[1][0] = 1; dp[1][1] ...

Zig Zag Pattern

/* @ToDo Zig Zag Pattern * * * * * * * * * */ #include <iostream> using namespace std ; int main (){ #ifndef ONLINE_JUDGE freopen ( "../asset/input.txt" , "r" , stdin ); freopen (...

Pyramid

/* To Print 1 2 2 3 3 3 4 4 4 4 5 5 5 5 5 */ #include <iostream> using namespace std ; int main (){ #ifndef ONLINE_JUDGE freopen ( "../asset/input.txt" , "r" , stdin ); freopen ( "../asset/output.txt" , "w" , stdout ); #endif // Code here!! int n ; cin >> n ; for ( int i = 1 ; i <= n ; i ++){ for ( int j = 1 ; j <= i ; j ++){ ...

Get's Answer

Search This Blog