Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Recent questions tagged ugcnetcse-dec2005-paper2
0
votes
1
answer
1
UGC NET CSE | December 2005 | Part 2 | Question: 31
The Register or main memory location which contains the effective address of the operand is known as: Pointer Indexed register Special Locations Scratch Pad
The Register or main memory location which contains the effective address of the operand is known as:PointerIndexed registerSpecial LocationsScratch Pad
go_editor
405
views
go_editor
asked
Mar 27, 2020
Others
ugcnetcse-dec2005-paper2
+
–
0
votes
1
answer
2
UGC NET CSE | December 2005 | Part 2 | Question: 32
A Top - down Parse generates Left most derivation Right – most derivation Right most derivation in reverse Left – most derivation in reverse
A Top - down Parse generatesLeft most derivationRight – most derivationRight most derivation in reverseLeft – most derivation in reverse
go_editor
400
views
go_editor
asked
Mar 27, 2020
Compiler Design
ugcnetcse-dec2005-paper2
compiler-design
parsing
+
–
0
votes
1
answer
3
UGC NET CSE | December 2005 | Part 2 | Question: 33
A general macroprocessor is an in built function of : Loader Linker Editor Assembler
A general macroprocessor is an in built function of :LoaderLinkerEditorAssembler
go_editor
2.2k
views
go_editor
asked
Mar 27, 2020
Others
ugcnetcse-dec2005-paper2
+
–
0
votes
1
answer
4
UGC NET CSE | December 2005 | Part 2 | Question: 34
Which of the following is not collision Resolution Technique : Hash addressing Chainning Indexing None of these
Which of the following is not collision Resolution Technique :Hash addressingChainningIndexingNone of these
go_editor
442
views
go_editor
asked
Mar 27, 2020
DS
ugcnetcse-dec2005-paper2
data-structures
hashing
+
–
0
votes
1
answer
5
UGC NET CSE | December 2005 | Part 2 | Question: 35
Which activities is not included in the first pass of two pass assembler? build the symbol table construct the Intermediate code separate memonic opcode and operand field. none of these
Which activities is not included in the first pass of two pass assembler?build the symbol tableconstruct the Intermediate codeseparate memonic opcode and operand field.no...
go_editor
494
views
go_editor
asked
Mar 27, 2020
Compiler Design
ugcnetcse-dec2005-paper2
compiler-design
assembler
+
–
0
votes
1
answer
6
UGC NET CSE | December 2005 | Part 2 | Question: 36
Producer consumer problem can be solved using : semaphores event counters monitors all the above
Producer consumer problem can be solved using :semaphoresevent countersmonitorsall the above
go_editor
2.7k
views
go_editor
asked
Mar 27, 2020
Others
ugcnetcse-dec2005-paper2
+
–
0
votes
1
answer
7
UGC NET CSE | December 2005 | Part 2 | Question: 37
If you want to execute more than one program at a time, the systems software that are used must be capable of : word processing virtual memory compiling multitasking
If you want to execute more than one program at a time, the systems software that are used must be capable of :word processingvirtual memorycompilingmultitasking
go_editor
426
views
go_editor
asked
Mar 27, 2020
Others
ugcnetcse-dec2005-paper2
+
–
0
votes
2
answers
8
UGC NET CSE | December 2005 | Part 2 | Question: 38
Which of the following checks cannot be carried out on the input data to a system? Consistency check Syntax check Range check All the above
Which of the following checks cannot be carried out on the input data to a system?Consistency checkSyntax checkRange checkAll the above
go_editor
415
views
go_editor
asked
Mar 27, 2020
Others
ugcnetcse-dec2005-paper2
+
–
0
votes
1
answer
9
UGC NET CSE | December 2005 | Part 2 | Question: 39
Nonmodifiable procedures are called : Serially usable procedure Concurrent procedure Reentrant procedure Topdown procedure
Nonmodifiable procedures are called :Serially usable procedureConcurrent procedureReentrant procedureTopdown procedure
go_editor
501
views
go_editor
asked
Mar 27, 2020
Others
ugcnetcse-dec2005-paper2
+
–
1
votes
2
answers
10
UGC NET CSE | December 2005 | Part 2 | Question: 40
Banker's algorithm is used for __________ purpose : Deadlock avoidance Deadlock removal Deadlock prevention Deadlock continuations
Banker's algorithm is used for __________ purpose :Deadlock avoidanceDeadlock removalDeadlock preventionDeadlock continuations
go_editor
872
views
go_editor
asked
Mar 27, 2020
Operating System
ugcnetcse-dec2005-paper2
deadlock-prevention-avoidance-detection
bankers-algorithm
+
–
0
votes
2
answers
11
UGC NET CSE | December 2005 | Part 2 | Question: 41
The testing of software against $\text{SRS}$ is called : Acceptance testing Integration testing Regression testing Series testing
The testing of software against $\text{SRS}$ is called :Acceptance testingIntegration testingRegression testingSeries testing
go_editor
679
views
go_editor
asked
Mar 27, 2020
Others
ugcnetcse-dec2005-paper2
+
–
0
votes
1
answer
12
UGC NET CSE | December 2005 | Part 2 | Question: 42
The lower degree of cohesion is : logical cohesion coincidential cohesion procedural cohesion communicational cohesion
The lower degree of cohesion is :logical cohesioncoincidential cohesionprocedural cohesioncommunicational cohesion
go_editor
291
views
go_editor
asked
Mar 27, 2020
Others
ugcnetcse-dec2005-paper2
+
–
0
votes
1
answer
13
UGC NET CSE | December 2005 | Part 2 | Question: 43
The Reliability of the software is directly dependent upon : Quality of the design Programmer's experience Number of error Set of user requirements
The Reliability of the software is directly dependent upon :Quality of the designProgrammer's experienceNumber of errorSet of user requirements
go_editor
201
views
go_editor
asked
Mar 27, 2020
Others
ugcnetcse-dec2005-paper2
+
–
0
votes
2
answers
14
UGC NET CSE | December 2005 | Part 2 | Question: 44
Succesive layer of design in software using but ton-up design is called : Layer of Definement Layer of Construction Layer of abstraction None of the above
Succesive layer of design in software using but ton-up design is called :Layer of DefinementLayer of ConstructionLayer of abstractionNone of the above
go_editor
559
views
go_editor
asked
Mar 27, 2020
Others
ugcnetcse-dec2005-paper2
+
–
0
votes
1
answer
15
UGC NET CSE | December 2005 | Part 2 | Question: 45
Sliding window concept of software project management is : Preparation of comprehenciable plan Preparation of the various stages of development Ad-hoc planning Requirement analysis
Sliding window concept of software project management is :Preparation of comprehenciable planPreparation of the various stages of developmentAd-hoc planningRequirement an...
go_editor
471
views
go_editor
asked
Mar 27, 2020
Others
ugcnetcse-dec2005-paper2
+
–
0
votes
0
answers
16
UGC NET CSE | December 2005 | Part 2 | Question: 46
Which of the following transonission media is used in Blue tooth Technology : Radio links Microwave links $\text{VSAT}$ Communication Fiber - optic
Which of the following transonission media is used in Blue tooth Technology :Radio linksMicrowave links$\text{VSAT}$ CommunicationFiber - optic
go_editor
171
views
go_editor
asked
Mar 27, 2020
Others
ugcnetcse-dec2005-paper2
+
–
0
votes
1
answer
17
UGC NET CSE | December 2005 | Part 2 | Question: 47
Which of the following is a $\text{EDI}$ standard ? $\text{ANSI X.15}$ $\text{ANSI X.14}$ $\text{ANSI X.13}$ $\text{ANSI X.12}$
Which of the following is a $\text{EDI}$ standard ?$\text{ANSI X.15}$$\text{ANSI X.14}$$\text{ANSI X.13}$$\text{ANSI X.12}$
go_editor
233
views
go_editor
asked
Mar 27, 2020
Others
ugcnetcse-dec2005-paper2
+
–
0
votes
1
answer
18
UGC NET CSE | December 2005 | Part 2 | Question: 48
Analysis of large database to retrive information is called : $\text{OLTP}$ $\text{OLAP}$ $\text{OLDP}$ $\text{TLPP}$
Analysis of large database to retrive information is called :$\text{OLTP}$$\text{OLAP}$$\text{OLDP}$$\text{TLPP}$
go_editor
309
views
go_editor
asked
Mar 27, 2020
Others
ugcnetcse-dec2005-paper2
+
–
0
votes
0
answers
19
UGC NET CSE | December 2005 | Part 2 | Question: 49
The cost of the network is usually determined by : Time complexity Switching complexity Circuit complexity None of these
The cost of the network is usually determined by :Time complexitySwitching complexityCircuit complexityNone of these
go_editor
382
views
go_editor
asked
Mar 27, 2020
Others
ugcnetcse-dec2005-paper2
+
–
0
votes
1
answer
20
UGC NET CSE | December 2005 | Part 2 | Question: 50
The mechanism with which several uses can share a medium without interference is : Frequency modulation Amplitude modulation Multiplexing None of these
The mechanism with which several uses can share a medium without interference is :Frequency modulationAmplitude modulationMultiplexingNone of these
go_editor
301
views
go_editor
asked
Mar 27, 2020
Others
ugcnetcse-dec2005-paper2
+
–
0
votes
1
answer
21
UGC NET CSE | December 2005 | Part 2 | Question: 1
$T$ is a graph with n vertices. $T$ is connected and has exactly $n-1$ edges, then : $T$ is a tree $T$ contains no cycles Every pairs of vertices in $T$ is connected by exactly one path All of these
$T$ is a graph with n vertices. $T$ is connected and has exactly $n-1$ edges, then :$T$ is a tree$T$ contains no cyclesEvery pairs of vertices in $T$ is connected by exac...
go_editor
336
views
go_editor
asked
Mar 27, 2020
Others
ugcnetcse-dec2005-paper2
+
–
0
votes
0
answers
22
UGC NET CSE | December 2005 | Part 2 | Question: 2
If the proposition $7P\Rightarrow Q$ is true, then the truth value of the proportion $7PV \left ( P \Rightarrow Q \right )$ is : True Multi – Valued False Can not determined
If the proposition $7P\Rightarrow Q$ is true, then the truth value of the proportion $7PV \left ( P \Rightarrow Q \right )$ is :TrueMulti – ValuedFalseCan not determine...
go_editor
252
views
go_editor
asked
Mar 27, 2020
Others
ugcnetcse-dec2005-paper2
+
–
0
votes
1
answer
23
UGC NET CSE | December 2005 | Part 2 | Question: 3
Let $A$ and $B$ be two arbitrary events, then : $P\left ( A\cap B \right )= P\left ( A \right )P\left ( B \right )$ $P\left ( P\cup B \right )= P\left ( A \right ) + P\left ( B \right )$ $P\left ( A\cup B \right )\leq P\left ( A \right ) + P\left ( B \right )$ $P\left ( A/ B \right )=P\left ( A\cap B \right )+P\left ( B \right )$
Let $A$ and $B$ be two arbitrary events, then :$P\left ( A\cap B \right )= P\left ( A \right )P\left ( B \right )$$P\left ( P\cup B \right )= P\left ( A \right ) + P\left...
go_editor
276
views
go_editor
asked
Mar 27, 2020
Others
ugcnetcse-dec2005-paper2
+
–
0
votes
2
answers
24
UGC NET CSE | December 2005 | Part 2 | Question: 4
Which sentence can be generated by $S\rightarrow d/bA, A\rightarrow d/ccA$ : $\text{bccddd}$ $\text{aabccd}$ $\text{ababccd}$ $\text{abbbd}$
Which sentence can be generated by $S\rightarrow d/bA, A\rightarrow d/ccA$ :$\text{bccddd}$$\text{aabccd}$$\text{ababccd}$$\text{abbbd}$
go_editor
417
views
go_editor
asked
Mar 27, 2020
Theory of Computation
ugcnetcse-dec2005-paper2
theory-of-computation
context-free-grammar
grammar
+
–
0
votes
2
answers
25
UGC NET CSE | December 2005 | Part 2 | Question: 5
Regular expression $a+b$ denotes the set : {$a$} {$\in, a, b$} {$a, b$} None of these
Regular expression $a+b$ denotes the set :{$a$}{$\in, a, b$}{$a, b$}None of these
go_editor
314
views
go_editor
asked
Mar 27, 2020
Theory of Computation
ugcnetcse-dec2005-paper2
theory-of-computation
regular-expression
+
–
0
votes
1
answer
26
UGC NET CSE | December 2005 | Part 2 | Question: 6
Which of the following is divisible by $4$? $100101100$ $1110001110001$ $11110011$ $10101010101010$
Which of the following is divisible by $4$?$100101100$$1110001110001$$11110011$$10101010101010$
go_editor
711
views
go_editor
asked
Mar 27, 2020
Digital Logic
ugcnetcse-dec2005-paper2
digital-logic
number-system
+
–
0
votes
1
answer
27
UGC NET CSE | December 2005 | Part 2 | Question: 7
A half-adder is also known as : $\text{AND}$ Circuit $\text{NAND}$ Circuit $\text{NOR}$ Circuit $\text{EX-OR}$ Circuit
A half-adder is also known as :$\text{AND}$ Circuit$\text{NAND}$ Circuit$\text{NOR}$ Circuit$\text{EX-OR}$ Circuit
go_editor
917
views
go_editor
asked
Mar 27, 2020
Digital Logic
ugcnetcse-dec2005-paper2
combinational-circuit
adder
+
–
0
votes
1
answer
28
UGC NET CSE | December 2005 | Part 2 | Question: 8
Consider the following sequence of instructions : $a= a \oplus b, b= a \oplus b, a= b \oplus a$ This Sequence retains the value of the $a$ and $b$ complements the value of $a$ and $b$ swap $a$ and $b$ negates values of $a$ and $b$
Consider the following sequence of instructions : $a= a \oplus b, b= a \oplus b, a= b \oplus a$ This Sequenceretains the value of the $a$ and $b$complements the value of...
go_editor
1.0k
views
go_editor
asked
Mar 27, 2020
Others
ugcnetcse-dec2005-paper2
+
–
0
votes
1
answer
29
UGC NET CSE | December 2005 | Part 2 | Question: 9
Consider the following circuit : to make it a Tautology the $?$ should be : $\text{NAND}$ gate $\text{AND}$ gate $\text{OR}$ gate $\text{EX-OR}$ gate
Consider the following circuit :to make it a Tautology the $?$ should be :$\text{NAND}$ gate$\text{AND}$ gate$\text{OR}$ gate$\text{EX-OR}$ gate
go_editor
885
views
go_editor
asked
Mar 27, 2020
Others
ugcnetcse-dec2005-paper2
+
–
0
votes
1
answer
30
UGC NET CSE | December 2005 | Part 2 | Question: 10
When an inventor is placed between both inputs of an $\text{S-R}$ flip flop, the resulting flip flop is : $JK$ flip-flop $D$ flip-flop $T$ flip-flop None of these
When an inventor is placed between both inputs of an $\text{S-R}$ flip flop, the resulting flip flop is :$JK$ flip-flop$D$ flip-flop$T$ flip-flopNone of these
go_editor
334
views
go_editor
asked
Mar 27, 2020
Digital Logic
ugcnetcse-dec2005-paper2
digital-logic
flip-flop
+
–
Page:
1
2
next »
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register