Following questions are asked in exam conducted on 4th December 2016 for Recruitment to vacant
posts for Scientist B in MeitY, its attached offices and statutory organizations on Direct Recruitment
Basis
SET-C
http://www.geeksforgeeks.org/nielit-scientist-b-recruitment-2016-computer-science/ 1/15
9/13/2017 NIELIT Scientist B Recruitment 2016 : Computer Science - GeeksforGeeks
10. What is described by means og DFDs as studied earlier and represented in algebraic form?
A. Data flow
B. Data Storage
C. Data Structures
D. Data elements
http://www.geeksforgeeks.org/nielit-scientist-b-recruitment-2016-computer-science/ 2/15
9/13/2017 NIELIT Scientist B Recruitment 2016 : Computer Science - GeeksforGeeks
11. The IOS class member function used for formatting IO is:
A. width(), precision(), read()
B. width(), precision, setf()
C. getch(), widht(), Io()
D. unsetf(), setf(), write()
15. Let A,B,C,D be n*n matices, each with non-zero determinant. If ABCD = 1 then B(-1) is:
A. D(-1)C(-1)A(-1)
B. CDA
C. ADC
D. Does not neessarily exist
16. Rule which states that addition of same attributes to right side and left sie will result in other valid
dependency is classified as:
A. referential rule
B. inferential rule
C. augmentation rule
D. reflexive rule
http://www.geeksforgeeks.org/nielit-scientist-b-recruitment-2016-computer-science/ 3/15
9/13/2017 NIELIT Scientist B Recruitment 2016 : Computer Science - GeeksforGeeks
19. What will be output if you will compile and execute the following C code?
void main() {
printf(%d, sizeof(5.2))
}
A. 4
B. 8
C. 2
D. 16
20. The graph that shows basic block and their successor relationship is called:
A. DAG
B. Control graph
C. Flow graph
D. Hamiltonian graph
22. How many onto (or surjective) functions are there from an n-element (n>=2) set to a 2-element set?
A. 2(n)
B. 2(n)-1
C. 2(n)-2
D. 2*(2(n)-2)
23. Let G be a simple undirected planer graph on 10 vertices with 15 edges. If G is a connected graph,
then the number of bounded faces in ay embedding of G on the plane is equal to:
A. 3
B. 4
C. 5
D. 6
24. A non-pipeline system takes 50ns to process a task. The same task can be processes in a six-
segment pipeline with s clock cycle of 10ns. Determine the speedup ration of the pipeline for 100 tasks.
http://www.geeksforgeeks.org/nielit-scientist-b-recruitment-2016-computer-science/ 4/15
9/13/2017 NIELIT Scientist B Recruitment 2016 : Computer Science - GeeksforGeeks
25. Consider the function f(x) = sin(x) in the interval [pi/4, 7*(pi/4)]. The number and location(s) of the
local minima of this function are;
A. One, at pi/2
B. One, at 3*pi/2
C. Two, at pi/2 and 3*pi/2
D. Two, at pi/4 and 3*pi/2
26. If every functional dependency in set E is also in closure of F then this is classified as :
A. FD is covered by E
B. E is covered by F
C. F is covered b E
D. F plus is covered by E
29. Consider a system with m resources of same type being shared by n process. Resources can be
requested and rleased by processes only one at a time. The system is deadlock free iff:
A. The sum of all max need is < m+n
B. Both of the above
C. The sum of all the max need is > m+n
D. None
30. What will be the final output of D F/F, if the input setting is 11010011?
A. 1
B. 0
http://www.geeksforgeeks.org/nielit-scientist-b-recruitment-2016-computer-science/ 5/15
9/13/2017 NIELIT Scientist B Recruitment 2016 : Computer Science - GeeksforGeeks
C. Dont care
D. Non of the above
32. Process that periodically checks status of an I/O devices, is known as:
A. Cold swapping
B. I/O instruction
C. Polling
D. Dealing
http://www.geeksforgeeks.org/nielit-scientist-b-recruitment-2016-computer-science/ 6/15
9/13/2017 NIELIT Scientist B Recruitment 2016 : Computer Science - GeeksforGeeks
39. The running time of quick sort algorithm depends heavily on the selection of:
A. No. of inputs
B. Arrangement of elements in an array
C. Sizes of elements
D. Pivot Element
43. Considering relational database, functional dependency between two attributes A and B is denoted
by:
A. A->B
B. BR
D. R<-AB
http://www.geeksforgeeks.org/nielit-scientist-b-recruitment-2016-computer-science/ 7/15
9/13/2017 NIELIT Scientist B Recruitment 2016 : Computer Science - GeeksforGeeks
C. It determines the maximum size of a problem that can be solved in a given amount of time
D. Both (A) and (B)
48. If there is more than one key for relation schema in DBMS then each key in relation schemea is
classified as:
A. prime key
B. super key
C. candidate key
D. prime key
49. In which one of the following pages replacement policies, Beladys anomaly may occur?
A. FIFO
B. LRU
C. Optimal
D. MRU
http://www.geeksforgeeks.org/nielit-scientist-b-recruitment-2016-computer-science/ 8/15
9/13/2017 NIELIT Scientist B Recruitment 2016 : Computer Science - GeeksforGeeks
C. LAN
D> one of the above
52. A process that is based on IPC mechanism which executes on different systems and can
communicate with other processes using message based communication is called;
A. Local procedure call
B. RPC
C. IPC
D. RMI
53. What is the testing to ensure the WebApp properly interfaces with other application or databases:
A. Compatibility
B. Interoperability
C. Performance
D. Security
54. The maximum number of nodes in a binary tree of level k, k>=1 is:
A. 2(k)+1
B. 2(k-1)
C. 2(k)-1
D. 2(k-1)-1
55. The identification of common sub-expression and replacement of runtime computations by compile-
time computations is:
x
A. Local optimization
B. Constant folding
Get It now
C. Loop optimization
Try all-new Acrobat DC desktop free for 30 days
D. Data flow analysis
56. Process of analyzing relation schema to achieve minimal redundancy and insertion or update
anomalies is classified as:
A. normalization of data
B. denomination of data
C. isolation of data
D. de-normalization of data
http://www.geeksforgeeks.org/nielit-scientist-b-recruitment-2016-computer-science/ 9/15
9/13/2017 NIELIT Scientist B Recruitment 2016 : Computer Science - GeeksforGeeks
57. Line of code (LOC) of te product comes under which type of measures?
A. Indirect measure
B. Coding
C. Direct measure
D. None of the above
59. Given two DFAs M1 and M2. They are equivalent if:
A. M1 and M2 has the same number of states
B. M1 and M2 accepts the same language i.e. L(M1)=L(M2)
C. M1 and M2 has the same number of final states
D. None of the above
60. K-map
xx1
1
x
x1x
A. ABD + CD + ABC
B. BCD + ABC+ AC
C. BD + CD
D. CD + BCD
This article is contributed by Rohit Kasle. Please write comments if you find anything incorrect, or you
want to share more information about the topic discussed above.
Recommended Posts:
http://www.geeksforgeeks.org/nielit-scientist-b-recruitment-2016-computer-science/ 10/15
9/13/2017 NIELIT Scientist B Recruitment 2016 : Computer Science - GeeksforGeeks
Writing code in comment? Please use ide.geeksforgeeks.org, generate link and share the link here.
@geeksforgeeks, Some rights reserved Contact Us! About Us! Careers! Privacy Policy
http://www.geeksforgeeks.org/nielit-scientist-b-recruitment-2016-computer-science/ 11/15
9/13/2017 NIELIT Scientist B Recruitment 2016 : Computer Science - GeeksforGeeks
http://www.geeksforgeeks.org/nielit-scientist-b-recruitment-2016-computer-science/ 12/15
9/13/2017 NIELIT Scientist B Recruitment 2016 : Computer Science - GeeksforGeeks
http://www.geeksforgeeks.org/nielit-scientist-b-recruitment-2016-computer-science/ 13/15
9/13/2017 NIELIT Scientist B Recruitment 2016 : Computer Science - GeeksforGeeks
http://www.geeksforgeeks.org/nielit-scientist-b-recruitment-2016-computer-science/ 14/15
9/13/2017 NIELIT Scientist B Recruitment 2016 : Computer Science - GeeksforGeeks
http://www.geeksforgeeks.org/nielit-scientist-b-recruitment-2016-computer-science/ 15/15