t3pedia

Timer using Visual C++

noreply@blogger.com (Anonymous) — Fri, 14 Sep 2012 16:22:00 +0000

/*************Header File****************************/

#include<afxwin.h>

class CMyWnd : public CFrameWnd        // My Window class

public:

CMyWnd();

afx_msg void OnTimer(UINT ID);

DECLARE_MESSAGE_MAP()

};

class CMyApp: public CWinApp          // Application window class

public :

BOOL InitInstance();    // initinstace function with Boolian return type

};

/***************Source File**************************/

#include "header.h"        // Include header file

#include <time.h>

CMyWnd :: CMyWnd()

Create(NULL,"MyWindow");    // Use of Constructer

afx_msg void CMyWnd::OnTimer(UINT ID)

    char s[15];

    CClientDC dc (this);

    CTime t=CTime::GetCurrentTime();

    struct tm *ntime;

    ntime=t.GetLocalTm();

    wsprintf(s,asctime(ntime));

    //AfxMessageBox(s);

    dc.TextOut(250,250,s,strlen(s)-1);

BOOL CMyApp :: InitInstance()

CMyWnd *c=new CMyWnd();

m_pMainWnd=c;

m_pMainWnd->ShowWindow(SW_SHOW);

m_pMainWnd->SetTimer(10,1000,NULL);

//MessageBox(m_pMainWnd,"hI","hOW R U",1);  //use of message box

return true;

BEGIN_MESSAGE_MAP(CMyWnd,CFrameWnd)

ON_WM_TIMER()

END_MESSAGE_MAP()

CMyApp app;

[C CODE] Process scheduling techniques

noreply@blogger.com (Anonymous) — Fri, 14 Sep 2012 15:47:00 +0000

#include<stdio.h>

#include<stdlib.h>

#include<graphics.h>

#include<conio.h>

struct process

    int pn,at,pt,tt,wt;

}p[20],tem[20],*q[20];

int i,j,k,choice,np,c=0;

int last=-1;

int processq[50],z;

char procg[50],z1;

void qinsert(struct process *a)

    last=last+1;

    q[last]=a;

void qdelete(void)

    int l;

    processq[z]=(*q[0]).pn;

    z++;

    for(l=0;l<last;l++)

    q[l]=q[l+1];

    last--;

    if(last<-1)

    printf("error");

void result(void)

    float ttt=0,twt=0;

    printf(" \n\n");

      /*    printf("\t process\tarrival\t  burst     \twating\t  turn around\n");

    printf("\t        \ttime   \t  time      \ttime \t  time      \n\n ");

    for(i=0;i<np;i++)

        printf("\t %d) p%d\t\t%d\t  %d\t       \t%d\t  %d\n",i+1,p[i].pn,p[i].at,p[i].pt,p[i].wt,p[i].tt);

    }  */

    for(i=0;i<np;i++)

        ttt=ttt+p[i].tt;

        twt=twt+p[i].wt;

    printf("\n\n\taverage waiting   time    is : %f",twt/np);

    printf("\n\taverage turn around  time is : %f",ttt/np);

void qset(void)

    struct process temp;

    for(k=0;k<np;k++)

        tem[k]=p[k];

    for(i=0;i<np;i++)

        for(j=i;j<np;j++)

            if(tem[i].at>tem[j].at)

                temp=tem[j];

                tem[j]=tem[i];

                tem[i]=temp;

void fcfs(void)

    struct process temp;

    int c=0;

    char fcfsg[30],tempg[30];

    int gdriver = DETECT, gmode, errorcode;

   int left, top, right, bottom;

   int a=0,i,midx,midy,tq1,j;

   initgraph(&gdriver, &gmode, "d:\\tc\\bgi");

   errorcode = graphresult();

   qset();

 for(i=0;i<np;i++)

    tem[i].wt=c-tem[i].at;

    if(tem[i].wt<0)

           c=tem[i].at;

           tem[i].wt=0 ;

    tem[i].tt=tem[i].wt+tem[i].pt;

    c=c+tem[i].pt;

 for(i=0;i<np;i++)

 for(j=0;j<np;j++)

 if(p[i].pn==tem[j].pn)

      p[i]=tem[j];

 result();

 if (errorcode != grOk)  /* an error occurred */

      printf("Graphics error: %s\n", grapherrormsg(errorcode));

      printf("Press any key to halt:");

      getch();

      exit(1);

   for(i=0;i<c;i++)

   left = getmaxx()/2 +a - 8;

   top = getmaxy() /2 - 10;

   right = getmaxx()/2 +a + 8;

   bottom = getmaxy() / 2 + 10;

  rectangle(left,top,right,bottom);

   a+=16;

   j=0;

     i=0;

   fcfsg[0]=0;

   for(i=0;i<c;i++)

    if(tem[j].at>i)

        strcat(fcfsg,"  ");

    else

    itoa(tem[j].pn, tempg, 10);

    for(tq1=tem[j].pt;tq1>0;tq1--)

    strcat(fcfsg,tempg);

    strcat(fcfsg," ");

    i=i+tem[j].pt;

    j++;

   midx = getmaxx() / 2;

   midy = getmaxy() / 2;

  outtextxy(midx, midy, fcfsg);

