# Recent questions tagged ugcnetjune2014iii

1
Four bits are used for packed sequence numbering in a slinding window protocol used in a computer network. What is the maximum window size? 4 8 15 16
2
Assume that a program will experience 200 failures in infinite time. It has now experienced 100 failures. The initial failure intensity was 20 failures/CPU hr. Then the current failure intensity will be 5 failured/CPU hr 10 failured/CPU hr 20 failured/CPU hr 40 failured/CPU hr
3
Software testing is the process of establishing that errors are not present the process of establishing confidence that a program does what it is supposed to do the process of executing a program to show that it is working as per specifications the process of executing a program with the intent of finding errors
4
Let $L$ be any language. Define $\text{Even} (W)$ as the strings obtained by extracting from $W$ the letters in the even-numbered positions and $\text{Even}(L) = \{ \text{Even} (W) \mid W \in L\}.$ We define another language $\text{Chop} (L)$ by removing the two leftmost ... $\text{Even(L)}$ is not regular and $\text{Chop(L)}$ is regular Both $\text{Even(L)}$ and $\text{Chop(L)}$ are not regular
5
Which one of the following describes the syntax of prolog program? Rules and facts are terminated by full stop(.) Rules and facts are terminated by semi colon(;) Variables names must start with upper case alphabets. Variables names must start with lower case alphabets. I, II III, IV I, III II, IV
6
Given $U=\{1, 2, 3, 4, 5, 6, 7 \} \\ A =\{(3, 0.7), (5, 1), (6, 0.8) \}$ then $\tilde{A}$ will be: (where $\sim \rightarrow$ complement) $\{(4, 0.7), (2, 1), (1, 0.8)\}$ $\{(4, 0.3), (5, 0), (6, 0.2)\}$ $\{(1, 1), (2, 1), (3, 0.3), (4, 1), (6, 0.2), (7, 1) \}$ $\{(3, 0.3), (6, 0.2)\}$
7
Given the following two languages : $L_{1}=\left\{a^{n}b^{n}|n\geq 1\right\} \cup \left\{a\right\}$ $L_{2}=\left\{w C w^{R}|w \in \left\{a, b\right\}^{*}\right\}$ Which statement is correct ? Both $L_{1}$ and $L_{2}$ ... is not deterministic and $L_{2}$ is deterministic. $L_{1}$ is deterministic and $L_{2}$ is not deterministic. Both $L_{1}$ and $L_{2}$ are deterministic.
8
Match the following : LIST-I LIST-II a. Chomsky Normal form i. $S \rightarrow b S S | a S | c$ b. Greibach Normal form ii. $S \rightarrow a S b | ab$ c. S-grammar iii. $S \rightarrow AS | a A \rightarrow SA | b$ d. LL grammar iv. $S \rightarrow a B S B B \rightarrow b$ a-iv; b-iii; c-i; d-ii a-iv; b-iii; c-ii; d-i a-iii; b-iv; c-i; d-ii a-iii; b-iv; c-ii; d-i
9
Given the following two grammars : $G_{1} : S \rightarrow AB | aaB$ $A \rightarrow a | Aa$ $B \rightarrow b$ $G_{2} : S \rightarrow a S b S | b S a S | \lambda$ Which statement is correct ? $G_{1}$ is unambiguous and $G_{2}$ is unambiguous. $G_{1}$ is unambiguous and $G_{2}$ is ambiguous. $G_{1}$ is ambiguous and $G_{2}$ is unambiguous. $G_{1}$ is ambiguous and $G_{2}$ is ambiguous.
1 vote
10
A network on the Internet has a subnet mask of $255.255.240.0$. What is the maximum number of hosts it can handle ? $1024$ $2048$ $4096$ $8192$
11
Which layers of the OSI reference model are host-to-host layers ? Transport, Session, Presentation, Application Network, Transport, Session, Presentation Data-link, Network, Transport, Session Physical, Data-link, Network, Transport
12
Which of the following is used in the options field of $IPv4$? Strict source routing Loose source routing Time stamp All of the above
13
A terminal multiplexer has six $1200$ bps terminals and $'n'$ $300$ bps terminals connected to it. If the outgoing line is $9600$ bps, what is the value of $n$? $4$ $8$ $16$ $28$
14
Ten signals, each requiring $3000$ Hz, are multiplexed on to a single channel using FDM. How much minimum bandwidth is required for the multiplexed channel ? Assume that the guard bands are $300$ Hz wide. $30,000$ $32,700$ $33,000$ None of the above
15
Suppose that the splits at every level of quicksort are in the proportion $(1 – \alpha)$ to $\alpha$, where $0<\alpha\leq\frac{1}{2}$ is a constant. The minimum depth of a leaf in the recursion tree is approximately given by $-\frac{lgn}{lg(1-\alpha)}$ $-\frac{lg(1-\alpha)}{lgn}$ $-\frac{lgn}{lg\alpha}$ $-\frac{lg\alpha}{lgn}$
1 vote
16
Given the following statements : $S_{1}$ : The subgraph-isomorphism problem takes two graphs $G_{1}$ and $G_{2}$ and asks whether $G_{1}$ is a subgraph of $G_{2}$ . $S_{2}$ : The set-partition problem takes as input a set $S$ of numbers and asks whether the numbers can be partitioned into ... $S_{1}$ is $P$ problem and $S_{2}$ is $P$ problem. $S_{1}$ is $P$ problem and $S_{2}$ is $NP$ problem.
17
If $h$ is chosen from a universal collection of hash functions and is used to hash $n$ keys into a table of size $m$, where $n \leq m$, the expected number of collisions involving a particular key $K$ is Less than $1$ Less than $lg n$ Greater than $1$ Greater than $lg n$
1 vote
18
The solution of the recurrence relation of $T(n)=3T\left(floor \left(\frac{n}{4}\right)\right)+n$ is $O(n^{2})$ $O(n/g n)$ $O(n)$ $O(l g n)$
1 vote
19
Consider the fractional knapsack instance $n = 4, (p_{1} , p_{2} , p_{3} , p_{4} ) = (10, 10, 12, 18), (w_{1} , w_{2} , w_{3} , w_{4} ) = (2, 4, 6, 9)$ and $M = 15$. The maximum profit is given by (Assume $p$ and $w$ denotes profit and weight of objects respectively) $40$ $38$ $32$ $30$
1 vote
20
Given the following equalities : $E_{1}: n^{K+\in} + n^{K} \lg n = \theta (n^{K+\in})$ for all fixed $K$ and $\in, K \geq 0$ and $\in >0$. $E_{2}:n^{3}2^{n}+6n^{2}3^{n}=O (n^{3}2^{n})$. Which of the following is true ? $E_{1}$ ... . $E_{1}$ is correct and $E_{2}$ is not correct. $E_{1}$ is not correct and $E_{2}$ is correct. $E_{1}$ is not correct and $E_{2}$ is not correct.
1 vote
21
The initial basic feasible solution of the following transportion problem: is given as 5 8 7 2 2 10 then the minimum cost is 76 78 80 82
22
The given maximization assignment problem can be converted into a minimization problem by Subtracting each entry in a column from the maximum value in that column. Subtracting each entry in the table from the maximum value in that table. Adding each entry in a column from the maximum value in that column. Adding maximum value of the table to each entry in the table.
1 vote
23
Which of the following special cases does not require reformulation of the problem in order to obtain a solution ? Alternate optimality Infeasibility Unboundedness All of the above
24
Consider a code with five valid code words of length ten : $0000000000, 0000011111, 1111100000, 1110000011, 1111111111$ Hamming distance of the code is $5$ $10$ $8$ $9$
1 vote
25
Match the following cryptographic algorithms with their design issues : LIST-I LIST-II a. DES i. Message Digest b. AES ii. Public Key c. RSA iii. 56-bit key d. SHA-1 iv. 128-bit key a-ii; b-i; c-iv; d-iii a-iii; b-i; c-iv; d-ii a-iii; b-iv; c-ii; d-i a-iv; b-i; c-ii; d-iii
26
Given an image of size $1024 \times 1024$ pixels in which intensity of each pixel is an $8$-bit quality. It requires _______ of storage space if the image is not compressed. One Terabyte One Megabyte $8$ Megabytes $8$ Terabytes
27
Linking to another place in the same or another webpage require two A (Anchor) tags, the first with the _______ attribute and the second with the _______ attribute. NAME & LINK LINK & HREF HREF & NAME TARGET & VALUE