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

 Result Description
 Summary of tests
+------------------------------+
| 3 tests run / 3 test passed  |
+------------------------------+

Comments

Must Read:

Zero One Knapsack | Recursion

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

Count Encodings

1. You are given a string str of digits. (will never start with a 0) 2. You are required to encode the str as per following rules 1 -> a 2 -> b 3 -> c .. 25 -> y 26 -> z 3. You are required to calculate and print the count of encodings for the string str. For 123 -> there are 3 encodings. abc, aw, lc For 993 -> there is 1 encoding. iic For 013 -> This is an invalid input. A string starting with 0 will not be passed. For 103 -> there is 1 encoding. jc For 303 -> there are 0 encodings. But such a string maybe passed. In this case print 0. Input Format A string str Output Format count of encodings Constraints 0 < str.length <= 10 Sample Input 123 Sample Output 3 Solution: import java.io.*; import java.util.*; public class Main { ...

Data Formats ( XML & JSON ) XML AND JSON | Generate XSD for Students

Generate XSD for Students Generate XSD for the following XML. XYZ School wants to store the details of students in an xml file. The following scenario helps in designing the XML document. Here StudentList is the root tag. StudentList contains the entry of each student with rollno, name, age, address and department. <?xml version="1.0" encoding="UTF-8"?> <StudentList xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:noNamespaceSchemaLocation="StudentList.xsd"> <Student rollno="2017CSE0055"> <name> <firstname>Savitha</firstname> </name> <age>20</age> <address> <doorno>35</doorno> ...

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

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

Accenture Mock Quiz | Part 1

Question 1 Incorrect Marked out of 1.00 Remove flag Question text Select the true statement ? Select one: a. Inheritance forms a is-a part of relationship between classes. b. Aggregation is the stronger form of Inheritance. c. Aggregation forms the is-a type of relationship between classes. d. Aggregation forms a is-a part of relationship between classes. Composition is the stronger form of Aggregation. Feedback The correct answer is: Aggregation forms a is-a part of relationship between classes. Composition is the stronger form of Aggregation. Question 2 Correct Marked out of 1.00 Flag question Question text What is the diagram that depicts the interaction between objects by arranging the objects in time sequence ? Select one: a. Use Case Diagram b. Sequence Diagram c. Component Diagram d. Activity Diagram Feedback The correct answer is: Sequence Diagram Question 3 Incorrect Marked out of 1.00 Flag question...

Get's Answer

Search This Blog