void rr(void)

    int s,x,tq,pt=0;

    char tempg[10];

    int gdriver = DETECT, gmode, errorcode;

   int left, top, right, bottom;

   int a=0,i,midx,midy,tq1;

   /* initialize graphics and local variables */

   initgraph(&gdriver, &gmode, "d:\\tc\\bgi");

   /* read result of initialization */

   errorcode = graphresult();

    printf("\n\tEnter the size of timequantom :");

    scanf("%d",&tq);

    qset();

    if(np==1)

        p[0].tt=p[0].pt;

        p[0].wt=0;

        z=1;

        processq[0]=1;

    else

    while(1)

        s=np;

        for(i=0;i<np;i++)

            if(tem[i].pt==0){s--;}

        if(s==0)

            break ;

        for(i=pt;i<np;i++)

            if(tem[i].at<=c)

              qinsert(&tem[i]);

              pt=i+1;

        if(last>=0)

            if((*q[0]).pt<=tq)

                c=c+(*q[0]).pt;

                (*q[0]).pt=0;

                (*q[0]).tt=c-(*q[0]).at;

                qdelete();

            else

                c=c+tq;

                (*q[0]).pt-=tq;

                for(i=pt;i<np;i++)

                    if(tem[i].at<=c)

                        qinsert(&tem[i]);

                        pt=i+1;

                qinsert(q[0]);

                qdelete();

        else

            c=c+tq;

            processq[z]=-99;

            z++;

    for(i=0;i<np;i++)

        for(j=0;j<np;j++)

            if(p[i].pn==tem[j].pn)

               p[i].tt=tem[j].tt;

               p[i].wt=p[i].tt-p[i].pt;

    result();

    printf("\n\nGantt chart:-\n\n");

   if (errorcode != grOk)

      printf("Graphics error: %s\n", grapherrormsg(errorcode));

      printf("Press any key to halt:");

      getch();

      exit(1); /* terminate with an error code */

   for(i=0;i<z*tq;i++)

   left = getmaxx()/2 +a - 8;

   top = getmaxy() /2 - 10;

   right = getmaxx()/2 +a + 8;

   bottom = getmaxy() / 2 + 10;

      /* draw a rectangle */

   rectangle(left,top,right,bottom);

   a+=16;

   processq[z]='\0';

   i=0;

   while(processq[i]!='\0')

    if(processq[i]==-99)

        for(tq1=tq;tq1>0;tq1--)

            strcat(procg,"  ");

    else

    itoa(processq[i], tempg, 10);

    for(tq1=tq;tq1>0;tq1--)

    strcat(procg,tempg);

    strcat(procg," ");

    i++;

   midx = getmaxx() / 2;

   midy = getmaxy() / 2;

   /* output text at the center of the screen */

/* Note: the C.P. doesn't get changed.     */

   outtextxy(midx, midy, procg);

   /* clean up */

   /*    for(i=0;i<z;i++)

       if(processq[i]>0)

        printf("p%d ->",processq[i]);

       else

        printf("_ ->");

    } */

void main()

    int ch;

    clrscr();

    printf("\n\n\t Enter no of processes   : ");

    scanf("%d",&np);

    printf("\n Enter Data for processes : " );

    for(i=0;i<np;i++)

        printf("\n\n PROCESS (%d) :\n\n arrival time : ",i+1);

        scanf("%d",&p[i].at);

        printf("\n cpu burst time : ");

        scanf("%d",&p[i].pt);

        p[i].pn=i+1;

       //    clrscr();

    printf("\t process\tarrival time\tprocess time\n\n");

    for(i=0;i<np;i++)

        printf("\t %d) p%d     \t  %02d        \t  %02d\n",i+1,p[i].pn,p[i].at,p[i].pt);

    printf("Select a method :\n");

    printf("\n1. FCFS");

    printf("\n2. Round Robin");

    printf("\n\nEnter your choice : ");

    scanf("%d",&ch);

    if(ch==1)

    fcfs();

    else if(ch==2)

    rr();

    else

    printf("Invalid..");

    getch();

[C CODE] Memory management techniques

noreply@blogger.com (Anonymous) — Fri, 14 Sep 2012 15:44:00 +0000

#include<stdio.h>

#include<conio.h>

#include<process.h>

#include<alloc.h>

struct process

    int size;

    int hole;

}*p;

int *h,*tmp,hn,pn,i,j,k,rem,lh,sh;

//rem=0;

void input()

    clrscr();

    printf("Enter no of holes  :  ");

    fflush(stdin);

    scanf("%d",&hn);

    h=(int *)malloc(sizeof(int)*hn);

    for(i=0;i<hn;i++)

        printf("size of hole %d  :  ",i+1);

        fflush(stdin);

        scanf("%d",&h[i]);

        tmp[i]=h[i];

    printf("Enter no of processes  :  ");

    fflush(stdin);

    scanf("%d",&pn);

    p=(struct process *)malloc(sizeof(struct process)*pn);

    for(i=0;i<pn;i++)

        printf("size of process %d  :  ",i+1);

        fflush(stdin);

        scanf("%d",&p[i].size);

        p[i].hole=0;

void ff()

    tmp=(int *)malloc(sizeof(int)*hn);

    for(i=0;i<hn;i++)

        tmp[i]=h[i];

    for(i=0;i<pn;i++)

        for(j=0;j<hn;j++)

            if(p[i].size<=tmp[j])

                tmp[j]-=p[i].size;

                p[i].hole=j+1;

                break;

    rem=0;

    lh=tmp[0];

    sh=tmp[0];

    for(i=0;i<hn;i++)

        rem+=tmp[i];

        if(tmp[i]<sh)

            sh=tmp[i];

        if(tmp[i]>lh)

            lh=tmp[i];

void nf()

    int t=0;

    tmp=(int *)malloc(sizeof(int)*hn);

    for(i=0;i<hn;i++)

        tmp[i]=h[i];

    for(i=0;i<pn;i++)

        for(j=t;j<hn;j++)

            if(p[i].size<=tmp[j])

                tmp[j]-=p[i].size;

                p[i].hole=j+1;

                t=j;

                break;

    rem=0;

    lh=tmp[0];

    sh=tmp[0];

    for(i=0;i<hn;i++)

        rem+=tmp[i];

        if(tmp[i]<sh)

            sh=tmp[i];

        if(tmp[i]>lh)

            lh=tmp[i];

