Skip to main content

Security TIPS for Facebook Users


1. Always use a small resolution Picture as Profile Pic.

2. Goto Privacy Settings.. ->Connecting on Facebook-> Check all options for Friends Only and For FRIEND LIST->ONLY ME

3. Sharing on Facebook-> All set as Friends Only even Albums/Videos should be friends only. For Contact information -> lock Email and Mobile Phone-Only ME. Never show your email and mobile on Facebook.

4. for Mobile protection to save your profile from hacking www.facebook.com/mobileprotection give a permanent No of your father or mother dont give a prepaid temp. no. which keeps on changing.

5.Privacy Setting-> Application/Games/Websites-> Public Search->Remove Tick from Enable
Instant Personalisation-> Remove tick from enable
Games/Activity-> Only Me
Remove Suscipious Applications from Application List.

6. Account Settings->Account Security-> Tick on Always use https, Send Login Notification/approvals on Cell/Email Enable it.

7. Dont Click on suspicious links with Tiny URLs like http://ow.in etc... all are fake and fraud

8. Dont click on any link of email to access Facebook.

9. Always type https://www.facebook.com to log in.

10. Dont Use third party apps for chatting on facebook on mobile.
Labels:

Comments

Post a Comment

Popular posts from this blog

Use Case Diagram for Online Book Store

Post a Comment
Read more

Online Movie Ticket Booking Sequence Diagram

Post a Comment
Read more

Linear search & Binary search using Template

Write a program to search an element from a list. Give user the option to perform Linear or Binary search. Use Template functions. #include<iostream> using namespace std; template <class T> void Lsearch(T *a, T item, int n) { int z=0; for(int i=0;i<n;i++) { if(a[i]== item) { z=1; cout<<"\n Item found at position = "<<i+1<<"\n\n"; } else if(z!=1) { z=0; } } if(z==0) cout<<"\n Item not found in the list\n\n"; } template <class T> void Bsearch(T *a, T item, int n) { int beg=0,end=n-1; int mid=beg+end/2; while((a[mid]!=item) && (n>0)) { if(item>a[mid]) beg=mid; else end=mid; mid=(beg+end)/2; n--; } if(a[mid]==item) cout<<"\n Item found at position = "<<mid+1<<"\n\n"; else cout<<"\n Item not found in the list\n\n"; } void main() { int iarr[10] = {2,42,56,86,87,99,323,546,767,886};
Post a Comment
Read more