●๋•|̲̅k̲̅i̲̅r̲̅α̲̅и̲̅ ̲̅k̲̅ự̲̅м̲̅α̲̅r̲̅|●๋• █▐║│▌│

P, NP, NP-complete, and NP-hard

2011-02-11T23:17:00.000+05:30

What are P, NP, NP-complete, and NP-hard?

There are two classes of problems, P, and NP (there are many, many more, but we will ignore the rest here). These stand for "Polynomial" and "Non-deterministic Polynomial".

Assuming knowledge of big-O notation, we'll move on from there. Request an explanation and you shall have it.

Problems in P are solvable by a polynomial-time algorithm (runs in , where is polynomial). This includes things like sorting and triangulation.

Problems in NP are checkable by a polynomial-time algorithm, but not necessarily solvable. Generally, we mean NP minus P, when we say NP (so they are only checkable). This means that, given the solution to an instance of the problem, we can verify that it is the correct solution in polynomial time, but that we couldn't have come up with it on our own, in polynomial time. An easy example of this is subset sum: given a set of numbers, does there exist a subset whose sum is zero? It turns out that this is not solvable in polynomial time, but given the answer, we can easily check that it is right (the decision problem is a little harder to see, but assume you are given the actual subset).

Now, we have to discuss NP-Complete and NP-Hard, which requires a discussion of reducibility. Reducibility is the notion that, given an instance of some hard problem, we can quickly construct an instance of some other problem, whose answer would help us solve the first problem.

The typical logic is this: you claim to have a fast algorithm to, say, solve subset sum. I create a machine that, in polynomial time, takes a traveling salesman problem instance, and creates from it, an instance of subset sum. If you can give my machine the answer to that question, it will, again in polynomial time, change that back into the answer for my original traveling salesman problem. Therefore, if your subset sum algorithm is really polynomial, then I have just added some extra bits to it and created a polynomial time algorithm for solving traveling salesman problems. If I can create such a machine, then it creates a notion of reducibility, that is, traveling salesman is reducible to subset sum, which indicates that subset sum is at least as hard as traveling salesman. Intuitively, one might imagine that with all the universal truth out there, one could say that traveling salesman has no polynomial-time solution. In that case, the above would be a proof by contradiction, that subset sum also has no polynomial time solution.

Now, we can pretty easily state what NP-Complete and NP-Hard are:

If two problems can be reduced to each-other, they are in some sense, "equivalent". All problems in NP that are so equivalent, are called NP-Complete.

If there is an NP-Complete problem that can be reduced to some problem H, then H is NP-Hard. This means that, in some sense, H is at least as hard as all the NP-Complete problems, but note that there does not need to be a reduction from H to any NP-Complete problem, so H might be harder than all the NP problems.

One proves that a problem is NP-Hard by taking an existing NP-Complete problem (3-SAT and Traveling Salesman are my favorites, since they work well for geometry), and using it to generate input to your problem, such that an answer to your problem is equivalent to solving the NP-Complete problem you chose.

How to find invisible friends in GTalk

2011-02-06T19:25:00.002+05:30

Your webmaster search is: how to find invisible friends in gtalk

Here is the simple trick to find the friends who are online in google talk but appearing offline.
Follow these steps to check who all are in invisible state.

Open the chat window by clicking your friend’s name
Click you friends name and select “Go off the Record”.
Send some message to that user.
if you get the feedback from gtalk that “User is offline and can’t receive messages” in red color means that the user is really offline.
But if you get no response that means that the user is appearing offline and in invisible mode.

Proxy settings for apt in Ubuntu

2011-01-31T13:42:00.000+05:30

For proxy settings in Ubuntu
create a new file called "apt.conf" in the folder "/etc/apt/" and
add this line to the file
acquire::http::proxy "http://username:password@proxysereveraddress:portnumber";

ex: http::proxy "http:://mc09mt13:******@10.0.0.21:3128";

thats it now you can install any software using

apt-get install *****

Database Indexing

2011-01-14T21:16:00.000+05:30

Why is it needed?
When data is stored on disk based storage devices, it is stored as blocks of data. These blocks are accessed in their entirety, making them the atomic disk access operation. Disk blocks are structured in much the same way as linked lists; both contain a section for data, a pointer to the location of the next node (or block), and both need not be stored contiguously.
Due to the fact that a number of records can only be sorted on one field, we can state that searching on a field that isn’t sorted requires a Linear Search which requires N/2 block accesses, where N is the number of blocks that the table spans. If that field is a non-key field (i.e. doesn’t contain unique entries) then the entire table space must be searched at N block accesses.
Whereas with a sorted field, a Binary Search may be used, this has log2 N block accesses. Also since the data is sorted given a non-key field, the rest of the table doesn’t need to be searched for duplicate values, once a higher value is found. Thus the performance increase is substantial.
What is indexing?
Indexing is a way of sorting a number of records on multiple fields. Creating an index on a field in a table creates another data structure which holds the field value, and pointer to the record it relates to. This index structure is then sorted, allowing Binary Searches to be performed on it.
The downside to indexing is that these indexes require additional space on the disk, since the indexes are stored together in a MyISAM database, this file can quickly reach the size limits of the underlying file system if many fields within the same table are indexed.