void bf()

    int *diff,t1,t2,flag=0;

    diff=(int *)malloc(sizeof(int)*hn);

    tmp=(int *)malloc(sizeof(int)*hn);

    for(i=0;i<hn;i++)

        tmp[i]=h[i];

    for(i=0;i<pn;i++)

        flag=0;

        for(j=0;j<hn;j++)

            diff[j]=tmp[j]-p[i].size;

        for(j=0;j<hn;j++)

            if(diff[j]>=0)

                t1=diff[j];

                t2=j;

                flag++;

                break;

        for(j=0;j<hn;j++)

            if(diff[j]>=0 && diff[j]<t1)

                t1=diff[j];

                t2=j;

                flag++;

        if(flag)

            tmp[t2]-=p[i].size;

            p[i].hole=t2+1;

    rem=0;

    lh=tmp[0];

    sh=tmp[0];

    for(i=0;i<hn;i++)

        rem+=tmp[i];

        if(tmp[i]<sh)

            sh=tmp[i];

        if(tmp[i]>lh)

            lh=tmp[i];

void wf()

    int *diff,t1,t2,flag=0;

    diff=(int *)malloc(sizeof(int)*hn);

    tmp=(int *)malloc(sizeof(int)*hn);

    for(i=0;i<hn;i++)

        tmp[i]=h[i];

    for(i=0;i<pn;i++)

        flag=0;

        for(j=0;j<hn;j++)

            diff[j]=tmp[j]-p[i].size;

        for(j=0;j<hn;j++)

            if(diff[j]>=0)

                t1=diff[j];

                t2=j;

                flag++;

                break;

        for(j=0;j<hn;j++)

            if(diff[j]>=0 && diff[j]>t1)

                t1=diff[j];

                t2=j;

                flag++;

        if(flag)

            tmp[t2]-=p[i].size;

            p[i].hole=t2+1;

    rem=0;

    lh=tmp[0];

    sh=tmp[0];

    for(i=0;i<hn;i++)

        rem+=tmp[i];

        if(tmp[i]<sh)

            sh=tmp[i];

        if(tmp[i]>lh)

            lh=tmp[i];

void result()

       //    clrscr();

    printf("Process\tHole");

    for(i=0;i<pn;i++)

        if(p[i].hole>0)

        printf("\n%d\t%d",i+1,p[i].hole);

        else

        printf("\n%d\tcant fit",i+1);

    printf("\n\nHole status ");

    printf("\n\nHole no\tHole size\n");

    for(i=0;i<hn;i++)

        printf("\n%d\t%d",i+1,tmp[i]);

    printf("\n\nRemaining hole    -->  %d",rem);

    printf("\nSmallest hole     -->  %d",sh);

    printf("\nLargest hole      -->  %d",lh);

void main()

    int ch;

    input();

st:    printf("\ndifferent schemes ");

    printf("\n1. First fit\n2. Next fit\n3. Best fit\n4. Worst fit\n5. exit");

    printf("\n\nEnter your choice  :  ");

    fflush(stdin);

    scanf("%d",&ch);

    switch(ch)

        case 1: ff();

            break;

        case 2: nf();

            break;

        case 3: bf();

            break;

        case 4: wf();

            break;

        case 5: exit(1);

            break;

        default:printf("\ninvalid choice ..");

            printf("\npress any key to continue ....");

            getch();

            goto st;

    result();

    printf("\npress any key to continue ....");

    getch();

    goto st;

[shell script]Directory operations example

noreply@blogger.com (Anonymous) — Fri, 14 Sep 2012 15:42:00 +0000

 enter your choice

echo " 1. List of files & directories with permissions "

echo " 2. Create directory "

echo " 3. Remove directory "

echo " 4. Rename directory "

echo " 5. Go to directory "

echo " 6. Go out of directory "

read choice

case "$choice" in

        1)ls -l;;

        2) echo "Enter the name :"

           read name

           if [ -d $name ]

           then

           echo "directory is exist"

           else

           mkdir $name

           echo "directory '$name' has been created"

          fi;;

        3) echo " Enter The Name :"

           read name

         if [ -d $name ]

         then

         rm -r $name

        echo " the directory '$name' has been removed "

          else

          echo "the directory is not exist"

          fi;;

        4) echo "Enter Name :"

          read name

          if [ -d $name ]

          then

          echo "enter new name :"

          read nm

          mv $name $nm

          echo "direcory renamed from $name to $nm "

          else

          echo " directory $name is not exist"

          fi;;

        5) echo " enter name :"

           read name

            if [ -d $name ]

            then

            cd $name

pwd

            else

            echo "the directory is not exist "

            fi;;

         6) cd ..

pwd

;;

  esac

DBMS using shell script

noreply@blogger.com (Anonymous) — Fri, 14 Sep 2012 15:36:00 +0000

if [ ! -f dbms ]

then

touch dbms

fi

while [ 1 ]

do

echo " "

echo " "

echo " "

echo " The database management system operations :  "

echo " 1.For inserting data into the file "

echo " 2.View all record of file "

echo " 3.For searching the data from the file "

echo " 4.For sorting the data of file "

echo " 5.For modifying the data into the file "

echo " 6.For Delete the record "

echo " 7.For Exit "

echo " Enter your choice : "

read choice

clear

case $choice in

        1)echo " Enter the data you want to enter in the file "

          echo " Enter the roll no "

          read rno

          echo " Enter the name "

          read name

          echo " Enter the branch "

          read branch

          similar=`grep -c "$rno" dbms`

          if [ $similar -eq 1 ]

          then

          echo " The entered roll no. violates the primary key constraint on roll no "

          else

          echo " $rno|$name|$branch " | cat >> dbms

          echo " The data has been added "

fi

;;

        2)echo " The content of file is:"

          cat dbms

;;

        3)echo " Enter the word you want to search from the file "

          read word

          search=` grep -c -i "$word" dbms `

          if [ $search -eq 0 ]

          then

          echo " no such roll no. exist in the file "

          else

          grep -i "$word" dbms

