File Structure ( FS ) Lab Program 3 ( 6th Semester Information Science)

// March 31st, 2009 // Comments // Educational, Engineering, File Structure (F.S.) Lab

/*c++ program to read and write students object with variable length records and
fields delimited by’|’Implemend pack(),UNPACK(),modify()and search() methods*/
#include iostream.h
#include conio.h
#include fstream.h
#include string.h
#include process.h
#include stdlib.h
#include stdio.h
class student
{
public:
char usn[100],name[100],address[100],branch[100],college[100],buffer[100];
char sem[100];
void readrec();
void pack();
void write(fstream&file);
void unpack(fstream&file);
void search(fstream&file);
void modify(fstream&file);
};
void student::modify(fstream&file)
{
char reg[80];
int count=0;
file.seekg(0);
fstream file1;
file1.open(”data2.txt”,ios::out);
cout<>reg;
while(1)
{
file.getline(usn,80,’|’);
file.getline(name,80,’|’);
file.getline(address,80,’|’);
file.getline(sem,80,’|’);
file.getline(branch,80,’|’);
file.getline(college,80,’#’);
count++;
if(atoi(usn)==atoi(reg))
{
cout<<”nrecord found”<<count<<”positionn”;
readrec();
pack();
write(file1);
cout<<”nrecord modified.n”;
return;
}
else if(strlen(name)==0)
break;
pack();
write(file1);
}
cout<<”nrecord not foundn”;
file1.close();
}

void student::search(fstream&file)
{
char reg[80],temp[80];
int count=0;
file.seekg(0);
cout<>reg;
while(1)
{
file.getline(usn,80,’|’);
strcpy(temp,usn);
file.getline(name,80,’|’);
file.getline(address,80,’|’);
file.getline(sem,80,’|’);
file.getline(branch,80,’|’);
file.getline(college,80,’#’);
count++;
if(atoi(temp)==atoi(reg))
{
cout<<”nRecord found at”<<count<<”position”;
return;
}
if(strlen(usn)==0)
break;
}
cout<<”nRecord not found”;
}
void student::unpack(fstream&file)
{
while(1)
{
file.getline(usn,80,’|’);
file.getline(name,80,’|’);
file.getline(address,80,’|’);
file.getline(sem,80,’|’);
file.getline(branch,80,’|’);
file.getline(college,80,’#’);
if(strlen(usn)==0)
break;
cout<<flush<<”nusn:”<<usn<<endl;
cout<<”nname:”<<name<<endl
<<”naddress:”<<address<<endl
<<”nsemister:”<<sem<<endl
<<”nBranch:”<<branch<<endl
<<”ncollege:”<<college<<endl;
cout<<”n**************n”;
}
}
void student::pack()
{
char tempbuf[100];
tempbuf[0]=”;
strcat(tempbuf,usn);
strcat(tempbuf,”|”);
strcat(tempbuf,name);
strcat(tempbuf,”|”);
strcat(tempbuf,address);
strcat(tempbuf,”|”);
strcat(tempbuf,sem);
strcat(tempbuf,”|”);
strcat(tempbuf,branch);
strcat(tempbuf,”|”);
strcat(tempbuf,college);
strcat(tempbuf,”#”);
strcpy(buffer,tempbuf);
}
void student::write(fstream&file)
{
file<<buffer;
}
void student::readrec()
{
cout<>usn;
cout<>name;
cout<>address;
cout<>sem;
cout<>branch;
cout<>college;
}
void main()
{
char filename[25];
int choice;
fstream file;
student st;
clrscr();
cout<>filename;
while(1)
{
cout<<”n*******program|menue********n”;
cout<<”1:pack Record t2:unpack recordn”;
cout<<”3:modify recordt4:search recordn”;
cout<<”press 5 to exitn”;
cout<<”****************************n”;
cout<>choice;
switch(choice)
{
case 1:st.readrec();
st.pack();
file.open(filename,ios::out|ios::app|ios::in);st.write(file);
file.close();
break;
case 2:file.open(filename,ios::out|ios::app|ios::in);
st.unpack(file);
file.close();
break;
case 3:file.open(filename,ios::out|ios::app|ios::in);
st.modify(file);
file.close();
unlink(filename);
rename(”data2.txt”,filename);
break;
case 4:file.open(filename,ios::out|ios::app|ios::in);
st.search(file);
file.close();
break;
case 5:exit(0);
}
}
}

Credits : Prithu A Roy

File Structure ( FS ) Lab Program 2 ( Set 2 )

// March 30th, 2009 // Comments // Educational, Engineering, File Structure (F.S.) Lab

/*c++ programme to read and write students object with fixed length records and
fields delimeted by’|’Implemend pack(),UNPACK(),modify()and search() methods*/

#include<iostream.h>
#include<process.h>
#include<fstream.h>
#include<string.h>
#include<conio.h>
class Student
{
public:
char buf[40],name[10],semes[10],branch[10];
void unpack(ifstream & ifile);
void pack(ofstream & ofile);
void search(ifstream & ifile, char key[]);
void modify(fstream & iofile, char key[]);
};

void Student::pack(ofstream & ofile)
{
clrscr();
strcpy(buf,”");
cout<<”Name “<<endl;
cin>>name;
strcat(buf,name);
strcat(buf,”|”);
cout<<”Semester “<<endl;
cin>>semes;
strcat(buf,semes);
strcat(buf,”|”);
cout<<”Branch “<<endl;
cin>>branch;
strcat(buf,branch);
strcat(buf,”|”);
while(strlen(buf)<40)
{
strcat(buf,”.”);
}
strcat(buf,”n”);
ofile.write(buf,strlen(buf));
}
void Student::unpack(ifstream & ifile)
{
char *field;
clrscr();
while(1)
{
strcpy(buf,”");
ifile.getline(buf,42,’n');
if(ifile.fail())
break;
int  p=0,q;
for (q = 0;buf[q]!= ‘|’; q++)
field[p++] = buf[q];
field[p] = ‘’;
cout<<”Name: “<<field<<endl;
p=0,q++;
for (;buf[q]!= ‘|’; q++)
field[p++] = buf[q];
field[p] = ‘’;
cout<<”Semester: “<<field<<endl;
p=0,q++;
for (;buf[q]!= ‘|’; q++)
field[p++] = buf[q];
field[p] = ‘’;
cout<<”Branch: “<<field<<endl<<endl;
}
}
void Student::search(ifstream & ifile, char key[])
{
char field[10];
int flag = 0;
clrscr();
while(1)
{
strcpy(buf,”");
ifile.getline(buf,42,’n');
if(ifile.fail())
break;
int  p=0,q;
for (q = 0;buf[q]!= ‘|’; q++)
field[p++] = buf[q];
field[p] = ‘’;

if(strcmp(field,key)==0)
{
cout<<”Record found and details are:”<<endl;
cout<<”Name: “<<field<<endl;
p=0,q++;
for (;buf[q]!= ‘|’; q++)
field[p++] = buf[q];
field[p] = ‘’;
cout<<”Semester: “<<field<<endl;
p=0,q++;
for (;buf[q]!= ‘|’; q++)
field[p++] = buf[q];
field[p] = ‘’;
cout<<”Branch: “<<field<<endl;
flag=1;
break;
}
}
if(!flag)
cout<<”Record with given key not found”<<endl;
}
void Student::modify(fstream & iofile, char key[])
{
char field[10];
//     int flag = 0;
clrscr();
while(1)
{
strcpy(buf,”");
iofile.getline(buf,42,’n');
if(iofile.fail())
break;
int  p=0,q;
for (q = 0;buf[q]!= ‘|’; q++)
field[p++] = buf[q];
field[p] = ‘’;
if(strcmp(field,key)==0)
{
clrscr();
cout<<”Record found Enter modification details”<<endl;
iofile.seekp(-42,ios::cur);
//pack(iofile);
strcpy(buf,”");
cout<<”Name “<<endl;
cin>>name;
strcat(buf,name);
strcat(buf,”|”);
cout<<”Semester “<<endl;
cin>>semes;
strcat(buf,semes);
strcat(buf,”|”);
cout<<”Branch “<<endl;
cin>>branch;
strcat(buf,branch);
strcat(buf,”|”);
while(strlen(buf)<40)
{
strcat(buf,”.”);
}
strcat(buf,”n”);
iofile.write(buf,strlen(buf));
break;
}
}
}

void main()
{
int n,i=0,ch;
Student stu;
clrscr();
for(;;)
{
clrscr();
cout<<”1. Insertn2.  Display alln3.  Searchn4.  Modifyn5.  Exitn”;
cout<<”Enter your choice”<<endl;
cin>>ch;
switch(ch)
{
case 1:    ofstream ofile;
ofile.open(“student.txt”,ios::out|ios::trunc);
cout<<”enter the no. of students”<<endl;
cin>>n;
while(i<n)
{
stu.pack(ofile);
i++;
}
ofile.close();
break;

case 2:    ifstream infile;
infile.open(“student.txt”,ios::in);
stu.unpack(infile);
getch();
infile.close();
break;

case 3: cout<<”Enter the record name to be searched”<<endl;
char key[10];
cin>>key;
ifstream ifile;
ifile.open(“student.txt”,ios::in);
stu.search(ifile,key);
getch();
ifile.close();
break;

case 4:    fstream iofile;
iofile.open(“student.txt”,ios::in|ios::out);
cout<<”Enter the record name to be modified”<<endl;
cin>>key;
stu.modify(iofile,key);
getch();
iofile.close();
break;

default: exit(0);
}
}
}

Credits : Sahana V

File Structure ( FS ) Lab Program 2 ( 6th Semester Information Science)

// March 29th, 2009 // Comments // Educational, Engineering, File Structure (F.S.) Lab

/*c++ programme to read and write students object with fixed length records and
fields delimeted by’|’Implemend pack(),UNPACK(),modify()and search() methods*/
#include iostream.h
#include conio.h
#include fstream.h
#include string.h
#include process.h
#include stdlib.h
#include stdio.h

class student
{
public:
char usn[100],name[100],address[100],branch[100],college[100],buffer[100];
char sem[100];
void readrec();
void pack();
void write(fstream&file);
void unpack(fstream&file);
void search(fstream&file);
void modify(fstream&file);
};
void student::modify(fstream&file)
{
char reg[80];
int count=0;
file.seekg(0);
fstream file1;
file1.open(”data2.txt”,ios::out);
cout<>reg;
while(1)
{
file.getline(usn,80,’|’);
file.getline(name,80,’|’);
file.getline(address,80,’|’);
file.getline(sem,80,’|’);
file.getline(branch,80,’|’);
file.getline(college,80,’n’);
count++;
if(atoi(usn)==atoi(reg))
{
cout<<”nrecord found”<<count<<”positionn”;
readrec();
pack();
write(file1);
cout<<”nrecord modified.n”;
return;
}
else if(strlen(name)==0)
break;
pack();
write(file1);
}
cout<<”nrecord not foundn”;
file1.close();
}

void student::search(fstream&file)
{
char reg[80],temp[80];
int count=0;
file.seekg(0);
cout<>reg;
while(1)
{
file.getline(usn,80,’|’);
strcpy(temp,usn);
file.getline(name,80,’|’);
file.getline(address,80,’|’);
file.getline(sem,80,’|’);
file.getline(branch,80,’|’);
file.getline(college,80,’n’);
count++;
if(atoi(temp)==atoi(reg))
{
cout<<”nRecord found at”<<count<<”position”;
return;
}
if(strlen(usn)==0)
break;
}
cout<<”nRecord not found”;
}
void student::unpack(fstream&file)
{
while(1)
{
file.getline(usn,80,’|’);
file.getline(name,80,’|’);
file.getline(address,80,’|’);
file.getline(sem,80,’|’);
file.getline(branch,80,’|’);
file.getline(college,80,’n’);
if(strlen(usn)==0)
break;
cout<<flush<<”nusn:”<<usn<<endl;
cout<<”nname:”<<name<<endl
<<”naddress:”<<address<<endl
<<”nsemister:”<<sem<<endl
<<”nBranch:”<<branch<<endl
<<”ncollege:”<<college<<endl;
cout<<”n**************n”;
}
}
void student::pack()
{
char tempbuf[100];
tempbuf[0]=”;
strcat(tempbuf,usn);
strcat(tempbuf,”|”);
strcat(tempbuf,name);
strcat(tempbuf,”|”);
strcat(tempbuf,address);
strcat(tempbuf,”|”);
strcat(tempbuf,sem);
strcat(tempbuf,”|”);
strcat(tempbuf,branch);
strcat(tempbuf,”|”);
strcat(tempbuf,college);
strcat(tempbuf,”n”);
strcpy(buffer,tempbuf);
}
void student::write(fstream&file)
{
file<<buffer;
}
void student::readrec()
{
cout<>usn;
cout<>name;
cout<>address;
cout<>sem;
cout<>branch;
cout<>college;
}
void main()
{
char filename[25];
int choice;
fstream file;
student st;
clrscr();
cout<>filename;
while(1)
{
cout<<”n*******program|menue********n”;
cout<<”1:pack Record t2:unpack recordn”;
cout<<”3:modify recordt4:search recordn”;
cout<<”press 5 to exitn”;
cout<<”****************************n”;
cout<>choice;
switch(choice)
{
case 1:st.readrec();
st.pack();
file.open(filename,ios::out|ios::app|ios::in);st.write(file);
file.close();
break;
case 2:file.open(filename,ios::out|ios::app|ios::in);
st.unpack(file);
file.close();
break;
case 3:file.open(filename,ios::out|ios::app|ios::in);
st.modify(file);
file.close();
unlink(filename);
rename(”data2.txt”,filename);
break;
case 4:file.open(filename,ios::out|ios::app|ios::in);
st.search(file);
file.close();
break;
case 5:exit(0);
}
}
}

Credits : Prithu  A Roy

How to Boost your Alexa Rank | Site Traffic

// March 26th, 2009 // Comments // S.E.O., Web

Finally the first post on SandeepHegde.me on my area of expertise – search engine optimization (S.E.O.). I’m going to explain how you can boost your alexa ranking and increase the visitors to your website in an very simple way. There is no better example than SandeepHegde.me itself which has reach an alexa ranking of 928,676 in just one month. If you have come to SandeepHegde.me and reading this article , you can also learn and implements the same methods  I have used ! I shall explain all the stuff , breaking down the post and covering step by step.

Search engine optimisation involves a lot of parameters to be considered. it may be the traffic to the site, the number of backlinks, the internal linking structures, socila book marking, high quality content and the readability of this content by the search engine bots. Alexa rank is one of the measure for your sites search engine positiong which is ultimately linked to your website trafic. Alexa computes traffic rankings by analyzing the Web usage of millions of Alexa Toolbar users and data obtained from other, diverse traffic data sources. The information is sorted, sifted, anonymized, counted, and computed, until, finally, we get the traffic rankings shown in the Alexa service. The process is relatively complex, but you can understand it and build your rank accordingly.

So lets start with PART 1 : Fundamental Tools

There are some very fundamental tools I use for increasing alexa rank | Search engine rankings and increasing the visitors to your site.

1. WordPress :

WordPress is an open sourceblog publishing application and a content management system.WordPress is a state-of-the-art publishing platform with a focus on aesthetics, web standards, and usability.

WordPress is both free and priceless at the same time.

I personlly like wordpress for its simplicity of use. It is best suited platform for search engine optimisation. It has a lots of plugins and user friendly themes. Most of these are free !

You can get more details at : www.wordpress.org

2. All in one SEO Pack :

As the name says it is a out of the box seo for your wordpress software. It is pretty easier to use but at the same time gives a excellet search engine positioning. All that you have to do is to enter proper title, description and keywords related to the articles. I shall come to proper usage of this title , description and keywords at the later part. Virtually you can fine tune everything using  All in one SEO pack.

You can get more details at : http://wordpress.org/extend/plugins/all-in-one-seo-pack/

3. Google XML Sitemaps :

Yet another favourite plugin of mine. It does exactly what it says upto the the mark.  It generates automatically a sitemap for all pages. It also automatically pioratise the post based on number of comments.  The user interface has a lot of customizable options like priorities etc. The generated xml file is search engine friendly. It also notifies Ask.com, Google, MSN Live Search and YAHOO about changes via pin. I recommend submitting the url of the sitemap generated using Google Webmaster Tools since Google plays an major role in the search engine traffic.

You can get more details at : http://www.arnebrachhold.de/projects/wordpress-plugins/google-xml-sitemaps-generator/

4. Socialable | Share This :

Socialable and Share This both are similar kind of plugin used for enhancing the sites appearence in social bookmarking portals. Social Bookmarking sites like Stuble Upon, Digg, Mixx, Propeller not only drive a lot of traffic to the website but also enhance the backlinks and sites popularity over the internet. These sites already have a good search engine strategy and search bots scan them regurarly. So if your site is getting listed on such social sites it will enhance your sites search engine positioning.

You can get more details at :

http://wordpress.org/extend/plugins/sociable/

http://wordpress.org/extend/plugins/share-this/

If you can Google about the top blogs over itnetnet you will know most of them are powered by wordpress. Self hosted wordpress yet rules the blogosphere. The plugins I have listed above are also the most popular one and it is not that difficult to find them out ! You can find it most of the time in the most popular section of wordpress plugin directory.

Search engine optimisation is a long process and you can’t just get an alexa rank or search engine rank in hurry burry !

So get ready with fundamental tools and wait for my next post…

File Structure ( FS ) Lab Program 2 ( 6th Semester Information Science)

// March 25th, 2009 // Comments // Educational, Engineering, File Structure (F.S.) Lab

FILE STRUCTURES LAB

Semester : 6

Subject Code : O6ISL67

Experiment No.  :  2

Objective   of the Experiment : To make objects persistet by writing them to file . To maintain identity of fields and records , add delimiters to fields  and make  records  of fixed length.
Build two separate classes Student and FixedLengthBuffer (Record size =75). Write  overloaded insertion and extraction operators for reading and displaying  student data  . Implement  Pack() , UnPack() ,Read(), Write () methods for performing Buffer and file  opeartions.Use ‘ | ‘ as field Delimiter.
Class should have constructor to initialize buffer and student objects.

Procedure  in main :
1.    Create Student object and initialize
2.    Create buffer object and initialize
3.    Open file in write mode
4.    Read data for student
5.    Pack the student object into buffer
6.    Write the buffer to file
7.    Repeat step 4-6 for 15 students
8.    Close  the file.
9.    Open the file in read mode
10.    Read a record into buffer
11.    Unpack the fields and restore the state of an Object
12.    Display student record
13.    Repeat steps 10-12 for all the records stored in the file
14.    Close the file.

Buffer Contents                                               Record  USN  Name              Address            Semester
11 | student1 |Belgaum |1…………….        1                11         student1      Belgaum          1
12 |student2 |bangalore |2……………    2               12         student2     bangalore       2

Ultra Surf – The Best Proxy Software – Bypass any Internet filter

// March 22nd, 2009 // Comments // Software

Here is the most secure way to unlock any kind of filters n’ firewalls, it is a kind of breakthrough in right for 100% information for people of countries like china where government has spent millions of dollars for raising cyber walls so that their people get filtered information.

Why Ultrasurf is world’s best proxy Surfing technology or technique??

Lets find it and compare it

So what exactly it is??

It is the flagship software product from UltraReach Internet Corp. for Internet anti-censorship. It enables users inside countries with heavy Internet censorship to visit any public web sites in the world safely and freely. it enables users to browse any website freely just the same as using the regular IE browser while it automatically searches the highest speed proxy servers in the background.

Learn More

What does it means??

• 100% freedom to have 100% information in most secure way.
• It means no matter where you are you can access 100% free version of internet I mean no firewalls no restriction nothing….
• Almost all schools, universities and corporate offices raise firewalls to filter out not work related sites, now those firewalls will be of no use or they have to change their plans.
• Everybody can access various social networks like Orkut, Youtube, Myspace, Hi5, Facebook, Linkedin etc. which are blocked almost in 99% schools and offices.
• 100% real time and it’s encryption is better then any online banking system.

Facts of UltraSurf:

Download latest version of UltraSurf

How to get going??

It’s very simple you have to just-

• Download an exe file
• Then extract it
• And run
• Set proxy if u have any (generally in offices internet are provided through proxies, you can find that, through tools>>internet options>>Connections>>LAN Settings>> there you are with proxy server for your LAN and it’s port
• Just copy that to proxy settings of UltraSurf.
• Then a window will pop up, says some thing in Chinese, just close this window
• And open fresh internet explorer
• There you are, you can surf any information.
• For office people: beware don’t spread words to your colleagues keep this info as limited as you can, coz if system people got to know about it then they’ll take your comp for scrutinizing.

What is the Flip Side??

I should start with a quote that I’ve learn’t in my life

“Too much freedom can Make you or it can Break you”

The flip side is that you can access to anything, I thing you got my point, In school, universities and Work office various sites are blocked to raise their efficiency and productivity, and it is very much likely that if anyone get freedom he/she will definitely try to miss use it.

Some Useful Tips:

I’ve heard one thing many times that Ultra Surf is slowing down net speed or Ultra Surf is not working or something like that but after so many experience of Q&A and personal experience I’ve found that it’s not the Ultra Surf but it’s the net connection that has problems…..

• Check your net connection remember that it needs certain level of net speed to run Ultra Surf smoothly.
• check proxy settings of Ultra Surf, when u download fresh version u need to tweak proxy settings of Ultra Surf. do that manually, also sometimes proxy setting of Ultra Surf get vanished automatically.. do check for proxy setting and feed it manually. For any kind of browser Proxy IP address is 127.0.0.1 with port :9666 and For Ultra Surf it depends upon your network.
• 8.8 is the latest one and it is the best because when there is no net connectivity it automatically flashes a message…. it won’t hang u there for retry
• also last tip is that when net slows down or ain’t working at all, just exit Ultra Surf and re start it. instead of retry.. try exit and re start it…trust me retry is bad idea. just restart the whole thing.

• If you are using browser other than IE, then you have to manually change your proxy IP address to 127.0.0.1 with port :9666 of Firefox browser.
• Mac Users, change your proxy IP address to 127.0.0.1 with port :9666 of Safari browser.

Download latest version of UltraSurf

[Credits : UltraReach Internet Corp, Rajesh Rana ]

If you know any other software , please feel free to comment below.

After an Month

// March 16th, 2009 // Comments // Cool Sites, My Activities

So friends PingSense.com has successfully completed an month on internet. So just thought of looking a way back.

It was my first attempt of serious Blogging and the most important thing I’m still serious about it!

Although I started with a general post, it moved to movies and departmental stuff. The post related to wordpress workshop had good keywords and got some traffic from Google. My post on Billu Barber got a traffic to the site . This made me to make a post on Delhi 6 too which still stands to to be highest viewed page on the site (2000+ counting on…)

Next comes the series of Lab Programs. I don’t know in which mood I posted the File Structure Lab programs for 6th Semester Information Science. File Structure Lab programs got listed first in Google & other search engines and hence I got a huge response from my fellow engineers. Thanks to our madam! People started mailing me for remaining programs and it went to extend that they even ask for programs in guest book ! The post remains the top discussed post on the site and made me to post lex and yaac programs and other academic stuff too. File Structure programs are too difficult and I may have to post once I get the remaining programs.

Next coming to the design of the site. The colour changed from orange to blue to external world. Internally I change the Personal Magazine theme to new design. Personal magazine had a simply look and lacked functionality. I could not even add widgets in it!

The new layout has two level of menus – one for custom pages and another for post categories. The top slider and feature post helps me to show attractive posts to the readers. Only a small portion of post gets listed up giving an option for more posts on homepage and giving the option to the reader goto the post of his choice. The site has become more user friendly what do you say?

Coming to the interaction with the user , I have added the Email subscription option powered by Google feedburner. This is allowing the readers to get the latest post right in their mailbox. Feedburner has got a good response with a lot of people subscribing daily. I have also added an code to display the feedburner statistics and the site statistics i.e the number of people reading the feeds and the number of people visiting and viewing the site. The comes the tabbed menu which has 3-d tag cloud and the articles which are most discussed and most popular.

Recently I have also added widgets from “Pluck”. The widget scans the content on my site and embeds the related articles from other site on the internet. The content is displayed withing my site and hence making the readers happy.

I have tried to optimize the site with ads but it is not generating any revenue. People now a days does not seem to click on ads. If the site does not generate any revenue through ads it may be difficult to pay my hosting charges next year. The site is getting a lot of visits and is consuming a lot of resources of my shared web hosting account. Keep praying that the service provider to be kind enough not to ban me for over usage of CPU and Memory usage.

Now comes the search engine optimization part. Being in the web industry for more than 3 years search engine optimization ( SEO ) was like an child’s play to me. The site started getting listed on the top of the search engines like google, yahoo, msn etc. Although the visits initially cam through search engines 25% were loyal enough to come back directly and i thank them all for their support. My search engine efforts were only for a week but still giving good results. The site has got a lot of back-links through many social bookmarking sites.

The site has got an seo score of 93% from “DomainTools.com”

Meanwhile site has reached an alexa ranking of 1,696,145 Globally, 125,973 for India and 913,344 for United States. I believe it is an achievement to reach such an ranking within one month time duration.

The site is valued to be worth $1372.4 till date by “WebsiteOutlook.com” and I’m embedding the real time valuation :

But its still a long way to go to get approved by direct ad agencies like “buy sell ads”.

In meanwhile it is making me to think the site is more of programs and academic stuff. So I’m making my mind to keep the academic stuff in limit and post on my areas of expertise. This post is a preface to the coming changes….

I welcome the suggestion and feedbacks .

Management and Entrepreneurship , Unit 2, VTU

// March 10th, 2009 // Comments // Engineering

Planning

• Nature
• Importance and pupose of planning process
• Objectives
• types of plans (Meaning Only)
• Decision making
• Importance of planning
• Steps in planning & planning premises
• Hierarchy of plans

Management and Entrepreneurship , Unit 2

System Software Lab Programs ( UNIX Programs ) – 3a

// March 8th, 2009 // Comments // Engineering, Unix and System Software Lab

Subject : System Software Laboratory

Branch : Information Science & Engineering

Semester : 6

University : VTU

[Click Here to get other programs by email ]

………………………………………………………………………………………………………………………….
PART -B

………………………………………………………………………………………………………………………….

3.a) Shell function that takes a valid directory names as an argument an recursively descends all the sub directories, finds the maximum length of any file in that hierarchy and writes this maximum value to the standard output.

……………………………………………………………………………………………………………………………

clear

find

{

clear tput

echo -e “Enter a valid directory name : ”

read dir

if [  -d @dir ]

then

ls -1R $dir>file1

grep -h “^-r” file1>file2

cat file2

cut -c 24-28 file2>file3

sort -n file3>file4

tail -1 file4>file5

echo -e “Max length is ”

cat file5

else

else

echo -e “Invalid dir ”

fi

}

[Click Here to get other programs by email ]

[Request : If you are going to post this program on any other website please link back to original post ]

System Software Lab Programs ( UNIX Programs ) – 2b

// March 6th, 2009 // Comments // Engineering, Unix and System Software Lab

Subject : System Software Laboratory

Branch : Information Science & Engineering

Semester : 6

University : VTU

………………………………………………………………………………………………………………………….
PART -B

………………………………………………………………………………………………………………………….

2. b) C program to create a file with 16 bytes of arbitrary data from the beginning and another 16 bytes of arbitrary data from an offset of 48. Display the file contents to demonstrate how the hole in file is handled.

……………………………………………………………………………………………………………………………

#include<stdio.h>

#include<unistd.h>

main()

{

FILE *fp;

int i,j;

char ch;

fp=fopen(“text.txt”,”w”);

ch=’a';

for(i=o;i<16;i++)

{

fwrite(&ch,1,1,fp);

ch++;

}

fseek(fp,48L,1);

ch=’A';

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

{

fwrite(&ch,1,1,fp);

ch++;

}

fclose(fp);

fp=fopen(“text.text”,’r”);

while((fread(&ch,1,1,fp))!=0)

print(“%c”,ch);

fclose(fp);

}

[Request : If you are going to post this program on any other website please link back to original post ]