Last Day at Quark

This is my Last day at Quark. To be more specific its my 410th Day. Beginning of a new journey which in turn is the ending of earlier one which started on 14th June 2004.
So this is last blog I'm posting from Quark. I'll miss it. All the blog posts I made from here I'll really miss. All the moments I shared here with my collegues with myself are simpally something I'd love to remember.
I've to go. So Bye and see ya from Microsoft My new destination.

Regards
sandy
29-July-2005

Russia’s Biggest Spammer Brutally Murdered

Vardan Kushnir, notorious for sending spam to each and every citizen of Russia who appeared to have an e-mail, was found dead in his Moscow apartment on Sunday, Interfax reported Monday. He died after suffering repeated blows to the head.

Kushnir, 35, headed the English learning centers the Center for American English, the New York English Centre and the Centre for Spoken English, all known to have aggressive Internet advertising policies in which millions of e-mails were sent every day.

In the past angry Internet users have targeted the American Language center by publishing the Center’s telephone numbers anywhere on the Web to provoke telephone calls. The Center’s telephone was advertised as a contact number for cheap sex services, or bargain real estate sales.

Another attack involved hundreds of people making phone calls to the American English Center and sending it numerous e-mails back, but Vardan Kushnir remained sure of his right to spam, saying it was what e-mails were for.

Under Russian law, spamming is not considered illegal, although lawmakers are working on legal projects that could protect Russian Internet users like they do in Europe and the U.S.

Courtsey : www.mosnews.com

Regards
flyingdeath
Ukeehc

Love and Life ( Sandeep Singh Rawat )

More I live more I desire to leave. love is the reason to live but to leave is the way to love.


Sandeep Singh Rawat ( flyingdeath)
(GBPEC)

Today and Tonight ( Black Label )

Large pegs of Johni Walker !!!!!!!!!1 What else a boozer could be looking for. That's what we did today.
Enjoyed a lot. Now can't sleep I've to leave in morning 1:00 AM.
Today I gotta go for Microsoft Interview not well prepared but still hoping.
Still waiting for something from someone............................
Lots of things to do...........
Dunno where things are going...............
Let's make a night to remember.................

Sandy guitar

Sandy guitar
Originally uploaded by flyingdeath.

HI,

This is Me with my guitar.

more about Sandeep Singh Rawat and GBPEC

These are my links to the pages I use to maintain. Check them out regularly.

MY name is Sandeep Singh Rawat. I've done my B.E. Computer Sc. & Engg. from Govind Ballabh Pant Engineering College (GBPEC )Pauri. I used to use flyingdeath keyword and am an active regular member of OSS_GBPEC.
I used to surf the google and Yahoo ! most but revently came through the web page

http://google-watch.org/
that made me think whether I should use google or not.................................


Flying Death Home Page


flyingdeath blog


GBPEC Govind Ballabh Pant Engg College blog


flyingdeath Home Page


Sandeep Singh Rawat


flyingdeath AT BlogMonster sandeep singh rawat


Sandeep Singh Rawat at Yahoo! 360


FlyingDeath at multiply


FLying Death's Home Page

Convocation 31st May

HI,



Got my degree on 31st may 2005. 

We enjoyed a lot over there.  The whole show was exciting. It was good to see all juniors and seniors and friends after such a long time and may be last time in such a larger group. I can't forget all the good time I spent there with my friends who showed me the meaning of love.



So here are some never lasting memories. may be I'll see these pics again the day I'll be dying and leave this world with a smile on my lips..........

the first pic is of my dearest cheeku


Our beautiful college.


Here are we  with Red Eye effect.



remember all these guys.............

budda my best friend hey semwal I couldn't get your single pic. I tried from messenger but didn't get one.
So here are semwal main chacha pulkit arpit joshi reena vandana

Finally just to make memories sweet.............( Pics Removed Due to changed time. This is the placeholder if u came looking from google for your friends. Sorry guys I hijacked your name)



How can I forget Durga


Missing you all friends....

Adobe India Questions

I have taken the adobe written test and these are the sample questions they used to ask.

