Feedback Congratulations! You have passed by securing more that 80%. Question 1 Correct Mark 1.00 out of 1.00 Flag question Question text Solaris is the name of a flavor of UNIX from _____________. Select one: a. HP b. Sun Microsystems c. IBM d. Digital Equipment Corp Feedback Your answer is correct. The correct answer is: Sun Microsystems Question 2 Correct Mark 1.00 out of 1.00 Flag question Question text Match the following: HP-UX Answer 1 Choose... IBM Redhat Hewlett Packard Sun Microsystem AIX Answer 2 Choose... IBM Redhat Hewlett Packard Sun Microsystem Linux Answer 3 Choose... IBM Redhat Hewlett Packard Sun Microsystem Solaris Answer 4 Choose... IBM Redhat Hewlett Packard Sun Microsystem Feedback Your answer is correct. The correct answer is: HP-UX → Hewlett Packard, AIX → IBM, Linux → Redhat,...
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] ...
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 0 or 1 number of times. You are not 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 75 Solution: import java.io.*; import java.util.*; public class Main...
RDBMS Data Definition Language Drop Sales Info table(child) Refer the following schema and drop Sales Info table. Evaluation Result: Result Description Summary of tests +------------------------------+ | 1 tests run / 1 test passed | +------------------------------+
Comments
Post a Comment