Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Recent questions tagged ugcnetcse-dec2008-paper2
1
votes
1
answer
1
UGC NET CSE | December 2008 | Part 2 | Question: 50
(I) Each object in the active directory of windows 2000 has an access control list. (II) The scheme is a blueprint of all objects in the domain of windows 2000. Which of the following is true? only (I) only (II) both (I) and (II) None of the above
(I) Each object in the active directory of windows 2000 has an access control list.(II) The scheme is a blueprint of all objects in the domain of windows 2000.Which of th...
rishu_darkshadow
670
views
rishu_darkshadow
asked
Sep 26, 2017
Others
ugcnetcse-dec2008-paper2
windows
+
–
0
votes
0
answers
2
UGC NET CSE | December 2008 | Part 2 | Question: 49
An example of a data mining algorithm which uses squared error score function is : CART algorithm back propagation algorithm a priori algorithm vector space algorithm
An example of a data mining algorithm which uses squared error score function is :CART algorithm back propagation algorithm a priori algorithm ...
rishu_darkshadow
619
views
rishu_darkshadow
asked
Sep 26, 2017
Computer Networks
ugcnetcse-dec2008-paper2
neural-network
data-mining-algorithm
+
–
0
votes
0
answers
3
UGC NET CSE | December 2008 | Part 2 | Question: 48
E-commerce involves : Electronic Data Interchange Electronic mail Electronic Bulletin Boards All of the above
E-commerce involves :Electronic Data Interchange Electronic mail Electronic Bulletin Boards All of the above
rishu_darkshadow
554
views
rishu_darkshadow
asked
Sep 26, 2017
Computer Networks
ugcnetcse-dec2008-paper2
e-commerce
e-technologies
edi-layer
+
–
0
votes
0
answers
4
UGC NET CSE | December 2008 | Part 2 | Question: 47
Assertion (A): Cellular telephone systems can handle a multitude of users . Reasoning (R): Cellular telephone systems permit extensive frequency reuse in a small local area . Both (A) and (R) are true and (R) is the correct explanation for (A) (B) ... (R) is not the correct explanation (A) is true but (R) is false (A) is false but (R) is true
Assertion (A): Cellular telephone systems can handle a multitude of users .Reasoning (R): Cellular telephone systems permit extensive frequency reuse in a small local are...
rishu_darkshadow
360
views
rishu_darkshadow
asked
Sep 26, 2017
Computer Networks
ugcnetcse-dec2008-paper2
computer-networks
wireless-networks
+
–
0
votes
1
answer
5
UGC NET CSE | December 2008 | Part 2 | Question: 45
$COCOMO$ model is used for: product quality estimation product complexity estimation product cost estimation all of the above
$COCOMO$ model is used for:product quality estimation product complexity estimation product cost estimation all of the above
rishu_darkshadow
1.3k
views
rishu_darkshadow
asked
Sep 26, 2017
IS&Software Engineering
ugcnetcse-dec2008-paper2
is&software-engineering
cocomo-model
+
–
0
votes
1
answer
6
UGC NET CSE | December 2008 | Part 2 | Question: 44
Which level is called as “defined” in capability maturity model? level $0$ level $3$ level $4$ level $1$
Which level is called as “defined” in capability maturity model?level $0$ level $3$level $4$ level $1$
rishu_darkshadow
1.9k
views
rishu_darkshadow
asked
Sep 26, 2017
IS&Software Engineering
ugcnetcse-dec2008-paper2
is&software-engineering
software-development-life-cycle-models
+
–
1
votes
1
answer
7
UGC NET CSE | December 2008 | Part 2 | Question: 43
Software Quality Assurance ($SQA$) encompasses : verification validation both verification and validation none of the above
Software Quality Assurance ($SQA$) encompasses :verification validation both verification and validation none of the above
rishu_darkshadow
1.5k
views
rishu_darkshadow
asked
Sep 26, 2017
IS&Software Engineering
ugcnetcse-dec2008-paper2
is&software-engineering
software-testing
+
–
0
votes
1
answer
8
UGC NET CSE | December 2008 | Part 2 | Question: 42
If the executing program size is greater than the existing $RAM$ of a computer, it is still possible to execute the program if the $OS$ supports : multitasking virtual memory paging system none of the above
If the executing program size is greater than the existing $RAM$ of a computer, it is still possible to execute the program if the $OS$ supports :multitasking ...
rishu_darkshadow
2.2k
views
rishu_darkshadow
asked
Sep 26, 2017
Operating System
ugcnetcse-dec2008-paper2
operating-system
virtual-memory
+
–
0
votes
1
answer
9
UGC NET CSE | December 2008 | Part 2 | Question: 41
In which of the following, ready to execute processes must be present in $RAM$ ? multiprocessing multiprogramming multitasking all of the above
In which of the following, ready to execute processes must be present in $RAM$ ?multiprocessing multiprogramming multitasking all of the above
rishu_darkshadow
1.2k
views
rishu_darkshadow
asked
Sep 26, 2017
Operating System
ugcnetcse-dec2008-paper2
operating-system
ram
+
–
1
votes
1
answer
10
UGC NET CSE | December 2008 | Part 2 | Question: 40
Which of the following $OS$ treats hardware as a file system? $UNIX$ $DOS$ $Windows$ $NT$ None of the above
Which of the following $OS$ treats hardware as a file system?$UNIX$ $DOS$ $Windows$ $NT$ None of the above
rishu_darkshadow
2.0k
views
rishu_darkshadow
asked
Sep 26, 2017
Operating System
ugcnetcse-dec2008-paper2
operating-system
memory-management
+
–
0
votes
1
answer
11
UGC NET CSE | December 2008 | Part 2 | Question: 39
Which of the following are Assembler Directives? (i) EQU (ii) ORIGIN (iii) START (iv) END (ii), (iii) and (iv) (i), (iii) and (iv) (iii) and (iv) (i), (ii), (iii) and (iv)
Which of the following are Assembler Directives?(i) EQU (ii) ORIGIN (iii) START (iv) END(ii), (iii) and (iv) (i), (iii) and (iv) (iii) and (iv) ...
rishu_darkshadow
7.7k
views
rishu_darkshadow
asked
Sep 26, 2017
CO and Architecture
ugcnetcse-dec2008-paper2
co-and-architecture
+
–
1
votes
2
answers
12
UGC NET CSE | December 2008 | Part 2 | Question: 38
In which addressing mode, the effective address of the operand is generated by adding a constant value to the contents of register ? absolute mode immediate mode indirect mode index mode
In which addressing mode, the effective address of the operand is generated by adding a constant value to the contents of register ?absolute mode immediate mode ...
rishu_darkshadow
683
views
rishu_darkshadow
asked
Sep 26, 2017
CO and Architecture
ugcnetcse-dec2008-paper2
co-and-architecture
addressing-modes
+
–
0
votes
1
answer
13
UGC NET CSE | December 2008 | Part 2 | Question: 37
An assembly program contains : imperative and declarative statements imperative and assembler directives imperative and declarative statements as well as assembler directives declarative statements and assembler directives
An assembly program contains :imperative and declarative statements imperative and assembler directives imperative and declarative statements as...
rishu_darkshadow
7.0k
views
rishu_darkshadow
asked
Sep 26, 2017
CO and Architecture
ugcnetcse-dec2008-paper2
co-and-architecture
assembly
+
–
0
votes
2
answers
14
UGC NET CSE | December 2008 | Part 2 | Question: 36
A conventional $LAN$ bridge specifies only the functions of $OSI$ : layers 1 and 2 layers 1 through 3 all layers none of the above
A conventional $LAN$ bridge specifies only the functions of $OSI$ :layers 1 and 2 layers 1 through 3 all layers none of the above
rishu_darkshadow
1.1k
views
rishu_darkshadow
asked
Sep 26, 2017
Computer Networks
ugcnetcse-dec2008-paper2
computer-networks
osi-model
bridges
+
–
0
votes
1
answer
15
UGC NET CSE | December 2008 | Part 2 | Question: 35
A high performance switching and multiplexing technology that utilizes fixed length packets to carry different types of traffic is: ATM ADSL SONET None of the above
A high performance switching and multiplexing technology that utilizes fixed length packets to carry different types of traffic is:ATM ADSLSONETNone of the above
rishu_darkshadow
939
views
rishu_darkshadow
asked
Sep 26, 2017
Computer Networks
ugcnetcse-dec2008-paper2
computer-networks
multiplexing
network-switching
+
–
1
votes
3
answers
16
UGC NET CSE | December 2008 | Part 2 | Question: 34
If $(rear==maxsize-1)$ $rear=0;$ else $rear=rear+1;$ is required in : circular queue linear queue stack deque
If $(rear==maxsize-1)$ $rear=0;$ else $rear=rear+1;$ is required in :circular queue linear queue stack deque
rishu_darkshadow
2.9k
views
rishu_darkshadow
asked
Sep 26, 2017
Databases
ugcnetcse-dec2008-paper2
data-structures
circular-queue
+
–
0
votes
2
answers
17
UGC NET CSE | December 2008 | Part 2 | Question: 33
In a heap, every element is ___________ of all the elements in the subtree. maximum minimum sum product
In a heap, every element is ___________ of all the elements in the subtree.maximum minimum sum product
rishu_darkshadow
1.2k
views
rishu_darkshadow
asked
Sep 26, 2017
DS
ugcnetcse-dec2008-paper2
data-structures
binary-heap
+
–
4
votes
2
answers
18
UGC NET CSE | December 2008 | Part 2 | Question: 32
Suppose R is a relation schema and F is a set of functional dependencies on R. Further, suppose R1 and R2 form a decomposition of R. Then the decomposition is a lossless join decomposition of R provided that: R1∩R2→R1 is in F+ ... in F+ both R1∩R2→R1 and R1∩R2→R2 functional dependencies are in F+ at least one from R1∩R2→R1 and R1∩R2→R2 is in F+
Suppose R is a relation schema and F is a set of functional dependencies on R. Further, suppose R1 and R2 form a decomposition of R. Then the decomposition is a lossless ...
rishu_darkshadow
1.7k
views
rishu_darkshadow
asked
Sep 26, 2017
Databases
ugcnetcse-dec2008-paper2
databases
database-normalization
+
–
1
votes
2
answers
19
UGC NET CSE | December 2008 | Part 2 | Question: 31
Aggregation is : an abstraction through which relationships are treated as lower level entities an abstraction through which relationships are treated as higher level entities an abstraction through which relationships are not treated at all as entities none of the above
Aggregation is :an abstraction through which relationships are treated as lower level entitiesan abstraction through which relationships are treated as higher level entit...
rishu_darkshadow
2.3k
views
rishu_darkshadow
asked
Sep 26, 2017
Databases
ugcnetcse-dec2008-paper2
databases
aggregation
+
–
2
votes
4
answers
20
UGC NET CSE | December 2008 | Part 2 | Question: 30
An entity has: (i) a set of properties (ii) a set of properties and values for all the properties (iii) a set of properties and the values for some set of properties may non-uniquely identify an entity (iv) a set of properties and ... properties may uniquely identify an entity Which of the above are valid? (i) only (ii) only (iii) only (iv) only
An entity has:(i) a set of properties(ii) a set of properties and values for all the properties(iii) a set of properties and the values for some set of properties may non...
rishu_darkshadow
2.6k
views
rishu_darkshadow
asked
Sep 26, 2017
Databases
ugcnetcse-dec2008-paper2
databases
er-diagram
+
–
0
votes
1
answer
21
UGC NET CSE | December 2008 | Part 2 | Question: 29
How many constructors can a class have ? zero 1 2 any number
How many constructors can a class have ?zero 1 2 any number
rishu_darkshadow
814
views
rishu_darkshadow
asked
Sep 25, 2017
Object Oriented Programming
ugcnetcse-dec2008-paper2
object-oriented-programming
constructor
+
–
0
votes
0
answers
22
UGC NET CSE | December 2008 | Part 2 | Question: 28
When a language has the capability to produce new data types, it is said to be : extensible encapsulated overloaded none of the above
When a language has the capability to produce new data types, it is said to be :extensible encapsulated overloaded none of the above...
rishu_darkshadow
1.1k
views
rishu_darkshadow
asked
Sep 25, 2017
Object Oriented Programming
ugcnetcse-dec2008-paper2
object-oriented-programming
+
–
0
votes
1
answer
23
UGC NET CSE | December 2008 | Part 2 | Question: 27
A copy constructor is invoked when : a function returns by value an argument is passed by value a function returns by reference none of the above
A copy constructor is invoked when :a function returns by value an argument is passed by valuea function returns by reference none of the above
rishu_darkshadow
4.4k
views
rishu_darkshadow
asked
Sep 25, 2017
Object Oriented Programming
ugcnetcse-dec2008-paper2
object-oriented-programming
constructor
+
–
1
votes
2
answers
24
UGC NET CSE | December 2008 | Part 2 | Question: 26
The output of the program code main() { int x=0; while (x<=10) for(;;) if(++x%10==0) break; printf(“x=%d”,x); } is : x=1 compilation error x=20 none of the above
The output of the program codemain() { int x=0; while (x<=10) for(;;) if(++x%10==0) break; printf(“x=%d”,x); }is :x=1 compilation errorx=20 ...
rishu_darkshadow
1.3k
views
rishu_darkshadow
asked
Sep 25, 2017
Programming in C
ugcnetcse-dec2008-paper2
programming-in-c
io-statement
+
–
0
votes
2
answers
25
UGC NET CSE | December 2008 | Part 2 | Question: 25
Which one of the following describes correctly a static variable? It cannot be initialized It is initialized once at the commencement of execution and cannot be changed at run time It retains its value during the life of the program None of the above
Which one of the following describes correctly a static variable?It cannot be initializedIt is initialized once at the commencement of execution and cannot be changed at ...
rishu_darkshadow
4.8k
views
rishu_darkshadow
asked
Sep 25, 2017
Programming in C
ugcnetcse-dec2008-paper2
programming-in-c
variable-scope
+
–
0
votes
1
answer
26
UGC NET CSE | December 2008 | Part 2 | Question: 24
An example of distributed OS is: Amoeba UNIX MS-DOS MULTICS
An example of distributed OS is: Amoeba UNIXMS-DOS MULTICS
rishu_darkshadow
2.0k
views
rishu_darkshadow
asked
Sep 25, 2017
Operating System
ugcnetcse-dec2008-paper2
operating-system
distributed-system
+
–
1
votes
0
answers
27
UGC NET CSE | December 2008 | Part 2 | Question: 23
An example of a non pre-emptive scheduling algorithm is : Round Robin Priority Scheduling Shortest job first 2 level scheduling
An example of a non pre-emptive scheduling algorithm is :Round Robin Priority SchedulingShortest job first 2 level scheduling
rishu_darkshadow
1.7k
views
rishu_darkshadow
asked
Sep 25, 2017
Operating System
ugcnetcse-dec2008-paper2
operating-system
scheduling
+
–
1
votes
2
answers
28
UGC NET CSE | December 2008 | Part 2 | Question: 22
If holes are half as large as processes, the fraction of memory wasted in holes is : $2/3$ $1/2$ $1/3$ $1/5$
If holes are half as large as processes, the fraction of memory wasted in holes is :$2/3$ $1/2$ $1/3$ $1/5$
rishu_darkshadow
709
views
rishu_darkshadow
asked
Sep 25, 2017
Operating System
ugcnetcse-dec2008-paper2
operating-system
process-model
+
–
0
votes
2
answers
29
UGC NET CSE | December 2008 | Part 2 | Question: 21
N processes are waiting for $I/O$. A process spends a fraction $p$ of its time in $I/O$ wait state. The $CPU$ utilization is given by : 1-p-N 1-pN pN p-N
N processes are waiting for $I/O$. A process spends a fraction $p$ of its time in $I/O$ wait state. The $CPU$ utilization is given by :1-p-N 1-pN p...
rishu_darkshadow
1.8k
views
rishu_darkshadow
asked
Sep 25, 2017
Operating System
ugcnetcse-dec2008-paper2
operating-system
process-model
+
–
0
votes
2
answers
30
UGC NET CSE | December 2008 | Part 2 | Question: 20
IP address in B class is given by: 125.123.123.2 191.023.21.54 192.128.32.56 10.14.12.34
IP address in B class is given by:125.123.123.2191.023.21.54192.128.32.56 10.14.12.34
rishu_darkshadow
1.3k
views
rishu_darkshadow
asked
Sep 25, 2017
Computer Networks
ugcnetcse-dec2008-paper2
computer-networks
ip-addressing
+
–
Page:
1
2
next »
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register