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 rishu_darkshadow
0
votes
241
UGC NET CSE | December 2013 | Part 2 | Question: 16
What does the following declaration mean? int (*ptr) [10]; ptr is an array of pointers of 10 integers ptr is a pointer to an array of 10 integers ptr is an array of 10 integers none of the above
What does the following declaration mean? int (*ptr) [10];ptr is an array of pointers of 10 integersptr is a pointer to an array of 10 integersptr is an array of 1...
3.3k
views
answered
Aug 31, 2017
Programming in C
ugcnetcse-dec2013-paper2
programming-in-c
+
–
0
votes
242
UGC NET CSE | December 2013 | Part 3 | Question: 16
Match the following with respect to the programming language $:$ ... $\text{a-ii, b-iv, c-i, d-iii}$ $\text{a-ii, b-iii, c-iv, d-i}$
Match the following with respect to the programming language $:$$\begin{array}{} & \textbf{List – I} && \textbf{List – II} \\ \text{a.} & \text{Structured language} &...
1.1k
views
answered
Aug 30, 2017
Programming in C
ugcnetcse-dec2013-paper3
programming
+
–
0
votes
243
UGC NET CSE | December 2013 | Part 3 | Question: 38
Assuming there are n keys and each key is in the range [0, m-1]. The run time of bucket sort is O(n) O(n lgn) O(n lgm) O(n+m)
Assuming there are n keys and each key is in the range [0, m-1]. The run time of bucket sort isO(n)O(n lgn)O(n lgm)O(n+m)
2.0k
views
answered
Aug 30, 2017
Algorithms
ugcnetcse-dec2013-paper3
algorithms
sorting
+
–
16
votes
244
GATE CSE 2002 | Question: 2.23, UGCNET-June2012-II: 26
A $B^+$ - tree index is to be built on the Name attribute of the relation STUDENT. Assume that all the student names are of length $8$ bytes, disk blocks are of size $512$ bytes, and index pointers are of size $4$ bytes. Given the scenario, what ... of the degree (i.e. number of pointers per node) of the $B^+$ - tree? $16$ $42$ $43$ $44$
A $B^+$ - tree index is to be built on the Name attribute of the relation STUDENT. Assume that all the student names are of length $8$ bytes, disk blocks are of size $512...
14.2k
views
answered
Aug 30, 2017
Databases
gatecse-2002
databases
b-tree
normal
ugcnetcse-june2012-paper2
+
–
0
votes
245
UGC NET CSE | June 2012 | Part 2 | Question: 14
Which of the following TCP/IP Internet protocol does diskless machine uses to obtain its IP address from a server? RAP RIP ARP X.25
Which of the following TCP/IP Internet protocol does diskless machine uses to obtain its IP address from a server?RAPRIPARPX.25
5.4k
views
answered
Aug 30, 2017
Computer Networks
ugcnetcse-june2012-paper2
computer-networks
+
–
0
votes
246
UGC NET CSE | June 2012 | Part 3 | Question: 67
Let a*H and b*H be two cosets of H. Either a*H and b*H are disjoint a*H and b*H are identical Then, Only I is true Only II is true I or II is true I and II is false
Let a*H and b*H be two cosets of H.Either a*H and b*H are disjointa*H and b*H are identicalThen,Only I is trueOnly II is trueI or II is trueI and II is false
1.9k
views
answered
Aug 29, 2017
Discrete Mathematics
ugcnetcse-june2012-paper3
discrete-mathematics
set-theory&algebra
group-theory
+
–
0
votes
247
UGC NET CSE | June 2012 | Part 3 | Question: 31
The upper bound of computing time of m colouring decision problem is $O(nm)$ $O(n^m)$ $O(nm^n)$ $O(n^mm^n)$
The upper bound of computing time of m colouring decision problem is$O(nm)$$O(n^m)$$O(nm^n)$$O(n^mm^n)$
3.1k
views
answered
Aug 29, 2017
Programming in C
ugcnetcse-june2012-paper3
graph-theory
graph-coloring
+
–
0
votes
248
UGC NET CSE | June 2012 | Part 3 | Question: 31
The upper bound of computing time of m colouring decision problem is $O(nm)$ $O(n^m)$ $O(nm^n)$ $O(n^mm^n)$
The upper bound of computing time of m colouring decision problem is$O(nm)$$O(n^m)$$O(nm^n)$$O(n^mm^n)$
3.1k
views
answered
Aug 29, 2017
Programming in C
ugcnetcse-june2012-paper3
graph-theory
graph-coloring
+
–
0
votes
249
UGC NET CSE | June 2012 | Part 3 | Question: 33
Which one of the following statements is incorrect? The number of regions corresponds to the cyclomatic complexity Cyclomatic complexity for a flow graph $G$ is $V(G)=N-E+2$, where E is the number of edges and N is the number of nodes in flow ... flow graph $G$ is $V(G)=P+1$, where P is the number of predicate nodes contained in the flow graph G.
Which one of the following statements is incorrect?The number of regions corresponds to the cyclomatic complexityCyclomatic complexity for a flow graph $G$ is $V(G)=N-E+2...
10.5k
views
answered
Aug 29, 2017
IS&Software Engineering
ugcnetcse-june2012-paper3
is&software-engineering
software-metrics
+
–
1
votes
250
UGC NET CSE | December 2014 | Part 2 | Question: 06
The $\text{BCD}$ adder to add two decimal digits needs minimum of $6$ full adders and $2$ half adders $5$ full adders and $3$ half adders $4$ full adders and $3$ half adders $5$ full adders and $2$ half adders
The $\text{BCD}$ adder to add two decimal digits needs minimum of$6$ full adders and $2$ half adders$5$ full adders and $3$ half adders$4$ full adders and $3$ half adders...
4.0k
views
answered
Aug 29, 2017
Digital Logic
ugcnetcse-dec2014-paper2
digital-logic
adder
+
–
2
votes
251
UGC NET CSE | December 2014 | Part 2 | Question: 07
The Excess-$3$ decimal code is a self-complementing code because The binary sum of a code and its $9's$ complement is equal to $9$. It is a weighted code. Complement can be generated by inverting each bit pattern. The binary sum of a code and its $10's$ complement is equal to $9$.
The Excess-$3$ decimal code is a self-complementing code because The binary sum of a code and its $9's$ complement is equal to $9$. It is a weighted code. Complement can ...
3.8k
views
answered
Aug 29, 2017
Digital Logic
ugcnetcse-dec2014-paper2
digital-logic
excess-3
+
–
1
votes
252
UGC NET CSE | December 2014 | Part 2 | Question: 28
Which of the following algorithms is not a broadcast routing algorithm ? Flooding Multidestination routing Reverse path forwarding All of the above
Which of the following algorithms is not a broadcast routing algorithm ?Flooding Multidestination routing Reverse path forwardingAll of the above
6.0k
views
answered
Aug 28, 2017
Computer Networks
ugcnetcse-dec2014-paper2
computer-networks
routing-algorithm
+
–
0
votes
253
UGC NET CSE | December 2014 | Part 2 | Question: 31
Shift-Reduce parsers perform the following : Shift step that advances in the input stream by $K(K > 1)$ symbols and Reduce step that applies a completed grammar rule to some recent parse trees, joining them together as one tree ... does not advance in the input stream and Reduce step that applies a completed grammar rule to form a single tree.
Shift-Reduce parsers perform the following : Shift step that advances in the input stream by $K(K 1)$ symbols and Reduce step that applies a completed grammar rule to so...
2.0k
views
answered
Aug 28, 2017
Compiler Design
ugcnetcse-dec2014-paper2
compiler-design
shift-reduce-parser
+
–
0
votes
254
UGC NET CSE | December 2014 | Part 3 | Question: 22
The pushdown automation $M=(\left\{q_{0}, q_{1}, q_{2}\right\}, \left\{a, b\right\}, \left\{0, 1\right\}, \delta, q_{0}, 0, \left\{q_{0}\right\})$ with $\delta (q_{0}, a, 0)= \left\{(q_{1}, 10)\right\}$ ... $L=\left\{a^{n}b^{m} | n, m > 0\right\}$ $L=\left\{a^{n}b^{n} | n > 0\right\}$
The pushdown automation $M=(\left\{q_{0}, q_{1}, q_{2}\right\}, \left\{a, b\right\}, \left\{0, 1\right\}, \delta, q_{0}, 0, \left\{q_{0}\right\})$ with$\delta (q_{0}, a, ...
2.4k
views
answered
Aug 28, 2017
Theory of Computation
ugcnetcse-dec2014-paper3
theory-of-computation
pushdown-automata
+
–
0
votes
255
UGC NET CSE | December 2014 | Part 3 | Question: 49
Various storage devices used by an operating system can be arranged as follows in increasing order of accessing speed : Magnetic tapes $\rightarrow$ magnetic disks $\rightarrow$ optical disks $\rightarrow$ ... disks $\rightarrow $ electronic disks $\rightarrow $ main memory $\rightarrow $ cache $\rightarrow $ registers
Various storage devices used by an operating system can be arranged as follows in increasing order of accessing speed : Magnetic tapes $\rightarrow$ magnetic disks $\righ...
9.2k
views
answered
Aug 28, 2017
Operating System
ugcnetcse-dec2014-paper3
storage-devices
accessing-speed
+
–
1
votes
256
UGC NET CSE | December 2014 | Part 3 | Question: 74
A Trojan horse is A program that performs a legitimate function that is known to an operating system or its user and also has a hidden component that can be used for nefarious purposes like attacks on message security ... computer systems by exploiting security holes like weaknesses in facilities for creation of remote processes All of the above
A Trojan horse isA program that performs a legitimate function that is known to an operating system or its user and also has a hidden component that can be used for nefar...
2.2k
views
answered
Aug 28, 2017
Web Technologies
ugcnetcse-dec2014-paper3
trojan-horse
+
–
1
votes
257
UGC NET CSE | December 2014 | Part 3 | Question: 50
How many disk blocks are required to keep list of free disk blocks in a $16$ GB hard disk with $1$ kB block size using linked list of free disk blocks ? Assume that the disk block number is stored in $32$ bits. $1024$ blocks $16794$ blocks $20000$ blocks $1048576$ blocks
How many disk blocks are required to keep list of free disk blocks in a $16$ GB hard disk with $1$ kB block size using linked list of free disk blocks ? Assume that the d...
6.0k
views
answered
Aug 28, 2017
Operating System
ugcnetcse-dec2014-paper3
operating-system
file-system
+
–
0
votes
258
UGC NET CSE | August 2016 | Part 3 | Question: 3
The register that stores the bits required to mask the interrupts is ______. Status register Interrupt service register Interrupt mask register Interrupt request register
The register that stores the bits required to mask the interrupts is ______.Status registerInterrupt service registerInterrupt mask registerInterrupt request register
945
views
answered
Aug 27, 2017
CO and Architecture
ugcnetcse-aug2016-paper3
co-and-architecture
register
interrupts
+
–
1
votes
259
UGC NET CSE | August 2016 | Part 3 | Question: 7
Which of the following statements is/are True regarding some advantages that an objectoriented DBMS (OODBMS) offers over a relational database ? I. An OODBMS avoids the impedance mismatch problem. II. An OODBMS avoids the phantom problem. III. An OODBMS provides higher ... $I$ and $IV$ only $I, II,$ and $III$ only $I, III$ and $IV$ only
Which of the following statements is/are True regarding some advantages that an objectoriented DBMS (OODBMS) offers over a relational database ?I. An OODBMS avoids the �...
1.6k
views
answered
Aug 27, 2017
Others
ugcnetcse-aug2016-paper3
databases
+
–
0
votes
260
UGC NET CSE | August 2016 | Part 3 | Question: 32
Consider a hash table of size $m = 10000$, and the hash function $h(K) = floor (m(KA \bmod 1))$ for $A = ( \sqrt{5} – 1)/2$. The key $123456$ is mapped to location ______. $46$ $41$ $43$ $48$
Consider a hash table of size $m = 10000$, and the hash function $h(K) = floor (m(KA \bmod 1))$ for $A = ( \sqrt{5} – 1)/2$. The key $123456$ is mapped to location ____...
860
views
answered
Aug 27, 2017
DS
ugcnetcse-aug2016-paper3
data-structures
hashing
+
–
0
votes
261
UGC NET CSE | August 2016 | Part 3 | Question: 35
If there are $n$ integers to sort, each integer has d digits, and each digit is in the set $\left\{1, 2, …, k\right\}$, radix sort can sort the numbers in : $O (k (n + d))$ $O (d (n + k))$ $O ((n + k) l g d)$ $O ((n + d) l g k)$
If there are $n$ integers to sort, each integer has d digits, and each digit is in the set $\left\{1, 2, …, k\right\}$, radix sort can sort the numbers in :$O (k (n + d...
724
views
answered
Aug 27, 2017
DS
ugcnetcse-aug2016-paper3
data-structures
radix-sort
+
–
0
votes
262
UGC NET CSE | August 2016 | Part 3 | Question: 38
Method over-riding can be prevented by using final as a modifier at ______. The start of the class. The start of method declaration. The start of derived class. The start of the method declaration in the derived class.
Method over-riding can be prevented by using final as a modifier at ______.The start of the class.The start of method declaration.The start of derived class.The start of ...
2.5k
views
answered
Aug 27, 2017
Java
ugcnetcse-aug2016-paper3
java
method-overriding
+
–
Page:
« prev
1
...
4
5
6
7
8
9
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register