search
Log In

Recent questions tagged nielit2016mar-scientistb

3 votes
10 answers
1
1 vote
3 answers
2
1 vote
2 answers
3
1 vote
1 answer
4
In a ripple counter using edge triggered $JK$ flip-flops, the pulse input is applied to the clock input of all flip-flops clock input of one flip-flop $J$ and $K$ inputs of all flip-flops $J$ and $K$ inputs of one flip flop
asked Mar 31 in Digital Logic Lakshman Patel RJIT 381 views
1 vote
1 answer
5
0 votes
2 answers
6
1 vote
3 answers
7
0 votes
2 answers
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.
asked Mar 31 in Operating System Lakshman Patel RJIT 289 views
1 vote
4 answers
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.
asked Mar 31 in CO and Architecture Lakshman Patel RJIT 474 views
0 votes
1 answer
10
Disadvantage of dynamic RAM over static RAM is higher power consumption. variable speed. need to refresh the capacitor charge every once in two milliseconds. higher bit density.
asked Mar 31 in Digital Logic Lakshman Patel RJIT 213 views
1 vote
3 answers
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)$
asked Mar 31 in Programming Lakshman Patel RJIT 287 views
3 votes
12 answers
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.
asked Mar 31 in Algorithms Lakshman Patel RJIT 770 views
2 votes
6 answers
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 be defined as $\text{int f(int a, int b)}$ Redeclaration of $a$. None of these.
asked Mar 31 in Programming Lakshman Patel RJIT 682 views
2 votes
1 answer
14
0 votes
1 answer
15
Output of the following loop is for(putchar('c');putchar ('a');putchar('r')) putchar('t'); a syntax error. cartrt. catrat. catratratratrat...
asked Mar 31 in Programming Lakshman Patel RJIT 200 views
0 votes
0 answers
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 always less than $m+n$ equal to $m+n$ greater than $m+n$ none of these
asked Mar 31 in Programming Lakshman Patel RJIT 201 views
0 votes
2 answers
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$
asked Mar 31 in Algorithms Lakshman Patel RJIT 212 views
0 votes
1 answer
18
0 votes
2 answers
19
1 vote
1 answer
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)
asked Mar 31 in Algorithms Lakshman Patel RJIT 279 views
0 votes
3 answers
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$
asked Mar 31 in Algorithms Lakshman Patel RJIT 413 views
0 votes
1 answer
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$, then at least one of the set $S​_i$​ is a finite set. not more than one of the sets $S​_i​$ can be finite. at least one of the sets $S​_i​$ is an infinite set. not more than one of the sets $S​_i​$ can be infinite.
asked Mar 31 in Set Theory & Algebra Lakshman Patel RJIT 111 views
1 vote
2 answers
24
1 vote
2 answers
25
Regarding power of recognition of language, which of the following statements is false? Non deterministic finite-state automata are equivalent to deterministic finite-state automata. Non-deterministic push-down automata are equivalent to deterministic push-down ... are equivalent to deterministic push-down automata. Multi-tape Turing Machines are equivalent to Single-tape Turing Machines.
asked Mar 31 in Theory of Computation Lakshman Patel RJIT 331 views
1 vote
4 answers
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$
asked Mar 31 in Theory of Computation Lakshman Patel RJIT 255 views
2 votes
5 answers
27
If $L$ be a language recognizable by a finite automaton, then language from $\{L\} = \{w$ such that $w$ is a prefix of $v$ where $v\in L\}$, is a regular language. context-free language. context-sensitive language. recursive enumeration language
asked Mar 31 in Theory of Computation Lakshman Patel RJIT 279 views
0 votes
4 answers
28
Which of the following statements is correct? $A=\{a^nb^n\mid n= 0,1,2,3\dots \}$ is regular language Set $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.
asked Mar 31 in Theory of Computation Lakshman Patel RJIT 213 views
0 votes
1 answer
30
Bounded minimalization is a technique for proving whether a promotive recursive function is turning computable or not proving whether a primitive recursive function is a total function or not generating primitive recursive functions generating partial recursive functions
asked Mar 31 in Optimization Lakshman Patel RJIT 208 views
...