Web Technology HTML 5 HTML 1 Quiz 2

Web Technology

HTML 5

HTML 1

Quiz 2

Comments

Must Read:

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

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 ++){ ...

Arrange Buildings

1. You are given a number n, which represents the length of a road. The road has n plots on it's each side. 2. The road is to be so planned that there should not be consecutive buildings on either side of the road. 3. You are required to find and print the number of ways in which the buildings can be built on both side of roads. Input Format A number n Output Format A number representing the number of ways in which the buildings can be built on both side of roads. Constraints 0 < n <= 45 Sample Input 6 Sample Output 441 Solution: import java.io.*; import java.util.*; public class Main{ public static void main(String[] args) throws Exception { // write your code here Scanner scn = new Scanner(System.in); long n = scn.nextInt(); long ob = 1; long os = 1; for (int i = 2; i <= n; i++) { long nb = os; long ns = os + ob; ob = nb; ...

Logic Development | Object Oriented Programming Pre Quiz

Software Engineering Concepts Software Engineering Fundamentals Post-Quiz

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

Software Engineering Concepts Requirement Analysis Pre-Quiz

Software Engineering Concepts Introduction to Agile Technologies Introduction to Agile Technologies | Quiz 1

Software Engineering Concepts Introduction to Agile Technologies Introduction to Agile Technologies | Quiz 1 Software Engineering Concepts Introduction to Agile Technologies Introduction to Agile Technologies | Quiz 1 | Software Engineering Concepts Basics Of Testing Post-Quiz | Software Engineering Concepts Basics Of Testing Test Your Understanding | Software Engineering Concepts Basics Of Testing Pre-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...

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

Get's Answer

Search This Blog