PAITHALMALA TOURIST SITE

Paithalmala (Pi-thal-ma-la) is an enchanting hill station in North Kerala (India) in the Western Ghats near Kerala-Karnataka border. Standing as tall as about 4,500 feet (1372metres) above sea level, the summit is located about 65 kms north-east of Kannur (Canannore) city and 35 kms east of Thaliparamba. North of Paithalmala is the Kudaku forest.
AT A GLANCE

These huge mountains lay spread over 500 acres of land enriched with dense forest. The easiest access to the summit is from a place called Kappimala. One can go by bus up to Kappimala (kaappi-mala) and then a bumpy jeep ride of two kilometers through the “muttatham-vayal” mountain till the forest border at “Manja-pullu”. A two (2) km trekking through the forest will then take you to the summit.

mountains seen from Kappimala - on the way to Paithalmala

The peak offers a spectacular view of the surrounding mountains beneath it. It is also a haven for a wide variety of rare flora and fauna. There are many seasonal waterfalls and brooks in the nearby areas. Paithalmala is an ideal spot for adventure tourism as well. There are not many such fascinating hill stations in the region. It is believed that the name ‘Paithal’ (meaning an infant) has connection with the ‘Paithalkon’ dynasty of Malabar.

Tourism development in Paithalmala is being taken up as a major scheme by Government of Kerala. The works include a suspension bridge for watching the seasonal waterfall, renovation of the watch tower, facilities for camping, trekking path and road widening. At the base of the mountain at Kudiyanmala, a tourist information center and dormitory have been constructed. The tourism development at Paithalmala is estimated at about 27 million Indian rupees.

APPLETS IN JAVA

 

By using Java language we can create user interfaces easily compared with C.We can write applications for different purposes and send them in the Internet.Java applet programs are Java programs encapsulated in HTML.We can create applet programs using different  classes provided by the  language itself.For  example, we can create applets for setting fond colour,fond size and type,background colour etc.

The applet programs can’t directly interact with the operating system.The applets can be sent through networks.So there may may be hidden viruses within the applet.So if it is allowed to contact with the operating system it may cause destruction of the operating system itself.So they are encapsulated within HTML codes.

We can run applet programs by using the HTML tag

<APPLET CODE=”file_name.class” HEIGHT=100 WIDTH=100></APPLET>

First write the Java program and compile it.If the compilation is success  a “.class” file is created.Then write the HTML code and include the class file in the applet tag.Set the height and width of the required applet.Save the HTML file in the same name as that of the Java program in the same directory with an extension of  “.html or htm”.After that  open  the  HTML file  in  a  web browser like  Internet Explorer.

Now we can view the applet.

BINARY SEARCH IN C-RECURSIVE AND NON-RECURSIVE PROCEDURE

#include<stdio.h>
#define N 5
int nbinsearch(int a[],int);
int rbinsearch(int a[],int, int,int);
main()
{
int a[10];
int i,j,s,temp,ch,l,h;
printf(“enter the elements\n”);
for(i=0;i<N;i++)
scanf(“%d”,&a[i]);
printf(“the sorted array is:\n”);
for(i=0;i<N;i++)
{
for(j=i+1;j<=N;j++)
{
if(a[i]>a[j])
{
temp=a[i];
a[i]=a[j];
a[j]=temp;
}
}
}
for(i=0;i<N;i++)
printf(“%d\t”,a[i]);

do
{
printf(“\nmenu\n1.nbinsearch\n2.rbinsearch\n3.exit\n”);
printf(“enter the choice\n”);
scanf(“%d”,&ch);
switch(ch)
{
case 1:printf(“enter the element to be searched\n”);
scanf(“%d”,&s);
nbinsearch(a,s);
break;
case 2:printf(“enter the element to be searched\n”);
scanf(“%d”,&s);
l=0;
h=N-1;
rbinsearch(a,l,h,s);
break;
case 3:break;
}
}while(ch!=3);
}
int nbinsearch(int b[N],int s)
{
int i,j,mid,low=0,high=N-1;

while(low<=high)
{
mid=(low+high)/2;
if(s==b[mid])
{
printf(“search successful\n”);
return(-1);
}
else

if(s<b[mid])
high=(mid-1);
else
if(s>b[mid])
low=mid+1;

}
printf(“not found\n”);
return -1;
}
int rbinsearch(int b[N],int low,int high,int s)
{
int mid;
if(low>high)
printf(“element not found\n”);
else
{
mid=(low+high)/2;
if(s==b[mid])
printf(“search successful\n”);
if(s>b[mid])
rbinsearch(b,mid+1,high,s);
if(s<b[mid])
rbinsearch(b,low,mid-1,s);
}
}

IMPLEMENTATION OF QUEUE USING ARRAY IN C

#include<stdio.h>
#define MAX 4
int front=-1,rear=-1;
int q[MAX];
void enqueue();
void dequeue();
int diplay();
main()
{
int ch;
do
{
printf(“\nmenu\n1.enqueue\n2.dequeue\n3.display\n4.exit\n”);
printf(“entr th choice\n”);
scanf(“%d”,&ch);
switch(ch)
{
case 1:enqueue();
break;
case 2:dequeue();
break;
case 3:display();
break;
case 4:break;
}
}while(ch!=4);
}
void enqueue()
{
int n;
if(rear>=MAX-1)
{
printf(“the queue is full\n”);

}
else
{
printf(“enter the number\n”);
scanf(“%d”,&n);
rear+=1;
q[rear]=n;
}
}
void dequeue()
{
if(front==rear)
printf(“the queue is empty\n”);
else
{
front+=1;
}
}
int display()
{
int i;
for(i=front+1;i<=rear;i++)
printf(“\t%d”,q[i]);
}

IMPLEMENTATION OF STACK USING LINKED LIST IN C

#include<stdio.h>
#include<malloc.h>
struct stack
{
int n;
struct stack *next;
}*top=NULL;
typedef struct stack st;
void push();
int pop();
int diplay();
main()
{
int ch;
do
{
printf(“\nmenu\n1.push\n2.pop\n3.display\n4.exit\n”);
printf(“entr th choice\n”);
scanf(“%d”,&ch);
switch(ch)
{
case 1:push();
break;
case 2:pop();
break;
case 3:display();
break;
case 4:break;
}
}while(ch!=4);
}
void push()
{
st *p;
p=(st*)malloc(sizeof(p));
printf(“enter the number\n”);
scanf(“%d”,&p->n);
p->next=top;
top=p;
}
int pop()
{
st *p;
p=top;
if(top==NULL)
{
printf(“stack is empty\n”);
}
else
{
top=top->next;
free(p);
}
return(p->n);
}
int display()
{
st *p;
p=top;
while(p->next!=NULL)
{
printf(“\t%d”,p->n);
p=p->next;
}
printf(“\t%d”,p->n);
}