There are 4 written tests.
1. Aptitude:(Multiple choice paper)very simple geometry & algebra. 1 minute per question.properties such as sum of angles of a triangle etc.for attempting the first part:There are 2 columns and if entry in column a is greater than b then tick: a if entry in column b is greater tick:b if both are equal tick: c\ if cannot determine: d
jaisey ki they will give u a right angle triangle with 2 angles X & Y and third is ofcourse 90.now in the 2 columns they might right x , y respectively. Then since it cannot be determined which is greater so the answer would be d.
Some algebra like ki jo questions bachpan mein kiye they... linear equations bana kar ho jaatey hain jo.
There are 42. Analytical:(Multiple choice or one word answer type) puzzles. Be analytical in this paper relax and try to make some meaningful diagrams out of the questions or something and you would be able to solve it.

3. c/c++ or Java (choice)Writing code.Since I gave the c/c++ paper I know only that:1. write a recursive program that prints: 1, 1, 2, 3, 5... (upto n terms where n is the input). This is fibonacci series.2. write a program for breadth first search of a graph. bfs(Graph *g, int currentIndex, NodeValue value ) //note Graph is actually a structure containing the adjacency matrix and data about the graph. (typedefed), value is the element being searched. current index is the index the search is on. assume 0 to be the root node. {
// assumed taking a visit matrix of size g->NumberOfNodes X g->NumberOfNodes. std::queue q;
q.push_back(0); // 0 is the index of root. pushing in root. while (!q.empty()) { currentIndex = q.front(); q.pop();
visit[currentIndex] = 1; visitNode(currentIndex, value); // do whatever. for (i = 0; i <>NumberOfNodes; i++) { // visit all children of currentNode. if (g->adj_matrix[currentIndex][i] == 1 && visited[i] == 0) q.push_back(i); } } }
4. Engineering:-Giving reasons for answers is compulsory.
Automata Theory: Simple DFA... like make a dfa that accepts even number of a's and odd number of b's. NOthing more than DFA is asked.Searching/Sorting : all kinds of searching and sorting.
DataStructures: Tree traversals. pre-order in-order post order.Sample question: given a pre-order and in-order traversal draw the tree.
Complexity: big-O notation only. Sample questions: write an algorithm to find an element in a sorted array and also derive its complexity.
what is the complexity of following code:-for (i =0; i< n; i++) for (j =0 j < i; j/=2) { .... }
Answer: I think it should be n log(n). what do u say?


Test:1. Write an algo whihc calculates X pow m in O(log n) time2. what this function is doing F(a,) return 0 if b > a return F((a-b),b) else 3.See the following and answer if (a>b) 25%and (B>c) 75% how many times the foo_2() will be called if the program is executed 5000 times. if(a>b) { foo_1(); } else { if(b>c){ foo_2(); } }4.invert all odd bits of a number5.invert 20th bit of a number6.for 100 sorted elements array a. what will be avg complexity of searching an element in the array b. write a code for searching an element
7.write strindex(char *c,char*t) whihc finds the rightmost index of t in c8.write some preprocessors in C9.what does sizeof returns10 write a function prototype which returns a char * and takes a function pointer which returns void* and takes int and char * as input11.write prototype of printf function12.write a DFA which accepts aabb*.13.create a tree for which inorder and preorder traversal is given14.insert a node at pth position from end of a list in O(n) time.15.what is B+ tree.wrtie a algorithem for following 1.given an array of 100 elements and the numbers in the array are in the range from 0-9 what will be complexity of your algo 16.write algo of Binary search17.print 1 1 2 3 5 8 13 without using recursion.18.write string reversal algo and derive the complexity also.

2 examples of preprocessor directive
use of preprocessor flag
WAP (write a program) to find whether a given no is a power of 2 using
bitwise operators.
why there is no virtual static function?
you have allocated a big chunk of memory. Now write your mymalloc and
myfree func to use this memory only.
you have one big unsorted file in hard disk, which is bigger than your
RAM size. Now WAP to sort this file

Katrina (indian looks)

FW: Katrina (indian looks)
Originally uploaded by flyingdeath.

She is cuter than anything.......

Quark

HI ALL,
Quark is a big comapny in the field of news paper publishing s/w. The only big s/w Quark XPress is earning lots of the money to the company. Product are good enough to dominate the market. But this is the one side of this large scale company.
Dark side of the company.....
Ask its employees. They are not sure of their Jobs. According to latest news from Quark they are firing many of their employee without appropriate reason. What the hell...is their HR policy. If they can't make their employee happy what abt their customer. Quark BE ready to become last in the Industry. Adobe is gonna b winner.
HI Quark BYE BYE to your company.

KILL ME

HI I'm Dead but still looking for the person ready to give me life. Are you one of them.?