# Recent questions tagged ugcnetaug2016ii

1
In Data mining, ______ is a method of incremental conceptual clustering. STRING COBWEB CORBA OLAD
1 vote
2
Discovery of cross sales opportunities is called as _____. Association Visualization Correlation Segmentation
1 vote
3
In Data mining, classification rules are extracted from _______. Data Information Decision Tree Database
1 vote
4
_______ is subject oriented, integrated, time variant, nonvolatile collection of data in support of management decisions. Data mining Web mining Data warehouse Database Management System
5
An attacker sits between the sender and receiver and captures the information and retransmits to the receiver after some time without altering the information. This attack is called as _____. Denial of service attack Masquarade attack Simple attack Complex attack
1 vote
6
The extent to which a software performs its intended functions without failures, is termed as Robustness Correctness Reliability Accuracy
7
For a program of $k$ variables, boundary value analysis yields ______ test cases. $4k – 1$ $4k$ $4k + 1$ $2^{k} – 1$
1 vote
8
The quick design of a software that is visible to end users leads to _____. Iterative model Prototype model Spiral model Waterfall model
1 vote
9
The major shortcoming of waterfall model is The difficulty in accommodating changes after requirement analysis. The difficult in accommodating changes after feasibility analysis. The system testing. The maintenance of system.
10
Which of the following is used to determine the specificity of requirements ? $\frac{n_{1}}{n_{2}}$ $\frac{n_{1}}{n_{2}}$ $n_{1} + n_{2}$ $n_{1} - n_{2}$ Where $n_{1}$ is the number of requirements for which all reviewers have identical interpretations, $n_{2}$ is number of requirements in a specification.
11
Consider three CPU intensive processes $P1, P2, P3$ which require $20, 10$ and $30$ units of time, arrive at times $1, 3$ and $7$ respectively. Suppose operating system is implementing Shortest Remaining Time first (preemptive scheduling) algorithm, then _____ context switches are required ... switch at the beginning of Ready queue and at the end of Ready queue are not counted). $3$ $2$ $4$ $5$
12
Five jobs $A, B, C, D$ and $E$ are waiting in Ready Queue. Their expected runtimes are $9, 6, 3, 5$ and $x$ respectively. All jobs entered in Ready queue at time zero. They must run in _____ order to minimize average response time if $3 < x < 5$. $B, A, D, E, C$ $C, E, D, B, A$ $E, D, C, B, A$ $C, B, A, E, D$
13
Consider a system having ‘m’ resources of the same type. These resources are shared by three processes $P_{1} , P_{2}$ and $P_{3}$ which have peak demands of $2, 5$ and $7$ resources respectively. For what value of $'m'$ deadlock will not occur ? $70$ $14$ $13$ $7$
14
Suppose that the virtual Address space has eight pages and physical memory with four page frames. If $LRU$ page replacement algorithm is used, ______ number of page faults occur with the reference string. 0 2 1 3 5 4 6 3 7 4 7 3 3 5 5 3 1 1 1 7 2 3 4 1 $11$ $12$ $10$ $9$
1 vote
15
Consider a system with seven processes $A$ through $G$ and six resources $R$ through $W$. Resource ownership is as follows : process $A$ holds $R$ and wants $T$ process $B$ holds nothing but wants $T$ process $C$ holds nothing but wants $S$ process $D$ holds $U$and wants $S$ ... Is the system deadlocked ? If yes, _______ processes are deadlocked. No Yes, $A, B, C$ Yes, $D, E, G$ Yes, $A, B, F$
16
Which of the following is FALSE ? The grammar $S \rightarrow aS|aSbS|\in$, where $S$ is the only non-terminal symbol, and $\in$ is the null string, is ambiguous. An unambiguous grammar has same left most and right most derivation. An ambiguous grammar can never be $LR(k)$ for any $k$. Recursive descent parser is a top-down parser.
17
Which of the following are the principles tasks of the linker ? I. Resolve external references among separately compiled program units. II. Translate assembly language to machine code. III. Relocate code and data relative to the beginning of the program. IV. Enforce access-control restrictions on system libraries. $I$ and $II$ $I$ and $III$ $II$ and $III$ $I$ and $IV$
1 vote
18
In compiler optimization, operator strength reduction uses mathematical identities to replace slow math operations with faster operations. Which of the following code replacements is an illustration of operator strength reduction ? Replace $P + P$ by $2 ^{*} P$ or Replace $3 + 4$ by $7$. Replace $P ^{*} 32$ by $P < < 5$ Replace $P ^{*} 0$ by $0$ Replace $(P < <4) - P$ by $P ^{*} 15$
1 vote
19
The content of the accumulator after the execution of the following 8085 assembly language program, is MVI A, 35H MOV B, A STC CMC RAR XRA B $00H$ $35H$ $EFH$ $2FH$
20
The number of strings of length 4 that are generated by the regular expression $(0+ 1+ | 2+ 3+ )^{*}$, where | is an alternation character and ${+, ^{*}}$ are quantification characters, is : $08$ $09$ $10$ $12$
21
Which of the following protocols is used by email server to maintain a central repository that can be accessed from any machine ? $POP3$ $IMAP$ $SMTP$ $DMSP$
22
Match the following : ... -iv, b-i, c-ii, d-iii a-i, b-iv, c-ii, d-iii a-iv, b-i, c-iii, d-ii a-iv, b-ii, c-i, d-iii
23
A network with bandwidth of $10$ Mbps can pass only an average of $12,000$ frames per minute with each frame carrying an average of $10,000$ bits. What is the throughput of this network ? $1$ Mbps $2$ Mbps $10$ Mbps $12$ Mbps
24
In a fast Ethernet cabling, $100$ Base-$TX$ uses ______ cable and maximum segment size is ______. Twisted pair, $100$ metres Twisted pair, $200$ metres Fibre optics, $1000$ metres Fibre optics, $2000$ metres
25
Which of the following statements is not true with respect to microwaves ? Electromagnetic waves with frequencies from $300$ GHz to $400$ THz. Propagation is line-of-sight. Very high-frequency waves cannot penetrate walls. Use of certain portions of the band requires permission from authorities.
26
Given the following prefix expression : $^{*} + 3 + 3 ↑ 3 + 3 3 3$ What is the value of the prefix expression ? $2178$ $2199$ $2205$ $2232$
1 vote
27
Consider the following statements : $S_{1}$ : A queue can be implemented using two stacks. $S_{2}$ : A stack can be implemented using two queues. Which of the following is correct ? $S_{1}$ is correct and $S_{2}$ is not correct. $S_{1}$ is not correct and $S_{2}$ is correct. Both $S_{1}$ and $S_{2}$ are correct. Both $S_{1}$ and $S_{2}$ are not correct.
The runtime for traversing all the nodes of a binary search tree with $n$ nodes and printing them in an order is $O(\lg n)$ $O(n \lg n)$ $O(n)$ $O(n^{2})$
Consider an undirected graph $G$ where self-loops are not allowed. The vertex set of $G$ is ${(i, j) | 1 \leq i \leq 12, 1 \leq j \leq 12}$. There is an edge between $(a, b)$ and $(c, d)$ if $|a – c| \leq 1$ or $| b – d | \leq 1$. The number of edges in this graph is $726$ $796$ $506$ $616$