• Algorithms

    Posted on May 5th, 2011

    Written by Geek

    Tags

    List of Cyber crime in today’s Internet Information Technology

    List of Cyber crime in today’s Internet Information Technology Criminal activities that are perpetrated using communication networks such as the Internet, telephone, wireless, satellite, and mobile networks are known as cyber crimes. The following are types of cyber crime: Cyberterrorism: Refers to premeditated attacks on computers and computer networks with an intention to cause harm or further social, ideological, religious, political, [...]

    Print Friendly

  • Algorithms, Matlab, Programming

    Posted on April 29th, 2011

    Written by Geek

    Tags

    , ,

    Program for color image processing using matlab

    Program for color image processing Color Approximation To reduce the number of colors in an image, use the rgb2ind function. This function converts a truecolor image to an indexed image, reducing the number of colors in the process. rgb2ind provides the following methods for approximating the colors in the original image: Quantization Uniform quantization Minimum variance quantization Colormap [...]

    Print Friendly

  • Algorithms, OOPs Lab Programs

    Posted on April 28th, 2011

    Written by Geek

    Tags

    Algorithm for tree traversal

    Algorithm for tree traversal Preorder(root) If root = null then exit Process root->info Preorder root->left; Preorder root->right Exit Inorder(root) If root = null then exit Inorder root->left Process root->info Inorder root->right Exit Postorder(root) If root = null then exit Postorder root->left Postorder root->right Postorder root->info exit Program Listing   // traversing a tree #include <stdio.h> [...]

    Print Friendly

  • Algorithms, OOPs Lab Programs

    Posted on April 28th, 2011

    Written by Geek

    Tags

    ALGORITHM TO MERGE TWO SORTED ARRAY

    ALGORITHM TO MERGE TWO SORTED ARRAY ENTER (a[10],n) 1. Repeat step 2 for i = 0 to (n-1) 2. Input a[i] 3. Return DISPLAY(c[20],p) 1. Repeat step 2 for k = 0 to p-1 2. Print c[k] 3. Return MAIN( ) 1. Start st nd 2. Input no. of elements in 1 & 2 array [...]

    Print Friendly

  • Algorithms, OOPs Lab Programs

    Posted on April 28th, 2011

    Written by Geek

    Tags

    ALGORITHM TO SORT ARRAY USING SELECTION SORT

    ALGORITHM TO SORT ARRAY USING SELECTION SORT steps 1. For (i = 0; i

    Print Friendly

  • Algorithms, OOPs Lab Programs

    Posted on April 28th, 2011

    Written by Geek

    Tags

    ALGORITHM TO SORT ARRAY USING BUBBLE SORT

    ALGORITHM TO SORT ARRAY USING BUBBLE SORT Steps 1. Repeat steps 2 & 3 for k = 1 to N-1 2. Set ptr =1 3. Repeat while ptr data[ptr + 1],then Interchange data[ptr] and data[ptr + 1] (b) ptr = ptr + 1 5. Exit bubble sort listing   #include <stdio.h> #include <conio.h> void main() [...]

    Print Friendly

  • Algorithms, OOPs Lab Programs

    Posted on April 28th, 2011

    Written by Geek

    Tags

    ALGORITHM TO EVALUATE POSTFIX EXPRESSION

    ALGORITHM TO EVALUATE POSTFIX EXPRESSION Steps P -> postfix expression breve 1. Add a right parenthesis “)” at the end of P 2. Scan P from left to right and repeat steps 3 & 4 until sentinel “)” is encountered 3. If an operand is encountered, put it on stack 4. If an operator is [...]

    Print Friendly

  • Algorithms, OOPs Lab Programs

    Posted on April 28th, 2011

    Written by Geek

    Tags

    ALGORITHM TO CONVERT AN INFIX TO POSTFIX EXPRESSION

    ALGORITHM TO CONVERT AN INFIX TO POSTFIX EXPRESSION Note: Q -> arithmetic expression breve P -> postfix expression breve Steps: 1. Push “(“ onto stack, and add “)” to the end of Q 2. Scan Q from left to right and repeat steps 3 to 6 for each element of Q untill the stack is [...]

    Print Friendly

  • Algorithms

    Posted on April 28th, 2011

    Written by Geek

    Tags

    ALGORITHM TO IMPLEMENT STACK AS LINKED LIST

    ALGORITHM TO IMPLEMENT STACK AS LINKED LIST PUSH( ) 1. t = newnode( ) 2. Enter info to be inserted 3. Read n 4. t info = n breve 5. t next = top breve 6. top = t 7. Return POP( ) 1. If (top = NULL) Print “ underflow” Return 2. x = [...]

    Print Friendly

  • Algorithms

    Posted on April 28th, 2011

    Written by Geek

    Tags

    ALGORITHM TO IMPLEMENT STACK USING ARRAY

    ALGORITHM TO IMPLEMENT STACK USING ARRAY INSERTION PUSH(item) 1. If (item = max of stack) Print “overflow” Return 2. top = top + 1 3. stack[top] = item 4. Return DELETION POP(item) 1. If (top = – 1) Print “underflow” Return 2. Item = stack[top] 3. top = top – 1 4. Return DISPLAY 1. [...]

    Print Friendly

  • Older Posts Yeah! There are more posts, check them out.

Switch to our mobile site

PHVsPjwvdWw+