fi

;;

        4)echo " Enter the technic by which you want to sort "

          echo " 1.Sort by rno. "

          echo " 2.Sort by name "

          echo " 3.Sort by branch "

          read choice

          sort -t "|" -k $choice dbms

;;

        5)echo " Enter The Roll No which wii be modified : "

          read rno

          search=` grep -c -i "$word" dbms `

          if [ $search -eq 0 ]

          then

          echo " no such roll no. exist in the file "

          else

          grep -v "$rno" dbms > temp

          mv temp dbms

          echo " Enter the roll no "

          read rno

          echo " Enter the name "

          read name

          echo " Enter the branch "

          read branch

          similar=`grep -c "$rno" dbms`

          if [ $similar -eq 1 ]

          then

          echo " The entered roll no. violates the primary key constraint on roll no "

          else

          echo " $rno|$name|$branch " | cat >> dbms

          echo " The data has been modified "

fi

fi

;;

        6)echo " Enter The Roll No which wii be deleted : "

          read rno

          search=` grep -c -i "$word" dbms `

          if [ $search -eq 0 ]

          then

          echo " no such roll no. exist in the file "

          else

          grep -v "$rno" dbms > temp

          mv temp dbms

          echo " The data has been deleted "

fi

;;

        7)exit;

;;

        *)echo " Invalid entry"

;;

esac

done

shell script to find prime number

noreply@blogger.com (Anonymous) — Fri, 14 Sep 2012 15:35:00 +0000

echo "Enter the limit : "

read no

i=2

while [ $i -le $no ]

do

j=1

flag=0

while [ $j -le $i ]

do

 m=`expr $i % $j`

 if [ $m -eq 0 ]

 then

 flag=`expr $flag + 1`

if [ $flag -gt 2 ]

then

break

fi

fi

 j=`expr $j + 1`

done

 if [ $flag -eq 2 ]

 then

 echo $i

fi

i=`expr $i + 1`

done

Head-Tail command example [shell script]

noreply@blogger.com (Anonymous) — Fri, 14 Sep 2012 15:34:00 +0000

if [ $# -ne 2 ]

then

echo " invalid argument "

exit

fi

if [ ! -e $1 ]

then

echo "invalid file name "

exit

fi

echo " 1. head "

echo " 2. tail "

read ch

case "$ch" in

1)exec < $1

i=1

while [ $i -le $2 ]

do

read l

echo $l

i=`expr $i + 1`

done ;;

2)exec < $1

i=1

while read l

do

i=`expr $i + 1`

done

j=`expr $i - $2`

k=1

exec < $1

while [ $k -lt $j ]

do

read l

k=`expr $k + 1`

done

while read l

do

echo $l

done ;;

*) echo "invalid choice" ;;

esac

Fibonacci series using shell script

noreply@blogger.com (Anonymous) — Fri, 14 Sep 2012 15:33:00 +0000

echo Enter the number

read n

i=0

b=1

a=0

echo " The fibonaci series is :"

while [ $i -lt $n ]

do

   echo $b

   b=`expr $a + $b`

   a=`expr $b - $a`

   i=`expr $i + 1`

done

date command shell script

noreply@blogger.com (Anonymous) — Fri, 14 Sep 2012 15:32:00 +0000

if [ `date +%H` -lt 12 ]

then

echo "Good Morning"

elif [ `date +%H` -lt 16 ]

then

echo "Good After Noon"

else

echo "Good evening"

fi

File comparison using shell script

noreply@blogger.com (Anonymous) — Fri, 14 Sep 2012 15:31:00 +0000

