Register

Recent questions tagged nielit2016mar-scientistb

2.5k
views
10 answers
8 votes
NIELIT 2016 MAR Scientist B - Section C: 1
Which of the following logic expression is incorrect?$1\oplus0=1$1\oplus1\oplus0=1$1\oplus1\oplus1=1$1\oplus1=0$
User Avatar
4.0k
views
3 answers
3 votes
NIELIT 2016 MAR Scientist B - Section C: 2
In which of the following adder circuits, the carry look ripple delay is eliminated?Half adderFull adderParallel adderCarry-look ahead adder
User Avatar
1.1k
views
2 answers
3 votes
NIELIT 2016 MAR Scientist B - Section C: 3
The output of a sequential circuit depends on present inputs onlypast inputs onlyboth present and past inputspresent outputs only
User Avatar
2.6k
views
1 answers
3 votes
NIELIT 2016 MAR Scientist B - Section C: 4
In a ripple counter using edge triggered $JK$ flip-flops, the pulse input is applied to theclock input of all flip-flopsclock input of one flip-flop$J$ and $K$ inputs of all flip-flops$J$ and $K$ inputs of one flip flop
User Avatar
4.3k
views
2 answers
2 votes
NIELIT 2016 MAR Scientist B - Section C: 5
A decimal number has $30$ digits. Approximately, how many digits would the binary representation have?$30$60$90$120$
User Avatar
2.0k
views
4 answers
2 votes
NIELIT 2016 MAR Scientist B - Section C: 6
The result of the subtraction $FD​_{16} - ​88_{16​}$ is$75_{16}$65_{16}$5E_{16}$10_{16}$
User Avatar
1.3k
views
2 answers
2 votes
NIELIT 2016 MAR Scientist B - Section C: 7
How many RAM chips of size $(256K \times 1 \text{ bit})$ are required to build $1$M Byte memory?$8$10$24$32$
User Avatar
1.7k
views
2 answers
2 votes
NIELIT 2016 MAR Scientist B - Section C: 8
When we move from the outermost track to the innermost track in a magnetic disk, then density(bits per linear inch) increases.decreases.remains the same.either remains constant or decreases.
User Avatar
1.9k
views
5 answers
3 votes
NIELIT 2016 MAR Scientist B - Section C: 9
A certain processor supports only the immediate and the direct addressing modes. Which of the following programming language features cannot be implemented on this processor?Pointers.Arrays.Records.All of these.
User Avatar
1.4k
views
3 answers
2 votes
NIELIT 2016 MAR Scientist B - Section C: 10
Disadvantage of dynamic RAM over static RAM ishigher power consumption.variable speed.need to refresh the capacitor charge every once in two milliseconds.higher bit density.
User Avatar
2.0k
views
3 answers
3 votes
NIELIT 2016 MAR Scientist B - Section C: 11
What is the correct way to round off $x$, $a$ $\text{float}$ to an $\text{int}$ value?$y=(\text{int})(x+0.5)$y=\text{int} (x+0.5)$y=(\text{int}) x+0.5$y=(\text{int})(\text{int})x+0.5)$
User Avatar
15.8k
views
11 answers
4 votes
NIELIT 2016 MAR Scientist B - Section C: 12
Which of the following sorting algorithms does not have a worst case running time of $O(n​^2​)$?Insertion sort.Merge sort.Quick sort.Bubble sort.
User Avatar
2.3k
views
6 answers
5 votes
NIELIT 2016 MAR Scientist B - Section C: 13
What error would the following function give on compilation? f(int a, int b) { int a; a=20; return a; }Missing parenthesis is $\textit{return}$ statement.Function should ... $\text{int f(int a, int b)}$Redeclaration of $a$.None of these.
User Avatar
2.2k
views
1 answers
4 votes
NIELIT 2016 MAR Scientist B - Section C: 14
Prior to using a pointer variable it should bedeclared.initialized.both declared and initialized.none of these.
User Avatar
3.3k
views
1 answers
4 votes
NIELIT 2016 MAR Scientist B - Section C: 15
Output of the following loop isfor(putchar('c');putchar ('a');putchar('r')) putchar('t');a syntax error.cartrt.catrat.catratratratrat...
User Avatar
1.2k
views
1 answers
2 votes
NIELIT 2016 MAR Scientist B - Section C: 16
If space occupied by two strings $s_1$ and $s_2$ in 'C' are respectively $m$ and $n$, then space occupied by string obtained by concatenating $s_1$ and $s_2$ is alwaysless than $m+n$equal to $m+n$greater than $m+n$none of these
User Avatar
1.4k
views
2 answers
0 votes
NIELIT 2016 MAR Scientist B - Section C: 17
A hash function $f$ defined as $f(\text{key})=\text{key mod }7$, with linear probing, insert the keys $37,38,72,48,98,11,56$ into a table indexed from $11$ will be stored in the location$3$4$5$6$
User Avatar
1.4k
views
1 answers
2 votes
NIELIT 2016 MAR Scientist B - Section C: 18
Traversing a binary tree first root and then left and right subtrees called ______ traversal.postorder.preorder.inorder.none of these.
User Avatar
1.8k
views
2 answers
1 votes
NIELIT 2016 MAR Scientist B - Section C: 19
If there is in NP-Complete language L whose complement is in NP, then complement of any language in NP is inPNPboth (A) and (B)None of these
User Avatar
1.4k
views
3 answers
2 votes
NIELIT 2016 MAR Scientist B - Section C: 20
A hash table has space for $100$ records. Then the probability of collision before the table is $10\%$ full, is$0.45$0.5$0.3$0.34$ (approximately)
User Avatar
844
views
1 answers
3 votes
NIELIT 2016 MAR Scientist B - Section C: 21
A polynomial $p(x)$ is such that $p(0)=5, \: p(1)=4, \: p(2)=9$ and $p(3)=20$. The minimum degree it can have is$1$2$3$4$
User Avatar
1.5k
views
2 answers
1 votes
NIELIT 2016 MAR Scientist B - Section C: 22
Time complexity of an algorithm $T(n)$, where $n$ is the input size is given by$\begin{array}{ll}T(n) & =T(n-1)+\frac{1}{n}, \text{ if }n>1\\ & =1, \text{ otherwise} \end{array}$The order of this algorithm is$\log n$n$n^2$n^n$
User Avatar
595
views
1 answers
3 votes
NIELIT 2016 MAR Scientist B - Section C: 23
If $S$ be an infinite set and $S _1 \dots\dots ,S _n $ be sets such that $S _1 \cup S _2 \cup \dots \cup S _n =S$ ... sets $S _i $ is an infinite set.not more than one of the sets $S _i $ can be infinite.
User Avatar
2.7k
views
2 answers
2 votes
NIELIT 2016 MAR Scientist B - Section C: 24
Which of the following regular expressions denotes a language comprising all possible strings over the alphabet $\{a,b\}$?$a^*b^*$(a\mid b)^*$(ab)^+$(a\mid b^*)$
User Avatar
1.4k
views
2 answers
1 votes
NIELIT 2016 MAR Scientist B - Section C: 25
Regarding power of recognition of language, which of the following statements is false?Non deterministic finite-state automata are equivalent to deterministic ... .Multi-tape Turing Machines are equivalent to Single-tape Turing Machines.
User Avatar
1.0k
views
4 answers
2 votes
NIELIT 2016 MAR Scientist B - Section C: 26
If $L_1$ and $L_2$ are context free language and $R$ a regular set, then which one of the languages below is not necessarily a context free language?$L_1L_2$L_1\cap L_2$L_1\cap R$L_1\cup L_2$
User Avatar
926
views
4 answers
4 votes
NIELIT 2016 MAR Scientist B - Section C: 27
If $L$ be a language recognizable by a finite automaton, then language from $\{L\} = \{w$ such that $w$ is a prefix of $v$ ... , is aregular language.context-free language.context-sensitive language.recursive enumeration language
User Avatar
853
views
4 answers
1 votes
NIELIT 2016 MAR Scientist B - Section C: 28
Which of the following statements is correct?$A=\{a^nb^n\mid n= 0,1,2,3\dots \}$ is regular languageSet $B$ of all strings of equal number of $a$'s and $b$'s defines a regular language$L(A^*B^*) \cap B$ gives the set $A$None of these.
User Avatar
1.5k
views
1 answers
0 votes
NIELIT 2016 MAR Scientist B - Section C: 29
The CFG $S \to aS\mid bS\mid a\mid b$ is equivalent to $(a+b)$(a+b)(a+b)^*$(a+b)(a+b)$all of these
User Avatar
1.2k
views
1 answers
1 votes
NIELIT 2016 MAR Scientist B - Section C: 30
Bounded minimalization is a technique forproving whether a promotive recursive function is turning computable or notproving whether a ... function or notgenerating primitive recursive functionsgenerating partial recursive functions
User Avatar
Page: