LApstrEz Blog

March 1, 2006 - Shifted My BLoG

Posted in Unspecified

Shifted to a New BLoG Post!
http://lapstre.wordpress.com
Share |
Comments ( 0 ) :: Permanent Link


Share and enjoy
  • Digg
  • del.icio.us
  • DZone
  • Netvouz
  • NewsVine
  • Reddit
  • Slashdot
  • StumbleUpon
  • Technorati
  • YahooMyWeb

February 8, 2006 - Who needs a title for a blog post? Just read the blog!

Posted in Unspecified

 Aaargh! My Blog host almost gave me a Heart attack when one day my blog didn't open up(it's happened a couple o timed before), and the next day my blog turned up with almost all of my previous archives missing. But then i checked the Owners Blog and found out that he was shifting and was moving the servers... Anyway its now back to normal.

 Meanwhile tensions are running high in my life. My last week of training at the company in which i am placed is on the way, and i don't it expect it to be anyway near easy(Now you know why i dont come online 24x7 these days!). Tension mounts as the final days near. Also the preparation for the final exam is on. Eventhough the final exam is conceptual, everybody is preparing hard for it( And as usual i prefer to laze my days away confident that concepts can get me good marks, Anyway i think i've started working for the xam now). I'm training in Oracle Apps. It's an ERP solutions package (Unlike what most people think of oracle as only a database). You can check some tutorials on the subject (Oracle Apps) at this site(I used it a lot myself!).

 Even thought the Microsoft .Net Academic launch got postponed to the 13th of the month(Feb,2006). I won't be able to make it. Damn this is the third event i guess i'll be missing out this month(The Annauniv Fest, the Sun Tech Days, now this). Anway Yeshwanth Kanetkar aint coming(and neither is the LApstrE). Heard somebody from the CSI will be there. For those who we're disappointed that the registrations we're over, theres good news, Passes to the event to be held on Feb 13th at Kamaraj Memorial Hall are still available, Just contact your college Microsoft Champ.

 And hey, I heard the results we're gonna be out soon. Hmm, That's another issue to worry about, with annauniv, u never really know how the marks will go. Anyway All the Best for that. Hey anybody know what happend to the Anna univ VS Students debate on one of the news channels???.

 Damn gotta go, Spent almost half an hour on what i started off as a 5 minute update. Hmm...

 Before i go I found this bit from an article of which i read an extract in Digit(or was it Chip?) .


Make sure u read the full article on the blog. Click anywhere on the extract to read the full blog post by the original author
or



Share |
Comments ( 3 ) :: Permanent Link


Share and enjoy
  • Digg
  • del.icio.us
  • DZone
  • Netvouz
  • NewsVine
  • Reddit
  • Slashdot
  • StumbleUpon
  • Technorati
  • YahooMyWeb

January 30, 2006 - Masti di Paatshala...

Posted in Unspecified

 Rang De Basanti is definitely THE MOST HYPED MOVIE of the hindi movie era (atleast as far as i know!). The songs are the best of Rehman since a long time, and theres Aamir on the screen, what better reason do u need to go watch the movie? The story of course! and i heard the story was a good one so no reason not to go and catch it on the big screen. But as much as i would like to go, i havent gone yet, Partly because i'm too lazy to move out and partly because the tickets were'nt available...





 But a couple of friends to my envy went out to catch the movie, Heres what one of them had to say about the movie...


 "Aamir (Khan) is back with a bang. Though "MANGAL PANDEY" had a terrific opening, that did not click not just at the box office but also at the people's heart. But Rang De Basanti is quite different. U get to see a cool dude in Aamir. The cast has brought out the beauty of friendship and patriotism in a out-of-box way (meaning not the regular stereotyped bollywood tale).

 Soha (ali khan) is electric on screen, the others we're beautiful enough in their own way. All performances we're upto the mark. Music was(is) Rocking! A movie worth watching with friends but its good with family too (Now now, how many of these kinda movies come out these days???). I'm not going to break the fun of the movie before u watch (Boohoo! She refused to tell me the story!!!)."


 Damn thats all she said about the movie!, now i am going mad trying to get a ticket for the movie(I called up my friends and ordered em to get the tickets for the movie! Phew, thats hard work!). So for the next one week whomsoever can get me 3 tickets to the movie i'll declare them to be equal to god and kiss their feet!


PssT1: If u came looking for a full review of the movie, Check this review of the movie on Deccan Herald. Also this review on IBNlive.com
PssT4: Haven't watched the movie yet? Join the lazy joe's club here.

Confession: I seem to remember later that She did offer to tell me the story, but i refused politely as it'd spoil the fun of watchin the movie...


