Photo  |   20 October 11 | 69,299 notes

THE LAST BINARY DAY OF THE CENTURY!
It’s someone’s birthday too!

THE LAST BINARY DAY OF THE CENTURY!

It’s someone’s birthday too!

(Source: asstrology)

Reblogged: maxscenerie

Quote  |   15 September 11 | 20 notes

If you don’t succeed, call it version 1.0.

Text  |   31 August 11 | 7 notes

I AM GEEK!

class IskolarNgBayan():

    student_number = None

    def set_sn(self, student_number):

        self.student_number = student_number

class RodXavier(IskolarNgBayan):

    name = ‘Rod Xavier R. Bondoc’

    birthday = ‘April 7, 1992’

    nickname = ‘Txavi’

    description = ”’

                11 Facts about Rod Xavier

                1. He is a fun-loving crazy guy who loves to draw the infinity symbol while in class.

                2. He is a self-proclaimed math enthusiast who enjoys seeing numbers and variables, and he even dreams of solving math problems while asleep.

                3. He is a geek. For example, if you believed that it’s really 11 facts, convert it to binary and you’ve been trolled. XD”’

    def get_profile(self):

        self.set_sn(‘2008-02531’)

        return ((‘%s: %s\n%s: %s\n%s: %s\n%s: %s\n%s:%s’) % (‘Name’, self.name, ‘Birthday’, self.birthday, 

                 ’Nickname’, self.nickname, ‘Student Number: ‘, self.student_number, ‘Description’, self.description))

def main():

    rod = RodXavier()

    print rod.get_profile()

if __name__ == “__main__”:

    main()

#NAINGGIT AKO SA MGA GUMAGAWA NG WRITE-UP. Aga ko nagpasa eh. :))

#I-run mo pa yan, gagana yan. :))

Text  |   20 July 11 | 31 notes

What to read for your next interview

arorarahul:

This guide is intended for students who want to enter CS/IT field. The topics that i have mentioned are the ones which i was grilled on during my placement season. I had given interviews in Yahoo, Agilent Technologies, Oracle, PitneyBowes and Flipkart.

My cousin sister is in 4th year of her Undergrad CS program. It is placement season at her college. She wanted some tips regarding placements. What to do? What not to do? Which topics should she study? Which topics she should avoid? Etc Etc Etc. During my placements, i did not have any mentor. Also, i did not realize the power of the internet. So, i decided to write all the things that came to my mind for her. I am sharing this post to all students who are/will be going through placement season in the near future.

A) Programming Languages
You should learn 2 programming languages
Java/C++ and C
Java/C++ because of their OO nature
C because that is the primary language that we all have used during our undergrad

Books

  1. Java Book : Think like a Computer Scientist in Java (free pdf)
  2. C++ Book : Think like a Computer Scientist in C++ (free pdf)
  3. C Book : Kernighan and Ritchie - Amazon link
  4. CS-Library@Stanford.edu : Essential C
  • Optional but preferred : Do not use any fancy code-editors. Try to code everything in Notepad++ or GEdit (win). For Mac/Linux, use vim (nothing is better than this). I am asking you not to use Visual IDEs because at this stage we are better off without cheats/hints that are provided in IDEs.


B) Data Structures and Algorithms

  1. Algorithmic Complexity : You need to know Big-O. It is the first chapter of any Algo/DS book. A must
  2. Sorting : Details of O(n) of each sorting algorithm. Advantages/Disadvantages. Also, u need to know how they are implemented in C/Java/C++
  3. Queues, Stacks and Linked List : Basic Stuff. A must. Do all possible questions possible on these topics. Refer CS-Library@Stanford.edu for all possible questions on LinkedList.
  4. Trees : Again. A must. Do all possible questions possible on these topics. Refer CS-Library@Stanford.edu for all possible questions on Trees. Also, one should know about tree-traversal methods and operations, both recursively and non-recursively. Optional - Balanced trees and tries.
  5. Hashtables : Knowledge of Hashtables are required while solving real-life problems discussed during the interview. Candidate should know the working and implementation of Hashtables in any language he/she chooses.
  6. Graphs : Rarely companies ask to implement graph-problems. However, u need to know the functioning of graph algorithms, Djikstra, BFS, DFS. 
  7. Other problems : 8queen problem, Knapsack problem, Travelling-Salesman are some of the problems that are normally asked in the interviews

Books


