Having Trouble With Mozilla Firefox on Windows............... Here's solution

Mozilla Firefox, Speed it up!

Speed up Mozilla FireFox

--------------------------------------------------------------------------------

1. Type "about :config" in the adress field.
2. Set the value of network.http.pipelining to "true".
3. Set the value of network.http.pipelining.maxrequests to "100".
4. Set the value of network.http.proxy.pipelining to "true"
5. Set the value of nglayout.initialpaint.delay to "0" (not availible in newer versions) 

Read More

Linux, The Powerful Optimized Operating System......................

Do you Know How Linux is Built ?
Knowingly or unknowingly , You use linux .
Developers across the world submit their source code and Get Paid if selected For linux.
You Wait for year to see new Windows or ios but , New Linux  Kernel is Produced Every 3 months.
 Isn't this sounds really Great ?    Presently the Progress rate of linux is Simply Unmatched.
The Most Successful Open source Software Company is Ready To the World of Computing....
 Want to make most of your old low configuration PC ? Surely the only way to do this is installing Linux Operating System.
Nowadays the android phone which are beating the market of windows or java which is outdated now uses Linux Source Code to perform Faster >>>>>>>>>>>>>>>>>>>>>>

       source: Linux Foundation, YouTube

Read More

How to use laptop Wi-Fi to connect to internet for Hacking hotspot via kali linux or on any other os.............

 Hello friends!!!!!
This Post is Related to Problem with vmware for connecting over Wi-Fi connection For Hacking or Surfing purpose........

Because We Know that
follow the simple steps:

1. open networks and sharing settings
2. ensure WiFi is connected in physical os
3. click on WiFi adapter
4. then click on properties
5. then go to sharing tab
6. click on share this connection through host
7. here you have to select the default ethernet
   connection.(name may be different depending
   on your OS) mine is simply ethernet
8. now go to vmware
9. open settings under VM tab
10.now click on networks adapter
11.on R.H.S. network connection should be on
    NAT:used to share host IP.
12.click ok and enjoy surfing with wifi in
   VMWARE OS.  

Very IMP :Don't Forget to restore sharing settings on wi-fi properties to default when  you  done using with the wifi in vmware.

In the same way you can do it to any os simply go to os
and check as NAT Connection.

You Can Also follow it by simple video.
Don't forget to enter proxy for connecting to internet in Virtual Machine. 

Read More

Data Structures and Programming

In algorithmic problem solving, we deal with objects.  Objects are data manipulated by the algorithm.  To a cook, the objects are the various types of vegetables, meat and sauce.  In algorithms, the data are numbers, words, lists, files, and so on.  In solving a geometry problem, the data can be the length of a rectangle, the area of a circle, etc.  Algorithm provides the logic; data provide the values.  They go hand in hand.  Hence, we have this great truth:
Program = Algorithm + Data Structures
 Data structures refer to the types of data used and how the data are organised in the program.  Data come in different forms and types.  Most programming languages provides simple data types such as integers, real numbers and characters, and more complex data structures such as arrays, records and files which are collections of data.  Because algorithm manipulates data, we need to store the data objects into variables, and give these variables names for reference.  For example, in mathematics, we call the area of a circle A, and express A in terms of the radius r.  (In programming, we would use more telling variable names such as area and radius instead of A and r in general, for the sake of readability.)  When the program is run, each variable occupies some memory location(s), whose size depends on the data type of the variable, to hold its value. 

Read More

Tutorial on How to Create Simple Website using html for the beginners.................

This tutorial is made keeping the state of beginner to be zero knowledge about the html language....................

Get the list with syntax of html tags on http;\\w3schools.com\

Read More

Fibbonacci series Algorithm with Flowchart

              We all know fibbonacci sequence (for eg 1,1,2,3,5,8,13,....  sequence in which next no is addition of previous 2 fibonacci numbers) so we will try to write algorithm to generate fibbonacci sequence . 