Go watch the movie! and post your comments back here! Have Fun!

Share |
Comments ( 2 ) :: Permanent Link


Share and enjoy
  • Digg
  • del.icio.us
  • DZone
  • Netvouz
  • NewsVine
  • Reddit
  • Slashdot
  • StumbleUpon
  • Technorati
  • YahooMyWeb

January 27, 2006 - Nitroboost your XP experienze...

Posted in Unspecified

 How many of you uses XP on a 128mb/256mb RAM, Think your OS is slow(Despite it claiming to be 36% fater than 98)? A sure way to get your system running faster is to kick out all unnecessary services running on your xp. And thats exactly what this article on Techtree helps you to do... Click HERE to read the article...

 Most regular LApstrEz BLoG readers will remeber i posted a similar link to another PC World article a month ago for christmas, The text went sumthin like this ...

Is your PC too slow, Think it's time to upgrade? Think again, Have you ever wondered how fast your pc was when it was new? If u thought it was just old age that ur pc is workin slow, you can't be more wrong. As time passes by we tend to fil our computer with a lot of programs we think might be useful to us, then promptly forget about it. All these small programs you install tend to startup with your computer, running background taks and updates. YOu can boost your pc speed 100%(No kidding, Well unless ofcourse you have a well maintained system) just by gettin rid of these programs. Wanna know how? Pc world presents this guide on how to get ur Pc up and running faster than ever. If you ask me what i do to keep my PC up and running, I simply follow the boring old routinue of Msconfig, spybot and Registry Cleaner...Read the PC world Gunk Busters article here.

For those who missed their chance to fame on the Microsoft Code4bill contest, Heres our very own IIT kharagpur's BITWISE 2006.




 We had a go at this contest last year and managed to solve a couple o questions. We figured we would be somver on the top 20 bcos of the toughness of the questions and the 750 only crowd. Just when we we're ready to savour our first real victory in the ubergeek world, the programs which compiled on our compiler(Turbo C++) didnt compile on their GNU compiler. So if u are attending this contest a work of advice , get the GNU C++ compiler and learn the differences and usage... and if u do register leave a comment here.

 Hoping for a better contest this time atleast, but am afraid we wont be able to make it bcos of the training up ahead. Last time we called ourselves...%*^(^$ i really don't remember what we called ouselves last time. But this time around we are calling ourselves Deranged Programmers (Pretty apt some might say!). I got the questions up somewhere on the hard disk, I'm just hoping i dint format it along with my collection of over a hundred bookmarks the last time i did a format. Will put it up here as soon as i find it. But they're probably there on the site(i din't bother to look there yet!).

 College is ending tommorow, so time to start our projects. But i gotta lot of other stuff i want to do in mind... will blog about that later

 Before i say bye, this is a quote a friend wrote on a slam book of another friend, i do believe its his original creation (I have no words not to doubt his words).

 A seriously good one...

"Rose is a flower that stands for an hour,
But, Friendship is a power that lasts forever..."
                                                                                                                          -Gandhi S (
Not the Mohandas Karamchand variety)

Bye
Share |
Comments ( 0 ) :: Permanent Link


Share and enjoy
  • Digg
  • del.icio.us
  • DZone
  • Netvouz
  • NewsVine
  • Reddit
  • Slashdot
  • StumbleUpon
  • Technorati
  • YahooMyWeb

January 27, 2006 - Gandhi -The AD

Posted in Unspecified

Click here to view an Italian advertisement containing my favourite idol of all times - Gandhi

There are more ads on the site, and all of em are cool, Have a look around...

Share |
Comments ( 0 ) :: Permanent Link


Share and enjoy
  • Digg
  • del.icio.us
  • DZone
  • Netvouz
  • NewsVine
  • Reddit
  • Slashdot
  • StumbleUpon
  • Technorati
  • YahooMyWeb

January 25, 2006 - BillyG upto it again...

Posted in Unspecified

