menu
search
Log In
Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true

Subjects

Recent questions tagged ugcnetaug2016ii

Network Sites

 GO Mechanical
 GO Electrical
 GO Electronics
 GO Civil
 CSE Doubts

Recent questions tagged ugcnetaug2016ii

2 votes
1 answer
1
UGCNET-AUG2016-II: 50
In Data mining, ______ is a method of incremental conceptual clustering. STRING COBWEB CORBA OLAD
In Data mining, ______ is a method of incremental conceptual clustering. STRING COBWEB CORBA OLAD
asked Sep 28, 2016 in Others makhdoom ghaya 1.4k views
1 vote
1 answer
2
UGCNET-AUG2016-II: 49
Discovery of cross sales opportunities is called as _____. Association Visualization Correlation Segmentation
Discovery of cross sales opportunities is called as _____. Association Visualization Correlation Segmentation
asked Sep 28, 2016 in Others makhdoom ghaya 1.9k views
1 vote
2 answers
3
UGCNET-AUG2016-II: 48
In Data mining, classification rules are extracted from _______. Data Information Decision Tree Database
In Data mining, classification rules are extracted from _______. Data Information Decision Tree Database
asked Sep 28, 2016 in Others makhdoom ghaya 2k views
1 vote
2 answers
4
UGCNET-AUG2016-II: 47
_______ is subject oriented, integrated, time variant, nonvolatile collection of data in support of management decisions. Data mining Web mining Data warehouse Database Management System
_______ is subject oriented, integrated, time variant, nonvolatile collection of data in support of management decisions. Data mining Web mining Data warehouse Database Management System
asked Sep 28, 2016 in Others makhdoom ghaya 2.9k views
0 votes
1 answer
5
UGCNET-AUG2016-II: 46
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
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
asked Sep 28, 2016 in Computer Networks makhdoom ghaya 1k views
1 vote
1 answer
6
UGCNET-AUG2016-II: 45
The extent to which a software performs its intended functions without failures, is termed as Robustness Correctness Reliability Accuracy
The extent to which a software performs its intended functions without failures, is termed as Robustness Correctness Reliability Accuracy
asked Sep 28, 2016 in IS&Software Engineering makhdoom ghaya 986 views
4 votes
2 answers
7
UGCNET-AUG2016-II: 44
For a program of $k$ variables, boundary value analysis yields ______ test cases. $4k – 1$ $4k$ $4k + 1$ $2^{k} – 1$
For a program of $k$ variables, boundary value analysis yields ______ test cases. $4k – 1$ $4k$ $4k + 1$ $2^{k} – 1$
asked Sep 28, 2016 in IS&Software Engineering makhdoom ghaya 1.4k views
1 vote
1 answer
8
UGCNET-AUG2016-II: 43
The quick design of a software that is visible to end users leads to _____. Iterative model Prototype model Spiral model Waterfall model
The quick design of a software that is visible to end users leads to _____. Iterative model Prototype model Spiral model Waterfall model
asked Sep 28, 2016 in IS&Software Engineering makhdoom ghaya 2.3k views
1 vote
1 answer
9
UGCNET-AUG2016-II: 42
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.
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.
asked Sep 28, 2016 in IS&Software Engineering makhdoom ghaya 830 views
2 votes
2 answers
10
UGCNET-AUG2016-II: 41
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.
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.
asked Sep 28, 2016 in IS&Software Engineering makhdoom ghaya 872 views
0 votes
4 answers
11
UGCNET-AUG2016-II: 40
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 ... at the beginning of Ready queue and at the end of Ready queue are not counted). $3$ $2$ $4$ $5$
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$
asked Sep 28, 2016 in Operating System makhdoom ghaya 2.3k views
0 votes
2 answers
12
UGCNET-AUG2016-II: 39
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$
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$
asked Sep 28, 2016 in Operating System makhdoom ghaya 1.3k views
2 votes
3 answers
13
UGCNET-AUG2016-II: 38
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$
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$
asked Sep 28, 2016 in Operating System makhdoom ghaya 2.7k views
0 votes
4 answers
14
UGCNET-AUG2016-II: 37
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$
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$
asked Sep 28, 2016 in Operating System makhdoom ghaya 551 views
1 vote
1 answer
15
UGCNET-AUG2016-II: 36
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 ... system deadlocked ? If yes, _______ processes are deadlocked. No Yes, $A, B, C$ Yes, $D, E, G$ Yes, $A, B, F$
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$
asked Sep 28, 2016 in Operating System makhdoom ghaya 2.3k views
0 votes
2 answers
16
UGCNET-AUG2016-II: 35
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.
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.
asked Sep 28, 2016 in Theory of Computation makhdoom ghaya 766 views
0 votes
1 answer
17
UGCNET-AUG2016-II: 34
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$
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$
asked Sep 28, 2016 in Compiler Design makhdoom ghaya 990 views
1 vote
3 answers
18
UGCNET-AUG2016-II: 33
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$ ... $P ^{*} 0$ by $0$ Replace $(P < <4) - P$ by $P ^{*} 15$
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$
asked Sep 28, 2016 in Compiler Design makhdoom ghaya 2.3k views
1 vote
2 answers
19
UGCNET-AUG2016-II: 32
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$
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$
asked Sep 26, 2016 in CO and Architecture makhdoom ghaya 3.1k views
2 votes
2 answers
20
UGCNET-AUG2016-II: 31
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$
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$
asked Sep 26, 2016 in Theory of Computation makhdoom ghaya 1.3k views
0 votes
2 answers
21
UGCNET-AUG2016-II: 30
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$
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$
asked Sep 26, 2016 in Computer Networks makhdoom ghaya 1.1k views
0 votes
1 answer
22
UGCNET-AUG2016-II: 29
Match the following : ... 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
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
asked Sep 26, 2016 in Computer Networks makhdoom ghaya 864 views
0 votes
1 answer
23
UGCNET-AUG2016-II: 28
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
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
asked Sep 26, 2016 in Computer Networks makhdoom ghaya 502 views
2 votes
2 answers
24
UGCNET-AUG2016-II: 27
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
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
asked Sep 26, 2016 in Computer Networks makhdoom ghaya 577 views
0 votes
1 answer
25
UGCNET-AUG2016-II: 26
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.
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.
asked Sep 26, 2016 in Computer Networks makhdoom ghaya 1.2k views
0 votes
2 answers
26
UGCNET-AUG2016-II: 25
Given the following prefix expression : $^{*} + 3 + 3 ↑ 3 + 3 3 3$ What is the value of the prefix expression ? $2178$ $2199$ $2205$ $2232$
Given the following prefix expression : $^{*} + 3 + 3 ↑ 3 + 3 3 3$ What is the value of the prefix expression ? $2178$ $2199$ $2205$ $2232$
asked Sep 26, 2016 in DS makhdoom ghaya 2.4k views
1 vote
1 answer
27
UGCNET-AUG2016-II: 24
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.
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.
asked Sep 26, 2016 in DS makhdoom ghaya 1.2k views
0 votes
1 answer
28
UGCNET-AUG2016-II: 23
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})$
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})$
asked Sep 26, 2016 in DS makhdoom ghaya 2.2k views
2 votes
1 answer
29
UGCNET-AUG2016-II: 22
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$
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$
asked Sep 25, 2016 in Graph Theory makhdoom ghaya 697 views
0 votes
1 answer
30
UGCNET-AUG2016-II: 21
Consider an implementation of unsorted single linked list. Suppose it has its representation with a head and a tail pointer (i.e. pointers to the first and last nodes of the linked list). Given the representation, which of the following operation can not be ... of the linked list. Deletion of the front node of the linked list. Deletion of the last node of the linked list.
Consider an implementation of unsorted single linked list. Suppose it has its representation with a head and a tail pointer (i.e. pointers to the first and last nodes of the linked list). Given the representation, which of the following operation can not be implemented in ... the end of the linked list. Deletion of the front node of the linked list. Deletion of the last node of the linked list.
asked Sep 25, 2016 in DS makhdoom ghaya 709 views
Page:
Dark theme
Muffin by Hélio Chun
Thanks to Q2A
...