Friday, September 11, 2009












*Online Events Starts this weekend. Get ready all of you!!!

1.Sphinx Online Event :
*The Sphinx Round II Day 1 Starts today i.e 11th September,2009 from 8:30
P:M -11 P:M. For more details visit
http://avishkar.mnnit.ac.in/onlineevents_home.php?name=sphinx

*2.Online Puzzle Contest: *Event Date:13th September
Time:5-9 P.M

*3.Online Treasure Hunt*: Starts from 12th September 11:59 Hrs

For more details visit http://avishkar.mnnit.ac.in

Regards,
Team Avishkar 2009
MNNIT Allahabad

IDEATE | INNOVATE | CREATE

Sunday, September 6, 2009

Saturday, September 5, 2009

Answers to Puzzle Corner


Thank You for the Overwhelming Response to the puzzles. Here are the correct Solutions to the three questions posted. Hope your answers match to the correct ones...

Answer to Question 1:

Assume the guard A is by door A and guard is by door B. Let the prisoner go to guard A and ask him the question. One of the typical question is: "If I ask guard B what door is door B, the answer from guard B will be life door or death door?"

If the answer is life door (door B)
, he can walk in the door A safely. If the answer is death door(door B), he can choose the door B and walk in.

This is be
cause the question goes through 2 levels of questions from 2 people. The overall answers will be always a lie because there is always one lying and the other telling the truth. He can always choose the other door to the answer.


Answer to Question 2:

There are 2 ways. One is to make 1 medium size square setting inside of a large square or make 1 small square setting inside of a large square. So alternatively, you can move blue 1, 2 to red 1 and 2 position.



Answer to Question 3:

To solve this puzzle, you need to use the false logic and trial and error method.

Frist of all, the letter "M" must be 1 because the result of S + M is equal or greater than 10. Since M = 1, the letter S must be either 8 or 9. The letter "O" must be zero, (It can not be 1, since M was 1 already).

If letter "S" is 8, then S + M is 9 only (We need 10). We have to have a carry from E + O. Since O is zero, E + O can not be greater than 10. Therefore, S must be 9, not 8.

Since E + O = N, We know N - E = 1 and N + R must be greater than 10. R must be 8 with D + E > 10 to make N - E = 1.

So far we use the numbers: 0, 1, 8, and 9. Since N - E = 1, we have the following possible combinations:

  • E = 2 and N = 3, in this case, since D + E must greater than 10, E is too small because D can not be 8 or 9.
  • E = 3 and N = 4, in this case, D can not be 8 or 9. It can not be 7 also because Y will become zero.
  • E = 4 and N = 5, in this case, D can b 6 or 7. However, Y will become zero or 1 but zero and 1 were used already.
  • E = 6 and N = 7, in this case, D only can be 4 or 5. In either case will make y zero or 1.
  • E = 5 and N = 6, this is the only case that can make the equation true. D can be 7 only which will make y = 2.


Therefore, SEND=9567, MORE=1085, MONEY=10652.
Janice will receive $10,652.00 from her father.