if [ $# -ne 2 ]

then

echo " invalid argument "

fi

if [ ! -f $1 ]

then

echo "file $1 is not exist "

fi

if [ ! -f $2 ]

then

echo " file $2 is not exist "

fi

if cmp $1 $2 >> \dev\null

then

echo " The files are same"

tac $1 > $2

rev $2 > $1

rm $2

echo The content of file $1 is :

cat $1

else

echo " The files are not identical "

fi

Simple calculator using shell script

noreply@blogger.com (Anonymous) — Fri, 14 Sep 2012 15:30:00 +0000

echo Enter The Two Numbers

read a

read b

echo enter operation

read op

ans1=`echo scale=2";" $a "$op" $b | bc`

echo the answer is $ans1

[MATLAB] High pass filter using Fourier transformation

noreply@blogger.com (Anonymous) — Thu, 13 Sep 2012 15:20:00 +0000

B=imread('lenna.jpg');

A=double(rgb2gray(B));

subplot(1,2,1);

imshow(A,[]);

title('Original Image');

%imshow(C,[]);

[m n]=size(A);

F=zeros(m,n,'double');

F=A;

C=fft2(A);

D=fftshift(C);

%imshow(uint8(C));

%[th r]=cart2pol(real(C),imag(C));

limit=15;

for u=1:m

    for v=1:n

        D1(u,v)=sqrt(((u-(m/2))^2)+((v-(n/2))^2));

        if D1(u,v)>=limit

            H=1;

        else

            H=0;

end

        I1(u,v)=H*D(u,v);

end

end

% F1=ifft2(I1);

F1=ifftshift(I1);

F2=ifft2(F1);

subplot(1,2,2);

imshow(F2,[]);

title('Ideal LowPass');

%Y=fftshift();

%imshow(uint8(Y));

[MATLAB] Low pass filter using Fourier transformation

noreply@blogger.com (Anonymous) — Thu, 13 Sep 2012 15:00:00 +0000

B=imread('lenna.jpg');

A=double(rgb2gray(B));

subplot(1,2,1);

imshow(A,[]);

title('Original Image');

%imshow(C,[]);

[m n]=size(A);

F=zeros(m,n,'double');

F=A;

C=fft2(A);

D=fftshift(C);

%imshow(uint8(C));

%[th r]=cart2pol(real(C),imag(C));

limit=15;

for u=1:m

    for v=1:n

        D1(u,v)=sqrt(((u-(m/2))^2)+((v-(n/2))^2));

        if D1(u,v)<=limit

            H=1;

        else

            H=0;

end

        I1(u,v)=H*D(u,v);

end

end

% F1=ifft2(I1);

F1=ifftshift(I1);

F2=ifft2(F1);

subplot(1,2,2);

imshow(F2,[]);

title('Ideal LowPass');

%Y=fftshift();

%imshow(uint8(Y));

Leach protocol tcl script NS2 simulation

noreply@blogger.com (Anonymous) — Wed, 12 Sep 2012 19:40:00 +0000

# Copyright (c) 1997 Regents of the University of California.
# All rights reserved.
#
# Redistribution and use in source and binary forms, with or without
# modification, are permitted provided that the following conditions
# are met:
# 1. Redistributions of source code must retain the above copyright
#    notice, this list of conditions and the following disclaimer.
# 2. Redistributions in binary form must reproduce the above copyright
#    notice, this list of conditions and the following disclaimer in the
#    documentation and/or other materials provided with the distribution.
# 3. All advertising materials mentioning features or use of this software
#    must display the following acknowledgement:
#      This product includes software developed by the Computer Systems
#      Engineering Group at Lawrence Berkeley Laboratory.
# 4. Neither the name of the University nor of the Laboratory may be used
#    to endorse or promote products derived from this software without
#    specific prior written permission.
#
# THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
# ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
# IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
# ARE DISCLAIMED.  IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
# FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
# DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
# OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
# HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
# LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
# OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
# SUCH DAMAGE.
#
# $Header: /usr/src/mash/repository/vint/ns-2/tcl/ex/wireless.tcl,v 1.2 1999/02/24 23:27:34 haldar Exp $
#
# Ported from CMU/Monarch's code, nov'98 -Padma.

# ======================================================================
# Default Script Options
# ======================================================================
set opt(chan)  Channel/WirelessChannel
set opt(prop)  Propagation/TwoRayGround
#set opt(netif)  NetIf/SharedMedia
set opt(netif)  Phy/WirelessPhy
#set opt(mac)  Mac/802_11
set opt(mac)  Mac/802_11
set opt(ifq)  Queue/DropTail/PriQueue
set opt(ll)  LL
set opt(ant)            Antenna/OmniAntenna

set opt(x)  0 ;# X dimension of the topography
set opt(y)  0  ;# Y dimension of the topography
#set opt(cp)  "../mobility/scene/cbr-50-20-4-512" ;# connection pattern file
set opt(cp)  ""
set opt(sc)  "../mobility/scene/scen-670x670-50-600-20-2" ;# scenario file

set opt(ifqlen)  50  ;# max packet in ifq
set opt(nn)  51  ;# number of nodes
set opt(seed)  0.0
set opt(stop)  10.0  ;# simulation time
set opt(tr)  out.tr  ;# trace file
set opt(rp)             dsdv            ;# routing protocol script
set opt(lm)             "on"           ;# log movement

# ======================================================================

set AgentTrace   ON
set RouterTrace   ON
set MacTrace   OFF

LL set mindelay_  50us
LL set delay_   25us
LL set bandwidth_  0 ;# not used
LL set off_prune_  0 ;# not used
LL set off_CtrMcast_  0 ;# not used

Agent/Null set sport_  0
Agent/Null set dport_  0

Agent/CBR set sport_  0
Agent/CBR set dport_  0

Agent/TCPSink set sport_ 0
Agent/TCPSink set dport_ 0

Agent/TCP set sport_  0
Agent/TCP set dport_  0
Agent/TCP set packetSize_ 1460

Queue/DropTail/PriQueue set Prefer_Routing_Protocols    1

# unity gain, omni-directional antennas
# set up the antennas to be centered in the node and 1.5 meters above it
Antenna/OmniAntenna set X_ 0
Antenna/OmniAntenna set Y_ 0
Antenna/OmniAntenna set Z_ 1.5
Antenna/OmniAntenna set Gt_ 1.0
Antenna/OmniAntenna set Gr_ 1.0

# Initialize the SharedMedia interface with parameters to make
# it work like the 914MHz Lucent WaveLAN DSSS radio interface
Phy/WirelessPhy set CPThresh_ 10.0
Phy/WirelessPhy set CSThresh_ 1.559e-11
Phy/WirelessPhy set RXThresh_ 3.652e-10
Phy/WirelessPhy set Rb_ 2*1e6
Phy/WirelessPhy set Pt_ 0.2818
Phy/WirelessPhy set freq_ 914e+6 
Phy/WirelessPhy set L_ 1.0

# ======================================================================

proc usage { argv0 }  {
 puts "Usage: $argv0"
 puts "\tmandatory arguments:"
 puts "\t\t\[-x MAXX\] \[-y MAXY\]"
 puts "\toptional arguments:"
 puts "\t\t\[-cp conn pattern\] \[-sc scenario\] \[-nn nodes\]"
 puts "\t\t\[-seed seed\] \[-stop sec\] \[-tr tracefile\]\n"
}


proc getopt {argc argv} {
 global opt
 lappend optlist cp nn seed sc stop tr x y

 for {set i 0} {$i  $argc} {incr i} {
  set arg [lindex $argv $i]
  if {[string range $arg 0 0] != "-"} continue

  set name [string range $arg 1 end]
  set opt($name) [lindex $argv [expr $i+1]]
 }
}


proc cmu-trace { ttype atype node } {
 global ns_ tracefd

 if { $tracefd == "" } {
  return ""
 }
 set T [new CMUTrace/$ttype $atype]
 $T target [$ns_ set nullAgent_]
 $T attach $tracefd
        $T set src_ [$node id]

        $T node $node

 return $T
}


proc create-god { nodes } {
 global ns_ god_ tracefd

 set god_ [new God]
 $god_ num_nodes $nodes
}

proc log-movement {} {
    global logtimer ns_ ns

    set ns $ns_
    source tcl/mobility/timer.tcl
    Class LogTimer -superclass Timer
    LogTimer instproc timeout {} {
 global opt node_;
 for {set i 0} {$i  $opt(nn)} {incr i} {
     $node_($i) log-movement
 }
 $self sched 0.1
    }

    set logtimer [new LogTimer]
    $logtimer sched 0.1
}

# ======================================================================
# Main Program
# ======================================================================
getopt $argc $argv

#
# Source External TCL Scripts
#
source tcl/lib/ns-mobilenode.tcl

#if { $opt(rp) != "" } {
 source tcl/mobility/$opt(rp).tcl
 #} elseif { [catch { set env(NS_PROTO_SCRIPT) } ] == 1 } {
 #puts "\nenvironment variable NS_PROTO_SCRIPT not set!\n"
 #exit
#} else {
 #puts "\n*** using script $env(NS_PROTO_SCRIPT)\n\n";
        #source $env(NS_PROTO_SCRIPT)
#}
source tcl/lib/ns-cmutrace.tcl

# do the get opt again incase the routing protocol file added some more
# options to look for
getopt $argc $argv

if { $opt(x) == 0 || $opt(y) == 0 } {
 usage $argv0
 exit 1
}

if {$opt(seed) > 0} {
 puts "Seeding Random number generator with $opt(seed)\n"
 ns-random $opt(seed)
}

#
# Initialize Global Variables
#
set ns_  [new Simulator]
set chan [new $opt(chan)]
set prop [new $opt(prop)]
set topo [new Topography]
set tracefd [open $opt(tr) w]

$topo load_flatgrid $opt(x) $opt(y)

$prop topography $topo

#
# Create God
#
create-god $opt(nn)


#
# log the mobile nodes movements if desired
#
if { $opt(lm) == "on" } {
    log-movement
}

#
#  Create the specified number of nodes $opt(nn) and "attach" them
#  the channel.
#  Each routing protocol script is expected to have defined a proc
#  create-mobile-node that builds a mobile node and inserts it into the
#  array global $node_($i)
#

if { [string compare $opt(rp) "dsr"] == 0} { 
 for {set i 0} {$i  $opt(nn) } {incr i} {
  dsr-create-mobile-node $i
 }
} elseif { [string compare $opt(rp) "dsdv"] == 0} { 
 for {set i 0} {$i  $opt(nn) } {incr i} {
  dsdv-create-mobile-node $i
 }
} elseif { [string compare $opt(rp) "leach"] == 0} { 
 for {set i 0} {$i  $opt(nn) } {incr i} {
  leach-create-mobile-node $i
 }
} elseif { [string compare $opt(rp) "leach-c"] == 0} { 
 for {set i 0} {$i  $opt(nn) } {incr i} {
  leach-create-mobile-node $i
 }
} elseif { [string compare $opt(rp) "stat-clus"] == 0} { 
 for {set i 0} {$i  $opt(nn) } {incr i} {
  leach-create-mobile-node $i
 }
} elseif { [string compare $opt(rp) "mte"] == 0} { 
 for {set i 0} {$i  $opt(nn) } {incr i} {
  leach-create-mobile-node $i
 }
}


#
# Source the Connection and Movement scripts
#
if { $opt(cp) == "" } {
 puts "*** NOTE: no connection pattern specified."
        set opt(cp) "none"
} else {
 puts "Loading connection pattern..."
 source $opt(cp)
}


#
# Tell all the nodes when the simulation ends
#
for {set i 0} {$i  $opt(nn) } {incr i} {
    $ns_ at $opt(stop).000000001 "$node_($i) reset";
}
$ns_ at $opt(stop).00000001 "puts \"NS EXITING...\" ; $ns_ halt"


if { $opt(sc) == "" } {
 puts "*** NOTE: no scenario file specified."
        set opt(sc) "none"
} else {
 puts "Loading scenario file..."
 source $opt(sc)
 puts "Load complete..."
}

puts $tracefd "M 0.0 nn $opt(nn) x $opt(x) y $opt(y) rp $opt(rp)"
puts $tracefd "M 0.0 sc $opt(sc) cp $opt(cp) seed $opt(seed)"
puts $tracefd "M 0.0 prop $opt(prop) ant $opt(ant)"

puts "Starting Simulation..."
$ns_ run

Technical aptitude paper[Sample]

noreply@blogger.com (Anonymous) — Wed, 12 Sep 2012 19:39:00 +0000

1. If you are using C language to implement the heterogeneous linked list, what pointer type
will you use?

2. Minimum number of queues needed to implement the priority queue?

3. What is the type of the algorithm used in solving the 8 Queens problem?

4. In RDBMS, what is the efficient data structure used in the internal storage representation?

5. What are the two classes of hardware building blocks?

6. Expand IDEA.

7. What is wide-mouth frog?

8. What are the typical elements of a process image?

9. What are the key object oriented concepts used by Windows NT?

10. Which containers use a border Layout as their default layout in JAVA?

11. What method is used to specify a container's layout in JAVA?

12. Which java.util classes and interfaces support event handling in JAVA?

13. What is the immediate superclass of the Applet class?

14. Which class is extended by all other classes?

15. What are the primitive operations common to all record management systems?

16. Name the buffer in which all the commands that are typed in are stored in DBMS?

17. What are the unary operations in Relational Algebra?

18. What are the standard predefined macros?

19. At what mode the fault handler executes in UNIX?

20. Is it possible to execute code even after the program exits the main() function. If yes, name
the function which can do this, if no, go to sleep.. :P ?

Answers:

1. We go for void pointer.

2. Two. One queue is used for actual storing of data and another for storing priorities.

3. Backtracking.

4. B+ tree. Because in B+ tree, all the data is stored only in leaf nodes, that makes searching
easier. This corresponds to the records that shall be stored in leaf nodes.

5. Nodes and Links.

6. IDEA stands for International Data Encryption Algorithm.

7. Wide-mouth frog is the simplest known key distribution center (KDC) authentication
protocol.

8. User data: Modifiable part of user space. May include program data, user stack area, and
programs that may be modified.

User program: The instructions to be executed.

System Stack: Each process has one or more LIFO stacks associated with it. Used to
store parameters and calling addresses for procedure and system calls.

Process control Block (PCB): Info needed by the OS to control processes.

9. Encapsulation, Object class and instance.

10. The Window, Frame and Dialog classes use a border layout as their default layout.

11. The setLayout() method is used to specify a container's layout.

12. The EventObject class and the EventListener interface support event processing.

13. Panel.

14. The Object class is extended by all other classes.

15. Addition, deletion and modification.

16. Edit Buffer.

17. PROJECTION and SELECTION.

18. The ANSI C standard defines six predefined macros for use in the C language:

Macro Name

__LINE__
__FILE__
__DATE__
__TIME__
__STDC__
__cplusplus

19. At the Kernel Mode.

20. The standard C library provides a function named atexit() that can be used to
perform "cleanup" operations when your program terminates. You can set up a set

Purpose

-Inserts the current source code line number in your code.
-Inserts the current source code filename in your code.
-Inserts the current date of compilation in your code.
-Inserts the current time of compilation in your code.
-Is set to 1 if you are enforcing strict ANSI C conformity.
-Is defined if you are compiling a C++ program.

of functions you want to perform automatically when your program exits by passing
function pointers to the atexit() function. Here's an example of a program that uses the
atexit() function:

#include <stdio.h>
#include <stdlib.h>
void close_files(void);
void print_registration_message(void);
int main(int, char**);
int main(int argc, char** argv)
{
...
atexit(print_registration_message);
atexit(close_files);
while (rec_count < max_records)
{
process_one_record();

}
exit(0);

}

This example program uses the atexit() function to signify that the close_files() function
and the print_registration_message() function need to be called automatically when
the program exits. When the main() function ends, these two functions will be called
to close the files and print the registration message. There are two things that should
be noted regarding the atexit() function. First, the functions you specify to execute at
program termination must be declared as void functions that take no parameters. Second,
the functions you designate with the atexit() function are stacked in the order in which
they are called with atexit(), and therefore they are executed in a last-in, first-out (LIFO)
method. Keep this information in mind when using the atexit() function. In the preceding
example, the atexit() function is stacked as shown here:
atexit(print_registration_message);
atexit(close_files);
Because the LIFO method is used, the close_files() function will be called first, and then
the print_registration_message() function will be called.
The atexit() function can come in handy when you want to ensure that certain functions
(such as closing your program's data files) are performed before your program terminates.

Download NCERT Books for free

noreply@blogger.com (Anonymous) — Wed, 12 Sep 2012 19:33:00 +0000

There is a portal which provides you all versions(Hindi,English and Urdu) of NCERT books of all standards and available free for download as PDF.

Link:

http://ncertbooks.prashanthellina.com

[LINUX]Sample code of Makefile

noreply@blogger.com (Anonymous) — Wed, 12 Sep 2012 19:30:00 +0000

all: cal
lex.yy.c: cal1.l y.tab.h
lex -ll cal1.l

lex.yy.o: lex.yy.c
gcc -c lex.yy.c

y.tab.c: cal1.y
yacc -d cal1.y

y.tab.o: y.tab.c
gcc -c y.tab.c

cal: lex.yy.o y.tab.o
gcc -o temp lex.yy.o y.tab.o -ll -ly

y.tab.h: cal1.y
yacc -d cal1.y

[MATLAB] pseudo ternary technique using simulink

noreply@blogger.com (Anonymous) — Wed, 12 Sep 2012 19:19:00 +0000

close all;
clear all;
d=[1,0,1,1,0];
p=-2;
for i=1:length(d)
if i>1
if d(i)==0
p=-p;
a(i)=p;
else
a(i)=0;
end
else
if d(i)==0
p=2;
a(i)=p;
else
a(i)=0;
end
end
hold on;
for j=i:0.01:i+1
plot(j,a(i),'.-r');
end
grid on;
end

[MATLAB] NRZ-L technique using simulink

noreply@blogger.com (Anonymous) — Wed, 12 Sep 2012 19:18:00 +0000

close all;
clear all;
d=[1,0,1,1,0];
for i=1:length(d)
if d(i)==1
a(i)=-2;
else
a(i)=2;
end
hold on;
for j=i:0.01:i+1
plot(j,a(i),'.-r');
end
grid on;
end

[MATLAB] NRZ-I technique using simulink

noreply@blogger.com (Anonymous) — Wed, 12 Sep 2012 19:18:00 +0000

close all;
clear all;
d=[1,0,1,1,0];
for i=1:length(d)
if i>1
if d(i)==1
a(i)=-a(i-1);
else
a(i)=a(i-1);
end
else
if d(i)==1
a(i)=-2;
else
a(i)=2;
end
end
hold on;
for j=i:0.01:i+1
plot(j,a(i),'.-r');
end
grid on;
end

[MATLAB]Manchester technique using simulink

noreply@blogger.com (Anonymous) — Wed, 12 Sep 2012 15:57:00 +0000

close all;
clear all;
d=[1,0,1,1,0];
for i=1:length(d)
if d(i)==1
a(i)=-2;
b(i)=2;
else
a(i)=2;
b(i)=-2;
end
hold on;
for j=i:0.01:i+0.5
plot(j,a(i),'.-r');
end
for j=i+0.5:0.01:i+1
plot(j,b(i),'.-r');
end
grid on;
end

[MATLAB] Differential Manchester technique using simulink

noreply@blogger.com (Anonymous) — Wed, 12 Sep 2012 15:55:00 +0000

close all;
clear all;
d=[1,0,1,1,0];
for i=1:length(d)
if i>1
if d(i)==1
a(i)=b(i-1);
b(i)=a(i-1);
else
a(i)=a(i-1);
b(i)=b(i-1);
end
else
if d(i)==1
a(i)=2;
b(i)=-2;
else
a(i)=-2;
b(i)=2;
end
end
hold on;
for j=i:0.01:i+0.5
plot(j,a(i),'.-r');
end
for j=i+0.5:0.01:i+1
plot(j,b(i),'.-r');
end
grid on;
end

[MATLAB]NRZ technique using simulink

noreply@blogger.com (Anonymous) — Wed, 12 Sep 2012 15:53:00 +0000

close all;
clear all;
d=[1,0,1,1,0];
for i=1:length(d)
if d(i)==1
a(i)=2;
else
a(i)=0;
end
hold on;
for j=i:0.01:i+1
plot(j,a(i),'.-r');
end
grid on;
end

Implementation of circular queue in C/C++

noreply@blogger.com (Anonymous) — Wed, 12 Sep 2012 15:43:00 +0000

#include<stdio.h>

#include<conio.h>

#include<stdlib.h>

#include<iostream.h>

struct node

int info;

struct node* link;

};

struct node *last=0;

void main()

struct node*first=0;

int n;

clrscr();

struct node* add_first(struct node*);

struct node* add_last(struct node*);

struct node* del_first(struct node*);

struct node* del_last(struct node*);

void traverse(struct node*);

cout<<" \n 1.add at first ";

cout<<" \n 2.add at last ";

cout<<" \n 3.delete at first ";

cout<<" \n 4.delete at last ";

cout<<" \n 5.traverse ";

do

cout<<"\n enter your choice ";

cin>>n;

     switch(n)

         case 1:first=add_first(first);

         break;

         case 2:first=add_last(first);

         break;

         case 3:first=del_first(first);

         break;

         case 4:first=del_last(first);

         break;

         case 5:traverse(first);

     break;

         default: cout<<"\n\n invalid entry ";

         exit(0);

}     while(n!=0);

