KiNgS NeWs

Tips to get pass mark in Anna university semester examinations :

2014-11-14T08:00:00.001-08:00

Hi and hello poor innocent guys over there .... This is me one of the Engineering student under so called Anna university as like you guys..

I finished my degree without any history of arrear that means no arrear in each semester pulse I got placed in the campus itself so here I am to share my success tips to over come the Anna university semester exams..

Look guys Anna university is the easiest and simple place where one can get pass with little effect and smart work. The first and the for most likely important thing to do is please for God sake keep your internal make up to 14 because it help you to get through. Don't worry if you don't have much, 10 is more than enough. I cleared all semester with internals 10.

For 16 mark questions please refer the previous year questions.
Study only those that repeat. Two 16 mark question from each unit will make.

For 2 marks read only those that are in the question bank book. This will make. Please don't ignore 2 mark question from reading this is so needed if you wish to get passed.

Then the last thing, just fu*k the seat and sit for the exam let the fate decide......

Life as an Engineering Student..... Dreaming huge....

2014-07-27T01:44:00.000-07:00

Bla bla bla... have heard so much about the dreams the struggles of many engineering guys out there.. Its not that easy to be a engineer as you all guys non-engineers think off.. me myself an engineering student from the a university were lakhs of students fall. Here is how their life starts.
Its their Daddy's OMG who make them to join 3 to 4 tuition's during their 11th and 12th waking up 3.30 am in the mid night not early morning you shits.. when they reach there, there comes the midnight test in the tuition which was useless and the results of the previous test will be shown immediately after today's test ... here come the fun part those who fail in that are asked to stay out side the tuition that is they provide a special area for those special guys like us and are made to write those test questions with answer 15 times while the tuition goes on inside, we keep on writing.. so it was like waking up early in the morning for assignment training.....LOL
Finally came the public exam results... To be continued

Amazing Spider-Man 2 Review:

2014-05-04T00:20:00.002-07:00

Wow its time for part 2 . There were 3 villains Electro, Green Goblin and Raino dont think that all the three have a big fight all together only the electo was the main villain and the green guy came for 10 min after electro was defeated by our hero and the Raino was just like a joke came for only last 15 seconds were spiderman and raino ran towards each other to fight and suddenly the film ends showing that spider man will save the people no matter what the villains are..!!!!

Finally: Super visuals and a great treat for spiderman fans....!!!

Java program for Border Gateway Protocol(BGP):

2014-04-29T00:26:00.001-07:00

package bgp;

import java.util.*;

public class rout

