Data Formats ( XML & JSON ) XML AND JSON

Data Formats ( XML & JSON ) XML AND JSON | Generate XSD 2

Generate XSD 2

Generate XSD for the following XML document

<?xml version="1.0" encoding="UTF-8"?>

<hotel>

<Facilities>Restaurant,Parking,Internet</Facilities>

<Address>Taj Ganj,FFatehabad Road Agra Uttar Pradesh 282001</Address>

<Type>budget</Type>

</hotel>

<hotel>

<Name> TAJ EXOTICA </Name>

<Facilities>Indian therapies,Yoga and meditation,Spaindulges,Parking</Facilities>

<Address>CalwaddoBenaulim, Salcete Goa 403716</Address>

<Type>luxury</Type>

<Available>false</Available>

</hotel>

<hotel>

<Name> VIVANTA by TAJ </Name>

<Facilities>Parking,Restaurant,Internet,Chinese Restaurant, Party Lawn</Facilities>

<Address>105, Race Course Road Coimbatore TamilNadu 641018</Address>

<Type>medium luxury</Type>

</hotel>

<hotel>

<Name> TAJ DECCAN </Name>

<Facilities>Parking,Fitnesscenter,Meetingrooms,Private dining for party</Facilities>

<Address>Road No. 1, Banjara Hills Hyderabad Telangana State 500034</Address>

<Type>Budget</Type>

</hotel>

<hotel>

<Name> TAJ BEKAL RESORT </Name>

<Facilities>Spa ,Internet ,Yoga and meditation,parking,internet</Facilities>

<Address>Kappil Beach Kasargod Kerala 671319</Address>

<Type>Luxury</Type>

<Available>false</Available>

</hotel>

</hotels>

<?xml version="1.0" encoding="UTF-8"?>
<xs:schema xmlns:xs="http://www.w3.org/2001/XMLSchema" elementFormDefault="qualified" attributeFormDefault="unqualified">
<xs:element name="hotels">
<xs:complexType>
    <xs:sequence>
        <xs:element name="hotel" maxOccurs="unbounded">
            <xs:complexType>
            <xs:sequence>
            <xs:element name="ID" type="xs:int"/>
            <xs:element name="Name" type="xs:string"/>
            <xs:element name="Stars" type="xs:int"/>
            <xs:element name="Facilities" type="xs:string"/>
            <xs:element name="Address" type="xs:string"/>
            <xs:element name="Type" type="xs:string"/>
            <xs:element name="Available" type="xs:string"/>
            </xs:sequence>
            </xs:complexType>
        </xs:element>
    </xs:sequence>
</xs:complexType>
</xs:element>
</xs:schema>

Evaluation Result:

 Result Description
Summary of tests
 *Note: All the test cases might not have same weightage
+------------------------------+
|  1  test run/ 1  test passed |
+------------------------------+

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

Software Engineering Concepts Software Engineering Fundamentals Post-Quiz

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

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

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

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

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

Get's Answer

Search This Blog