Linked List A collection of objects called nodes is defined as a Linked List. These nodes are randomly stored in memory. There are two fields present in a node. The first field is the data stored at that particular address and the second field is the pointer containing the address of the next node in … Read more
2D Array An array of arrays or a 2D array is organized as matrices. It can be represented as a collection of rows and columns and is used to implement a relational database look-alike data structure. For holding the bulk of data at once, a 2D array provides an easy way. This data can then … Read more
Array A collection of similar types of data items stored at contiguous memory locations is called an array. Being a derived data type in C programming language, an array can store the primitive type of data such as int, char, double, float, etc. The data element of an array can be randomly accessed by using … Read more
Structure A composite data type used to define a grouped list of variables, to be placed under one name in a block of memory is called structure. Thus, by using a single pointer to the structure, we can get access to different variables. Syntax: struct structure_name { data_type member1; data_type member2; . . data_type member; … Read more
Pointer To point the address of the value stored anywhere in the computer memory, a pointer is used. Dereferencing the pointer is to obtain the value stored at the location. The performance for a repetitive process is improved by the pointer. Such processes include: Traversing String Lookup Tables Control Tables Tree Structures Pointer Details: Pointer … Read more
Asymptotic Analysis The method of defining the mathematical bound of its run-time performance to easily conclude the average case, best case, and the worst-case scenario of an algorithm, is called the asymptotic analysis of the algorithm, in mathematical analysis. In simple words, the asymptotic analysis of the algorithm is used to mathematically calculate the running … Read more
Algorithm A procedure having well-defined steps for solving a particular problem is called an algorithm. Or in other words, an algorithm can be defined as a finite set of logic or instructions, written in order to accomplish a certain predefined task. Being just a solution (logic) of a problem, and not the complete program or … Read more
To define shortcuts to special characters, the entities are used which can be declared either internal or external. There are three parts of an entity: An ampersand (&) An entity name A semicolon (;) An Internal Entity Declaration: Syntax: Example: DTD Example: XML example: &writer;©right; An External Entity Declaration: Syntax: Example: DTD Example: XML example: … Read more
For the attributes and the child elements in XML, there are no rules about when to use which one. Use of Elements vs Attributes: We can store the data either in child elements or in attributes. Example 1: Tom Gates Example 2: male Tom Gates Explanation: In the above examples, gender is an attribute in … Read more
An ATTLIST declaration is used to declare the attributes in a DTD. Declaring Attributes: Syntax: Attribute declaration: Example: DTD: Example: XML: Attribute-type: We can choose any of the below for the attribute-type: Type Uses CDATA To specify that the value is character data. (en1|en2|..) To specify that the value must be one from an enumerated … Read more