## 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?

Student student(){} | |

Private final student(){} | |

Student(student s){} | |

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

Unipoint | |

Polarpoint | |

Point to point | |

Multipoint |

Question 2 Explanation:

Question 3 |

An object can have which of the following multiplicities?

Zero | |

More than one | |

One | |

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:

Ex-OR | |

NAND gate | |

OR gate | |

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

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?12 | |

10 | |

6 | |

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:

OAK | |

D | |

Netbean | |

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?

Greedy | |

Branch and bound | |

Dynamic Programming | |

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.

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

True,True | |

False, False | |

True,False | |

False,False |

Question 8 Explanation:

Question 9 |

Which of the following is a platform free language?

Java | |

C | |

Assembly | |

Fortran |

Question 9 Explanation:

Question 10 |

The maximum combined length of the command-line arguments including the spaces between adjacent arguments is:

128 characters | |

256 characters | |

67 characters | |

It may very from one OS to another |

Question 10 Explanation:

Question 11 |

What is the meaning of following declaration?

int(

int(

^{*}P[7])();P is pointer to function | |

P is pointer to such function which return type is array | |

P is array of pointer to function | |

P is pointer to array of function |

Question 11 Explanation:

int

int (

int(

int(

^{*}ptr[7]; --This is an array of 7 int^{*}pointers, a pointer to an array of 7 intsint (

^{*}ptr)[7]; --This is a pointer to an array of 7 intint(

^{*}P[7])(); --P is array of pointer to functionint(

^{*}P)() ; -- P is pointer to functionQuestion 12 |

Which of the following sorting procedures is the slowest?

Quick sort | |

Merge sort | |

Shell sort | |

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:

4 | |

8 | |

16 | |

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:

First normal form | |

Second normal form | |

Fourth normal form | |

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.

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.

Circular queue | |

Priority queue | |

Stack | |

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.

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

## Scientific Assistance 4-12-16

Question 1 |

In the following questions choose the word opposite in the meaning to the given word.

Antagonism:

Antagonism:

Cordiality | |

Animosity | |

Hostility | |

Enmity |

Question 1 Explanation:

→ Actual meaning of Antagonism is active hostility or opposition.

→ Antonyms are hostility, enmity, antipathy, dislike, hatred, aggression.

→ 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:

Hasten:

Dash | |

Dawdle | |

Hurry | |