{

public static void main(String[] args)

{

int i,j,k;

int a[][]=new int[10][10];

int b[][]=new int[10][10];

Scanner z=new Scanner(System.in);

System.out.print("Enter the number of nodes :");

int n=z.nextInt();

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

{

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

{

System.out.println("Enter the distance between the host"+(i+1)+"-"+(j+1));

a[i][j]=z.nextInt();

}

System.out.println("\nThe matrix is:");

}

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

{

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

{

System.out.print(a[i][j]+"\t");

}

System.out.println();

}

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

{

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

{

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

{

if(a[i][j]>a[i][k]+a[k][j])

{

a[i][j]=a[i][k]+a[k][j];

}

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

{

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

{

b[i][j]=a[i][j];

if(i==j)

{

b[i][j]=0;

}

System.out.println("\nThe output matrix is:");

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

{

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

{

System.out.print(b[i][j]+"\t");

}

System.out.println("\n");

}

Embedded System portions for Anna University:

2014-04-29T00:18:00.001-07:00

IT2354 EMBEDDED SYSTEMS L T P C
3 0 0 3

UNIT I EMBEDDED COMPUTING 9
Challenges of Embedded Systems – Embedded system design process. Embedded
processors – 8051 Microcontroller, ARM processor – Architecture, Instruction sets and
programming.

UNIT II MEMORY AND INPUT / OUTPUT MANAGEMENT 9
Programming Input and Output – Memory system mechanisms – Memory and I/O
devices and interfacing – Interrupts handling.

UNIT III PROCESSES AND OPERATING SYSTEMS 9
Multiple tasks and processes – Context switching – Scheduling policies – Interprocess
communication mechanisms – Performance issues.

UNIT IV EMBEDDED SOFTWARE 9
Programming embedded systems in assembly and C – Meeting real time constraints –
Multi-state systems and function sequences. Embedded software development tools –
Emulators and debuggers.

UNIT V EMBEDDED SYSTEM DEVELOPMENT 9
Design issues and techniques – Case studies – Complete design of example embedded
systems.

C Program for the Implementation of a Simple Text Editor with featuress like Insertion, Deletion | CS1207 - System Software Laboratory

2013-10-28T20:20:00.002-07:00

AIM:
To write a "C" program to implement "Text Editor" with features like insertion, deletion in CS1207 - System Software Lab.

ALGORITHM:

1.Display options new, open and exit and get choice.
2.If choice is 1 , call Create() function.
3.If choice is 2, call Display() function.
4.If choice is 3, call Append() function.
5.If choice is 4, call Delete() function.
6.If choice is 5, call Display() function.
7.Create()
7.1 Get the file name and open it in write mode.

   7.2 Get the text from the user to write it.
8.Display()
   8.1 Get the file name from user.
   8.2 Check whether the file is present or not.
   8.2 If present then display the contents of the file.
9.Append()
    9.1 Get the file name from user.
    9.2 Check whether the file is present or not.
    9.3 If present then append the file by getting the text to add with the existing file.
10. Delete()
    10.1 Get the file name from user.
    10.2 Check whether the file is present or not.
    10.3 If present then delete the existing file.

SOURCE CODE:

#include<stdio.h>
#include<conio.h>
#include<process.h>
int i,j,ec,fg,ec2;
char fn[20],e,c;
FILE *fp1,*fp2,*fp;
void Create();
void Append();
void Delete();
void Display();
void main()
{
do {
clrscr();
printf("\n\t\t***** TEXT EDITOR *****");
printf("\n\n\tMENU:\n\t-----\n ");
printf("\n\t1.CREATE\n\t2.DISPLAY\n\t3.APPEND\n\t4.DELETE\n\t5.EXIT\n");
printf("\n\tEnter your choice: ");
scanf("%d",&ec);
switch(ec)
{
   case 1:
     Create();
     break;
   case 2:
     Display();
     break;
   case 3:
     Append();
     break;
   case 4:
     Delete();
     break;
   case 5:
     exit(0);
}
}while(1);
}
void Create()
{
fp1=fopen("temp.txt","w");
printf("\n\tEnter the text and press '.' to save\n\n\t");
while(1)
{
c=getchar();
fputc(c,fp1);
if(c == '.')
{
   fclose(fp1);
   printf("\n\tEnter then new filename: ");
   scanf("%s",fn);
   fp1=fopen("temp.txt","r");
   fp2=fopen(fn,"w");
   while(!feof(fp1))
   {
    c=getc(fp1);
    putc(c,fp2);
   }
   fclose(fp2);
   break;
}}
}
void Display()
{
printf("\n\tEnter the file name: ");
scanf("%s",fn);
fp1=fopen(fn,"r");
if(fp1==NULL)
{
   printf("\n\tFile not found!");
   goto end1;
}
while(!feof(fp1))
{
   c=getc(fp1);
   printf("%c",c);
}
end1:
fclose(fp1);
printf("\n\n\tPress any key to continue...");
getch();
}
void Delete()
{
printf("\n\tEnter the file name: ");
scanf("%s",fn);
fp1=fopen(fn,"r");
if(fp1==NULL)
{
   printf("\n\tFile not found!");
   goto end2;
}
fclose(fp1);
if(remove(fn)==0)
{
   printf("\n\n\tFile has been deleted successfully!");
   goto end2;
}
else
   printf("\n\tError!\n");
end2: printf("\n\n\tPress any key to continue...");
getch();
}
void Append()
{
printf("\n\tEnter the file name: ");
scanf("%s",fn);
fp1=fopen(fn,"r");
if(fp1==NULL)
{
   printf("\n\tFile not found!");
   goto end3;
}
while(!feof(fp1))
{
   c=getc(fp1);
   printf("%c",c);
}
fclose(fp1);
printf("\n\tType the text and press 'Ctrl+S' to append.\n");
fp1=fopen(fn,"a");
while(1)
{
   c=getch();
   if(c==19)
    goto end3;
   if(c==13)
   {
    c='\n';
    printf("\n\t");
    fputc(c,fp1);
   }
   else
   {
    printf("%c",c);
    fputc(c,fp1);
   }
}
end3: fclose(fp1);
getch();
}

Implementation of a Single Pass Macro Processor using C programming..

2013-10-28T03:56:00.004-07:00

Single Pass Macro Processor

/* Macro Processor */

#include<stdio.h>
#include<conio.h>
#include<ctype.h>
#include<string.h>
int m=0,i,j,flag=0;
char c,*s1,*s2,*s3,*s4,str[50]=" ",str1[50]=" ";
char mac[10][10];
void main()
{
FILE *fpm=fopen("macro.txt","r");
FILE *fpi=fopen("minput.txt","r");
FILE *fpo=fopen("moutput.txt","w");
clrscr();
while(!feof(fpm))
{
fgets(str,50,fpm);
s1=strtok(str," ");
s2=strtok(NULL," ");
if(strcmp(s1,"MACRO")==0)
{
strcpy(mac[m],s2);
m++;
}
s1=s2=NULL;
}
fgets(str,50,fpi);
while(!feof(fpi))
{
flag=0;
strcpy(str1,str);
for(i=0;i<m;i++)
{
if(strcmp(str1,mac[i])==0)
{
rewind(fpm);
while(!feof(fpm))
{
fgets(str,50,fpm);
s2=strtok(str," ");
s3=strtok(NULL," ");
if(strcmp(s2,"MACRO")==0&&strcmp(s3,str1)==0)
{
fgets(str,50,fpm);
strncpy(s4,str,4);
s4[4]='\0';
while(strcmp(s4,"MEND")!=0)
{
fprintf(fpo,"%s",str);
printf("\n####%s",str);
fgets(str,50,fpm);
strncpy(s4,str,4);
s4[4]='\0';
}
}
}
flag=1;
break;
}
}
if(flag==0)
{
fprintf(fpo,"%s",str);
printf("%s",str);
}
fgets(str,50,fpi);
}
fclose(fpm);
fclose(fpi);
fclose(fpo);
getch();
}

Input Files :

Macro.txt

MACRO ADD1
MOV A,B
ADD C
MEND
MACRO SUB1
STORE C
MEND

MInput.txt

MOV B,10
MOV C,20
ADD1
MUL C
SUB1
END

MOutput.txt

MOV B,10
MOV C,20
MOV A,B
ADD C
MUL C
STORE C
END

Software Engineering-Sem 4-Unit wise important questions-Anna University

2013-05-20T05:53:00.001-07:00

UNIT 1:
1. Explain in detail about the Process Iteration.
2. Explain in detail about the software life cycle model with various phases
3. Explain in Detail About the RAD model and incremental model
4. Explain in detail about the Component based Software Engineering

Unit II
1. Explain in detail about the Software Prototyping? Explain the various techniques used in Software Prototyping
2. What is data modeling? Draw the ER diagram and Identify the data objects with attributes used in Employee Information systems.
3. Describe the structure of software requirements specification documents explaining clearly the standards to be followed
4. Explain Requirement Engineering process in detail

Unit III
1. Explain cohesion and coupling in with necessary diagrams.
2. Explain in detail the design concepts.
3. Explain the design steps of the transform mapping
4. How you do some effective modular design List out the design heuristics

Unit IV
1. Explain in detail about system testing
2. Explain the various types of black-box testing methods.
3. Explain in detail about the different integration testing approaches
4. Write a procedure to find the sum of Fibonacci series up to N. find cyclomatic complexity. Derive all possible test cases.

Unit V
1. What are the tasks in SCM process? Explain each of them in detail
2. Write notes on ISO 9000 quality standards
3. What are direct and indirect measures? Explain size-oriented metrics in detail.
4. Explain in detail about the process improvement
Related Posts

IPL 2013: Sreesanth, Chandila, Chavan arrested for spot-fixing...

2013-05-17T03:39:00.001-07:00

Court allowed police to quiz Indian Test pacer S. Sreesanth, two of his Rajasthan Royals teammates - Ankeet Chavan and Ajit Chandila -- and 11 bookies, in their custody for five days. The three players are allegedly facing spot-fixing charges in at least three Indian Premier League games. The three cricketers, with their faces covered, were taken to the magistrate's residence inside the Saket district court complex.
While Sreesanth was arrested on Carter road in Mumbai, Chandila was picked up from Intercontinental Hotel, Mumbai while Chavan was arrested at the Trident Hotel, Mumbai. (Read: BCCI suspends players, Chandila's family cries foulplay). The police also arrested 11 bookies.
In a media briefing on Thursday afternoon, Delhi Police showed clippings of three matches where the players were involved in 'fixing' specific overs. According to Commissioner of Police Neeraj Kumar, Chandila, Sreesanth and Chavan leaked a 'pre-determined number of runs' in separate matches in return for huge sums of money from bookies.
The Police also read out transcripts of conversations between the cricketers and bookies and played out video clips where players gave 'indications' ahead of a 'fixed' over. While Chandila received Rs 20 lakh, Sreesanth and Chavan allegedly received Rs 40 lakh and Rs 50 lakh, respectively, for collaborating with the bookies or their agents.
Saying more than 100 hours of audio clippings were investigated, the Police chief said it was a coincidence that three players of the same team were involved. Police have been tracking phone calls of gullible players since April this year.
In what has been a Black Day for Indian cricket, top players expressed shock and dismay at the spot-fixing incident. (Also read: Gavaskar says Sreesanth an attention seeker, a distraction)
The Rajasthan Royals franchise, which is co-owned by Bollywood star Shilpa Shetty, said in statement that, "We are completely taken by surprise... We will fully cooperate with the authorities to ensure a thorough investigation. The management at Rajasthan Royals has a zero-tolerance approach to anything that is against the spirit of the game." (READ full statement)
Thirty-year-old Sreesanth, a veteran of 53 ODIs and 27 Tests, has been in controversy before over a fight with spinner Harbhajan Singh in the 2008 edition of the IPL.
Chandila, 29, has played for Haryana and the Delhi Daredevils in the IPL previously. Chavan, 27, has played for Mumbai.
Spot fixing is the manipulation of a particular ball or wicket in a cricket tournament, which is then betted upon.
Betting on sports is illegal in India but is allegedly big business in the IPL and is run by underground syndicates in Mumbai and other parts of the country. Sources said bookies often operate out of vehicles now to avoid detection.
Story first published on: Thursday, 16 May 2013 09:10

5 Ways to Get Rich (Without a Single Discernible Skill)

2013-03-27T05:35:00.005-07:00

So you're slogging away at a 9 to 5 job, paying off that student loan, doing all the things The Man said you had to do to succeed. Then one day you stop and think to yourself: there has got to be an easier way to make money.

And that's why you're in jail now. Which is too bad, because it turns out there are a number of completely legal ways to make money--good money--without setting foot in an office or putting on a uniform or even learning a single skill. And people do it every day.

#5.Sperm Donors

Potential Income:$12,000+ per year (depending on the sperm).

Finally, it's the job you've been training for since middle school!

The opportunities are only as limited as your own libido and genetics. For just a couple minutes of your time you can net around $100 for each donation, depending on the bank. Some even offer up to $500 a shot--but that's only if you agree to do it "Open ID" style so that your offspring can come knocking on your door years later.

No matter what career you're currently in, this should be the easiest job interview you've ever been through. There will be some basic health screenings to prove that you can physically handle the gauntlet of porn they're about to throw at you. Also, be ready for a background check on you and your immediate family to make sure that you aren't Charlie Sheen.

"What if I said you didn't have to pay me?"

Did we just mention the porn? Yeah, they put you in a nice quiet room with a bunch of porn. Do the deed, drop off your semen at the desk and make an appointment for later in the week (you can donate every three days).

A hundred bucks, every three days, that's $12,000 a year. And that's just entry level. If you're really serious about this, why limit yourself to one sperm bank? You can hit as many as you want, multiplying your yearly haul with each one. The "Open ID" method specifies that you're limited to two pregnancies per state. But they distribute your sample for you, so assuming you don't mind having a brood of 100 children scattered across America, you're literally sitting on a potential $50,000 at this moment.

And they smile when you give it to them. And they keep it in drinking glass.

Even if you don't go "Open ID," your earning potential is only limited by your ability to deliver the goods. The sperm count tends to decrease with the volume, but your guys can handle a few workouts a day, right?

Ladies, we're not leaving you out of this one. You can donate eggs and--get this--you can wind up with $5,000 or more per cycle.

#4.Street Entertainers

Potential Income:$25,000+ a year.

We've all seen the guy with a guitar hanging out by the subway station with his case open to accept donations. And you've probably dropped a quarter in feeling sorry for his poor homeless ass. But don't be fooled by that sad song about his wife leaving him for someone fitting your general description. He's just doing his job as a "busker." And that job can pay anywhere from $10 to $20 an hour depending on the performer's choice of location and level of talent.

There's even a book on the subject by long-time busker Johnnie Mac, covering all the basics from the choicest locations to where to put your tip cup. Mac spent almost 20 years as a street musician and says he was, "making a fortune... in fact, more than triple what I was making in the job I left behind."

And there's plenty of room for advancement. The Blue Man Group, Jimmy Buffet, Pierce Brosnan, George Burns, Bob Hope, Jewel, Jimmy Page, Penn and Teller, Rod Stewart, Simon and Garfunkel, Bob Dylan and Robin Williams all started their entertainment careers on the streets.

This is none of the people listed above but he's probably loaded.

Sure those people all had talent, but you can also make money miming, fortune telling and standing totally still while covered in silver paint (though we're guessing that last one involves lots of smart-ass kids walking by and punching you in the nuts).

Street performances are perfectly legal in most places as long as they don't interfere with traffic and business. But you do have to deal with the other buskers who are trying to horn in on your racket. After all, your sweet saxophone playing isn't going to get you any cash if there's a dude noisily plucking at his banjo five feet away, drowning you out. Luckily there's a sort of "Busker Code" that street entertainers follow which basically states, "I got to this corner first, and if you try and set up shop here, I'll stab yu."

#3.Human Guinea Pig

Potential Income:$50,000 a year (if you survive).

The key to science is trial and error. This occupation offers offers the excited opportunity to get paid to be one of the two.

Anyone can do it and, if you get involved in enough studies, man can it add up. For instance here's one that pays up to $1,500 for just two days of your time (granted, you have to be in chronic pain to qualify, but who isn't?) or you could get paid $15 an hour to be a test patient for medical students to poke at. And best of all, it's perfectly safe!

"Open big. Good, now swallow this tree frog."

Okay, that's a lie. A couple of years ago 11 people got tuberculosis after participating in a study that was apparently trying to find out what happens when you stick 11 healthy people in the same room with one guy who has tuberculosis.

Sure, that sounds horrifying. But we know at least one of their symptoms was prominent swelling. Of their wallets.

#2.Dumpster Diving

Potential Income:Varies, according to your own dumpster diving skill and creativity.

When we talk about "Dumpster Diving," we aren't talking about fishing out half-eaten hamburgers from behind McDonalds.

No, there are a couple of ways to make real cash. The first is in scrap metal. For instance, soda and beer cans bring 20 cents a pound. It only takes 25 or so cans to make a pound and it's not exactly like they're hard to find (Americans throw away about four billion pounds of them a year). Copper, steel and iron all fetch fair prices at recycling stations and scrap yards.

But more lucrative is all the perfectly good shit people throw away just to get it out of the house. Entire working computers wind up in the trash (after the owners upgraded) along with other electronics, furniture, all sorts of stuff you can sell or use.

Dumpster divers, like buskers, have a culture of their own, complete with rules and even forums where tips and secrets can be traded (the Dumpster World forums are members only, so secrets aren't given away and businesses don't get wind of what's going on behind their shops).

There are plenty of articles out there on the subject if you're looking to get your foot in the door. Remember: One man's discarded vibrator is another's Christmas shopping!

#1.Beggars

Potential Income:$100,000 a year.

Sure, begging isn't anybody's cup of tea, and it's certainly nothing you'd want to brag about at your class reunion. But you know what will make you feel better? $300 a freaking day.

That's exactly how much panhandlers outside a Wal-Mart in Coos Bay, Oregon were making (as much as some workers inside the store made ... in a week). The police there looked into the panhandlers and found they were long-time residents, and even had homes. According to the chief, "This is just their chosen profession."

That's not just an isolated situation, either. This news story found a down-on-her-luck girl begging for money to "buy a bus ticket to get back home." They estimated her income from that gig was around $27,000 a year. By comparison, according to Careers-in-finance.com, the starting salary for a Credit Analyst with a Bachelor's Degree: $27,000.

I can buy and sell your ass.

It isn't as easy as it sounds, though. Here is a helpful guide with many tips and tricks you'll need to know to become a successful beggar, such as:

"Have something to put money in: a cup, a cap, a guitar case ... Empty it regularly so people--both customers and potential crooks--can't see how much you're bringing in."

MAKE-UP FAILS.....

2013-03-20T00:25:00.000-07:00

GWYNETH PALTROW’S FAUX PUNK ROCKER

by Amy Sciarretto

Frank Micelotta, Getty Images

COURTNEY LOVE’S CLOWN IMPERSONATION

by Amy Sciarretto

Neilsen Barnard, Getty Images

Courtney Love‘s Bozo-like makeup in this 2009 shot featured heavy, badly-placed blush, spiky lashes and way too much lipstick smeared on her artificially-inflated lips.

The No. 1 rule of makeup is balance. If you go heavy on the lips, go light on the eyes — and vice versa.

This is all heavy with no measured balance.

LADY GAGA CHANNELS A PANDA

by Amy Sciarretto

YouTube

You never can predict what Lady Gaga is going to do with her makeup or her clothes.

When she appeared on a Japanese talk show in 2011, she decided to fully immerse in Asian culture and present herself as a panda, complete with two blacked out eyes and her hair done up in knots above her head like ears.

We can appreciate the sentiment, but unless she was on a kid’s TV show, this type of smeared football war paint was unnecessary. She looks like she’s been the unfortunate victim of domestic violence.

JENNIFER LOPEZ’S FOX FUR LASHES

by Amy Sciarretto

David McNew, Getty Images

While Jennifer Lopez usually looks amazing with her bronzed skin, nude lips and false lashes, her eye framers at the 2001 Oscars were constructed of red fox fur.

They thoroughly pissed off animal rights groups, and rightfully so. Any number of synthetic materials would’ve done the trick.

There’s no need to steal an animal’s fur just so you can bat your lashes seductively.

Cruel and uncool.

At the 2001 Oscars, Gwyneth Paltrow tried to shed her WASPy image by going braless in a sheer black dress with a milkmaid braid and smoky eye makeup.

While we loved her inky-eyed style as a characterin ‘The Royal Tenenbaums,’ it doesn’t work in real life.

Gwynnie wore too much messy eye makeup and it didn’t suit her. She was trying to be punk rock and it was a mistake. It prompts one reply: “Sellout!”

20 Things You Didn't Know About 'Aladdin'

2013-03-08T23:01:00.001-08:00

Can you believe it has been 20 years since Aladdin first entered our lives? The film was an absolute sensation, garnering much critical and financial success. After two decades I thought it would be “soaring good fun” to review the influence of this brand in the Disney universe.

This edition of Disney In Depth will highlight 20 fun facts about everything you ever wanted to know about Prince Ali and company.

1. Though Abu and Rajah serve as the best animal friends to lead characters Aladdin and Jasmine, they do not appear – nor are referenced – in the stage show production at Disney California Adventure Park.

2. Alan Menken won two Oscars for his work on Aladdin, one for his original score and the other for his music on “A Whole New World.”

3. In Aladdin and the King of Thieves, Genie makes reference to a boatload of Disney characters, including Chief Powhatan’s famous daughter, as seen in this clipat about the 1:07 mark.

4. Jafar has a fraternal twin sister, a sorceress named Nasira. She serves as the villain for the Aladdin-themed video game, “Disney’s Aladdin in Nasira’s Revenge.” Nasira is voiced by none other than Ariel the Little Mermaid herself, actress Jodi Benson.

5. When the film was first released on VHS in 1993, Aladdin sold a whopping 25 million copies.

6. Scott Weinger, the voice of Aladdin, is best known for his role as Steve, D.J.’s boyfriend, on Full House. He even appeared as a live-action version of the character as an in-joke in this scene, when D.J. imagines Steve in the role of the “street rat.”

7. In an early version of Aladdin, the protagonist was to have a mother. Thus, the Howard Ashman-Alan Menken song called “Proud of Your Boy” was scrapped. However the song is featured in a Clay Aiken-sung music video, highlighted on the 2004 DVD.

8. Dan Castellaneta, the voice of Homer Simpson, brought Genie to life in The Return of Jafar, after Robin Williamsexperienced a temporary falling-out with The Walt Disney Company. Castellaneta recorded all of his dialogue as Genie forAladdin and the King of Thieves, but once Williams returned to the role, his voice-work was removed.

9. Princess Jasmine, descending from Arabian heritage, was the first non-Caucasian Disney princess.

10. Aladdin earned over $500 million worldwide during its theatrical release and was the highest-grossing domestic film of 1992.

11. Aladdin boasts an entire section of Tokyo DisneySea, “Arabian Coast,” its design influenced by the environments of India and the Middle East.

12. The Return of Jafar was the first Disney direct-to-video animated feature, released in 1994. This launched a new platform for Disney, allowing them to utilize their characters in even more features.

13. The characters from the Aladdin television series guest-starred on an episode of the late-’90s Hercules animated series.

14. Following Disney’s precedent in re-releasing Beauty and the Beast and The Lion King in the IMAX format, Aladdin was scheduled to return to theaters in that format. Yet that re-release was canceled, even though a trailer had already been shown to IMAX audiences.

15. Aladdin’s appearance was originally modeled after actor Michael J. Fox, though movie-star Tom Cruise and even rapper MC Hammer later served as inspirations.

16. The Beast from the 1991 animated feature makes a “cameo appearance” in Aladdin, in the form of a figurine that the Sultan plays with, along with a whole stack of animals.

17. According to a Travel Channel special that explored the Disneyland Resort and the making of “Aladdin: A Musical Spectacular,” the actor who plays the Genie must go through over an hour-and-a-half of prosthetic, make-up, and other processes to transform into the blue comedic force.

18. The pop version of “A Whole New World” by Peabo Bryson and Regina Belle topped the Billboard Hot 100 chart on March 6, 1993. This is the only song from a Disney animated feature to claim that number one honor.

19. In Disneyland’s “it’s a small world,” characters from Aladdin, designed to fit the style of the scene, hover on the Magic Carpet.

20. Both Lea Salonga (Jasmine’s singing voice) and Linda Larkin (Jasmine’s speaking voice) were honored with Disney Legend awards at the 2011 ceremony, held at the D23 Expo, as seen in the clips below.

Agrabah aficionados, I encourage you to share your favorite moments and memories of Aladdin. Share your comments below and tweet your thoughts. If Genie granted you three wishes, what would you use them toward? I think having a buddy like Genie or Carpet would be a solid call.

This is Brett Nachman, signing off. Return back next week for another edition of Disney In Depth. Catch alerts for upcoming editions of the column by following me on Twitter. Have a good week!

Megan Fox Bikini: Pregnant Star Shows Off Baby Bump In Hawaii (PHOTO)

2013-01-28T08:18:00.002-08:00

There's no denying it now.

Megan Fox, 26, and her husband, Brian Austin Green, 38, were spotted enjoying some romantic R&R together in Kona, Hawaii, over the weekend, and if they were trying to keep their exciting baby news under wraps, it looks as if the secret's out.

The actress's growing baby bump was on full display as she sported a leopard-print bikini and a flowing maxi skirt while celebrating her second anniversary with Green. Hawaii is certainly a special place for the couple --they were married in a small beach ceremony there in 2010.

Though they've done their best to hide Fox's pregnancy, rumors that the couple was expecting a baby popped up earlier this year. This will be the couple's first child together, and the new addition will join Green's son, Kassius, 10.

In May, Green refused to confirm Fox's pregnancy, telling People that baby rumors have followed their relationship for years.

"They've been saying [she's pregnant] every three months ever since we got married, and it's sort of one of those things that they love to say," he said. "I think it's interesting. I think there is a part of Megan that people really love that is, at 18 she found a relationship and she stuck with it, and we've been together for coming on eight years now."

Check out a photo of Fox and Green below:

Megan Fox Lost The Baby Weight Without Working Out

2013-01-28T08:10:00.001-08:00

Is Megan Fox actively trying to get women to dislike her?

The 26-year-old gained a mere 23 pounds while pregnant with her first son, Noah, which explains why she barely looked pregnant at the end of nine months.

Fox revealed that she's already lost 13 of the pounds she gained while pregnant (though it's hard to believe she has any more weight to lose) and she did it without even hitting the gym.

"I can't work out yet because my body is still too fragile," Fox told Us Weekly at the Dec. 12 premiere of "This Is 40." "I try to eat whatever I want, but I don't eat any dairy, and I guess that's the biggest diet tip. Try and stay away from dairy -- especially if you're a woman! It's really hard on your hormones."

Fox and husband Brian Austin Green welcomed their first son together in September. Though Fox is a first-time mom, she had some parental experience as stepmom to Green's 10-year-old son, Kassius.

The actress has said she wants a big family, but she recently revealed she had terrible morning sickness and felt awful in the early stages of her pregnancy.

"It was so bad for me, actually, I thought I was maybe birthing a vampire baby," she joked to Jay Leno earlier this month. "I like that that was your first thought. 'You know, I’ll bet this is probably a vampire baby,'" Leno quipped.

Most Amazing Gadgets in the World

2013-01-13T22:04:00.000-08:00

Rubber Mobile

Optimus Tactus Keyboard

F1/Carbon GMT Concept Watch

Eizo C T-One – Both a Mouse & Remote Control

Tiny USB Webcam

Nokia BMW Video Phone

Alarm Clock Docking for iPhone

Toasty – Reto Toaster like a Cassette Deck

Glo Pillow – Stimulates Sunrise to Gently Wake you Up

Continue Plug

Live 22 – Phone of the Future

Volkswagen 2028

Spherical Mobile Office

Flameless Rechargeable USB Lighter

Audi RSQ

I am sure you haven’t seen most of these things anywhere near you yet. Some of them are just a concept design and haven’t made their way to the real world. Some will be available in few years down the line. But these gadgets give us a clear Idea how the world is going to be in just few years.

childhood celebrity face which changed a lot......

2012-12-21T22:31:00.000-08:00

Sean (Rider Strong) from "Boy Meets World:"

The Pink Ranger (Amy Jo Johnson) from "Might Morphin' Power Rangers:"

Brad Taylor (Zachery Ty Bryan) from "Home Improvement:"

Winnie Cooper (Danica McKellar) from "The Wonder Years:"

Sam (Sean O'Neal) from "Clarissa Explains It All:"

Kelly Kapowski (Tiffany Amber Thiessen) from "Saved By The Bell:"

Thackary Binx (Sean Murray) from "Hocus Pocus:"

Gary (Ross Hull) from "Are You Afraid Of The Dark:"

Harvey (Nate Richert) from "Sabrina The Teenage Witch:"

Tahj Mowry from "Smart Guy:"

Lisa Turtle (Lark Voorhies) from "Saved By The Bell:"

McCauley Culkin:

Carmen (Alexa Vega) from "Spy Kids:"

Mike Seaver (Kirk Cameron) from "Growing Pains:"

Jonathan Taylor Thomas:

Hunter Reeves (Will Estes) from "The Secret World Of Alex Mac:"

Ellen (Alison Fanelli) from "The Adventures Of Pete And Pete:"

Kimmy Gibler (Andrea Barber) from "Full House:"

Aaron Carter:

Soleil Moon Frye from "Punky Brewster:"

Andrew Keegan:

Benny "The Jet" Rodriguez (Mike Vitar) from "The Sandlot:"

Lisa (Kelly Lebrock) from "Weird Science:"

Haley Joel Osment:

Topanga (Danielle Fishel) from "Boy Meets World:"

Wendy Peffercorn (Marley Shelton) from "The Sandlot:"

Colt (Max Elliott Slade) from "3 Ninjas:"

Jeremy and Jason London:

Larisa Oleynik from "The Secret World Of Alex Mack:"

Devon Sawa:

Clarissa (Melissa Joan Hart) from "Clarissa Explains It All:"

Atreyu (Noah Hathaway) from "The Never-ending Story:"

And, just for good measure, here's Beans from "Even Stevens" looks like now:

Top 5 Celebrities' Winter Vacation Spots...

2012-12-21T22:05:00.001-08:00

Here’s where to find Brad and Angelina, Jay-Z and Beyoncé, Jerry Seinfeld, Fergie, and other A-list celebrities in the wintertime.

Question: If you’re Jennifer Lopez (the ninth-richest woman in entertainment with a net worth of $110 million), you have a $350 million fragrance and fashion empire, and your husband just bought ownership in the Miami Dolphins, where do you spend your winter vacations?
Answer: Anywhere you damn well please, of course. But for JLo, “winter getaway” has sometimes meant heading to the Mexican resort Las Ventanas, in Los Cabos.
It’s not surprising why: the luxurious Las Ventanas has the perfect formula for any traveler looking to escape a dreary winter. There’s a long, crowdless, milky-white beach that stretches for miles; giant suites with private Jacuzzis on big balconies overlooking the sea; and Mini Cooper convertibles and fully loaded Kindles to borrow.
But what really draws JLo (and fellow superstars like Leonardo DiCaprio, Charlize Theron, Adam Sandler, Fergie, Arnold Schwarzenegger, and Brad Pitt) is that the resort is private and remote. It doesn’t even have a sign. And when it comes to a getaway, “the number one thing celebrities look for is seclusion and privacy—places out of the reach of the paparazzi,” says noted wedding planner Mindy Weiss, who has organized nuptials for Jessica Simpson, Gwen Stefani, and Adam Sandler. Privacy at Las Ventanas begins at check-in, where there’s not even a desk. It’s handled in rooms so stars can come and go without being noticed.
Privacy is essential in cold-weather destinations, too, and part of Aspen’s appeal is that celebrities can just blend in—especially at places like the Little Nell. Right at the base of Aspen Mountain, the resort has been a celebrity hot spot for two decades, attracting the likes of Mariah Carey and Kate Hudson, who can mix in with minimal rubbernecking. “The celebrities really don’t stand out,” says Carol Hooper, the Little Nell’s head concierge, who has seen her share of A-listers eating burgers and going unnoticed during après ski, like any other guest. “They hang out in the lobby; they have lunch in the restaurants. They feel very comfortable here,” she says.
Another important element for stars: hotels that can handle any request. At the fashionable Setai in South Beach, which has played host to celebrities like Bono, Jay-Z, Beyoncé, and Leonardo DiCaprio, there’s a dedicated team of sales managers whose sole responsibility is to look after famous guests and be in touch with assistants and publicists. It’s one-stop shopping for anything the celebrity needs.
That person proved helpful a couple years ago, when an A-lister asked if one of the bedrooms could be converted into an exercise studio. No problem. And could the hotel bring a giant exercise ball? Done. And could that exercise ball be pink? Of course. The world’s best hotels get a lot of odd requests (see our story on outrageous concierge requests) but do their best to take care of their clientele—especially big names who are hibernating there for the winter.

Setai, South Beach, Miami

Wintertime Guests: Gisele and Tom Brady, Jay-Z, Beyonce, Leonardo DiCaprio, Bono.
Why They Like It: This South Beach hotel merges Zen Asian aesthetics with Art Deco chic (a nod to its South Beach setting). Antique bricks from Shanghai fill the lobby, which spills into an alfresco courtyard with soaring columns, pergolas, and ponds. Of course, celebrities flock to the 40th floor, four-bedroom, $30,000-a-night penthouse suite with a private rooftop infinity pool, Steinway piano, and two large Jacuzzi tubs encased in coral.
Celebrity Scoop: Hidden inside the hotel is a 2,500-square-foot ocean-view recording studio designed by Lenny Kravitz. Beyonce, Timbaland, and Mary J. Blige have laid tracks there.

Round Hill Hotels and Villas, Montego Bay, Jamaica

Wintertime Guests: Emma Thompson, Gabrielle Union, Ewan McGregor, Lance Armstrong, Michelle Williams, Nicole Miller, Mena Suvari, Patrick Dempsey, Shaggy, Russell Simmons, Sigourney Weaver, Paul McCartney.
Why They Like It: In the movie How Stella Got Her Groove Back, Stella found her mojo at Round Hill; many celebrities come here to do the same. Picture villas with horizon pools, mahogany beds, vaulted ceilings, wicker furnishings, and alfresco living rooms with sweeping ocean views. Each separately owned cottage has its master’s personality.
Celebrity Scoop: Owners include Ralph Lauren, Jamaican track star Merlene Ottey, and (at one point) Betsey Johnson. Every Christmas when he was married to Linda, Paul McCartney booked a master villa—maid, gardener, and cook included.

Parrot Cay, Turks and Caicos

Wintertime Guests: Demi Moore and Ashton Kutcher, Bruce Willis, Alex Rodriguez, Jerry and Jessica Seinfeld, Ben Affleck, Jennifer Garner.
Why They Like It: There are no cars on the 1,000-acre private isle; guests get around via golf cart. Airy rooms have whitewashed interiors, teak furnishings, four-poster beds, and terracotta floors, and there’s a one-mile-long white sand beach. And since the hotel can be reached only by boat, it offers celebrities a respite from the paparazzi.
Celebrity Scoop: Ben Affleck and Jennifer Garner married in the sand and then honeymooned on the property. Jerry and Jessica Seinfeld honeymooned here, too. Last December, Alex Rodriguez, Demi Moore, Ashton Kutcher, Bruce Willis, and Donna Karan rang in the New Year on the island.

Courtesy of Fairmont Chateau Whistler

Fairmont Chateau Whistler, Whistler, BC

Wintertime Guests: Heidi Klum and Seal, Justin Timberlake, Queen Latifah.
Why They Like It: Set at the base of Blackcomb Mountain, this 550-room luxury hotel offers ski-in, ski-out access along with (of course) great mountain views.

Celebrity Scoop: Queen Latifah likes to kick back at the resort’s Mallard Lounge. And in December 2004, the resort arranged for Seal and Heidi Klum to fly via helicopter to the top of a 14,000-foot glacier, reported People Magazine. When they arrived, he proposed in an igloo built just for the moment.

SIX PACKS IN A WEEK:

2012-12-21T03:37:00.000-08:00

Rope Cable Crunch

Kneel below a high pulley that contains a rope attachment. Grasp cable rope attachment and lower the rope until your hands are placed next to your face.

Flex your hips slightly and allow the weight to hyperextend the lower back. This will be your starting position. With the hips stationary, flex the waist as you contract the abs so that the elbows travel towards the middle of the thighs.

Exhale as you perform this portion of the movement and hold the contraction for a second. Slowly return to the starting position as you inhale.

Click Image To Enlarge.
Cable Crunch
Click Here For A Video Demonstration Of Cable Crunch.

Make sure that you keep constant tension on the abs throughout the movement. Do not choose a weight so heavy that the lower back handles the brunt of the work. This is about focusing on your abdominals.

You are going to do 5 sets of 20 reps with 90 seconds rest in between each set.

Reverse Crunch

Lie down on the floor with your legs fully extended and arms to the side of your torso with the palms on the floor. Your arms should be stationary for the entire exercise.

Move your legs up so that your thighs are perpendicular to the floor and feet are together and parallel to the floor. This is where you begin the movement.

While inhaling, move your legs toward the torso as you roll your pelvis backward and you raise your hips off the floor.

At the end of this movement your knees will be touching your chest. Hold the contraction for a second and move your legs back to the starting position while exhaling.

Click Image To Enlarge.
Reverse Crunch
Click Here For A Video Demonstration Of Reverse Crunch.

You are going to perform 5 sets of 20 reps with 90 seconds rest in between each set.

Seated Barbell Twist

Start out by sitting at the end of a flat bench with a barbell placed on top of your thighs. If you don't have a small barbell around and you can't perform this with a regular barbell use a weighted bar from the aerobics room or a broomstick.

Your feet should be shoulder width apart from each other. Grip the bar with your palms facing down and make sure your hands are wider than shoulder width apart from each other. Begin to lift the bar up over your head until your arms are fully extended.

Now lower the barbell behind your head until it is resting along the base of your neck. This is the starting position.

While keeping your feet and head stationary, move your waist from side to side so that your oblique muscles feel the contraction. Only move from side to side as far as your waist will allow you to go. Stretching or moving too far can cause an injury to occur. Use a slow and controlled motion.

Click Image To Enlarge.
Seated Barbell Twist
Click Here For A Video Demonstration Of Seated Barbell Twist.

Remember to breathe out while twisting your body to the side and in when moving back to the starting position.

You are going to do 5 sets of 40 reps each direction with 90 seconds rest in between each set.

Stomach Vacuum

You will perform these at the end of the workout. To begin, stand straight with your feet shoulder width apart from each other. Place your hands on your hips. This is the starting position.

Now slowly inhale as much air as possible and then start to exhale as much as possible while bringing your stomach in as much as possible and hold this position. Try to visualize your navel touching your backbone.

One isometric contraction is around 20 seconds. During the 20 second hold, try to breathe normally.

Then inhale and bring your stomach back to the starting position. Once you have practiced this exercise, try to perform this exercise for longer than 20 seconds. You can work your way up to 40-60 seconds. Rest for 30 seconds and repeat.

Click Image To Enlarge.
Stomach Vacuum

Do this three times and you are done.

I know what you are thinking. "That is only 200 reps." The reason why it is a 400-rep plan is you are going to do this twice a week. Train abs with the first day of your week and at least 72 hours later.

200 reps times twice a week makes 400 reps total! If you want to really improve your focus on the abs then train them on their own day once a week.

As long as you are following a good nutrition plan and performing cardio on a regular basis then you will see much more ab development within six to eight weeks with this plan.

SEM 3 DATA STRUCTURES 2 MARK QUESTIONS WITH ANSWER ANNA UNIVERSITY:

2012-12-21T03:26:00.000-08:00

DATA STRUCTURE

Department of Compute Science and Engineering Page 1

DEPARTMENT OF COMPUTER SIENCE AND ENGINEERING (UG & PG)
Second Year Computer Science and Engineering, 3rd Semester

2 Marks Question and Answer

Subject Code & Name: CS 2201 & DATA STRUCTURE
Prepared by: Prof.D.Amsa Sree Gayathri AP/CSE / P.Boopati L/CSE D.Prabakar Lecturer/CSE

UNIT –I
LINEAR STRUCTURES
1. What are the main objectives of Data structure?
• To identify and create useful mathematical entities and operations to determine what
classes of problems can be solved by using these entities and operations.
• To determine the representation of these abstract entities and to implement the
abstract operations on these concrete representation.
2. Need of a Data structure?
• To understand the relationship of one data elements with the other and organize it
within the memory.
• A data structures helps to analyze the data, store it and organize it in a logical or
mathematical manner.
3. Define data structure with example.
A data structure is a way of organizing data that considers not only the items stored but also
their relationship to each other.
e.g.: Arrays, Records etc.
e.g of complex data structure
Stacks, Queues, Linked list, Trees, Graphs.
4. Define abstract data type and list its advantages.
ADT is a set of operations.
DATA STRUCTURE
SNSCT – Department of Compute Science and Engineering Page 2
An abstract data type is a data declaration packaged together with the operations that are
meaning full on the data type.
Abstract Data Type
1. Declaration of data
2. Declaration of operations.
Advantages:
1. Easy to debug small routines than large ones.
2. Easy for several people to work on a modular program simultaneously.
3. A modular program places certain dependencies in only one routine, making
changes easier.
5. What are the two basic types of Data structures?
1. Primitive Data structure
Eg., int,char,float
2. Non Primitive Data Structure
i. Linear Data structure
Eg., Lists Stacks Queues
ii. Non linear Data structure
Eg., Trees Graphs
6. What are the four basic Operations of Data structures?
1. Traversing
2. Searching
3. Inserting
4. Deleting
7. List out the different ways to implement the list?
1. Array Based Implementation
2. Linked list Implementation
i. Singly linked list
ii. Doubly linked list
iii. Cursor based linked list
DATA STRUCTURE
SNSCT – Department of Compute Science and Engineering Page 3
8. Define singly linked list with neat diagram.
A singly linked list is a collection of nodes each node is a structure it consisting of an element
and a pointer to a structure containing its successor, which is called a next pointer.
The last cell’s next pointer points to NULL specified by
zero.
9. List the operations of single linked list.
MakeEmpty
IsEmpty
IsLast
Find
Delete
FindPrevious
Insert
Deletelist
Header
First
Advance
Retrieve
10. Write the routine for insertion operation of singly linked list.
/* Insert (after legal position P)*/
/* Header implementation assumed*/
/* Parameter L is unused in this implementation*/
Void
Insert (ElementType X, List L, Position P)
{
Position TmpCell;
DATA STRUCTURE
SNSCT – Department of Compute Science and Engineering Page 4
TmpCell=malloc(sizeof(struct Node));
if(TmpCell==NULL)
FatalError(“Out of space!!!”);
TmpCell->Element =X;
TmpCell->Next=P->Next;
P->Next=TmpCell;
}
11. Write the routine for deletion operation of singly linked list.
/* Delete first occurrence of x from a list*/
/* Assume use of a header node*/
Void
Delete(ElementType X, List L)
{
Position P, TmpCell;
P=FindPrevious(X, L);
if (! IsLast(P,L))
{
TmpCell=P->Next;
P->Next=TmpCell->Next;
Free(TmpCell);
}
}
12. List out the advantages and disadvantages of singly linked list.
Advantages:
1. Easy insertion and deletion.
2. Less time consumption.
Disadvantages:
DATA STRUCTURE
SNSCT – Department of Compute Science and Engineering Page 5
1. Data not present in a linear manner.
2. Insertion and deletion from the front of the list is difficult
without the use of header node.
13. Define doubly linked linked list with neat diagram.
Doubly linked list is a collection of nodes where each node is a structure containing the
following fields
1. Pointer to the previous node.
2. Data.
3. Pointer to the next node.
14. Define circularly linked list with neat diagram.
Circularly linked list is a collection of nodes , where each node is a structure containing the
element and a pointer to a structure containing its successor.
The pointer field of the last node points to the address of the first node. Thus the linked list
becomes circular.
15. Write the difference between Singly and doubly linked list.
Singly Doubly
It is a collection of nodes and each It is a collection of nodes and each
node is having one data field node is having one data field
and next link field one previous link field and
one next link field
The elements can be accessed The elements can be accessed using
DATA STRUCTURE
SNSCT – Department of Compute Science and Engineering Page 6
using next link both previous link as well as next link
No extra field is required hence, One field is required to store previous
Node takes less memory in SLL. Link Hence, node takes memory in DLL.
Less efficient access to elements More efficient access to elements.
16. Write the difference between doubly and circularly linked list.
Doubly Circularly
If the pointer to next node is Null, There is no first and last node.
it specifies the last node.
Last node’s next field is always Last nodes next field points to
Null the address of the first node.
Every node has three fields one is it can be a singly linked list
Pointer to the pervious node, next and doubly linked list.
Is data and the third is pointer to
the next node.
17. Write the difference between cursor and pointer implementation of singly linked list.
CURSOR IMPLEMENTATION POINTER IMPLEMENTATION
Global array is maintained for storing The data are stored in a collection
the data elements .The corresponding of structures. Each structure contains
index value for each data item represents data and a pointer to the next structure.
its address.
Collection of empty cells is maintained A new structure can be obtained from
in the form of a array from which cells the systems global memory by a call to
DATA STRUCTURE
SNSCT – Department of Compute Science and Engineering Page 7
can be allocated and also cells can be a malloc() and released by a call to
returned after use. free().
18. Define stack ADT with example.
A stack is a list with a restriction that insertions and deletions can be performed in only one
position namely the end of the list called the top.
e.g.: undo statement in text editor.
Pile of bills in a hotel.
19. State the operations on stack. Define them and give the diagrammatic representation.
Push
Pop
Top
Push: Push is performed by inserting at the top of stack.
Pop: pop deletes the most recently inserted element.
Top: top operation examines the element at the top of the stack and returns its
value.
20. Write the routine for push and pop of linked list.
/*routine for push*/
Void
Push(ElementType X,Stack S)
Stack S
Pop(S) Push(X,S)
Top(S)
DATA STRUCTURE
SNSCT – Department of Compute Science and Engineering Page 8
{
PtrToNode TmpCell;
TmpCell=malloc(sizeof(struct Node));
If(TmpCell==NULL)
FatalError(“out of space!!!”);
else
{
TmpCell->Element=x;
TmpCell->Next=s->Next;
S->Next=TmpCell;
}
}
/*Routine for pop*/
Void
Pop(stack S)
{
PtrToNode FirstCell;
If(IsEmpty(S))
Error(“Empty stack”);
Else
{
FirstCell=S->Next;
S->Next=S->Next->Next;
free(firstCell);
}
}
21. What is the purpose of top and pop?
DATA STRUCTURE
SNSCT – Department of Compute Science and Engineering Page 9
Top operation examines the element in the top of the list and returns its value. Pop operation
deletes the element at the top of the stack and decrements the top of the stack pointer by one.
22. State the disadvantages of linked list implementation of stack.
1. Calls to malloc and free functions are expensive.
2. Using pointers is expensive.
23. State the applications of stack.
1. Balancing parentheses.
2. Postfix Expression.
i. Infix to postfix conversion
3. Function calls.
24. Write the algorithm for balancing symbols.
1. Make an empty stack.
2. Read characters until end of file.
3. If the character is an opening symbol, then push it onto the stack.
4. If it is a closing symbol
Then
If the stack is empty
Report an error
Otherwise pop the stack
5.If the symbol popped is not the corresponding openinig symbol
Then
Report an error
6. If the stack is not empty at the end of file
Then
Report an error
DATA STRUCTURE
SNSCT – Department of Compute Science and Engineering Page 10
25. Give the Features of balancing symbols.
1. It is clearly linear.
2. Makes only one pass through the input.
3. It is online and quite fast.
4. It must be decided what to do when an error is reported.
26. Convert the given infix to postfix.
(j*k)+(x+y)
Ans:jk* xy++
27. Convert into postfix and evaluate the following expression.
(a+b*c)/d
a=2 b=4 c=6 d=2
Ans:
Post fix:
abc*+d/
Evaluation:
2 4 6 * +2/
=13
28. Write the features of representing calls in a stack.
1. When a function is called the register values and return address are saved.
2. After a function has been executed the register values are resumed on returning
to the calling statement.
3. The stack is used for resuming the register values and for returning to the
calling statement.
DATA STRUCTURE
SNSCT – Department of Compute Science and Engineering Page 11
4. The stack overflow leads to fatal error causing loss of program and data.
5. Recursive call at the last line of the program is called tail recursion and also
leads to error.
29. Define queue with examples.
Queue is a list in which insertion is done at one end called the rear and deletion is performed
at another called front.
e.g: Ticket counter.
Phone calls waiting in a queue for the operator to receive.
30. List the operations of queue.
Two operations
1. Enqueue-inserts an element at the end of the list called the rear.
2. Dequeue-delets and returns the element at the start of the list called as the front.
31. What are the prerequisites for implementing the queue ADT using array?
For each queue data structure the following prerequisites must be satisfied
1. Keep an array queue[ ].
2. The positions front and rear represents the ends of the queue.
3. The number of elements that are actually in the queue is kept trasck of using
‘size’.
32. How the enqueue and dequeue operations are performed in queue.
To enqueue an element X:
increment size and rear
set queue[rear]=x
To dequeue an element
DATA STRUCTURE
SNSCT – Department of Compute Science and Engineering Page 12
set the return value to queue[front].
Decrement size
Increment front
33. Write the routines for enqueue operation in queue.
Void
Enqueue(Element type X,Queue Q)
{
If(IsFull(Q))
Error(“Full queue”);
Else
{
Q->Size++;
Q->Rear=Succ(Q->Rear,Q);
Q->Array[Q->Rear]=X;
}
}
34. Write the routines for dequeue operation in queue.
Void Dequeue(Queue Q)
{
If(IsEmpty(Q))
Error(“Empty Queue”);
Else
Q->front++;
}
35. List the Applications of queue?
• Graph Algorithm
• Priority Algorithm
DATA STRUCTURE
SNSCT – Department of Compute Science and Engineering Page 13
• Job scheduling
• Categorizing Data
36. Define priority queue with diagram and give the operations.
Priority queue is a data structure that allows at least the following two operations.
1. Insert-inserts an element at the end of the list called the rear.
2. DeleteMin-Finds, returns and removes the minimum element in the priority
Queue.
Operations:
Insert
DeleteMin
37. Give the applications of priority queues.
There are three applications of priority queues
1. External sorting.
2. Greedy algorithm implementation.
3. Discrete even simulation.
4. Operating systems.
Priority Queue H
DeleteMin(H) Insert(H)
DATA STRUCTURE
SNSCT – Department of Compute Science and Engineering Page 14

UNIT II
TREE STRUCTURES

1. Define Tree .Give an example.
A tree is a collection of nodes .The collection can be empty .Otherwise a tree consists of a
distinguished node r called the root and 0 or more non empty sub-trees T1,T2,T3…………….Tk
each of whose roots are connected by a directed edge from r.
Eg: directory structure hierarchy
2. Define depth of a node in a tree. Give example.
For any node ni the depth of ni is the length of the unique path from the root to ni
eg:
root
T1 T2 T3 …………… TKK
a
b d
e f
c
DATA STRUCTURE
SNSCT – Department of Compute Science and Engineering Page 15
The depth of e is 2.
3. Define length of the path in a tree with an example.
Length of a path is the number of edges on the
path.
The length of the path from A-H is 3.
4. Define a path in a tree. Give example.
A path from a node n1 to nk is defined as the sequence of nodes n1, n2…..nk such that ni is the
parent of ni+1 for 1£i<k.
Eg:
A
D E
C
F G
H
B
A
D E
C
F G
H
B
DATA STRUCTURE
SNSCT – Department of Compute Science and Engineering Page 16
The path from A-H is A-B-D-H
5. Define height of the node in a tree. Give example.
The height of node ni the length of the longest path from ni to a leaf
Eg:
The height of node B is 2.
6. Write the routine for node declaration in trees.
typedef struct TreeNode *PtrToNode;
struct TreeNode
{
ElementType Element;
PtrToNode FirstChild;
PtrToNode NextSibling;
};
7. List the applications of trees.
A
D E
C
F G
H
B
DATA STRUCTURE
SNSCT – Department of Compute Science and Engineering Page 17
• Binary search trees
• Expression trees
• Threaded binary trees
8. Define Binary tree.
A Binary tree is a tree in which no node can have more than two children.
9. List the tree traversal applications.
1. Listing a directory in an hierarchal file system (preorder)
2. Calculating the size of a directory (post order)
10. Define binary tree ADT with an example.
A binary tree is a tree in which no node can have more than two children.
11. Define binary search tree?
Binary Search tree is a binary tree in which each internal node x stores an element
such that the element stored in the left sub tree of x are less than or equal to x and elements
stored in the right sub tree of x are greater than or equal to x. This is called binary-search-tree
12. List the Types of binary search trees
i) Performance comparisons
ii) Optimal binary search trees
13. List the Operations of binary search tree?
• Make Empty
• Find
• Insert
• Delete
• Search
• Display
14. Define Threaded Binary tree.
A
D E
C
F G
B
DATA STRUCTURE
SNSCT – Department of Compute Science and Engineering Page 18
A Threaded Binary Tree is a binary tree in which every node that does not have a right
child has a THREAD (in actual sense, a link) to its INORDER successor. By doing this
threading we avoid the recursive method of traversing a Tree, which makes use of stacks and
consumes a lot of memory and time.
15. List the uses of binary tree.
1. Searching.
2. Compiler design.
16. Draw the expression tree for the given postfix expression using stack.
AB*C+
17. Define binary search tree ADT with an example.
A binary search tree is a tree in which for every node X, the values of all the keys in its left
sub tree are smaller than the key value in X and the values of all the keys in its right sub tree are larger
than the key value in X.
A
B
1 2
A B
*
3
A B
* C
*
A B
C
+
4
DATA STRUCTURE
SNSCT – Department of Compute Science and Engineering Page 19
18. How deletion is performed in a binary search tree.
Once the node to be deleted is found there are three possibilities
1. If the node is a leaf, it can be deleted immediately.
2. If the node has one child the node can be deleted after its parent adjusts a
pointer to bypass the node.
3. If the node has two children the general strategy is to replace the data of this
node with the smallest data of the right sub tree and recursively delete the node
which is empty.
19. Define internal path length.
It is the sum of the depths of all nodes in a tree.
20. What is the average depth of all nodes in an equally likely tree?
The average depth of all nodes in an equally likely tree is O (log N).
21. List out the disadvantages of Binary search tree.
1. Deletions in a binary search tree leads to trees which are not equally likely.
2. Absence of balanced search tree.
3. The average depth is not O (log N) in trees which are not equally likely.
22. Define tree traversal.
Traveling through all the nodes of the tree in such a way that each node is visited exactly
once.
6
3 5
8
7 9
4
DATA STRUCTURE
SNSCT – Department of Compute Science and Engineering Page 20
23. List out the types of Tree traversal?
There are three types of tree traversal
1. Preorder traversal
2. Inorder traversal
3. Postorder traversal
24. Write the steps and routine for the postorder traversal.
Steps:
1. Traverse the left sub tree.
2. Traverse the right sub tree.
3. Visit the root.
Routine:
void postorder(node *temp)
{
if(temp!=NULL)
{
postorder(temp->left);
postorder(temp->right);
printf(“%d”,temp->data);
}
}
25. Write the steps and routine for the preorder traversal.
Steps:
1. Visit the root
2. Traverse the left sub tree.
3. Traverse the right sub tree.
Routine:
void preorder(node *temp)
{
DATA STRUCTURE
SNSCT – Department of Compute Science and Engineering Page 21
if(temp!=NULL)
{
printf(“%d”,temp->data);
preorder(temp->left);
preorder(temp->right);
}
}
26. Write the steps and routine for the inorder traversal.
Steps:
1. Traverse the left sub tree
2. Visit the root
3. Traverse the right sub tree.
Routine:
void inorder(node *temp)
{
if (temp!=NULL)
{
inorder(temp->left);
printf(“%d”,temp->data);
inorder(temp->right);
}
}
DATA STRUCTURE
SNSCT – Department of Compute Science and Engineering Page 22
27. Perform preorder traversal for the given tree.
ABDHECFG
28. Perform inorder traversal for the given tree.
FDBEAC
A
B C
D E
F
A
D E
C
F G
H
B
DATA STRUCTURE
SNSCT – Department of Compute Science and Engineering Page 23
29. Perform postorder traversal for the given tree.
FDEBCA
30. Define the following.
i) Leaf
Nodes at the bottommost level of the tree are called leaf nodes
ii) Sibling
The nodes with common parent are called Sibling
A
B C
D E
F
DATA STRUCTURE
SNSCT – Department of Compute Science and Engineering Page 24
UNIT III
BALANCED TREE
1. Define AVL Tree. Give Example.
An AVL Tree is a binary search tree with a balance condition, which is easy to maintain and
ensure that the depth of the tree is O(log N). Balance condition require that the left and the right
sub trees have the same height.
Example:
2. Define Balance factor.
The balance factor of a node in binary tree is defined to be hR- hL where hL and hR are heights
of left and right subtrees of T. For any node in AVL tree the balance factor should be 1,0 or -1.
A
D E
C
F
B
DATA STRUCTURE
SNSCT – Department of Compute Science and Engineering Page 25
3. Give the balance factor of each node for the following tree.
BF=-1
BF=1 BF=-1
BF=0 BF=0
BF=-1
BF=0
4. When AVL tree property is violated and how to solve it?
After insertion of any node in an AVL tree if the balance factor of any node becomes other
than -1,0, or 1 then it is said that AVL property is violated. So the node on the path from the
inserted node to the root needs to be readjusted. Check the balance factor for each node in the
path from inserted node to the root node and adjust the affected subtree such that the entire
subtree should satisfy the AVL property.
5. Mention the four cases to rebalance the AVL tree.
• An insertion of new node into Left subtree of Left child(LL).
• An insertion of new node into Right subtree of Left child(LR).
• An insertion of new node into Left subtree of Right child(RL).
• An insertion of new node into Right subtree of Right child(RR).
6. Define Rotation in AVL tree. Mention the two types of rotations.
A
D E
C
F
H
B
DATA STRUCTURE
SNSCT – Department of Compute Science and Engineering Page 26
Some modifications done on AVL tree in order to rebalance it is called Rotation of AVL tree.
The two types of rotations are
• Single Rotation
• Left-Left Rotation
• Right-Right Rotation
• Double Rotation
• Left-Right Rotation
• Right-Left Rotation
7. Define Splay Tree.
A splay tree is a self-balancing binary search tree with the additional property that recently
accessed elements are quick to access again. It performs basic operations such as insertion, lookup
and removal in O (log(n)) amortized time. For many non-uniform sequences of operations,
splay trees perform better than other search trees, even when the specific pattern of the sequence
is unknown.
8. List the Operations of Splay tree.
• Splaying
• Insertion
• Deleting
9. List the Operations on B-Trees.
• Search
• Create
• Insert
10. List the B-Trees Applications.
• Databases
• Concurrent Access to B-Trees
11. Define B-Tree.
A search tree that is not a binary tree is called B-Tree. That satisfies the follpwing structural
properties
• Root is either a leaf or has between 2 and M children
• All non leaf nodes except the root have between [M/2] and M children.
• All leafs are at the same depth.
12. Define binary heaps.
A binary heap is a heap data structure created using a binary tree. It can be seen as a binary
tree with two additional constraints:
DATA STRUCTURE
SNSCT – Department of Compute Science and Engineering Page 27
• The shape property: the tree is an almost complete binary tree; that is, all levels of the tree,
except possibly the last one (deepest) are fully filled, and, if the last level of the tree is not
complete, the nodes of that level are filled from left to right.
• The heap property: each node is greater than or equal to each of its children according to
some comparison predicate which is fixed for the entire data structure.
13. List the Operations on Binary heap.
• Adding to the heap
• Deleting the root from the heap
14. List the Applications of Binary heap
Heap sort
Selection Algorithm
Graph Algorithm
DATA STRUCTURE
SNSCT – Department of Compute Science and Engineering Page 28
UNIT –IV
HASHING AND SET
1. Define hashing.
It is the implementation of hash tables. Hashing is a technique used for performing insertions,
deletions and finds in constant average time.
2. Define a Key in hashing.
a. A key is a string with an associated value.
e.g:Salary information.
3. Define Hash table. Give an example.
The hash table data structure is an array of fixed size containing the keys.
4. Define table size of a hash table.
Table size is the size of the table and it is part of the hash data structure. The table
runs from 0 to Tablesize-1.
5. List the types of hash function.
1. Division method
2. Mid square
50
49
0
1
2
3
4
DATA STRUCTURE
SNSCT – Department of Compute Science and Engineering Page 29
3. Multiplicative hash function
4. Digit folding
5. Digit analysis
6. Define a Hash function with an example.
Hash function maps each key into some number in the range 0 to Tableaize-1and places the
key in the appropriate cell.
e.g:Key mod Tablesize is a basic hash function
7. Properties of a hash function.
1. Hash function should be simple to compute.
2. Should ensure that any two distinct keys get different cells.
3. It should distribute the keys evenly among the cells.
8. What is collision in hashing?
If an element is inserted and if it hashes to the same value as an already inserted
element collision takes place.
9. What are the methods of resolving collision in hashing?
1. Separate chaining hashing.
2. Open addressing hashing.
10. Define separate chaining hashing
Separate chaining means to keep a list of all elements that hash to the same value.
11. What are the operations of separate chaining?
1. Find
2. Insert
12. List out the applications of hashing.
1. DBMS.
2. Computer networks
3. Storage of secret data
4. Cryptography.
5. Securing the database
6. Database applications
7. Storing data in a database
13. What are the advantages of separate chaining?
1. Avoids collision by maintaining linked lists.
2. The link lists will be short if the table is large and the hash function is good.
14. What are the disadvantages of separate chaining?
1. Requires pointers.
2. Slows down the algorithm
3. Time is required to allocate new cells.
DATA STRUCTURE
SNSCT – Department of Compute Science and Engineering Page 30
4. Requires the implementation of a second data structure.
15. What is open addressing?
In open addressing if a collision occurs alternative cells are tried until an empty cell is found.
It is an alternative to resolving collisions with linked list.
(i.e.) h0(X),h1(X),………. Are tried in succession.
Where hi(X)=(Hash(X)+F(i))mod Tablesize with F(0)=0 where F is the collision resolution
strategy.
16. What are the types of open addressing hashing?
• Linear probing.
• Quadratic probing
• Double hashing
DATA STRUCTURE
SNSCT – Department of Compute Science and Engineering Page 31
17. Differentiate between linear probing and quadratic probing
Linear probing Quadratic probing
• Definition:
• It amounts to trying
cells sequentially with
wraparound in search
of an empty cell.
• Definition:
• It is a collision
resolution method that
eliminates the primary
clustering problem of
linear probing.
• Function:
• It is linear ( i.e.)F(i)=i
• Function:
• It is quadratic (i.e.)
F(i)=i2
• Advantages:
• 1.Does not use pointers
• No second data
structure
• 3. Time is not required
for allocating new
cells.
• Advantages:
• 1.Does not use pointers
• No second data
structure
• Time is not required
for allocating new
cells.
• If the table is half
empty and the table
size is prime then
inserting a new
element is successful
and guaranteed.
• No primary clustering.
• Disadvantages:
• Time for inserting is
quite large.
• Primary clustering.
• Linear probing is a bad
idea if the table is more
than half full.
• 4. Bigger table is
needed than separate
chaining.
• Disadvantages:
• There is no guarantee
of finding an empty
cell if the table gets
more than half full or if
the table size is not
prime.
• Bigger table is needed
than separate chaining.
• The number of
alternative locations is
severely reduced if the
table size is not prime.
DATA STRUCTURE
SNSCT – Department of Compute Science and Engineering Page 32
18. Define primary clustering.
It is the forming of blocks of occupied cells. It means that any key that hashes into the cluster
will require several attempts to resolve the collision and then it will add to the cluster.
19. Define double hashing.
It is a collision resolution method .For double hashing F(i)=i.hash2(X).
(i.e) a second hash function is applied to X and probing is done at a distance hash2(X),
2hash2(x)………. and so on.
20. Define rehashing.
Rehashing is the building of another table with an associated new hash function that is about
twice as big as the original table and scanning down the entire original hash table computing the
new hash value for each non deleted element and inserting it in the new table.
21. List out the advantages and disadvantages of rehashing.
Advantage:
• Table size is not a problem.
• Hash tables cannot be made arbitrarily large.
• Rehashing can be used in other data structures.
Disadvantage:
• It is a very expensive operation.
• The running time is 0(N).
• Slowing down of rehashing method.
22. What are the ways in which rehashing can be implemented.
1. Rehash as soon as the table is half full.
2. Rehash only when an insertion fails.
3. Middle of the road strategy is to rehash when the table reaches a certain load factor.
23. Define Extendible hashing.
Extendible hashing allows a find to be performed in two disk access and insertions also
require few disk accesses.
• 4. Standard deletion
cannot be performed.
DATA STRUCTURE
SNSCT – Department of Compute Science and Engineering Page 33
24. What is heap order property?
The smallest element should be at the root .Any node should be smaller than all of its
descendants.
25. What is meant by Expression Tree?
An expression tree is a binary tree in which the operands are attached as leaf nodes and
operators become the internal nodes.
26. List the applications of set.
i. Disjoint-set data structures model the partitioning of a set, for example to keep track of the
connected components of an undirected graph. This model can then be used to determine whether two
vertices belong to the same component, or whether adding an edge between them would result in a
cycle.
ii. This data structure is used by the Boost Graph Library to implement its Incremental
Connected Components functionality. It is also used for implementing Kruskal's algorithm to find the
minimum spanning tree of a graph.
27. Define Disjoint set.
A disjoint-set data structure is a data structure that keeps track of such a partitioning. A
union-find algorithm is an algorithm that performs two useful operations on such a data
structure:
• Find: Determine which set a particular element is in. Also useful for determining if two
elements are in the same set.
• Union: Combine or merge two sets into a single set.
DATA STRUCTURE
SNSCT – Department of Compute Science and Engineering Page 34
UNIT V
GRAPHS
1. Define Graph.
A Graph is defined as G = (V, E) where V is the set of vertices (nodes) and E is the
set of edges(arcs) connecting the vertices. An edge is represented as a pair of vertices (u,v).
V = {1, 2, 3, 4, 5}
E = {(1, 2),(1, 3),(1,4),(2,3)
(2,4),(2,5),(3,5)}
2. Define Directed Graph.
A Directed graph is a graph in which the edges are directed. It is also called Digraph.
V={1,2,3,4}
E={(1,2),(2,3),(2,4)
(3,1),(3,4),(4,3)}
3. What do you mean by Undirected Graph?
3
4 5
1
2
3
4
2
1
DATA STRUCTURE
SNSCT – Department of Compute Science and Engineering Page 35
Edges in the graph do not have directions marked. Such graphs are referred to as
undirected graphs.
V={1,2,3,4}
E={(1,2),(2,1),(2,3),(3,2)
2,4),(4,2),(3,4),(4,3),(3,1),(1,3)}
Define Symmetric Digraph.
Every edge has an edge in the reverse direction i.e for every edge (U,V) there is an
edge (V,U). Such type of graph is called Symmetric Digraph.
V={1,2,3,4}
E={(1,2),(2,1),(2,3),(3,2)
(2,4),(4,2),(3,4),(4,3),(3,1),(1,3)}
4. What do you mean by weighted graph?
Weighted graphs are such graphs where the edges are associated with weights. These
weights are used to mark the importance of edges in representing a problem.
3
4
1
2
3
4
2
3
DATA STRUCTURE
SNSCT – Department of Compute Science and Engineering Page 36
Ex. Road map represented as graph where the weight is the distance between two places.
18
10 15 V={1,2,3,4,5}
E={(1,2),(1,3),(1,4),(2,3)
20 (2,4),(2,5),(3,5)}
50
17 25
5. Define adjacent vertices.
Two vertices are said to be adjacent vertices if there is an edge between them.
Vertices 1&2, 2&3, 2&4, 3&4 are
adjacent vertices.
3
4 5
1
2
3
4
2
3
DATA STRUCTURE
SNSCT – Department of Compute Science and Engineering Page 37
6. Define path.
A Path between vertices (u,v) is a sequence of edges which connects vertices u & v.
The path between the vertices 1 and 4 is 1-2-4 or 1-3-4
7. Define Length of the Path.
Length of the path is the number of edges in a path which is equal to N-1.
N represents the number of vertices.
The Length of the path 1 -4 {(1,2),(2,3),(3,4) } is 3
{(1,3),(3,4)} is 2 and also {(1,2),(2,4)} is 2.
3
4
2
1
3
4
2
1
DATA STRUCTURE
SNSCT – Department of Compute Science and Engineering Page 38
9. Define cycle.
A Cycle in a graph is a path that starts and ends at the same vertex. i.e path in which
the first and last vertices are same.
Ex: {(3, 1), (1, 2),(2,4),(4,3)} is a
Cycle.
10. Define simple cycle.
Simple cycle means the vertex should not be repeated and the first and last vertex
should be the same.
Example: 1-2-4-3-1 is a simple cycle
1-2-3-4-3-1 is not a simple Cycle
3
4
2
1
3
4
2
1
DATA STRUCTURE
SNSCT – Department of Compute Science and Engineering Page 39
11. Define Simple Path.
All vertices are distinct, except that the first and last may or may not be the same.
Example: 1-2-4-3-1 is a simple path
1-2-3-4-3-1 is not a simple path
1-2-4-3 is a simple path
3
4
2
1
DATA STRUCTURE
SNSCT – Department of Compute Science and Engineering Page 40
12. Define Acyclic graph.
An acyclic graph is a graph with no cycle.
13. What do you mean by a strongly connected graph?
A Directed graph is strongly connected if there is a path from every vertex to every
other vertex.
14. What do you mean by weakly connected graph?
If the directed graph is not strongly connected, but the underlying graph ( without
direction to the arcs) is connected, then the graph is said to be weakly connected.
3
4
2
1
2 3
1
2 3
1
DATA STRUCTURE
SNSCT – Department of Compute Science and Engineering Page 41
15. Define complete graph.
A graph in which there is an edge between every pair of vertices.
16. Mention the ways of representing a graph?
a) Adjacency Matrix representation
b) Adjacency List representation
17.What do you mean by Adjacency Matrix representation?
The adjacency matrix M of a graph G = (V, E) is a matrix of order Vi xVj and the
elements of the unweighted graph M are defined as
M [i] [j] = 1, if (Vi, Vj) Î E
= 0 Otherwise
For a weighted graph the elements of M are defined as
M [i] [j] = Wij, if (Vi, Vj) Î E and Wij is the weight of edge (Vi, Vj)
= 0 Otherwise
Example:
1 2 3 4
1 0 1 1 1
2 0 0 0 1
3 0 0 0 1
4 0 1 0 0
18. What do you mean by adjacency List representation?
2 3
1
1 2
3 4
DATA STRUCTURE
SNSCT – Department of Compute Science and Engineering Page 42
It is an array of linked list ,for each vertex a linked list of all adjacent vertices is maintained.
19. What do you mean by indegree and outdegree of a graph?
• Indegree of a vertex in a graph is the number of incoming edges.
• Outdegree of a vertex is the number of edges that leaves the vertex.
Example:
1 2
3 4
1 2
3
1
2
2 3
4
2
3
DATA STRUCTURE
SNSCT – Department of Compute Science and Engineering Page 43
Indegree for the vertex 1 is 0, vertex 2 is 2, vertex 3 is 1, and vertex 4 is 2
Outdegree for the vertex 1 is 3, vertex 2 is 0, vertex 3 is 1, and vertex 4 is 1.
20. Define Topological sort.
Topological sort is defined as an ordering of vertices in a directed acyclic graph. such
that if there is a path from Vi to Vj, then Vj appears after Vi in the ordering.
21. Explain the principle of topological sort.
Find the vertex with no incoming edge.
Print the vertex and remove it along with its edges from the graph.
Apply the same strategy to the rest of the graph.
Finally all recorded vertices give topological sorted list.
22. What is the disadvantage of topological sort?
Ordering of vertices is not possible if the graph is a cyclic graph. Because if there are
two vertices v and w on the cycle, v proceeds w and w proceeds v, so ordering not unique.
23. What is the running time for topological sort?
The running time of the algorithm for topological sort is O( V 2).For the algorithm
using Queue, the running time is O ( E + V ) if adjacency list are used.
24. State the shortest path problem OR Single source shortest path problem.
Given as input a weighted graph or an unweighted graph G= (V, E) and a
distinguished vertex s , the shortest path problem is to find the shortest weighted or unweighted path
from s to every other vertex.
25. Explain weighted path length.
N-1
The cost of the path V1,V2….VN is S
Ci, i+1.
. This is referred to as the weighted path
length. i=1
26. Explain unweighted path length
DATA STRUCTURE
SNSCT – Department of Compute Science and Engineering Page 44
Unweighted path length is the number of edges on the path namely, N-1(where N is
the number of vertices).
27. What do you mean by Negative edge?
Negative edge means a graph having atleast one edge with a negative weight.
3 -10
6
28. What do you mean by negative cost cycle?
A graph having the shortest path with negative weight is known Negative cost cycle.
29. Give examples for problems solved by shortest path algorithm.
• Cheapest way of sending electronic news from one computer to another.
• To compute the best route
30. What is the running time for the weighted and unweighted shortest path?
The running time for the weighted shortest path is O ( E + V )
The running time for the Unweighted shortest path is O ( E log V )
31. What is the advantage of unweighted shortest path algorithm?
There is no calculation with weights. Only the number of edges on the shortest path is
found.
35. What are the applications of graphs?
1. Airport system
2. Street traffic
2 3
1
DATA STRUCTURE
SNSCT – Department of Compute Science and Engineering Page 45
36. What is a cyclic graph?
A graph which has atleast one cycle is called a cyclic graph.
37. What is a connected graph?
An undirected graph is connected is connected if there is a path frog every vertex to every other
vertex.
2 3
1
1
2 3
DATA STRUCTURE
SNSCT – Department of Compute Science and Engineering Page 46

Oops lab mannual for sem 3 anna university:

2012-12-21T02:56:00.001-08:00

Ex. No 1 Implementation of Static Data member, Default
Argument and Friend Function

Aim
To Write a C++ program for Students mark analysis using Static Data
member, Default Argument and Friend Function.

Algorithm
Step 1: Start the Process.
Step 2: Get the Students detail and calculate the Result analysis.
Step 3: Default value is assigned for pass in a function and the function is
assigned with default value when value for pass is not given in checking
for pass status.
Step 4: Declare the integer count as Static member each time when the student is
pass it will be incremented and finally specify pass count.
Step 5: The friend function display is used to access the private variables from
two classes and acting as the bridge between two classes.
Step 6: Stop the Process.

Program
#include<iostream.h>
#include<conio.h>
int cp(int,int,int,int=50);
void printline(char ch='*',int range= 70);
class per;
class acc
{i
nt rno,tot;
static int count;
int m1,m2,m3;
char name[20],grade;
float avg;
public:
void getdata()
{
cout<<"Enter id:";
cin>>rno;
cout<<"Enter name:";
cin>>name;
cout<<"Enter m1";
cin>>m1;
cout<<"Enter m2";
cin>>m2;
cout<<"Enter m3";
cin>>m3;
}friend void display(acc,per);
void cal()
{
tot=0;
if(cp(m1,m2,m3))
{
cout<<"Result=pass"<<endl;
tot=m1+m2+m3;
avg=tot/3;
count=count+1;
if(avg>=90)
grade='O';
if(avg>=70&&avg<90)
grade='A';
if(avg>=50&&avg<70)
grade='B';
}
else
{
cout<<"Result=Fail"<<endl;
}}
static void showcount(void)
{
cout<<endl;
cout<<"count:"<<count;}};
int acc::count;
class per
{
char add[25];
long tel;
public:
void getdata1()
{
cout<<"Enter address";
cin>>add;
cout<<"Enter phoneno:";
cin>>tel;
}
friend void display(acc a,per p)
{
cout<<endl;
cout<<"Name:"<<a.name<<endl;
cout<<"ID:"<<a.rno<<endl;
cout<<"Address:"<<p.add<<endl;
cout<<"Phone no.:"<<p.tel<<endl;
cout<<"M1:"<<a.m1<<endl;
cout<<"M2:"<<a.m2<<endl;
cout<<"M3:"<<a.m3<<endl;
if(cp(a.m1,a.m2,a.m3))
{
cout<<"Total:"<<a.tot<<endl;
cout<<"Average:"<<a.avg<<endl;
cout<<"Grade:"<<a.grade<<endl;
}}};
int cp(int m1,int m2,int m3,int pass1)
{
if(m1>=pass1&&m2>=pass1&&m3>=pass1)
return(1);
else
return(0);
}
void main()
{
int i,n;
clrscr();
per p1[20];
acc a1[20];
cout<<"Enter no of students:";
cin>>n;
for(i=0;i<n;i++)
{
a1[i].getdata();
p1[i].getdata1();
a1[i].cal();
}
for(i=0;i<n;i++)
{
printline('-');
display(a1[i],p1[i]);
printline();
}
acc::showcount();
getch();
}
void printline(char ch,int range)
{
int i;
cout<<endl;
for(i=0;i<range;i++)
cout<<ch;}
Output
Enter no of students:2
Enter id:2
Enter name:rahul
Enter m1:78
Enter m2:90
Enter m3:67
Enter address:coimbatore
Enter phoneno:230000
Result=pass
Enter id:5
Enter name:aravind
Enter m1:56
Enter m2:45
Enter m3:78
Enter address:madurai
Enter phoneno:456789
Result=Fail
-----------------------------------------------------------
Name:rahul
ID:2
Address:coimbatore
Phone no.:230000
M1:78
M2:90
M3:67
Total:235
Average:78
Grade:A
***********************************************************
-----------------------------------------------------------
Name:aravind
ID:5
Address:madurai
Phone no.:456789
M1:56
4
Yolearn
http://www.yolearn.net
the network of education
M2:45
M3:78
***********************************************************
count:1
Result
Thus the program to perform Students mark analysis using Static Data
member, Default Argument and Friend Function was implemented.

Ex. No 2 Implementation of complex number class with operator
overloading and type conversions

Aim
To write a C++ program to implement complex number class with
operator overloading and type conversions such as integer to complex, double to
complex, complex to double.

Algorithm
Step 1: Start the program.
Step 2: Create a class with necessary data members and member functions.
Step 3: Create a constructor to initialize the variables.
Step 4: Perform addition of two numbers overloading the necessary operators.
Step 5: Create an object for the Complex class and call the required functions to
perform the action.
Step 6: Perform the type conversion from double to complex, integer to complex
and complex to double.
Step 7: Display the result.
Step 8: Stop the program.

Program
#include<iostream.h>
#include<conio.h>
#include<math.h>
class complex
{
float real,img,temp;
public:
complex()
{
real=img=0;
}
complex(int a)
{
real=a;
img=0;
}
complex(double a1)
{
real=a1;
img=0.0;
}
void outdata()
{i
f(img>=0.0)
{
cout<<real<<"+"<<img<<"i";
}
else
{
cout<<real<<img<<"i";
}}
complex operator+(complex c)
{
complex temp;
temp.real=real+c.real;
temp.img=img+c.img;
return(temp);
}
complex operator-(complex c)
{
complex temp1;
temp1.real=real-c.real;
temp1.img=img-c.img;
return(temp1);
}
complex operator*(complex c)
{
complex temp2;
temp2.real=real*c.real-img*c.img;
temp2.img=real*c.img+img*c.real;
return(temp2);
}
complex operator/(complex c)
{
complex temp3;
temp3.real=(((real*c.real)+(img*c.img))/((c.real*c.real)+(c.img*c.img)));
temp3.img=(((img*c.real)-(real*c.img))/((c.real*c.real)+(c.img*c.img)));
return(temp3);
}
operator double()
{
double magnitude;
magnitude=sqrt(pow(real,2)+pow(img,2));
return magnitude;
}}
;
void main()
{
clrscr();
complex c1,c2,c3,c4,c5,c6;
int real;
double real1;
cout<<"Enter the real number";
cin>>real;
c1=real;
cout<<"Integer to complex conversion"<<endl;
cout<<"Enter the real number";
cin>>real1;
c2=real1;
cout<<"Double to complex conversion"<<endl;
c3=c1+c2;
c4=c1-c2;
c5=c1*c2;
c6=c1/c2;
cout<<"\n\n";
cout<<"addtion result is:";
c3.outdata();
cout<<"\n\n";
cout<<"subraction result is:";
c4.outdata();
cout<<"\n\n";
cout<<"multiplication result is:";
c5.outdata();
cout<<"\n\n";
cout<<"division result is:";
c6.outdata();
cout<<"Conversion from complex to double"<<endl;
double mag=c3;
cout<<"Magnitude of a complex number"<<mag;
getch();
}

Output
Enter the real number:2
Integer to complex conversion
Enter the real number:2.0
Double to complex conversion
addtion result is:4+0i
subraction result is:0+0i
multiplication result is:4+0i
division result is:1+0i
Conversion from complex to double
Magnitude of a complex number:4

Result
Thus the program to implement complex number class with operator
overloading and type conversions such as integer to complex, double to complex,
complex to double is implemented.

Ex. No 3 Implement the Matrix Class using Constructor, Destructor,Copy
Constructor, Overloading assignment operator

Aim
To Write a C++ program to Implement Matrix Class using Constructor,
Destructor, Copy Constructor, Overloading assignment operator

Algorithm
Step 1: Start the Process.
Step 2: Create the class name as MATRIX.
Step 3: Declare the data member and member function.
Step 4: Declare constructor, destructor and copy constructor
Step 5: Display the result.
Step 6: Stop the process.

Program
#include<iostream.h>
#include<conio.h>
class matrix
{
private:
int row;
int col;
int **p;
public:
matrix() //Constructor
{
row=col=0;
p=NULL;
}
matrix(int r,int c);
~matrix(); //Destructor
void read();
void show();
void add(matrix &a,matrix &b);
void sub(matrix &a,matrix &b);
void operator =(matrix &m1)
{
row=m1.row;
col=m1.col;
p=new int *[m1.row]; //dynamic allocation
for(int i=0;i<m1.row;i++)
{
p[i]=new int[m1.col];//dynamic allocation
}}
matrix(matrix &m2)//copy construtor
{
row=m2.row;
col=m2.col;
p=new int *[m2.row]; //dynamic allocation
for(int i=0;i<m2.row;i++)
{
p[i]=new int[m2.col];//dynamic allocation
}
for(i=0;i<m2.row;i++)
for(int j=0;j<m2.col;j++)
{
p[i][j]=m2.p[i][j];
}}}
; matrix::matrix(int r,int c)
{
row=r;
col=c;
p=new int *[row]; //dynamic allocation
for(int i=0;i<row;i++)
p[i]=new int[col];//dynamic allocation
}
matrix::~matrix()
{
for(int i=0;i<row;i++)
delete p[i];
delete p;
}
void matrix::add(matrix &a,matrix &b)
{i
nt i,j;
row=a.row;
col=b.col;
for(i=0;i<row;i++)
for(j=0;j<col;j++)
p[i][j]=a.p[i][j]+b.p[i][j];
}
void matrix::sub(matrix &a,matrix &b)
{i
nt i,j;
row=a.row;
col=b.col;
for(i=0;i<row;i++)
for(j=0;j<col;j++)
p[i][j]=a.p[i][j]-b.p[i][j];
}
void matrix::read()
{int i,j;
10
Yolearn
http://www.yolearn.net
the network of education
for( i=0;i<row;i++)
for( j=0;j<col;j++)
{
cout<<"Matrix["<<i<<","<<j<<"]=";
cin>>p[i][j];
}}
void matrix::show()
{
int i,j;
for(i=0;i<row;i++)
{
cout<<endl;
for( j=0;j<col;j++)
{
cout<<p[i][j]<<"\t";
}
}
}
void main()
{i
nt m,n,p,g,q;
clrscr();
cout<<"Enter the A matrix"<<endl;
cout<<"How many rows?";
cin>>m;
cout<<"How many col?";
cin>>n;
matrix a(m,n);
a.read();
matrix b;
b=a;//overloading assignment operator
cout<<”Overloading assignment operator Invoked”<<endl;
cout<<”Enter the B matrix”;
b.read();
cout<<"Matrix A is ..";
a.show();
cout<<endl<<"Matrix B is..";
b.show();
matrix c(m,n);
c.add(a,b);
cout<<endl<<"c=a+b..";
c.show();
matrix d(m,n);
d.sub(a,b);
cout<<endl<<"d=a-b..";
d.show();
cout<<"\nCopy constructor invoked"<<endl;
matrix e(d);//Copy Constructor
e.show();
getch();
}

Output
Enter the A matrix
How many rows?2
How many col?2
Matrix[0,0]=2
Matrix[0,1]=2
Matrix[1,0]=2
Matrix[1,1]=2
Overloading assignment operator Invoked
Enter the B matrix
Matrix[0,0]=1
Matrix[0,1]=1
Matrix[1,0]=1
Matrix[1,1]=1
Matrix A is ..
2 2
2 2
Matrix B is..
1 1
1 1
c=a+b..
3 3
3 3
d=a-b..
1 1
1 1
Copy constructor invoked
1 1
1 1

Result
Thus the C++ program to Implement Matrix Class using Constructor,
Destructor, Copy Constructor, Overloading assignment operator is implemented.

Ex. No 4 Overloading of new and delete operators for addition of
vector elements

Aim
To write a C++ program to Overload the new and delete operators for
addition of vector elements to provide custom dynamic allocation of memory.

Algorithm
Step 1: Start the program.
Step 2: Declare the necessary function prototype.
Step 3: Define void *operator new (), void operator delete () functions to allocate
storage and to delete the memory with the help of malloc and free
functions respectively.
Step 4: read () and sum () functions to get and calculate the vector addition.
Step 5: Stop the program.

Program
#include<iostream.h>
const int asize=10;
class vector
{i
nt *a;
public:
void * operator new(size_t )
{
vector *v;
v=::new vector;
v->a=new int[asize];
return v;
}
void operator delete(void *vec)
{
vector *v;
v=(vector *)vec;
delete(int*) v->a;
::delete vec;
}
void read()
{f
or(int i=0;i<asize;i++)
{
cin>>a[i];
}}i
nt sum()
{i
nt sum=0;
for(int i=0;i<asize;i++)
{
sum+=a[i];
}
return sum;
}}
;
void main()
{
vector *v=new vector;
cout<<”Enter the vector elements”;
v->read();
cout<<”the sum of vector elements”<<v->sum();
delete v;
}

Output
Enter the vector elements 10
10
10
10
10
10
10
10
10
10
The sum of vector elements: 100

Result
Thus the program to Overload the new and delete operators for
addition of vector elements to provide custom dynamic allocation of memory is
implemented.

Ex. No 5 Implementation of Template for Linked List Class
with necessary methods

Aim
To write a C++ program to implement the template of linked list class.

Algorithm
Step1: Start the program.
Step2: Create an emp and linked list class, declare necessary data members.
Also create a node structure with template based variables and link field.
Include necessary constructor, member function and destructor.
Step3: Define constructor linklist() to initialize the variable. Define
member function such as., void append(T),void addatbeg(T),void
addafter(int,T),void del(int),void display(),int count() to perform various
operation in the linked list.
Step4: Use destructor ~linklist() to destroy the allocated memory.
Step5: Create required objects to call the necessary function to perform all the
operations.
Step6: Display the result.
Step7: Stop the program.

Program
#include<iostream.h>
#include<string.h>
#include<iostream.h>
class emp
{
private:
char name[20];
int age;
float sal;
public:
emp(char *n="",int a=0,float s=0.0)
{
strcpy(name,n);
age=a;
sal=s;
}f
riend ostream&operator<<(ostream &s,emp &e);
};
ostream&operator<<(ostream &s,emp &e)
{
cout<<e.name<<'\t'<<e.age<<'\t'<<e.sal;
return s;
}t
emplate<class T>
class linklist
{
private:
struct node
{
T data;
node *link;
}*p;
public:
linklist();
void append(T);
void addatbeg(T);
void addafter(int,T);
void del(int);
void display();
int count();
~linklist();
};
template<class T>
linklist<T>::linklist()
{
p=NULL;
}
//Adds a new node at the end of the linked list
template<class T>
void linklist<T>::append(T num)
{
node *q,*t;
//if the list is empty
if(p==NULL)
{
//create first node
p=new node;
p->data=num;
p->link=NULL;
}
else
{
//go to the last node
q=p;
while(q->link!=NULL)
q=q->link;
//add node at the end
t=new node;
t->data=num;
t->link=NULL;
q->link=t;
}}
//adds a new node at the beginning of the linked list
template<class T>
void linklist<T>::addatbeg(T num)
{
node *q;
//add new node
q=new node;
q->data=num;
q->link=p;
p=q;
}
//adds a new node after the specified number of nodes
template<class T>
void linklist<T>::addafter(int c,T num)
{
node *q,*t;
int i;
//skip to the desired portion
17
Yolearn
http://www.yolearn.net
the network of education
for(i=0;q=p,i<=c;i++)
{
q=q->link;
//if end of linked list is encountered
if(q==NULL)
{
cout<<endl<<"There are less than"<<c<<"elements.";
return;
}}
//insert new node
t=new node;
t->data=num;
t->link=q->link;
q->link=t;
}
//deletes the specified node from the linked list
template<class T>
void linklist<T>::del(int n)
{
node *q,*r;
int i=1;
q=p;
//if node to be deleted is first node
if(n==1)
{
p=q->link;
delete q;
return;
}
//traverse list till the last but one node is reached
r=q;
while(q!=NULL)
{i
f(i==n)
{
r->link=q->link;
//free the memory occupied by the node
delete q;
return;
}
r=q;
q=q->link;
i++;
}
cout<<endl<<"Element"<<n<<"not found";
}//displays the contents of the linked list
template<class T>
void linklist<T>::display()
{
node *q;
cout<<endl;
//traverse the entire linked list
for(q=p;q!=NULL;q=q->link)
cout<<q->data<<endl;
}//counts number of nodes present in the linked list
template<class T>
int linklist<T>::count()
{
node *q;
int c=0;
//traverse the entire linked list
for(q=p;q!=NULL;q=q->link)
c++;
return(c);
}//destroys the linked list object
template<class T>
linklist<T>::~linklist()
{
node *t;
while(p!=NULL)
{t
=p;
p=p->link;
delete t;
}}
void main()
{l
inklist<int>l1;
cout<<endl<<"No.of elements in Linked list="<<l1.count();
l1.append(11);
l1.append(22);
l1.append(33);
l1.append(44);
l1.append(55);
l1.append(66);
l1.addatbeg(100);
l1.addatbeg(200);
l1.addafter(3,333);
l1.addafter(6,444);
l1.display();
cout<<endl<<"No.of elements in linked list="<<l1.count();
l1.del(200);
l1.del(66);
l1.del(0);
l1.del(333);
l1.display();
cout<<endl<<"No.of elements in linked list="<<l1.count();
linklist<emp>l2 ;
cout<<endl<<"No.OF elements in linked list="<<l2.count();
emp e1("Sanjay",23,1100.00);
emp e2("Sachin",33,3500.00);
emp e3("Sourav",24,2400.00);
emp e4("Sanket",25,2500.00);
emp e5("Sandeep",26,2600.00);
l2.append(e1);
l2.append(e2);
l2.append(e3);
l2.append(e4);
l2.append(e5);
l2.display();
l2.del(3);
l2.display();
cout<<endl<<"No.of elements in linked list="<<l2.count();
l2.addatbeg(e5);
l2.display();
l2.addafter(3,e1);
l2.display();
cout<<endl<<"No.of elements in linked list="<<l2.count();
}

Output
No.of elements in linked list =0
200
444
100
333
11
22
33
44
55
66
No.of elements in linked list=10
Element200not found
Element66not found
Element0not found
Element333not found
200
444
333
100
11
22
33
44
55
66
No.of elements in linked list=10
No.OF elements in linked list=0
Sanjay 23 1100
Sachin 33 3500
Sourav 24 2400
Sanket 25 2500
Sandeep 26 2600
Sanjay 23 1100
Sachin 33 3500
Sanket 25 2500
Sandeep 26 2600
No.of elements in linked list=4
Sandeep 26 2600
Sanjay 23 1100
Sachin 33 3500
Sanket 25 2500
Sandeep 26 2600
Sandeep 26 2600
Sanjay 23 1100
Sanjay 23 1100
Sachin 33 3500
Sanket 25 2500
Sandeep 26 2600
No.of elements in linked list=6

Result
Thus the program to implement the template of linked list class is
implemented.

Ex. No 6 Generating Templates for standard sorting
algorithms

Aim
To write a C++ program to implement the Templates of standard sorting
algorithms such as bubble sort, insertion sort, merge sort, and quick sort

Algorithm
Step 1: Start the Process.
Step 2: Create the template to handle bubble sort, insertion sort, and
quick sort, merge sort.
Step 3: Get the element using for loop.
Step 4: Call the template function for sorting.
Step 5: Display the result.
Step 6: Stop the process.

Program
#include<iostream.h>
#include<conio.h>
int a[20];
enum Boolean{false,true};
void merge(int,int,int);
//Bubble Sort
template<class T>
void swap(T &x,T&y)
{
T t;
t=x;
x=y;
y=t;
}t
emplate<class T>
void bubb(T &s,int size)
{
Boolean swapped=true;
for(int i=0;(i<size-1)&&swapped;i++)
{
swapped=false;
for(int j=0;j<(size-1)-i;j++)
if(s[j]>s[j+1])
{
swapped=true;
swap(s[j],s[j+1]);
}}}
//Merge Sort
Template<class T>
void merge_sort(int low,int high)
{
int mid;
if(low<high)
{
mid=(low+high)/2;
merge_sort(low,mid);
merge_sort(mid+1,high);
merge(low,mid,high);
}
}
void merge(int low,int mid,int high)
{
int h,i,j,b[50],k;
h=low;
i=low;
j=mid+1;
while((h<=mid)&&(j<=high))
{
if(a[h]<=a[j])
{
b[i]=a[h];
h++;
}
else
{
b[i]=a[j];
j++;
}
i++;
}
if(h>mid)
{
for(k=j;k<=high;k++)
{
b[i]=a[k];
i++;
}
}
else
{
for(k=h;k<=mid;k++)
{
b[i]=a[k];
i++;
}
}
for(k=low;k<=high;k++) a[k]=b[k];
}
//Insertion Sort
template<class T>
void insertionsort(T numbers[], int array_size)
{
T i, j, index;
for (i=1; i < array_size; i++)
{
index = numbers[i];
j = i;
while ((j > 0) && (numbers[j-1] > index))
{
numbers[j] = numbers[j-1];
j = j - 1;
}
numbers[j] = index;
}
}
//Quick Sort
template<class T>
int Partition(int low,int high,T arr[])
{ T pivot,high_vac,low_vac;
pivot=arr[low];
while(high>low)
{
high_vac=arr[high];
while(pivot<high_vac)
{
if(high<=low) break;
high--;
high_vac=arr[high];
24
Yolearn
http://www.yolearn.net
the network of education
}
arr[low]=high_vac;
low_vac=arr[low];
while(pivot>low_vac)
{
if(high<=low)
break;
low++;
low_vac=arr[low];
}
arr[high]=low_vac;
}
arr[low]=pivot;
return low;
}t
emplate<class T>
void Quick_sort(int low,int high,T arr[])
{
int Piv_index;
if(low<high)
{
Piv_index=Partition(low,high,arr);
Quick_sort(low,Piv_index-1,arr);
Quick_sort(Piv_index+1,high,arr);
}
}
void main()
{i
nt num[25],temp[25];
float floatnum[25];
int i,size,ch;
clrscr();
cout<<"Program to sort.."<<endl;
cout<<"enter the size of interger and float:";
cin>>size;
cout<<"Enter the integer element"<<endl;
for(i=0;i<size;i++)
cin>>num[i];
cout<<"Enter the float element"<<endl;
for( i=0;i<size;i++)
cin>>floatnum[i];
do
{
cout<<"Sorting"<<endl;
cout<<"1.Merge Sort\n2.Quick sort\n3.Insertion sort\n4.Bubble
sort\n5.Float bubble sort\n6.Float insertion sort\n7.Float quick
sort\n8.Exit"<<endl;
cout<<"Enter your choice:";
cin>>ch;
switch(ch)
{
case 1:
merge_sort(0,size);
cout<<"sorted vector:"<<endl;
for(i=0;i<size;i++)
cout<<num[i]<<"\n";
break;
case 2:
Quick_sort(0,size-1,num);
cout<<"sorted vector:"<<endl;
for(i=0;i<size;i++)
cout<<num[i]<<"\n";
break;
case 3:
insertionsort(num,size);
cout<<"sorted vector:"<<endl;
for(i=0;i<size;i++)
cout<<num[i]<<"\n";
break;
case 4:
bubb(num,size);
cout<<"sorted vector:"<<endl;
for(i=0;i<size;i++)
cout<<num[i]<<"\n";
break;
case 5:
bubb(floatnum,size);
cout<<"sorted vector:"<<endl;
for(i=0;i<size;i++)
cout<<floatnum[i]<<"\n";
break;
case 6:
insertionsort(floatnum,size);
cout<<"sorted vector:"<<endl;
for(i=0;i<size;i++)
cout<<floatnum[i]<<"\n";
break;
case 7:
Quick_sort(0,size-1,floatnum);
cout<<"sorted vector:"<<endl;
for(i=0;i<size;i++)
cout<<floatnum[i]<<"\n";
break;
case 8:
break;
}}
while(ch<8);
getch();
}

Output
Program to sort..
enter the size of interger and float:5
Enter the integer element
31240
Enter the float element
3.4
1.2
5.6
2.1
4.5
Sorting
1.Merge Sort
2.Quick sort
3.Insertion sort
4.Bubble sort
5.Float bubble sort
6.Float insertion sort
7.Float quick sort
8.Exit
Enter your choice:2
sorted vector:
01234 Sorting
1.Merge Sort
2.Quick sort
3.Insertion sort
4.Bubble sort
5.Float bubble sort
6.Float insertion sort
7.Float quick sort
8.Exit
Enter your choice:7
1.2
2.1
3.4
4.5
5.6
Sorting
1.Merge Sort
2.Quick sort
3.Insertion sort
4.Bubble sort
5.Float bubble sort
6.Float insertion sort
7.Float quick sort
8.Exit
Enter your choice:8

Result
Thus the program to implement the Templates of standard sorting
algorithms such as bubble sort, insertion sort, merge sort, and quick sort is
implemented.

Ex. No 7a Design of Stack classes with necessary
Exception handling

Aim
To write a C++ program to implement the stack class with necessary
exception handling.

Algorithm
Step 1: Start the Process
Step 2: Create the class for stack.
Step 3: Declare the member function for push and pop operation.
Step 4: Push operation to insert the element.
Step 5: Pop operation to delete the element.
Step 6: Stop the Process.

Program
#include<iostream.h>
#define MAX 5
class stack
{
protected:
int arr[MAX];
public:
int item;
int top;
stack()
{t
op=0;
}
class overflowException{};
void push(int a)
{
cout<<top;
if(top<MAX)
{t
op++;
arr[top]=a;
}
else
{throw overflowException();
}}
class underflowException{};
int pop()
{if(top==0)
{throw underflowException();
}
else
{i
nt data=arr[top];
top--;
return data;
}
}}
;
int main()
{
char ch;
int choice;
stack a;
do
{
cout<<”1.Push\n2.Pop<<end1;
cout<<"Enter the choice";
cin>>choice;
switch(choice)
{
case 1:
try
{
cout<<"enter the item";
cin>>a.item;
a.push(a.item);
cout<<”Item pushed”;
}
catch(stack::overflowException )
{
cout<<"Stack overflow";
}
break;
case 2:
try
{
cout<<”Item Popped:”<<a.pop();
}
catch(stack::underflowException)
{
cout<<"Stack is empty";
}
break;
}
cout<<"do u want to continue";
cin>>ch;
}
while(ch=='y');
30
Yolearn
http://www.yolearn.net
the network of education
return 0;
}

Output
1.Push
2.Pop
Enter the choice:1
enter the item:2
Item pushed
do u want to continue Y
1.Push
2.Pop
Enter the choice:1
enter the item:3
Item pushed
do u want to continue Y
1.Push
2.Pop
Enter the choice:2
Item Popped:3
do u want to continue n

Result
Thus the program to implement the stack class with necessary exception
handling is implemented.

Ex. No 7b Designing of Queue classes with necessary
Exception handling

Aim
To write a C++ program to implement the Queue class with necessary
exception handling.

Algorithm
Step 1: Start the Process
Step 2: Create a class for queue.
Step 3: Declare the member function for front and rear operation.
Step 4: Provide necessary exception handling for stack and queue.
Step 5: Display the result.
Step 6: Stop the Process

Program
#include<iostream.h>
class que
{i
nt size;
int arr[5];
int rear,front;
int data;
public:
que()
{
size=5;
rear=-1;
front=-1;
}
class quefullException{};
void enque(int data)
{i
f(rear+1>=size)
{
throw quefullException();
}
else
{
if(rear==-1&&front==-1)
{
front++;
}
rear++;
cout<<"rear"<<rear;
arr[rear]=data;
cout<<arr[rear];
}}
class queEmptyException{};
int deque()
{i
f(front>rear)
{
throw queEmptyException();
}
return(arr[front++]);
}}
;
int main()
{
que q;
char choice;
do
{
Cout<<”1.Insert\n2.Delete”<<endl;
cout<<"enter the choice:";
int ch;
cin>>ch;
switch(ch)
{
case 1:
try
{
cout<<"enter the element to insert";
int item;
cin>>item;
q.enque(item);
cout<<“Item inserted”;
}
catch(que::quefullException)
{
cout<<"Queue is full";
}
break;
case 2:
try
{
cout<<"the deleted item from queue"<<q.deque();
}
catch(que::queEmptyException)
{
cout<<"queue is empty";
}
break;
}
cout<<"continue(y/n)";
cin>>choice;
}while(choice=='y');
}

Output
1.Insert
2.Delete
Enter the choice:1
enter the element to insert :2
Item inserted
continue (y/n)y
1.Insert
2.Delete
Enter the choice:1
enter the element to insert :3
Item inserted
continue (y/n)y
1.Insert
2.Delete
Enter the choice:2
the deleted item from queue:2
continue (y/n)n

Result
Thus the program to implement the Queue class with necessary exception
handling is implemented.

Ex. No 8 Implementation of Graph for calculating Minimum
Spanning Tree

Aim
To Write a C++ Program to implement the graph and to obtain a minimum
cost spanning tree.

Algorithm
Step 1: Start the Process.
Step 2:.Create a class to get the edges and cost of the graph.
Step 3: Define a Graph class which represents the collection of Point and Arc
objects.
Step 4: Write a method to find a minimum cost spanning tree in a graph.
Step 5: Stop the Process.

Program
#include<iostream.h>
#include<conio.h>
class kruskal
{
private:
int n; //no of nodes
int noe; //no edges in the graph
int graph_edge[100][4];
int tree[10][10];
int sets[100][10];
int top[100];
public:
void read_graph();
void initialize_span_t();
void sort_edges();
void algorithm();
int find_node(int );
void print_min_span_t(); };
void kruskal::read_graph()
{
cout<<”*************************************************\n”
<<”This program implements the kruskal algorithm\n”
<<”*************************************************\n”;
cout<<”Enter the no. of nodes in the undirected weighted graph ::”;
cin>>n;
noe=0;
cout<<”Enter the weights for the following edges ::\n”;
for(int i=1;i<=n;i++)
{
for(int j=i+1;j<=n;j++)
{
cout<<” < “<<i<<” , “<<j<<” > ::”;
int w;
cin>>w;
if(w!=0)
{
noe++;
graph_edge[noe][1]=i;
graph_edge[noe][2]=j;
graph_edge[noe][3]=w; } } }
// print the graph edges
cout<<”\n\nThe edges in the given graph are::\n”;
for(i=1;i<=noe;i++)
cout<<” < “<<graph_edge[i][1]
<<” , “<<graph_edge[i][2]
<<” > ::”<<graph_edge[i][3]<<endl;
}
void kruskal::sort_edges()
{
/**** Sort the edges using bubble sort in increasing order**************/
for(int i=1;i<=noe-1;i++)
{
for(int j=1;j<=noe-i;j++)
{
if(graph_edge[j][3]>graph_edge[j+1][3])
{
int t=graph_edge[j][1];
graph_edge[j][1]=graph_edge[j+1][1];
graph_edge[j+1][1]=t;
t=graph_edge[j][2];
graph_edge[j][2]=graph_edge[j+1][2];
graph_edge[j+1][2]=t;
t=graph_edge[j][3];
graph_edge[j][3]=graph_edge[j+1][3];
graph_edge[j+1][3]=t; } } }
// print the graph edges
cout<<”\n\nAfter sorting the edges in the given graph are::\n”;
for(i=1;i<=noe;i++)
cout<<” < “<<graph_edge[i][1]
<<” , “<<graph_edge[i][2]
<<” > ::”<<graph_edge[i][3]<<endl; }
void kruskal::algorithm()
{
// ->make a set for each node
for(int i=1;i<=n;i++)
{
sets[i][1]=i;
top[i]=1; }
cout<<”\nThe algorithm starts ::\n\n”;
for(i=1;i<=noe;i++)
{
int p1=find_node(graph_edge[i][1]);
int p2=find_node(graph_edge[i][2]);
if(p1!=p2)
{
cout<<”The edge included in the tree is ::”
<<” < “<<graph_edge[i][1]<<” , “
<<graph_edge[i][2]<<” > “<<endl<<endl;
tree[graph_edge[i][1]][graph_edge[i][2]]=graph_edge[i][3];
tree[graph_edge[i][2]][graph_edge[i][1]]=graph_edge[i][3];
// Mix the two sets
for(int j=1;j<=top[p2];j++)
{
top[p1]++;
sets[p1][top[p1]]=sets[p2][j]; }
top[p2]=0; }
else
{
cout<<”Inclusion of the edge “
<<” < “<<graph_edge[i][1]<<” , “
<<graph_edge[i][2]<<” > “<<”forms a cycle so it is removed\n\n”; } } }
int kruskal::find_node(int n)
{
for(int i=1;i<=noe;i++)
{
for(int j=1;j<=top[i];j++)
{
if(n==sets[i][j])
return i; } }
return -1; }
int main()
{
clrscr();
kruskal obj;
obj.read_graph();
obj.sort_edges();
obj.algorithm();
return 0;
getch(); }

Output
*************************************************
This program implements the kruskal algorithm
*************************************************
Enter the no. of nodes in the undirected weighted graph ::3
Enter the weights for the following edges ::
< 1 , 2> ::3
< 1 , 3> ::1
< 2 , 3> ::4
The edges in the given graph are::
< 1 , 2 > ::3
< 1 , 3 > ::1
< 2 , 3 > ::4
After sorting the edges in the given graph are::
< 1, 3 > ::1
< 1, 2 > ::3
< 2, 3 > ::4
The algorithm starts ::
The edge included in the tree is :: < 1 , 3 >
The edge included in the tree is :: < 1 , 2 >
Inclusion of the edge < 2 , 3 > forms a cycle so it is removed

Result
Thus the Program to implement the graph and to obtain a minimum cost
spanning tree is implemented.

Ex. No 9 Implementation of dynamic polymorphism & RTTI

Aim
To write a C++ program to implement Hierarchy classes with Dynamic
polymorphism and Use Virtual concept along with RTTI

Algorithm
Step 1: Start the Process.
Step 2: Create a class SHAPE with data member and one member function as
Virtual.
Step 3: Create a derived class square,rectangle,polygon,circle and triangle with
SHAPE as base class.
Step 4: Create a Object in the main function.
Step 5: Invoke the appropriate function using object.
Step 6: Finally display the result.
Step 7: Stop the Process.

Program
#include<iostream.h>
#include<conio.h>
class shape
{
public:
int x,y;
public:
void getdata(int a,int b=0)
{
x=a;
y=b;
}
virtual void area()
{
cout<<"shape ";
}}
;
class square:public shape
{
public:
void area()
{
cout<<"area of square:"<<x*x<<endl;
}}
;
class rectangle:public shape
{
public:
void area()
{
cout<<"area of rectangle:"<<x*y<<endl;
}}
;
class circle:public shape
{
public:
void area()
{
cout<<"area of circle:"<<(3.14)*x*x<<endl;
}};
class triangle:public shape
{
public:
int area1;
void area()
{
cout<<"area of triangle:";
area1=(0.5)*x*y;
cout<<area1<<endl;
}}
;
class polygon:public triangle
{
public:
void area()
{
cout<<"area of polygon:"<<6*area1<<endl;
}}
;
void main()
{
clrscr();
shape *s;
triangle t;
square sq;
rectangle rt;
polygon p;
circle c;
s=&t;
s->getdata(3,2);
s->area();
s=&sq;
s->getdata(4);
s->area();
s=&c;
s->getdata(3);
s->area();
s=&rt;
s->getdata(2,4);
s->area();
s=&p;
s->area();
getch();
}

Output
area of triangle:3
area of square:16
area of circle:28.26
area of rectangle:8
area of polygon:23772

Result
Thus the program to implement Hierarchy classes with Dynamic
polymorphism and Use of Virtual concept along with RTTI is implemented.

Ex. No 10 File operations with randomly generated complex
Number

Aim
the network of education
To a C++ program to implement the randomly generates complex
numbers and write them two per line in a file along with an operator. The
numbers are written to file in the format(a+ib).Write another program to read
one line at a time from this file, perform the corresponding operation on the two
complex numbers read and write the result to another file.

Algorithm
Step 1: Start the Process.
Step 2: Create two files.
Step 3: One file is to read and another file to write.
Step 4: Do the operations in one file and write the result in another file.
Step 5: Display the result.
Step 6: Stop the Process.

Program
//Complex Class defined in a.cpp program
#include<iostream.h>
class complex
{f
loat real,imag;
public:
void get()
{
cin>>real>>imag;
}f
loat put1()
{
return real;
}f
loat put2()
{
return imag;
}}
;
//Program for writing a complex numbers in a file along with operators
#include "a.cpp"
#include<fstream.h>
#include<conio.h>
void main()
{clrscr();
fstream f("a.txt",ios::out);
complex c,c1;
char ch;
do
{
cout<<"enter the complex number1";
c1.get();
cout<<"enter the complex number2";
c.get();
char op;
cout<<"enter the operation to perform";
cin>>op;
f<<c1.put1()<<",i";
f<<c1.put2()<<"\t"<<op<<"\t";
f<<c.put1()<<",i";
f<<c.put2()<<endl;
cout<<"do u want to write one more";
cin>>ch;
}while(ch=='y');
f.close();
}
//Program for reading from file one line at a time and doing corresponding
operation and write the result in another file
#include<iostream.h>
#include<fstream.h>
#include<conio.h>
#include<string.h>
#include<stdlib.h>
void main()
{
clrscr();
fstream f1("a.txt",ios::in);
float r1,r2,r3,im1,im2,im3;
char *opertor,*c1,*c2,buffer[100];
while(!f1.eof())
{f
1.getline(buffer,100);
cout<<buffer<<endl;
for(int j=0;j<100;j++)
{if(buffer[j]=='+'||buffer[j]=='-'||buffer[j]=='*'||buffer[j]=='/')
{
char o=buffer[j];
opertor=&o;
c1=strtok(buffer,opertor);
cout<<"c1"<<c1<<endl;
c2=strtok(NULL,opertor);
cout<<"c2"<<c2<<endl;
}i
f(*opertor=='+')
{
char *s=strtok(c1,",");
char *s1=strtok(NULL,",i");
cout<<s<<s1<<"1st"<<endl;
r1=atof(s);
im1=atof(s1);
r2=atof(strtok(c2,","));
char *s2=strtok(NULL,",i");
im2=atof(s2);
cout<<"real,img of c1:"<<r1<<r2<<im1<<im2<<endl;
r3=r1+r2;
im3=im1+im2;
cout<<r3<<im3;
fstream f2("out.txt",ios::out|ios::app);
f2<<r3<<"i"<<im3<<endl;
}
else
{
if(*opertor=='-')
{ char *s=strtok(c1,",");
char *s1=strtok(NULL,",i");
cout<<s<<s1<<"2nd"<<endl;
r1=atof(s);
im1=atof(s1);
r2=atof(strtok(c2,","));
char *s2=strtok(NULL,",i");
im2=atof(s2);
cout<<"real,img of c2:"<<r1<<r2<<im1<<im2<<endl;
r3=r1-r2;
im3=im1-im2;
cout<<r3<<im3;
fstream f2("out.txt",ios::out|ios::app);
f2<<r3<<im3<<"i"<<endl;
f2.close();
}
else
{
if(*opertor=='*')
{
cout<<"entered";
char *s=strtok(c1,",");
char *s1=strtok(NULL,",i");
cout<<s<<s1<<"3rd"<<endl;
r1=atof(s);
im1=atof(s1);
r2=atof(strtok(c2,","));
char *s2=strtok(NULL,",i");
im2=atof(s2);
cout<<"real,img"<<r1<<r2<<im1<<im2;
r3=(r1*r2)-(im1*im2);
im3=(im1*r2)+(im2*r1);
fstream f2("out.txt",ios::out|ios::app);
f2<<r3<<","<<im3<<"i"<<endl;
f2.close();
}
else
{
if(*opertor=='/')
{
char *s=strtok(c1,",");
char *s1=strtok(NULL,",i");
cout<<s<<s1<<"3rd"<<endl;
r1=atof(s);
im1=atof(s1);
r2=atof(strtok(c2,","));
char *s2=strtok(NULL,",i");
im2=atof(s2);
cout<<"real,img"<<r1<<r2<<im1<<im2;
r3=((r1*r2)+(im1*im2))/((im1*im1)+(im2*im2));
im3=((im1*r2)-(im2*r1))/((im1*im1)+(im2*im2));
cout<<r3<<im3;
fstream f2("out.txt",ios::out|ios::app);
f2<<r3<<im3<<"i"<<endl;
f2.close();
}}
}}
}}}

Output:
Writing in a file:
enter the complex number11
1e
nter the complex number21
1e
nter the operation to perform+
do u want to write one more y
enter the complex number1 2
2e
nter the complex number2 1
1e
nter the operation to performdo
u want to write one more y
enter the complex number1 1
1e
nter the complex number2 1
1e
nter the operation to perform*
do u want to write one more y
enter the complex number12
1e
nter the complex number2 2
2e
nter the operation to perform/
do u want to write one more n
Text file a.txt:
1,i1 + 1,i1
2,i2 - 1,i1
1,i1 * 1,i1
2,i1 / 2,i2
Out.txt
2 i2
1 1i
0 2i
1.2 -0.4i

Result
Thus the program to implement the randomly generates complex
numbers and write them two per line in a file along with an operator. The
numbers are written to file in the format(a+ib).Write another program to read
one line at a time from this file, perform the corresponding operation on the two
complex numbers read and write the result to another file is implemented.
For more lab manuals , question banks , syllabus . please log on to http://
www.yolearn.net
49

All about Kristen Stewart:

2012-12-19T22:52:00.001-08:00

Kristen Stewart....!!!

Kristen Jaymes Stewart is an American actress who is best known for playing Bella Swan in The Twilight Saga.

Kristen Jaymes Stewart (born April 9, 1990)^[1] is an American actress who is best known for playing Bella Swan in The Twilight Saga. She has also starred in films such as Panic Room (2002), Speak (2004), Into the Wild (2007), The Messengers (2007), Adventureland(2009), The Runaways (2010), Snow White and the Huntsman (2012), and On the Road(2012).

Early work

Her whole family all worked behind the camera and Stewart thought she would become a writer/director, but never considered being an actor. "I never wanted to be the center of attention – I wasn't that 'I want to be famous, I want to be an actor' kid. I never sought out acting, but I always practiced my autograph because I love pens. I'd write my name on everything."^[12] Stewart's acting career began at the age of eight, after an agent saw her perform in her elementary school's Christmas play.^[13] After a year of auditioning, Stewart's first role was a small nonspeaking part in the Disney Channel original film The Thirteenth Year.^[5] Then, she had another part in the film The Flintstones in Viva Rock Vegas as the "ring toss girl".^[5] She subsequently appeared in the independent film The Safety of Objects, in which she played the tomboy daughter of a troubled single mother (Patricia Clarkson). Stewart also played a tomboy in the film Panic Room, playing the diabetic daughter of a divorced mother (Jodie Foster). She was nominated for a Young Artist Award for her performance.^[14]

After Panic Room's success, Stewart was cast in another thriller, Cold Creek Manor, playing the daughter of Dennis Quaid's andSharon Stone's characters. She was again nominated for a Young Artist Award for her performance.^[14] It was revealed that at about this time in her career, she had to be homeschooled due to her irregular schedule, which was affecting her grades. She said, "I started homeschooling because my teachers were failing me. I think it was just resentment – I made more work for them. But homeschooling is great; you can study what you want, which allows you to get more excited about what you're doing".^[14]

Has an older brother named Cameron Stewart and two adopted brothers named Dana and Taylor. Her parents home where she grew up is in Woodland Hills area of Los Angeles. Kristen owns homes in Malibu and Los Feliz areas of Los Angeles where she splits her time when she isn't on location filming.

Her father is John Stewart, a TV producer who works at Fox-TV and co-produced "On-Air with Ryan Seacrest" (2004). Since 2010, he has been working with George Lopez at "Lopez Tonight" (2009) on TBS TV. Due to his job he is often present for his daughter's television appearances.

Born in Los Angeles and then spent some of her early years in Colorado and Pennsylvania before moving back to Los Angeles with her family when she was 8 years old.

Supporter and member of the Red Cross National Celebrity Cabinet.

[2008] Was ranked #17 on Entertainment Weekly's '30 Under 30' the actress list.

Had to wear brown contact lenses for Twilight (2008/I) because she has naturally green eyes while Bella's eyes are supposed to be brown. Stewart wore the brown colored contacts in the first 4 of the Twilight films. In the 5th and final film Stewart wore red contacts when she was a new born vampire and amber color contacts as she matures towards the end of the film.

Four times nominated, 3 consecutive years (2003-2005) and in 2008 for the Young Artist Award. She won in 2008 for her acting in the movie Into The Wild.

[2008] Named The Movie Fanatic's Hottest Young Actress.

Has 3 dogs: Oz, a border collie mix, Jack and Lily who are hybrid wolves. Also has a cat named Max / Jella.

[2008] Was ranked #9 on Moviefone's 'The 25 Hottest Actors Under 25'.

Her mother is Australian.

Mother is Jules Stewart, a script supervisor who is directing her first film K-11 (2012).

Was introduced to Vegemite (an Australian spread) by her Sydney-born mother and names Noosa Heads (a Queensland resort town) as one of her favorite places on the planet. Her Australian heritage also inspired the name of her dog, a border collie named Oz.

Attended Saint Martin of Tours in Philadelphia, Pennsylvania.

Replaced Hayden Panettiere as Sarah Altman in Panic Room (2002) just before shooting began.

After the release of The Twilight Saga: New Moon (2009), Kristen Stewart was called for jury duty in Los Angeles and was accepted to a jury for a case in which the defendant was accused of soliciting sex from an undercover police officer posing as a prostitute. The case proceedings took three days and ended with the jury finding the defendant not guilty.

Very private about her personal life. In 2010, many main stream media outlets began referring to her relationship with Twilight (2008/I) co-star,Robert Pattinson, as matter of fact rather than rumored.

Was named "Stonette of the Year" by High Times magazine in 2010 (for her performance in Adventureland (2009)).

Ranked #3 in FHM Online "Sexiest Women in the World" (2010).

Ranked #13 in the 2011 FHM list of "Sexiest Women in the World".

Ranked #6 in the 2010 FHM list of "Sexiest Women in the World".

Her favorite horror movie is The Shining (1980).

Was named Forbes 5th Highest Paid Celebrity Couple in 2011 with boyfriend, Robert Pattinson.

Landed her first American Vogue cover in January, 2011. She also appeared in a photo-shoot for Vogue Italia in 2011.

Prior to filming The Runaways (2010) she worked closely with Joan Jett to perfect her mannerisms, stage presence, vocal tone, attitude, and musical skill. Jett later praised Stewart for her dedication and overall performance stating the portrayal made her proud.

Learned to play guitar for her role as Joan Jett in The Runaways (2010). She also recorded her own vocal tracks for 6 songs used in the film and its corresponding soundtrack.

While filming an attack scene in Snow White and the Huntsman (2012) she pulled a ligament in her right hand causing production to temporarily shut down. She also sustained a foot injury while on set.

On November 3, 2011, Stewart and her Twilight co-stars Robert Pattinson and Taylor Lautner imprinted their handprints and footprints into cement in front of the famous Chinese Theater in Hollywood, California. Stewart wore black and white checkered Vans skate shoes for her footprints and later gave them to the theater to keep as a souvenir.

Welcome to the Rileys (2010) was the first movie Stewart filmed by herself as a legal adult. She felt being alone for the first time added to her role as a 16-year old runaway living alone in New Orleans.

Attended A. E. Wright Middle School in Calabasas, California until 8th grade. Stewart was homeschooled for grades 9-12 due to her busy schedule. At age 19 she received her high school diploma while filming The Twilight Saga: Eclipse (2010).

Her favorite vampire film is The Lost Boys (1987).

Has appeared alongside Melissa Leo twice. Once in The Cake Eaters (2007) and again in Welcome to the Rileys (2010).

Has worked with Elizabeth Perkins twice. Once in Speak (2004) and again in Fierce People (2005). In both films Perkins played Stewart's mother.

At age 8, Stewart was discovered by a talent agent while singing in a school play. Although Stewart has since become an actress and not a singer she has performed her own vocals in two films, Into the Wild (2007) and The Runaways (2010).

Gave her Zathura: A Space Adventure (2005) co-star, Josh Hutcherson, a turtle for his 13th birthday.

Celebrated her 19th birthday while filming The Twilight Saga: New Moon (2009) in British Columbia, specifically while shooting Bella Swan's 18th birthday scene.

In preparation for her role as a runaway stripper-prostitute in Welcome to the Rileys (2010) Stewart learned how to pole dance, deprived herself of sleep, chain-smoked, and ate mostly junk food. As a result her body and legs were covered with bruises, her skin was blemished, and she constantly looked tired.

Voted #27 on Ask men's top 99 'most desirable' women of 2012 list.

On January 13, 2012, Stewart was named the newest spokesperson for Balenciaga and was set to be the face of a new fragrance for 2012. As a result of the partnership, Stewart attended Paris Fashion Week in March 2012 to attend the Balenciaga fashion show.

Did most of her own stunts for her role as Snow White in Snow White and the Huntsman (2012).

Stewart agreed to a salary less than $200,000 so she could remain be part of On the Road (2012) after the film's budget was drastically cut. Stewart remained committed to the role of Marylou out of her love for the original novel by Jack Kerouac.

Attended the 2012 MTV Movie Awards with Scout Taylor-Compton, one of her co-stars from The Runaways (2010). It was the first MTV Awards show she attended without Robert Pattinson.

Ranked #7 on Askmen's list of the Top 99 "most desirable" famous women for 2013.

Some interesting photos of her.....

Awards and nominations

List of awards and nominations
Year	Title of work	Award	Category	Result
2002	Panic Room	Young Artist Award	Best Performance in a Feature Film- Leading Young Actress	Nominated
2003	Cold Creek Manor	Young Artist Award	Best Performance in a Feature Film- Supporting Young Actress	Nominated
2004	Undertow	Young Artist Award	Best Performance in a Feature Film- Supporting Young Actress	Nominated
2007	Into the Wild	Young Artist Award	Best Performance in a Feature Film- Supporting Young Actress	Nominated
2007	Into the Wild	Screen Actors Guild Award	Outstanding Performance by a Cast in a Motion Picture (shared with the entire cast)	Nominated
2009	Twilight	People's Choice Award	Favorite On-Screen Team (shared with Robert Pattinsonand Taylor Lautner)	Won
2009	Twilight	People's Choice Award	Favorite Movie Actress	Nominated
2009	Twilight	MTV Movie Award	Best Female Performance	Won
2009	Twilight	MTV Movie Award	Best Kiss (shared with Robert Pattinson)	Won
2009	Twilight	Teen Choice Award	Choice Movie Actress Drama	Won
2009	Twilight	Teen Choice Award	Choice Movie Liplock (shared with Robert Pattinson)	Won
2009	Twilight	Scream Award	Best Fantasy Actress	Won
2009	Twilight	Scream Award	Best Ensemble Cast	Nominated
2009	Adventureland	Gotham Award	Best Ensemble Cast (shared with entire cast)	Nominated
2010	The Twilight Saga: New Moon	BAFTA Award	Rising Star Award	Won
2010	The Twilight Saga: New Moon	Golden Raspberry Award	Worst Screen Couple (shared with Robert Pattinson)	Nominated
2010	The Twilight Saga: New Moon	Golden Raspberry Award	Worst Screen Couple (shared with Taylor Lautner)	Nominated
2010	The Twilight Saga: New Moon	Nickelodeon Kids' Choice Award	Cutest Couple (shared with Taylor Lautner)	Won
2010	The Twilight Saga: New Moon	Nickelodeon Kids' Choice Award	Cutest Couple (shared with Robert Pattinson)	Nominated
2010	The Twilight Saga: New Moon	MTV Movie Award	Best Female Performance	Won
2010	The Twilight Saga: New Moon	MTV Movie Award	Best Kiss (shared with Robert Pattinson)	Won
2010	The Runaways	MTV Movie Award	Best Kiss (shared with Dakota Fanning)	Nominated
2010	The Twilight Saga: New Moon	Teen Choice Award	Choice Movie Actress Fantasy	Won
2010	The Twilight Saga: New Moon	Teen Choice Award	Choice Movie Liplock (shared with Robert Pattinson)	Won
2010	The Twilight Saga: New Moon	Teen Choice Award	Choice Movie Chemistry (shared with Robert Pattinson)	Won
2010	The Twilight Saga: Eclipse	Teen Choice Award	Summer Movie Star Female	Won
2010	The Runaways	Teen Choice Award	Choice Movie Actress Drama	Nominated
2010	The Twilight Saga: Eclipse	Brazilian Kids' Choice Award	Couple of the Year (shared with Robert Pattinson)	Won
2010	Welcome to the Rileys	Milan International Film Festival	Best Actress^[50]	Won
2010	The Twilight Saga: Eclipse	Nickelodeon Australian Kids' Choice Award	Fave Kiss (shared with Taylor Lautner)	Nominated
2010	The Twilight Saga: Eclipse	Nickelodeon Australian Kids' Choice Award	Fave Kiss (shared with Robert Pattinson)	Nominated
2010	The Twilight Saga: Eclipse	Scream Award	Best Fantasy Actress	Won
2011	The Twilight Saga: Eclipse	People's Choice Award	Favorite Movie Actress	Won
2011	The Twilight Saga: Eclipse	People's Choice Award	Favorite On-Screen-Team (shared with Taylor Lautner and Robert Pattinson)	Won
2011	The Twilight Saga: Eclipse	People's Choice Award	Favorite Movie Star Under 25	Nominated
2011	The Twilight Saga: Eclipse	Golden Raspberry Award	Worst Ensemble (shared with entire cast)	Nominated
2011	The Twilight Saga: Eclipse	Golden Raspberry Award	Worst Actress	Nominated
2011	The Twilight Saga: Eclipse	Nickelodeon Kids' Choice Award	Movie Actress	Nominated
2011	The Twilight Saga: Eclipse	MTV Movie Award	Best Female Performance	Won
2011	The Twilight Saga: Eclipse	MTV Movie Award	Best Kiss (shared with Taylor Lautner)	Nominated
2011	The Twilight Saga: Eclipse	MTV Movie Award	Best Kiss (shared with Robert Pattinson)	Won
2011	The Twilight Saga: Eclipse	Teen Choice Award	Choice Movie Actress: Sci-Fi/Fantasy	Nominated
2011	The Twilight Saga: Eclipse	Teen Choice Award	Choice Movie: Liplock (shared with Robert Pattinson)	Nominated
2011	The Twilight Saga: Eclipse	Teen Choice Award	Choice Movie: Liplock (shared with Taylor Lautner)	Nominated
2012	The Twilight Saga: Breaking Dawn – Part 1	Golden Raspberry Award	Worst Ensemble (shared with entire cast)	Nominated
2012	The Twilight Saga: Breaking Dawn – Part 1	Golden Raspberry Award	Worst Actress	Nominated
2012	The Twilight Saga: Breaking Dawn – Part 1	Golden Raspberry Award	Worst Screen Couple (shared with Robert Pattinson and Taylor Lautner)	Nominated
2012	The Twilight Saga: Breaking Dawn – Part 1	Nickelodeon Kids' Choice Award	Movie Actress	Won
2012	The Twilight Saga: Breaking Dawn – Part 1	MTV Movie Award	Best Kiss (shared with Robert Pattinson)	Won
2012	Snow White and the Huntsman	Teen Choice Award	Choice Female Movie Star of the Summer	Won
2012	The Twilight Saga: Breaking Dawn – Part 1	Teen Choice Award	Choice Movie Liplock (shared with Robert Pattinson)	Nominated
2012	The Twilight Saga: Breaking Dawn – Part 1	Teen Choice Award	Choice Movie Actress: Sci-Fi/Fantasy	Nominated
2012	The Twilight Saga: Breaking Dawn – Part 1	Teen Choice Award	Choice Movie Actress: Romance	Won
2013	Snow White and the Huntsman	People's Choice Award	Favorite Face of Heroism	Pending
2013	Snow White and the Huntsman	People's Choice Award	Favorite On-Screen Chemistry (shared with Chris Hemsworth)	Pending

Lady Gaga shocked the audience with shocking trick....

2012-12-19T01:27:00.003-08:00

Lady Gaga has publicly confessed love for drugs.....

During the concert in the capital of the Netherlands is Amsterdam, the city where the light drugs legalized, Lady Gaga shocked the audience with shocking trick. It's from the scene admitted that virtually stopped drinking alcohol, replacing it with marijuana. Lady Gaga was happy to discover that the use of cannabinoids, it turns out, has a positive effect on the quality of her music. «I'm happy to announce that completely changed my life. I totally gave up alcohol, and it helped my music to a new level» - said Gaga. It seems to me to be a bit deeper each inhale, ambiguously joked pop diva and marijuana cigarette smokes its right on the stage.

Well, Lady Gaga is not the first and not the last star of the music scene, priznaûŝaâsâ that drugs affect her creativity. However, it is one of the few celebrities who believe that this impact is positive. Argue it could lead singer Jim Morrison of The Doors, and River Phoenix, actor and musician, if only not dead from an overdose.

The latest bright star Western pop scene, not hiding, was singer Amy Winehouse, who died on July 23, 2011 year. The impact of drugs on creativity is certainly talented Amy Winehouse said everyone who had seen the cancellation of the concerts and studio recordings of disruption because of addictions. But the sad experience of Amy Winehouse are unlikely to confuse Lady Gaga: pop diva has repeatedly recognized in love to her and called her an example to follow.

However, the statement made by Lady Gaga loud and somewhat shocking confession in the regular use of marijuana may prove to be the only way to attract attention and to support image terrible, anfan diligently created a star. This is especially true on the eve of the release of her new album «Artpop» media and frequent accusations of Madonna.

Megan Fox’s New Home in L.A. an Impressive $2,94 Million Mansion

2012-12-19T00:58:00.000-08:00

Located in the Los Feliz district of Los Angeles, California, you are looking at Megan Fox’s latest real estate acquisition, this impressive $2,94 million mansion. The place stretches 5,200 sq. ft. and houses 4 bedrooms, 5 bathrooms, a spa, a huge soaking tub and a giant outdoor pool. The furniture is a combination of old and new, with a lot of interesting details. We really took a liking in the piano room, with the wooden centered table, painting and the fireplace. Bedrooms are painted in white and each of them has at least one distinctive element: a door with shelves, interesting and luxurious carpets, classic chairs. Every room can be characterized by volume and a particular style. The place also “offers” amazing views on the city and the near-by hills. -via TMZ

The unseen photos of Obama......!!

2012-11-02T02:39:00.000-07:00

Go to Link View Separately

President Barack Obama receives a red shawl from Sri Narayanachar Digalakote, a Hindu priest from Sri Siva Vishnu Temple, located in Lanham, Md., in the Blue Room of the White House, prior to the Asian American and Pacific Islander Initiative Executive Order signing, and Diwali festival of lights ceremony, Oct. 14, 2009. (Official White House Photo by Pete Souza)

Go to Link View Separately

President Barack Obama plays basketball with White House staffers while on vacation on Martha’s Vineyard, Aug. 26, 2009. (Official White House Photo by Pete Souza)

Go to Link

President Barack Obama takes a practice putt with a golf club presented to him by golf legend Arnold Palmer prior to the signing ceremony for H.R. 1243, the Arnold Palmer Congressional Gold Medal Act, in the Oval Office, Sept. 30, 2009. (Official White House photo by Samantha Appleton)

President Barack Obama plays basketball with personal aide Reggie Love at St. Bartholomew’s Church in New York, N.Y., where the President was attending the United Nations General Assembly, Sept. 23, 2009. (Official White House photo by Pete Souza)

Go to Link View Separately

President Barack Obama puts a little body English on his shot during a round of golf at Farm Neck golf course during his vacation on Martha’s Vineyard, Aug. 24, 2009. (Official White House Photo by Pete Souza)

Go to Link View Separately

An aide briefs President Barack Obama and First Lady Michelle Obama before they are introduced at the Congressional Hispanic Caucus Institute’s 32nd Annual Awards Gala dinner in Washington, D.C., on Sept. 16, 2009. (Official White House Photo by Pete Souza)

President Barack Obama and First Lady Michelle Obama watch a balance beam demonstration hosted by gymnast Dominique Dawes, Olympian Ryan Reser, in white, and a judo demonstration by Paralympian Myles Porter during , part of the U.S. Olympians youth sporting event on the South Lawn of the White House, Sept. 16, 2009.

Go to Link View Separately

At a birthday celebration for the First Family’s dog, Bo, his brother Cappy sneaks a treat from a table in the Rose Garden of the White House, Oct. 9, 2009. (Official White House Photo by Pete Souza)

Madonna Upsets Colorado Fans By Using Guns During Performance

2012-10-20T06:26:00.003-07:00

Madonna enraged fans in Colorado on Thursday night when she brandished a gun during her concert, three months after the state was rocked by a deadly cinema massacre.

A dozen people were murdered and another 58 injured when accused gunman James Holmes allegedly opened fire in a crowded midnight screening of The Dark Knight Rises in Aurora on July 20th.

The Material Girl took her MDNA tour to the Pepsi Center in Denver this week, but refused to censor her performance in light of the tragedy, and whipped out a pistol during her set, as she has done in all of her previous shows.

The stunt angered many audience members, and several locals even called in to NBC TV station 9News to express their disdain at her use of the gun prop, particularly in the wake of the area's recent history.

Madonna has previously defended the controversial decision to use fake weapons during her stage spectacular, saying, "It's true there is a lot of violence in the beginning of the show and sometimes the use of fake guns - but they are used as metaphors. I do not condone violence or the use of guns."

KiNgS NeWs

Tips to get pass mark in Anna university semester examinations :

Life as an Engineering Student..... Dreaming huge....

Amazing Spider-Man 2 Review:

Finally: Super visuals and a great treat for spiderman fans....!!!

Java program for Border Gateway Protocol(BGP):

Embedded System portions for Anna University:

C Program for the Implementation of a Simple Text Editor with featuress like Insertion, Deletion | CS1207 - System Software Laboratory

Implementation of a Single Pass Macro Processor using C programming..

Single Pass Macro Processor

Software Engineering-Sem 4-Unit wise important questions-Anna University

UNIT 1:1. Explain in detail about the Process Iteration.2. Explain in detail about the software life cycle model with various phases3. Explain in Detail About the RAD model and incremental model4. Explain in detail about the Component based Software Engineering

Unit V1. What are the tasks in SCM process? Explain each of them in detail2. Write notes on ISO 9000 quality standards3. What are direct and indirect measures? Explain size-oriented metrics in detail.4. Explain in detail about the process improvementRelated Posts

IPL 2013: Sreesanth, Chandila, Chavan arrested for spot-fixing...

5 Ways to Get Rich (Without a Single Discernible Skill)

MAKE-UP FAILS.....

GWYNETH PALTROW’S FAUX PUNK ROCKER

COURTNEY LOVE’S CLOWN IMPERSONATION

LADY GAGA CHANNELS A PANDA

JENNIFER LOPEZ’S FOX FUR LASHES

20 Things You Didn't Know About 'Aladdin'

Megan Fox Bikini: Pregnant Star Shows Off Baby Bump In Hawaii (PHOTO)

Megan Fox Lost The Baby Weight Without Working Out

Most Amazing Gadgets in the World

Rubber Mobile

Optimus Tactus Keyboard

F1/Carbon GMT Concept Watch

Eizo C T-One – Both a Mouse & Remote Control

Tiny USB Webcam

Nokia BMW Video Phone

Alarm Clock Docking for iPhone

Toasty – Reto Toaster like a Cassette Deck

Glo Pillow – Stimulates Sunrise to Gently Wake you Up

Continue Plug

Live 22 – Phone of the Future

Volkswagen 2028

Spherical Mobile Office

Flameless Rechargeable USB Lighter

Audi RSQ

childhood celebrity face which changed a lot......

Top 5 Celebrities' Winter Vacation Spots...

Here’s where to find Brad and Angelina, Jay-Z and Beyoncé, Jerry Seinfeld, Fergie, and other A-list celebrities in the wintertime.

Setai, South Beach, Miami

Round Hill Hotels and Villas, Montego Bay, Jamaica

Parrot Cay, Turks and Caicos

Fairmont Chateau Whistler, Whistler, BC

SIX PACKS IN A WEEK:

SEM 3 DATA STRUCTURES 2 MARK QUESTIONS WITH ANSWER ANNA UNIVERSITY:

Oops lab mannual for sem 3 anna university:

All about Kristen Stewart:

Early work

Awards and nominations

Lady Gaga shocked the audience with shocking trick....

Megan Fox’s New Home in L.A. an Impressive $2,94 Million Mansion

The unseen photos of Obama......!!

Madonna Upsets Colorado Fans By Using Guns During Performance

UNIT 1:
1. Explain in detail about the Process Iteration.
2. Explain in detail about the software life cycle model with various phases
3. Explain in Detail About the RAD model and incremental model
4. Explain in detail about the Component based Software Engineering

Unit V
1. What are the tasks in SCM process? Explain each of them in detail
2. Write notes on ISO 9000 quality standards
3. What are direct and indirect measures? Explain size-oriented metrics in detail.
4. Explain in detail about the process improvement
Related Posts