Hi there,
 Long time since i sat down to write. College,Projects and Training, One hectic combination enough to drive u mad and tired by the end of the day. I tried to catch up but couldn't write any good blogposts. Felt guilty and put in a few scrap blogposts, and tried to get rid of that strange feelin...

 Amidst all this hullaboo came Code4Bill , A Microsoft talent hunt contest in India. I took the first attempt and made mockery of myself, for the second i was too tired to even try. So i just shut up and went to bed. Got the questions for the 1st and 2nd at the end of the post, Have a look and see where u figure...

 Bill Gates (aka BillyG) was spotted showing off his pet toys at the Consumer Electronics Show in Las Vegas. Apart from showing off Vista, the big kid also bragged about his latest new soft toy, The new Windows Media Center Edition. For more on his inaugural keynote address at CES click HERE.

 Another person who was in the lime light recently was me(Bleargh!), who caused up quite a stir by requestin my HOD to cancel my previously approved project. The class was flabbergasted at the idea, especially since lots of projects got rejected. I claimed the reason to be lack of time, but the HOD convinced me to tone down the project to suit the time constraints(Why din't i think of that before??? Darn!).

And hey, Guess what i found when i was browsin the web, A "Hangman" script i can add to my site, Hangman is one of my favourite games, have a go at it, u'll like it...

Hah and now, Back to preparing for my reviews in college.
Before i go "Congratulations ot all those who made it thro the first round of Code4BIll..."
Gotta run, Bye


CODE 4 BILL CONTEST

Questions for attempt1
(Psst : Don't curse me please, I din't set the Questions)


1. There are 18 steps. A person is starting from the bottom climbing to the top. A person can climb, at a time, one, two or three steps. In how many ways can he climb the steps and reach the top?

2. You are given an infinite number of cookie boxes containing either 6, 9 or 260 cookies. You are allowed to use these boxes in any combination so desired. What is the maximum number of cookies that you cannot give out using the above boxes?

3. A Binary Tree can be fixed given its nodes in Pre-Order and In-Order sequence. The Pre-Order of a tree is j,f,h,e,c,d,a,i,b,g and In-order traversal of this tree is h,f,e,c,j,a,d,b,i,g. What will be the Post-Order traversal of the same binary tree? Each alphabet in the sequence represents one node of the binary tree. Give the output as a comma separated list of alphabets(nodes),for eg. a,b,c,d,e,f,g,h,i,j.

4. Examine the code below. Each second, the function Writer is called 6 times, following which the function Reader is called 3 times (in the same thread there is no multithreading involved here). The same cycle repeats every second. What is the first number to be printed by this program?

#include

#define BUFFER_SIZE 20
int buffer[BUFFER_SIZE];

int writeIndex = 0;
int readIndex = 0;

int IncrementCircular(int start)
{
    int sum = start + 1;
    return sum >= BUFFER_SIZE ? sum - BUFFER_SIZE : sum;
}

void Reader()
{
    if (readIndex != writeIndex)
    {
        // Consume buffer[readIndex] here.
        readIndex = IncrementCircular(readIndex);
    }
    // else, buffer is empty.
}

void Writer()
{
    static int value = 1;
    if (IncrementCircular(writeIndex) == readIndex)
    {
        // The buffer is full - print the value.
        fprintf(fpq"%d ", value);
    }
    else
    {
        buffer[writeIndex] = value;
        writeIndex = IncrementCircular(writeIndex);
    }
    ++value;
}


5.Tower of Honoi: we are given a tower of N disks, initially stacked in increasing size on one of three pegs. The objective is to transfer the entire tower to one of the other pegs, moving only one disk at a time and never a larger one onto a smaller. In this variation of tower of honoi, peg two contains 1-8 disks and peg one contains 9-10 disks. How many minimum moves are needed to move all the disks to the third peg moving only one disk at a time and never a larger one onto a smaller?

6.Multiply 11102 represented in base -7 with 14340 represented in base -8 and represent the output in base -9.

7.An array contains 4 occurences of 0s, 10 occurences of 1s and 7 occurences of 2s in any order. The array is to be sorted using only swap operations. What is the minimum number of swaps needed in the worst case to sort the array?

8.An LCD(Liquid Crystal Display) can represent 0 to 9 digits. If you turn the LCD upside-down, some of the numbers still remain valid numbers for example 16 becomes 91. If you index all positive numbers(>0) that can produce valid numbers when you upside down the display (like 1st one is 1, 2nd one is 2, 3rd one 5... 7th one is 10), what is the 1274th number in this series?

CODE 4 BILL CONTEST

Questions for attempt2


1. What is the probability of two people arriving at a restaurant withing 11 minutes of each other between 1 PM and 2 PM?The answer needs to be rounded to 4 decimal places with no trailing zeroes. (e.g .15 needs to be represented as 0.15, 0.154567 needs to be represented as 0.1546)

2. 4 people got on a train at its starting point. There are 10 stations on which they can get off (excluding the starting point. What is the total number of different ways they can do this considering that no more than 2 people get off at the same station?

3. A machine has 64 KB of virtual memory and 1 KB of physical memory. This machine uses a set-associative page table with a page size of 64 bytes and 4 sets. The low order bits of the virtual page number are used to decide the set in which a virtual page is placed. The page replacement algorithm in each set is round-robin: on the first page fault, the first page in the set is replaced. On the second page fault, the second page in the set is replaced and so on. The contents of the page table are given in increasing order of physical page number below, where the virtual page number is in hex: 0x208, 0x24c, 0x340, 0x324, 0x339, 0x3bd, 0x3f1, 0x215, 0x36a, 0x2e, 0x3a2, 0x6, 0x29b, 0x39f, 0x253, 0xf7. A program issues the following virtual addresses in hex: 0xe8b8, 0x94dc, 0xe00, 0x7730, 0xa6f4, 0xdab0, 0x2638, 0x2c80. What are the final contents of the Page Table?

4. I have a 4 bit number "n" in mind (that is, 0 <= n <= 15). To help you guess this number, I have answered seven questions below (the least significant bit is bit 1 and the most significant bit is bit 4):

Q1. Is bit 1 equal to 1? No
Q2. Is bit 2 equal to 1? No
Q3. Is bit 3 equal to 1? Yes
Q4. Is bit 4 equal to 1? Yes
Q5. Is the sum of bits 1, 2 and 4 even? No
Q6. Is the sum of bits 1, 3 and 4 even? No
Q7. Is the sum of bits 2, 3 and 4 even? No

The catch here is that the answer to exactly one of the seven questions above is wrong, the other six are correct.
Which answer is wrong? (For example, if the answer to Q6 above is wrong, your response should be 6.)

5. 8 0s are placed from 0th cell to 7th cell of an array; 8 1s are placed from 9th cell to end of the array. On the whole, there are 17 cells, so that just one cell remains unoccupied. 0s only move rightward; 1s move leftward. Every move is either a move to the next empty cell or a jump over one cell which has different value. In any case, no two values are allowed in the same square. The goal is to move 1s into 8 leftmost positions and the 0s into 8 rightmost positions. How many minimum moves are needed to achieve this?

6. All 7 digit permutations of number 1234567 are sorted and kept in an array of 5040 elements. (0th element is 1234567, 1st element is 1234576 and 5039th element is 7654321.) What is the 1170th element in this array?

7. A character in an alphabet is represented in 11 bits. How many characters are there in the alphabet which have at least one sequence of 3 adjacent 0s?

8. Given a 9 X 9 sided square(rows 0 to 8, columns 0 to 8) where the cell(7,0) contains a RED dot (rest of the cells dont contain the RED dot). How many squares are present of any size without having the RED dot in them?

You even botheres to read thro this much of stuff??? Hats Off!




Share |
Comments ( 0 ) :: Permanent Link


Share and enjoy
  • Digg
  • del.icio.us
  • DZone
  • Netvouz
  • NewsVine
  • Reddit
  • Slashdot
  • StumbleUpon
  • Technorati
  • YahooMyWeb

January 18, 2006 - Changed my project again

Posted in Unspecified

 Changed my project title again(Oh yes! this is the third title...) Well i just din't do it for kicks, but then i changed it bcos the depth  in the ATM project wasnt quite enough. But hey, I found a couple of more interesting projects, Wonder how they escaped my eye the first time...

 Well, This project is going to be fun, atleast i like it better this time and guess what it'll help me a lot in the future with my scientific u know wot (Scientific???  )...

 Arrgh Gotta Run! Catchya later...

Share |
Comments ( 0 ) :: Permanent Link


Share and enjoy
  • Digg
  • del.icio.us
  • DZone
  • Netvouz
  • NewsVine
  • Reddit
  • Slashdot
  • StumbleUpon
  • Technorati
  • YahooMyWeb

January 18, 2006 - The biggest post yet!

Posted in Unspecified

Arrgh, Damn, ^$&("%, these are some of my thoughts recently when i sat down to write sumthin for my blog. And so it is My latest blogpost, smack on my blog for all to read!

Darn is this writers block???

Share |
Comments ( 0 ) :: Permanent Link


Share and enjoy
  • Digg
  • del.icio.us
  • DZone
  • Netvouz
  • NewsVine
  • Reddit
  • Slashdot
  • StumbleUpon
  • Technorati
  • YahooMyWeb

About Me

A Weekly Rant Column...

Play Hangman!

Hangman

Search


Archives

January 2006
December 2005
November 2005
October 2005
September 2005

Links

Home
View my profile
Archives
Friends
Email Me
My Blog's RSS
My Wall

Rate My Blog

Rate my BLoG
@ FindingBlog.com
Excellent!
Very Good
Good
Fair
Poor

Blog Directories



BlogBiB - Blog Directory
FindingBlog - Blog Directory



Friends


BLoG Roll



Blogroll Me!

My Work is Licensed


Counter

Free Web Counter
Free Hit Counter
Yea Baby! Keep The Clicks comin...
Page 1 of 5
Last Page | Next Page
portfolio