How does it work?
Firstly, let’s outline a sample database table schema;

Field name         Data type      Size on disk
id (Primary key)   Unsigned INT   4 bytes
firstName          Char(50)       50 bytes
lastName           Char(50)       50 bytes
emailAddress       Char(100)      100 bytes
Note: char was used in place of varchar to allow for an accurate size on disk value. 
This sample database contains five million rows, and is unindexed. The performance of several queries will now be analyzed. These are a query using the id (a sorted key field) and one using the firstName (a non-key unsorted field).

Example 1
Given our sample database of r = 5,000,000 records of a fixed size giving a record length of R = 204 bytes and they are stored in a MyISAM database which is using the default block size B = 1,024 bytes. The blocking factor of the table would be bfr = (B/R) = 1024/204 = 5 records per disk block. The total number of blocks required to hold the table is N = (r/bfr) = 5000000/5 = 1,000,000 blocks.
A linear search on the id field would require an average of N/2 = 500,000 block accesses to find a value given that the id field is a key field. But since the id field is also sorted a binary search can be conducted requiring an average of log2 1000000 = 19.93 = 20 block accesses. Instantly we can see this is a drastic improvement.
Now the firstName field is neither sorted, so a binary search is impossible, nor are the values unique, and thus the table will require searching to the end for an exact N = 1,000,000 block accesses. It is this situation that indexing aims to correct.
Given that an index record contains only the indexed field and a pointer to the original record, it stands to reason that it will be smaller than the multi-field record that it points to. So the index itself requires fewer disk blocks that the original table, which therefore requires fewer block accesses to iterate through. The schema for an index on the firstName field is outlined below;

Field name        Data type   Size on disk
firstName         Char(50)    50 bytes
(record pointer)  Special     4 bytes
Note: Pointers in MySQL are 2, 3, 4 or 5 bytes in length depending on the size of the table.

Example 2
Given our sample database of r = 5,000,000 records with an index record length of R = 54 bytes and using the default block size B = 1,024 bytes. The blocking factor of the index would be bfr = (B/R) = 1024/54 = 18 records per disk block. The total number of blocks required to hold the table is N = (r/bfr) = 5000000/18 = 277,778 blocks.
Now a search using the firstName field can utilise the index to increase performance. This allows for a binary search of the index with an average of log2 277778 = 18.08 = 19 block accesses. To find the address of the actual record, which requires a further block access to read, bringing the total to 19 + 1 = 20 block accesses, a far cry from the 1,000,000 block accesses required by the non-indexed table.

When should it be used?
Given that creating an index requires additional disk space (277,778 blocks extra from the above example), and that too many indexes can cause issues arising from the file systems size limits, careful thought must be used to select the correct fields to index.
Since indexes are only used to speed up the searching for a matching field within the records, it stands to reason that indexing fields used only for output would be simply a waste of disk space and processing time when doing an insert or delete operation, and thus should be avoided. Also given the nature of a binary search, the cardinality or uniqueness of the data is important. Indexing on a field with a cardinality of 2 would split the data in half, whereas a cardinality of 1,000 would return approximately 1,000 records. With such a low cardinality the effectiveness is reduced to a linear sort, and the query optimizer will avoid using the index if the cardinality is greater than 30% of the record number, effectively making the index a waste of space.

An index can be created in a table to find data more quickly and efficiently.

The users cannot see the indexes, they are just used to speed up searches/queries.
Note: Updating a table with indexes takes more time than updating a table without (because the indexes also need an update). So you should only create indexes on columns (and tables) that will be frequently searched against.

SQL CREATE INDEX Syntax

CREATE INDEX index_name ON table_name (column_name)

Example: The SQL statement below creates an index named "PIndex" on the "LastName" column in the "Persons" table:

CREATE INDEX PIndex ON Persons (LastName)

Hacking Way: Download unlimited Videos or full high quality onl...

2010-12-28T22:44:00.000+05:30

Hacking Way: Download unlimited Videos or full high quality onl...: "you can download unlimited videos from megavideo and download into many formats.. its very easy to use... Download Now"

10 Major Differences Between C And JAVA

2010-12-22T14:40:00.000+05:30

The search analytics for the blog reveals that the most popular post on the site is on the differences
between C & C++ & moreover, people have been searching for C Vs Java and Java Vs C++.
So, here are the major differences between C And JAVA.

