Student ID in HTML

PROGRAM FOR CREATING ID CARD USING HTML
<html>
<head><title>Student Id</title></head>
<body>
<center>
<table border=1 height=100% width=20%>
<tr height="20">
<td colspan=3><img src="img.png" height="20%"  width="100%"></img></td>
</tr>
<tr>
<th colspan=3><center><font size="2px">------RAWATPUR(NEAR IIIT),PRAYAGRAJ------</font></center></th>
</tr>

<tr>
<td>welcome</td>
<td rowspan=3><img src="img.png"></img></td>
<td>welcome</td>
</tr>
<tr>
<th bgcolor="red">B</th>
<td></td>
</tr>
<tr>
<td>welcome</td>
<td>welcome</td>
</tr>
<tr><th colspan="3"> Student ID : UU211510016</th></tr>
<tr><th colspan="3"> Student name : DHIRUBHAI TRIPATHI</th></tr>
<tr><th colspan="3"> S/D/o: Mr.Ram Manohar</th></tr>
<tr><th colspan="3"> DOB : 01-08-1978 </th></tr>
<tr><th colspan="3"> Course : B.Tech in CS</th></tr>
</table>
</center>
</body>
</html>

OUTPUT

Student Id
------RAWATPUR(NEAR IIIT),PRAYAGRAJ------
welcome welcome
B
welcome welcome
Student ID : UU211510016
Student name : DHIRUBHAI TRIPATHI
S/D/o: Mr.Ram Manohar
DOB : 01-08-1978
Course : B.Tech in CS

Comments

Post a Comment

Popular posts from this blog

Implementation of Binary Search Tree using C Programming Language

#include <stdio.h> #include <conio.h> #include <alloc.h> struct node {     int data ;     struct node * left ;     struct node * right ;     }* root = NULL ; void bstinsert ( int d , struct node * r ){     struct node * temp ;     if ( r == NULL ){         temp =( struct node * ) malloc ( sizeof (struct node ));         temp -> data = d ;         temp -> left = NULL ;         temp -> right = NULL ;         root = temp ;         }     else if ( d < r -> data ){         if ( r -> left == NULL ){             struct node * temp =( struct node * ) malloc ( sizeof (struct node ));             temp -> data = d ;             temp -> left = NUL...
Read more