Pages

Sunday, November 20, 2011

NIC(National Informatics Center)

NIC-2011(National Informatics Center) Question Paper Pattern:


             We have Total 100 questions (Part A :75q of 1 Mark n B:25q of 3 marks) Time 2hrs.


some questions i remembered :


1) Which of the following processor is used in Mobile phones
            a) Pentium                        b) AMD
            c) ARM                          d) None of d Above

2)  Which of the following  is used as Mobile Operating system
             a) Android                        b) Windows7 Mobile
             c) Symbian                       d) All d Above 


3) 8-Queen Problem is solved by using
                      BackTracking Method

4) Peep Hole Optimization is used for  Removing 
             a) Un Reachable Code                b) Multiple Jumps
             c) Redundancy                            d) All d Above 

   Source for Answer :  http://programming4.us/desktop/462.aspx

5) ARP is used in 

6)  Real Time Process Scheduling Based on
              a) SFJ                    b) Priority Based
              c)  FCFS               d) None of d Above

7)  Port Address is used for
              a) Physical                                    b) Network
              c)  Application/Process               d) None of d Above

8)  Maximum Height of AVL tree with 10 Nodes

9)  Code Snippet 
          #include<stdio.h>
            void main()
              {
                
                       printf("%d",printf("COMPUTER SCIENCE"));
                
              }

                      a)16COMPUTER SCIENCE   b) COMPUTER SCIENCE16
                     c) Compiler Error                       d) None of d Above


Because First Inside Printf completes Printing later , Since %d is for Integer Format specifier it Count the Characters including Space and Print 16. 

10) Code snippet 
     
            fun (n)
               {
                      if (n==1)
                        return(1);
                    else
                       return(fun(n-1)+fun(n-1));

                 }

      void main()
      {
     fun(some value);
       }
           Here n>1 then what is the Time Complexity 

                               a) O(n)                     b) O(n+1)
                               c) O(n^2)                 c) None of d above

11)  Maximum Effort in Project Development is at
                       a) Testing                b) Coding
                       c) Maintenance     d) Analysis


Proof




12) #init 6 will do

    
Init is a Linux Command to Change Runlevel and Init 6 is Used to Restart The System

13) Which command is used to Change the Table

                    a) Create                b) Update
                    c) Select                  d) ALTER    


14) which is not Java Keyword 
                 a) transient                                          b) native
                 c) virtual  (C++ keyword)                 d) Serializable 

15) what is the Data Structure that RDBMS uses 
              may be Array 



16)String Satisfies :  aa*+aba*b*
          In RE + means at least once
                    * means 0 r more Times

so starting with 'a' and another a optional and since + is there that a must appear one r more times , after that in string ab must and every thing else is optional

          so string should be    :  ....a...ab.....       

17 Average waiting time of the Process  (3marks)
entry time at 0 ms

p0-----10
p1-----25
p2-----03
p3-----09
p4-----05
p5-----11


18) Scope of Java Bean Object using with Jsp
             a)application         b) request
             c) session             d) Response

19) Cookies are stored at : Client side Browser

20)  Ad-Hoc Network is
          a) Fly Free             b) Infrastructure Free
          c) All d above  d) Microwave  

21) main()
       {
          char a[]= world
for(i=0,j=5; i<j ; a[i++]=a[j--])
  {
     Printf("%s",a); 
 }

       rldrld 
 her i n j  are Post Increments so first Shuffle              


                         













No comments:

Post a Comment