How to add music or video to web page

By -

Adding music/video to Web Page
 
Music / video can be added to a web page by simply using <embed> html tag. This tag indicates the browser   to include controls for the multimedia which automatically provides browser supports as soon as   <embed> tag is encountered .

Some of the attributes which can be used with <embed> tag are as follows:


Attribute Name
Function
align
Determines how to align the object. It can be set to either center, left or right.
autostart
This boolean attribute indicates if the media should start automatically. You can set it either true or false.
loop
Specifies if the sound should be played continuously (set loop to true), a certain number of times (a positive value) or not at all (false)
playcount
Specifies the number of times to play the sound. This is alternate option for loop if you are using IE.
hidden
Specifies if the multimedia object should be shown on the page. A false value means no and true values means yes.
Width
Width of the object (in pixels)
height
Height of the object (in pixels)
name
A name used to reference the object.
volume
Controls the volume.  Can be from 0 (off) to 100 (full volume).
src
URL of the object to be embedded


This is a simple program to illustrate the use of <embed > tag for adding music to a web page.

Code :



<!doctype html>

<html>

<head>

<title>Adding Music</title>

</head>

<body bgcolor="blue" align="center">

<center><H1><acronym> <u>Using embed Tag</u></acronym></H1></center>

<br />

<h2><center>This is a simple example to explain the use of embed tag in html.

<br />This tag helps to add media to a web page.</h2>

<br /></center>

<br />

<embed src="F:\MUSIC\ABCD 2\04 - ABCD2 - Happy Birthday [Songspk.LINK].mp3"  align="center"

autostart="true" loop="2" hidden="false" width="1000" height="400" volume="60">

</embed>

</body>

</html>


Output :



Comments

Post a Comment

Popular posts from this blog

Non Restoring Division Algorithm Implementation in C

By Sidharth Patnaik -
Image
This  is a Dynamic program for the implementation of the NON RESTORING Division Algorithm in C Language. Non Restoring Division uses Left Shift Operations, Twos' Compliment and Binary Addition. Screenshots[Demo] The Code #include<stdio.h> #include<malloc.h> int *a,*q,*m,*mc,*c,n,d; int powr(int x,int y) { int s=1,i; for(i=0;i<y;i++) s=s*x; return s; } void print(int arr[],int n) { int i; for(i=0;i<n;i++) printf("%d ",arr[i]); } void bin(int n, int arr[]){ int r, i = 0; do{ r = n % 2; n /= 2; arr[i] = r; i++; }while(n > 0); } void set(int array[], int x){ int i,tmp[20]={0}; for(i = x -1; i >=0; i--) tmp[x-1-i]=array[i]; for(i=0;i<x;i++) array[i]=tmp[i]; } int len(int x) { int i=0; while(powr(2,i)<=x) i++; return ++i; } void addBinary(int a1[], int a2[]) { int bi[2]={0},ca[20]={0}; int t=len(n),tmp=0; int *su=(int*)malloc(sizeof(int)*len(n)); while(t...
Read more

Hackerrank Modified Kaprekar Numbers Solution

By Sidharth Patnaik -
Image
This is the solution to the Modified Kaprekar Numbers found in the implementation section of the algorithm domain in Hackerrank. A modified Kaprekar number is a positive whole number n with d digits, such that when we split its square into two pieces - a right hand piece r with d digits and a left hand piece l that contains the remaining d or d−1 digits, the sum of the pieces is equal to the original number (i.e. l + r = n) . Screenshot The Code def sendKap(x,s): y=x*x y=str(y) s1=y[:len(y)/2:] s2=y[len(y)/2::] s3=int(s1)+int(s2) if(s3==x): s.append(str(x)) st=input() en=input() s=[] for i in range(st,en+1): if(i>9): sendKap(i,s) elif(i==1): s.append(str(i)) elif(i==9): s.append(str(i)) if(len(s)==0): print 'INVALID RANGE' else: print ' '.join(s) Got any problems feel free to comment them here !
Read more

Bit Stuffing Code Implementation in Java

By -
Image
This is an implementation of the Bit Stuffing popularly used in data communication, also known as one of the concepts of Framing data bits. To know more please  click here. Sample Output: This is a sample output with data binary data entered as 11001111110. Program Code: import java.util.*; public class BitStuffing { public static void main(String[] args) { System.out.print("Enter the Binary message: "); Scanner sn=new Scanner(System.in); String data = sn.nextLine(); String res = new String(); String out=new String(); int counter = 0; for(int i=0;i<data.length();i++) { if (data.charAt(i)!='1' && data.charAt(i)!='0') { System.out.println("Enter only Binary values!!!"); return; } ...
Read more