vivekbarot.com Report : Visit Site

Technical data of the vivekbarot.com

Geo IP provides you such as latitude, longitude and ISP (Internet Service Provider) etc. informations. Our GeoIP service found where is host vivekbarot.com. Currently, hosted in India and its service provider is This is the Assigned WebsiteDNS.in IP Pool. .

HTTP Header Analysis

HTTP Header information is a part of HTTP protocol that a user's browser sends to called Apache/2.4.33 (cPanel) OpenSSL/1.0.2o mod_bwlimited/1.4 Phusion_Passenger/5.1.12 containing the details of what the browser wants and will accept back from the web server.

DNS

HtmlToText

skip to content toggle navigation how to write string in java applet programs ? hello friends,my name is vivek and in this post i will show that how to write string in java applet programs. program that prints a “hello,world” using java applet : package applet_one; import java.awt.*; import java.applet.*; /* <applet code="appdemo0" height=700 width=800> </applet> */ public class applet_one extends applet { public void init() { // initialize the applet setbackground(color.darkgray); setforeground(color.cyan); } public void paint(graphics g) { g.drawstring("hello world!", 10, 30); } } output: as you can see in above code setbackground(); method sets the color of background of java applet and setforeground(); method sets the color of foreground of java applet. in paint method whatever you write that displays in java applet, as you can see that drawstring(); method writes the string or we can say that sets the string value in applet,the attribute 10 and 30 sets the distance from x as well as y direction. february 18, 2016 vivek javaapplet java applet , java applet programs , string in java applet , write string in java applet leave a comment implement bellman ford algorithm in java. bellman ford algorithm solves the single-source shortest-paths problem in the general case in which edge weights may be negative. bellman ford algorithm returns a boolean value indicating whether or not there is a negative-weight cycle that is reachable from the source. if there is no such cycle,the algorithm produces the shortest paths and their weights. lets implement bellman ford algorithm in java, import java.util.scanner; public class bellmanford { private int distances[]; private int numberofvertices; public static final int max_value = 999; public bellmanford(int numberofvertices) { this.numberofvertices = numberofvertices; distances = new int[numberofvertices + 1]; } public void bellmanfordevaluation(int source, int adjacencymatrix[][]) { for (int node = 1; node <= numberofvertices; node++) { distances[node] = max_value; } distances[source] = 0; for (int node = 1; node <= numberofvertices - 1; node++) { for (int sourcenode = 1; sourcenode <= numberofvertices; sourcenode++) { for (int destinationnode = 1; destinationnode <= numberofvertices; destinationnode++) { if (adjacencymatrix[sourcenode][destinationnode] != max_value) { if (distances[destinationnode] > distances[sourcenode] + adjacencymatrix[sourcenode][destinationnode]) distances[destinationnode] = distances[sourcenode] + adjacencymatrix[sourcenode][destinationnode]; } } } } for (int sourcenode = 1; sourcenode <= numberofvertices; sourcenode++) { for (int destinationnode = 1; destinationnode <= numberofvertices; destinationnode++) { if (adjacencymatrix[sourcenode][destinationnode] != max_value) { if (distances[destinationnode] > distances[sourcenode] + adjacencymatrix[sourcenode][destinationnode]) system.out.println("the graph contains negative egde cycle"); } } } for (int vertex = 1; vertex <= numberofvertices; vertex++) { system.out.println("distance of source " + source + " to " + vertex + " is " + distances[vertex]); } } public static void main(string... arg) { int numberofvertices = 0; int source; scanner scanner = new scanner(system.in); system.out.println("enter the number of vertices"); numberofvertices = scanner.nextint(); int adjacencymatrix[][] = new int[numberofvertices + 1][numberofvertices + 1]; system.out.println("enter the adjacency matrix"); for (int sourcenode = 1; sourcenode <= numberofvertices; sourcenode++) { for (int destinationnode = 1; destinationnode <= numberofvertices; destinationnode++) { adjacencymatrix[sourcenode][destinationnode] = scanner.nextint(); if (sourcenode == destinationnode) { adjacencymatrix[sourcenode][destinationnode] = 0; continue; } if (adjacencymatrix[sourcenode][destinationnode] == 0) { adjacencymatrix[sourcenode][destinationnode] = max_value; } } } system.out.println("enter the source vertex"); source = scanner.nextint(); bellmanford bellmanford = new bellmanford(numberofvertices); bellmanford.bellmanfordevaluation(source, adjacencymatrix); scanner.close(); } } output: january 7, 2016 vivek corejavatutorial , java bellman ford algorithm , bellmanford , implement bellman ford algorithm , implement bellman ford algorithm in java leave a comment implement the boyer moore string matching algorithm. the boyer-moore algorithm was developed by r.s.boyerand j.c.moore in 1977. the boyer-moore algorithm scans the characters of the pattern from right to left beginning with the rightmost one and performs the comparisons from right to left. in case of a mismatch or a complete match of the whole pattern it uses two pre-computed functions to shift the window to the right. lets see java program that implement the boyer moore string matching algorithm. import java.io.bufferedreader; import java.io.inputstreamreader; import java.io.ioexception; public class boyermoore { public void findpattern(string t, string p) { char[] text = t.tochararray(); char[] pattern = p.tochararray(); int pos = indexof(text, pattern); if (pos == -1) system.out.println("\nno match\n"); else system.out.println("pattern found at position : "+ pos); } public int indexof(char[] text, char[] pattern) { if (pattern.length == 0) return 0; int chartable[] = makechartable(pattern); int offsettable[] = makeoffsettable(pattern); for (int i = pattern.length - 1, j; i < text.length;) { for (j = pattern.length - 1; pattern[j] == text[i]; --i, --j) if (j == 0) return i; i += math.max(offsettable[pattern.length - 1 - j], chartable[text[i]]); } return -1; } private int[] makechartable(char[] pattern) { final int alphabet_size = 256; int[] table = new int[alphabet_size]; for (int i = 0; i < table.length; ++i) table[i] = pattern.length; for (int i = 0; i < pattern.length - 1; ++i) table[pattern[i]] = pattern.length - 1 - i; return table; } private static int[] makeoffsettable(char[] pattern) { int[] table = new int[pattern.length]; int lastprefixposition = pattern.length; for (int i = pattern.length - 1; i >= 0; --i) { if (isprefix(pattern, i + 1)) lastprefixposition = i + 1; table[pattern.length - 1 - i] = lastprefixposition - i + pattern.length - 1; } for (int i = 0; i < pattern.length - 1; ++i) { int slen = suffixlength(pattern, i); table[slen] = pattern.length - 1 - i + slen; } return table; } private static boolean isprefix(char[] pattern, int p) { for (int i = p, j = 0; i < pattern.length; ++i, ++j) if (pattern[i] != pattern[j]) return false; return true; } private static int suffixlength(char[] pattern, int p) { int len = 0; for (int i = p, j = pattern.length - 1; i >= 0 && pattern[i] == pattern[j]; --i, --j) len += 1; return len; } public static void main(string[] args) throws ioexception { bufferedreader br = new bufferedreader(new inputstreamreader(system.in)); system.out.println("boyer moore algorithm test\n"); system.out.println("\nenter text\n"); string text = br.readline(); system.out.println("\nenter pattern\n"); string pattern = br.readline(); boyermoore bm = new boyermoore(); bm.findpattern(text, pattern); } } output: january 7, 2016 vivek corejavatutorial , java boyer moore string matching , boyer moore string matching algorithm , implement the boyer moore , implement the boyer moore string matching algorithm leave a comment implement the rabin–karp matcher string matching algorithm. here,first i explains that what is string matching? and then i will write a java program to implement the rabin – karp matcher string matching algorithm. what is string matching? string matching is the technique of finding the instance of a character pattern in a given string. rabin-karp algorithm is used for finding the numeric pattern in a given text. now,lets see java program to implement the rabin – karp matcher string matching algorithm. import java.io.bufferedreader; import java.io.inputstreamreader; import java.io.ioexception; import java.util.random; import java.math.biginteger; public class rabinkarp { private string pat; private long pathash; private int m; private long q; private int r; private long rm; public rabinkarp(string txt, string pat) { this.pat = pat; r = 256; m = pat.length(); q = longrandomprime(); rm = 1; for (int i = 1; i <= m-1; i++) rm = (r * rm) % q; pathash = hash(pat, m); int pos = search(txt); if (pos == -1) system.out.println("\nno match\n"); else system.out.println("pattern found at position : "+ pos); } private long hash(string key, int m) { long h = 0; for (int j = 0; j < m; j++) h = (r * h + key.charat(j)) % q; return h; } private boolean check(string txt, int i) { for (int j = 0; j < m; j++) if (pat.charat(j) != txt.charat(i + j)) return false; return true; } private int search(string txt) { int n = txt.length(); if (n < m) return n; long txthash = hash(txt, m); if ((pathash == txthash) && check(txt, 0)) return 0; for (int i = m; i < n; i++) { txthash = (txthash + q - rm * txt.charat(i - m) % q) % q; txthash = (txthash * r + txt.charat(i)) % q; int offset = i - m + 1; if ((pathash == txthash) && check(txt, offset)) return offset; } return -1; } private static long longrandomprime() { biginteger prime = biginteger.probableprime(31, new random()); return prime.longvalue(); } public static void main(string[] args) throws ioexception { bufferedreader br = new bufferedreader(new inputstreamreader(system.in)); system.out.println("rabin karp algorithm test\n"); system.out.println("\nenter text\n"); string text = br.readline(); system.out.println("\nenter pattern\n"); string pattern = br.readline(); system.out.println("\nresults : \n"); rabinkarp rk = new rabinkarp(text, pattern); } } output: january 7, 2016 vivek corejavatutorial , java implement the rabin karp matcher string matching algorithm. , rabin – karp matcher string matching algorithm leave a comment write a program that implement divide and conquer method to find the maximum and minimum of n elements.use recursion to implement the divide and conquer scheme. first we see what is divide and conquer method in computer science ? and implement divide and conquer method to find the maximum and minimum of n elements in java language. what is divide and conquer method in computer science ? divide : divide the problem into a number of sub problems that are smaller instance of the same problem. conquer : conquer the sub problems by solving them recursively. combine : combine the solution to the sub problems into the solution for the original problem. now,lets implement divide and conquer method to find the maximum and minimum of n elements in java language. public class maxmin { static maxmin m=new maxmin(); static int max,min; public static void main(string ar[]) { int a[]={17,155,99,7,15,11,10,1}; maxmin.max=maxmin.min=a[0]; int[] getmaxmin=m.maxmin(a, 0, a.length-1, a[0], a[0]); system.out.println("max : "+getmaxmin[0]+"\nmin : "+getmaxmin[1]); } public int[] maxmin(int[] a,int i,int j,int max,int min) { int mid,max1,min1; int result[]=new int[2]; //small(p) if (i==j) { max = min = a[i]; } else if (i==j-1) // another case of small(p) { if (a[i] < a[j]) { this.max = getmax(this.max,a[j]); this.min = getmin(this.min,a[i]); } else { this.max = getmax(this.max,a[i]); this.min = getmin(this.min,a[j]); } } else { // if p is not small, divide p into sub-problems. // find where to split the set. mid = ( i + j )/2; // solve the sub-problems. max1=min1=a[mid+1]; maxmin( a, i, mid, max, min ); maxmin( a, mid+1, j, max1, min1 ); // combine the solutions. if (this.max < max1) this.max = max1; if (this.min > min1) this.min = min1; } result[0]=this.max; result[1]=this.min; return result; } public static int getmax(int i,int j) { if(i>j) return i; else return j; } public static int getmin(int i,int j) { if(i>j) return j; else return i; } } output: january 7, 2016 vivek corejavatutorial , java divide and conquer , divide and conquer method , find the maximum and minimum of n elements , implement divide and conquer , implement divide and conquer method leave a comment write a program that implements change making solution. assume that the cashier has currency notes in the denominations rs. 100, rs. 50, rs. 20, rs. 10, rs. 5 and rs. 1 in addition to coins . program should include a method to input the purchase amount and the amount given by the customer as well as method to output the amount of change and a breakdown by denomination. apply greedy algorithm at the cahier side that is give less number of coins if sufficient currency of that denomination available. the change-making problem addresses the following question: how can a given amount of money be made with the least number of coins of given denominations? it can be solved by dynamic dynamic programming or greedy approach.we will see an example of solving making change problem using greedy approach. so,lets see one example of making change problem; write a program that implements change making solution. assume that the cashier has currency notes in the denominations rs. 100, rs. 50, rs. 20, rs. 10, rs. 5 and rs. 1 in addition to coins . program should include a method to input the purchase amount and the amount given by the customer as well as method to output the amount of change and a breakdown by denomination. apply greedy algorithm at the cahier side that is give less number of coins if sufficient currency of that denomination available. import java.util.scanner; public class change { private int[] denom; change( int[] denom) { this.denom = denom; } void givechange(int changers) { system.out.println("\nchange for " + changers + " in rs " + ":"); for(int i = 0; i < denom.length; ++i) { int nb = changers / denom[i]; if(nb > 0) system.out.println(nb + " " + denom[i]); changers %= denom[i]; } } public static void main(string[] args) { int[] rs = {100,50,20,10,5,1}; scanner input=new scanner(system.in); system.out.println("enter the purchase amount : "); int purchaseamount=input.nextint(); system.out.println("enter the amount given by customer : "); int amountgivenbycusto=input.nextint(); if(amountgivenbycusto<purchaseamount){ system.out.println("sorry! you paid less than purchase amount! "); }else { int result=amountgivenbycusto-purchaseamount; change change1 = new change( rs); change1.givechange(result); } } } output: january 5, 2016 vivek corejavatutorial , java change making , implements change making , implements change making in java , implements making change problem , making change problem , making change problem in java leave a comment write a program to determine whether or not a character string has an unmatched parentheses. use a stack. the question is what is parentheses ?answer is very simple that parentheses also called bracket . either of a pair of characters, ( ), used to enclose such a phrase or as a sign of aggregation in mathematical or logical expressions. lets write a program to determine whether or not a character string has an unmatched parentheses using a stack in java : import java.io.ioexception; public class bracketchecker { private string input; public bracketchecker(string in) { input = in; } public void check() { int stacksize = input.length(); stack thestack = new stack(stacksize); for (int j = 0; j < input.length(); j++) { char ch = input.charat(j); switch (ch) { case '{': // opening symbols case '[': case '(': thestack.push(ch); // push them break; case '}': // closing symbols case ']': case ')': if (!thestack.isempty()) // if stack not empty, { char chx = thestack.pop(); // pop and check if ((ch == '}' && chx != '{') || (ch == ']' && chx != '[') || (ch == ')' && chx != '(')) system.out.println("error: " + ch + " at " + j); } else system.out.println("error: " + ch + " at " + j); break; default: // no action on other characters break; } } if (!thestack.isempty()) system.out.println("error: missing right delimiter"); } public static void main(string[] args) throws ioexception { string input = "{computer {algoritham}"; bracketchecker thechecker = new bracketchecker(input); thechecker.check(); } } class stack { private int maxsize; private char[] stackarray; private int top; public stack(int max) { maxsize = max; stackarray = new char[maxsize]; top = -1; } public void push(char j) { stackarray[++top] = j; } public char pop() { return stackarray[top--]; } public char peek() { return stackarray[top]; } public boolean isempty() { return (top == -1); } } output: january 5, 2016 vivek corejavatutorial , java bracketchecker , parentheses leave a comment the array a[0:9]=[4,2,6,7,1,0,9,8,5,3] is to be sorted using insertion sort. first we understand what is insertion sort,insertion sort is a simple sorting algorithm that builds the final sorted list(or array) one item at a time. it is much less efficient on large lists than more advanced algorithms such as quicksort, heapsort, or merge sort. it always maintains a sorted sublist in the lower positions of the list. each new item is then “inserted” back into the previous sublist such that the sorted sublist is one item larger. now,lets implement insertion sort in java. public class myinsertionsort { public static void main(string[] args) { int[] input = {4,2,6,7,1,0,9,8,5,3}; insertionsort(input); } private static void printnumbers(int[] input) { for (int i = 0; i < input.length; i++) { system.out.print(input[i] + ", "); } system.out.println("\n"); } public static void insertionsort(int array[]) { int n = array.length; for (int j = 1; j < n; j++) { int key = array[j]; int i = j-1; while ( (i > -1) && ( array [i] > key ) ) { array [i+1] = array [i]; i--; } array[i+1] = key; printnumbers(array); } } } output: january 5, 2016 vivek corejavatutorial , java implement insertion sort , implement insertion sort in java , insertion sort , myinsertionsort leave a comment write a recursive and nonrecursive function to compute n factorial and java program to compute n factorial the factorial of a non-negative integer n, denoted by n!, is the product of all positive integers less than or equal to n. for example, the value of 0! is 1, 2! is 2, 3! is 6 etc. recursion in computer science is a method where the solution to a problem depends on solutions to smaller instances of the same problem. function to compute n factorial using recursive method : public int factorial(int n) { if (n == 0) return 1; else return n * factorial(n-1); } now,lets write a java program to find factorial of given number using recursive method : import java.util.scanner; class factorialdemo{ public static void main(string args[]){ scanner scanner = new scanner(system.in); system.out.println("enter the number:"); int num = scanner.nextint(); int factorial = fact(num); system.out.println("factorial of entered number is: "+factorial); } static int fact(int n) { int output; if(n==1){ return 1; } //recursion: function calling itself!! output = fact(n-1)* n; return output; } } output : so,our next question is how can we find factorial of given number using nonrecursive method or we can say it iterative method. here is function to compute n factorial using non-recursive method : int factorial ( int input ) { int x, fact = 1; for ( x = input; x > 1; x--) fact *= x; return fact; } now,lets write a java program to find factorial of given number using nonrecursive method. import java.util.scanner; public class factorial { public static void main(string[] args) { scanner scanner = new scanner(system.in); system.out.print("enter the number: "); int n = scanner.nextint(); int result = factorial(n); system.out.println("the factorial of " + n + " is " + result); } public static int factorial(int n) { int result = 1; for (int i = 1; i <= n; i++) { result = result * i; } return result; } } output: january 5, 2016 vivek corejavatutorial , java compute n factorial , factorial , function to compute n factorial , java program to compute n factorial , recursion , recursive and nonrecursive function to compute n factorial leave a comment android button example- how to add button in android application. button is a very common component in user interface.you can write text or put any icon on button so user can understand what action occurs when they press or touches it. in android programming to display a normal button “android.widget.button” class is used. i will show you, how to add button in android application and the use of click listener. when user touches the button then the url which is written in “onclick listener” opens in a default browser. now, the steps for creating this application are : design your ui in .xml file. create a java file. add onclick listener in java file. your activity_main.xml file : <? xml version =" 1.0 " encoding =" utf-8 " ?> < linearlayout xmlns:android =" http://schemas.android.com/apk/res/android " android:layout_width =" fill_parent " android:layout_height =" fill_parent " android:orientation =" vertical " > < button android:id =" @+id/button1 " android:layout_width =" wrap_content " android:layout_height =" wrap_content " android:text =" button - go to www.vivekbarot.com " / > < / linearlayout > once you design your ui in “activity_main.xml” file, write your code in “mainactivity.java” file. your mainactivity.java file: package com.example.button; import android.support.v7.app.actionbaractivity; import android.content.intent; import android.net.uri; import android.os.bundle; import android.view.menu; import android.view.menuitem; import android.view.view; import android.view.view.onclicklistener; import android.widget.button; public class mainactivity extends actionbaractivity { button button; @override protected void oncreate(bundle savedinstancestate) { super.oncreate(savedinstancestate); setcontentview(r.layout.activity_main); addlisteneronbutton(); } private void addlisteneronbutton() { // todo auto-generated method stub button = (button) findviewbyid(r.id.button1); button.setonclicklistener(new onclicklistener() { @override public void onclick(view arg0) { intent browserintent = new intent(intent.action_view, uri.parse("http://www.vivekbarot.com")); startactivity(browserintent); } }); } @override public boolean oncreateoptionsmenu(menu menu) { // inflate the menu; this adds items to the action bar if it is present. getmenuinflater().inflate(r.menu.main, menu); return true; } @override public boolean onoptionsitemselected(menuitem item) { // handle action bar item clicks here. the action bar will // automatically handle clicks on the home/up button, so long // as you specify a parent activity in androidmanifest.xml. int id = item.getitemid(); if (id == r.id.action_settings) { return true; } return super.onoptionsitemselected(item); } } now run it as android application. here is the first view of applicatin : now, this is second view of application when you touches the button. november 1, 2014 vivek android leave a comment 1 2 3 … 7 » pages best public & open torrent trackers list of 2017 recent posts how to write string in java applet programs ? implement bellman ford algorithm in java. implement the boyer moore string matching algorithm. implement the rabin–karp matcher string matching algorithm. write a program that implement divide and conquer method to find the maximum and minimum of n elements.use recursion to implement the divide and conquer scheme. recent comments archives february 2016 january 2016 november 2014 september 2013 july 2013 june 2013 categories android corejavatutorial css html html5 java javaapplet php sql vbscript meta log in entries rss comments rss wordpress.org proudly powered by wordpress | theme: lineday by zack .

URL analysis for vivekbarot.com

http://vivekbarot.com/wp-login.php
http://vivekbarot.com/tag/implement-bellman-ford-algorithm/
http://vivekbarot.com/2013/07/
http://vivekbarot.com/category/css/
http://vivekbarot.com/tag/recursive-and-nonrecursive-function-to-compute-n-factorial/
http://vivekbarot.com/implement-the-rabin-karp-matcher-string-matching-algorithm/
http://vivekbarot.com/category/javaapplet/
http://vivekbarot.com/page/7/
http://vivekbarot.com/category/sql/
http://vivekbarot.com/#content
http://vivekbarot.com/feed/
http://vivekbarot.com/best-public-open-torrent-trackers-list-of-2016/
http://vivekbarot.com/comments/feed/
http://vivekbarot.com/write-a-program-to-determine-whether-or-not-a-character-string-has-an-unmatched-parentheses-use-a-stack/
http://vivekbarot.com/tag/boyer-moore-string-matching/

Whois Information

Whois is a protocol that is access to registering information. You can reach when the website was registered, when it will be expire, what is contact details of the site with the following informations. In a nutshell, it includes these informations;

Domain Name: VIVEKBAROT.COM
Registry Domain ID: 1807210142_DOMAIN_COM-VRSN
Registrar WHOIS Server: whois.godaddy.com
Registrar URL: http://www.godaddy.com
Updated Date: 2017-06-05T09:37:16Z
Creation Date: 2013-06-09T10:03:16Z
Registry Expiry Date: 2018-06-09T10:03:16Z
Registrar: GoDaddy.com, LLC
Registrar IANA ID: 146
Registrar Abuse Contact Email: [email protected]
Registrar Abuse Contact Phone: 480-624-2505
Domain Status: clientDeleteProhibited https://icann.org/epp#clientDeleteProhibited
Domain Status: clientRenewProhibited https://icann.org/epp#clientRenewProhibited
Domain Status: clientTransferProhibited https://icann.org/epp#clientTransferProhibited
Domain Status: clientUpdateProhibited https://icann.org/epp#clientUpdateProhibited
Name Server: NS1.MD-IN-28.WEBHOSTBOX.NET
Name Server: NS2.MD-IN-28.WEBHOSTBOX.NET
DNSSEC: unsigned
URL of the ICANN Whois Inaccuracy Complaint Form: https://www.icann.org/wicf/
>>> Last update of whois database: 2017-09-29T04:42:22Z <<<

For more information on Whois status codes, please visit https://icann.org/epp

NOTICE: The expiration date displayed in this record is the date the
registrar's sponsorship of the domain name registration in the registry is
currently set to expire. This date does not necessarily reflect the expiration
date of the domain name registrant's agreement with the sponsoring
registrar. Users may consult the sponsoring registrar's Whois database to
view the registrar's reported date of expiration for this registration.

TERMS OF USE: You are not authorized to access or query our Whois
database through the use of electronic processes that are high-volume and
automated except as reasonably necessary to register domain names or
modify existing registrations; the Data in VeriSign Global Registry
Services' ("VeriSign") Whois database is provided by VeriSign for
information purposes only, and to assist persons in obtaining information
about or related to a domain name registration record. VeriSign does not
guarantee its accuracy. By submitting a Whois query, you agree to abide
by the following terms of use: You agree that you may use this Data only
for lawful purposes and that under no circumstances will you use this Data
to: (1) allow, enable, or otherwise support the transmission of mass
unsolicited, commercial advertising or solicitations via e-mail, telephone,
or facsimile; or (2) enable high volume, automated, electronic processes
that apply to VeriSign (or its computer systems). The compilation,
repackaging, dissemination or other use of this Data is expressly
prohibited without the prior written consent of VeriSign. You agree not to
use electronic processes that are automated and high-volume to access or
query the Whois database except as reasonably necessary to register
domain names or modify existing registrations. VeriSign reserves the right
to restrict your access to the Whois database in its sole discretion to ensure
operational stability. VeriSign may restrict or terminate your access to the
Whois database for failure to abide by these terms of use. VeriSign
reserves the right to modify these terms at any time.

The Registry database contains ONLY .COM, .NET, .EDU domains and
Registrars.

  REGISTRAR GoDaddy.com, LLC

SERVERS

  SERVER com.whois-servers.net

  ARGS domain =vivekbarot.com

  PORT 43

  TYPE domain

DOMAIN

  NAME vivekbarot.com

  CHANGED 2017-06-05

  CREATED 2013-06-09

STATUS
clientDeleteProhibited https://icann.org/epp#clientDeleteProhibited
clientRenewProhibited https://icann.org/epp#clientRenewProhibited
clientTransferProhibited https://icann.org/epp#clientTransferProhibited
clientUpdateProhibited https://icann.org/epp#clientUpdateProhibited

NSERVER

  NS1.MD-IN-28.WEBHOSTBOX.NET 111.118.215.252

  NS2.MD-IN-28.WEBHOSTBOX.NET 111.118.215.252

  REGISTERED yes

Mistakes

The following list shows you to spelling mistakes possible of the internet users for the website searched .