C) Operating Systems
You should know about Processes, Threads, Concurrency, Deadlocks and Memory Management. There are specific chapters allotted to these topics. Read and understand them from the dinosaur book (Galvin). You can also get Powerpoint ppts from the author’s site. I preferred reading from them.

Books

  1. Operating System Concepts - Galvin (Amazon link) or, Ppt slides by Galvin.
  2. Modern Operating Systems - Tanenbaum (Amazon link)

D) Databases

Basic Database concepts, Normalization and joins. Candidate should also have good hands-on in MySQL. You should also know basic SQL queries and transactions. Implementation of triggers should also be known [My personal opinion as I was rejected in the final round of Yahoo because of triggers :) ]

Books

  1. Sams’ Publishing MySQL tutorial (Amazon link) is my go-to book. Read till Chapter 8.
  2. Google University [ For the ones, who finished till Chapter 8 of the above book ]
  3. For Triggers : Refer Korth/Gehrke (Amazon link of Korth/Amazon link of Gehrke) whichever book is used in your college. I prefer Gehrke (not because he is my professor at Cornell, but it is a fabulous book)


E) Networking
I never gave Cisco’s interview so, I hardly have knowledge about networking questions. TCP/IP and Internet are two hot topics for all companies. Read about them in detail.

Books

  1. Forouzan (Amazon link)/Tanenbaum (Amazon link): Whatever is used in your college
  2. or, Head First Networking (Amazon link) : Awesome book. It’s a Head-First. Need i say more :)


F) Puzzles
Almost every company (apart from Yahoo) asked me puzzles. Infact my entire flipkart’s first interview was based on puzzles. They were not programming puzzles, but were mathematical puzzles.
Book : Book of Puzzles by George Summers (Amazon link)


G) Optional

Intricacies of Unix. A must for people who want to become system engineers.

For this, delete Windows and install Ubuntu [ Do not dual-boot, it will not serve any purpose as you will not learn/admire Linux until it’s ur go-to OS ]
Start learning by following Ubuntu/Unix/Linux blogs. The more you will use it, the more you will know about it.

Book : Unix Concepts by Sumitabha Das (Amazon link)

One book i want all interviewers to check out is Cracking the coding interview by Gayle Laakmann (Amazon link). It is the best book i came across. MUST i should say. I bought the pdf version of this book on careercup.com. Buy it even if it’s a lil expensive for books in India. Great value for money.

This is a pretty cool list of references. :D

Reblogged: arorarahul

Text  |   1 July 11 | 2 notes

Addicted To Vi

zedisnotdead:

with apologies to Robert Palmer

You press the keys with no effect,
Your mode is not correct.
The screen blurs, your fingers shake;
You forgot to press escape.
Can’t insert, can’t delete,
Cursor keys won’t repeat.
You try to quit, but can’t leave,
An extra “bang” is all you need.

You think it’s neat to type an “a” or an “i”—
Oh yeah?
You won’t look at emacs, no you’d just rather die
You know you’re gonna have to face it;
You’re addicted to vi!

You edit files one at a time;
That doesn’t seem too out of line?
You don’t think of keys to bind —
A meta key would blow your mind.
H, J, K, L? You’re not annoyed?
Expressions must be a Joy!
Just press “f”, or is it “t”?
Maybe “n”, or just “g”?

Oh—You think it’s neat to type an “a” or an “i” —
Oh yeah?
You won’t look at emacs, no you’d just rather die
You know you’re gonna have to face it;
You’re addicted to vi!

Might as well face it,
You’re addicted to vi!
You press the keys without effect,
Your life is now a wreck.
What a waste! Such a shame!
And all you have is vi to blame.

Oh—You think it’s neat to type an “a” or an “i” —
Oh yeah?
You won’t look at emacs, no you’d just rather die
You know you’re gonna have to face it;
You’re addicted to vi!

Might as well face it,
You’re addicted to vi!

Chuck Musciano, from COMPUTER SONGS AND POEMS

This is cool. :D The Vi poem!

Reblogged: zedisnotdead

Text  |   26 May 11 | 7 notes

Facebook logout

I’ve been playing with javascript since last night. And tried using it in Facebook. Apparently, starting today, this will be how I logout my Facebook page.

javascript: document.getElementById(“logout_form”).lastChild.firstChild.click();

Note: To use this, copy and paste this in the address bar and press “Enter”.

Photo  |   14 April 11 | 18 notes

This is so cool. :))

This is so cool. :))

Likes

kontantkort