JAVA is Object-Oriented while C is procedural. Different Paradigms, that is. Most differences between the features of the two languages arise due to the use of different programming paradigms. C breaks down to functions while JAVA breaks down to Objects. C is more procedure-oriented while JAVA is data-oriented.
Java is an Interpreted language while C is a compiled language. We all know what a compiler does. It takes your code & translates it into something the machine can understand-that is to say-0’s & 1’s-the machine-level code. That’s exactly what happens with our C code-it gets ‘compiled’. While with JAVA, the code is first transformed to what is called the bytecode. This bytecode is then executed by the JVM(Java Virtual Machine). For the same reason, JAVA code is more portable.
C is a low-level language while JAVA is a high-level language. C is a low-level language(difficult interpretation for the user, closer significance to the machinelevel code) while JAVA is a high-level lagunage(abstracted from the machine-level details, closer significance to the program itself).
C uses the top-down approach while JAVA uses the bottom-up approach. In C, formulating the program begins by defining the whole and then splitting them into smaller elements. JAVA(and C++ and other OOP languages) follows the bottom-up approach where the smaller elements combine together to form the whole.
Pointer go backstage in JAVA while C requires explicit handling of pointers. When it comes to JAVA, we don’t need the *’s & &’s to deal with pointers & their addressing. More formally, there is no pointer syntax required in JAVA. It does what it needs to do. While in JAVA, we do create references for objects.
The Behind-the-scenes Memory Management with JAVA & The User-Based Memory Management in C. Remember ‘malloc’ & ‘free’? Those are the library calls used in C to allocate & free chunks of memory for specific data(specified using the keyword ’sizeof’). Hence in C, the memory is managed by the user while JAVA uses a garbage collector that deletes the objects that no longer have any references to them.
JAVA supports Method Overloading while C does not support overloading at all. JAVA supports function or method overloading-that is we can have two or more functions with the same name(with certain varying parameters like return types to allow the machine to differentiate between them). That it to say, we can overload methods with the same name having different method signatures. JAVA(unlike C++), does not support Operator Overloading while C does not allow overloading at all.
Unlike C, JAVA does not support Preprocessors, & does not really them. The preprocessor directives like #include & #define, etc are considered one of the most essential elements of C programming. However, there are no preprocessors in JAVA. JAVA uses other alternatives for the preprocessors. For instance, public static final is used instead of the #define preprocessor. Java maps class names to a directory and file structure instead of the #include used to include files in C.
The standard Input & Output Functions. Although this difference might not hold any conceptual(intuitive) significance, but it’s maybe just the tradition. C uses the printf & scanf functions as its standard input & output while JAVA uses the System.out.print & System.in.read functions.
Exception Handling in JAVA And the errors & crashes in C. When an error occurs in a Java program it results in an exception being thrown. It can then be handled using various exception handling techniques. While in C, if there’s an error, there IS an error.

10 Major Differences Between C And C++

2010-12-22T14:28:00.000+05:30

C++, as the name suggests is a superset of C. As a matter of fact, C++ can run most of C code
while C cannot run C++ code. Here are the 10 major differences between C++ & C…

C follows the procedural programming paradigm while C++ is a multi-paradigm language(procedural as well as object oriented) In case of C, importance is given to the steps or procedure of the program while C++ focuses on the data rather than the process. Also, it is easier to implement/edit the code in case of C++ for the same reason.
In case of C, the data is not secured while the data is secured(hidden) in C++ This difference is due to specific OOP features like Data Hiding which are not present in C.
C is a low-level language while C++ is a middle-level language. C is regarded as a low-level language(difficult interpretation & less user friendly) while C++ has features of both low-level(concentration on whats going on in the machine hardware) & high level languages(concentration on the program itself) & hence is regarded as a middle-level language.
C uses the top-down approach while C++ uses the bottom-up approach In case of C, the program is formulated step by step, each step is processed into detail while in C++, the base elements are first formulated which then are linked together to give rise to larger systems.
C is function-driven while C++ is object-driven Functions are the building blocks of a C program while objects are building blocks of a C++ program.
C++ supports function overloading while C does not Overloading means two functions having the same name in the same program. This can be done only in C++ with the help of Polymorphism(an OOP feature)
We can use functions inside structures in C++ but not in C. In case of C++, functions can be used inside a structure while structures cannot contain functions in C.
The NAMESPACE feature in C++ is absent in case of C. C++ uses NAMESPACE which avoid name collisions. For instance, two students enrolled in the same university cannot have the same roll number while two students in different universities might have the same roll number. The universities are two different namespace & hence contain the same roll number(identifier) but the same university(one namespace) cannot have two students with the same roll number(identifier)
The standard input & output functions differ in the two languages C uses scanf & printf while C++ uses cin>> & cout<< as their respective input & output functions
C++ allows the use of reference variables while C does not Reference variables allow two variable names to point to the same memory location. We cannot use these variables in C programming.

Normalization

2010-12-17T21:09:00.003+05:30

Normalization is a method for organizing data elements in a database into tables.

Normalization Avoids

Duplication of Data – The same data is listed in multiple lines of the database
Insert Anomaly – A record about an entity cannot be inserted into the table without first inserting information about another entity – Cannot enter a customer without a sales order
Delete Anomaly – A record cannot be deleted without deleting a record about a related entity. Cannot delete a sales order without deleting all of the customer’s information.
Update Anomaly – Cannot update information without changing information in many places. To update customer information, it must be updated for each sales order the customer has placed

Normalization is a three stage process – After the first stage, the data is said to be in first normal form, after the second, it is in second normal form, after the third, it is in third normal form

Before Normalization

1. Begin with a list of all of the fields that must appear in the database. Think of this as one big table.

2. Do not include computed fields

3. One place to begin getting this information is from a printed document used by the system.

4. Additional attributes besides those for the entities described on the document can be added to the database.

Before Normalization – Example

See Sales Order from below:

Fields in the original data table will be as follows:

SalesOrderNo, Date, CustomerNo, CustomerName, CustomerAdd, ClerkNo, ClerkName, ItemNo, Description, Qty, UnitPrice

Think of this as the baseline – one large table

Normalization: First Normal Form

Separate Repeating Groups into New Tables.
Repeating Groups Fields that may be repeated several times for one document/entity
Create a new table containing the repeating data
The primary key of the new table (repeating group) is always a composite key; Usually document number and a field uniquely describing the repeating line, like an item number.

First Normal Form Example

The new table is as follows:

SalesOrderNo, ItemNo, Description, Qty, UnitPrice

The repeating fields will be removed from the original data table, leaving the following.

SalesOrderNo, Date, CustomerNo, CustomerName, CustomerAdd, ClerkNo, ClerkName

These two tables are a database in first normal form

What if we did not Normalize the Database to First Normal Form?

Repetition of Data – SO Header data repeated for every line in sales order.

Normalization: Second Normal Form

Remove Partial Dependencies.
Functional Dependency The value of one attribute in a table is determined entirely by the value of another.
Partial Dependency A type of functional dependency where an attribute is functionally dependent on only part of the primary key (primary key must be a composite key).
Create separate table with the functionally dependent data and the part of the key on which it depends. Tables created at this step will usually contain descriptions of resources.

Second Normal Form Example

The new table will contain the following fields:

ItemNo, Description

All of these fields except the primary key will be removed from the original table. The primary key will be left in the original table to allow linking of data:

SalesOrderNo, Item No, Qty, UnitPrice

Never treat price as dependent on item. Price may be different for different sales orders (discounts, special customers, etc.)

Along with the unchanged table below, these tables make up a database in second normal form:

SalesOrderNo, Date, CustomerNo, CustomerName, CustomerAdd, ClerkNo, ClerkName

What if we did not Normalize the Database to Second Normal Form?

Repetition of Data – Description would appear every time we had an order for the item
Delete Anomalies – All information about inventory items is stored in the SalesOrderDetail table. Delete a sales order, delete the item.
Insert Anomalies – To insert an inventory item, must insert sales order.
Update Anomalies – To change the description, must change it on every SO.

Normalization: Third Normal Form

Remove transitive dependencies.
Transitive Dependency A type of functional dependency where an attribute is functionally dependent on an attribute other than the primary key. Thus its value is only indirectly determined by the primary key.
Create a separate table containing the attribute and the fields that are functionally dependent on it. Tables created at this step will usually contain descriptions of either resources or agents. Keep a copy of the key attribute in the original file.

Third Normal Form Example

The new tables would be:

CustomerNo, CustomerName, CustomerAdd

ClerkNo, ClerkName

All of these fields except the primary key will be removed from the original table. The primary key will be left in the original table to allow linking of data as follows:

SalesOrderNo, Date, CustomerNo, ClerkNo

Together with the unchanged tables below, these tables make up the database in third normal form.

ItemNo, Description

SalesOrderNo, ItemNo, Qty, UnitPrice

What if we did not Normalize the Database to Third Normal Form?

Repetition of Data – Detail for Cust/Clerk would appear on every SO
Delete Anomalies – Delete a sales order, delete the customer/clerk
Insert Anomalies – To insert a customer/clerk, must insert sales order.
Update Anomalies – To change the name/address, etc, must change it on every SO.

Completed Tables in Third Normal Form

Customers: CustomerNo, CustomerName, CustomerAdd

Clerks: ClerkNo, ClerkName

Inventory Items: ItemNo, Description

Sales Orders: SalesOrderNo, Date, CustomerNo, ClerkNo

SalesOrderDetail: SalesOrderNo, ItemNo, Qty, UnitPrice

INSTALL XP IN ABOUT 20 MINS

2010-11-19T12:27:00.000+05:30

This tip will be very helpful for those who frequently install windows xp operating system. Normally OS installation takes around 40 minutes to complete, but through this trick you can now save 10-15 minutes. This simple tricks goes this way.

1. Boot through Windows XP CD.

2. After all the files are completely loaded, you get the option to select the partition. Select “c”.
3. Now Format the partition, whether it is normal or quick with NTFS or FAT
4. Once the formatting is completed, All the setup files required for installation are copied. Restart your system by pressing Enter.
Now, here begins the Simple trick to save 10-15 minutes.
5. After rebooting, you get a screen where it takes 40 minutes to complete or finalize the OS installation.
6. Now, Press SHIFT + F10 Key -> This opens command prompt.
7. Enter “Taskmgr” at the command prompt window. This will open Task Manager.
8. Click the Process Tab, here we find a process called Setup.exe -> Right Click on Setup.exe -> Set Priority -> Select High or Above Normal. Initially it will be Normal.
Thats it, no more work to do. Relax your self and see how fast the installation process completes

saw 3d latest teaser official.flv

2010-10-12T00:14:00.000+05:30

Nokia India - Nokia C3 - Specifications

2010-10-06T20:22:00.000+05:30

Nokia India - Nokia C3 - Specifications

Java Projects

2008-06-29T19:55:00.001+05:30

A few projects are given i this website
http://projectsinjava.blogspot.com/
a few of them are listed here

+ EAR Utility to Compare two EAR files
+ J2EE recover(Email Recoverd password)
+ Servlet Application
+ A CLASS SHOWS HOW
+ Back&Fore ground color changer
+ Magnifier (VERY NICE)JAR
+ Die Roller
+ DCSoft DOS Casino
+ Card Base Classes
+ A Civilisation Game
+ Javascript Command Interpreter
+ Parellel Port Viewer
+ Swing Code to Maintain CD Database
+ A Pong Game
+ A Basic Game
+ Bomber Man
+ Logo using Runnable Interface
+ Led Digital Clock
+ Server Insertion to DB
+ File to Array Convertor (JAR file)
+ Java Servlet & JDBC Code for Web Development
+ Animated Movable Ball
+ Beat it Game
+ Guessing Game
+ Applet game Template.
+ SMTP
+ Pizza Hut
+ Texteditor
+ Virtual Network Computing
+ GUI For RDBMS
+ Calculator
+ Smart Mail(Big project)

Crack into admin acc from limited account.........

2008-06-23T16:51:00.000+05:30

Crack into admin acc from limited account(99.99% works)

Go to cmd

type AT (time) /interactive “cmd.exe”

enter time in 24hr format

means if you want to enter 5.00pm then enter 17:00

then a new window of cmd will open at specified time

In new window type net(space)user

press enter

after this u will see some names on ur screen

notedown the name of admin acc

then type

net user (name of admin acc u want to crack into) *
e.g if the name of admin acc is john then type

net user john *

then it will ask u for new password

enter password of ur choice

and u got the admin password

Google search tips for hacking

2008-06-16T00:27:00.000+05:30

Google is the world’s most popular and powerful search engine. It has the ability to accept pre-defined commands as inputs which then produces unbelievable results.

Google’s Advanced Search Query Syntax

Discussed below are various Google’s special commands and I shall be explaining each command in brief and will show how it can be used for getting confidential data.

[ intitle: ]

The “intitle:” syntax helps Google restrict the search results to pages containing that word in the title.

intitle: login password

will return links to those pages that has the word "login" in their title, and the word "password" anywhere in the page.

Similarly, if one has to query for more than one word in the page title then in that case “allintitle:” can be used instead of “intitle” to get the list of pages containing all those words in its title.

intitle: login intitle: password

is same as

allintitle: login password

[ inurl: ]

The “inurl:” syntax restricts the search results to those URLs containing the search keyword. For example: “inurl: passwd” (without quotes) will return only links to those pages that have "passwd" in the URL.

Similarly, if one has to query for more than one word in an URL then in that case “allinurl:” can be used instead of “inurl” to get the list of URLs containing all those search keywords in it.

allinurl: etc/passwd

will look for the URLs containing “etc” and “passwd”. The slash (“/”) between the words will be ignored by Google.

[ site: ]

The “site:” syntax restricts Google to query for certain keywords in a particular site or domain.

exploits site:hackingspirits.com

will look for the keyword “exploits” in those pages present in all the links of the domain “hackingspirits.com”. There should not be any space between “site:” and the “domain name”.

[ filetype: ]

This “filetype:” syntax restricts Google search for files on internet with particular extensions (i.e. doc, pdf or ppt etc).

filetype:doc site:gov confidential

will look for files with “.doc” extension in all government domains with “.gov” extension and containing the word “confidential” either in the pages or in the “.doc” file. i.e. the result will contain the links to all confidential word document files on the government sites.

[ link: ]

“link:” syntax will list down webpages that have links to the specified webpage.

link:www.expertsforge.com

will list webpages that have links pointing to the SecurityFocus homepage. Note there can be no space between the "link:" and the web page url.

[ related: ]

The “related:” will list web pages that are "similar" to a specified
web page.

related:www.expertsforge.com

will list web pages that are similar to the Securityfocus homepage. Note there can be no space between the "related:" and the web page url.

[ cache: ]

The query “cache:” will show the version of the web page that Google
has in its cache.

cache:www.hackingspirits.com

will show Google's cache of the Google homepage. Note there can be no space between the "cache:" and the web page url.

If you include other words in the query, Google will highlight those words within the cached document.

cache:www.hackingspirits.com guest

will show the cached content with the word "guest" highlighted.

[ intext: ]

The “intext:” syntax searches for words in a particular website. It ignores links or URLs and page titles.

intext:exploits

will return only links to those web pages that has the search keyword "exploits" in its webpage.

[ phonebook: ]

“phonebook” searches for U.S. street address and phone number information.

phonebook:Lisa+CA

will list down all names of person having “Lisa” in their names and located in “California (CA)”. This can be used as a great tool for hackers incase someone want to do dig personal information for social engineering.

Google Hacks

Well, the Google’s query syntaxes discussed above can really help people to precise their search and get what they are exactly looking for.

Now Google being so intelligent search engine, hackers don’t mind exploiting its ability to dig much confidential and secret information from the net which they are not supposed to know. Now I shall discuss those techniques in details how hackers dig information from the net using Google and how that information can be used to break into remote servers.

Index Of

Using “Index of ” syntax to find sites enabled with Index browsing

A webserver with Index browsing enabled means anyone can browse the webserver directories like ordinary local directories. The use of “index of” syntax to get a list links to webserver which has got directory browsing enabled will be discussd below. This becomes an easy source for information gathering for a hacker. Imagine if the get hold of password files or others sensitive files which are not normally visible to the internet. Below given are few examples using which one can get access to many sensitive information much easily.

Index of /admin
Index of /passwd
Index of /password
Index of /mail

"Index of /" +passwd
"Index of /" +password.txt
"Index of /" +.htaccess

"Index of /secret"
"Index of /confidential"
"Index of /root"
"Index of /cgi-bin"
"Index of /credit-card"
"Index of /logs"
"Index of /config"

Looking for vulnerable sites or servers using “inurl:” or “allinurl:”

a. Using “allinurl:winnt/system32/” (without quotes) will list down all the links to the server which gives access to restricted directories like “system32” through web. If you are lucky enough then you might get access to the cmd.exe in the “system32” directory. Once you have the access to “cmd.exe” and is able to execute it.

b. Using “allinurl:wwwboard/passwd.txt”(without quotes) in the Google search will list down all the links to the server which are vulnerable to “WWWBoard Password vulnerability”. To know more about this vulnerability you can have a look at the following link:

http://www.securiteam.com/exploits/2BUQ4S0SAW.html

c. Using “inurl:.bash_history” (without quotes) will list down all the links to the server which gives access to “.bash_history” file through web. This is a command history file. This file includes the list of command executed by the administrator, and sometimes includes sensitive information such as password typed in by the administrator. If this file is compromised and if contains the encrypted unix (or *nix) password then it can be easily cracked using “John The Ripper”.

d. Using “inurl:config.txt” (without quotes) will list down all the links to the servers which gives access to “config.txt” file through web. This file contains sensitive information, including the hash value of the administrative password and database authentication credentials.

For Example: Ingenium Learning Management System is a Web-based application for Windows based systems developed by Click2learn, Inc. Ingenium Learning Management System versions 5.1 and 6.1 stores sensitive information insecurely in the config.txt file. For more information refer the following
links: http://www.securiteam.com/securitynews/6M00H2K5PG.html

Other similar search using “inurl:” or “allinurl:” combined with other syntax

inurl:admin filetype:txt
inurl:admin filetype:db
inurl:admin filetype:cfg
inurl:mysql filetype:cfg
inurl:passwd filetype:txt
inurl:iisadmin
inurl:auth_user_file.txt
inurl:orders.txt
inurl:"wwwroot/*."
inurl:adpassword.txt
inurl:webeditor.php
inurl:file_upload.php

inurl:gov filetype:xls "restricted"
index of ftp +.mdb allinurl:/cgi-bin/ +mailto

Looking for vulnerable sites or servers using “intitle:” or “allintitle:”

