Skip to main content

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>
            <street>NRG Street</street>
            <city>coimbatore</city>
            <pincode>641038</pincode>
        </address>
        <department>CSE</department>
    </Student>

    <Student rollno="2017ECE1050">
        <name>
            <firstname>Vinitha</firstname>
        </name>
        <age>21</age>
        <address>
            <doorno>9</doorno>
            <street>Randy Street</street>
            <city>Chennai</city>
            <pincode>600025</pincode>
        </address>
        <department>ECE</department>
    </Student>

    <Student rollno="2017EEE2044">
        <name>
            <firstname>Steve</firstname>
              <lastname> Johnson </lastname>
        </name>
        <age>19</age>
        <address>
            <doorno>15</doorno>
            <street>CMH Road</street>
            <city>Bangalore</city>
            <pincode>560039</pincode>
        </address>
        <department>EEE</department>
    </Student>
</StudentList>


<?xml version="1.0" encoding="UTF-8"?>
<xs:schema xmlns:xs="http://www.w3.org/2001/XMLSchema" elementFormDefault="qualified" 
attributeFormDefault="unqualified">
<xs:element name="StudentList">
<xs:complexType>
<xs:sequence>
<xs:element name="Student" maxOccurs="unbounded" minOccurs="0">
<xs:complexType>
<xs:sequence>
<xs:element name="name">
<xs:complexType>
<xs:all>
<xs:element name="firstname" type="xs:string" minOccurs="0"/>
<xs:element name="lastname" type="xs:string" minOccurs="0"/>
</xs:all>
</xs:complexType>
</xs:element>
<xs:element name="age" type="xs:integer"/>
<xs:element name="address">
<xs:complexType>
<xs:sequence>
<xs:element name="doorno" type="xs:integer"/>
<xs:element name="street" type="xs:string"/>
<xs:element name="city" type="xs:string"/>
<xs:element name="pincode" type="xs:integer"/>
</xs:sequence>
</xs:complexType>
</xs:element>
<xs:element name="department" type="xs:string"/>
</xs:sequence>
<xs:attribute name="rollno" type="xs:string"/>
</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:

Logic Development | Object Oriented Programming Pre Quiz

 

Butterfly Pattern

  /* @ToDo  Butterfly Pattern     *                                   *     *   *                           *   *     *   *   *                   *   *   *     *   *   *   *           *   *   *   *     *   *   *...

Coin Change Combination

1. You are given a number n, representing the count of coins. 2. You are given n numbers, representing the denominations of n coins. 3. You are given a number "amt". 4. You are required to calculate and print the number of combinations of the n coins using which the       amount "amt" can be paid. Note 1: You have an infinite supply of each coin denomination i.e. same coin denomination can be                    used for many installments in payment of "amt" Note 2: You are required to find the count of combinations and not permutations i.e.                   2 + 2 + 3 = 7 and 2 + 3 + 2 = 7 and 3 + 2 + 2 = 7 are different permutations of same                    combination. You should treat them as 1 and not 3. Input Format A number n n1 n2 .. n number of elements A number amt Output Format A number representing the count of ...

Algorithm Analysis and Design Concepts Hands-On | Replace Character

 Algorithm Analysis and Design Concepts  Hands-On  Replace Character String – Replace Characters   Write a recursive function 'public static String replace(String str,char from,char to) ' that changes all occurrences of 'from' in ‘str’ to ‘to’. For example, if str were "codebook ", and from = 'o' and to = 'e', then, str would become "cedebeek". F unction Definitions: public static String replace(String str, char from, char to) Problem Requirements: Keyword Min Count Max Count for 0 0 while 0 0   Note:  Create the main() inside the class 'ReplaceDriver' Refer sample input and output for formatting specifications. Sample Input and Output : Enter the string Asia Enter the character to be replaced a Enter the character to be replaced with i The modified string is Asii Evaluation Result: Result Description Summary of tests *Note: All the test cases might not have same weightage +------------------------------+ | 8 tests run/ 8 t...

Software Engineering Concepts Hands-On

  Software Engineering Concepts  Hands-On

Palindromic Pattern

  /* @ToDo     Palindromic Pattern                 1                2   1   2            3   2   1   2   3        4   3   2   1   2   3   4    5   4   3   2   1   2   3   4   5        */ #include   <iostream> using   namespace   std ; int   main (){       #ifndef  ONLINE_JUDGE        ...

Subscribe to Get's Answer by Email