F1=1st number, F2=2nd number -->F3=f1+f2=1+2=3 F4=f2+f3=2+3=5 F5=f3+f4=3+5=8, and so on. f1 f2 f3 f4 f5 f6 f7.............. 1 2 3 5 8 13 21............. 
In algorithm: 
1. Assign sum=0, A=0, B=1, i=1 
2. Get the no. of terms upto which u want to generate the Fibonacci no, i.e., n. 
3.Add A and B to get the next Fibonacci number 
4. Assign the value of B to A i.e. A=B 
5. Assign the value of sum to B i.e. B=sum 
6. Write the value of su to get next Fibonacci number in the series. 
7. increment i with 1 i.e. i=i+1 and repeat step 3,4,5,6 with the last value of i=n(n is the no. of terms which u wnt to generate Fibonacci no. series.) 
8. Stop

Read More

What Kinds of problems are solved by algorithm ?

Sorting is by no means the only computational problem for which algorithms have been developed. (You probably suspected as much when you saw the size of this book.) Practical applications of algorithms are ubiquitous and include the following examples:

• The Human Genome Project has made great progress toward the goals of identifying all the 100,000 genes in human DNA, determining the sequences of the 3 billion chemical base pairs that make up human DNA, storing this information in databases, and developing tools for data analysis. Each of these steps requires sophisticated algorithms. Although the solutions to the various problems involved are beyond the scope of this book, many methods to solve these biological problems use ideas from several of the chapters in this book, thereby enabling scientists to accomplish tasks while using resources efficiently. The savings are in time, both human and machine, and in money, as more information can be extracted from laboratory techniques. 
• The Internet enables people all around the world to quickly access and retrieve large amounts of information. With the aid of clever algorithms, sites on the Internet are able to manage and manipulate this large volume of data. Examples of problems that make essential use of algorithms include finding good routes on which the data will travel (techniques for solving such problems appear in,and using a search engine to quickly find pages on which particular information resides .  
• Electronic commerce enables goods and services to be negotiated and ex- changed electronically, and it depends on the privacy of personal information such as credit card numbers, passwords, and bank statements. The core technologies used in electronic commerce include public-key cryptography and digital signatures (covered in Chapter 31), which are based on numerical algorithms and number theory.
•  Manufacturing and other commercial enterprises often need to allocate scarce resources in the most beneficial way. An oil company may wish to know where to place its wells in order to maximize its expected profit. A political candidate may want to determine where to spend money buying campaign advertising in order to maximize the chances of winning an election. An airline may wish to assign crews to flights in the least expensive way possible, making sure that each flight is covered and that government regulations regarding crew scheduling are met. An Internet service provider may wish to determine where to place additional resources in order to serve its customers more effectively. All of these are examples of problems that can be solved using linear programming, which we shall study in Chapter 29. 

                                       Although some of the details of these examples are beyond the scope of this book, we do give underlying techniques that apply to these problems and problem areas. We also show how to solve many specific problems, including the following:

• We are given a road map on which the distance between each pair of adjacent intersections is marked, and we wish to determine the shortest route from one intersection to another. The number of possible routes can be huge, even if we disallow routes that cross over themselves. How do we choose which of all possible routes is the shortest? Here, we model the road map (which is itself a model of the actual roads) as a graph (which we will meet in Part VI and Appendix B), and we wish to find the shortest path from one vertex to another in the graph. We shall see how to solve this problem efficiently in Chapter 24.
•  We are given two ordered sequences of symbols, X =( x1,x 2,.....,xi) and Y=(  y1,y 2,.....,yi), and we wish to find a longest common sub sequence of X and Y. A sub sequence of X is just X with some (or possibly all or none) of its elements removed. For example, one sub sequence of  (A;B;C;D;E;F;G) would be B; C; E; G. The length of a longest common sub sequence of X and Y gives one measure of how similar these two sequences are. For example, if the two sequences are base pairs in DNA strands, then we might consider them similar if they have a long common sub sequence. If X has m symbols and Y has n symbols, then X and Y have 2 m and 2 n possible sub sequences,

Read More