Register
Filter

Answers by LeenSharma

23 votes
211
ISRO2016-8
The minimum Boolean expression for the following circuit is $\text{AB + AC + BC}$ $\text{A + BC}$ $\text{A + B}$ $\text{A + B + C}$
The minimum Boolean expression for the following circuit is$\text{AB + AC + BC}$$\text{A + BC}$$\text{A + B}$$\text{A + B + C}$
8 votes
213
UGC NET CSE | June 2012 | Part 2 | Question: 50
To represent hierarchical relationship between elements, which data structure is suitable? Dequeue Priority Tree All of the above
To represent hierarchical relationship between elements, which data structure is suitable?DequeuePriorityTreeAll of the above
2 votes
214
UGC NET CSE | June 2012 | Part 2 | Question: 38
printf(“%c”, 100); prints 100 prints ASCII equivalent of 100 prints garbage None of the above
printf(“%c”, 100);prints 100prints ASCII equivalent of 100prints garbageNone of the above
6 votes
215
UGC NET CSE | June 2012 | Part 2 | Question: 49
Which of the following data structure is linear type? Strings Lists Queues All of the above
Which of the following data structure is linear type?StringsListsQueuesAll of the above
1 votes
216
UGC NET CSE | June 2012 | Part 2 | Question: 35
If an integer needs two bytes of storage, then the maximum value of signed integer is $2^{16}-1$ $2^{15}-1$ $2^{16}$ $2^{15}$
If an integer needs two bytes of storage, then the maximum value of signed integer is$2^{16}-1$$2^{15}-1$$2^{16}$$2^{15}$
4 votes
217
UGC NET CSE | June 2012 | Part 2 | Question: 33
Consider the following page trace: 4,3,2,1,4,3,5,4,3,2,1,5 Percentage of page fault that would occur if FIFO page replacement algorithm is used with number of frames for the JOB m=4 will be 8 9 10 12
Consider the following page trace:4,3,2,1,4,3,5,4,3,2,1,5Percentage of page fault that would occur if FIFO page replacement algorithm is used with number of frames for th...
1 votes
219
UGC NET CSE | June 2012 | Part 2 | Question: 30
In round robin CPU scheduling as time quantum is increased the average turn around time increases decreases remains constant varies irregularly
In round robin CPU scheduling as time quantum is increased the average turn around timeincreasesdecreasesremains constantvaries irregularly
3 votes
221
UGC NET CSE | June 2012 | Part 2 | Question: 25
Which of the following metric does not depend on the programming language used? Line of code Function count Member of token All of the above
Which of the following metric does not depend on the programming language used?Line of codeFunction countMember of tokenAll of the above
1 votes
224
UGC NET CSE | June 2014 | Part 3 | Question: 10
Code blocks allow many algorithms to be implemented with the following parameters : clarity, elegance, performance clarity, elegance, efficiency elegance, performance, execution execution, clarity, performance
Code blocks allow many algorithms to be implemented with the following parameters :clarity, elegance, performance clarity, elegance, efficiencyelegance, performance, exec...
1 votes
226
UGC NET CSE | June 2014 | Part 3 | Question: 05
Which of the following color models are defined with three primary colors ? RGB and HSV color models CMY and HSV color models HSV and HLS color models RGB and CMY color models
Which of the following color models are defined with three primary colors ? RGB and HSV color modelsCMY and HSV color modelsHSV and HLS color modelsRGB and CMY color mode...
3 votes
227
Discrete Mathematics Imortant question
Obtain the principal disjunctive normal form of q ∨ ( p ∧ ¬ q )
Obtain the principal disjunctive normal form ofq ∨ ( p ∧ ¬ q )
3 votes
228
Discrete MAthematics Kenneth Book ImPortant question
Let P(x) denote the statement "x < 4." What are these truth values? a) P(0) b) P(4) c)P(6)
Let P(x) denote the statement "x < 4."What are these truth values? a) P(0) b) P(4) c)P(6)
18 votes
229
ISRO2016-47
A system has 3 processes sharing 4 resources. If each process needs a maximum of 2 units, then Deadlock can never occur Deadlock may occur Deadlock has to occur None of these
A system has 3 processes sharing 4 resources. If each process needs a maximum of 2 units, thenDeadlock can never occurDeadlock may occurDeadlock has to occurNone of these...
15 votes
232
ISRO2016-4
If $(\text{G} , .)$ is a group such that $(ab)^{-1}=a^{-1}b^{-1},\forall a,b \in \text{G},$ then $\text{G}$ is a/an Commutative semi group Abelian group Non-abelian group None of these
If $(\text{G} , .)$ is a group such that $(ab)^{-1}=a^{-1}b^{-1},\forall a,b \in \text{G},$ then $\text{G}$ is a/anCommutative semi groupAbelian groupNon-abelian groupNon...
3 votes
233
UGC NET CSE | June 2012 | Part 2 | Question: 5
Networks that use different technologies can be connected by using Packets Switches Bridges Routers
Networks that use different technologies can be connected by usingPacketsSwitchesBridgesRouters
4 votes
234
UGC NET CSE | June 2012 | Part 2 | Question: 2
The post order traversal of a binary tree is DEBFCA. Find out the pre-order traversal ABFCDE ADBFEC ABDECF None of the above
The post order traversal of a binary tree is DEBFCA. Find out the pre-order traversalABFCDEADBFECABDECFNone of the above
13 votes
236
ISRO2016-80
When a DNS server accepts and uses incorrect information from a host that has no authority giving that information, then it is called DNS lookup DNS hijacking DNS spoofing None of the mentioned
When a DNS server accepts and uses incorrect information from a host that has no authority giving that information, then it is calledDNS lookupDNS hijackingDNS spoofingNo...
6 votes
239
ISRO2016-69
In Ethernet CSMA/CD, the special bit sequence transmitted by media access management to handle collision is called Preamble Postamble Jam None of these
In Ethernet CSMA/CD, the special bit sequence transmitted by media access management to handle collision is calledPreamblePostambleJamNone of these
2 votes
240
ISRO2016-18
The functional difference between $SR$ flip-flop and $J$-$K$ flip-flop is that : $J$-$K$ flip-flop is faster than $SR$ flip-flop $J$-$K$ flip-flop has a feedback path $J$-$K$ flip-flop accepts both inputs $1$ None of them
The functional difference between $SR$ flip-flop and $J$-$K$ flip-flop is that :$J$-$K$ flip-flop is faster than $SR$ flip-flop$J$-$K$ flip-flop has a feedback path$J$-$K...
Page: