Second source code of HTML

 <!DOCTYPE html>

<html lang="en">

<head>
    <meta charset="UTF-8">
    <meta http-equiv="X-UA-Compatible" content="IE=edge">
    <meta name="description" content="width=device-width, initial-scale=1.0">
    <title>My Blog</title>
    <style>
        #main-header{
            text-align: center;
            background-color: black;
            color: white;
            padding: 10px;
        }
        #main-footer{
            text-align: center;
            font-size: small;
            background-color: rgb(185, 179, 179);
        }
    </style>
</head>

<body>
    
    <header id="main-header">
        <h1>My website</h1>
    </header>
    <section>
        <a href="index.html">Home</a>
        <article class="post">
            <h3>Blog post 1</h3>
            <small>Posted by Harsh on 26 March</small>
            <p>Lorem ipsum dolor sit amet consectetur adipisicing elit.
                Nobis praesentium eligendi delectus sapiente autem distinctio,
                tenetur excepturi neque laborum nostrum itaque rerum pariatur
                molestias architecto explicabo, ex quam illo quia.
                Lorem ipsum dolor sit amet consectetur adipisicing elit. Delectus,
                quae aspernatur quod ipsa excepturi, repellat distinctio dignissimos
                omnis sunt aliquam autem. Repellat commodi, provident eligendi ipsum
                id architecto voluptas ab!
                <a href="post.html" target="_blank">Read More</a>
            </p>
        </article>
        <article class="post">
            <h3>Blog post 2</h3>
            <small>Posted by Harsh on 26 March</small>
            <p>Lorem ipsum dolor sit amet consectetur adipisicing elit.
                Nobis praesentium eligendi delectus sapiente autem distinctio,
                tenetur excepturi neque laborum nostrum itaque rerum pariatur
                molestias architecto explicabo, ex quam illo quia.
                Lorem ipsum dolor sit amet consectetur adipisicing elit. Delectus,
                quae aspernatur quod ipsa excepturi, repellat distinctio dignissimos
                omnis sunt aliquam autem. Repellat commodi, provident eligendi ipsum
                id architecto voluptas ab!
                <a href="post.html" target="_blank">Read More</a>
            </p>
        </article>
        <article class="post">
            <h3>Blog post 3</h3>
            <small>Posted by Harsh on 26 March</small>
            <p>Lorem ipsum dolor sit amet consectetur adipisicing elit.
                Nobis praesentium eligendi delectus sapiente autem distinctio,
                tenetur excepturi neque laborum nostrum itaque rerum pariatur
                molestias architecto explicabo, ex quam illo quia.
                Lorem ipsum dolor sit amet consectetur adipisicing elit. Delectus,
                quae aspernatur quod ipsa excepturi, repellat distinctio dignissimos
                omnis sunt aliquam autem. Repellat commodi, provident eligendi ipsum
                id architecto voluptas ab!
                <a href="post.html" target="_blank">Read More</a>
            </p>
        </article>
    </section>
    <aside>
        <h3>Categories</h3>
        <ul>
            <li>Category 1</li>
            <li>Category 2</li>
            <li>Category 3</li>
        </ul>
    </aside>
    <footer id="main-footer">
        <p>Copyright &copy; 2018 , Harsh Technologies</p>
    </footer>
</body>

</html>

Comments

Post a Comment

Popular posts from this blog

Height of the Tree.

  Below is the source code of checking the height of the binary tree. If you need any explanation then please feel free to contact me on my email i.e harshprasadaju@gmail.com. Thankyou. #include   <stdio.h> #include   <stdlib.h> struct   tree {      int   data ;      struct   tree   * left ;      struct   tree   * right ; }; struct   tree   * Createnode ( int   data ) {      struct   tree   * nd   =  ( struct   tree   * ) malloc ( sizeof ( struct   tree ));      nd -> left   =   NULL ;      nd -> right   =   NULL ;      nd -> data   =   data ;      return   nd ; } void   inOrderTraversal ( struct   tree   * root ) {      if  ( root   != ...
Read more

Insert and delete item in a BST

  #include   <stdio.h> #include   <stdlib.h> struct   tree {      int   data ;      struct   tree   * left ;      struct   tree   * right ; }; int   arr [ 9 ],  i   =   0 ; struct   tree   * Createnode ( int   data ) {      struct   tree   * nd   =  ( struct   tree   * ) malloc ( sizeof ( struct   tree ));      nd -> left   =   NULL ;      nd -> right   =   NULL ;      nd -> data   =   data ;      return   nd ; } void   inOrderTraversal ( struct   tree   * root ) {      if  ( root   !=   NULL )     {          inOrderTraversal ( root -> left );  ...
Read more

Multiple parenthesis balancing problem using stacks

  Below is the source code of parenthesis balancing problem using stacks. If you need any explanation then please feel free to contact me on my email i.e harshprasadaju@gmail.com. Thankyou. #include   <stdio.h> //Ignore spellings error #include   <stdlib.h> #include   <string.h> struct   stack {      int   top ;      int   size ;      char   * arr ; }; int   isEmpty ( struct   stack   * ptr ) {      if  ( ptr -> top   ==   - 1 )          return   1 ;      return   0 ; } struct   stack   * createStack ( int   size ) {      struct   stack   * s   =  ( struct   stack   * ) malloc ( sizeof ( struct   stack ));      s -> size   =   size ;   ...
Read more