Software Engineering Concepts Configuration Management And Version Control Configuration Management And Version Control Quiz 1

Comments

Must Read:

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

Mock 3 Slot3 - Handson - 21st July RDBMS (20 Marks) 2.1 Customer details

Write a query to display customer id, customer name, and password of customers whose name starts with 'A'. The password contains the first 3 characters from the name and the first 3 digits from the phone number. Give alias name for password as PASSWORD. Sort the records based on id in descending order. ( Hint: Retrieve data from Customers tables ) Evaluation Result: Result Description Summary of tests:(Note:Your query is evaluated against different datasets. Kindly do not Hardcode) +------------------------------+ | 2 tests run / 2 test passed | +------------------------------+

Programming using Java Hands On - Arrays | Find & Display the position of a number

Write a java program to find the given number from the array of elements and display its position. If the number is not present in an array then display it as 0. Assume the position starts from 1. Sample Input 1 Enter the array size 4 Enter the values 9 32 17 4 Enter the number to find 17 Sample Output 1 3 Sample Input 2 Enter the array size 3 Enter the values 29 53 11 Enter the number to find 49 Sample Output 2 0 Result Description Summary of tests *Note: All the test cases might not have same weightage +------------------------------+ |4 tests run / 4 tests passed | +------------------------------+ TEST CASE PASSED

Software Engineering Concepts Software Engineering Fundamentals Post-Quiz

Programming using Java Hands On - Arrays | Display array values

Write a java program to create an array of size ‘n’ and accepts ‘n’ number of integers from the user and display all the values from an array Sample Input 1 Enter the array size 5 Enter the values 10 15 62 94 78 Sample Output 1 10 15 62 94 78 Result Description Summary of tests *Note: All the test cases might not have same weightage +------------------------------+ |3 tests run / 3 tests passed | +------------------------------+ TEST CASE PASSED

Logic Development | Object Oriented Programming Pre Quiz

RDBMS Data Definition Language | Create Payments table

Refer the below schema and create the table payments. Column Name Datatype Size Constraint Constraint name Reference table – Column name Payment_ID Varchar2 3 PRIMARY KEY PK_PAYMENTS Ticket_ID Varchar2 3 FOREIGN KEY FK_PAYMENTS_TICKETS TICKETS - TICKET_ID BD_ID Number 11 FOREIGN KEY FK_PAYMENTS_BOOKINGDETAILS BOOKINGDETAILS-BD_ID DISCOUNT_ID Varchar2 3 FOREIGN KEY FK_PAYMENTS_DISCOUNTS DISCOUNTS-DISCOUNT_ID Result Description Summary of tests +------------------------------+ | 3 tests run / 3 test passed | +------------------------------+

Programming using Java Hands On - Control Structures | Bill Generation

Bill Generation Tom went to a movie with his friends in a multiplex theatre and during break time he bought pizzas, puffs and cool drinks. Consider the following prices : Rs.100/pizza Rs.20/puffs Rs.10/cooldrink Generate a bill for What Tom has bought. Sample Input 1: Enter the no of pizzas bought:10 Enter the no of puffs bought:12 Enter the no of cool drinks bought:5 Sample Output 1: Bill Details No of pizzas:10 No of puffs:12 No of cooldrinks:5 Total price=1290 ENJOY THE SHOW!!! Result Description Summary of tests *Note: All the test cases might not have same weightage +------------------------------+ | 6 tests run/ 6 tests passed | +------------------------------+

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

Get's Answer

Search This Blog