C

Self reproducing Program:

     char*f="char*f=%c%s%c;main()
     {printf(f,34,f,34,10);}%c";
     main(){printf(f,34,f,34,10);}

XML & XSLT

SQL

SQL script that will remove extra rows from the table below based on non-unique id and datetime of creation. Leave the last row for the day, based on datetime for each id without using any SQL aggregation functions.

> select Id, creation_time from test;

Id creation_time

1 03/05/2007 12:02:09

1 03/05/2007 11:45:00

1 03/05/2007 13:05:54

1 03/05/2007 15:59:59

2 03/05/2007 10:55:01

2 03/05/2007 11:15:02

2 03/05/2007 16:23:34

The content of table after script execution should be:

> select Id, creation_time from test;

1 03/05/2007 15:59:59

2 03/05/2007 16:23:34

DELETE FROM Test WHERE NOT EXISTS
(SELECT T1.Id, T1.Creation_time FROM(

SELECT DISTINCT T.Id, (SELECT TOP 1 Creation_time From Test WHERE Id = T.Id ORDER BY Creation_time DESC) AS Creation_time
FROM Test AS T) AS T1
WHERE T1.Id = Test.Id AND T1.Creation_time = Test.Creation_time)
;

JAVA

/*
 * GenTelString.java
 * Given a ten digit phone number, as a string(format is your discretion, 1234567890, 123-456-7890, (123)456-7890, etc..),
 * generate all the letter combinations that are possible based on the telephone keypad's number/letter relationship
 * (i.e. 1 is related to no letters, 2 is related to 'a' 'b' 'c', 3 is related to 'd' 'e' 'f', etc).
 */
import java.io.*;
import javax.swing.*;
public class GenTelString {
   
    /** Creates a new instance of GenTelString */
   
   static char a[][] = {
        {},
        {},
        {'a','b','c'},
        {'d','e','f'},
        {'g','h','i'},
        {'j','k','l'},
        {'m','n','o'},
        {'p','q','r','s'},
        {'t','u','v'},
        {'w','x','y','z'}
    };
           int[] first = new int[10];
           int[] second = new int[10];
           int[] pos = new int[10];
           
           boolean more = true;
            long MAX = 9999999999L;
    public GenTelString(String s) {
   
        more = true;
               try
            {
                long ll = Long.parseLong(s);
                if(ll > MAX || s.length() != 10 || ll < 0)
                {
                   System.out.println(s+"-> errorneous Telphone#");
                   //System.out.println("LL"+ll);
                }
                else
                {
                    System.out.println(s+"-->");
                    for(int j=0; j<10; j++)
                    {
                        first[j] = Integer.parseInt(s.substring(j,j+1));
                        second[j] = a[first[j]].length;
                        pos[j] = 0;
           // System.out.println( first[j] );
           // System.out.println(second[j]);
            //System.out.println(pos[j]);
                    }
           
                        while(more) 
                        {
                            System.out.println(getString());
                        }
                    }
                }
            catch(NumberFormatException e)
            {
              System.out.println(s+"---> errorneous Telphone#"); 
             
            }
        }
   
    public static void main (String argv[])
    {
            String[] s = {
                "08050708031","3009000007", "1006000000"
            };
            for(int i=0;i<s.length;i++)
            {GenTelString g = new GenTelString(s[i]);}

    }
   
    public  String getString()
    {
        StringBuffer alpha = new StringBuffer();
           
        for(int j =0; j<10; j++)
            if(a[first[j]].length !=0)alpha.append(a[first[j]][pos[j]]);
       
        for(int j = 9; j > -1; j--)
        {
           //System.out.println(j);
            if(second[j] ==0 || pos[j] == second[j] - 1) {
                more = false;
             //   System.out.println("j->" + j);
            }
            else
            {
                more = true;pos[j]++;
            for(int k = j+1; k<10;k++)pos[k]=0;
               
               // String input = JOptionPane.showInputDialog("enter");
                break;
            }
        }

        return alpha.toString();
    }
    }

PSEUDO

Given 3 cell phone towers and 1 cell phone, calculate which tower is closest to the cell phone at any point in time for a mobile cell phone.