search
Log In

Recent questions tagged nielit2017dec-scientistb

3 votes
5 answers
1
Which one of the following statements are not correct? $S1$: $3$NF decomposition is always lossless join and dependency preserving. $S2$: $3$NF decomposition is always lossless join but may or may not be dependency preserving. $S3$: BCNF decomposition is always lossless join and dependency ... but may or may not be dependency preserving. Only $S1$ Only $S4$ Both $S1$ and $S4$ Both $S2$ and $S3$
asked Mar 30, 2020 in Databases Lakshman Patel RJIT 1.4k views
0 votes
7 answers
2
According to the given language, which among the following expressions does it correspond to ? Language $L=\{x\in\{0,1\}\mid x\text{ is of length 4 or less}\}$. $(0+1+0+1+0+1+0+1)^4$ $(0+1)^4$ $(01)^4$ $(0+1+\varepsilon)^4$
asked Mar 30, 2020 in Theory of Computation Lakshman Patel RJIT 1.3k views
0 votes
2 answers
3
Using bisection method, one root of $x^4-x-1$ lies between $1$ and $2$. After second iteration the root may lie in interval: $(1.25,1.5)$ $(1,1.25)$ $(1,1.5)$ None of the options.
asked Mar 30, 2020 in Numerical Methods Lakshman Patel RJIT 905 views
0 votes
4 answers
4
2 votes
4 answers
5
2 votes
5 answers
6
0 votes
1 answer
7
Let $G$ be a grammar in CFG and let $W_1,W_2\in L(G)$ such that $\mid W_1\mid=\mid W_2\mid$ then which of the following statements is true? Any derivation of $W_1$ has exactly the same number of steps as any derivation of $W_2$. Different derivation have different length. Some derivation of $W_1$ may be shorter than the derivation of $W_2$ None of the options
asked Mar 30, 2020 in Theory of Computation Lakshman Patel RJIT 382 views
1 vote
3 answers
8
Let $A$ be an array of $31$ numbers consisting of a sequence of $0$’s followed by a sequence of $1$’s. The problem is to find the smallest index $i$ such that $A[i]$ is $1$ by probing the minimum number of locations in $A$. The worst case number of probes performed by an optimal algorithm is $2$ $4$ $3$ $5$
asked Mar 30, 2020 in Algorithms Lakshman Patel RJIT 418 views
0 votes
3 answers
10
A regular expression is $(a+b^{\ast}c)$ is equivalent to set of strings with either $a$ or one or more occurrence of $b$ followed by $c$. $(b^{\ast}c+a)$ set of strings with either $a$ or zero or more occurrence of $b$ followed by $c$. Both (B) and (C)
asked Mar 30, 2020 in Theory of Computation Lakshman Patel RJIT 897 views
1 vote
2 answers
11
Which of the following are undecidable? $P1$: The language generated by some CFG contains any words of length less than some given number $n$. $P2$: Let $L1$ be CFL and $L2$ be regular, to determine whether $L1$ and $L2$ have common elements $P3$: Any given CFG is ambiguous or not. ... CFG $G$, to determine whether epsilon belongs to $L(G)$ $P2$ only $P1$ and $P2$ only $P2$ and $P3$ only $P3$ only
asked Mar 30, 2020 in Theory of Computation Lakshman Patel RJIT 991 views
0 votes
4 answers
12
Consider the following four processes with their corresponding arrival time and burst time: $\begin{array} \text{Process}&\text{Arrival time}&\text{Burst time(in ms)}\\ \text{P1}&0.0&8\\ \text{P2}&0.6&6\\ \text{P3}&3.8&4\\ \text{P4}&4.4&2\end{array}$ What is the average turn around time (in ms) for these processes using FCFS scheduling algorithm? $15$ $12.8$ $13$ none of the options
asked Mar 30, 2020 in Operating System Lakshman Patel RJIT 864 views
1 vote
5 answers
13
Consider a non-pipelined machine with $6$ stages; the lengths of each stage are $\text{20ns, 10ns, 30ns,25ns, 40 ns}$ and $\text{15ns}$ respectively. Suppose for implementing the pipelining the machine adds $\text{5 ns}$ of overhead to each stage for clock skew and set up. What is the speed up factor of the pipelining system (ignoring any hazard impact)? $7$ $14$ $3.11$ $6.22$
asked Mar 30, 2020 in CO and Architecture Lakshman Patel RJIT 1.7k views
0 votes
3 answers
14
We have $10$-stage pipeline, where the branch target conditions are resolved at stage $5$. How many stalls are there for an incorrectly predicted branch? $5$ $6$ $7$ $4$
asked Mar 30, 2020 in CO and Architecture Lakshman Patel RJIT 776 views
0 votes
1 answer
15
1 vote
4 answers
16
Which of the following is added to the page table in order to track whether a page of cache has been modified since it was read from the memory? Reference bit Dirty bit Tag bit Valid bit
asked Mar 30, 2020 in Operating System Lakshman Patel RJIT 1.2k views
0 votes
2 answers
17
The time taken to switch between user and kernel modes of execution be $t1$ while the time taken to switch between two processes be $t2$. Which of the following is TRUE? $t1>t2$ $t1=t2$ $t1<t2$ nothing can be said about the relation between $t1$ and $t2$
asked Mar 30, 2020 in Operating System Lakshman Patel RJIT 557 views
1 vote
3 answers
18
In conservative two phase locking protocol, a transaction Should release all the locks only at the beginning of transaction Should release exclusive locks only after the commit operation Should acquire all the exclusive locks at the beginning of transaction Should acquire all the locks at the beginning of transaction
asked Mar 30, 2020 in Databases Lakshman Patel RJIT 1k views
0 votes
1 answer
20
Let $u$ and $v$ be two vectors in $R^2$ whose Eucledian norms satisfy $\mid u\mid=2\mid v \mid$. What is the value $\alpha$ such that $w=u+\alpha v$ bisects the angle between $u$ and $v$? $2$ $1$ $\dfrac{1}{2}$ $-2$
asked Mar 30, 2020 in Numerical Methods Lakshman Patel RJIT 184 views
0 votes
1 answer
21
A system has $3$ processes sharing $4$ resources. If each process needs a maximum of $2$ units then, deadlock Can never occur Has to occur May occur None of the options
asked Mar 30, 2020 in Operating System Lakshman Patel RJIT 380 views
0 votes
5 answers
22
What is the meaning of regular expression $\Sigma^*001\Sigma^*$? Any string containing ‘$1$’ as substring Any string containing ‘$01$’ as substring Any string containing ‘$011$’ as substring All string containing ‘$001$’ as substring
asked Mar 30, 2020 in Theory of Computation Lakshman Patel RJIT 580 views
0 votes
1 answer
23
Let $G$ be a complete undirected graph on $8$ vertices. If vertices of $G$ are labelled, then the number of distinct cycles of length $5$ in $G$ is equal to: $15$ $30$ $56$ $60$
asked Mar 30, 2020 in Graph Theory Lakshman Patel RJIT 812 views
1 vote
2 answers
24
Which of the following is TRUE? Every relation in $3$NF is also in BCNF A relation R is in $3$NF if every non-prime attribute of R is fully functionally dependent on every key of R Every relation in BCNF is also in $3$NF No relation can be in both BCNF and $3$NF.
asked Mar 30, 2020 in Databases Lakshman Patel RJIT 362 views
0 votes
4 answers
25
Consider the relational schema $R(A B C D)$ with following $FD$ set $F=\{A \to CE, B \to D, AE \to D\}$. Identify the highest normal form satisfied by the relation $R$. $2$NF BCNF $3$NF $1$NF
asked Mar 30, 2020 in Databases Lakshman Patel RJIT 1.9k views
0 votes
2 answers
27
If any string of a language $L$ can be effectively enumerated by an enumerator in a lexicographic order then language $L$ is _______. Regular Context free but not necessarily regular Recursive but not necessarily context free Recursively enumerable but not necessarily recursive
asked Mar 30, 2020 in Theory of Computation Lakshman Patel RJIT 364 views
0 votes
3 answers
28
0 votes
2 answers
29
1 vote
2 answers
30
Consider a complete binary tree where the left and the right sub trees of the root are max-heaps. The lower bound for the number of operations to convert the tree to a heap is: $\Omega(\log n)$ $\Omega(n\log n)$ $\Omega(n)$ $\Omega(n^2)$
asked Mar 30, 2020 in DS Lakshman Patel RJIT 415 views
...