getch();

struct node *add_first(struct node *f)

struct node* nw;

nw=(struct node*)malloc(sizeof(struct node));

cout<<"\n enter the value of node ";

cin>>nw->info;

    if(f==0)

        last=nw;

        nw->link=nw;

        return(nw);

 else

     nw->link=f;

     f=nw;

     last->link=nw;

     return(f);

struct node* add_last(struct node *f)

struct node* nw;

nw=(struct node*)malloc(sizeof(struct node));

cout<<"\n enter the value of node ";

cin>>nw->info;

    if(f==0)

     nw->link=nw;

     last=nw;

     return(nw);

     else

     last->link=nw;

     nw->link=f;

     last=nw;

     return(f);

struct node* del_first(struct node *f)

    if(f==0)

    cout<<"\n list is empty";

    return(f);

    else

    f=f->link;

    last->link=f;

    cout<<"\n node is deleted ";

    return(f);

struct node* del_last(struct node* f)

    if(f==0)

    cout<<" \n link list is empty ";

    return(f);

    else

     struct node* save=f;

        while(save->link!=last)

            save=save->link;

            save->link=f;

            last=save;

            cout<<"\n node is deleted ";

            return(f);

void traverse(struct node* f)

if(f==0)

cout<<"link list is empty ";

else

struct node* save;

