Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Filter
sh!va
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Answers by sh!va
1
votes
321
UGC NET CSE | September 2013 | Part 2 | Question: 33
What is the size of the following union? Assume that the size of int=2, size of float =4, size of char=1 union tag { int a; float b; char c; }; 2 4 1 7
What is the size of the following union? Assume that the size of int=2, size of float =4, size of char=1union tag { int a; float b; char c; };2417
3.6k
views
answered
Jul 21, 2016
Programming and DS
ugcnetsep2013ii
programming-in-c
+
–
0
votes
322
UGC NET CSE | September 2013 | Part 2 | Question: 29
Working software is not available until late in the process in Waterfall model Prototyping model Incremental model Evolutionary Development model
Working software is not available until late in the process inWaterfall modelPrototyping modelIncremental modelEvolutionary Development model
1.9k
views
answered
Jul 21, 2016
IS&Software Engineering
ugcnetsep2013ii
is&software-engineering
software-development-life-cycle-models
+
–
1
votes
323
UGC NET CSE | September 2013 | Part 2 | Question: 30
Equivalence partitioning is a _____ testing method that divides the input domain of a program into classes of data from which test cases can be derived. White box Black box Regression Smoke
Equivalence partitioning is a _____ testing method that divides the input domain of a program into classes of data from which test cases can be derived.White boxBlack box...
811
views
answered
Jul 21, 2016
IS&Software Engineering
ugcnetsep2013ii
is&software-engineering
software-testing
+
–
2
votes
324
UGC NET CSE | September 2013 | Part 2 | Question: 31
Consider the following characteristics: Correct and unambiguous Complete and consistent Ranked for importance and/or stability and verifiable Modifiable and Traceable Which of the following is true for a good SRS? I, II and III I, III and IV II, III and IV I, II, III and IV
Consider the following characteristics:Correct and unambiguousComplete and consistentRanked for importance and/or stability and verifiableModifiable and TraceableWhich of...
3.5k
views
answered
Jul 21, 2016
IS&Software Engineering
ugcnetsep2013ii
is&software-engineering
software-requirement-specification
+
–
1
votes
325
DFA
1.2k
views
answered
Jul 21, 2016
0
votes
326
DFA
1.2k
views
answered
Jul 21, 2016
–1
votes
327
DFA
1.2k
views
answered
Jul 21, 2016
0
votes
328
do while loop
What is the output of the following program? #include<stdio.h> void main() { int n=3, i=0; do { n=n++; i++; } while(i!=3); printf(“%d\n”, n); }
What is the output of the following program?#include<stdio.h void main() { int n=3, i=0; do { n=n++; i++; } while(i!=3); printf(“%d\n”, n); }
597
views
answered
Jul 21, 2016
Programming in C
programming
+
–
6
votes
329
What is the Hit Rate of cache ?
Consider an array has 100 elements and each element occupies 4 words .A 32 bit word cache is used and divided into a block of 8 words .What is the hit rate of this for(i=0; i<10; i++) for(j=0; j<10; j++); A[i][j] = A[i][j]+10; Column major is used here. How to improve Hit rate ?
Consider an array has 100 elements and each element occupies 4 words .A 32 bit word cache is used and divided into a block of 8 words .What is the hit rate of this for(i=...
2.6k
views
answered
Jul 21, 2016
CO and Architecture
co-and-architecture
cache-memory
hit-ratio
+
–
0
votes
330
compilation error
#include<stdio.h> int main(void) { int p=3,q=4,y,z; (p>q?y=5:z=10); printf(" %d %d ",y,z); return 0; } Compile Info prog.c: In function 'main': prog.c:5:15: error: lvalue required as left operand of assignment (p>q?y=5:z=10); ^ z is already a variable ,then why it is saying lvalue required ??
#include<stdio.h int main(void) { int p=3,q=4,y,z; (p>q?y=5:z=10); printf(" %d %d ",y,z); return 0; }Compile Infoprog.c: In function 'main':prog.c:5:15: error: lvalue req...
421
views
answered
Jul 20, 2016
Programming in C
programming-in-c
interview
operator-precedence
+
–
1
votes
331
What is Hit ratio for Cache ?
Consider an array A[100] and each element occupies 4 word. A 32 word cache is used and divided into 8 word blocks. What is the hit ratio for the following statement. for(i=0;i<100;i++) A[i]=A[i]+10 What mapping is going to be used in the Solution ?
Consider an array A[100] and each element occupies 4 word. A 32 word cache is used and divided into 8 word blocks. What is the hit ratio for the following statement.for(i...
5.2k
views
answered
Jul 20, 2016
CO and Architecture
cache-memory
co-and-architecture
hit-ratio
+
–
2
votes
332
UGC NET CSE | September 2013 | Part 2 | Question: 15
Consider the following two languages: $L_1 =\{a^n b^l a^k \mid n+l+k > 5\}$ $L_2 =\{a^n b^l a^k \mid n> 5, l>3, k \leq l \}$ Which one of the following is true? $L_1$ ... $L_1$ and $L_2$ are regular language Both $L_1$ and $L_2$ are not regular language $L_1$ is not regular language and $L_2$ is regular language
Consider the following two languages:$L_1 =\{a^n b^l a^k \mid n+l+k 5\}$$L_2 =\{a^n b^l a^k \mid n 5, l>3, k \leq l \}$Which one of the following is true?$L_1$ is regula...
1.8k
views
answered
Jul 20, 2016
Theory of Computation
ugcnetsep2013ii
theory-of-computation
regular-expression
regular-language
+
–
5
votes
333
UGC NET CSE | September 2013 | Part 2 | Question: 17
Assume the statements $S_1$ and $S_2$ given as: $S_1$: Given a context free grammar G, there exists an algorithm for determining whether L(G) is infinite. $S_2$: There exists an algorithm to determine whether two context free grammars generate ... $S_2$ are correct Both $S_1$ and $S_2$ are not correct $S_1$ is not correct and $S_2$ is correct
Assume the statements $S_1$ and $S_2$ given as:$S_1$: Given a context free grammar G, there exists an algorithm for determining whether L(G) is infinite.$S_2$: There exis...
3.4k
views
answered
Jul 20, 2016
Theory of Computation
ugcnetsep2013ii
theory-of-computation
grammar
+
–
1
votes
334
UGC NET CSE | September 2013 | Part 2 | Question: 23
Which one of the following set of gates is best suited for ‘parity’ checking and ‘parity’ generation? AND, OR, NOT NAND, NOR EX-OR, EX-NOR None of the above
Which one of the following set of gates is best suited for ‘parity’ checking and ‘parity’ generation?AND, OR, NOTNAND, NOREX-OR, EX-NORNone of the...
5.8k
views
answered
Jul 20, 2016
Digital Logic
ugcnetsep2013ii
digital-logic
digital-circuits
+
–
2
votes
335
UGC NET CSE | September 2013 | Part 2 | Question: 19
Find the number of ways to paint 12 offices so that 3 of them will be green, 2 of them pink, 2 of them yellow and the rest ones white. 55,440 1,66,320 4.790E+08 39,91,680
Find the number of ways to paint 12 offices so that 3 of them will be green, 2 of them pink, 2 of them yellow and the rest ones white.55,4401,66,3204.790E+0839,91,680
4.1k
views
answered
Jul 20, 2016
Others
ugcnetsep2013ii
combinatory
+
–
2
votes
336
EXOR operation in C
#include<stdio.h> int main() { int x,y; x=-5; y=x<<2; printf("%d\n",y); printf("%d",y^x); return 0; } Ans: -20 23 how xor result is 23? please explain
#include<stdio.h int main() { int x,y; x=-5; y=x<<2; printf("%d\n",y); printf("%d",y^x); return 0; }Ans:-2023how xor result is 23? please explain
359
views
answered
Jul 20, 2016
Unknown Category
programming-in-c
+
–
1
votes
337
UGC NET CSE | September 2013 | Part 2 | Question: 12
The efficient data structure to insert/delete a number in a stored set of number is Queue Linked list Doubly linked list Binary tree
The efficient data structure to insert/delete a number in a stored set of number isQueueLinked listDoubly linked listBinary tree
4.5k
views
answered
Jul 20, 2016
DS
ugcnetsep2013ii
data-structures
queue
linked-list
+
–
5
votes
338
UGC NET CSE | September 2013 | Part 2 | Question: 10
Suppose that the splits at every level of Quicksort are in proportion $1-\beta \text{ to } \beta$, where $0 < \beta \leq 0.5$ is a constant. The number of elements in an array is n. The maximum depth is approximately 0.5 $\beta$ Ig n 0.5 (1-$\beta$) Ig n -(Ig n)/(Ig $\beta$) -(Ig n)/Ig (1-$\beta$)
Suppose that the splits at every level of Quicksort are in proportion $1-\beta \text{ to } \beta$, where $0 < \beta \leq 0.5$ is a constant. The number of elements in an ...
7.6k
views
answered
Jul 20, 2016
DS
ugcnetsep2013ii
data-structures
sorting
algorithms
quick-sort
+
–
3
votes
339
UGC NET CSE | September 2013 | Part 2 | Question: 6
The count-to-infinity problem is associated with Flooding algorithm Hierarchical routing algorithm Distance vector routing algorithm Link state routing algorithm
The count-to-infinity problem is associated withFlooding algorithmHierarchical routing algorithmDistance vector routing algorithmLink state routing algorithm
2.1k
views
answered
Jul 20, 2016
Computer Networks
ugcnetsep2013ii
computer-networks
routing-algorithm
+
–
4
votes
340
UGC NET CSE | September 2013 | Part 2 | Question: 8
Consider an undirected graph G with 100 nodes. The maximum number of edges to be included in G so that the graph is not connected is 2451 4950 4851 9900
Consider an undirected graph G with 100 nodes. The maximum number of edges to be included in G so that the graph is not connected is2451495048519900
10.6k
views
answered
Jul 20, 2016
Graph Theory
ugcnetsep2013ii
graph-theory
graph-connectivity
+
–
3
votes
341
UGC NET CSE | September 2013 | Part 2 | Question: 1
A file is downloaded in a home computer using 56 kbps MODEM connected to an Internet Service Provider. If the download of the file completes in 2 minutes, what is the maximum size of the data downloaded? 112 Mbits 6.72 Mbits 67.20 Mbits 672 Mbits
A file is downloaded in a home computer using 56 kbps MODEM connected to an Internet Service Provider. If the download of the file completes in 2 minutes, what is the max...
6.3k
views
answered
Jul 20, 2016
Computer Networks
ugcnetsep2013ii
computer-networks
ethernet
+
–
0
votes
342
Gateforum Correspondence Course ( Page# 149, Q# 5)
If delays are recorded as 8-bit numbers in a 50-router network, and delay vectors are exchanged twice a second, how much bandwidth per (full-duplex) line is chewed up by the distributed routing algorithm? Assume that each router has three lines to other routers 400 bps 800 bps 1200 bps None of these
If delays are recorded as 8-bit numbers in a 50-router network, and delay vectors are exchanged twice a second, how much bandwidth per (full-duplex) line is chewed up by ...
459
views
answered
Jul 19, 2016
Computer Networks
computer-networks
distance-vector-routing
+
–
0
votes
343
UGC NET CSE | June 2013 | Part 3 | Question: 71
The map colouring problem can be solved using which of the following technique? Means-end analysis Constraint satisfaction AO* search Breadth first search
The map colouring problem can be solved using which of the following technique?Means-end analysisConstraint satisfactionAO* searchBreadth first search
3.1k
views
answered
Jul 19, 2016
Artificial Intelligence
ugcnetcse-june2013-paper3
artificial-intelligence
map-coloring
+
–
0
votes
344
UGC NET CSE | June 2013 | Part 3 | Question: 66
The versions of windows operating system like Windows XP and Window Vista uses following file system: FAT-16 FAT-32 NTFS (NT File System) All of the above
The versions of windows operating system like Windows XP and Window Vista uses following file system:FAT-16FAT-32NTFS (NT File System)All of the above
2.0k
views
answered
Jul 19, 2016
Operating System
ugcnetcse-june2013-paper3
operating-system
windows
+
–
1
votes
345
UGC NET CSE | June 2013 | Part 3 | Question: 68
Which one of the following is not an informed search technique? Hill climbing search Best first search A* search Depth first search
Which one of the following is not an informed search technique?Hill climbing searchBest first searchA* searchDepth first search
5.1k
views
answered
Jul 19, 2016
Algorithms
ugcnetcse-june2013-paper3
algorithms
depth-first-search
+
–
4
votes
346
UGC NET CSE | June 2013 | Part 3 | Question: 61
An operating system using banker’s algorithm for deadlock avoidance has ten dedicated devices (of same type) and has three processes P1, P2 and P3 with maximum resource requirements of 4, 5 and 8 respectively. There are two states of ... safe and State 2 is unsafe Both State 1 and State 2 are safe Both State 1 and State 2 are unsafe
An operating system using banker’s algorithm for deadlock avoidance has ten dedicated devices (of same type) and has three processes P1, P2 and P3 with maximum reso...
4.9k
views
answered
Jul 19, 2016
Operating System
ugcnetcse-june2013-paper3
operating-system
bankers-algorithm
deadlock-prevention-avoidance-detection
+
–
1
votes
347
UGC NET CSE | June 2013 | Part 3 | Question: 63
Working set model is used in memory management to implement the concept of Swapping Principal of Locality Segmentation Thrashing
Working set model is used in memory management to implement the concept ofSwappingPrincipal of LocalitySegmentationThrashing
2.9k
views
answered
Jul 19, 2016
Operating System
ugcnetcse-june2013-paper3
operating-system
process
+
–
0
votes
348
Algorithm quicksort
Reply with solution @ Habibkhan,@Gabbar,@Arjun Sir
Reply with solution @ Habibkhan,@Gabbar,@Arjun Sir
2.0k
views
answered
Jul 19, 2016
Algorithms
algorithms
quick-sort
numerical-answers
made-easy-test-series
+
–
Page:
« prev
1
...
6
7
8
9
10
11
12
13
14
15
16
17
next »
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register