Private Browsing



 
Before explaining this topic in detail , let me tell you something which is related  and really needed to understand the importance of this topic.

You are reading this post it means at least you know how to browse internet, but here i am going to introduce new thing which is very useful in terms of security. When you browse the web, following details are stored either  in the browser cache or in your hard-disk:

• History of Browsing.
• Cache memory items
• Cookies
• Login Details

You may have solution for this like “Clearing all the History”. But when you are accessing internet from insecure places like others computers, using  public Wi-Fi, cyber cafés , making transaction etc.,there is always risk of leaving trace of the websites you visit. In such cases the ‘Private Browsing ’ comes into the picture.

Private Browsing allows you to browse the Internet without saving any information about which sites and pages you’ve visited.

What does Private Browsing not save?


• Search Bar and Form entries : Data entered by you in the text boxes on the web pages will not be saved.
• Passwords :  New passwords will not be saved.
• Pages you Visited : In the history menu or in the Library window's history list , no pages will be added.
• Download Entries : in Private Browsing Mode, no files you download will be listed in the Download Window.
• Cookies : No Cookies will be stored.
• Cached Web Content : No temporary Internet files or files that websites save for offline use will be saved.


Do You Want to start Private Browsing ?


To know how to start private browsing in various browsers, just visit the links given below:

Mozilla FireFox
http://support.mozilla.org/en-US/kb/private-browsing-browse-web-without-saving-info

Google Chrome
http://support.google.com/chrome/bin/answer.py?hl=en&answer=95464

Opera
http://help.opera.com/Linux/12.00/en/private.html

Internet Explorer
http://windows.microsoft.com/en-in/windows-vista/what-is-inprivate-browsing

Safari
http://support.apple.com/kb/ph5000


Have a Safe Private Browsing.!


Comments

Post a Comment

Popular posts from this blog

How to show only month and year fields in android Date-picker?

Image
Android default DatePicker show day/month/year fields but you have to customize this DatePicker as your requirements. Suppose that you want to show only month and year fields in android datepicker . To do this, you have to customize the Dialog DatePicker source code but it is not an easy task. In this tutorial I will show you a tricky way to solve this problem. Lets see how to show only month and year field in android DatePicker as a dialog.   Step to show only month and year fields in android date-picker: Some days ago I got this same problem and here I am trying to explain this in a sequential manner. I want to show a dialog datepicker when user click on an EditText. So if user click on EditText, A dialog datepicker will be invocked and it will show only month and year fields. To do this, at first we have to create a xml layout to hold the EditText fields. So create an android project and name it DatePickerExample. In the main.xml file just try to write this simple code....
Read more

How to construct a B+ tree with example

Image
A B+ tree contains n-1 search key values K1K2…….Kn-1 and have n pointers.   In a B+ tree the data are ordered  sequentially.  The leaf node may hold up to n pointers and must hold at least N/2 pointers. The root node must hold at least two pointers, unless the tree consists of only one node.  Now we construct a B+ tree. Construct a B+ tree for the following set of key values: (2,3,5,7,11,17,19,23,29,31) Assume that the tree is initially empty and values are added in ascending order. Construct a B+ tree where the pointer number is Four. Solution: When a node exceeds n-1 search key value then we split it into two nodes. First node contains (ceiling(n-1)/2) values.  2 nd node contains remaining node. Copy the smallest search key value of the second node to the parent node. Let's start, we know each node has N pointer and has N-1 search key values. In our example pointer number is 4, so the search key value is 4-1=3. So each node has 4 pointers and 3 search key val...
Read more

Conflict Serializability in database

Image
To maintains database state consistency we introduce serializability. Using serializability we can understand which schedule will ensure consistency, and which schedule will not. When we are capable of converting a concurrent schedule into a serial schedule then we cal it serializable schedule. A schedule is serializable if it is equivalent to a serial schedule. We divided this concepts into two parts 1. Conflict serializability  & 2. View serializability In this discussion I just clarify you the conflict serializability. Consider two instruction read, write and the data item A and B. When two instruction execute different data item such as read(A) and read(B), then we can swap the instruction without affecting the result of the schedule. But when the data item is equivalent to one another we need to consider following four condition.    a.   read (A ),    read ( A ).   they   don’t conflict.    b.   read ( Q),  ...
Read more