a. Using [allintitle: "index of /root”] (without brackets) will list down the links to the web server which gives access to restricted directories like “root” through web. This directory sometimes contains sensitive information which can be easily retrieved through simple web requests.

b. Using [allintitle: "index of /admin”] (without brackets) will list down the links to the websites which has got index browsing enabled for restricted directories like “admin” through web. Most of the web application sometimes uses names like “admin” to store admin credentials in it. This directory sometimes contains sensitive information which can be easily retrieved through simple web requests.

Other similar search using “intitle:” or “allintitle:” combined with other syntax

intitle:"Index of" .sh_history
intitle:"Index of" .bash_history
intitle:"index of" passwd
intitle:"index of" people.lst
intitle:"index of" pwd.db
intitle:"index of" etc/shadow
intitle:"index of" spwd
intitle:"index of" master.passwd
intitle:"index of" htpasswd
intitle:"index of" members OR accounts
intitle:"index of" user_carts OR user_cart

allintitle: sensitive filetype:doc
allintitle: restricted filetype :mail
allintitle: restricted filetype:doc site:gov

Other interesting Search Queries

· To search for sites vulnerable to Cross-Sites Scripting (XSS) attacks:

allinurl:/scripts/cart32.exe
allinurl:/CuteNews/show_archives.php
allinurl:/phpinfo.php

· To search for sites vulnerable to SQL Injection attacks:

allinurl:/privmsg.php
allinurl:/privmsg.php

Use Google to get Serial No of any Software

2008-06-16T00:10:00.000+05:30

Most of the people downloading trial and using it, only after the expiration of trial they try for crack, Serial No, Keygen, Patch....

But many don't known where to get Serial No, Some websites may be infect your system with Trojan horse, Viruses, Ad ware, Spy ware....

So for beginners this is a simply way to find hack with less effort and it saves time to, But make sure you have anti virus activated before trying to get some Serials, Patches to avoid data loss

Just follow the steps as instructed below

1) Go to http://www.google.com
2) type this syntax in search bar " 94FBR"
3) Replace Product name with desired software and leave a space then type 94FBR
4) Press enter, thats it

Now you receive Many pages which contains Serial no, Crack, Patches....

Just make a try, this simple trick works for many people

XP to Mac Transformation

2008-06-14T15:28:00.000+05:30

you can download it from http://rapidshare.com/files/82949391/MAC_TRANAFORMATIOM_PACK_by_mechodownload.rar
and password is : mechodownload

Create Your Own Orkut Themes In Seconds

2008-06-14T15:20:00.000+05:30

Now you can create your own Orkut themes within seconds by just a single click.You can add any image to your theme and after making your theme just send it to me if I like it I will display it in my blog by giving proper credits.

Instructions :

Visit this website http://nbfun.net/orkuttheme.php
Add your image URL and click on submit
A new window will open and just click on Install Theme.
That's it,you are done.

You will need Greasemonkey to install this theme.Read this post to know about Greasemonkey.

Download From Rapidshare As A Premium User

2008-06-14T15:07:00.001+05:30

Alot of users were asking me that they are facing difficulty to download from Rapidshare,can you please provide some alternate method.

So here comes the new method :

No software,no referrals nothing.If you want to download from Rapidshare as a Premium User follow the instructions given below.

First copy this code
4797cd4816902713f1249a9777a5725a

Then open http://www.rapid4free.com/rapidkod.php and paste the code here.

Just paste the URL of the rapidshare file and you can download as a premium user.

Note : The daily limit for downloading is 300 MB,it will increase in future.So keep visiting... :)

PDF Trick!!!

2008-06-14T15:00:00.001+05:30

Hey peeps now u can listen to wats there in a pdf document instead of reading the whole document....
Try out the following key
combinations for Acrobat 6.0 & 7.0:
- ctrl+ shift + b ---> To hear the whole document
ctrl + shift + v ---> To hear only the page
ctrl + shift + c ---> To resume
ctrl + shift + e ---> To stop

Make your wndows Xp GENUINE.!!

2008-06-14T14:57:00.001+05:30

This will allow you to bypass the Microsoft Genuine Validation thingythis method works better than many others i've tried before.
forget the cracks and injectors etc... this is the BEST WAY:

1) start > run > "regedit" (without the quotes of course)

2) go to the key:HKEY_LOCAL_MACHINE\SOFTWARE\MICROSOFT\Windows NT\CurrentVersion\WPAEvents\OOBETimer...and doubleclick on it.
Then change some of the value data to ANYTHING ELSE...delete some, add some letters, I don't care...just change it!now close out regedit.

3) go to start > run > "%systemroot%\system32\oobe\msoobe.exe /a" (again, dont type the quotes)

4) the activation screen will come up, click on register over telephone, then click on CHANGE PRODUCT KEY, enter in this key: JG28K-H9Q7X-BH6W4-3PDCQ-6XBFJ.

Now you can dl all the updates without activating, and the Genuine Microsoft Validation thingy won't bug you any more!!

Works with most WinXP versions though there r some exceptions...

RapidShare Hack

2008-06-14T14:53:00.000+05:30

Method 1
1.open your rapid share link
2.then click on free.
3.As soon as timer start type this in address bar and click enter
javascript:alert(c=0)
4.a pop up message will come click ok your counter is zero just download the stu
mega upload Links, Download, Rapid share Links, rapid share movies, rapid share free, hack rapid share, hack mega upload.

