Computer Science & Web Technology Quiz

XML is a simplified and restricted form of SGML (Standard Generalized Markup Language). It inherits SGML's structural features while removing complexity. HTML and XHTML are applications of SGML/XML, not the other way around.

DTD stands for Document Type Definition. It defines the structure and legal elements of an XML document. 'Direct Type Definition' and 'Dynamic Type Definition' are not real terms in this context.

To solve this question, the user needs to have knowledge of arrays and computer memory.

The memory address of the first element of an array is called the base address. This is because the base address is the starting point or foundation of the array in memory. It is the address at which the first element of the array is stored.

Therefore, the correct answer is:

The Answer is: D. base address.

Option A is incorrect because floor address is not a term used to refer to the memory address of the first element of an array.

Option B is incorrect because foundation address is not a term used to refer to the memory address of the first element of an array.

Option C is incorrect because first address is not a term used to refer to the memory address of the first element of an array.

Linear arrays are indexed structures because elements can be accessed directly using their index position in constant time O(1). Linked lists are sequential access structures requiring traversal from the head.

Option D is the correct answer because binary search efficiency (O(log n)) works well regardless of data size - the 1000-element limit mentioned is not a requirement. Options A, B, and C are all actual requirements for binary search.

Two-dimensional arrays are commonly referred to as both 'tables' and 'matrices' in different contexts - tables in database/spreadsheet contexts, matrices in mathematical contexts. Both terms are correct.

In programming, a pointer is a variable whose value is the memory address of another variable. While it can store addresses, the functional definition is that it 'points' to the location of data.

Arrays are defined as collections of homogeneous data elements (elements of the same type). Records (or structs) are specifically designed to store non-homogeneous (different) data types together.

Indecomposable data items that cannot be broken down further are called elementary items, atoms, or scalars depending on the programming context. All three terms refer to the same concept of basic, non-divisible data units.

Binary search requires random access to elements to find the middle index efficiently (O(1)). Linked lists only allow sequential access (O(N)), making the standard binary search algorithm impractical and no faster than linear search.

A deque (double-ended queue) allows insertion and deletion at both ends. A queue is restricted to one end for insertion and the other for removal (FIFO), while a stack operates LIFO (last-in-first-out) at a single end.

When START=NULL in a linked list, it means the list is empty. Attempting to remove from an empty list causes underflow - trying to remove something that doesn't exist. Overflow occurs when there's no space to add new elements.

Yuri Gagarin made history on April 12, 1961, as the first human to journey into outer space aboard Vostok 1. He completed one orbit of Earth before returning. The first moon landing happened much later in 1969 (Neil Armstrong).

Tim Berners-Lee, a British scientist, invented the World Wide Web in 1989 while working at CERN. Charles Babbage is known as the 'father of the computer' for his 19th-century mechanical designs, not the web.