Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Filter
Profile
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Answers by sh!va
0
votes
161
Network media
Shiva is working as a network engineer and recently he got an assignment to design a reliable but cheaper Ethernet connection between two offices. The Details are like this. Two buildings are just 150 meters apart. There can be frequent problems with volatge potential differences between two offices. ... STP b. coaxial c. Fiber optic I. a , b or c II. b or c III. b only IV. c only
Shiva is working as a network engineer and recently he got an assignment to design a reliable but cheaper Ethernet connection between two offices. The Details are like t...
346
views
answered
Sep 9, 2016
Computer Networks
computer-networks
+
–
1
votes
162
UGC NET CSE | December 2010 | Part 2 | Question: 11
How many of the following declarations are correct ? int $z = 7.0$; double void = $0.000$; short array $[2] = {0, 1, 2}$; char c = “\n”; None One is correct Two are correct All four are correct
How many of the following declarations are correct ?int $z = 7.0$;double void = $0.000$;short array $ = {0, 1, 2}$; char c = “\n”;NoneOne is correctTwo are correctAl...
1.9k
views
answered
Sep 6, 2016
Programming and DS
ugcnetcse-dec2010-paper2
programming-in-c
+
–
22
votes
163
GATE CSE 2012 | Question: 39
A list of $n$ strings, each of length $n$, is sorted into lexicographic order using the merge-sort algorithm. The worst case running time of this computation is $O (n \log n) $ $ O(n^{2} \log n) $ $ O(n^{2} + \log n) $ $ O(n^{2}) $
A list of $n$ strings, each of length $n$, is sorted into lexicographic order using the merge-sort algorithm. The worst case running time of this computation is$O (n \log...
28.8k
views
answered
Sep 3, 2016
Algorithms
gatecse-2012
algorithms
sorting
normal
+
–
0
votes
164
UGC NET CSE | June 2016 | Part 3 | Question: 26
Given the following statements: Frequency Division Multiplexing is a technique that can be applied when a bandwidth of a link is greater than combined bandwidth of signals to be transmitted Wavelength Division Multiplexing (WDM) is an analogue multiplexing technique to combine ... is true $\text{i, ii,}$ and $\text{iv}$ are true; $\text{iii}$ is false
Given the following statements:Frequency Division Multiplexing is a technique that can be applied when a bandwidth of a link is greater than combined bandwidth of signals...
2.6k
views
answered
Sep 1, 2016
Computer Networks
ugcnetcse-june2016-paper3
computer-networks
+
–
1
votes
165
UGC NET CSE | June 2016 | Part 3 | Question: 21
Which of the following is false regarding the evaluation of computer programming language: Application oriented features Efficiency and reliability Software development Hardware maintenance cost
Which of the following is false regarding the evaluation of computer programming language:Application oriented featuresEfficiency and reliabilitySoftware developmentHardw...
1.7k
views
answered
Sep 1, 2016
Programming in C
ugcnetcse-june2016-paper3
programming
+
–
6
votes
166
UGC NET CSE | June 2016 | Part 3 | Question: 31
The number of different binary trees with 6 nodes is 6 42 132 256
The number of different binary trees with 6 nodes is642132256
7.1k
views
answered
Sep 1, 2016
Combinatory
ugcnetcse-june2016-paper3
combinatory
binary-tree
+
–
1
votes
167
practics paper
consider following input sequence 01010101............ A) what will be regular expression to accept all prefixes of the given sequence__ 1. 0(10)* 2. 0(01)* 3. 0(10)*+(01)* 4. 0*+(101)* B) how many minimum number of state are required in a DFA for accepting the correct regular expression? a.3 b.2 c.4 d.5
consider following input sequence 01010101............A) what will be regular expression to accept all prefixes of the given sequence__1. 0(10)*2. 0(01)*3. 0(10)*+(01)*4....
380
views
answered
Sep 1, 2016
0
votes
168
UGC NET CSE | December 2011 | Part 2 | Question: 46
To compare, overlay or cross analyze to maps in $GIS$. Both maps must be in digital form Both maps must be at the same equivalent scale. Both maps must be on the same coordinate system All of the above
To compare, overlay or cross analyze to maps in $GIS$.Both maps must be in digital formBoth maps must be at the same equivalent scale.Both maps must be on the same coordi...
1.1k
views
answered
Aug 22, 2016
Others
ugcnetcse-dec2011-paper2
geographical-information-system
+
–
2
votes
169
UGC NET CSE | December 2011 | Part 2 | Question: 17
Design recovery from source code is done during reverse engineering re-engineering reuse all of the above
Design recovery from source code is done duringreverse engineeringre-engineeringreuseall of the above
2.8k
views
answered
Aug 17, 2016
IS&Software Engineering
ugcnetcse-dec2011-paper2
is&software-engineering
+
–
1
votes
170
UGC NET CSE | December 2011 | Part 2 | Question: 18
Following is used to demonstrate that the new release of software still performs the old one did by rerunning the old tests : Functional testing Path testing Stress testing Regression testing
Following is used to demonstrate that the new release of software still performs the old one did by rerunning the old tests :Functional testingPath testingStress testingR...
1.1k
views
answered
Aug 17, 2016
IS&Software Engineering
ugcnetcse-dec2011-paper2
is&software-engineering
software-testing
+
–
3
votes
171
UGC NET CSE | June 2016 | Part 2 | Question: 48
Pipelining improves performance by decreasing instruction latency eliminating data hazards exploiting instruction level parallelism decreasing the cache miss rate
Pipelining improves performance bydecreasing instruction latencyeliminating data hazardsexploiting instruction level parallelismdecreasing the cache miss rate
4.1k
views
answered
Aug 16, 2016
CO and Architecture
ugcnetcse-june2016-paper2
co-and-architecture
pipelining
+
–
0
votes
172
UGC NET CSE | June 2016 | Part 2 | Question: 30
Optical fiber uses reflection to guide light through a channel, in which angle of incidence is ____ the critical angle equal to less than greater than less than or equal to
Optical fiber uses reflection to guide light through a channel, in which angle of incidence is ____ the critical angleequal toless thangreater thanless than or equal to
3.8k
views
answered
Aug 16, 2016
Computer Networks
ugcnetcse-june2016-paper2
computer-networks
transmission-media
+
–
0
votes
173
UGC NET CSE | June 2016 | Part 2 | Question: 34
Which of the following is not typically a benefit of dynamic linking? Reduction in overall program execution time Reduction in overall space consumption in memory Reduction in overall space consumption on disk Reduction in the cost of software updates I and IV I only II and III IV only
Which of the following is not typically a benefit of dynamic linking?Reduction in overall program execution timeReduction in overall space consumption in memoryReduction ...
3.0k
views
answered
Aug 16, 2016
Operating System
ugcnetcse-june2016-paper2
operating-system
dynamic-linking
+
–
1
votes
174
UGC NET CSE | June 2016 | Part 2 | Question: 33
In ____, the bodies of the two loops are merged together to form a single loop provided that they do not make any references to each other. Loop unrolling Strength reductions Loop concatenation Loop jamming
In ____, the bodies of the two loops are merged together to form a single loop provided that they do not make any references to each other.Loop unrollingStrength reductio...
9.4k
views
answered
Aug 16, 2016
Compiler Design
ugcnetcse-june2016-paper2
compiler-design
compiler-optimization
+
–
3
votes
175
UGC NET CSE | June 2016 | Part 2 | Question: 37
Suppose there are $4$ processes in execution with $12$ instances of a Resource $R$ ... allocation, is system safe? If so, what is the safe sequence? No Yes, $P_1P_2P_3P_4$ Yes, $P_4P_3P_1P_2$ Yes, $P_2P_1P_3P_4$
Suppose there are $4$ processes in execution with $12$ instances of a Resource $R$ in a system.The maximum need of each process and current allocation are given below :$\...
4.1k
views
answered
Aug 16, 2016
Operating System
ugcnetcse-june2016-paper2
operating-system
+
–
1
votes
176
Algorithms
Consider the following fragment of code for a graph algorithm on an undirected graph. for each vertex i in V mark i as visited for each edge (j,i) pointing into i update weight(j,i) to weight(j,i) + k Which of the following is the most accurate description of the complexity of this fragment. ( ... n is the number of vertices, m is the number of edges.) (a) O(n) (b)O(nm) (c)O(n+m) (d)O(m)
Consider the following fragment of code for a graph algorithm on an undirected graph. for each vertex i in V mark i as visited for each edge (j,i) pointing into i...
1.2k
views
answered
Aug 16, 2016
Algorithms
graph-algorithms
time-complexity
+
–
2
votes
177
test series
Devid has an algorithm X for a problem with time complexity X that is polynominal over input size. Jack has an algorithm Y for another problem with time complexity Y that is exponential over the input size, Michel has an alogrithm Z for another problem with time complexity Z that is double ... size. which is correct 1.theta(X)=theta(y) 2.theta(X)=theta(Z) 3.theta(Y)=theta(Z) 4.O(Z)=X
Devid has an algorithm X for a problem with time complexity X that is polynominal over input size.Jack has an algorithm Y for another problem with time complexity Y that...
520
views
answered
Aug 16, 2016
Algorithms
test-series
time-complexity
+
–
5
votes
178
UGC NET CSE | June 2016 | Part 2 | Question: 5
A clique in a simple undirected graph is a complete subgraph that is not contained in any larger complete subgraph. How many cliques are there in a graph shown below? 2 4 5 6
A clique in a simple undirected graph is a complete subgraph that is not contained in any larger complete subgraph. How many cliques are there in a graph shown below?2456...
5.4k
views
answered
Aug 16, 2016
DS
ugcnetcse-june2016-paper2
data-structures
graph-theory
+
–
0
votes
179
How many times a message passes network and data link layer?
A message is sent from A to B. How many times the message passes network and data link layer?
A message is sent from A to B.How many times the message passes network and data link layer?
647
views
answered
Aug 11, 2016
Unknown Category
computer-networks
+
–
2
votes
180
UGC NET CSE | December 2015 | Part 3 | Question: 48
As compared to rental and leasing methods to acquire computer systems for a Management Information System (MIS), purchase method has following advantage: It has high level of flexibility It does not require cash up-front It is a business investment Little risk of obsolescence
As compared to rental and leasing methods to acquire computer systems for a Management Information System (MIS), purchase method has following advantage:It has high level...
1.0k
views
answered
Aug 11, 2016
Others
ugcnetcse-dec2015-paper3
information-system
+
–
2
votes
181
UGC NET CSE | December 2015 | Part 3 | Question: 47
In constraint satisfaction problem, constraints can be stated as Arithmetic equations and inequalities that bind the values of variables Arithmetic equations and inequalities that does not bind any restriction over ... equations that impose restrictions over variables Arithmetic equations that discard constraints over the given variables
In constraint satisfaction problem, constraints can be stated asArithmetic equations and inequalities that bind the values of variablesArithmetic equations and inequaliti...
1.8k
views
answered
Aug 11, 2016
Optimization
ugcnetcse-dec2015-paper3
optimization
+
–
1
votes
182
UGC NET CSE | December 2015 | Part 3 | Question: 46
Language model used in LISP is Functional programming Logic programming Object oriented programming All of the above
Language model used in LISP isFunctional programmingLogic programmingObject oriented programmingAll of the above
1.8k
views
answered
Aug 11, 2016
Artificial Intelligence
ugcnetcse-dec2015-paper3
artificial-intelligence
+
–
0
votes
183
UGC NET CSE | December 2015 | Part 3 | Question: 45
Reasoning strategies used in expert systems include Forward chaining, backward chaining and problem reduction Forward chaining, backward chaining and boundary mutation Forward chaining, backward chaining and back propagation Forward chaining, problem reduction and boundary mutation
Reasoning strategies used in expert systems includeForward chaining, backward chaining and problem reductionForward chaining, backward chaining and boundary mutationForwa...
2.5k
views
answered
Aug 11, 2016
Artificial Intelligence
ugcnetcse-dec2015-paper3
artificial-intelligence
expert-system
+
–
2
votes
184
UGC NET CSE | December 2015 | Part 3 | Question: 44
In propositional logic, given $P$ and $P \rightarrow Q$, we can infer ________ $\sim Q$ $Q$ $P \wedge Q$ $\sim P \wedge Q$
In propositional logic, given $P$ and $P \rightarrow Q$, we can infer ________$\sim Q$$Q$$P \wedge Q$$\sim P \wedge Q$
3.4k
views
answered
Aug 11, 2016
Mathematical Logic
ugcnetcse-dec2015-paper3
propositional-logic
mathematical-logic
+
–
1
votes
185
UGC NET CSE | December 2015 | Part 3 | Question: 40
In Unix operating system, special files are used to buffer data received in its input from where a process reads provide a mechanism to map physical device to file names store list of file names plus pointers associated with i-nodes store information entered by a user application program or utility program
In Unix operating system, special files are used tobuffer data received in its input from where a process readsprovide a mechanism to map physical device to file namessto...
1.9k
views
answered
Aug 11, 2016
Digital Logic
ugcnetcse-dec2015-paper3
unix
+
–
4
votes
186
UGC NET CSE | December 2015 | Part 3 | Question: 39
Consider a system with twelve magnetic tape drives and three processes $P_1, P_2$ and $P_3$. process $P_1$ requires maximum ten tape drives, process $P_2$ may need as many as four tape drives and $P_3$ may need upto nine ... $t_1$, system is in: safe state unsafe state deadlocked state starvation state
Consider a system with twelve magnetic tape drives and three processes $P_1, P_2$ and $P_3$. process $P_1$ requires maximum ten tape drives, process $P_2$ may need as man...
12.5k
views
answered
Aug 11, 2016
Operating System
ugcnetcse-dec2015-paper3
operating-system
+
–
1
votes
187
UGC NET CSE | December 2015 | Part 3 | Question: 19
The solution of the reccurence relation $T(n) \leq \begin{cases} \theta(1) & \text{ if } n \leq 80 \\ T\bigg(\dfrac{n}{s} \bigg)+T \bigg(\dfrac{7n}{10}+6\bigg)+O(n) & \text{ if } n> 80 \end{cases}$ is $O(\lg n)$ $O(n)$ $O(n \lg n)$ None of the above
The solution of the reccurence relation$T(n) \leq \begin{cases} \theta(1) & \text{ if } n \leq 80 \\ T\bigg(\dfrac{n}{s} \bigg)+T \bigg(\dfrac{7n}{10}+6\bigg)+O(n) & \tex...
1.9k
views
answered
Aug 9, 2016
Algorithms
ugcnetcse-dec2015-paper3
algorithms
recurrence-relation
+
–
2
votes
188
UGC NET CSE | December 2015 | Part 3 | Question: 29
Which of the following is used to make an Abstract class? Making at least one member function as pure virtual function Making at least one member function as virtual function Declaring as Abstract class using virtual keyword Declaring as Abstract class using static keyword
Which of the following is used to make an Abstract class?Making at least one member function as pure virtual functionMaking at least one member function as virtual functi...
3.0k
views
answered
Aug 9, 2016
Object Oriented Programming
ugcnetcse-dec2015-paper3
object-oriented-programming
abstract-class
+
–
0
votes
189
the write cycle time of a memory is 200nsec.the max rate at which data can be stored?
2.9k
views
answered
Aug 9, 2016
0
votes
190
UGC NET CSE | December 2015 | Part 3 | Question: 9
Match the following w.r.t. programming languages $:$ ... $\text{(a)-(ii), (b)-(iv), (c)-(i), (d)-(iii)}$
Match the following w.r.t. programming languages $:$$\begin{array}{clcl} & \textbf{List – I} & & \textbf{List – II} \\ \text{(a)} & \text{JAVA} & \text{(i)} & \text...
2.6k
views
answered
Aug 9, 2016
Programming in C
ugcnetcse-dec2015-paper3
programming
non-gate
+
–
Page:
« prev
1
2
3
4
5
6
7
8
9
10
11
...
17
next »
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register