Register
Filter

Most viewed questions in Others

0 votes
1 answer
1141
UGC NET CSE | June 2007 | Part 2 | Question: 19
A Relation $R=${$A,B,C,D,E,F$} is given with following set of functional dependencies: $F=${$A\rightarrow B, AD\rightarrow C,B\rightarrow F,A\rightarrow E$}. Which of the following is Candidate Key? $A$ $AC$ $AD$ None of these
A Relation $R=${$A,B,C,D,E,F$} is given with following set of functional dependencies:$F=${$A\rightarrow B, AD\rightarrow C,B\rightarrow F,A\rightarrow E$}. Which of the ...
User Avatar
0 votes
1 answer
1142
UGC NET CSE | June 2007 | Part 2 | Question: 36
Part of a program where the shared memory is accessed and which should be executed indivisibly, is called: Semaphores Directory Critical section Mutual exclusion
Part of a program where the shared memory is accessed and which should be executed indivisibly, is called:SemaphoresDirectoryCritical sectionMutual exclusion
User Avatar
0 votes
0 answers
1143
UGC NET CSE | June 2006 | Part 2 | Question: 41
In software project planning, work Breakdown structure must be______. A graph A tree A Eular’s graph None of the above
In software project planning, work Breakdown structure must be______.A graphA treeA Eular’s graphNone of the above
User Avatar
1 votes
0 answers
1144
general query about the assumption of values of given K or M like for 30KB or 30KB what to take k= 1^3 or 1024
in COA whenever I m doing any some in mock tests... where its given data like 30KB or 60MB which value to be considered? for K and M here??I mean when the answer is in ms...
User Avatar
0 votes
1 answer
1146
UGC NET CSE | June 2007 | Part 2 | Question: 27
Which of the following techniques are used to control data flow? Windowing Routing $\text{RPCs}$ Buffering $1,4$ $2,3,4$ $1,3,4$ $1,2,3,4$
Which of the following techniques are used to control data flow?WindowingRouting$\text{RPCs}$Buffering $1,4$$2,3,4$$1,3,4$$1,2,3,4$
User Avatar
0 votes
0 answers
1147
cloud computing
In distributed computing, each processor has its own local memory.
In distributed computing, each processor has its own local memory.
User Avatar
0 votes
1 answer
1149
NIELIT 2021 Dec Scientist B - Section B: 38
The maximum number of binary trees that can be formed with three unlabeled nodes is : $1$ $5$ $4$ $3$
The maximum number of binary trees that can be formed with three unlabeled nodes is :$1$$5$$4$$3$
User Avatar
0 votes
1 answer
1151
NIELIT 2021 Dec Scientist A - Section B: 59
Let $\text{C} (n, \; r) = \binom{n}{r}.$ The value of $ \displaystyle \sum_{k=0}^{20}(2k+1) \text{C} (41, 2k+1),$ is : $40 (2)^{40}$ $40 (2)^{39}$ $41 (2)^{40}$ $41 (2)^{39}$
Let $\text{C} (n, \; r) = \binom{n}{r}.$ The value of $ \displaystyle \sum_{k=0}^{20}(2k+1) \text{C} (41, 2k+1),$ is :$40 (2)^{40}$$40 (2)^{39}$$41 (2)^{40}$$41 (2)^{39}$...
User Avatar
0 votes
2 answers
1153
UGC NET CSE | December 2005 | Part 2 | Question: 14
Function over loading done at : Runtime Compile time Linking time Switching from function to function
Function over loading done at :RuntimeCompile timeLinking timeSwitching from function to function
User Avatar
0 votes
0 answers
1157
gate score
Hi, Someone please explain which parameter is the criteria for getting calls for an interview either for M. Tech or Psu Jobs(Normalized marks/Rank/Score)
Hi, Someone please explain which parameter is the criteria for getting calls for an interview either for M. Tech or Psu Jobs(Normalized marks/Rank/Score)
User Avatar
0 votes
0 answers
1159
nptel
Match the following: List – I 1. Data link layer 2. Network layer 3. Transport layer 4. Presentation layer List – II i. Encryption ii. Connection control iii. Routing iv. Framing
Match the following: List – I 1. Data link layer 2. Network layer 3. Transport layer 4. Presentation layer List – II i. Encryption ii. Connection control iii. Routing...
User Avatar
Page: