Recent questions tagged upsc-mod-ssa-2022

0 0 votes
0 0 answers
132
132 views
The bound $2 n^{2}=\mathrm{O}\left(n^{2}\right)$ isnot asymptotically tightasymptotically tightpositive constant if $\mathrm{n}<0$negative constant if $\mathrm{n}>0$
0 0 votes
0 0 answers
107
107 views
Which one of the following sorting algorithms of quadratic time complexity is preferred in practice for small problem size?Insertion sortSelection sortBubble sortRecursiv...
0 0 votes
0 0 answers
106
106 views
In transpose symmetry, $\mathrm{f}(\mathrm{n})=\mathrm{O}(\mathrm{g}(\mathrm{n}))$ if and only if$\mathrm{g}(\mathrm{n})=\mathrm{o}(\mathrm{f}(\mathrm{n}))$$\mathrm{g}(\m...
0 0 votes
0 0 answers
75
75 views
Consider the recurrence equation that has upper bounds $\mathrm{T}(\mathrm{n})$ as given below :$\begin{array}{l}T(1)=1 \\T(n)=2 T(n-1)+n, \text { for } n \geq 2 .\end{ar...
0 0 votes
0 0 answers
111
111 views
For any two functions $f(n)$ and $g(n)$, we have $\mathrm{f}(\mathrm{n})=\theta(\mathrm{g}(\mathrm{n}))$ if and only if$\mathrm{f}(\mathrm{n})=\mathrm{O}(\mathrm{g}(\math...
0 0 votes
0 0 answers
80
80 views
Let $A[1 \ldots n]$ be an array of $n$ distinct numbers. The pair ( $\mathrm{i}, \mathrm{j}$ ) is called an inversion of $A$, if$\mathrm{i}>\mathrm{j}$ and $A[\mathrm{i}]...
0 0 votes
0 0 answers
93
93 views
The scope of average-case analysis is limited, becauseit may be apparent what constitutes an average input for a particular problem.it may not be apparent what constitute...
0 0 votes
0 0 answers
94
94 views
What one of the following sorting techniques has the loop invariant that the sub array $\mathrm{A}[0$ to $\mathrm{i}-1]$ is always sorted ?Insertion sortSelection sortBub...
0 0 votes
0 0 answers
76
76 views
$200$ digitized voice channels, each having a data rate of $64 \; \text{Kbps},$ are to be transmitted using a pass-band channel of $10 \; \text{KHz}.$ If no guard band is...
0 0 votes
0 0 answers
84
84 views
Which one of the following protocols is applied to noiseless channels?Stop-and-Wait ARQStop-and-WaitGo-Back-N ARQSelective Repeat ARQ
0 0 votes
0 0 answers
77
77 views
In $\text{Go-Back-N ARQ},$ suppose the sender has already sent frame $9$, but the timer for frame $5$ expires, then the sender shall resendframes $6,7,8$ onlyframe $6$ on...
0 0 votes
0 0 answers
79
79 views
In a Selective Repeat ARQ protocol, if the size of the sequence number field is $4$ bits, then the size of the sender and receiver window must beat most $2$ bitsat most $...
0 0 votes
0 0 answers
70
70 views
The size and the value of the flag field in an $\text{HDLC}$ frame respectively are$8$ bits and $01000010$$8$ bits and $01111110$$4$ bits and $1000$$4$ bits and $0000$
0 0 votes
0 0 answers
69
69 views
Which one of the following multiple access protocols is a channelization protocol?ALOHACSMA/CDPoolingTDMA
0 0 votes
0 0 answers
75
75 views
If $\mathrm{G}$ is the average number of frames generated by the system during one frame transmission time, then the maximum throughput $\mathrm{S}_{\text {max }}$ of the...
0 0 votes
1 1 answer
93
93 views
If $\mathrm{X=\{A, B, C, E\}, Y=\{C, E, F, G\}}$ and $\mathrm{Z=\{A, B, G, H\}}$, then $((X \oplus Y)-Z)$ is$\{\mathrm{A}, \mathrm{B}\}$$\{\mathrm{F}\}$$\{\mathrm{A}, \ma...
0 0 votes
0 0 answers
70
70 views
Consider the Enhanced ER (EER) diagram given below:Which of the following possible constraints hold correct?disjoint, totaldisjoint, partialoverlapping, totaloverlapping,...
0 0 votes
0 0 answers
97
97 views
Consider the relation schemas $R$ and $T:$$$\begin{array}{l}\mathrm{R}=\left(\mathrm{r}_{1}, \mathrm{r}_{2}, \mathrm{r}_{3}\right) \\\mathrm{T}=\left(\mathrm{t}_{1}, \mat...
0 0 votes
0 0 answers
71
71 views
Consider the relation $\textbf{r}:$$\text{X}$$\text{Y}$$\text{Z}$$\mathrm{a}_{1}$$\mathrm{a}_{1}$$\mathrm{a}_{2}$$\mathrm{a}_{2}$$\mathrm{b}_{1}$$\mathrm{b}_{1}$$\mathrm{...
0 0 votes
0 0 answers
89
89 views
Consider, the schedule $S$ for three transactions, namely $\mathrm{T}_{1}, \mathrm{~T}_{2}$ and $\mathrm{T}_{3}$ with read and write operations on items $\mathrm{X}, \mat...
0 0 votes
1 1 answer
126
126 views
Which one of the following is not a valid level of the ANSI/SPARC database architecture?Hyper levelExternal levelConceptual levelStorage level
0 0 votes
0 0 answers
73
73 views
Which one of the following operations causes database changes to be visible to other transactions?UPDATESUBMITRELEASECOMMIT
0 0 votes
0 0 answers
78
78 views
Which one of the following statements is not correct regarding a relational model?Every tuple contains exactly one value for each attribute.There exists a left to right o...
0 0 votes
0 0 answers
78
78 views
In relational algebra, the operation $\mathrm{a \: SEMIMINUS \: b}$ on two same type relations $\mathrm{a}$ and $\mathrm{b}$ is defined as$\mathrm{a \: SEMIJOIN \:(b \: M...
0 0 votes
0 0 answers
74
74 views
Suppose $\mathrm{S}$ is a collection of training-example days described by attributes including Wind, which can have the values Weak or Strong. Assume $\mathrm{S}$ is a c...
0 0 votes
0 0 answers
64
64 views
In Backpropagation algorithm, which one of the following models is employed to minimize the squared error between the network output values and the target values for thes...
0 0 votes
0 0 answers
92
92 views
One of the most intriguing properties of backpropagation isto minimize the risk of overfitting.its ability to invent new features that are not explicit in the input to th...
0 0 votes
0 0 answers
64
64 views
Which one of the following statements is correct regarding central limit theorem?It can be viewed as the name of an experiment with a probabilistic outcome.A random varia...
0 0 votes
0 0 answers
73
73 views
Suppose you test a hypothesis $\text{h}$ and find that it commits $\mathrm{r}=300$ errors on a sample $\text{S}$ of $\mathrm{n}=1000$ randomly drawn test examples. What i...
0 0 votes
0 0 answers
67
67 views
Which one of the following is not a type of $\text{UNINFORMED}$ search strategy?A* searchDepth limited searchDepth first searchUniform cost search