Dispaly top n rows in SQL | Display last n rows in SQL | Display nth Row in SQL

 

For Explanation watch video::





* rownum

=======







fetching top 1,2,5 rows



fetching the 2nd row from table






Fetch last two roes





Comments

Post a Comment

Popular posts from this blog

Java Stack Hackerrank Solution

Image
 Java Stack Hackerrank Solution For Explanation watch video:  Sample Input {}() ({()}) {}( [] Sample Output true true false true Code: import  java.util.*; class  Solution{           public   static   void  main(String []argh)     {         Scanner sc =  new  Scanner(System.in);                   while  (sc.hasNext()) {             String input=sc.next();             System.out.println(valid(input));         }              }      static   boolean  valid(String s){    ...
Read more

Print Prime Numbers Hackerrank Solution - PL/SQL

Image
 Print Prime Numbers Hackerrank Solution - PL/SQL For Explanation watch video: Code:: set serveroutput on; declare output clob := ''; co number; begin  for i in 2..1000 loop      co := 0;      for j in 2..(i/2) loop        if mod(i,j)=0          then            co := 1;            exit;         end if;     end loop;     if co = 0      then        output :=  output || i ||'&';     end if;     end loop;     dbms_output.put_line(substr(output,1,length(output)-1)); end; /
Read more

Java BitSet Hackerrank Solution

Image
 Java BitSet Hackerrank Solution For Explanation Watch video:: Sample Input 5 4 AND 1 2 SET 1 4 FLIP 2 2 OR 2 1 Sample Output 0 0 1 0 1 1 1 2 Code: import  java.io.*; import  java.util.*; public   class  Solution {      public   static   void  main(String[] args) {         Scanner s =  new  Scanner(System.in);          int  n = s.nextInt();          int  m = s.nextInt();         BitSet b1 =  new  BitSet(n);         BitSet b2 =  new  BitSet(n);          for ( int  i= 0 ;i<m;i++){             String ip = s.nex...
Read more