## Nielit Scientist-B IT 4-12-2016

 Question 1
Given a class named student, which of the following is a valid constructor declaration for the class?
 A Student student(){} B Private final student(){} C Student(student s){} D Void student(){}
Question 1 Explanation:
A constructor cannot specify any return type, not even void. A constructor cannot be final, static or abstract.
 Question 2
Three or more devices share a link in ____ connection
 A Unipoint B Polarpoint C Point to point D Multipoint
Question 2 Explanation:
 Question 3
An object can have which of the following multiplicities?
 A Zero B More than one C One D All of the above
Question 3 Explanation:
Multiplicity is a definition of cardinality - i.e. number of elements of some collection of elements by providing an inclusive interval of non-negative integers to specify the allowable number of instances of described element. Multiplicity interval has some lower bound and (possibly infinite) upper bound
 Question 4

The Circuit is equivalent to:
 A Ex-OR B NAND gate C OR gate D AND gate
Question 4 Explanation:
Given circuit diagram consists of NOR gates.
NOR of “A” is A’
NOR of “A” is B’
We can see that (A’ + B’)’ is same as (A.B) , where + represents OR, represents AND and ' represents complement operation. This is a De Morgan’s law.
((A'+B')')'=(AB)'
Where (AB)' is the NAND of AB
 Question 5
Two alternative packages A and B are available for processing a database having 10k records. Package A requires 0.0001n​2​ time units and package B requires 10nlog​10​n time units​ ​ to process n records. What is the smallest value of k for which package B will be preferred over A?
 A 12 B 10 C 6 D 5
Question 5 Explanation:
As per given information Package B 10nlog​ 10​ n is lesser than or equals to Package A 0.0001n​ 2​ 0
because n​ 2​ is asymptotically larger than nlogn. Finally, 10nlog​ 10​ n ≤ 0.0001n​ 2
Let n = 10​ k​ records. Substitute into 10nlog​ 10​ n ≤ 0.0001n​ 2
10(10​ k​ )log​ 10​ 10​ k​ ≤ 0.0001(10​ k​ )​ 2
10​ k+1​ k ≤ 0.0001 × 10​ 2k
k ≤ 10​ 2k−k−1−4
k ≤ 10​ k−5
According to the problem value 6 is suitable for K.
 Question 6
Earlier name of java programming language was:
 A OAK B D C Netbean D Eclipse
Question 6 Explanation:
Oak is a discontinued programming language created by James Gosling in 1991, initially for Sun Micro systems' set-top box project. The language later evolved to become Java.
 Question 7
What is the type of the algorithm used in solving the 4 Queens problem?
 A Greedy B Branch and bound C Dynamic Programming D Backtracking
Question 7 Explanation:
N-Queen problem:​ an arrangement of N queens on a chess board, such that no queen can attack any other queens on the board.The chess queens can attack in any direction as horizontal, vertical, horizontal and diagonal way. A binary matrix is used to display the positions of N Queens, where no queens can attack other queens.
Backtracking is a general algorithm for finding all (or some) solutions to some computational problems, notably constraint satisfaction problems, that incrementally builds candidates to the solutions, and abandons a candidate ("backtracks") as soon as it determines that the candidate cannot possibly be completed to a valid solution.
 Question 8
selection sort,quick sort is a stable sorting method
 A True,True B False, False C True,False D False,False
Question 8 Explanation:

 Question 9
Which of the following is a platform free language?
 A Java B C C Assembly D Fortran
Question 9 Explanation:
• Sun released the Java HotSpot virtual machine and compiler as free software under the GNU General Public License on November 13, 2006, with a promise that the rest of the JDK (that includes the JRE) would be placed under the GPL by March 2007 ("except for a few components that Sun does not have the right to publish in distributable source form under the GPL").

• Java code is platform independent in the sense that the same Java application or algorithms (typically compiled to Java bytecode and packaged in a .jar file) will run identically on Windows and Linux.
•  Question 10
The maximum combined length of the command-line arguments including the spaces between adjacent arguments is:
 A 128 characters B 256 characters C 67 characters D It may very from one OS to another
Question 10 Explanation:
• On computers running Microsoft Windows XP or later, the maximum length of the string that you can use at the command prompt is 8191 characters.

• On computers running Microsoft Windows 2000 or Windows NT 4.0, the maximum length of the string that you can use at the command prompt is 2047 characters.

• And also it may vary with other operating systems
•  Question 11
What is the meaning of following declaration?
int(*P[7])();
 A P is pointer to function B P is pointer to such function which return type is array C P is array of pointer to function D P is pointer to array of function
Question 11 Explanation:
int *ptr[7]; --This is an array of 7 int* pointers, a pointer to an array of 7 ints
int (*ptr)[7]; --This is a pointer to an array of 7 int
int(*P[7])(); --P is array of pointer to function
int(*P)() ; --​ P is pointer to function
 Question 12
Which of the following sorting procedures is the slowest?
 A Quick sort B Merge sort C Shell sort D Bubble sort
Question 12 Explanation:
Bubble sort will execute O(n​ 2​ ) time worst case and also it takes n-1 comparisons. So, bubble sort procedure is the slowest one among all.
 Question 13
The number of unused pointers in a complete binary tree of depth 5 is:
 A 4 B 8 C 16 D 32
Question 13 Explanation:
It gives ambitious answer. It may give 32 if root start from 0. It start from means 16.
 Question 14
Normalization from which is based on transitive dependency is classified as:
 A First normal form B Second normal form C Fourth normal form D Third normal form
Question 14 Explanation:
The table is in 3NF if and only if both of the following conditions hold:
1. The relation R (table) is in second normal form (2NF)
2. Every non-prime attribute of R is non-transitively dependent on every key of R.
 Question 15
A__ is a linear list in which insertions and deletions are made to from either end of the structure.
 A Circular queue B Priority queue C Stack D Dequeue
Question 15 Explanation:
● A deque, also known as a double ended queue, is an ordered collection of items similar to the queue. It has two ends, a front and a rear, and the items remain positioned in the collection.
● What makes a deque different is the unrestrictive nature of adding and removing items.New items can be added at either the front or the rear.
● Likewise, existing items can be removed from either end. In a sense, this hybrid linear structure provides all the capabilities of stacks and queues in a single data structure.
There are 15 questions to complete.

Register Now

## Scientific Assistance 4-12-16

 Question 1
In the following questions choose the word opposite in the meaning to the given word.
Antagonism:
 A Cordiality B Animosity C Hostility D Enmity
Question 1 Explanation:
→ Actual meaning of Antagonism is active hostility or opposition.
→ Antonyms are hostility, enmity, antipathy, dislike, hatred, aggression.
 Question 2
In the following questions choose the word opposite in the meaning to the given word.
Hasten:
 A Dash B Dawdle C Hurry D