C/C++ Programming and XML Schema Quiz

XML Schema is explicitly designed to be extensible. All three capabilities listed are core features: schemas can be reused via import/include, custom data types can be derived from standard types via extension/restriction, and multiple schemas can be referenced in a single document. The question asks what you CANNOT do - none of these are limitations.

XML Schema became a W3C Recommendation on May 2, 2001. This marked the standardization of XML Schema Definition (XSD) language for defining the structure, content, and semantics of XML documents. The date 02. May 2001 is the correct historical milestone.

In XML Schema (XSD), a simple element is an element that can contain only text. It cannot contain other elements, attributes, or be empty. The text can be of various simple types (like string, integer, date), but it is fundamentally text.

In XML Schema Definition (XSD), attributes are defined using the xs:attribute element with both name and type attributes. The type attribute specifies the data type of the attribute value. Option B is correct with proper namespace prefix (xs:) and quoted attribute values.

In XML Schema terminology, restrictions on XML elements are called facets. Facets define constraints on data types, such as length, patterns, min/max values, etc. They allow fine-grained control over what values are acceptable for elements and attributes.

One of the greatest strengths of XML Schemas is their support for data types. Unlike DTDs, XML Schema provides a rich set of built-in data types (string, integer, date, boolean, etc.) and allows custom data type definitions, enabling strong typing and validation of XML content.

With XML Schemas, the sender can describe the data in a way that the receiver will understand. The schema provides a common vocabulary and structure definition, ensuring both parties interpret the XML document consistently. This enables data interoperability between different systems.

In XML Schema, the three types of complex elements are: empty elements, elements that contain only other elements, and elements that contain only text (mixed content). 'Elements that contain only numbers' is not a distinct category - numeric content would fall under 'elements that contain only text' with a numeric data type.

In database systems and object-oriented programming, attributes or fields can be assigned default values that are automatically used when no explicit value is provided during record creation or object instantiation. This is a fundamental feature that ensures data integrity and prevents null values.

Tracing the recursion: fn(7) calls fn(6)+3. fn(6) calls fn(3)+2. fn(3) calls fn(2)+3. fn(2) calls fn(1)+2. Since fn(1) returns 1 (base case), working backwards: fn(2)=3, fn(3)=6, fn(6)=8, fn(7)=11. The recursive pattern adds 3 for odd decrements and 2 for even halves until reaching base case.

In C++, modifying a variable twice without an intervening sequence point causes undefined behavior. Here c++ both modifies c and yields its original value, but there's no sequence point between the two c evaluations in the cout statement. This violates sequencing rules, making the output undefined rather than predictably 01, 00, or 10.

In main, v is initialized to 10. Its address is passed to afunction. Inside afunction, the local pointer parameter x is reassigned to point to a newly allocated memory address, leaving the original variable v in main completely unmodified. Thus, v remains 10.

Virtual constructors are impossible in C++ because constructing an object requires knowing its exact type at compile-time for memory allocation. Virtual dispatch works through vtables on already-constructed objects, but construction must happen before the object (and vtable) exists. Therefore, constructors cannot be virtual.

The delete[] operator is required for arrays because it invokes the destructor for every element in the array. Using plain delete only invokes the destructor for the first element (myObj) and not the remaining 99 objects, causing resource leaks. The pairing must be new[] with delete[] and new with delete.

A pointer variable stores a memory address. When you declare int* a, the variable a itself holds an address. Accessing a returns that address value. Dereferencing (*a) gives the value at that address. Taking address of a (&a) gives the address where the pointer variable is stored, not the address it holds.

cin.getline() takes parameters in order: buffer pointer, maximum characters, and delimiter. Option A cin.getline(x, 100, '\n') is correct - x is the character array, 100 is max chars, \n is the delimiter. Option B swaps the first two parameters incorrectly. read() and readline() are not standard C++ functions.

The argument count (argc) includes the program name as argv[0], so it's always one more than the number of command-line arguments passed. If you run ./prog arg1 arg2, argc is 3 (program name + 2 arguments). This is why argc equals number of arguments plus one, not just the argument count.

Typecasting is a fundamental language feature in C++, not a library function. No header file is needed to use C-style casts (int)x or C++ casts static_cast(x). Options A, B, and C are all real headers but for different purposes (stdio, character types, math functions). Typecasting syntax is built into the compiler.