Skip to main content

XML tutorial

SA
one of my objectives for this article making you curios to know about XML , and make you search the web for more info about it , and i hope do that , lets start.


what is XML stand  for ? eXtensible Markup Language.
it is used to transport data over the internet , you can invent your own tags , no restriction .
for example if you want transport data for weather news:
< weathernews >
< new >
< city > Cairo < / city >
< max >36< / max >
< min > 22 < / min >
< / new >
< / weathernews >
XML  consist of main three component :
  1. tagged elements.
  2. attributes.
  3. text.
lets see example:

< bookstore >
< book category="CHILDREN" >
< title lang="en" > Harry Potter< /title >
< author>J K. Rowling< /author >
< year >2005< /year >
< price>29.99 < /price >
< /book >
< book category="WEB" >
< title lang="en" >Learning XML < /title >
< author > Erik T. Ray < /author >
< year > 2003 < /year >
< price > 39.95 < /price >
< / book >
< /bookstore >


in the previous example we can find :

  1. tagged elements like bookstore , book , year,....etc
  2. attributes category ="CHILDREN", lang="en"
  3. Text like HarryPotter ,Erik T. Ray
lets now talk about some rules for XML :

  • tags are case sensitive .
  • tags must be closed .
  • document must have one root element in the first example the root element was < weatherNews > in the second example the root element was < bookstore >.
  • XML attribute must be quoted for example  : lang="en"  .
well formed XML must adheres the previous rules.

after you read my short tutorial I hope you now curios to know more and more .
if you like plz follow this tutorial  it is good enough to start .

Comments

Post a Comment

Popular posts from this blog

DevExpress C# Chart Tutorial

Hello , this blog post about Charting in DevExpress , I faced many problems I visited hundreds of pages to solve this problems , actually it was the first time I use DevExpress Charts, Work is not like school or university , in school if you don't know thing you can learn it any time you want , in work you have to do today task yesterday, I like to share my knowledge and skills with you , I hope this Post help you . // clear series on chart  chart.Series.Clear(); // clear Titles of chart chart.Titles.Clear(); // legend alignment  chart.Legend.AlignmentHorizontal = LegendAlignmentHorizontal.Center; chart.Legend.AlignmentVertical = LegendAlignmentVertical.Bottom; chart.Legend.Direction = LegendDirection.LeftToRight; // creating series // series view Type example Line DevExpress.XtraCharts.Series series = new DevExpress.XtraCharts.Series("series name ", ViewType.Line); // add title  DevExpress.XtraCharts.ChartTitle chtTitle = new DevExpress.XtraCharts.Cha...
3 comments
Read more

Recursion

Recursion is a programming technique which function calls itself , this seems strange , however it is one of the most interested and effective technique in programming. it helps you write code in less statements and provides unique conceptual frame work to solve problems. lets discus some problems to know how it works : first example Triangular Numbers : it is series like : 1,3,6,10,15,21........ etc our program should get the nth term in the series, the numbers in this series called triangular numbers due to they can be visualized as a triangle. triangular numbers fig 1 finding the nth term using a loop see this figure : loop adding 1+2+3+4 and so on code is easy  , a loop will add numbers from n to 0 like this int triangle(int n) { int total = 0; while(n > 0) // until n is 1 { total = total + n; // add n (column height) to total --n; // decrement column height } return total; } it easy enough and for sure it is fast . before we start the recu...
2 comments
Read more

LeetCode Problem #19 Remove Nth Node From End of List

Solution for LeetCode Problem #19 Remove Nth Node From End of List it is linked list problem can be solved with multiple solutions, but I'm gonna solve it with fastest solution in java. Problem link we should assign dummy_head it is common while solving linked list problems  Assign 2 iterators slow and fast both equals to dummy_head we don't know the length of the list but we know it is always valid, so we will move with a window of size n+1 when we reach the end by the fast iterator the slow iterator will be in the node n+1 from the last , right? we will assign slow.next to be equal slow.next.next we are dropping the node n from last, got it? we will return dummy_head.next Thank you, AhmedG
Post a Comment
Read more