Method 2
1.Delete the cookies in your browser internet explorer or Firefox or opera or whatever u use).
2.Press start->run,type cmd.
3.In the command prompt,type ipconfig/flushdns press enter.Then type ipconfig/release,then ipconfig/renew .Now type exit.
4.Now try downloading, for many people this may work if their ISP provides a dynamic ip.
mega upload Links, Download, Rapid share Links, rapid share movies, rapid share free, hack rapid share, hack mega upload.
Method 3
1.Just switch off your router or modem) and switch it back on.
2.This may work for some users Mtnl and Bsnl) and maybe some others too.

Actually these methods generally work for those people whose ISP gives them dynamic ip.
If these don't work then one more thing that can be done is to use proxies.

Method 4
1.Download the software Hide ip platinum from here http://rapidshare.de/files/34451917/hideipv32.rar
2.Run it, then it will automatically chose a proxy (ip of a different country) for you. So you can easily download without any restrictions. You just have to change the proxy each time you download.

How to View Deleted or Removed YouTube Videos

2008-06-14T14:37:00.000+05:30

How is thispossible? Well when a video has been removed from YouTube, it is not immediately deleted from their servers. Just like our hard drive. When we delete a file and empty the recycle bin, is it not really deleted. It is only marked as deleted and is ready to be overwritten. So if it is not being overwritten, we can still view the videos but of course not from youtube.com.

Viewing removed YouTube videos is easy. Here's how to do it.

First of all, you need to know the Video ID which is at the end of the YouTube link. An example of a YouTube video link is http://www.youtube.com/watch?v=UzeV1Ux5YlI

The video ID for the link above is UzeV1Ux5YlI

Just copy and paste it in the ID text box and click view video. Here are a few sites that is able to play deleted YouTube videos. Surprisingly, they are all not the same. I've tested a deleted video ID on all 3 sites but one of it reported that it could not find deleted video. So if you desperately need to watch a deleted video, try on all of the sites and you might get to watch it.
1. UndeleTube
2. DeletedYoutubeViewer
3. Delutube

Edit the boot logo and boot logo palette in Windows XP

2008-06-14T14:30:00.000+05:30

today i have seen how to Edit the boot logo and boot logo palette in Windows XP

watch this site and enjoy http://www.geocities.com/thejjoelc/XPbootcolors.html

●▬╡‹¦[«-̲̅S̲̅i̲̅f̲̅y̲̅ ̲̅h̲̅a̲̅c̲̅k̲̅e̲̅d̲̅-»]¦›╞▬●

2008-06-14T13:57:00.000+05:30

Yσυ ภєє∂:
#тσ ๒є คภ єxเรтเภg รเƒy cυรтσмєя, เ. є. нค√є тнє ฬเяє cσмเภg тσ yσυя нσυรє.
#ค мคc ค∂∂яєรร cнคภgєя -> нттթ://яคթเ∂รнคяє.cσм/ƒเℓєร/122288791/∂єรkтσթ.яคя.нтмℓ
#คภgяy เթ รcคภภєя -> нттթ://รσυяcєƒσяgє.ภєт/թяσjєcт/รнσฬƒเℓєร.թнթ?gяσυթ_เ∂=25534&թคckคgє_เ∂=240285
#Yσυя รเƒy ๒яσค∂๒คภ∂ ℓσcคℓ เภƒσ ℓเkє เթ รυ๒ภєт мครk gคтєฬคy єтc.
нσฬ тσ?
1)ƒเℓℓ เภ คℓℓ тнє เภƒσ เภ тнє ℓσcคℓ คяєค cσภภєcтเσภ.
2)թℓυg เภ тнє ฬเяє :|
3)тσ cнєck เƒ เтร ∂σภє թяσթєяℓy, яυภ тнє Cℓเєภт, เƒ เт cσмєร тσ ℓσgเภ รcяєєภ, เт เร cσяяєcт.
4)мy ℓσcคℓ เթ เร 10.250.83.152. รσ เ รєคяcнє∂ เภ คภgяy เթ รcคภภєя ƒяσм 10.250.83.1 тσ 10.250.83.225.
5)σթєภ тнє мคC cнคภgєя, тคkє тнє мคC σƒ คภy σภє σƒ тнє คℓเ√є เթร ƒяσм คภgяy เթ รcคภภєя, cнคภgє yσυя թc'ร ฬเтн тнคт σภє, cнคภgє yσυя เթ ฬเтн тнє เթ σƒ тнє мคC yσυ тσσk ƒяσм тнє รcคภภєя.
6)เƒ тнє σтнєя υรєя เร ℓσggє∂ เภтσ รเƒy, CσภGяคтร yσυ нค√є ƒяєє нเgн-รթєє∂ ภєт ฬเтн yσυ, เƒ нє เรภ'т тяy คภσтнєя เթ :թ.
ภσтє: тнเร ฬเℓℓ รтσթ ฬσяkเภg ฬнєภ тнє σтнєя υรєя รเgภร συт ƒяσм нเร คccσυภт.
тнเร тяเck нคร ๒єєภ ƒυℓℓy cσภƒเямє∂ ๒y мy ƒяเєภ∂ คภ∂ мє.