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

Algorithm Analysis and Design Concepts

Data Structure and Algorithms

Pre-Quiz

Comments

Must Read:

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...

RDBMS Data Definition Language | Create Buses table

efer the below schema and create the buses table. Column Name Datatype Size Constraint Constraint name Bus_no Number 11 Primary key PK_BUSES Bus_name Varchar2 20 Type Varchar2 20 Total_seats Number 11 Avail_seats Number 11 Result Description Summary of tests +------------------------------+ | 3 tests run / 3 test passed | +------------------------------+

Software Engineering Concepts Software Maintenance Test Your Understanding

Web Technology HTML 5 HTML 2 | Quiz 2

Web Technology HTML 5 HTML 2 Quiz 2

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); ...

Logic Development | Object Oriented Programming Pre Quiz

Unbounded Knapsack

1. You are given a number n, representing the count of items. 2. You are given n numbers, representing the values of n items. 3. You are given n numbers, representing the weights of n items. 3. You are given a number "cap", which is the capacity of a bag you've. 4. You are required to calculate and print the maximum value that can be created in the bag without overflowing it's capacity. Note: Each item can be taken any number of times. You are allowed to put the same item again and again. Input Format A number n v1 v2 .. n number of elements w1 w2 .. n number of elements A number cap Output Format A number representing the maximum value that can be created in the bag without overflowing it's capacity Constraints 1 <= n <= 20 0 <= v1, v2, .. n elements <= 50 0 < w1, w2, .. n elements <= 10 0 < cap <= 10 Sample Input 5 15 14 10 45 30 2 5 1 3 4 7 Sample Output 100 Solution: im...

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] ...

RDBMS Data Definition Language | Alter - Add CHECK constraint to Mobile_Master

RDBMS Data Definition Language Alter - Add CHECK constraint to Mobile_Master Refer the following schema and add a constraint CHK_WARRANTY in Mobile_Master table to ensure that the warranty in years is greater than zero. Evaluation Result: Result Description Summary of tests +------------------------------+ | 3 tests run / 3 test passed | +------------------------------+

Get's Answer

Search This Blog