0% found this document useful (0 votes)
132 views5 pages

Nic

Here is the set of descriptive questions asked in NIC Written test 2008. A. What do you understand by Complexity of Sorting Algorithms? Explain in the context of various sorting techniques. B. Write a program(in Java or C++) to produce fibonacci numbers F0, Fl given below. Should one use recursion or iteration for the above program and why? c. What does chmod, vi and grep do in linux system?

Uploaded by

Bala Ji
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
132 views5 pages

Nic

Here is the set of descriptive questions asked in NIC Written test 2008. A. What do you understand by Complexity of Sorting Algorithms? Explain in the context of various sorting techniques. B. Write a program(in Java or C++) to produce fibonacci numbers F0, Fl given below. Should one use recursion or iteration for the above program and why? c. What does chmod, vi and grep do in linux system?

Uploaded by

Bala Ji
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 5

Here is the set of descriptive questions asked in NIC Written test 2008:

1. Write short note on a. De-fragmentation, compression and encryption b. Open Source, Commercial Software and Freeware c. Paging and Segmentation d. SDLC and its stages 2. a. What do you understand by Complexity of Sorting Algorithms? Explain in the context of various sorting techniques. b. Write Quick Sort Algorithm using pseudocode and verify your code by tracing an example. 3. a. Explain final, finally, finalise, this and super in Java Context b. Consider the following stack, where stack is allocated N = 6 memory cells STACK: AAA, DDD, EEE, FFF, GGG, _ Describe the stack as the following operations take place: (i) PUSH(ST ACK,KKK), (ii) POP(ST ACK,ITEM), (iii) PUSH(STACK,LLL), (iv) PUSH(STACK,SSS), (v) POP(ST ACK,ITEM), (vi) PUSH(STACK,TTT) c. What does chmod, vi and grep do in linux system? 4. a. What is Object Oriented Programming? Why is Java called portable or platform independent language? b.Write a program(in Java or C++) to produce fibonacci numbers F0, Fl given below. Should one use recursion or iteration for the above program and why? Fn = 0, when n = 0 Fn = 1, when n = 1 Fn = = Fn-l + Fn-2 when n >=2 c. What is the significance of client-side and server-side validations? 5. a. Let a and b denote positive integers. Suppose a function Q is defined recursively as follows Q(a,b) = 0, if a < b Q(a,b) = Q(a-b,b) + 1, if b<=a (i) Find the value ofQ(2,3) and Q(l4,3) (ii) What does this function do? Find Q(5861,7). b. Describe Method Overloading and Method Overriding.

c. Let LIST be a linked list in memory. Write a procedure which finds the number NUM of times a given ITEM occurs in LIST 6. a. Based on type of organization of data, what are different types of DBMS? Give examples of commercially available DBMS's today. b. An organization conducts training programmes (courses) for its own employees. These employees are recognized in the organization by an employee code and are placed in different specialized groups called Divisions headed by HODs (who are also employees). Design a fully normalized database, clearly indicating primary key and foreign key constraints, to store following information: Employee Name, Employee Code, Designation, Division Name, HOD Name, Course Title (Training Programme Title), Course Start Date, Course Duration etc Write SQL statementto generate (i)Division wise (List of all employees in a division) with the HOD Name (ii)List of courses attended by a particular employee (iii)List of employees who have attended a particular training programme c. Describe ACID in the context of DBMS.

Some of the questions I am posting from last year NIC recruitment The paper was completely Objective. Part-A: 75 Qs- 1 mark each Part-B: 25 QS- 3 mark each Negative Marking- 1/3 of the marks allotted to each Q for every wrong answer. - Only Qs from computer science subjects were there. - The Subjects from which Qs were asked: Software Engineering COCOMO Model Practical Qs (2-3 Qs) (KLOC, Person Year, Effort Estimation) What is done, after coming in Implementation phase: a) Declare Implementation b) Implementation Planning c) Select Tools d) DBMS Which of the following SQL statement is correct? a) SQL query automatically eliminates duplicate b) C++ Output Q class A { public: int i; void run() {

cout<<run of A; } void fun(){ run(); } } class B { void run() { cout<< run of B; } } main() { B b; b.fun(); } what will be the output? 1) run of A 2) run of B 3) run of A run of B 4) run of B run of A - If classA is friend of classB, classsB is friend of classC, thena) classA and classC are friends b) classA and classC are not friends c) - C language Output Qs ( a ++ + b) (2-3 Qs) - Data Structures Graphs, trees, sorting complexity Prepare B tree of order 3 Cyclomatic complexity - TOC Q. Which of these is a object based language? a)Visual Basic b)C c)C++ d)Java Ans- Visual Basic Q. If (123)5 = (A3)B, what is A? a) 4 b) 3 c) 2 d) 1

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?

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.)

You might also like