XML (eXtensible Markup Language)

 













Comments

Post a Comment

Popular posts from this blog

Types of Addressing modes

Image
  Implied / Implicit Addressing Mode Stack Addressing Mode Immediate Addressing Mode Direct Addressing Mode Indirect Addressing Mode Register Direct Addressing Mode Register Indirect Addressing Mode Relative Addressing Mode Indexed Addressing Mode Base Register Addressing Mode Auto-Increment Addressing Mode Auto-Decrement Addressing Mode 1. Implied Addressing Mode-   In this addressing mode, The definition of the instruction itself specify the operands implicitly. It is also called as  implicit addressing mode .   Examples-   The instruction “Complement Accumulator” is an implied mode instruction. In a stack organized computer, Zero Address Instructions are implied mode instructions. (since operands are always implied to be present on the top of the stack)   2. Stack Addressing Mode-   In this addressing mode, The operand is contained at the top of the stack.   Example-   ADD This instruction simply pops out two symbols contained at the top o...
Read more

Decision Tree Classification Algorithm

Image
  Decision Tree is a  Supervised learning technique  that can be used for both classification and Regression problems, but mostly it is preferred for solving Classification problems. It is a tree-structured classifier, where  internal nodes represent the features of a dataset, branches represent the decision rules  and  each leaf node represents the outcome. In a Decision tree, there are two nodes, which are the  Decision Node  and  Leaf Node.  Decision nodes are used to make any decision and have multiple branches, whereas Leaf nodes are the output of those decisions and do not contain any further branches. The decisions or the test are performed on the basis of features of the given dataset. It is a graphical representation for getting all the possible solutions to a problem/decision based on given conditions. It is called a decision tree because, similar to a tree, it starts with the root node, which expands on further branches and co...
Read more

DBMS - Program 6 - Insurance Database

Image
  6. INSURANCE DATABASE Consider the Insurance database given below. The primary keys are underlined and the data types are specified. PERSON (Driverld: text; Name: text; Address: text) CAR (RegNo: text; Model: text; Year: number) OWNS (DriverId: text; RegNo: text) ACCIDENT (ReportNo: number, AccDate: Date; Location: text) PARTICIPATED (DriverId; text; RegNo: text; ReportNo; number, Dmg_Amt:number (10, 2)) a)   Create the above tables by specifying the primary and foreign keys. b) Enter at least five tuples for each relation c)   Update the damage amount for each car accident. d) Add a new accident to the database. e)   Find the total number of people who owned cars that were involved in accidents in the                                        ...
Read more