nic 2009

1. NATIONAL INFORMATICS CENTER EXAMINATION Feb 22nd, 2009
INSTRUCTIONS:
• This year the paper consists of 100 objective type questions out of which 75
questions are of 1 mark and 25 questions are of 3 marks and duration is 2.00Hrs sets
are 4 (A,B,C,D).
• There is negative marking, for each wrong answer i.e., 1/3rd mark will be deducted
.
Some of the few questions are as follows: Mainly the questions are from
computer networks, java, operating system, Network security algorithms and
pblms(RSA,RC4,ENCRYPTION,DECRYPTION), history of computers,
software engineering.
1 mark questions:
1. RAID related to ?(hard disk)
2. What is Von Neumann Architecture (SIMD/MIMD like this one question)
3. Software is? (options are: set of instructions +operating system +hardware
manuals)
4. In cpu where the i/p and o/p’s are stored(registers).
5. If semaphore variable is 8 after 6 wait operations and 3 signal operations what is
value of semaphore?
6. OFMD abbreviation(Orthogonal frequency multiplexing division)
7. In ms word how you change password(menu bar->tools->options->security)
8. Question on network interoperatability microwave(wiMAX).
9. pblms on network band with
10. merge sort worst case time complexity(O(nlogn))
11. spiral model mainly for (performance or risk or quality management)
12. Cocomo II model measures in (functional point or lines of code)
13. pblm on recursion function
14. i=129 , j=-1>>3,k= i & j? bitwise operator pblm?
15. ACID properties (Atomicity,Consistency,Isolation,Durability).
16. Select a,b from r where b=10; sigma(selection) pie (projection notation).
17. paging or swapping something (same question repeated twice)
18. Smallest processor by intel(atom)
19. If download rate is 56kbps in 2 minutes maximum file downloaded is?
20. Integration testing is type of(bottom up/topdown/sandwich testing)
21. pblm on test cases and batch cases
22. question on network protocol
23. c inherits from b which inherits from a order of destructors(c,b,a).
24. infix expression to post fix

2. 25. For given tree write BFS?
26. Question on cohesion in software engineering
27. If tree height is h total no.of nodes is(2^h-1)
28. spooled device is(printer).
29. which is not an IDE(tomcat, jsp,Ado… something)
30. Not oop’s language(.net)
31. To accessing the data sources(SQL)
32. IEEE 802.11 is what?
33. Loopback class 255.255.255.0 maximum no.of hosts ?
34. what is shareware?
35. vocabulary of program(options like (eta)n1+n2………… something)
36. when Buffer overflows?(options:i=5/3,a[4]=”welcome”,a[4]=1234)
37. #include<stdio> some program(compiler error because of .h missing)
38. Data base administrator duties(three duties).
39. Encryption algorithm which doesn’t use primary key(hash fn or mesh fun)
40. key escrow?
41. Some question like How you estimate time of the completion of a project(earliest
time/latest time like this)
42. Some questions on LAN protocols.
43. FDDI?(token ring)
44. The variables having some access specifiers to access within program(public
and protected).
45. Which normal form has transitive dependency?
46. which channel has constant bandwidth( circuit switching/packet switching…)
47. some question on which one is better like (message passing/…………..)
48. Linked lists code and asked the operation performed?
49. Question on serializable/serial/?
50. Question on static methods based on overridden like (can a static method can
be overridden by a static method).
51. If there are 64 segments and each segment is of size 512 bytes then how many
address lines are required?
52. Transfer rate of high speed USB(options: 1024/512/128mbps)
53. To access a variable of other file it should be( a global variable and extern class)
54. Some question like If a=-2 b=7 c=5 then value of i++j---/…….. increments and
decrements.
55. programs to find time complexities?
56. One question on graphs.(DSGT).
57. Which of the encryption algorithm is used for like this one question(RC4/RSA).
58. Given that if there are n bits and a digits in decimal then what is the relation
between n and a(options: a=2n /n=2a / n>alog2base10).
59. Pblm related to hamming code like there are(7+1parity bits smething)
60. what is the need of testing?(some options)
61. What is the problem in priority scheduling algorithm(Starvation).
62. What will be there in segment table(pagenumber,offset, segement number)

3. 3 mark questions:
1. First question on finding cipher text for given plaintext M value,e value,n value by
using some network algorithm.
2. Question on SQL query like select……………..like _%cal what it will retrieve?
3. Given match the following on network OSI layers like physical,data link,
network……….
4. Problem on recursion algorithm
5. problem on semaphores wait and signal
6. problem on FIFO page replacement algorithm asked to find %?
7. problem to find the average waiting of SJF (non preemptive) for processes?
8. Problem on networks Algorithms.
9. Problem to find Time complexity of an algorithm.
10. Two programs on try and catch in java.
intel smallest processor Atom
Static class can override other static one
merge sort(nlogn)
buffer overflow ''welcome''
exception q finally is the answer
small talk is not OOP
completely Binary tree has all leaf nodes at same level
one traversal q from left chld right and root q
infintite loop execution
func(n)
{
1 if (n==1);
else
func(floor(n/2) + 1);
}
and hav to find value of func(13) ?
that 1 abt OS upgradation...NTFS..will it be disk manager??
when n=3 , then
func(floor(3/2)+1)
=>func(2);
=>func(floor(2/2 + 1)
=>func(2) ???
int k=34587;

4. for(i=0;i<=k;i++)
{
printf("%d",i);
}
1.one of the answer data acceesSQL
2.One question about data base administrator wats the answer?
3.wat is the answer for channel capacity
4.56 kbps modem 6.6mbps
5.WHat is the fastest USB options 256 520 1024?
6.SQl4characters where the first 3 characters specify the name cal
7.one Question min no of statement
8.if(X>Z)
print
else if(Y>Z)
print
1.one question modify word document then
2.Menu bar edit options something
3.infix postfix conversion
f(n)=2 for n=2
=m for n=
that question answer is 1
4.wchich members of baseclass are accessed by subclass?public and protected
One queestion on DBMS
deadlock starvation spiral lock wats the answer?
3.recursive func
f(n)=2 for n=2
=m for n=1
find=m?
what is the cyclomatic complaxity of
if(x>y)
{
stm 1
}
else if(x==y)
{
stm2
}
1. Computer Awarness(GK)
2. Operating System(SJF,FIFO,Deadlock,semphore etc).

5. 3. Numerical on the network.
4. C Standard Question(Static,test ur c skill questions etc).
5. Data Structure
6. S/w Engineering(path coverage,Mcabee No, etc)
7. Java ( Output Related Questions)
2. CO (data line,and related maths).
software engineering (COCOMA model,agile s/w engg).
Some of Questions r from orkutcomm grps….. for any help mailme -
aksmails@gmail.com
All the Best To All…………………..
If u are good with basics it is enough.