Antoher possible, but incorrect answer was found by one of Timo Beckmann`s students. 6415 + 0734 = 07149. We believe 0734 and 07149 should be written in the correct form, 734 and 7149.

For More Intesting and brain racking questions, participate in the Online Quiz competition Sphinx.

Round 1: 5th Sep and 6th Sep
Time: 8.30 P.M to 11 P.M

Rules for Round 1 Available in Downloads Section

First Round Started



Thursday, September 3, 2009

Puzzle Corner

This time we have an interesting Article for You...
We are posting three puzzles in this post..
Answers are invited, and can be posted on the chatbox
Try to solve them. Answers will be announced tomorrow

Question 1: We start off with an easy one. This is a simple Logical Test:
There is a prisoner who is about to be executed. The king decides to give him one last chance to live.

There are 2 doors, the life door and the death door. There is one guard standing by each door. Those two guards know which door is the life door and which is the death door. However, one of them always tells the truth and the other always tells a lie. There is no way you can identify which door is the life door or the death door. There is no way you can distinguish who is the one telling the truth.

The prisoner can only ask one guard one question. Then he needs to choose a door to walk in. If he walks in the death
door, then he will be executed. If he walks in the life door, he can have a new life.

He did choose the life door and
lived. What was the question he asked? How did he choose the door after he got the answer from one of the guards?

Question 2: Rack your brains to solve this Mathematical Problem. You don't have to use your calculators for this one.
Janice Dean is a freshman in the University of North Texas. She has spent all the money for the fall semester. She knows that her father is a puzzle fan. So she mails her father a puzzle as shown.

She knew her father should be able to resolve this puzzle easily and mail the MONEY to her. Do you know how much money she will be receiving from her father?


Question 3:24 matches make a figure as shown. Can you remove 8 matches to make 2 squares? The remaining squares must be connected.

There are 2 ways to accomplish it. Can you figure out both of them?







Answers to be posted in the chatbox with your Nick and e-mail id. Answers tomorrow Folks..!!

Puzzle is, in its way, the poetry of logical ideas.Do you think you have a rationally, logically analytical mind? Then you have something carved out just for you. And it comes in two flavors. Gear up for the puzzle fever. Storm your brains together as you make your way through the online puzzle solving contest SPHINX. For similar interesting Puzzles, participate in this online puzzle contest. For more details, check out the website.

Wednesday, September 2, 2009

How Google Works


Google runs on a distributed network of thousands of low-cost computers and can therefore carry out fast parallel processing. Parallel processing is a method of computation in which many calculations can be performed simultaneously, significantly speeding up data processing. Google has three distinct parts:
  • Googlebot, a web crawler that finds and fetches web pages.
  • The indexer that sorts every word on every page and stores the resulting index of words in a huge database.
  • The query processor, which compares your search query to the index and recommends the documents that it considers most relevant.

Let’s take a closer look at each part.

1. Googlebot, Google’s Web Crawler

Googlebot is Google’s web crawling robot, which finds and retrieves pages on the web and hands them off to the Google indexer. It’s easy to imagine Googlebot as a little spider scurrying across the strands of cyberspace, but in reality Googlebot doesn’t traverse the web at all. It functions much like your web browser, by sending a request to a web server for a web page, downloading the entire page, then handing it off to Google’s indexer.

Googlebot consists of many computers requesting and fetching pages much more quickly than you can with your web browser. In fact, Googlebot can request thousands of different pages simultaneously. To avoid overwhelming web servers, or crowding out requests from human users, Googlebot deliberately makes requests of each individual web server more slowly than it’s capable of doing.

Googlebot finds pages in two ways: through an add URL form, www.google.com/addurl.html, and through finding links by crawling the web.



Unfortunately, spammers figured out how to create automated bots that bombarded the add URL form with millions of URLs pointing to commercial propaganda. Google rejects those URLs submitted through its Add URL form that it suspects are trying to deceive users by employing tactics such as including hidden text or links on a page, stuffing a page with irrelevant words, cloaking (aka bait and switch), using sneaky redirects, creating doorways, domains, or sub-domains with substantially similar content, sending automated queries to Google, and linking to bad neighbors. So now the Add URL form also has a test: it displays some squiggly letters designed to fool automated “letter-guessers”; it asks you to enter the letters you see — something like an eye-chart test to stop spambots.

When Googlebot fetches a page, it culls all the links appearing on the page and adds them to a queue for subsequent crawling. Googlebot tends to encounter little spam because most web authors link only to what they believe are high-quality pages. By harvesting links from every page it encounters, Googlebot can quickly build a list of links that can cover broad reaches of the web. This technique, known as deep crawling, also allows Googlebot to probe deep within individual sites. Because of their massive scale, deep crawls can reach almost every page in the web. Because the web is vast, this can take some time, so some pages may be crawled only once a month.

Although its function is simple, Googlebot must be programmed to handle several challenges. First, since Googlebot sends out simultaneous requests for thousands of pages, the queue of “visit soon” URLs must be constantly examined and compared with URLs already in Google’s index. Duplicates in the queue must be eliminated to prevent Googlebot from fetching the same page again. Googlebot must determine how often to revisit a page. On the one hand, it’s a waste of resources to re-index an unchanged page. On the other hand, Google wants to re-index changed pages to deliver up-to-date results.

To keep the index current, Google continuously recrawls popular frequently changing web pages at a rate roughly proportional to how often the pages change. Such crawls keep an index current and are known as fresh crawls. Newspaper pages are downloaded daily, pages with stock quotes are downloaded much more frequently. Of course, fresh crawls return fewer pages than the deep crawl. The combination of the two types of crawls allows Google to both make efficient use of its resources and keep its index reasonably current.

2. Google’s Indexer

Googlebot gives the indexer the full text of the pages it finds. These pages are stored in Google’s index database. This index is sorted alphabetically by search term, with each index entry storing a list of documents in which the term appears and the location within the text where it occurs. This data structure allows rapid access to documents that contain user query terms.

To improve search performance, Google ignores (doesn’t index) common words called stop words (such as the, is, on, or, of, how, why, as well as certain single digits and single letters). Stop words are so common that they do little to narrow a search, and therefore they can safely be discarded. The indexer also ignores some punctuation and multiple spaces, as well as converting all letters to lowercase, to improve Google’s performance.

3. Google’s Query Processor

The query processor has several parts, including the user interface (search box), the “engine” that evaluates queries and matches them to relevant documents, and the results formatter.

Page Rank is Google’s system for ranking web pages. A page with a higher PageRank is deemed more important and is more likely to be listed above a page with a lower PageRank.

Google considers over a hundred factors in computing a PageRank and determining which documents are most relevant to a query, including the popularity of the page, the position and size of the search terms within the page, and the proximity of the search terms to one another on the page. A patent application discusses other factors that Google considers when ranking a page.

Google also applies machine-learning techniques to improve its performance automatically by learning relationships and associations within the stored data. For example, the spelling-correcting system uses such techniques to figure out likely alternative spellings. Google closely guards the formulas it uses to calculate relevance; they’re tweaked to improve quality and performance, and to outwit the latest devious techniques used by spammers.

Indexing the full text of the web allows Google to go beyond simply matching single search terms. Google gives more priority to pages that have search terms near each other and in the same order as the query. Google can also match multi-word phrases and sentences. Since Google indexes HTML code in addition to the text on the page, users can restrict searches on the basis of where query words appear, e.g., in the title, in the URL, in the body, and in links to the page, options offered by Google's Advanced Search Forum and Using Search Operators (Advanced Operators)

Let’s see how Google processes a query.