Published by Roma Rahul Gupta for Chhattisgarh Online
NIC(National Informatics Center) Exam Paper(Based on candidate experience) for Scientific Officer-SB/Engineer
1. CHECK NIC-2008 paper here
**********************************************************
1. Give the output?
#include
using namespace std;
class Base{
public:
void display()
{
show();
}
virtual void show()
{
cout<<"Base - Show"<< br="">
}
};
class Derived:public Base{
public:
void show(){
cout<<"Derived - Show" } }; int main(){ //Base B; Derived D; D.display(); return 0; } Ans. Derived - Show 2. Show output? #include int main(void) { int z,x=5,y=-10,a=4,b=2; z = x++ - --y * b / a; printf("\nZ= %d",z); return 0; } ans. 10 3. L={a,b,c,d,e,f} using this language form words of length n(=4) where no letters is repeated more than once. how many strings can be formed.? 4. Object based language is a. Visual Basic b. C++ c. Java d. pascal 5. What is cookies? in session creation between two connection.. 6.A non acyclic graph have n number of vertexes. How many edges it have? And: n-1 7. Which sequence gives exact solution of binary tree ans. Inorder and preorder 8. What is dangling pointer? 9. If (123)base 5 = (A3) of base B. value of A is? ans= 1 10. RSA Public key (n=187,e=17) then private key is ans: 187,23 11. insert the valuesin the B tree : 92 24 6 7 11 8 22 4 5 16 19 20 78. 12. Memory access time from cache is 30ns and accessing from memory without cache is 150ns. Find the hit ratio when average accessing time is 20ns. 13. Problem related to hard disk. Data requests from the tracks are 10,15,78,30, 140,25.(all are track numbers) How many R/W head moves are needed to serve all the above reqiests if the DISK controler follows FIFO policy? Note: The request numbers are not exact. I have given sample number. 14. Process scheduling problem. The processses (a,4), (b,2), (c,1), (d,7) are given. First parameter refers the process name and the next refers the total CPU time required by the process. The OS follows round robin scheduling algorithm. The slice time is 1 second. At what time the process 'a' completes?<>
1. Most desirable form of coupling
a. Common coupling b.Control Coupling c. Data Coupling d. Content Coupling.
2. Dandgling Reference refer to?
3. Encryption used in IEEE 802.11 WLAN?
4. Version of Advanced Enryption Standard(AES) and cipher Key?
5. No.of vertex of odd degree is ?
6. Slowest Sorting Algorathim?
7. Complexity to delete a node from Linked LIST?
8. EBCDIC can code upto how many charcter?
9. Estimation equation of cocomo model for organic project?
10. Need for the extended ER Model?
11. Infrastructure component for the DATA Center?
12. Which type of memory device has Min. Cost of storing one bit information?
13. Color combination for printer?
14. Father of computer?
15. Thrashing affect?
16. Preemptive version of FCFS?
17. C is a Language?
18. Object based language?
19. Which memory can not be interface with procesor?
20. Input for linker?
21. Preprocesor starts functioning when?
Also it has cove alll syllabus of Computer Science.
Basically question comes from,
1. Software Engineering.
2. C, C++, Java
3. Networking.
4. Data Structure(Tree, Stack).
5. Operating System.
6. Automata Theory.
*******************************************************
The question paper consisted 100 questions. 75 questions carried one mark each and 25 carried 3 marks each. Negative marking was there. (1/3rd)
In general, questions came from the following subjects majorly.
1. DBMS
2. Operating system
3. Computer Network
4. C and C++
5. Software engineering
6. Very few questions related to TOC.
1. Normalizations is a ------ process.
a) Recursive b) Iterative and few more
2. Which is NOT a relational database.
a) FoxPro b)dBASE4 c) few more
3. What is the name of the combination of disk, Platers, R/W head, ARM?
a)HDA b)SAT etc.
4. Problem related to hard disk.
Data requests from the tracks are 10,15,78,30, 140,25.(all are track numbers) How many R/W head moves are needed to serve all the above reqiests if the DISK controler follows FIFO policy?
Note: The request numbers are not exact. I have given sample number.
5. Process scheduling problem.
The processses (a,4), (b,2), (c,1), (d,7) are given. First parameter refers the process name and the next refers the total CPU time required by the process. The OS follows round robin scheduling algorithm. The slice time is 1 second.
At what time the process 'a' completes?
6. A segment has 512 bytes size and each page has 10 segments. How many address lines are required to uniquely adress each bytes?
7. A problem related to Semophare.
8. A problem related to mapping of logical address to physical address. Logical address was given and the physical address was asked. (All the other details like base, page were given)
9. Why RAID levels ae used?
a) To avoid data loss b) etc.
10. A problem related to TOC.
{a,b,c,d,e,f,g}. How many strings of length 4 can be formed from the given set of leterels? All the four charecters in a string should be distinct.
11. Couple of questions were asked related to IP address classes.
12. Around 5-6 questions were asked from C/C++. A piece of program was given and the O/P had to be chosen.
13. Problem related to RSA algorithm. (Publec key was given and the private was asked)
14. A problem related to stack (data stucture)
15. Search in a B tree is faster that B+ tree. True or false?
16. Which sorting technique uses binary search to find the given number is larger than all the number in a tree?
a)Insertition sort b)selection c)Bubble d) Heap sort
17. Which sorting technique is slower? (list of techniques were given again)
18. A problem related to cache rate was asked.
19. Which among the following will not create web page?
a) ASP b) JSP c) Java services d) UDP page
20. Conoco Model formula was asked? (from software engineering)
21. Couple of problems were asked to estimate the software delivery. (I think using conoco model)
22. What is the advantage of bottom up tetsing?
23. Which coupling is desirable?
a) Data coupling b) Control coupling etc.
24. Another question related to testing was asked.
25. A company earns Rs 10000 as profit every year in a five year project. The investment for the project was Rs 100000. what is the profit percentage?
26. What is the first step in the implementation phase of the SDLc process?
a) Selecting the tool b) Implementation planning c) announcing that the implementation begins etc.
27. What is the fastest file transfer protocal? (4 set of protocals were given)
28. Couple of questions related to graph were asked.
29. A probelm related to B+ tree was asked. (A value was to be inserted in the B+ tree.)
****************************************************************
1) class test
{
public static void main(String args[]){
short s=0x00FE;
byte b=(byte)s;
System.out.println("b is" +b);
}
} Answer is -2 I have executed this.
2) Average waiting time question from Operating systems.
3) Select * FROM customers where customer_name like '_%cal'
4 options to choose what exactly the meaning of the above statement.
4) for(i=0;i<=32767;i++) options a)Infinite loop b)compiler error some other options
5) One question From DBMS to find whether read(a,t) t=t+100; write t; read(b,t) ......... and some thing like this and asked to find whether serializable or nonserializable or non-serializable like that. I think this is from Elmasri navathe DBMS text
6) Data link layer a) routing Network layer b) Finding errors physical layer We have to match the layer and its corresponding matching functionality 75 questions for 1 mark, 25 questions * 3 = question paper pattern 7) Software engineering question what is the important quality in spiral model Efficiency or perfomance increase or quality management are options I remember
8) what is the role of database administrator a) daily maintenance b) writing application software and 2 more options *****************************************************************
NIC(National Informatics Center) Exam Paper(Based on candidate experience) for Scientific Officer-SB/Engineer
1. CHECK NIC-2008 paper here
**********************************************************
1. Give the output?
#include
using namespace std;
class Base{
public:
void display()
{
show();
}
virtual void show()
{
cout<<"Base - Show"<< br="">
}
};
class Derived:public Base{
public:
void show(){
cout<<"Derived - Show" } }; int main(){ //Base B; Derived D; D.display(); return 0; } Ans. Derived - Show 2. Show output? #include int main(void) { int z,x=5,y=-10,a=4,b=2; z = x++ - --y * b / a; printf("\nZ= %d",z); return 0; } ans. 10 3. L={a,b,c,d,e,f} using this language form words of length n(=4) where no letters is repeated more than once. how many strings can be formed.? 4. Object based language is a. Visual Basic b. C++ c. Java d. pascal 5. What is cookies? in session creation between two connection.. 6.A non acyclic graph have n number of vertexes. How many edges it have? And: n-1 7. Which sequence gives exact solution of binary tree ans. Inorder and preorder 8. What is dangling pointer? 9. If (123)base 5 = (A3) of base B. value of A is? ans= 1 10. RSA Public key (n=187,e=17) then private key is ans: 187,23 11. insert the valuesin the B tree : 92 24 6 7 11 8 22 4 5 16 19 20 78. 12. Memory access time from cache is 30ns and accessing from memory without cache is 150ns. Find the hit ratio when average accessing time is 20ns. 13. Problem related to hard disk. Data requests from the tracks are 10,15,78,30, 140,25.(all are track numbers) How many R/W head moves are needed to serve all the above reqiests if the DISK controler follows FIFO policy? Note: The request numbers are not exact. I have given sample number. 14. Process scheduling problem. The processses (a,4), (b,2), (c,1), (d,7) are given. First parameter refers the process name and the next refers the total CPU time required by the process. The OS follows round robin scheduling algorithm. The slice time is 1 second. At what time the process 'a' completes?<>
1. Most desirable form of coupling
a. Common coupling b.Control Coupling c. Data Coupling d. Content Coupling.
2. Dandgling Reference refer to?
3. Encryption used in IEEE 802.11 WLAN?
4. Version of Advanced Enryption Standard(AES) and cipher Key?
5. No.of vertex of odd degree is ?
6. Slowest Sorting Algorathim?
7. Complexity to delete a node from Linked LIST?
8. EBCDIC can code upto how many charcter?
9. Estimation equation of cocomo model for organic project?
10. Need for the extended ER Model?
11. Infrastructure component for the DATA Center?
12. Which type of memory device has Min. Cost of storing one bit information?
13. Color combination for printer?
14. Father of computer?
15. Thrashing affect?
16. Preemptive version of FCFS?
17. C is a Language?
18. Object based language?
19. Which memory can not be interface with procesor?
20. Input for linker?
21. Preprocesor starts functioning when?
Also it has cove alll syllabus of Computer Science.
Basically question comes from,
1. Software Engineering.
2. C, C++, Java
3. Networking.
4. Data Structure(Tree, Stack).
5. Operating System.
6. Automata Theory.
*******************************************************
The question paper consisted 100 questions. 75 questions carried one mark each and 25 carried 3 marks each. Negative marking was there. (1/3rd)
In general, questions came from the following subjects majorly.
1. DBMS
2. Operating system
3. Computer Network
4. C and C++
5. Software engineering
6. Very few questions related to TOC.
1. Normalizations is a ------ process.
a) Recursive b) Iterative and few more
2. Which is NOT a relational database.
a) FoxPro b)dBASE4 c) few more
3. What is the name of the combination of disk, Platers, R/W head, ARM?
a)HDA b)SAT etc.
4. Problem related to hard disk.
Data requests from the tracks are 10,15,78,30, 140,25.(all are track numbers) How many R/W head moves are needed to serve all the above reqiests if the DISK controler follows FIFO policy?
Note: The request numbers are not exact. I have given sample number.
5. Process scheduling problem.
The processses (a,4), (b,2), (c,1), (d,7) are given. First parameter refers the process name and the next refers the total CPU time required by the process. The OS follows round robin scheduling algorithm. The slice time is 1 second.
At what time the process 'a' completes?
6. A segment has 512 bytes size and each page has 10 segments. How many address lines are required to uniquely adress each bytes?
7. A problem related to Semophare.
8. A problem related to mapping of logical address to physical address. Logical address was given and the physical address was asked. (All the other details like base, page were given)
9. Why RAID levels ae used?
a) To avoid data loss b) etc.
10. A problem related to TOC.
{a,b,c,d,e,f,g}. How many strings of length 4 can be formed from the given set of leterels? All the four charecters in a string should be distinct.
11. Couple of questions were asked related to IP address classes.
12. Around 5-6 questions were asked from C/C++. A piece of program was given and the O/P had to be chosen.
13. Problem related to RSA algorithm. (Publec key was given and the private was asked)
14. A problem related to stack (data stucture)
15. Search in a B tree is faster that B+ tree. True or false?
16. Which sorting technique uses binary search to find the given number is larger than all the number in a tree?
a)Insertition sort b)selection c)Bubble d) Heap sort
17. Which sorting technique is slower? (list of techniques were given again)
18. A problem related to cache rate was asked.
19. Which among the following will not create web page?
a) ASP b) JSP c) Java services d) UDP page
20. Conoco Model formula was asked? (from software engineering)
21. Couple of problems were asked to estimate the software delivery. (I think using conoco model)
22. What is the advantage of bottom up tetsing?
23. Which coupling is desirable?
a) Data coupling b) Control coupling etc.
24. Another question related to testing was asked.
25. A company earns Rs 10000 as profit every year in a five year project. The investment for the project was Rs 100000. what is the profit percentage?
26. What is the first step in the implementation phase of the SDLc process?
a) Selecting the tool b) Implementation planning c) announcing that the implementation begins etc.
27. What is the fastest file transfer protocal? (4 set of protocals were given)
28. Couple of questions related to graph were asked.
29. A probelm related to B+ tree was asked. (A value was to be inserted in the B+ tree.)
****************************************************************
1) class test
{
public static void main(String args[]){
short s=0x00FE;
byte b=(byte)s;
System.out.println("b is" +b);
}
} Answer is -2 I have executed this.
2) Average waiting time question from Operating systems.
3) Select * FROM customers where customer_name like '_%cal'
4 options to choose what exactly the meaning of the above statement.
4) for(i=0;i<=32767;i++) options a)Infinite loop b)compiler error some other options
5) One question From DBMS to find whether read(a,t) t=t+100; write t; read(b,t) ......... and some thing like this and asked to find whether serializable or nonserializable or non-serializable like that. I think this is from Elmasri navathe DBMS text
6) Data link layer a) routing Network layer b) Finding errors physical layer We have to match the layer and its corresponding matching functionality 75 questions for 1 mark, 25 questions * 3 = question paper pattern 7) Software engineering question what is the important quality in spiral model Efficiency or perfomance increase or quality management are options I remember
8) what is the role of database administrator a) daily maintenance b) writing application software and 2 more options *****************************************************************
Posts
0 comments:
Post a Comment