cout<<"\n\n";

while(save->link!=f)

cout<<save->info<<"  ";

save=save->link;

cout<<save->info<<"\n\n";

Implementation of DFS in C & C++

noreply@blogger.com (Anonymous) — Wed, 12 Sep 2012 15:40:00 +0000

/*

    DFS TRAVERSAL

    ROLL NO:- 09BCE006

*/

#include<iostream.h>

#include<conio.h>

#include<stdlib.h>

void create();

void dfs();

struct node

     int data,status;

     struct node *next;

     struct link *adj;

}*start,*p,*q;

struct link

     struct node *next;

     struct link *adj;

}*l,*k;

void main()

    clrscr();

    create();

    dfs();

void create()

      int dat,flag=0;

      start=NULL;

      cout<<"Enter the nodes in the graph (0 to end):\n\n";

      while(1)

      cin>>dat;

      if(dat==0)

        break;

      p=new node;

      p->data=dat;

      p->status=0;

      p->next=NULL;

      p->adj=NULL;

      if(flag==0)

        start=p;

        q=p;

        flag++;

      else

         q->next=p;

         q=p;

      p=start;

      while(p!=NULL)

          cout<<"\nEnter the links of "<<p->data<<"(0 to end)\n";

          flag=0;

          while(1)

            cin>>dat;

            if(dat==0)

                break;

            k=new link;

            k->adj=NULL;

            if(flag==0)

                p->adj=k;

                l=k;

                flag++;

            else

                l->adj=k;

                l=k;

            q=start;

            while(q!=NULL)

                if(q->data==dat)

                k->next=q;

                q=q->next;

        p=p->next;

       return;

void dfs()

     int stack[25],top=1;

     cout<<"\nDFS result is\n";

     p=start;

     while(p!=NULL)

      p->status=0;

      p=p->next;

     p=start;

     stack[0]=0;

     stack[top]=p->data;

     p->status=1;

     while(1)

     if(stack[top]==0)

        break;

     p=start;

     while(p!=NULL)

         if(p->data==stack[top])

            break;

         p=p->next;

     cout<<stack[top]<<" ";

     top--;

     k=p->adj;

     while(k!=NULL)

        q=k->next;

        if(q->status==0)

            top++;

            stack[top]=q->data;

            q->status=1;

        k=k->adj;

     getch();

     return;