Dark Mode

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

go_editor asked in Others Mar 27, 2020

383 views

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

go_editor asked in Compiler Design Mar 27, 2020

388 views

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

go_editor asked in Others Mar 27, 2020

2.1k views

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

go_editor asked in DS Mar 27, 2020

423 views

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

go_editor asked in Compiler Design Mar 27, 2020

471 views

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

go_editor asked in Others Mar 27, 2020

2.6k views

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

go_editor asked in Others Mar 27, 2020

400 views

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

go_editor asked in Others Mar 27, 2020

402 views

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

go_editor asked in Others Mar 27, 2020

481 views

1 vote

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

go_editor asked in Operating System Mar 27, 2020

850 views

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

go_editor asked in Others Mar 27, 2020

637 views

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

go_editor asked in Others Mar 27, 2020

280 views

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

go_editor asked in Others Mar 27, 2020

196 views

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

go_editor asked in Others Mar 27, 2020

527 views

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

go_editor asked in Others Mar 27, 2020

457 views

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

go_editor asked in Others Mar 27, 2020

163 views

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}$

go_editor asked in Others Mar 27, 2020

226 views

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}$

go_editor asked in Others Mar 27, 2020

298 views

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

go_editor asked in Others Mar 27, 2020

368 views

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

go_editor asked in Others Mar 27, 2020

293 views

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

go_editor asked in Others Mar 27, 2020

318 views

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

go_editor asked in Others Mar 27, 2020

248 views

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 )$

go_editor asked in Others Mar 27, 2020

269 views

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}$

go_editor asked in Theory of Computation Mar 27, 2020

399 views

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

go_editor asked in Theory of Computation Mar 27, 2020

304 views

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$

go_editor asked in Digital Logic Mar 27, 2020

692 views

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

go_editor asked in Digital Logic Mar 27, 2020

838 views

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$

go_editor asked in Others Mar 27, 2020

951 views

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

go_editor asked in Others Mar 27, 2020

833 views

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

go_editor asked in Digital Logic Mar 27, 2020

318 views

Page:

Recent questions tagged ugcnetcse-dec2005-paper2