sites.google.com
BeeeBeees
https://sites.google.com/site/beeebeees
Megabyte Computer Center [09836081883]. Megabyte Computer Center [09836081883]. Computer Tuition for :. B Sc, B.tech, BE, MCA and School Syllabus for all Boards. Blog for Computer Notes : http:/ open-sesames.blogspot.com. Jul 28, 2011, 7:00 AM. Jul 20, 2011, 9:10 PM. Jul 20, 2011, 9:10 PM. Jul 20, 2011, 9:10 PM. Jul 20, 2011, 9:10 PM. Jul 20, 2011, 9:10 PM.
open-sesames.blogspot.com
BhejaFry - The Brain Storm: Array - XIII [ Bucket Sort ]
http://open-sesames.blogspot.com/2015/06/array-xiii-bucket-sort.html
BhejaFry - The Brain Storm. Thursday, June 25, 2015. Array - XIII [ Bucket Sort ]. Bucket sort algorithm works by dividing an array into a number of buckets and then sort the number in each bucket using different sorting algorithm. It has some similarities to radix-sort. Bucket sort works as follows:. 1 Add the number of the array to the empty “buckets” depending number of digits. 2 Sort each non-empty buckets. Pick the numbers from each buckets in order and put back the elements into the original array.
open-sesames.blogspot.com
BhejaFry - The Brain Storm: September 2014
http://open-sesames.blogspot.com/2014_09_01_archive.html
BhejaFry - The Brain Storm. Thursday, September 4, 2014. Array - XI [ Radix Sort ]. The list is sorted by least significant bits (unit place). The list is sorted tenth place. The list is sorted hundred place. Running time for this example is:. K = number of buckets = 10(0 to 9). N = number of elements to be sorted = 15. D = digits or maximum length of element = 2. Thus in our example, the algorithm will take. Void radixsort(int a[],int n). 1 int rear[10],front[10],first,p,q,exp,k,i,y,j;. 4 int data;.
open-sesames.blogspot.com
BhejaFry - The Brain Storm: Array - XII [ Shell Sort ]
http://open-sesames.blogspot.com/2015/06/array-xii-shell-sort.html
BhejaFry - The Brain Storm. Friday, June 5, 2015. Array - XII [ Shell Sort ]. S largely a deviation of Insertion Sort , it is also one of the oldest sorting. Algorithms. Shellsort is named after its inventor Donald Shell. Worst case performance O(n 2). Best case performance O(N). Average case performance depends on gap sequence. Function shellsort(int arr[],int n). Int last,tmp,limit,temp,k. For k=0 to limit-1 step 1. If arr[k] arr[k mid]. If tmp= 0 then. Import java.io.*;. Void shellsort(int Arr[],int n).
open-sesames.blogspot.com
BhejaFry - The Brain Storm: July 2014
http://open-sesames.blogspot.com/2014_07_01_archive.html
BhejaFry - The Brain Storm. Thursday, July 31, 2014. Array - VI [ Selection Sort ]. 8211; This form of sorting algorithms finds the minimum value, swaps it with the value in the first position, and repeats these steps for the remainder of the list. It does no more than n swaps. Let n = array length = size of the array and outer loop variable is ‘i’. The outer loop is executed n-1 times. Each time the outer loop is executed, the inner loop is executed. Result is n * n/2 * k, that is, O(n2/2 k) = O(n2).
open-sesames.blogspot.com
BhejaFry - The Brain Storm: February 2014
http://open-sesames.blogspot.com/2014_02_01_archive.html
BhejaFry - The Brain Storm. Thursday, February 27, 2014. Nested Loop - IV. Magic Numbers : When the sum of digits of a number resultant to 1. Eg 19 = 1 9 = 10 = 1 0 = 1. Import java.io.*;. Public static void main(String args[])throws IOException. Magic Happy MH=new Magic Happy();. BufferedReader Br=new BufferedReader(new InputStreamReader(System.in) ;. System.out.print(" n tEnter a number ");. N=Integer.parseInt(Br.readLine() ;. System.out.print(" n t" n " is a Magic Number");. Int m=n,s=0;. Int m=n,s=0;.
open-sesames.blogspot.com
BhejaFry - The Brain Storm: April 2014
http://open-sesames.blogspot.com/2014_04_01_archive.html
BhejaFry - The Brain Storm. Thursday, April 24, 2014. Scanner class - III [Examples]. Token parsing using default delimiter and user defined delimiter-. Import java.util.*;. Public static void main(String args[]). Scanner sc=new Scanner(System.in);. System.out.print(" tEnter a Sentence : ");. Sc1=new Scanner(St);/ .useDelimiter(" ");. System.out.println(" n tDefaul Delimiter : n");. System.out.println(" t" sc1.next() ;. System.out.print(" tEnter a Sentence : ");. Sc1=new Scanner(St).useDelimiter(",");.
open-sesames.blogspot.com
BhejaFry - The Brain Storm: October 2013
http://open-sesames.blogspot.com/2013_10_01_archive.html
BhejaFry - The Brain Storm. Thursday, October 31, 2013. Answer = 5, 1 if both bits are 1 else 0. Answer= 7, 0 if both bits are 0 or else 1. Answer= 2, 1 if odd nos. of 1 present. Expr 1) will give -4 which is 1100 in 2's complement form due to a signed binary number. Bitwise Unsigned Right Shift. Public class Bitwise Operator. Public static void main(String args[]). Bitwise Operator bp=new Bitwise Operator();. Int Num1=25; / 11001. Int Num2=5; / binary 00101. Int Num1=75,Num2=-25;. System.out.pri...Binar...
open-sesames.blogspot.com
BhejaFry - The Brain Storm: June 2013
http://open-sesames.blogspot.com/2013_06_01_archive.html
BhejaFry - The Brain Storm. Thursday, June 27, 2013. Binary Tree – C . Void preorder(node *);. Void inorder(node *);. Void postorder(node *);. Node *insert(node *root,int val). Root- left=root- right=NULL;. Root- left=insert(root- left,val);. Root- right=insert(root- right,val);. Void node: inorder(node *root). Cout root- data;. Void node: preorder(node *root). Cout root- data;. Void node: postorder(node *root). Cout root- data;. Node nD,*tree=NULL;. Int ch,val;. Cout " n t t* *Binary Tree.* *";. Program...
open-sesames.blogspot.com
BhejaFry - The Brain Storm: August 2013
http://open-sesames.blogspot.com/2013_08_01_archive.html
BhejaFry - The Brain Storm. Thursday, August 29, 2013. Exception Handling - Examples. Unchecked java.lang.ArithmeticException: / by zero will terminates the program*/. Public class Exception 1. Public static void main(String args[]). Int a=5,b=0;. System.out.println(a/b);. System.out.println(" nThe - ArithmeticException() / divide by 0 will ");. Output : Following exception will be thrown at the line “System.out.println(a/b);”. Javalang.ArithmeticException: / by zero. Users Defined Exception :. Javalang&...
SOCIAL ENGAGEMENT