Skip to main content

Data Formats ( XML & JSON ) XML AND JSON | Generate XSD For Breakfast Menu

 

Generate XSD For Breakfast Menu

Generate XSD for the given XML document

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

<breakfast_menu>

<food>

<name>Turfle waffles</name>

<price>$5.95</price>

<description>This two turfle which has 2 famous product  is with real choco and maple syrup</description>

<calories>650</calories>

</food>

<food>

<name>Strawberry Belgian Waffles</name>

<price>$24.6</price>

<description>Light Belgian waffles covered with strawberries and whipped cream</description>

<calories>900</calories>

</food>

<food>

<name>Berry-Berry Belgian Waffles</name>

<price>$4.78</price>

<description>Light Belgian waffles covered with an assortment of fresh berries and whipped cream</description>

<calories>400</calories>

</food>

<food>

<name>Fried Toast</name>

<price>$7.68</price>

<description>Thick slices made from our homemade wheat dough bread</description>

<calories>250</calories>

</food>

<food>

<name>Homestyle Breakfast</name>

<price>$7.95</price>

<description>Two eggs, bacon or sausage, toast, and England popular  hash browns</description>

<calories>1500</calories>

</food>

</breakfast_menu>

Solution:


<?xml version="1.0" encoding="UTF-8"?>
<xs:schema xmlns:xs="http://www.w3.org/2001/XMLSchema" 
elementFormDefault="qualified" attributeFormDefault="unqualified">
<xs:element name="breakfast_menu">
<xs:complexType>
   <xs:sequence>
<xs:element name="food" maxOccurs="unbounded">
<xs:complexType>
<xs:sequence>
<xs:element name="name" type="xs:string"/>
<xs:element name="price" type="xs:string"/>
<xs:element name="description" type="xs:string"/>
<xs:element name="calories" type="xs:int"/>
</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:

Web Technology HTML 5 HTML 2 | Quiz 2

 Web Technology       HTML 5            HTML 2               Quiz 2

Pattern

  /* To print Pattern:                     *                 *   *             *   *   *         *   *   *   *     *   *   *   *   * */ #include   <iostream> using   namespace   std ; int   main (){       #ifndef  ONLINE_JUDGE          freopen ( "../asset/input.txt" , "r" , stdin );          freopen ( "../asset/output.txt" , "w" , stdout );     #endif     //...

Target Sum Subsets - Dp

1. You are given a number n, representing the count of elements. 2. You are given n numbers. 3. You are given a number "tar". 4. You are required to calculate and print true or false, if there is a subset the elements of which add       up to "tar" or not. Input Format A number n n1 n2 .. n number of elements A number tar Output Format true or false as required Constraints 1 <= n <= 30 0 <= n1, n2, .. n elements <= 20 0 <= tar <= 50 Sample Input 5 4 2 7 1 3 10 Sample Output true Solution: import java.io.*; import java.util.*; public class Main {     public static void main(String[] args) throws Exception {         Scanner sc = new Scanner(System.in);         int n = sc.nextInt();         int[] arr = new int[n];         for(int i=0;i<n;i++)             arr[i] = sc.nextInt();         int tar = sc.nextInt(); ...

Subscribe to Get's Answer by Email